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.
A regular normal-sum diagram has a reduced connected pair
Statement
Let be a finite simplicial triangulation of a compact PL three-manifold. Suppose a regular normal-sum diagram is supplied with the following data:
- Two nonempty embedded normal surfaces in transverse PL position, with no triple points and finitely many disjoint double circles and proper double arcs.
- Pairwise disjoint switching neighborhoods of those double curves, disjoint from , with compatible chosen regular switches. In each tetrahedron the local switch reconnects two crossing normal disks to normal disks of the same two types. A partial switch therefore leaves a finite immersed normal-disk diagram, with only the unswitched double curves and without branch points. Switches in disjoint neighborhoods commute.
- Performing all the switches gives a connected embedded normal surface .
Then some partial switching gives a diagram whose normalization has exactly two components . Here normalization means separating the two branches at every remaining double point; its components are the parametrizing surfaces, regardless of intersections between their images. Both and are connected embedded normal surfaces. They have
Their remaining switching system is reduced in the following precise sense: switching any nonempty subset of its curves gives a diagram with connected normalization. In particular no remaining intersection circle or proper intersection arc separates both and when each is cut along its corresponding preimage.
All surfaces and vectors remain in the original triangulation . No orientability, irreducibility or choice hypothesis is needed. The existence of a regular normal-sum diagram from an arbitrary coordinate decomposition is an input to this lemma, not a conclusion.
Statement references
Normal-surface coordinates and the Haken cone — normal disk types, coordinate addition and edge intersections.
Facts & Assumptions
Given: The supplied diagram, switching neighborhoods and connected full resolution .
Every local regular switch preserves its two normal disk types and its edge intersections, and switches in disjoint neighborhoods commute. These are the explicit diagram hypotheses; they are not inferred from an unproved coordinate-to-diagram construction. (Normal-surface coordinates and the Haken cone)
A switch along one double curve changes only the parametrizing components containing its two branches. Thus it affects at most two components. The other components are unchanged. Cutting and gluing the nonempty affected surfaces never deletes them entirely: the switch only replaces their local strips in its neighborhood.
Proof
Write for the finite set of double curves. For each subset , perform just its chosen switches and take the normalization of the resulting diagram. The empty subset gives at least two components because it is parametrized by the nonempty disjoint union . The full subset gives the connected surface . Choose a subset of maximal cardinality among those giving disconnected normalization. The finite list of subsets makes this a finite choice. Then , and every strict superset of gives connected normalization.
The normalization after switching has exactly two components. Otherwise choose any remaining double curve. By [F2], its switch affects at most two components; at least one component remains unaffected and at least one affected component remains nonempty. The normalization after that additional switch would still be disconnected, contrary to maximality in step 1.1. It already had at least two components by the choice of , so it has exactly two. Denote them by .
No remaining double curve has both branches in the same one of . If it did, its switch would leave the other component unchanged and nonempty, and the affected component would also remain nonempty by [F2]. This would again contradict step 1.1. Thus every remaining crossing is between and . There are no self-intersections of either component, because any such self-intersection would lie on a remaining double curve. There are no other singularities by the diagram hypothesis. Consequently each component is an embedded normal surface: its tetrahedral disk pieces are normal by [F1], their sides match as in the partial diagram, and their interiors have no self-intersections. They are connected by their definition as normalization components.
Let be any nonempty subset of the remaining curves. Switching it gives the normalization for , which is connected by step 1.1. For the separation consequence, suppose a remaining circle or arc separates both and . Cutting along its preimages gives exactly two pieces of each connected surface. The crosswise switch pairs the two cut copies from with the two cut copies from , producing exactly two nonempty parametrizing components. This applies to annular cutting collars of separating circles and to rectangular cutting collars of separating proper arcs. Other unswitched double curves are merely intersections of the images and do not join normalization components. Thus that one switch would have disconnected normalization, contrary to the first assertion of this step.
The partial diagram and its full resolution have the same total number of normal disks of every type by [F1]. The two normalization components therefore satisfy . All switches miss the triangulation edges, giving as well. Each nonempty normal surface contains a normal triangle or quadrilateral and hence meets an edge, so both summand weights are strictly positive. Their sum is , making both strictly smaller than . All operations took place in the supplied neighborhoods in the original , proving every assertion.
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
- Boundary exchange leaf caps of a least-weight disk have rigid edge counts Lemma
Dependency tree · one level
1 result within one dependency step 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)