Alphabeta Math
PropositionStatement: Literature-sourcedProof: AI-adaptedverified 2026-09-26 (gpt-6-sol)
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 A is a free abelian group of rank at least 2, then A is not hyperbolic.

Facts & Assumptions

Given: A free abelian group A with a basis of cardinality at least two, possibly infinite (Free abelian group on a set).

[L0]

A hyperbolic group is finitely generated and has a hyperbolic unit-edge Cayley graph for some finite generating set (Hyperbolic groups).

[L1]

Cayley edges correspond to the nonzero elements of the symmetric generating set (The Cayley graph of a group with respect to a subset).

[L2]

In a geodesic δ-hyperbolic space every geodesic quadrilateral is 2δ-thin (Hyperbolic spaces have thin geodesic quadrilaterals).

Proof

technique · direct
1.1givenL0L1algebra

If the basis is infinite, every finite set of group elements uses only finitely many basis coordinates and cannot generate A. Thus [L0] excludes hyperbolicity. Otherwise identify A with Zn, n≥2, and fix any finite generating set. Replace it by its nonzero symmetric closure S, which leaves the geometric Cayley graph unchanged by [L1]. It spans Rn.

2.1step 1.1choosealgebra

Choose s∈S of maximal Euclidean norm. The linear functional f(x)=⟨s,x⟩/∥s∥2 satisfies f(s)=1 and ∣f(a)∣≤1 for every a∈S, by Cauchy–Schwarz and maximality. Since S spans a space of dimension at least two, choose v∈S independent of s and put w=v−⟨v,s⟩s/∥s∥2. Then w≠0, ⟨w,s⟩=0 and ⟨w,v⟩>0. Choose t∈S maximizing ⟨w,t⟩. Symmetry gives a positive maximum and ∣⟨w,a⟩∣≤⟨w,t⟩ on S. Hence g(x)=⟨w,x⟩/⟨w,t⟩ has g(t)=1, g(s)=0 and ∣g(a)∣≤1 on S. In particular s,t are independent.

3.1L1step 2.1algebra

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 m successive s-edges, or m successive t-edges, has endpoints at distance exactly m: the path supplies the upper bound and f, respectively g, supplies the lower bound. Translates and reversals are likewise geodesics. Therefore the four such paths through 0,ms,ms+mt,mt form a geodesic quadrilateral.

4.1L0L2step 3.1choosealgebra∎

Choose linear functionals α,β on Rn with α(s)=1, α(t)=0, β(s)=0 and β(t)=1; solving the nonsingular two-vector Gram system constructs them. Let C=max⁡a∈Smax⁡{∣α(a)∣,∣β(a)∣}≥1. Their affine extensions to graph edges are C-Lipschitz. At the midpoint of the side 0 to ms, their values are (m/2,0). On each of the other three sides, either α=0, α=m, or β=m. Consequently every point on those sides is at distance at least m/(2C) from that midpoint. Taking arbitrarily large m contradicts [L2] for every proposed hyperbolicity constant. Since the finite generating set was arbitrary, [L0] excludes hyperbolicity of A.

Depends on

Used by

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