Alphabeta Math
LemmaStatement: AI-adaptedProof: AI-generatedprecheck 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=gmgn and (gm)n=gmn for all m,n∈Z, and (gh)n=gnhn when g and h commute

Statement

Let G be a group (Group and abelian group) with identity e, let g,h∈G, and let powers be as in Powers gn: natural exponents in a monoid and integer exponents in a group, with g0=e. For all m,n∈Z:

  1. gm+n=gmgn;
  2. g−m=(gm)−1;
  3. (gm)n=gmn;
  4. gmgn=gngm: any two powers of one element commute;
  5. if gh=hg then (gh)n=gnhn.

Claim 5 is false in general without its hypothesis: in a group in which g and h do not commute the equation can fail already at n=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, and so does claim 5 for exponents in N under the same commuting hypothesis; only the extension to negative exponents needs inverses.

Facts & Assumptions

Given: A group G with identity e and elements g,h∈G; powers gn for n∈N defined by g0=e and gσ(n)=gng, and gx for x∈Z defined by gι(k)=gk and g−ι(k)=(gk)−1 for ι(k)>0 (Powers gn: natural exponents in a monoid and integer exponents in a group, with g0=e). Throughout, ι:N→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 ι.

[L2]

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

[L3]

(uv)−1=v−1u−1, (u−1)−1=u and e−1=e in a group (In a group e−1=e, (g−1)−1=g and (gh)−1=h−1g−1, the order of the last product being essential).

[L4]

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

[L5]

Z is a commutative ring: addition and multiplication are associative and commutative, x+0=x, x⋅1=x, multiplication distributes over addition, and every x has an additive inverse −x (The integers form a commutative ring, Arithmetic on the integers); every integer is [(a,b)] for naturals a,b, and then [(a,b)]=ι(a)−ι(b) (The integers as equivalence classes of pairs of naturals).

[L6]

The order on Z is total and compatible with addition, so exactly one of 0≤x, x<0 holds, and x<0 implies 0<−x (The integers form a totally ordered ring, Order on the integers).

[L7]

On N: addition satisfies m+0=m and m+σ(n)=σ(m+n), so σ(n)=n+1 (Addition of natural numbers, The natural numbers N (von Neumann)); it is commutative (Addition is commutative); m≤n means m+k=n for some k (Order on the natural numbers); and exactly one of a<b, a=b, b<a holds (Trichotomy of the order on N).

Proof

technique · induction
1.1

Natural exponents, base of claim 1: for every m∈N, gm+0=gm=gme=gmg0.

basegivenL2L7
1.2

Natural exponents, inductive hypothesis for claim 1: fix n∈N and assume gm+n=gmgn for every m∈N and every g.

ih
1.3

Suppose gh=hg; base of the commuting sub-claim: gh0=ge=eg=h0g.

basegivenL2
1.4

Inductive hypothesis of the commuting sub-claim: assume ghn=hng.

ih
1.5

Base of claim 5 for natural exponents: (gh)0=e=e⋅e=g0h0.

basegivenL2
1.6

Inductive hypothesis of claim 5 for natural exponents: assume gh=hg and (gh)n=gnhn.

ih
1.7

If uv=vu in G then uv−1=v−1u: multiplying uv=vu on the left and on the right by v−1 gives v−1(uv)v−1=v−1(vu)v−1, and regrouping both sides gives v−1u=uv−1. Consequently u−1v−1=(vu)−1=(uv)−1=v−1u−1.

L2L3
1.8

Claim 2 for a nonnegative exponent. If k=0 then −ι(0)=0, so g−ι(0)=g0=e and (g0)−1=e−1=e. If k≠0 then 0<ι(k) because ι preserves the order, so −ι(k)<0 and the second clause of the definition gives g−ι(k)=(gk)−1 directly.

givenL3L4L6
1.9

Claim 3 for a nonnegative second exponent, base: (gx)0=e=g0=gx⋅0, since x⋅0=0 in Z.

basegivenL5
1.10

Claim 3 for a nonnegative second exponent, inductive hypothesis: assume (gx)ι(n)=gxι(n) for this n∈N and every x∈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); by induction, gm+n=gmgn for all m,n∈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)g; by induction ghn=hng for every n∈N whenever gh=hg.

step 1.3step 1.4givenL1L2
2.3

Claim 2 in general. If 0≤x then x=ι(k) and step 1.8 gives g−x=(gk)−1=(gx)−1. If x<0 then 0<−x, so −x=ι(k) and by definition gx=(gk)−1, whence (gx)−1=gk=g−x. This is claim 2.

step 1.8givenL3L4L6
3.1

Successor step for claim 5 with natural exponents: assuming gh=hg, (gh)σ(n)=(gh)n(gh)=(gnhn)(gh)=gn((hng)h)=gn((ghn)h)=(gng)(hnh)=gσ(n)hσ(n), the fourth equality being step 2.2 applied to g and hn; by induction (gh)n=gnhn for every n∈N.

step 1.5step 1.6step 2.2givenL1L2
3.2

Normal form. Let x∈Z and write x=ι(a)−ι(b) with a,b∈N, possible since x=[(a,b)] for some naturals. Then gx=ga(gb)−1. Indeed, by trichotomy either b≤a, say a=b+c, in which case x=ι(c) and ga(gb)−1=(gbgc)(gb)−1=(gcgb)(gb)−1=gc=gx, using step 2.1 twice together with commutativity of addition on N; or a<b, say b=a+c with c≠0, in which case x=−ι(c) and ga(gb)−1=ga(gagc)−1=ga((gc)−1(ga)−1)=((gc)−1ga)(ga)−1=(gc)−1=gx, the third equality using step 1.7 with u=ga and v=gc, which commute by step 2.1.

step 1.7step 2.1step 1.8givenL2L3L4L5L7
4.1

Claim 1 for integer exponents. Write x=ι(a)−ι(b) and y=ι(c)−ι(d), so x+y=ι(a+c)−ι(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). On the other side gxgy=(ga(gb)−1)(gc(gd)−1)=(gagc)((gb)−1(gd)−1), moving (gb)−1 past gc by step 1.7, since gb and gc commute by step 2.1. Finally (gb)−1(gd)−1=(gd)−1(gb)−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=hg and let n<0, so −n=ι(k) with k∈N. Then (gh)n=((gh)−n)−1=(gkhk)−1=(hk)−1(gk)−1=hngn by claim 2 and step 3.1; and gk and hk commute, by step 2.2 applied twice, so their inverses commute by step 1.7, giving hngn=gnhn. With step 3.1 this proves claim 5 for every n∈Z.

step 1.7step 2.2step 3.1step 2.3L3L6
5.1

Claim 4. By claim 1 and commutativity of addition in Z, gxgy=gx+y=gy+x=gygx.

step 4.1L5
5.2

Claim 3, successor step: (gx)σ(n)=(gx)ngx=gxι(n)gx=gxι(n)+x=gx(ι(n)+1)=gxι(σ(n)), using the hypothesis, then claim 1, then distributivity in Z, then ι(σ(n))=ι(n+1)=ι(n)+1. By induction, (gx)y=gxy for every x∈Z and every y≥0. When x=ι(m) is itself nonnegative the two exponents xι(n) and x 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<0, so 0<−y. Applying claim 2 to the element gx gives (gx)y=((gx)−y)−1, which by step 5.2 equals (gx(−y))−1=(g−(xy))−1=((gxy)−1)−1=gxy, using claim 2 once more and then (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 x↦gx a homomorphism from (Z,+) and hence what makes cyclic subgroups behave; claim 4 is why every cyclic group is abelian (⟨g⟩={ gn:n∈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) 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

…and 9 more results.

Dependency tree · two levels

44 results within two dependency steps of this one, each drawn at its shortest distance from it. An arrow runs from a result to what uses it, so the chart reads left to right and ends at this result, which carries a heavier outline. Every node is a link to that result. Click elsewhere on the chart to enlarge it.

Sources