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.
The subgroup generated by a subset, the cyclic subgroup , and cyclic groups
Definition
Let be a group (Group and abelian group) and a subset. The set of subgroups of containing is nonempty, since itself is such a subgroup, so its intersection is a subgroup of by The intersection of a nonempty family of subgroups of is a subgroup of . That intersection is the subgroup generated by ,
It contains , being an intersection of sets each containing , and it is contained in every subgroup of that contains ; so it is the smallest subgroup of containing , and these two properties determine it uniquely. The elements of are called generators.
For a single element we write and call it the cyclic subgroup generated by . A group is cyclic when for some .
By convention : the trivial subgroup is the smallest subgroup containing the empty set, and this is a consequence of the definition, not a stipulation, since every subgroup contains (Subgroup).
Remarks
-
Two descriptions, one object. The definition above is "from outside": cut down from all subgroups containing . There is also a description "from inside", as the set of all finite products of generators and their inverses. For a single generator that inside description is , proved in , and every cyclic group is abelian. The general case belongs to a later page; nothing here needs it.
-
Cyclic does not mean finite. is cyclic, generated by , and infinite; the generator may also fail to be unique, since generates it too.
-
Every cyclic group is abelian (, and every cyclic group is abelian), so a non-abelian group is never cyclic; the converse fails, and the Klein four-group on the companion page is an abelian group that is not cyclic.
Depends on
Used by
- A finite group of prime order is cyclic and every nonidentity element generates it Corollary
- Every finite subgroup of the unit group of an integral domain is cyclic Corollary
- The order of every element of a finite group divides the order of the group Corollary
- The subgroup ⟨(1 2 3),(1 2)(3 4)⟩≤ S₄ has order 12 but no subgroup of order 6, so Cauchy's theorem does not extend to composite divisors Counterexample
- Commutators [g,h]=ghg⁻¹h⁻¹ and the commutator subgroup [G,G] Definition
- Generated submodule, cyclic and finitely generated modules, module basis and free module Definition
- Internal direct products of finitely many normal subgroups Definition
- Relators and relations; finitely generated, finitely related, and finite presentations Definition
- (ℤ/8)^×={[1],[3],[5],[7]} is not cyclic because every element squares to [1] Example
- 12ℤ + 18ℤ = 6ℤ and 12ℤ ∩ 18ℤ = 36ℤ, the arithmetic of gcd and lcm read off the subgroups of (ℤ,+) Example
- Dₙ≅⟨ r,s∣ rⁿ, s², srs⁻¹r⟩ for the dihedral group Dₙ=⟨{ρ,σ}⟩leqSym(ℤ/n), n≥ 3 Example
- Every positive divisor of the order of a finite cyclic group occurs as the order of a subgroup Example
- For an abelian group G, Z(G)=G and [G,G]={e} 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
- 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
- The subgroup orders in Sym({1,2,3}) are 1,2,3 and 6 Example
- The three-cycle subgroup of Sym({1,2,3}) is normal and its quotient has two elements Example
- ⟨ g ⟩ = { gⁿ : n ∈ ℤ }, and every cyclic group is abelian Lemma
- Every subgroup of (ℤ, +) is ⟨ n ⟩ = nℤ for exactly one natural number n Lemma
- If G/Z(G) is cyclic, then G is abelian Lemma
- The commutator subgroup is normal Lemma
- aℤ + bℤ = gcd(a,b) ℤ and aℤ ∩ bℤ = lcm(a,b) ℤ; equivalently, in (ℤ,+) the subgroup generated by {a,b} is ⟨ gcd(a,b) ⟩ and ⟨ a ⟩ ∩ ⟨ b ⟩ = ⟨ lcm(a,b) ⟩ Theorem
- Every cyclic group is isomorphic to (ℤ,+) or to (ℤ/n,+) for its finite order n≥1 Theorem
- Every finite permutation is a product of transpositions, so the transpositions generate Sₙ Theorem
- Every permutation of a finite set is a product of pairwise disjoint cycles, uniquely up to reordering and cyclic rotation Theorem
- Every subgroup of a cyclic group is cyclic; the least positive exponent in a nontrivial subgroup supplies a generator Theorem
- G/N is abelian if and only if [G,G]⊆ N Theorem
- Von Dyck's theorem: maps of generators that satisfy the relators extend uniquely from a presented group Theorem
Dependency tree · next 3 levels
Direct dependencies and their dependencies through the next three levels: 14 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
- Generating set of a group (Wikipedia) (standard reference, not scraped)
- Cyclic group (Wikipedia) (standard reference, not scraped)