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 of rank .
Hyperbolicity of a finitely generated group is independent of the chosen finite generating set (Hyperbolicity of a finitely generated group is independent of the finite generating set).
Hyperbolic spaces have uniformly thin geodesic quadrilaterals (Hyperbolic spaces have thin geodesic quadrilaterals).
With the standard basis of , the Cayley graph contains geodesic rectangles of arbitrarily large width inside the first two coordinate directions.
Proof
By the rank hypothesis, with . In the standard Cayley graph, the points , , , and in the first two coordinates form a geodesic square of side length for every .
If the standard Cayley graph were hyperbolic, [L2] would give a uniform thinness constant for all geodesic quadrilaterals. But the midpoint of one side of the square from step 1.1 has distance from the union of the opposite sides, and is arbitrary. So the standard Cayley graph is not hyperbolic, and [L1] shows that itself is not hyperbolic.
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
12 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)