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.
Hyperbolic groups admit finite Dehn presentations
Statement
Let be a hyperbolic group. Then admits a finite presentation with the following Dehn property: every nonempty freely reduced word over representing the identity in contains a subword such that is longer than half of some cyclic conjugate of a relator in .
Facts & Assumptions
Given: A hyperbolic group .
For , every -local arc-length geodesic in a geodesic -slim space is a -quasi-geodesic; for , every positive-radius local geodesic is globally geodesic (Local geodesics in a hyperbolic space are uniform quasi geodesics).
For a fixed finite generating set, there are only finitely many words of length at most .
Proof
Choose a finite generating set for and a positive slimness constant for its Cayley graph. Choose an integer . By [F1], any -local geodesic arc is a -quasi-geodesic. If such an arc has the same initial and terminal vertex and positive length , the quasi-geodesic inequality gives , hence ; then the whole arc lies within the local-geodesic radius and would have to be geodesic, impossible between equal endpoints. Let be the finite set of nonempty freely reduced words over of length at most that represent the identity. Finiteness follows from [A2], and presents once the Dehn property below is proved.
Suppose a nonempty freely reduced trivial word contains no subword longer than half of a cyclic conjugate of a member of . If an ordinary subword of of length at most were nongeodesic, choose one of minimal length and call it , and choose a shorter geodesic word with the same endpoints. Minimality of implies that and share neither an initial nor a terminal edge: deleting such a common edge would give a shorter nongeodesic subword. Hence the loop word is freely and cyclically reduced. It belongs to , has length , and contains as more than half of a cyclic conjugate, a contradiction. Thus every ordinary length-at-most- subword of is geodesic. Read as the parameterized open path from the identity vertex back to itself; all its short consecutive segments are geodesic, so this open path is -local geodesic. No condition is imposed across a cyclic junction of .
Step 1.1 forbids a nonempty -local geodesic arc with equal endpoints, contradicting step 2.1. Hence every nonempty freely reduced trivial word has the required long relator subword. Replacing that subword by the shorter complementary piece of its relator, then freely reducing, strictly decreases word length while preserving its value in . Finite induction reduces every trivial word to the empty word using relations from , so presents and has the Dehn property.
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
- Clara Löh, Geometric Group Theory, Section 6.4 (standard reference, not scraped)
- Brian H. Bowditch, A course on geometric group theory, Section 2.3 (standard reference, not scraped)