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.
Finite normal-coordinate tests characterize essential disk candidates
Statement
Let be a triangulated compact exterior of a smooth knot with peripheral torus and a marked simple fibre meridian in the boundary triangulation. For an admissible normal-coordinate vector and its associated normal surface , the following tests hold exactly when is a connected properly embedded disk with non-null-homotopic boundary in : (i) is connected; (ii) ; (iii) ; and (iv) has odd mod-two intersection with . If is fundamental, connectedness follows from fundamentalness.
Statement references
Normal-surface coordinates and the Haken cone — normal-coordinate and admissibility conventions.
Matching equations and finite bounds for normal coordinates — admissible vectors represent normal surfaces.
Fundamental normal surfaces are connected — fundamental normal surfaces are connected.
A connected triangulated surface with Euler characteristic one and boundary is a disk — a connected surface with boundary and Euler characteristic one is a disk.
An essential disk in a knot exterior has longitude boundary — essential disk boundaries in this exterior meet the original meridian oddly.
Facts & Assumptions
Given: The triangulated knot exterior , its peripheral torus , marked fibre meridian , and admissible vector .
Normal-surface coordinates and the Haken cone: an admissible vector is a nonnegative integer vector satisfying all normal matching equations and the quadrilateral condition.
Matching equations and finite bounds for normal coordinates: every admissible integer vector is realized by a properly embedded normal surface with that vector.
A connected triangulated surface with Euler characteristic one and boundary is a disk: a connected compact triangulated surface with nonempty boundary and Euler characteristic is a disk.
An essential disk in a knot exterior has longitude boundary: every properly embedded disk with non-null-homotopic boundary in has boundary and odd mod-two intersection with .
Fundamental normal surfaces are connected: every nonempty fundamental normal surface is connected.
Proof
The hypothesis that is admissible has the meaning fixed in [F1]. By [F2], it determines a properly embedded normal surface , so its boundary lies in . If tests (i)–(iv) pass, then is connected, has nonempty boundary, and has Euler characteristic one. By [F3], it is a disk.
Conversely, suppose is a properly embedded disk with non-null-homotopic boundary. A disk is connected, has nonempty boundary, and has Euler characteristic one. By [F4], its boundary has odd mod-two intersection with , so all four tests pass.
If were null-homotopic in , its product projection would have degree zero. After a PL transverse perturbation, the mod-two intersection with the fibre meridian equals the parity of the preimages of a regular point under this projection; a lift to with zero net change crosses that regular level an even number of times. This contradicts test (iv). Thus the disk has non-null-homotopic boundary.
If is fundamental, [F5] already supplies test (i); the other tests remain exactly those stated. Steps 1.1–1.2 prove the equivalence.
Depends on
Used by
- Haken–Jaco–Tollefson normal-surface unknot search Algorithm
- A boundary-parallel disk fails the meridian test Counterexample
- Haken-search acceptance supplies an essential normal disk Lemma
- Jaco–Tollefson-search acceptance supplies an essential normal disk Lemma
- Polynomial verification of a primitive normal vertex-disk certificate Lemma
- Correctness and finite bounds of the Jaco–Tollefson vertex search Theorem
- Correctness of the Haken finite-box disk search Theorem
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
- Joel Hass, Jeffrey C. Lagarias, and Nicholas Pippenger, The Computational Complexity of Knot and Link Problems, Journal of the ACM 46 (1999) (standard reference, not scraped)
- Jeff Erickson, Normal Surfaces and Knots, Computational Topology lecture notes (2009) (standard reference, not scraped)