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 of rank at least two are not hyperbolic
Statement
If is a free abelian group of rank at least , then is not hyperbolic.
Facts & Assumptions
Given: A free abelian group with a basis of cardinality at least two, possibly infinite (Free abelian group on a set).
A hyperbolic group is finitely generated and has a hyperbolic unit-edge Cayley graph for some finite generating set (Hyperbolic groups).
Cayley edges correspond to the nonzero elements of the symmetric generating set (The Cayley graph of a group with respect to a subset).
In a geodesic -hyperbolic space every geodesic quadrilateral is -thin (Hyperbolic spaces have thin geodesic quadrilaterals).
Proof
If the basis is infinite, every finite set of group elements uses only finitely many basis coordinates and cannot generate . Thus [L0] excludes hyperbolicity. Otherwise identify with , , and fix any finite generating set. Replace it by its nonzero symmetric closure , which leaves the geometric Cayley graph unchanged by [L1]. It spans .
Choose of maximal Euclidean norm. The linear functional satisfies and for every , by Cauchy–Schwarz and maximality. Since spans a space of dimension at least two, choose independent of and put . Then , and . Choose maximizing . Symmetry gives a positive maximum and on . Hence has , and on . In particular are independent.
Extend these linear functions from graph vertices affinely over each edge. Their slopes have absolute value at most one, so they are 1-Lipschitz for the graph path metric. Thus a path of successive -edges, or successive -edges, has endpoints at distance exactly : the path supplies the upper bound and , respectively , supplies the lower bound. Translates and reversals are likewise geodesics. Therefore the four such paths through form a geodesic quadrilateral.
Choose linear functionals on with , , and ; solving the nonsingular two-vector Gram system constructs them. Let . Their affine extensions to graph edges are -Lipschitz. At the midpoint of the side to , their values are . On each of the other three sides, either , , or . Consequently every point on those sides is at distance at least from that midpoint. Taking arbitrarily large contradicts [L2] for every proposed hyperbolicity constant. Since the finite generating set was arbitrary, [L0] excludes hyperbolicity of .
Depends on
Used by
- A product of two infinite groups need not be hyperbolic Counterexample
- Z² is not hyperbolic Counterexample
- FALSE: every abelian group is hyperbolic False statement
Dependency tree · two levels
13 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
- Clara Löh, Geometric Group Theory, Section 6.5.4 (standard reference, not scraped)