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.
Group and abelian group
Definition
A group is a monoid (Semigroup and monoid) in which every element is invertible (Left inverse, right inverse, and invertible element of a monoid). Written out, a group is a set with a binary operation (Binary operation on a set; associativity, commutativity, and a subset closed under the operation) and an element such that
- (G1) for all ;
- (G2) for every ;
- (G3) for every there is with .
By A left identity and a right identity for the same binary operation are equal; hence there is at most one two-sided identity the element of (G2) is unique, and 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 the element of (G3) is unique for each and is determined by either one of the two equations alone. So the notations for the identity and for the inverse of are legitimate, and asserting alone already says .
A group is abelian, or commutative, when its operation is commutative: for all .
Notation. The operation is usually written multiplicatively, for , with identity (or ) and inverse . For an abelian group it is often written additively, , with identity and inverse ; the two notations describe the same notion and nothing below depends on the choice. We write for the group when the operation is understood.
Remarks
-
Why (G3) may be stated one-sidedly in practice. The axiom as written asks for a two-sided inverse. Because 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 is proved before this definition, and is proved in the sharp form "a left inverse and a right inverse of the same element coincide", verifying either equation for a candidate suffices once the element is known to be invertible. Nothing on this page ever uses a one-sided inverse without that lemma standing behind it.
-
A group is a monoid, not merely like one. Every statement proved for monoids applies verbatim to groups. In the other direction the invertible elements of a monoid form a group (The invertible elements of a monoid form a group under the restricted operation), so groups arise inside every monoid.
-
The axioms are not independent of the notation, but the content is. Read additively, (G1)–(G3) are exactly the additive axioms in the definition of a field (Field), whose axiom (A) says in as many words that is an abelian group and whose axiom (M) says the same of ; so every field already carries two groups.
Depends on
- Semigroup and monoid
- 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
- Left identity, right identity, and two-sided identity for a binary operation
- Binary operation on a set; associativity, commutativity, and a subset closed under the operation
Used by
- Every quotient group of an abelian group is abelian Corollary
- Every subgroup of an abelian group is normal Corollary
- (gh)ⁿ = gⁿhⁿ fails without commutativity: two transpositions in Sym({1,2,3}) with (gh)² ≠ g²h² Counterexample
- A commutative monoid in which cancellation holds need not be a group: (ℕ, +) Counterexample
- A nonempty subset of a group closed under the operation need not be a subgroup: the nonnegative integers inside (ℤ, +) Counterexample
- In ⟨ a,b∣ ab, aba⟩, delete-only relator rewriting sends aba either to the empty word or to the stuck word a Counterexample
- In ⟨ a,b∣ ab⟩, the trivial word ba is stuck under free cancellation and delete-only relator rewriting 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 finite p-group has order pⁿ for a prime p and some n∈ℕ Definition
- Free abelian group on a set Definition
- Free group on a set of generators Definition
- Left and right cosets gH and Hg of a subgroup Definition
- Left group actions, transitive actions, and faithful actions Definition
- Linear combination of a finite list, and the span span(S) as the smallest linear subspace containing S Definition
- Linear subspace of a vector space Definition
- Monoid homomorphism and group homomorphism Definition
- Powers gⁿ: natural exponents in a monoid and integer exponents in a group, with g⁰ = e Definition
- Reduced syllable words in a family of groups Definition
- Ring: an abelian group under addition and a monoid under multiplication, with multiplication distributing over addition on both sides Definition
- Subgroup Definition
- The center Z(G) of a group Definition
- The characteristic of a ring: the least n ≥ 1 with n · 1_R = 0 when one exists, and 0 otherwise Definition
- The conjugacy class Cl_G(x) and centralizer C_G(x) of an element Definition
- The external direct product G× H with componentwise multiplication 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 subgroup ⟨ S ⟩ generated by a subset, the cyclic subgroup ⟨ g ⟩, and cyclic groups Definition
- Topological group: multiplication and inversion are continuous Definition
- Unital left and right modules over a ring; unqualified module means left module Definition
- Vector space over a field Definition
- (ℤ, +) is an abelian group, (ℤ, ·) is a commutative monoid that is not a group, and its group of units is {1, -1} Example
- ⟨ a,b∣ a², b², aba⁻¹b⁻¹⟩≅(ℤ/2)×(ℤ/2) Example
- 12ℤ + 18ℤ = 6ℤ and 12ℤ ∩ 18ℤ = 36ℤ, the arithmetic of gcd and lcm read off the subgroups of (ℤ,+) Example
- Every inner automorphism of an abelian group is the identity Example
- For an abelian group G, Z(G)=G and [G,G]={e} Example
- For any field F, (F, +) and (F ∖ {0}, ·) are abelian groups; in particular (ℚ, +), (ℚ ∖ {0}, ·), (ℝ, +) and (ℝ ∖ {0}, ·) Example
- For n ≥ 1 the congruence classes modulo n form an abelian group (ℤ/n, +) of order n, generated by the class of 1 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 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
…and 41 more results.
Dependency tree · next 3 levels
Direct dependencies and their dependencies through the next three levels: 16 results over 13 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
- Group (mathematics) (Wikipedia) (standard reference, not scraped)
- Abelian group (Wikipedia) (standard reference, not scraped)