Alphabeta Math
LemmaStatement: AI-adaptedProof: AI-generatedPipeline-generatedjudge pass (gpt-6-luna)verified 2026-10-22 (gpt-6.1-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.

Minimum boundary exchange cycles force an impossible zero-edge normal component

Statement

The reduced boundary pair in the pure boundary-obstruction lemma cannot occur for a least-weight, lexicographically least essential normal disk. The contradiction is in the original triangulation: a finite cycle of minimum leaf patches would give a nonempty zero-edge normalization component of a partial regular resolution, whose tetrahedral pieces are all genuine normal disks.

Statement references

Facts & Assumptions

Given: A hypothetical reduced pair P,H as stated, its retained face braids and all original switching neighborhoods, and the full-resolution disk F.

[F1]

A minimum original leaf E⊂P has positive weight m. Its opposite cap B=E′ has the same edge counts and weight, is disjoint from E, and contains exactly one minimum original leaf L⊂P. Either it equals L or it differs from L by a zero-edge rectangular corridor. (Boundary exchange leaf caps of a least-weight disk have rigid edge counts, Minimum boundary exchange leaves have a single-leaf zero-edge corridor)

[F2]

The middle disk of every such exchange has positive edge weight, and hence w(F)>2m. (Boundary exchange middle disks have positive original edge weight)

[F3]

Each exchange arc has a small rectangular exchange surface between its two full-resolution traces. Its interior misses F, its end intervals lie in the original boundary faces, and the rectangles for different arcs are disjoint. Cutting the two traces restores the four original rays. The original unswitched continuation pairs opposite rays, while the two uncrossings pair adjacent rays. (Compatible normal vectors admit regular sum diagrams in the original triangulation)

[F4]

Resolving any subset of original double arcs regularly leaves, in every tetrahedron, embedded normal triangle or quadrilateral disks, possibly forming an immersed global normalization along the remaining unswitched arcs. Every nonempty normalization component therefore meets the original one-skeleton: any one of its tetrahedral disks has normal vertices on that one-skeleton. (Compatible normal vectors admit regular sum diagrams in the original triangulation)

[F5]

The retained trace arcs on F are disjoint proper arcs. Two disk caps cut off by two such arcs are either disjoint, nested, or have union F. This follows by cutting the disk along the two arcs into three disks in a path and considering which side of each arc is the chosen cap. (Polygonal Jordan curve theorem: a polygon has exactly two complementary regions and is the frontier of each, Every simple polygon admits a triangulation)

Proof

1.1givenF1construct

There are finitely many original P leaves of minimum positive weight m. Map each to the unique minimum leaf contained in its opposite cap, as in [F1]. It cannot map to itself, because the two end caps are disjoint. Iterating this finite function gives a cycle of distinct leaves E1,…,Er with r≥2, with indices read modulo r. Write Bi for the opposite cap of Ei and αi for its original exchange arc. Then Bi contains precisely the original minimum leaf Ei+1 and has weight m. The arcs αi are distinct: one original double arc cuts off only one leaf of P when there are at least two double arcs. Otherwise it would cut P into its two leaves with no room for another cut arc.

2.1F1F2F5step 1.1contradiction

The caps Bi are pairwise disjoint. By [F5], non-disjoint caps must be nested or cover F in a pair. Nesting Bi⊂Bj puts the minimum leaf Ei+1 inside Bj, so uniqueness in [F1] forces Ei+1=Ej+1, contrary to distinct cycle indices. A pair covering F gives w(F)≤w(Bi)+w(Bj)=2m, contrary to [F2]. Thus neither overlap is possible.

3.1F1F3F5step 1.1step 2.1construct

Put Ri=Bi∖Ei+1‾, with closure in F. This is the zero-edge corridor of [F1]. It is nonempty. Its outer trace is the opposite-cap trace of αi, while its inner trace is the original leaf trace of the distinct arc αi+1. These are disjoint distinct traces by [F3] and [F5], so the two caps cannot be equal. The corridors Ri have pairwise disjoint interiors by step 2.1. Their union carries no original edge point.

4.1F1F3F5step 1.1step 2.1step 3.1construct

Remove the caps Bi from F and retain the closure F0 of their complement. It is a disk with the outer trace of each Bi as a boundary interval: successively removing disjoint end caps from a disk has this effect. All original Ei lie in the removed caps, since Ei⊂Bi−1. Across the rectangular exchange surface for αi, join Ei to F0 at the outer trace of Bi. These attachments are disjoint by [F3]. Attaching each disk along its one interval, with its rectangular collar, gives an embedded disk made of F0, the Ei and the attaching rectangles. Its discarded complementary pieces are precisely the corridors Ri, with the other local continuations at these exchange arcs. The next step identifies both continuations in the original diagram.

5.1F1F3step 1.1step 3.1step 4.1construct

Fix i. Label the original rays in cyclic order 0,1,2,3 so that 0 is Ei's P ray and 1 is Bi's H ray. These are adjacent, as proved by the leaf/opposite-cap supplier in [F1]. The other P ray is 2, and the other H ray is 3. The regular full resolution pairs 0 with 3 and 1 with 2: the other adjacent pairing would join the two end caps and is irregular. The trace between 0,3 is the boundary of Ei, and that between 1,2 is the boundary of Bi. Near the first trace, ray 3 lies in Ri−1; near the second, ray 1 lies in Ri and ray 2 lies in F0. Thus the attachment of step 4.1 pairs retained rays 0,2, while the discarded corridors pair rays 1,3. These are exactly the two original unswitched continuations. There is no irregular switch in this construction.

6.1F3F4step 3.1step 4.1step 5.1construct

At every arc outside the cycle retain the original regular resolution. Neither the retained/discarded division nor its frontier crosses either trace of such an arc, because its frontier consists solely of the cycle traces used in step 5.1. Thus each local regular output has both of its incident parts retained or both discarded. At every cycle arc, use the two unswitched continuations of step 5.1. Hence this is precisely the original partial regular resolution that leaves the cycle arcs unswitched and resolves all others regularly. Its normalization splits into a retained union containing the disk in step 4.1 and a discarded union consisting of the nonempty Ri with their indicated continuations. The local pairing check ensures neither union has a frontier in that normalization; intersections of their images along an unswitched arc do not identify their parametrizing sheets.

7.1F3F4step 3.1step 6.1contradiction∎

Every discarded piece and its short continuing strip misses T(1), by step 3.1 and [F3]. Their union is nonempty and is a union of normalization components by step 6.1. Choose one such component. It is a nonempty zero-edge component of an actual partial regular resolution, contradicting [F4]. This contradiction also covers the case where the cycle contains every arc: that partial resolution is just the original unswitched pair, whose tetrahedral disks still have normal vertices. Therefore the hypothetical reduced boundary pair does not occur.

Depends on

Used by

Dependency tree · two levels

26 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