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.

Subgroups of finitely generated nilpotent groups are finitely generated

Statement

Every subgroup K of a finitely generated nilpotent group G is finitely generated.

Facts & Assumptions

Given: γc+1(G)=1 and G is finitely generated.

[F1]

Each lower-central factor is finitely generated abelian (Finite generation of lower-central factors).

[F2]

Every subgroup of a finitely generated abelian group is finitely generated (Integer abelian structure and rank by finite reduction).

Proof

1.1

Put Ki=Kγi(G). The homomorphism Kiγi/γi+1 has kernel Ki+1. Its image is a subgroup of a finitely generated abelian group, so has a finite generating list. Thus Ki/Ki+1 is finitely generated: explicitly its isomorphism to that image sends xKi+1 to xγi+1, with injectivity given by the kernel calculation.

F1F2
2.1

Start with Kc+1=1. Lift a finite generating list of Ki/Ki+1 to Ki. For xKi, a word w in these lifts has coset xKi+1, so w1xKi+1. Consequently those lifts together with generators of Ki+1 generate Ki. There are finitely many layers, hence this gives finite generators of K1=K. Empty factor lists require no lift, and c=0 gives K=1.

step 1.1

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