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.
Hg toolkit finitely many cayley cone types
Statement
For a finite generating set of a hyperbolic group, there are only finitely many geodesic cone types More precisely, with a slimness constant , set . The finite-set datum determines , so at most cone types occur.
Facts & Assumptions
Given: The standing finite-generator geometric hyperbolicity convention of Hg toolkit hyperbolic group and stable length; write .
Finite generating sets have finite word-metric balls by Balls of a word metric are finite if and only if the generating set is finite.
The product condition holds with by Slim triangles imply the gromov product inequality.
Proof
We first derive the radial bound needed below. For specified geodesics , suppose , and let be their radius- points. They exist since products do not exceed either radial length. We have and . Apply F2 through the chain : two product inequalities give . Hence . This calculation includes and .
Fix with . The identity lies in both cones. If and , then and hence . Thus , while . Integral word lengths force equality, proving .
Induct on , assuming cone membership transfers for shorter elements. If , take a shortest spelling with and . The inequalities force ; hence by induction. Suppose for a contradiction that . Writing , the endpoint has length between and , by its distance from and the failed cone equality. In particular its length is at least .
Choose the geodesic from through to provided by the equality in step 2.1, and any geodesic from to . Their endpoints have distance and product at least . Let be the vertex at radius on the second geodesic, and put . The vertex exists because its length is at least . Step 1.1 gives . Also and . Set . Then , so .
Since , we obtain , a contradiction. This proves by induction. Interchanging proves equality. The finite-radius set in the statement is finite by F1 (it is contained in the open radius- ball), so has finitely many subsets, at most to its cardinality. Each possible determines just one cone, establishing finiteness and the stated count. Only finitely many geodesics are chosen for each specified inductive comparison; no AC is used.
Depends on
Used by
Dependency tree · two levels
16 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
- Hamann Proposition 5.2.3 pp.85–87; complete proof (standard reference, not scraped)