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.
Internal arcs of a reduced small cancellation diagram are pieces
Statement
The nonempty word on every internal arc of a reduced diagram is a piece, including an arc with the same face on both sides. Consequently in a diagram its length is strictly less than one sixth of each incident face perimeter, with boundary occurrences counted separately.
Facts & Assumptions
Given: An internal arc , oriented from one endpoint to the other, and its two incident face-side occurrences. The faces may coincide; distinct faces are noncancelling.
A common nonempty prefix of distinct symmetrised relator words is a piece, with the strict relative bound under (Sc toolkit symmetrised relators and pieces).
Reduced diagrams have no adjacent pair with identical full relator readings at a common oriented edge (Sc toolkit minimal diagrams and cut vertex reduction).
An internal arc retains its literal label and length after arc reduction (Arc reduction and combinatorial curvature of a disc diagram).
Proof
Start each incident face-side reading at the initial endpoint of , choosing its orientation to traverse in the given direction. The two readings have opposite planar orientations, even if they belong to the same face. Their words belong to the symmetrised set and both begin with the nonempty label of . No free cancellation occurs inside since it is a segment of a cyclically reduced relator.
No nonempty cyclically reduced word equals a cyclic rotation of its inverse. Indeed, writing its letters with indices modulo its length , such equality would give for some integer . If is odd, or if and are both even, has a solution modulo , forcing a letter to equal its formal inverse, impossible in . If is even and is odd, take modulo ; then , contrary to cyclic reduction. This includes proper-power words and uses no hypothesis on the presented group's torsion.
For distinct faces, equality would give a cancellable pair, excluded by [F2]. For the same face, the two opposite orientations make a cyclic rotation of , so step 1.2 excludes equality. Thus in both cases and is a piece by [F1]. Under , apply its bound to and separately to to obtain and . No injectivity of a face attaching walk has been assumed.
Depends on
Used by
Dependency tree · two levels
8 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
- Touikan §3.5 Figure 3.5.1 and following paragraph (standard reference, not scraped)