Alphabeta Math
ExampleConstruction: AI-adaptedVerification: AI-adaptedPipeline-generatedprecheck passjudge pass (gpt-5.6-terra)audited 2026-09-09
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 H=UT⁡3(Z), writing (a,b,c) for the matrix with entries a at (1,2), b at (2,3), and c at (1,3). Then γ2(H)={(0,0,c):c∈Z}, γ3(H)=1, Z(H)=γ2(H), r1=2, r2=1, and D(H)=4. Its word balls for any finite generating set have degree four.

The explicit laws are (a,b,c)(a′,b′,c′)=(a+a′,b+b′,c+c′+ab′) and [(a,b,c),(a′,b′,c′)]=(0,0,ab′−a′b). With x=(1,0,0), y=(0,1,0), z=(0,0,1), one has [x,y]=z and the unique ordered form xaybzk=(a,b,ab+k).

Facts & Assumptions

Given: Use matrix multiplication and the commutator convention [u,v]=uvu−1v−1.

[F1]

A finitely generated nilpotent group has ball growth degree D (The Bass–Guivarc’h growth degree formula).

[F2]

D is the weighted sum of lower-central ranks (Bass–Guivarc’h dimension and nilpotent Hirsch length).

Verification

1.1givenalgebra

Matrix multiplication gives (a,b,c)(a′,b′,c′)=(a+a′,b+b′,c+c′+ab′). The identity is (0,0,0), and substitution on both sides gives (a,b,c)−1=(−a,−b,−c+ab). Put x=(1,0,0), y=(0,1,0), z=(0,0,1). Their integer powers satisfy xaybzk=(a,b,ab+k), so every matrix is uniquely xaybzc−ab.

2.1step 1.1algebra

Using the product and inverse formulas gives [(a,b,c),(a′,b′,c′)]=(0,0,ab′−a′b). In particular [x,y]=z. Every commutator is a power of z and z itself is a commutator, so [H,H]=⟨z⟩. Elements (0,0,c) commute with every triple by the product rule, hence γ3=1. Conversely, if (a,b,c) commutes with x and y, its commutators have central entries −b and a, so a=b=0. Thus the center is exactly ⟨z⟩. 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.

3.1F1F2step 1.1step 2.1∎

The homomorphism (a,b,c)↦(a,b) is onto Z2 with kernel ⟨z⟩, while c↦(0,0,c) identifies the kernel with Z. Thus r1=2 and r2=1, giving D=1⋅2+2⋅1=4. 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