Alphabeta Math
LemmaStatement: AI-adaptedProof: AI-adaptedSession-authored (Fable 5 assisted)precheck passaudited 2026-08-26
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.

For m3 and a triangulation T of the m-gon there is a unique k with 1<k<m such that {1,k} and {k,m} are both chords of T or sides, and T splits along k

Statement

Let m3 and let TPm be a triangulation of the labelled m-gon.

Then there is a unique index k with 1<k<m such that both {1,k} and {k,m} are sides or diagonals of the triangulation. Equivalently, the closing side {1,m} lies in a unique triangle with third vertex k.

For that index k:

  1. every diagonal of T has both endpoints in {1,,k} or both endpoints in {k,,m};
  2. the restriction of T to {1,,k} is a triangulation of the k-gon;
  3. the restriction of T to {k,,m} is a triangulation of the (mk+1)-gon.

Facts & Assumptions

Given: a natural number m3 and a triangulation TPm.

[F1]

A triangulation is a maximal set of pairwise non-crossing diagonals of the labelled polygon (Chords of a labelled convex polygon, crossing, and triangulations, defined combinatorially).

Proof

technique · direct
1.1

Let k be the least element of {2,,m1} such that {k,m} is a diagonal of T or the side {m1,m}. This set is nonempty because m1 belongs to it.

F1choose
2.1

The chord {1,k} is a side or lies in T. If it were a diagonal outside T, maximality would give a diagonal {p,q}T crossing it, so 1<p<k<q; if q<m then {p,q} would cross {k,m}, impossible, and if q=m then p<k would contradict the minimality of k.

F1step 1.1
3.1

Every diagonal of T has both endpoints in {1,,k} or both endpoints in {k,,m}. Indeed, if {p,q}T had p<k<q<m, then it would cross {k,m}; and if p=1<k<q<m, then q would satisfy the defining property of step 1.1 with q<k, again impossible.

F1step 1.1step 2.1
4.1

The diagonals of T with endpoints in {1,,k} form a triangulation of the k-gon, and those with endpoints in {k,,m} form a triangulation of the (mk+1)-gon: they are pairwise non-crossing because they are diagonals of T, and they are maximal because any extra diagonal in one sub-polygon would also be a diagonal of the whole polygon and would not cross any member of T by step 3.1. The index k is unique, for if another index with 1<<m had the same property, then the chords {1,k} and {,m} would cross when k<, or the symmetric crossing would occur when <k.

F1step 2.1step 3.1

Remarks

  • This is the polygon version of first return. The closing side {1,m} plays the role of the root edge, and the third vertex k is the split point.

Depends on

Used by

Dependency tree · two levels

23 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