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 be a hyperbolic group and fix a finite generating set . Then there exists a constant such that every finite subgroup satisfies .
Facts & Assumptions
Given: A hyperbolic group with finite generating set . Choose a finite generating set witnessing hyperbolicity and a slim-triangle constant for its Cayley graph ; the bound obtained from also supplies the asserted .
The geometric Cayley graph is a geodesic metric space in which every geodesic triangle is -slim (Hyperbolic groups, Delta-slim triangles and hyperbolic spaces).
The vertex ball of any fixed integer radius in is finite because is finite. Left translation by is free and transitive on Cayley vertices: for a vertex implies .
Proof
Let be finite and put , a finite set of vertices of . For a vertex define . The nonempty set of integer values has a least value , attained at some vertex . Left translation by each preserves and distances, so . Thus the center set is -invariant and contains the orbit .
Let , write , and let be the midpoint of a geodesic . For any , slimness of the triangle with vertices gives a point on or with . In the first case, and , so ; the second case is symmetric. Choose a vertex of the edge containing , with . Then . Minimality of forces . Hence every two vertices of , and in particular of , are at distance at most .
The map is injective by [L2]. The orbit lies in the vertex ball about of radius , whose cardinality is the fixed finite number by Cayley vertex transitivity. Thus for every finite . Taking proves the assertion for the given .
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
- Clara Löh, Geometric Group Theory, Section 6.2.1 (slim-triangle background; the finite-orbit argument is proved below) (standard reference, not scraped)