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.
Upper-central factors of a torsion-free nilpotent group
Statement
If a nilpotent group has torsion-free center, all upper-central factors are torsion-free, and is torsion-free. Here and .
Facts & Assumptions
Given: is nilpotent with torsion-free .
A commutator pairing with central values is multiplicative (Commutator product identities in the fixed convention).
Proof
For each fixed , define by . The value lies in by the definition of ; multiplying by a central element does not change it. The product identity, with central values, proves is a homomorphism. If has finite order , then . Torsion-freeness of implies for every , hence . Thus is torsion-free.
Induct on an upper-central length . For the group is trivial; for the claim is the assumed torsion-freeness of the center. For , the group has length at most and center , torsion-free by step 1.1. Recursion on the definitions gives for : after quotienting this subgroup, its next center is exactly the defining next upper-center factor. The induction hypothesis therefore proves torsion-freeness of ; the first factor is torsion-free by assumption.
If with , its image in is torsion and therefore trivial, so . Repeating down the torsion-free factors gives . Factors after are trivial. This proves both conclusions with the stated ascending indices.
Source notes
Druţu–Kapovich, Lectures on Geometric Group Theory (585-page draft), Lemma 10.51, printed p.288. Draft Lemma 10.51 supplies the detection argument; the printed ascending-index slips are corrected explicitly.
Depends on
Used by
Dependency tree · two levels
7 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)