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.
In a reduced C prime(1/6) null diagram, some face contributes more than half of its boundary to the outer boundary
Statement
Let be a nonempty reduced van Kampen diagram over a symmetrised presentation, and assume the boundary word of is freely reduced and nontrivial. Then some face of contributes more than half of its boundary to the outer boundary of .
Facts & Assumptions
Given: A nonempty reduced van Kampen diagram over a symmetrised presentation, with freely reduced nontrivial outer boundary word.
Such a diagram contains a shell whose inner boundary is a concatenation of at most three maximal internal arcs (Reduced C prime(1/6) diagrams satisfy the standard combinatorial curvature count).
Proof
By [L1], some boundary face of is a shell whose inner boundary is a concatenation of maximal internal arcs with . (For , this is the empty concatenation.) Let be the complementary outer arc of lying on .
If , the sum of the inner-arc lengths is . If , each internal arc is shared with a distinct neighbouring face, so reducedness makes its label a piece. Because the presentation satisfies , every such arc satisfies , and hence Thus in every case the total inner-arc length is less than half of .
Since is the disjoint union of the outer arc and the inner arcs , step 2.1 gives Thus contributes more than half of its boundary to the outer boundary of .
Depends on
Used by
- Finite C prime(1/6) presentations have solvable word problem Corollary
- Finite C prime(1/6) presentations satisfy a linear isoperimetric inequality Corollary
- A minimal diagram exhibits the Greendlinger face covering more than half its boundary Example
- FALSE: Greendlinger's lemma holds for every finite presentation False statement
- Dehn's algorithm terminates and decides the word problem for a Dehn presentation Theorem
Dependency tree · two levels
5 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)