Alphabeta Math
DefinitionDefinition: AI-adaptedProof: Not applicableSession-authored (Fable 5 assisted)judge pass (z-ai/glm-5.2)audited 2026-07-27
How statement and proof provenance work

The first chip identifies the source of the statement or construction; the second identifies the source of its local proof or verification.

  • Literature-sourced — the exact statement appears in a cited source; only wording and notation differ.
  • AI-adapted — a semantically identical restatement of literature-sourced material, modulo indexing, notation, and boundary cases adopted by the library.
  • AI-generated — a genuinely novel statement formulated by AI, with no source for the claim itself.

These labels describe origin, not correctness: citations and verification chips remain separate evidence.

Powers gng^{n}: natural exponents in a monoid and integer exponents in a group, with g0=eg^{0} = e

Definition

Natural exponents, in a monoid. Let (M,,e)(M,\cdot,e) be a monoid (Semigroup and monoid) and gMg \in M. By the recursion theorem (The recursion theorem), applied with the set MM, the element ee and the function xxgx \mapsto x \cdot g from MM to MM, there is exactly one function NM\mathbb{N} \to M, written ngnn \mapsto g^{n}, with

g0=e,gσ(n)=gng(nN).g^{0} = e, \qquad g^{\sigma(n)} = g^{n} \cdot g \quad (n \in \mathbb{N}).

In particular g0=eg^{0} = e for every gg, including g=eg = e, and g1=gσ(0)=eg=gg^{1} = g^{\sigma(0)} = e \cdot g = g. Since N\mathbb{N} contains 00 (The natural numbers N\mathbb{N} (von Neumann)), the exponent 00 is a genuine value of the definition and not a separate convention.

Integer exponents, in a group. Let GG be a group (Group and abelian group) and gGg \in G. Write ι:NZ\iota : \mathbb{N} \to \mathbb{Z} for the embedding ι(k)=[(k,0)]\iota(k) = [(k,0)] of The naturals embed in the integers, which is injective, preserves addition, multiplication and order, and has as image exactly the nonnegative integers. For xZx \in \mathbb{Z} define

  • gx:=gkg^{x} := g^{k}, the natural power, when 0x0 \le x and x=ι(k)x = \iota(k);
  • gx:=(gk)1g^{x} := (g^{k})^{-1} when x<0x < 0 and x=ι(k)-x = \iota(k).

Why this is well defined. The order on Z\mathbb{Z} is total and antisymmetric (The integers form a totally ordered ring, Order on the integers), so exactly one of 0x0 \le x and x<0x < 0 holds and the two clauses never both apply. In the first clause xx is nonnegative, so x=ι(k)x = \iota(k) for some kNk \in \mathbb{N}, and kk is unique because ι\iota is injective. In the second clause x<0x < 0 gives 0=x+(x)<0+(x)=x0 = x + (-x) < 0 + (-x) = -x by compatibility of the order with addition (The integers form a totally ordered ring, Arithmetic on the integers), so x-x is a positive integer and again x=ι(k)-x = \iota(k) for a unique kk. The inverse (gk)1(g^{k})^{-1} is a single determined element by In a monoid, a left inverse and a right inverse of the same element are equal; hence an invertible element has exactly one inverse, and it is two-sided and Left inverse, right inverse, and invertible element of a monoid. Finally the two readings of gι(k)g^{\iota(k)}, as a natural power and as an integer power, agree by construction, so no ambiguity is introduced.

Abbreviation. In an exponent we write kk for the integer ι(k)\iota(k) when a natural number kk is used where an integer is expected; this is unambiguous because ι\iota is injective and preserves the arithmetic and the order, and because the two readings of gkg^{k} agree as just noted.

Additive notation. When the group is written additively the same object is written ngn g or ngn \cdot g rather than gng^{n}, with 0g=00 g = 0 and σ(n)g=ng+g\sigma(n) g = n g + g; the definitions are identical, only the symbols differ.

Remarks

Depends on

Used by

…and 8 more results.

Dependency tree · next 3 levels

Direct dependencies and their dependencies through the next three levels: 52 results over 17 levels. An arrow runs from a result to what uses it, and this result sits at the bottom with a heavier outline. Click the chart to enlarge it.

Sources