Alphabeta Math
LemmaStatement: AI-adaptedProof: AI-generatedSession-authored (Fable 5 assisted)precheck passjudge 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.

Exponent laws in a group: gm+n=gmgng^{m+n} = g^{m}g^{n} and (gm)n=gmn(g^{m})^{n} = g^{mn} for all m,nZm, n \in \mathbb{Z}, and (gh)n=gnhn(gh)^{n} = g^{n}h^{n} when gg and hh commute

Statement

Let GG be a group (Group and abelian group) with identity ee, let g,hGg, h \in G, and let powers be as in Powers gng^{n}: natural exponents in a monoid and integer exponents in a group, with g0=eg^{0} = e. For all m,nZm, n \in \mathbb{Z}:

  1. gm+n=gmgng^{m+n} = g^{m} g^{n};
  2. gm=(gm)1g^{-m} = (g^{m})^{-1};
  3. (gm)n=gmn(g^{m})^{n} = g^{mn};
  4. gmgn=gngmg^{m} g^{n} = g^{n} g^{m}: any two powers of one element commute;
  5. if gh=hggh = hg then (gh)n=gnhn(gh)^{n} = g^{n} h^{n}.

Claim 5 is false in general without its hypothesis: in a group in which gg and hh do not commute the equation can fail already at n=2n = 2, and a witness is recorded on the companion page.

Claims 1 and 3 hold in any monoid (Semigroup and monoid) for exponents in N\mathbb{N}, and so does claim 5 for exponents in N\mathbb{N} under the same commuting hypothesis; only the extension to negative exponents needs inverses.

Facts & Assumptions

Given: A group GG with identity ee and elements g,hGg, h \in G; powers gng^{n} for nNn \in \mathbb{N} defined by g0=eg^{0} = e and gσ(n)=gngg^{\sigma(n)} = g^{n} g, and gxg^{x} for xZx \in \mathbb{Z} defined by gι(k)=gkg^{\iota(k)} = g^{k} and gι(k)=(gk)1g^{-\iota(k)} = (g^{k})^{-1} for ι(k)>0\iota(k) > 0 (Powers gng^{n}: natural exponents in a monoid and integer exponents in a group, with g0=eg^{0} = e). Throughout, ι:NZ\iota : \mathbb{N} \to \mathbb{Z} is the embedding of The naturals embed in the integers, and a natural number written where an integer is expected means its image under ι\iota.

[L1]

Induction on N\mathbb{N} (The principle of mathematical induction).

[L2]

The group laws: associativity, the two-sided identity ee, and two-sided inverses (Group and abelian group, Semigroup and monoid).

[L3]

(uv)1=v1u1(uv)^{-1} = v^{-1}u^{-1}, (u1)1=u(u^{-1})^{-1} = u and e1=ee^{-1} = e in a group (In a group e1=ee^{-1} = e, (g1)1=g(g^{-1})^{-1} = g and (gh)1=h1g1(gh)^{-1} = h^{-1}g^{-1}, the order of the last product being essential).

[L4]

ι\iota is injective, preserves addition, multiplication and order, and its image is exactly the set of nonnegative integers; ι(0)=0\iota(0) = 0 and ι(1)=1\iota(1) = 1 (The naturals embed in the integers, Arithmetic on the integers).

[L5]

Z\mathbb{Z} is a commutative ring: addition and multiplication are associative and commutative, x+0=xx + 0 = x, x1=xx \cdot 1 = x, multiplication distributes over addition, and every xx has an additive inverse x-x (The integers form a commutative ring, Arithmetic on the integers); every integer is [(a,b)][(a,b)] for naturals a,ba, b, and then [(a,b)]=ι(a)ι(b)[(a,b)] = \iota(a) - \iota(b) (The integers as equivalence classes of pairs of naturals).

[L6]

The order on Z\mathbb{Z} is total and compatible with addition, so exactly one of 0x0 \le x, x<0x < 0 holds, and x<0x < 0 implies 0<x0 < -x (The integers form a totally ordered ring, Order on the integers).

[L7]

On N\mathbb{N}: addition satisfies m+0=mm + 0 = m and m+σ(n)=σ(m+n)m + \sigma(n) = \sigma(m+n), so σ(n)=n+1\sigma(n) = n + 1 (Addition of natural numbers, The natural numbers N\mathbb{N} (von Neumann)); it is commutative (Addition is commutative); mnm \le n means m+k=nm + k = n for some kk (Order on the natural numbers); and exactly one of a<ba < b, a=ba = b, b<ab < a holds (Trichotomy of the order on N\mathbb{N}).

Proof

technique · induction
1.1

Natural exponents, base of claim 1: for every mNm \in \mathbb{N}, gm+0=gm=gme=gmg0g^{m+0} = g^{m} = g^{m} e = g^{m} g^{0}.

basegivenL2L7
1.2

Natural exponents, inductive hypothesis for claim 1: fix nNn \in \mathbb{N} and assume gm+n=gmgng^{m+n} = g^{m} g^{n} for every mNm \in \mathbb{N} and every gg.

ih
1.3

Suppose gh=hggh = hg; base of the commuting sub-claim: gh0=ge=eg=h0gg h^{0} = g e = e g = h^{0} g.

basegivenL2
1.4

Inductive hypothesis of the commuting sub-claim: assume ghn=hngg h^{n} = h^{n} g.

ih
1.5

Base of claim 5 for natural exponents: (gh)0=e=ee=g0h0(gh)^{0} = e = e \cdot e = g^{0} h^{0}.

basegivenL2
1.6

Inductive hypothesis of claim 5 for natural exponents: assume gh=hggh = hg and (gh)n=gnhn(gh)^{n} = g^{n} h^{n}.

ih
1.7

If uv=vuuv = vu in GG then uv1=v1uu v^{-1} = v^{-1} u: multiplying uv=vuuv = vu on the left and on the right by v1v^{-1} gives v1(uv)v1=v1(vu)v1v^{-1}(uv)v^{-1} = v^{-1}(vu)v^{-1}, and regrouping both sides gives v1u=uv1v^{-1} u = u v^{-1}. Consequently u1v1=(vu)1=(uv)1=v1u1u^{-1} v^{-1} = (vu)^{-1} = (uv)^{-1} = v^{-1} u^{-1}.

L2L3
1.8

Claim 2 for a nonnegative exponent. If k=0k = 0 then ι(0)=0-\iota(0) = 0, so gι(0)=g0=eg^{-\iota(0)} = g^{0} = e and (g0)1=e1=e(g^{0})^{-1} = e^{-1} = e. If k0k \ne 0 then 0<ι(k)0 < \iota(k) because ι\iota preserves the order, so ι(k)<0-\iota(k) < 0 and the second clause of the definition gives gι(k)=(gk)1g^{-\iota(k)} = (g^{k})^{-1} directly.

givenL3L4L6
1.9

Claim 3 for a nonnegative second exponent, base: (gx)0=e=g0=gx0(g^{x})^{0} = e = g^{0} = g^{x \cdot 0}, since x0=0x \cdot 0 = 0 in Z\mathbb{Z}.

basegivenL5
1.10

Claim 3 for a nonnegative second exponent, inductive hypothesis: assume (gx)ι(n)=gxι(n)(g^{x})^{\iota(n)} = g^{x \iota(n)} for this nNn \in \mathbb{N} and every xZx \in \mathbb{Z}.

ih
2.1

Successor step for claim 1 with natural exponents: gm+σ(n)=gσ(m+n)=gm+ng=(gmgn)g=gm(gng)=gmgσ(n)g^{m+\sigma(n)} = g^{\sigma(m+n)} = g^{m+n} g = (g^{m} g^{n}) g = g^{m}(g^{n} g) = g^{m} g^{\sigma(n)}; by induction, gm+n=gmgng^{m+n} = g^{m} g^{n} for all m,nNm, n \in \mathbb{N}, in any monoid.

step 1.2givenL1L2L7
2.2

Successor step for the commuting sub-claim: ghσ(n)=g(hnh)=(ghn)h=(hng)h=hn(gh)=hn(hg)=(hnh)g=hσ(n)gg h^{\sigma(n)} = g(h^{n} h) = (g h^{n})h = (h^{n} g)h = h^{n}(gh) = h^{n}(hg) = (h^{n} h)g = h^{\sigma(n)} g; by induction ghn=hngg h^{n} = h^{n} g for every nNn \in \mathbb{N} whenever gh=hggh = hg.

step 1.3step 1.4givenL1L2
2.3

Claim 2 in general. If 0x0 \le x then x=ι(k)x = \iota(k) and step 1.8 gives gx=(gk)1=(gx)1g^{-x} = (g^{k})^{-1} = (g^{x})^{-1}. If x<0x < 0 then 0<x0 < -x, so x=ι(k)-x = \iota(k) and by definition gx=(gk)1g^{x} = (g^{k})^{-1}, whence (gx)1=gk=gx(g^{x})^{-1} = g^{k} = g^{-x}. This is claim 2.

step 1.8givenL3L4L6
3.1

Successor step for claim 5 with natural exponents: assuming gh=hggh = hg, (gh)σ(n)=(gh)n(gh)=(gnhn)(gh)=gn((hng)h)=gn((ghn)h)=(gng)(hnh)=gσ(n)hσ(n)(gh)^{\sigma(n)} = (gh)^{n}(gh) = (g^{n} h^{n})(gh) = g^{n}((h^{n} g)h) = g^{n}((g h^{n})h) = (g^{n} g)(h^{n} h) = g^{\sigma(n)} h^{\sigma(n)}, the fourth equality being step 2.2 applied to gg and hnh^{n}; by induction (gh)n=gnhn(gh)^{n} = g^{n} h^{n} for every nNn \in \mathbb{N}.

step 1.5step 1.6step 2.2givenL1L2
3.2

Normal form. Let xZx \in \mathbb{Z} and write x=ι(a)ι(b)x = \iota(a) - \iota(b) with a,bNa, b \in \mathbb{N}, possible since x=[(a,b)]x = [(a,b)] for some naturals. Then gx=ga(gb)1g^{x} = g^{a}(g^{b})^{-1}. Indeed, by trichotomy either bab \le a, say a=b+ca = b + c, in which case x=ι(c)x = \iota(c) and ga(gb)1=(gbgc)(gb)1=(gcgb)(gb)1=gc=gxg^{a}(g^{b})^{-1} = (g^{b} g^{c})(g^{b})^{-1} = (g^{c} g^{b})(g^{b})^{-1} = g^{c} = g^{x}, using step 2.1 twice together with commutativity of addition on N\mathbb{N}; or a<ba < b, say b=a+cb = a + c with c0c \ne 0, in which case x=ι(c)x = -\iota(c) and ga(gb)1=ga(gagc)1=ga((gc)1(ga)1)=((gc)1ga)(ga)1=(gc)1=gxg^{a}(g^{b})^{-1} = g^{a}(g^{a} g^{c})^{-1} = g^{a}\bigl((g^{c})^{-1}(g^{a})^{-1}\bigr) = \bigl((g^{c})^{-1} g^{a}\bigr)(g^{a})^{-1} = (g^{c})^{-1} = g^{x}, the third equality using step 1.7 with u=gau = g^{a} and v=gcv = g^{c}, which commute by step 2.1.

step 1.7step 2.1step 1.8givenL2L3L4L5L7
4.1

Claim 1 for integer exponents. Write x=ι(a)ι(b)x = \iota(a) - \iota(b) and y=ι(c)ι(d)y = \iota(c) - \iota(d), so x+y=ι(a+c)ι(b+d)x + y = \iota(a+c) - \iota(b+d). By step 3.2 and step 2.1, gx+y=ga+c(gb+d)1=(gagc)(gbgd)1=(gagc)((gd)1(gb)1)g^{x+y} = g^{a+c}(g^{b+d})^{-1} = (g^{a} g^{c})(g^{b} g^{d})^{-1} = (g^{a} g^{c})\bigl((g^{d})^{-1}(g^{b})^{-1}\bigr). On the other side gxgy=(ga(gb)1)(gc(gd)1)=(gagc)((gb)1(gd)1)g^{x} g^{y} = \bigl(g^{a}(g^{b})^{-1}\bigr)\bigl(g^{c}(g^{d})^{-1}\bigr) = (g^{a} g^{c})\bigl((g^{b})^{-1}(g^{d})^{-1}\bigr), moving (gb)1(g^{b})^{-1} past gcg^{c} by step 1.7, since gbg^{b} and gcg^{c} commute by step 2.1. Finally (gb)1(gd)1=(gd)1(gb)1(g^{b})^{-1}(g^{d})^{-1} = (g^{d})^{-1}(g^{b})^{-1} by step 1.7 again, so the two sides agree.

step 1.7step 2.1step 3.2L2L3L4L5
4.2

Claim 5 for a negative exponent: assume gh=hggh = hg and let n<0n < 0, so n=ι(k)-n = \iota(k) with kNk \in \mathbb{N}. Then (gh)n=((gh)n)1=(gkhk)1=(hk)1(gk)1=hngn(gh)^{n} = \bigl((gh)^{-n}\bigr)^{-1} = (g^{k} h^{k})^{-1} = (h^{k})^{-1}(g^{k})^{-1} = h^{n} g^{n} by claim 2 and step 3.1; and gkg^{k} and hkh^{k} commute, by step 2.2 applied twice, so their inverses commute by step 1.7, giving hngn=gnhnh^{n} g^{n} = g^{n} h^{n}. With step 3.1 this proves claim 5 for every nZn \in \mathbb{Z}.

step 1.7step 2.2step 3.1step 2.3L3L6
5.1

Claim 4. By claim 1 and commutativity of addition in Z\mathbb{Z}, gxgy=gx+y=gy+x=gygxg^{x} g^{y} = g^{x+y} = g^{y+x} = g^{y} g^{x}.

step 4.1L5
5.2

Claim 3, successor step: (gx)σ(n)=(gx)ngx=gxι(n)gx=gxι(n)+x=gx(ι(n)+1)=gxι(σ(n))(g^{x})^{\sigma(n)} = (g^{x})^{n} g^{x} = g^{x\iota(n)} g^{x} = g^{x\iota(n) + x} = g^{x(\iota(n) + 1)} = g^{x \iota(\sigma(n))}, using the hypothesis, then claim 1, then distributivity in Z\mathbb{Z}, then ι(σ(n))=ι(n+1)=ι(n)+1\iota(\sigma(n)) = \iota(n+1) = \iota(n) + 1. By induction, (gx)y=gxy(g^{x})^{y} = g^{xy} for every xZx \in \mathbb{Z} and every y0y \ge 0. When x=ι(m)x = \iota(m) is itself nonnegative the two exponents xι(n)x\iota(n) and xx occurring here are nonnegative as well, so the appeal to claim 1 is an appeal to its monoid form, step 2.1, and the computation uses no inverse; that is the natural-exponent case, valid in any monoid.

step 4.1step 2.1step 1.9step 1.10givenL1L4L5L7
6.1

Claim 3 for a negative second exponent: let y<0y < 0, so 0<y0 < -y. Applying claim 2 to the element gxg^{x} gives (gx)y=((gx)y)1(g^{x})^{y} = \bigl((g^{x})^{-y}\bigr)^{-1}, which by step 5.2 equals (gx(y))1=(g(xy))1=((gxy)1)1=gxy\bigl(g^{x(-y)}\bigr)^{-1} = \bigl(g^{-(xy)}\bigr)^{-1} = \bigl((g^{xy})^{-1}\bigr)^{-1} = g^{xy}, using claim 2 once more and then (u1)1=u(u^{-1})^{-1} = u. Together with step 5.2 this is claim 3.

step 2.3step 5.2L3L5L6
7.1

Claims 1 to 5 are established: claim 1 in step 4.1, claim 2 in step 2.3, claim 3 in step 6.1, claim 4 in step 5.1 and claim 5 in steps 3.1 and 4.2; the natural-exponent forms of claims 1, 3 and 5 are steps 2.1, 5.2 and 3.1, and use no inverses.

step 2.1step 3.1step 2.3step 4.1step 5.1step 5.2step 6.1step 4.2discharge-induction

Remarks

  • The commuting hypothesis in claim 5 is not a technicality. Without it the law fails, and the title of this item carries the hypothesis for that reason. The published Laws of integer exponents states the corresponding law without a hypothesis, and is correct because it is about a field, where multiplication is commutative by definition; nothing there transfers to a general group.

  • Where each law is really used. Claim 1 is what makes xgxx \mapsto g^{x} a homomorphism from (Z,+)(\mathbb{Z},+) and hence what makes cyclic subgroups behave; claim 4 is why every cyclic group is abelian (g={gn:nZ}\langle g \rangle = \{\, g^{n} : n \in \mathbb{Z} \,\}, and every cyclic group is abelian); claim 2 is what lets every statement about negative exponents be reduced to a statement about natural ones, which is how the case analysis above is kept finite.

  • The proof splits an arbitrary integer as ι(a)ι(b)\iota(a) - \iota(b) rather than by cases on its sign wherever possible. That is deliberate: the normal form of step 3.2 is proved once and then every integer identity is a computation with natural powers and inverses.

Depends on

Used by

Dependency tree · next 3 levels

Direct dependencies and their dependencies through the next three levels: 55 results over 19 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