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 presentation satisfies a linear isoperimetric inequality for van Kampen area.
Facts & Assumptions
Given: A finite presentation and a null word .
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).
Van Kampen area agrees with algebraic relator area (Minimal van Kampen area agrees with minimal algebraic relator area).
Minimal-area null diagrams are reduced (A minimal-area van Kampen diagram is reduced).
Proof
Freely reduce to a word . Because free reduction does not change the represented group element, is still null, and . If is the empty word, then the null diagram with no faces has area , so the claim is immediate. Otherwise let be a minimal-area van Kampen diagram for . By [L2], the diagram is reduced, so [L1] applies.
By [L1], some face of contributes an outer boundary arc with . Let be the complementary boundary arc of , so . Replacing by and freely reducing gives a null word with . Conversely, attach one -cell along the occurrence of in any minimal diagram for the unreduced replacement word and add the free-cancellation strips. This constructs a diagram for with one more face, so
Induct on the freely reduced boundary length. Step 1.1 gives the base case . For , step 2.1 yields a shorter freely reduced null word . By the induction hypothesis, Because , this is a linear isoperimetric inequality.
Finally, [F1] identifies van Kampen area with algebraic relator area, so the same linear bound holds in the algebraic formulation.
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
- GAP SmallCancellation manual, Chapter 1: Small Cancellation Theory — the classical conditions (standard reference, not scraped)
- Jay Williams, Universal Countable Borel Quasi-Orders (standard reference, not scraped)
- Nicholas Touikan, An Introduction to Combinatorial and Geometric Group Theory, Section 3.5 (standard reference, not scraped)
- Clara Löh, Geometric Group Theory: An Introduction, Section 7.4.1 (standard reference, not scraped)