Alphabeta Math
TheoremStatement: Literature-sourcedProof: AI-adaptedSession-authored (Fable 5 assisted)precheck passjudge pass (gpt-5.6-terra)audited 2026-08-27
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

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 Cw 2-cells.

Facts & Assumptions

Given: A finitely generated group G.

[A1]

A finite Dehn presentation gives a linear isoperimetric inequality by shortening a trivial word one relator cell at a time.

[A2]

A finite presentation with linear isoperimetric inequality yields uniformly thin geodesic bigons, and hence a hyperbolic Cayley graph.

[L1]

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

Proof

technique · direct
1.1

If G is hyperbolic, then [L1] supplies a finite Dehn presentation, and [A1] turns that Dehn property into a linear isoperimetric inequality.

A1L1
2.1

Conversely, if a finite presentation satisfies a linear isoperimetric inequality, then [A2] gives thin geodesic bigons and hence a hyperbolic Cayley graph. Therefore the two conditions are equivalent.

A2step 1.1

Depends on

Used by

Dependency tree · two levels

15 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