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.
Free abelian groups have degree equal to rank
Example
For with , . Standard word balls have size bounded above and below by positive multiples of for .
Facts & Assumptions
Given: For d>0 use the standard basis as generators; for d=0 use the empty generating set of the trivial group.
A finitely generated nilpotent group has two-sided polynomial ball bounds of degree D (The Bass–Guivarc’h growth degree formula).
D is the sum of i times the free rank of layer i (Bass–Guivarc’h dimension and nilpotent Hirsch length).
Verification
Addition in is commutative, so . Its only nonzero lower-central rank is , hence . The standard basis is a finite generating set, and the group is nilpotent of class one when d>0, so F1 applies.
For an integer vector a, each generator letter changes one coordinate by 1 in absolute value. Thus any representing word has at least letters; writing each coordinate power attains that number. Consequently for d>0. For n>=d, the left cube has at least points, and the right has at most . For the ball contains 1 and , so these bounds persist.
For d=0 there is one empty vector, the empty word has length zero, and every ball has size 1. The dimension is the empty sum 0 and . Thus the degree and both estimates include the zero-dimensional case.
Source notes
Druţu–Kapovich, Geometric Group Theory (837-page edition), Theorem 14.26 abelian base, p.511. Revised Theorem 14.26 abelian base is accompanied here by the explicit lattice interval calculation.
Depends on
Used by
Nothing in the library uses this result yet.
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, Geometric Group Theory (837-page edition) (standard reference, not scraped)