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.
Essential PL disks admit normal disk replacements
Statement
Let be a compact PL three-manifold with a finite simplicial triangulation. If contains a properly embedded PL disk whose boundary is not null-homotopic in , then it contains a normal disk with that property. No orientability, irreducibility or projective-plane hypothesis is required. The construction is allowed to replace disk pieces and to change the isotopy class of the original disk; it asserts existence of a normal replacement.
Statement references
Normal-surface coordinates and the Haken cone — normal triangle and quadrilateral disks.
Polygonal Jordan curve theorem: a polygon has exactly two complementary regions and is the frontier of each — the finite planar disk and cap constructions.
Every simple polygon admits a triangulation — the finite planar disk and cap constructions.
Facts & Assumptions
Given: The finite triangulation and an essential-boundary proper PL disk .
Finite simple planar polygons bound polygonal disk regions and those regions admit finite triangulations. The same finite disk facts apply to polygonal curves on the boundary of a tetrahedron: truncate a vertex disjoint from the curves, take a planar Schlegel diagram of the resulting convex polyhedron, and triangulate the two sides. (Polygonal Jordan curve theorem: a polygon has exactly two complementary regions and is the frontier of each, Every simple polygon admits a triangulation)
A normal tetrahedral disk has boundary meeting each tetrahedral edge at most once, and is of triangle or quadrilateral type. (Normal-surface coordinates and the Haken cone)
Proof
Put in finite PL general position: it misses vertices, meets edges transversely in finitely many points, and meets faces in finitely many arcs and circles. This is obtained by finite subdivision and small generic vertex displacements, choosing each displacement outside finitely many forbidden affine planes and lines. Preserve its proper boundary in the boundary faces. Every component of its intersection with a tetrahedron is a compact planar surface, because it is a subsurface of a disk. Components have nonempty boundary; an entire closed component in a tetrahedron would be a closed component of . Put and . A connected planar piece with boundary curves has , as is seen by cutting it along disjoint connecting arcs to a disk and counting the cuts. Thus is a pair of nonnegative integers.
We first record the permitted disk replacement inside a tetrahedron. Whenever a new cap is disjoint from the other pieces, a disk piece may be replaced, fixing its boundary and a smaller attaching collar, by that cap just inside its chosen boundary disk region. This preserves the topology of the entire surface: two disk parametrizations with the same boundary identification are homeomorphic relative to that boundary, extending the circle map radially. It is enough to choose the new cap disjoint from the other pieces. If all the pieces in question are disks, choose a point away from their boundary curves and take the disk side not containing that point for each curve. These disks are nested or disjoint by [F1]. Put the caps at successively deeper levels for successively larger nested regions, rounding their finite collar corners PL. This realizes all those disk pieces by disjoint caps. The same construction works in a boundary disk region containing only boundary curves of disk pieces, with other pieces kept outside its collar. The chosen depth intervals can be arbitrarily small. Boundary curves, edge intersections and the planar Euler deficits are unchanged. No assertion that the old disk is isotopic to the cap in the tetrahedron is needed.
If , select in some tetrahedron a boundary circle of a non-disk piece that is innermost among such boundary circles, using either fixed planar diagram of the boundary sphere. All boundary circles in its inner disk region are boundaries of disk pieces. Move those disk pieces to nested boundary-parallel caps as in step 2.1, at shallower collar depths. A copy of the inner boundary disk placed deeper than those caps, with boundary on a curve just inside the collar of in , is then an embedded compressing disk disjoint from all other pieces. Its boundary is essential in , since is planar with at least two boundary circles. Compress along it. Locally this splits off a disk and replaces by a planar piece with one fewer boundary circle, so decreases by one, while is unchanged. Globally compression of a disk along an interior simple circle gives a disk with the original boundary and a sphere. Keep the disk and discard the sphere; discarding pieces cannot increase or . The boundary of the retained disk is still essential.
Repeat step 3.1 until unless a preceding sphere discard has already decreased ; in that event restart with the smaller weight. At every tetrahedral intersection piece is a disk. We may rearrange these disk pieces as boundary-parallel caps by step 2.1, without changing or . This rearrangement is only preparation for the next simplifying move, so it introduces no infinite sequence of equal-complexity moves.
Suppose some disk boundary meets a tetrahedral edge more than once. The finite disjoint boundary circles on the tetrahedral sphere then admit an edge-return interval with endpoints on the same boundary circle and interior disjoint from all the boundary circles. To verify this, the complementary regions of finitely many disjoint circles on a sphere have a tree as their incidence graph: each added circle separates one region into two, by [F1]. The edge traces a walk in that tree. Crossing one circle more than once repeats a tree edge; any such walk has an immediate backtrack. The two consecutive crossings of that backtrack are the required endpoints of . Choose the cap side of its disk piece containing and use the compatible nested cap arrangement of step 2.1. The strip between and its parallel arc on this cap is a disk with , , and interior disjoint from all pieces: inner caps miss and outer caps lie deeper. This is an actual embedded edge-compressing disk.
If is an interior edge of , slide the strip of adjacent to across and beyond into the other sectors of the edge star. In the local product of an edge interval and a normal disk this is the elementary removal of a bigon; it removes precisely the two intersections at the ends of and creates no new edge intersections. It is an isotopy supported in that edge star and preserves the global boundary. Hence decreases. The new disk may have a larger local Euler deficit, which does not matter because the first complexity coordinate has decreased.
If , the same disk gives a boundary compression. Cutting the global disk along the proper arc and adding the two parallel copies of gives two proper disks. At least one has essential boundary. Indeed, after choosing a base point and whiskers in , the old boundary loop is the product of the two new boundary loops, with one conjugated by the connecting arc . If both new loops were nullhomotopic, so would be the old one. Keep an essential-boundary disk. The total edge intersection number of the two new disks is smaller than the old one by two, so the retained disk has strictly smaller . Again any increase of is permitted.
Each compression macro-move of step 3.1 either decreases or leaves it fixed and decreases ; each edge macro-move decreases . The intervening cap preparations are finite. Lexicographic descent in therefore terminates with an essential-boundary proper disk all of whose tetrahedral pieces are disks and all of whose boundary circles meet each tetrahedral edge at most once. A circle of intersection with an interior face would now be the entire boundary of a disk piece on either side, making a sphere component of the global disk. A circle on a boundary face would be the boundary of a disk lying entirely in one tetrahedron and would be nullhomotopic in that face. Both are impossible. Each face intersection is therefore an arc, and an arc returning to the same edge would violate the just established edge condition.
Each tetrahedral boundary circle meets an edge, since otherwise it would lie in one face and would have been excluded in step 7.1. It separates the four vertices into two subsets. An edge with endpoints on opposite sides must be crossed, and one with endpoints on the same side must be crossed an even number of times, hence not at all. The crossing set is consequently either the three edges separating one vertex from the other three, or the four edges separating two vertices from the other two. The boundary is thus a triangle or quadrilateral normal curve. Replace the finitely many disk pieces by standard parallel normal disks with those same boundary matchings; disjoint boundary curves permit only one quadrilateral type in a tetrahedron. Their finite gluing has exactly the same abstract surface topology and boundary essentiality as the retained disk. It is the required normal disk. This proof used only finite planar disk constructions and preserves essentiality at every retained-disk step.
Depends on
Used by
- A nonfundamental least-weight essential disk has a pure boundary obstruction Lemma
- Actual same-copy exchange caps have rigid original edge counts Lemma
- Between-copy annular exchange caps have rigid original edge counts 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
- Compatible normal surfaces admit finite circle-free tetrahedral position Lemma
- Irregular switches in original face braids strictly improve essential disks Lemma
- Haken normal essential-disk existence theorem Theorem
- Jaco–Tollefson normal essential-disk vertex theorem Theorem
- Least-weight lexicographic essential normal disks are fundamental Theorem
- Least-weight lexicographic essential normal disks are vertex disks Theorem
Dependency tree · two levels
7 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
- William Jaco and J. Hyam Rubinstein, 0-efficient triangulations of 3-manifolds (standard reference, not scraped)