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: and for all , and when and commute
Statement
Let be a group (Group and abelian group) with identity , let , and let powers be as in Powers : natural exponents in a monoid and integer exponents in a group, with . For all :
- ;
- ;
- ;
- : any two powers of one element commute;
- if then .
Claim 5 is false in general without its hypothesis: in a group in which and do not commute the equation can fail already at , and a witness is recorded on the companion page.
Claims 1 and 3 hold in any monoid (Semigroup and monoid) for exponents in , and so does claim 5 for exponents in under the same commuting hypothesis; only the extension to negative exponents needs inverses.
Facts & Assumptions
Given: A group with identity and elements ; powers for defined by and , and for defined by and for (Powers : natural exponents in a monoid and integer exponents in a group, with ). Throughout, is the embedding of The naturals embed in the integers, and a natural number written where an integer is expected means its image under .
Induction on (The principle of mathematical induction).
The group laws: associativity, the two-sided identity , and two-sided inverses (Group and abelian group, Semigroup and monoid).
, and in a group (In a group , and , the order of the last product being essential).
is injective, preserves addition, multiplication and order, and its image is exactly the set of nonnegative integers; and (The naturals embed in the integers, Arithmetic on the integers).
is a commutative ring: addition and multiplication are associative and commutative, , , multiplication distributes over addition, and every has an additive inverse (The integers form a commutative ring, Arithmetic on the integers); every integer is for naturals , and then (The integers as equivalence classes of pairs of naturals).
The order on is total and compatible with addition, so exactly one of , holds, and implies (The integers form a totally ordered ring, Order on the integers).
On : addition satisfies and , so (Addition of natural numbers, The natural numbers (von Neumann)); it is commutative (Addition is commutative); means for some (Order on the natural numbers); and exactly one of , , holds (Trichotomy of the order on ).
Proof
Natural exponents, base of claim 1: for every , .
Natural exponents, inductive hypothesis for claim 1: fix and assume for every and every .
Suppose ; base of the commuting sub-claim: .
Inductive hypothesis of the commuting sub-claim: assume .
Base of claim 5 for natural exponents: .
Inductive hypothesis of claim 5 for natural exponents: assume and .
If in then : multiplying on the left and on the right by gives , and regrouping both sides gives . Consequently .
Claim 2 for a nonnegative exponent. If then , so and . If then because preserves the order, so and the second clause of the definition gives directly.
Claim 3 for a nonnegative second exponent, base: , since in .
Claim 3 for a nonnegative second exponent, inductive hypothesis: assume for this and every .
Successor step for claim 1 with natural exponents: ; by induction, for all , in any monoid.
Successor step for the commuting sub-claim: ; by induction for every whenever .
Claim 2 in general. If then and step 1.8 gives . If then , so and by definition , whence . This is claim 2.
Successor step for claim 5 with natural exponents: assuming , , the fourth equality being step 2.2 applied to and ; by induction for every .
Normal form. Let and write with , possible since for some naturals. Then . Indeed, by trichotomy either , say , in which case and , using step 2.1 twice together with commutativity of addition on ; or , say with , in which case and , the third equality using step 1.7 with and , which commute by step 2.1.
Claim 1 for integer exponents. Write and , so . By step 3.2 and step 2.1, . On the other side , moving past by step 1.7, since and commute by step 2.1. Finally by step 1.7 again, so the two sides agree.
Claim 5 for a negative exponent: assume and let , so with . Then by claim 2 and step 3.1; and and commute, by step 2.2 applied twice, so their inverses commute by step 1.7, giving . With step 3.1 this proves claim 5 for every .
Claim 4. By claim 1 and commutativity of addition in , .
Claim 3, successor step: , using the hypothesis, then claim 1, then distributivity in , then . By induction, for every and every . When is itself nonnegative the two exponents and 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.
Claim 3 for a negative second exponent: let , so . Applying claim 2 to the element gives , which by step 5.2 equals , using claim 2 once more and then . Together with step 5.2 this is claim 3.
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.
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 a homomorphism from and hence what makes cyclic subgroups behave; claim 4 is why every cyclic group is abelian (, 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 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
- Powers $g^{n}$: natural exponents in a monoid and integer exponents in a group, with $g^{0} = e$
- Group and abelian group
- Semigroup and monoid
- In a group $e^{-1} = e$, $(g^{-1})^{-1} = g$ and $(gh)^{-1} = h^{-1}g^{-1}$, the order of the last product being essential
- The principle of mathematical induction
- The integers form a commutative ring
- The integers form a totally ordered ring
- The integers as equivalence classes of pairs of naturals
- Arithmetic on the integers
- Order on the integers
- The naturals embed in the integers
- Trichotomy of the order on $\mathbb{N}$
- The natural numbers $\mathbb{N}$ (von Neumann)
- Addition of natural numbers
- Order on the natural numbers
- Addition is commutative
Used by
- A free product of copies of the infinite cyclic group is a free group Corollary
- Finite-order elements of a free product are conjugate into factors Corollary
- g^|G|=e for every element g of a finite group G Corollary
- (gh)ⁿ = gⁿhⁿ fails without commutativity: two transpositions in Sym({1,2,3}) with (gh)² ≠ g²h² Counterexample
- In ⟨ a,b∣ aba⁻¹b⁻¹⟩, the trivial word a²b²a⁻²b⁻² is stuck under free cancellation and delete-only relator rewriting Counterexample
- ⟨ a,b∣ aba⁻¹b⁻¹⟩≅(ℤ,+)×(ℤ,+) Example
- ⟨ a∣ aⁿ⟩≅(ℤ/n,+) for every n≥ 1 Example
- 360 = 2³ · 3² · 5 and 84 = 2² · 3 · 7, with gcd(360,84) = 12 and lcm(360,84) = 2520 read off the exponents Example
- Every positive divisor of the order of a finite cyclic group occurs as the order of a subgroup Example
- No rational squares to 3 or to 6, and none cubes to 2: three instances of the rational-root corollary Example
- Sym({1,2,3}) has exactly six elements, is non-abelian, and its elements have orders 1, 2 and 3 Example
- The eight vertex permutations of a square form a non-abelian subgroup of Sym({1,2,3,4}) of order 8, generated by a 4-cycle and one diagonal swap Example
- The free group on one generator is isomorphic to (ℤ,+) Example
- The square-symmetry group has class equation 8=2+2+2+2 Example
- FALSE: every Fermat number 2^2ⁿ + 1 is prime False statement
- FALSE: n² + n + 41 is prime for every natural number n False statement
- ⟨ g ⟩ = { gⁿ : n ∈ ℤ }, and every cyclic group is abelian Lemma
- A group homomorphism automatically satisfies f(e) = e' and f(g⁻¹) = f(g)⁻¹, and f(gⁿ) = f(g)ⁿ for every n ∈ ℤ; for monoid homomorphisms preservation of the identity must be assumed Lemma
- For a prime p and a nonzero integer a: p^vₚ(a) ∣ a and p^vₚ(a)+1 ∤ a; pᵏ ∣ a holds exactly for k ≤ vₚ(a); vₚ(a) ≥ 1 exactly when p ∣ a; vₚ(1) = vₚ(-1) = 0; and vₚ(p) = 1 Lemma
- For a prime p and k≥1, multiplication by p bijects the standard representatives modulo pᵏ⁻¹ with the representatives modulo pᵏ divisible by p Lemma
- If G/Z(G) is cyclic, then G is abelian Lemma
- If ord(g) = n then gᵏ = e iff k is an integer multiple of n, the powers g⁰, …, gⁿ⁻¹ are distinct, and ⟨ g ⟩ has exactly n elements; if g has infinite order then gʲ = gᵏ only for j = k Lemma
- In a finite group, every element g satisfies gⁿ = e for some natural n ≥ 1 Lemma
- Integer multiples in a ring: (m + n)a = ma + na, m(a + b) = ma + mb, (ma)b = m(ab) = a(mb) and (ma)(nb) = (mn)(ab) for all m, n ∈ ℤ and a, b ∈ R Lemma
- vₚ(ab) = vₚ(a) + vₚ(b) for nonzero integers a, b, and vₚ(a+b) ≥ min{vₚ(a), vₚ(b)} whenever a, b and a+b are all nonzero Lemma
- A p-primary component has the full p-power order and is the unique subgroup of that order Theorem
- Every cyclic group is isomorphic to (ℤ,+) or to (ℤ/n,+) for its finite order n≥1 Theorem
- Every subgroup of a cyclic group is cyclic; the least positive exponent in a nontrivial subgroup supplies a generator Theorem
- Fermat's little theorem: for prime p, p∤ a implies aᵖ⁻¹≡1pmod p, and always aᵖ≡ apmod p Theorem
- For n ≥ 1 and any injective list p : r → ℤ of primes containing every prime divisor of n, one has n = ∏_i<r pᵢ^ v_pᵢ(n); the exponents are determined by n, and v_q(n) = 0 for every prime q outside the list Theorem
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
- Exponentiation (Wikipedia) (standard reference, not scraped)
- Group (mathematics) (Wikipedia) (standard reference, not scraped)