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.
Hirsch length and growth degree differ
Example
The nilpotent Hirsch length and growth degree need not agree: for the integer Heisenberg group H, h(H)=3 and D(H)=4; for , h=6 and D=10.
Facts & Assumptions
Given: Use the ranks computed in the two matrix examples.
The Heisenberg lower-central ranks are 2,1 (The discrete Heisenberg group has growth degree four).
The UT_4 lower-central ranks are 3,2,1 (UT_4(Z) has ranks three, two, one and growth degree ten).
h sums ranks and D sums ranks multiplied by their layer (Bass–Guivarc’h dimension and nilpotent Hirsch length).
Verification
For H, the factor ranks (2,1) give and . Their difference is , contributed by the central second-layer free generator.
For the ranks (3,2,1) give and . The difference is . Thus h counts each free coordinate once, while D records its lower-central layer; these two explicit nilpotent groups have different values of the two invariants.
Source notes
Druţu–Kapovich, Geometric Group Theory (837-page edition), Definition 13.46, p.474. Revised Definition 13.46 supplies the distinction between the two sums; actual factor calculations are cited at their uses.
Depends on
Used by
Nothing in the library uses this result yet.
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, Geometric Group Theory (837-page edition) (standard reference, not scraped)