Alphabeta Math
LemmaStatement: AI-adaptedProof: AI-adaptedPipeline-generatedprecheck passjudge pass (gpt-5.6-terra)audited 2026-09-09
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 G is generated by a finite set S, then γi/γi+1 is abelian and generated by images of the finitely many left-nested i-fold commutators in S (with inverses allowed). If G is nilpotent, each γi is finitely generated.

Facts & Assumptions

Given: S is finite and generates G; the second assertion additionally assumes γc+1=1.

[F1]

Lower-central commutator pairings are well-defined and biadditive (Lower-central commutators add weights).

[F2]

Generation means every element is a finite product of generators and inverses (Finitely generated groups).

Proof

1.1

The i=1 quotient is generated by the images of S. Suppose γi/γi+1 is generated by the i-fold simple commutators. The next quotient is generated by [u,g]γi+2 for uγi,gG, since [γi,G]=γi+1. Expand the two entries in their factor generators. Biadditivity expresses this class as a product of the (i+1)-fold simple commutators and their inverses. Their number is at most Si+1 before repetitions. This proves the claim by induction.

F1F2
2.1

Abelianness follows from centrality of γi/γi+1. In a nilpotent group start with the empty generating list for γc+1=1. If γi+1 has a finite generating list and u1,,ut lift factor generators, then for any gγi a word w in the uj has the same coset, so w1gγi+1. The union of the two finite lists generates γi. Descending induction reaches i=1; terms after c are trivial. If S is empty, G=1 and all lists are empty.

F1F2F3step 1.1

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

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