Alphabeta Math
TheoremStatement: 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.

Greendlinger shell existence from the curvature count

Statement

Let w be a nonempty freely reduced null word over a symmetrised C(1/6) presentation. The original linear word w contains a contiguous subword s that is an initial segment of a symmetrised defining relator r, with s>r/2.

Facts & Assumptions

Given: Such a word w and a minimum-area diagram for it.

[F1]

A non-point reduced diagram has a spur or a shell with at most three internal arcs, with its exterior arc contiguous in the full walk; zero-shells are allowed (Boundary spur or at most three shell from curvature).

[F2]

An internal arc in a reduced diagram has length less than r/6 on each adjacent relator r (Internal arcs of a reduced small cancellation diagram are pieces).

[F3]

Every null word has a minimum-area diagram, and every such diagram is reduced (Sc toolkit minimal diagrams and cut vertex reduction).

Proof

1.1

The diagram exists and is reduced by [F3]. Root its finite block tree at the boundary basepoint (or the block containing that point). A terminal bridge away from the root gives a spur excursion wholly inside the linear word, hence consecutive inverse letters, impossible since w is freely reduced. If there are no faces, the diagram is a tree; any nontrivial finite rooted tree has such a terminal spur away from the root. Since w is nonempty, the diagram is not a point. There is therefore a terminal disc block, with no attachments away from its parent attachment. When the root block is the only block, it is a disc and the chosen basepoint is the sole point to avoid inside the exterior arc.

givenF1F3
2.1

For a multi-face terminal block, choose one of the two shells supplied by [F1] whose exterior arc does not contain the attachment in its interior. If this is the root disc, avoid the basepoint instead. At most one of the two distinct exterior arcs can contain that specified point internally. The chosen arc therefore appears contiguously in the original outer boundary walk. For a one-face terminal block, the entire face boundary is a contiguous excursion from the attachment back to itself; when it is the root disc, start the full face reading at the given basepoint, so it is the original linear word. This also handles conjugating bridges leading from the basepoint to a single disc.

step 1.1F1
3.1

For a shell with i{1,2,3} internal arcs, their total length t satisfies t<ir/6r/2 by [F2]. Its exterior arc has length rt>r/2. For a zero-shell it has length r>r/2, since relators are nonempty. Step 2.1 places this segment in the original linear word. Choose the orientation and cyclic conjugate of the face relator that starts with this segment; symmetrisation ensures that this is again a defining relator. This proves the stated initial-segment conclusion.

step 2.1F2algebra

Depends on

Used by

Dependency tree · two levels

10 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