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 Heisenberg center is quadratically distorted
Example
In the integer Heisenberg group with horizontal generators x,y and central z=[x,y], for every nonzero integer m, and . Therefore the distortion of the center is quadratic.
For all integers , the explicit commutator identity is .
Facts & Assumptions
Given: Use the triples and generators of the preceding Heisenberg example, and intrinsic generator z for its center.
The product law is and z generates the center (The discrete Heisenberg group has growth degree four).
An infinite last term in a class-two group has quadratic distortion (Both bounds for last-term weighted distortion).
Verification
For integers a,b the commutator formula gives . For put and write with and . Then . Its length is at most . Since for , this is at most . In particular gives the word of length four. Thus the stated upper bound holds.
For a horizontal word of length n let (a_j,b_j,c_j) be the prefix value after j letters, starting at zero. Multiplication by x or its inverse changes only a by 1; multiplication by y or its inverse changes b by 1 and changes c by plus or minus the preceding a. Therefore and . If the word represents z^m, its final c is m, so and .
Invert the word of step 1.1 for negative m; it represents z^m with unchanged length. At m=0 use the empty word. Intrinsically , since the exponent sum of an intrinsic n-letter word has absolute value at most n and m identical signed letters attain |m|. Thus . For choose ; then and the upper length bound puts z^m in B(n). Hence for . This also verifies the hypotheses and conclusion of F2, since the center is infinite and equals gamma_2.
Source notes
Druţu–Kapovich, Lectures on Geometric Group Theory (585-page draft), Corollary 12.39, pp.322–323; Heisenberg specialization. Draft Corollary 12.39 is specialized to a directly calculated rectangular commutator word; the lower estimate is obtained from the prefix matrix recurrence.
Depends on
Used by
- Weight-one counting misses Heisenberg growth Counterexample
Dependency tree · two levels
8 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)