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.
Smooth knots have compatible piecewise-linear exterior models
Statement
Assume countable choice. Let be a smooth oriented knot with a finite regular projection diagram having crossings and a supplied product tube. There is a polygonal knot inside that tube with the same crossing code as and a smooth rounding of such that is smoothly ambient isotopic to . The compact exterior of this same has a good triangulation with at most tetrahedra and a marked path for the original meridian with at most boundary edges, for one universal constant . The peripheral-preserving exterior homeomorphism transfers this model to .
Statement references
Oriented links in the three-sphere and ambient isotopy — smooth knot and ambient-isotopy convention.
Regular oriented link diagrams — finite regular diagram and crossing-code conventions.
Planar-diagram, Gauss, and signed Dowker–Thistlethwaite codes — finite regular diagram and crossing-code conventions.
Smooth-to-piecewise-linear knot exterior approximation — code-preserving polygonal approximation, smooth rounding and peripheral-preserving exterior homeomorphism.
Linear-size good exterior triangulation from a planar knot code — linear-size triangulation of the supplied polygonal realization and marked meridian.
Hass–Lagarias–Pippenger, §7 — diagram-to-exterior triangulation and linear-size bound.
Facts & Assumptions
Given: Countable choice, a smooth knot , its finite regular diagram , and a supplied product tube.
is used only through the smooth isotopy extension in Smooth-to-piecewise-linear knot exterior approximation.
Smooth-to-piecewise-linear knot exterior approximation: admits a polygonal knot with the same code; a smooth rounding is smoothly ambient isotopic to ; and a homeomorphism carries 's exterior and marked meridian to those of .
Linear-size good exterior triangulation from a planar knot code: for a specified polygonal realization of the code, the construction triangulates that same exterior with at most tetrahedra and a meridian path of at most edges.
Proof
Apply [F1] to the supplied knot and diagram. It gives the polygonal realization with the same code, the smooth rounding ambient isotopic to , and the peripheral-preserving exterior homeomorphism.
Apply [F2] to this same specified polygonal knot . It gives its good exterior triangulation and marked meridian path with the stated bounds. Transport both through the peripheral-preserving homeomorphism in [F1]; homeomorphism does not change the number of tetrahedra or boundary edges in the combinatorial model.
Taking (or a larger fixed constant covering the zero-crossing template) proves the two bounds for the exterior of . Its smooth ambient isotopy to is supplied by [F1].
Depends on
- Oriented links in the three-sphere and ambient isotopy
- Knot exterior
- Meridian and preferred longitude
- Smooth-to-piecewise-linear knot exterior approximation
- Linear-size good exterior triangulation from a planar knot code
- Regular oriented link diagrams
- Planar-diagram, Gauss, and signed Dowker–Thistlethwaite codes
Used by
Dependency tree · two levels
22 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)