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.
Finite generation of lower-central factors
Statement
If a group is generated by a finite set , then is abelian and generated by images of the finitely many left-nested -fold commutators in (with inverses allowed). If is nilpotent, each is finitely generated.
Facts & Assumptions
Given: is finite and generates ; the second assertion additionally assumes .
Lower-central commutator pairings are well-defined and biadditive (Lower-central commutators add weights).
Generation means every element is a finite product of generators and inverses (Finitely generated groups).
Nilpotency of class gives (Nilpotence via central series, the upper central series, and the lower central series).
Proof
The quotient is generated by the images of . Suppose is generated by the -fold simple commutators. The next quotient is generated by for , since . Expand the two entries in their factor generators. Biadditivity expresses this class as a product of the -fold simple commutators and their inverses. Their number is at most before repetitions. This proves the claim by induction.
Abelianness follows from centrality of . In a nilpotent group start with the empty generating list for . If has a finite generating list and lift factor generators, then for any a word in the has the same coset, so . The union of the two finite lists generates . Descending induction reaches ; terms after are trivial. If is empty, and all lists are empty.
Source notes
Druţu–Kapovich, Lectures on Geometric Group Theory (585-page draft), Lemma 10.31 and Corollary 10.32, printed pp.282–283. Draft Lemma 10.31 and Corollary 10.32 are proved by finite commutator expansion and finite extension lifting. No torsion-freeness is inferred.
Depends on
Used by
- Bass–Guivarc’h dimension and nilpotent Hirsch length Definition
- Lower-central generators, residue coordinates and weighted length Definition
- Finite lower-central coordinate systems with torsion accounted for Lemma
- Finite normal quotients preserve lower-central ranks Lemma
- Finite torsion and the torsion-free quotient Lemma
- Power compression in the last lower-central term Lemma
- Subgroups of finitely generated nilpotent groups are finitely generated Lemma
Dependency tree · two levels
13 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
- Druţu–Kapovich, Lectures on Geometric Group Theory (585-page draft) (standard reference, not scraped)