Alphabeta Math
TheoremStatement: Literature-sourcedProof: AI-adaptedprecheck passverified 2026-09-24 (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.

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 C>0 such that every null-homotopic word w has a van Kampen diagram with at most C∣w∣ 2-cells.

Facts & Assumptions

Given: AC and a finitely generated group G.

[F1]

Hyperbolic groups admit finite Dehn presentations (Hyperbolic groups admit finite Dehn presentations).

[F2]

Under AC, a finite presentation with algebraic relator area at most K∣w∣ and bounded relator lengths has uniformly slim triangles in its labelled geometric Cayley graph (Linear isoperimetry implies uniformly thin geodesic bigons).

[F3]

An expression with m relator factors produces a singular planar van Kampen diagram with no more than m 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).

[A1]

AC is used in [F2] for its cone and uniformity arguments (The Axiom of Choice).

Proof

technique · direct
1.1F1F3algebra

If G 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 ∣w∣ reductions before the empty word, so reversing them gives an expression of w as at most ∣w∣ conjugated relators. By [F3] it has a van Kampen diagram with at most ∣w∣ cells. The empty word has an empty diagram. Thus the displayed linear inequality holds, with C=1 (or any larger positive constant).

1.2givenF3algebra

Conversely suppose a finite presentation has diagrams with at most C∣w∣ 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 w is at most C∣w∣. If the given bound is real, take K=max⁡{0,C}; the area is integral, so the same inequality holds. Since the relator set is finite, its lengths have a finite bound L.

2.1F2A1step 1.1step 1.2∎

By [F2] and [A1], the bound in step 1.2 makes the labelled geometric Cayley graph uniformly slim. Hence G is hyperbolic. Together with step 1.1 this proves the equivalence.

Depends on

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