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.
Subgroups of finitely generated nilpotent groups are finitely generated
Statement
Every subgroup of a finitely generated nilpotent group is finitely generated.
Facts & Assumptions
Given: and is finitely generated.
Each lower-central factor is finitely generated abelian (Finite generation of lower-central factors).
Every subgroup of a finitely generated abelian group is finitely generated (Integer abelian structure and rank by finite reduction).
Proof
Put . The homomorphism has kernel . Its image is a subgroup of a finitely generated abelian group, so has a finite generating list. Thus is finitely generated: explicitly its isomorphism to that image sends to , with injectivity given by the kernel calculation.
Start with . Lift a finite generating list of to . For , a word in these lifts has coset , so . Consequently those lifts together with generators of generate . There are finitely many layers, hence this gives finite generators of . Empty factor lists require no lift, and gives .
Source notes
Druţu–Kapovich, Lectures on Geometric Group Theory (585-page draft), Theorem 10.40, printed p.285. Draft Theorem 10.40 is realized by the intersection series, using the local integer lemma rather than generic PID results.
Depends on
Used by
Dependency tree · two levels
27 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)