Alphabeta Math
TheoremStatement: 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.

Finite subgroups of a hyperbolic group have uniformly bounded order

Statement

Let G be a hyperbolic group and fix a finite generating set S. Then there exists a constant BS such that every finite subgroup F≤G satisfies ∣F∣≤BS.

Facts & Assumptions

Given: A hyperbolic group G with finite generating set S. Choose a finite generating set T witnessing hyperbolicity and a slim-triangle constant δ for its Cayley graph X; the bound obtained from T also supplies the asserted BS.

[L1]

The geometric Cayley graph X is a geodesic metric space in which every geodesic triangle is δ-slim (Hyperbolic groups, Delta-slim triangles and hyperbolic spaces).

[L2]

The vertex ball of any fixed integer radius in X is finite because T is finite. Left translation by G is free and transitive on Cayley vertices: gx=hx for a vertex x∈G implies g=h.

Proof

technique · direct
1.1L1givenconstruct

Let F≤G be finite and put M=F⋅e, a finite set of vertices of X. For a vertex x define R(x)=max⁡m∈Md(x,m). The nonempty set of integer values R(x) has a least value R, attained at some vertex x. Left translation by each f∈F preserves M and distances, so R(fx)=R(x)=R. Thus the center set C={v∈G:R(v)=R} is F-invariant and contains the orbit Fx.

2.1L1step 1.1

Let x,y∈C, write D=d(x,y), and let z be the midpoint of a geodesic [x,y]. For any m∈M, slimness of the triangle with vertices x,y,m gives a point p on [x,m] or [y,m] with d(z,p)≤δ. In the first case, d(x,p)≥D/2−δ and d(x,m)≤R, so d(z,m)≤R−D/2+2δ; the second case is symmetric. Choose a vertex v of the edge containing z, with d(v,z)≤1/2. Then R(v)≤R−D/2+2δ+1/2. Minimality of R forces D≤4δ+1. Hence every two vertices of C, and in particular of Fx, are at distance at most 4δ+1.

3.1L2step 1.1step 2.1∎

The map f↦fx is injective by [L2]. The orbit Fx lies in the vertex ball about x of radius N=⌈4δ+1⌉, whose cardinality is the fixed finite number B=∣BX(e,N)∩G∣ by Cayley vertex transitivity. Thus ∣F∣=∣Fx∣≤B for every finite F≤G. Taking BS=B proves the assertion for the given S.

Depends on

Used by

Dependency tree · two levels

6 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