Alphabeta Math
LemmaStatement: AI-adaptedProof: AI-adaptedPipeline-generatedjudge pass (gpt-5.6-terra)audited 2026-09-09
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 C(1/6) 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 a, oriented from one endpoint to the other, and its two incident face-side occurrences. The faces may coincide; distinct faces are noncancelling.

[F1]

A common nonempty prefix of distinct symmetrised relator words is a piece, with the strict relative bound under C(1/6) (Sc toolkit symmetrised relators and pieces).

[F2]

Reduced diagrams have no adjacent pair with identical full relator readings at a common oriented edge (Sc toolkit minimal diagrams and cut vertex reduction).

[F3]

An internal arc retains its literal label and length after arc reduction (Arc reduction and combinatorial curvature of a disc diagram).

Proof

1.1

Start each incident face-side reading at the initial endpoint of a, choosing its orientation to traverse a in the given direction. The two readings have opposite planar orientations, even if they belong to the same face. Their words r,s belong to the symmetrised set and both begin with the nonempty label p of a. No free cancellation occurs inside p since it is a segment of a cyclically reduced relator.

F1F3
1.2

No nonempty cyclically reduced word equals a cyclic rotation of its inverse. Indeed, writing its letters bi with indices modulo its length m, such equality would give bi=bki1 for some integer k. If m is odd, or if m and k are both even, 2i=k has a solution modulo m, forcing a letter to equal its formal inverse, impossible in X±1. If m is even and k is odd, take i=(k1)/2 modulo m; then bi=bi+11, contrary to cyclic reduction. This includes proper-power words and uses no hypothesis on the presented group's torsion.

F1algebra
2.1

For distinct faces, equality r=s would give a cancellable pair, excluded by [F2]. For the same face, the two opposite orientations make s a cyclic rotation of r1, so step 1.2 excludes equality. Thus in both cases rs and p is a piece by [F1]. Under C(1/6), apply its bound to r and separately to s to obtain p<r/6 and p<s/6. No injectivity of a face attaching walk has been assumed.

F1F2step 1.1step 1.2

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