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 : natural exponents in a monoid and integer exponents in a group, with
Definition
Natural exponents, in a monoid. Let be a monoid (Semigroup and monoid) and . By the recursion theorem (The recursion theorem), applied with the set , the element and the function from to , there is exactly one function , written , with
In particular for every , including , and . Since contains (The natural numbers (von Neumann)), the exponent is a genuine value of the definition and not a separate convention.
Integer exponents, in a group. Let be a group (Group and abelian group) and . Write for the embedding of The naturals embed in the integers, which is injective, preserves addition, multiplication and order, and has as image exactly the nonnegative integers. For define
- , the natural power, when and ;
- when and .
Why this is well defined. The order on is total and antisymmetric (The integers form a totally ordered ring, Order on the integers), so exactly one of and holds and the two clauses never both apply. In the first clause is nonnegative, so for some , and is unique because is injective. In the second clause gives by compatibility of the order with addition (The integers form a totally ordered ring, Arithmetic on the integers), so is a positive integer and again for a unique . The inverse 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 , as a natural power and as an integer power, agree by construction, so no ambiguity is introduced.
Abbreviation. In an exponent we write for the integer when a natural number is used where an integer is expected; this is unambiguous because is injective and preserves the arithmetic and the order, and because the two readings of agree as just noted.
Additive notation. When the group is written additively the same object is written or rather than , with and ; the definitions are identical, only the symbols differ.
Remarks
-
The case split is on the integer, not on a representative. An integer is an equivalence class of pairs of naturals (The integers as equivalence classes of pairs of naturals), so a definition of by a formula in and would carry a well-definedness obligation. The definition above avoids that entirely: it splits on the sign of , which is a property of the integer itself, and then uses the unique natural supplied by The naturals embed in the integers.
-
Negative exponents need a group, not merely a monoid. The second clause uses an inverse, which a monoid need not have. Natural powers are available in any monoid, and every statement below says which of the two settings it is in.
-
The exponent is an index, an element of or of , and never an element of the group. No canonical-natural machinery (The canonical natural of a field) is involved: that item is about the image of inside a field, a different map with the same traditional name.
-
The laws , and, when and commute, are proved in Exponent laws in a group: and for all , and when and commute. The last one is false without the commuting hypothesis.
Depends on
- Semigroup and monoid
- Group and abelian group
- Left inverse, right inverse, and invertible element of a monoid
- 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
- The recursion theorem
- The natural numbers $\mathbb{N}$ (von Neumann)
- The integers as equivalence classes of pairs of naturals
- Arithmetic on the integers
- Order on the integers
- The integers form a totally ordered ring
- The naturals embed in the integers
Used by
- A rational root of xᵏ = m is an integer: if k ≥ 1, m ∈ ℤ, x ∈ ℚ and xᵏ is the image of m, then x is the image of an integer 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
- The additive rationals do not decompose as a product of finite cyclic prime-power groups Counterexample
- Inversions, inversion number, the sign sgn(σ)=(-1)^inv(σ), and even and odd permutations Definition
- The characteristic of a ring: the least n ≥ 1 with n · 1_R = 0 when one exists, and 0 otherwise Definition
- The exponent of a finite group Definition
- The number-theoretic Möbius function μ(n) from prime factorisation Definition
- The order |G| of a finite group and the order ord(g) of an element, with ord(g) = ∞ when no positive power of g is the identity Definition
- The p-adic valuation vₚ(a) of a nonzero integer: the greatest k ∈ ℕ with pᵏ ∣ a Definition
- The p-primary component of an abelian group Definition
- (ℤ/8)^×={[1],[3],[5],[7]} is not cyclic because every element squares to [1] 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
- For n ≥ 1 the congruence classes modulo n form an abelian group (ℤ/n, +) of order n, generated by the class of 1 Example
- No rational squares to 3 or to 6, and none cubes to 2: three instances of the rational-root corollary Example
- nℤ is a subgroup of (ℤ, +) for every n ∈ ℤ, and every subgroup of (ℤ, +) has this form 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 Klein four-group as the subgroup {id, (12)(34), (13)(24), (14)(23)} of Sym({1,2,3,4}): abelian of order 4, non-cyclic, every non-identity element of order 2 Example
- The square-symmetry group has class equation 8=2+2+2+2 Example
- The zero ring {0}, in which 1 = 0: a commutative ring of characteristic 1 that is not a domain, not a division ring and not a field Example
- ℤ is an integral domain of characteristic 0 whose group of units is {1,-1}, so it is not a field: 2 is nonzero and not invertible 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
- A ring homomorphism satisfies f(0) = 0, f(-a) = -f(a) and f(ma) = m f(a) for m ∈ ℤ, carries units to units, and has a subring as its image; composites of ring homomorphisms are ring homomorphisms Lemma
- Congruent integers may be added, subtracted and multiplied: representative changes preserve both arithmetic operations Lemma
- Every subgroup of (ℤ, +) is ⟨ n ⟩ = nℤ for exactly one natural number n Lemma
- Exponent laws in a group: gᵐ⁺ⁿ = gᵐgⁿ and (gᵐ)ⁿ = gᵐⁿ for all m, n ∈ ℤ, and (gh)ⁿ = gⁿhⁿ **when g and h commute** 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 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 field, the additive multiple n · 1_F is the canonical natural ι(n): the additive power of the group-power definition and the canonical natural are the same function, both being the unique one given by the recursion ι(0) = 0_F, ι(σ(n)) = ι(n) + 1_F 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
- The characteristic of a ring is the additive order of 1_R, with 0 recording infinite order; n · 1_R = 0 holds exactly when char(R) ∣ n; and in an integral domain every nonzero element has the same additive order as 1_R Lemma
…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
- Exponentiation (Wikipedia) (standard reference, not scraped)
- Group (mathematics) (Wikipedia) (standard reference, not scraped)