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.
The discrete Heisenberg group has growth degree four
Example
The integral Heisenberg group has homogeneous dimension , and therefore its growth function is equivalent to .
Facts & Assumptions
Given: The integral Heisenberg group .
The homogeneous dimension is (The homogeneous dimension of a finitely generated nilpotent group).
The growth function counts word-metric balls (The growth function of a finitely generated group), and its equivalence class is independent of the finite generating set (Growth type is independent of the finite generating set).
Verification
Write with multiplication . A direct commutator calculation gives , so and .
The quotient is generated by the images of and and is isomorphic to , while . Therefore [L1] gives .
Put , and , using . Every element has the unique form , so generate . A word of length at most in has and : multiplication by changes only , and multiplication by changes by and by . Thus its ball has at most elements.
For an integer , put and write with . Then and , a word of length at most . For invert a word for , and for use the empty word. Hence, for every integer , all the distinct elements with and lie in the ball of radius . That ball has at least elements.
The upper bound in step 2.2 is for . For , take in step 3.1 to obtain a lower bound by a positive constant times . These bounds prove equivalence with for , and [L2] transfers that growth type to every finite generating set. Together with step 2.1 this proves the example.
Depends on
Used by
Nothing in the library uses this result yet.
Dependency tree · two levels
12 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
- C. Löh, Geometric Group Theory, Sections 5.1-5.3 (standard reference, not scraped)
- H. Bass, The degree of polynomial growth of finitely generated nilpotent groups (standard reference, not scraped)