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.
Bass–Guivarc’h dimension and nilpotent Hirsch length
Definition
For a finitely generated nilpotent group of class , let be the number of infinite cyclic summands in . These factors are finitely generated abelian by Finite generation of lower-central factors, and the number is intrinsic by Integer abelian structure and rank by finite reduction. Equivalently .
Define the Bass–Guivarc'h dimension and the nilpotent Hirsch length by For , use and empty sums equal to zero. Inserting trailing trivial factors does not change either sum. These definitions concern nilpotent groups only.
Source notes
Druţu–Kapovich, Geometric Group Theory (837-page edition), Definition 13.46, printed p.474. Revised Definition 13.46 supplies the weighted and unweighted sums; the local integer lemma supplies well-defined ranks.
Depends on
Used by
- Lower-central generators, residue coordinates and weighted length Definition
- Free abelian groups have degree equal to rank Example
- Hirsch length and growth degree differ Example
- The discrete Heisenberg group has growth degree four Example
- UT₄(Z) has ranks three, two, one and growth degree ten Example
- Coordinate boxes and word balls have matching size Lemma
- Finite normal quotients preserve lower-central ranks Lemma
- The Bass–Guivarc’h growth degree formula Theorem
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
- Druţu–Kapovich, Geometric Group Theory (837-page edition) (standard reference, not scraped)