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.
Linear isoperimetric characterisation of hyperbolic groups
Statement
Assume the Axiom of Choice. A finitely generated group is hyperbolic if and only if it admits a finite presentation satisfying a linear isoperimetric inequality for van Kampen area: there is a constant such that every null-homotopic word has a van Kampen diagram with at most -cells.
Facts & Assumptions
Given: AC and a finitely generated group .
Hyperbolic groups admit finite Dehn presentations (Hyperbolic groups admit finite Dehn presentations).
Under AC, a finite presentation with algebraic relator area at most and bounded relator lengths has uniformly slim triangles in its labelled geometric Cayley graph (Linear isoperimetry implies uniformly thin geodesic bigons).
An expression with relator factors produces a singular planar van Kampen diagram with no more than faces (Relator expressions admit singular planar diagrams with controlled incidence). The least number of such factors is algebraic relator area (Algebraic relator area and the Dehn function of a finite presentation).
AC is used in [F2] for its cone and uniformity arguments (The Axiom of Choice).
Proof
If is hyperbolic, [F1] gives a finite presentation with the Dehn reduction property. For every nonempty null word, one reduction replaces a subword longer than half a defining relator by the complementary shorter subword, using one conjugate of that relator; the resulting freely reduced word is strictly shorter. Iterate. There are at most reductions before the empty word, so reversing them gives an expression of as at most conjugated relators. By [F3] it has a van Kampen diagram with at most cells. The empty word has an empty diagram. Thus the displayed linear inequality holds, with (or any larger positive constant).
Conversely suppose a finite presentation has diagrams with at most cells for every null word. The boundary word of any finite disc diagram is a product of conjugates of its face relators: choose a spanning tree of its edges, cut along that tree, and peel cells from the exterior; each peel contributes one conjugated relator and the cut-tree traversals cancel freely. Repeated vertices and edges are treated by their separate directed occurrences. Thus the algebraic relator area of is at most . If the given bound is real, take ; the area is integral, so the same inequality holds. Since the relator set is finite, its lengths have a finite bound .
By [F2] and [A1], the bound in step 1.2 makes the labelled geometric Cayley graph uniformly slim. Hence is hyperbolic. Together with step 1.1 this proves the equivalence.
Depends on
- Group presentation by generators and relations
- Hyperbolic groups
- Hyperbolic groups admit finite Dehn presentations
- Linear isoperimetry implies uniformly thin geodesic bigons
- Relator expressions admit singular planar diagrams with controlled incidence
- Algebraic relator area and the Dehn function of a finite presentation
- The Axiom of Choice
Used by
Dependency tree · two levels
29 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)