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.
Between-copy proper exchanges have essential diagonals and rigid cap counts
Statement
Let be a least-weight essential normal disk in a finite simplicial triangulation of a compact PL three-manifold, with lexicographically least normal vector among essential disks at that weight; put . In an actual original-triangulation regular diagram whose full resolution consists of two disjoint disks with vector , choose an original proper double arc whose exchange disk joins a trace on to a trace on .
Switch every other original curve regularly and leave this arc unswitched. Its two affected parametrizing components are embedded essential normal disks, each with vector . In the transverse exchange rectangle choose the cap on the upper side at each frontier, denoting these adjacent caps by ; write for the complementary disk in . Then
where equality is componentwise on the original global edges and positivity means positive total weight. The two original diagonal disks are joined to and joined to , along their original exchange continuations. The opposite, irregular pairing gives two embedded proper PL disks, at least one with null-homotopic boundary. This holds without fundamentalness, irreducibility, orientability or a choice principle. No normal parallelism of the caps is asserted.
Facts & Assumptions
Given: The actual original face-braid diagram and its exchange rectangle, with the two least disk copies and their specified transverse upper and lower germs. Counts refer throughout to the original triangulation.
Any partial regular resolution has embedded normal tetrahedral parametrizing disks and only its unswitched double curves. Its total vector and edge counts are unchanged. Compatible normal vectors admit regular sum diagrams in the original triangulation
Restricting to whole parametrizing components closed under their remaining double curves retains the original face strands and switches. In a face strip containing an irregular switch, the first such switch from the original edge joins two outer strands and produces a parametrizing arc returning to that edge. This is the actual local construction in steps 1.2–2.1 of Irregular switches in original face braids strictly improve essential disks, and its restriction is verified in steps 1.1–2.1 of Closed normal subdiagrams inherit strict irregular disk improvement. The return arc exists before any hypothesis about which component contains its endpoints.
For an embedded essential PL disk containing such an embedded face-return arc, the normal-replacement procedure either already loses an edge point in its preliminary moves, or preserves its face curve until tetrahedral pieces are disks and then removes two edge intersections at the return. It therefore gives strict decrease relative to this disk's own weight. For a second essential PL disk, the procedure is nonincreasing. These are the actual finite moves of Essential PL disks admit normal disk replacements and proof step 4.1 of Irregular switches in original face braids strictly improve essential disks, not an inference that the old one-output bound applies to each component separately.
A disk cap cut off by one proper trace on a normal disk has positive edge weight, by the distinct-side cell count. Normal exchange disk patches have positive edge weight
Proof
Resolve every curve except the chosen proper arc regularly. Only the pieces of incident to it can be affected by undoing it. Cutting their proper traces gives four disks . In the transverse rectangle label the upper left and right rays , and the lower left and right rays . The full regular pairing is ; the original unswitched diagonals are ; the irregular pairing is . Thus the inverse diagram has two parametrizing disks and , with their joining strips understood. Each is embedded: the only remaining double arc joins one branch from each component, and neither component has a self-intersection. They are normal by [F1], with . The irregular resolution instead gives two embedded PL disks and . All these joins are along proper boundary intervals, so the disk topology follows by gluing two disk parameters along an interval. All switching neighborhoods miss the original edges; in particular .
The disks cannot both be essential. Indeed their irregular resolution has a return parametrizing face arc by [F2]. It lies wholly on one of these two disk components, say , and is embedded there because is embedded. If both were essential, normalize strictly decreasingly by [F3] and nonincreasingly. To spell out the strict alternative, if a preliminary move or discard loses an edge point of , strict decrease is already obtained; otherwise its face curve and the return arc persist, and the edge bigon removes two intersections while retaining an essential disk. The two normal outputs then satisfy . Both must have weight at least , a contradiction. Consequently at least one irregular output has null-homotopic boundary. This is a joint weight argument, not the old bound of one output by the entire two-disk input weight.
Mark the exchange disk as a rectangle with frontier intervals and boundary connectors , in . Let be the original-boundary arcs of , both directed from to . Transport the original-boundary arcs of by , obtaining paths with the same endpoints. The original disk boundaries are and , up to basepoint transport, and both are essential. The inverse diagonal boundaries are and ; the irregular boundaries are and , up to conjugacy or inversion. A null-homotopic path loop is precisely a homotopy between with endpoints fixed. If either diagonal loop and either irregular loop were null, their common path would give either or with endpoints fixed. For example and imply ; pairing with instead gives . The other two cases interchange primes. Each contradicts an essential original boundary. Step 2.1 supplies a null irregular loop, so neither diagonal loop is null: both are essential. The connectors are those of the actual rectangle, not arbitrary path identifications.
The two essential normal disks have weights summing to , so least weight forces each to have weight . Their vectors sum to by step 1.1. At the first coordinate differing from , one would be smaller and the other larger. Lexicographic minimality among essential normal disks of this weight excludes that possibility. Hence .
The original strips are edge-free, and the four cut caps partition the original disk edge points. Thus , whereas . Subtraction gives . The complementary equalities similarly give . Each of these four caps is cut from one normal disk by the selected proper trace alone, so [F4] makes its total edge weight positive. This proves all assertions without identifying any raw cap replacement with an ambiently parallel normal cap.
Depends on
- Compatible normal vectors admit regular sum diagrams in the original triangulation
- Closed normal subdiagrams inherit strict irregular disk improvement
- Irregular switches in original face braids strictly improve essential disks
- Essential PL disks admit normal disk replacements
- Normal exchange disk patches have positive edge weight
Used by
Dependency tree · two levels
14 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: Ein Isotopiekriterium für den Kreisknoten, Acta Mathematica105 (1961),245–375 (standard reference, not scraped)