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
Let , writing for the matrix with entries a at (1,2), b at (2,3), and c at (1,3). Then , , , , , and . Its word balls for any finite generating set have degree four.
The explicit laws are and . With , , , one has and the unique ordered form .
Facts & Assumptions
Given: Use matrix multiplication and the commutator convention .
A finitely generated nilpotent group has ball growth degree D (The Bass–Guivarc’h growth degree formula).
D is the weighted sum of lower-central ranks (Bass–Guivarc’h dimension and nilpotent Hirsch length).
Verification
Matrix multiplication gives . The identity is (0,0,0), and substitution on both sides gives . Put , , . Their integer powers satisfy , so every matrix is uniquely .
Using the product and inverse formulas gives . In particular . Every commutator is a power of z and z itself is a commutator, so . Elements (0,0,c) commute with every triple by the product rule, hence . Conversely, if commutes with and , its commutators have central entries and , so . Thus the center is exactly . Since z has infinite order, H has class exactly two. The elements x,y generate because z=[x,y] and step 1.1 gives every matrix.
The homomorphism is onto with kernel , while identifies the kernel with . Thus and , giving . F1 applies because x,y are finite generators and H has class two. The identity has a=b=k=0; the matrix entry c equals ab+k and is not generally the normal coordinate k.
Source notes
Druţu–Kapovich, Lectures on Geometric Group Theory (585-page draft), Exercise 10.30, p.282; Example 5.3.7 in Löh. Draft Exercise 10.30 and Löh Example 5.3.7 support the example; the matrix law, normal form and both lower-central inclusions are calculated here.
Clara Löh, Geometric Group Theory, SS 2022, Theorem 5.3.6 and Example 5.3.7, printed p.140; general proof omitted. This independently supports the statement, not the omitted general proof.
Depends on
Used by
Dependency tree · two levels
9 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)
- Clara Löh, Geometric Group Theory, SS 2022 (standard reference, not scraped)