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.
Irregular switches in original face braids strictly improve essential disks
Statement
Start with the normal diagram constructed by the original-triangulation regular-sum construction, retaining its central-triangle and three-strip face braids. Let . A preliminary subset of its double curves may already have been switched regularly.
On some of its remaining double curves choose either the regular switch or its opposite, called an irregular switch, leaving the others unswitched. Suppose at least one irregular switch is performed. If a parametrizing component of the resulting diagram has an embedded proper PL disk as its image and its boundary is essential in , then there is an essential normal disk in the original triangulation with
Other components may intersect the image of along unswitched double curves; only itself is required to be embedded. Parametrizing components separate the branches at unswitched crossings. No irreducibility, orientability, projective-plane or choice hypothesis is imposed.
Statement references
Compatible normal vectors admit regular sum diagrams in the original triangulation
Triangular normal arcs admit braid position stable under partial regular switches — the actual three rectangular strips in each original face.
Essential PL disks admit normal disk replacements — essential disk replacement by edge-nonincreasing finite moves.
Facts & Assumptions
Given: The retained face-braid diagram, finite selections of regular and irregular switches, and the embedded essential disk component .
Every original tetrahedral double arc joins distinct faces, and every global double curve therefore meets some face. The regular switch at any crossed face is the monotone through reconnection in one of its three strips. Its opposite pairs the two outer-side branches and the two gate-side branches. Prior regular switches retain this same monotone strip description. (Compatible normal vectors admit regular sum diagrams in the original triangulation, Triangular normal arcs admit braid position stable under partial regular switches)
The replacement proof in Essential PL disks admit normal disk replacements uses tetrahedral cap replacements and compressions that fix the face boundary curves and edge intersections; sphere discards can only remove such intersections. Once all tetrahedral pieces are disks, an edge-return produces an actual edge bigon and removes two edge intersections, retaining an essential disk in the boundary-edge case. All later moves are nonincreasing in edge weight. These are the explicit local moves of that supplier’s proof, not an isotopy or irreducibility claim.
Proof
All switching neighborhoods miss . Hence every original edge-intersection point belongs to exactly one parametrizing component, and the sum of their edge weights is . In particular . If , apply [F2] to obtain an essential normal disk of weight at most , which proves the result. It remains to consider . In this case every original edge-intersection point belongs to , and every other parametrizing component has weight zero.
An irregularly switched global curve crosses some face by [F1]. Choose one of that face's rectangular strips containing an irregular reconnection. Parametrize it so the horizontal coordinate runs from the original edge to its central gate. Order its finitely many crossing neighborhoods from the outer edge toward the gate. If distinct neighborhoods have the same horizontal coordinate, shrink them and perturb their positions slightly along their monotone wires to order them; this keeps the wires monotone, preserves their crossings and changes none of their endpoint orders. Thus we may speak of the first irregular reconnection in this strip. To its outer side, all selected switches are regular, and any unswitched crossing just follows its original monotone wire.
Before that first irregular reconnection, every incoming parametrizing strand is horizontally monotone and joins its crossing neighborhood to an original endpoint on . The two incoming branches come from distinct such strands and distinct endpoints: all preceding crossings either keep two monotone strands separate in the normalization or regularly reconnect them from outer side to gate side. The irregular reconnection joins precisely these two incoming branches. It consequently creates a parametrizing arc with its two distinct endpoints on , lying entirely on the outer side of this reconnection except for its small turning cap. Later reconnections farther toward the gate cannot change this arc, since their neighborhoods lie beyond its maximal horizontal coordinate. This gives an edge-return parametrizing arc in the completed face diagram.
In the equality case of step 1.1, both endpoints of that return arc belong to . A face parametrizing arc lies in one global parametrizing component, so this entire arc belongs to . Its image is an embedded proper arc in the face, because is embedded. Its ends are two distinct intersections with the same original edge . Possible intersections with other parametrizing components do not affect this assertion about the arc within .
Normalize using [F2]. If a preliminary sphere discard or other move removes any edge intersection before all tetrahedral pieces are disks, its weight has already decreased and the final normal essential disk has weight less than . Otherwise no edge intersection has been removed. The cap preparations and tetrahedral compressions fix the face curves. A sphere discard could not have removed the return arc of step 3.1 without removing its two edge endpoints. Thus that arc remains on the retained essential disk when its tetrahedral pieces become disks. On either incident tetrahedron, its boundary circle then meets at least twice. The explicit bigon construction in [F2] gives a strictly weight-decreasing edge move; if is a boundary edge its two disk outputs have total weight smaller by two, and at least one has essential boundary. Keeping that disk again decreases weight strictly.
Finish the finite normalization [F2]. No subsequent move increases weight, so its essential normal disk satisfies . Together with step 1.1 this proves the Statement. The strict decrease comes from a return to an original edge, and has not used an auxiliary normal-coordinate objective or an ambient sphere theorem.
Depends on
Used by
- A nonfundamental least-weight essential disk has a pure boundary obstruction Lemma
- A reduced original normal pair for a least-weight essential disk has no projective-plane summand Lemma
- A reduced original normal pair for a least-weight essential disk has no spherical summand Lemma
- Between-copy proper exchanges have essential diagonals and rigid cap counts Lemma
- Boundary exchange leaf caps of a least-weight disk have rigid edge counts Lemma
- Closed normal subdiagrams inherit strict irregular disk improvement Lemma
Dependency tree · two levels
9 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
- Wolfgang Haken, Theorie der Normalflächen, Acta Mathematica105 (1961),245–375 (standard reference, not scraped)