Alphabeta Math
DefinitionDefinition: AI-adaptedProof: Not applicablejudge 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.

The subgroup ⟨S⟩ generated by a subset, the cyclic subgroup ⟨g⟩, and cyclic groups

Definition

Let G be a group (Group and abelian group) and S⊆G a subset. The set of subgroups of G containing S is nonempty, since G itself is such a subgroup, so its intersection is a subgroup of G by The intersection of a nonempty family of subgroups of G is a subgroup of G. That intersection is the subgroup generated by S,

⟨S⟩  :=  ⋂{ H  :  H≤G and S⊆H }.

It contains S, being an intersection of sets each containing S, and it is contained in every subgroup of G that contains S; so it is the smallest subgroup of G containing S, and these two properties determine it uniquely. The elements of S are called generators.

For a single element g∈G we write ⟨g⟩:=⟨{g}⟩ and call it the cyclic subgroup generated by g. A group G is cyclic when G=⟨g⟩ for some g∈G.

By convention ⟨∅⟩={e}: 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 e (Subgroup).

Remarks

  • Two descriptions, one object. The definition above is "from outside": cut down from all subgroups containing S. 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 ⟨g⟩={ gn:n∈Z }, proved in ⟨g⟩={ gn:n∈Z }, and every cyclic group is abelian. The general case belongs to a later page; nothing here needs it.

  • Cyclic does not mean finite. (Z,+) is cyclic, generated by 1, and infinite; the generator may also fail to be unique, since −1 generates it too.

  • Every cyclic group is abelian (⟨g⟩={ gn:n∈Z }, 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

…and 48 more results.

Dependency tree · two levels

9 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