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 lower-central coordinate systems with torsion accounted for
Statement
For every finitely generated nilpotent , has integral coordinates along a central cyclic refinement. Separately, both and have unique mixed lower-central ordered coordinates: each infinite factor uses an integer exponent, and each order- finite factor uses one residue . There are exactly unbounded exponents of weight , where is the free rank of , equivalently of . All choices needed are finite.
An element belongs to if and only if all coordinates in layers strictly before vanish.
Facts & Assumptions
Given: Use the fixed order and tuple conventions of the coordinate definition.
Layer- coordinates lift cyclic factors of (Lower-central generators, residue coordinates and weighted length).
is finite characteristic and is torsion-free nilpotent (Finite torsion and the torsion-free quotient).
Finitely generated torsion-free nilpotent groups have integral central-refinement coordinates (Integral coordinates from a central cyclic refinement).
Finitely generated abelian factors admit finite cyclic decompositions with intrinsic free rank (Integer abelian structure and rank by finite reduction).
Every lower-central factor of a finitely generated nilpotent group is finitely generated abelian (Finite generation of lower-central factors).
Proof
The images of a finite generating set generate . The torsion theorem makes torsion-free nilpotent, so it has the integral central-refinement coordinates of F3. This invocation is made for , not for a possibly torsion-bearing .
For either or , take a cyclic decomposition in each lower-central factor and one lift per generator. There are finitely many layers and finite lists. For , project to , obtain its unique cyclic-factor tuple, and let be the corresponding ordered lifted product. The remainder lies in . Repeat in , obtaining ; after layer the remainder is . Thus has the mixed ordered form.
Let be the quotient map. Induction gives : it is clear for , and surjectivity sends the generators of the next term onto the generators . Hence induces a surjection If is in its kernel, choose with . Then lies in and . Conversely every such lies in the kernel, so the kernel is the image of the finite set . The finite-kernel rank clause of [F4] therefore gives equal free ranks for the corresponding factors of and . Calling this common rank , each construction in step 1.2 has exactly unbounded layer- exponents.
If two normalized products agree, project to to equate all first-layer coordinates, including the canonical residues. Their lifted first-layer products are then literally equal and may be cancelled on the left. Repeating in the next factor equates every coordinate. The identity has the all-zero tuple; for this is the empty tuple. Hence the mixed parametrization is bijective, whether or not some factors contain torsion.
If one instead lifts an integral coordinate representative of an element of to , the fiber consists exactly of the elements with . Thus returning from the integral model retains a finite kernel representative. The mixed construction in steps 1.2–2.1 works directly in and does not discard these elements or identify the two coordinate systems.
Source notes
Druţu–Kapovich, Geometric Group Theory (837-page edition), Proposition 14.25, pp.510–511, and Remark 13.83, p.484. Revised Proposition 14.25 supports the mixed normal form. The finite-torsion quotient is formed before using integral central-refinement coordinates; torsion in lower-central factors is retained.
Depends on
Used by
- Torsion-free does not mean torsion-free lower-central factors Counterexample
- Coordinate boxes and word balls have matching size Lemma
- Finite collection alphabets include commutators and torsion carries Lemma
- Weighted collection with finite-order carries Lemma
Cited to discharge well-definedness by Lower-central generators, residue coordinates and weighted length.
Dependency tree · two levels
21 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, Geometric Group Theory (837-page edition) (standard reference, not scraped)