Alphabeta Math
TheoremStatement: Literature-sourcedProof: AI-generatedprecheck passverified 2026-09-23 (gpt-6-sol)
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 D be a nonempty reduced van Kampen diagram over a symmetrised C′(1/6) presentation, and assume the boundary word of D is freely reduced and nontrivial. Then some face of D contributes more than half of its boundary to the outer boundary of D.

Facts & Assumptions

Given: A nonempty reduced van Kampen diagram D over a symmetrised C′(1/6) presentation, with freely reduced nontrivial outer boundary word.

[L1]

A reduced diagram with a face and freely reduced nontrivial boundary contains a shell with at most three maximal internal arcs (Reduced C prime(1/6) diagrams satisfy the standard combinatorial curvature count).

[L2]

Every internal arc of a reduced diagram is a piece, even when both side occurrences belong to the same face; under C′(1/6) its length is strictly less than one sixth of the incident face perimeter (Internal arcs of a reduced small cancellation diagram are pieces).

[F1]

A van Kampen diagram is a finite connected simply connected planar complex; in the absence of faces its graph is a tree (Van Kampen diagrams, boundary labels, and diagram area for a presentation).

Proof

technique · direct
1.1F1L1given

If D had no faces, [F1] would make it a tree. Every nontrivial closed walk in a tree has immediate backtracking, contradicting the freely reduced nontrivial boundary word. Thus D has a face, and by [L1] some boundary face f of D is a shell whose inner boundary is a concatenation q1⋯qi of maximal internal arcs with 0≤i≤3. (For i=0, this is the empty concatenation.) Let p be the complementary outer arc of ∂f lying on ∂D.

2.1L2step 1.1givenalgebra

If i=0, the sum of the inner-arc lengths is 0<∣∂f∣/2. If 1≤i≤3, each internal arc qj is a piece by [L2], including a possible self-incident arc. The strict C′(1/6) bound in [L2] gives ∣qj∣<∣∂f∣/6, and hence ∣q1∣+⋯+∣qi∣<i ∣∂f∣6≤∣∂f∣2. Thus in every case the total inner-arc length is less than half of ∣∂f∣.

3.1step 2.1algebra∎

Since ∂f is the disjoint union of the outer arc p and the inner arcs q1,…,qi, step 2.1 gives ∣p∣=∣∂f∣−(∣q1∣+⋯+∣qi∣)>∣∂f∣2. Thus f contributes more than half of its boundary to the outer boundary of D.

Depends on

Used by

Dependency tree · two levels

13 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