Alphabeta Math
CorollaryStatement: Literature-sourcedProof: AI-generatedprecheck passaudited 2026-09-01
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.

Finite C prime(1/6) presentations satisfy a linear isoperimetric inequality

Statement

Every finite C(1/6) presentation satisfies a linear isoperimetric inequality for van Kampen area.

Facts & Assumptions

Given: A finite C(1/6) presentation and a null word w.

[L1]

A minimal reduced null diagram contains a face whose outer boundary arc is longer than half of that face boundary (In a reduced C prime(1/6) null diagram, some face contributes more than half of its boundary to the outer boundary).

[F1]

Van Kampen area agrees with algebraic relator area (Minimal van Kampen area agrees with minimal algebraic relator area).

[L2]

Minimal-area null diagrams are reduced (A minimal-area van Kampen diagram is reduced).

Proof

technique · direct
1.1

Freely reduce w to a word u. Because free reduction does not change the represented group element, u is still null, and uw. If u is the empty word, then the null diagram with no faces has area 0, so the claim is immediate. Otherwise let D be a minimal-area van Kampen diagram for u. By [L2], the diagram D is reduced, so [L1] applies.

L1L2givencases
2.1

By [L1], some face f of D contributes an outer boundary arc p with p>f/2. Let q be the complementary boundary arc of f, so q<p. Replacing p by q1 and freely reducing gives a null word u with uu1. Conversely, attach one f-cell along the occurrence of q1 in any minimal diagram for the unreduced replacement word and add the free-cancellation strips. This constructs a diagram for u with one more face, so Area(u)Area(u)+1.

L1step 1.1constructalgebra
3.1

Induct on the freely reduced boundary length. Step 1.1 gives the base case u=0. For u>0, step 2.1 yields a shorter freely reduced null word u. By the induction hypothesis, Area(u)Area(u)+1u+1u. Because uw, this is a linear isoperimetric inequality.

step 1.1step 2.1induction
4.1

Finally, [F1] identifies van Kampen area with algebraic relator area, so the same linear bound holds in the algebraic formulation.

F1step 3.1

Depends on

Used by

Nothing in the library uses this result yet.

Dependency tree · two levels

9 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