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.
Linear-size good exterior triangulation from a planar knot code
Statement
For every valid connected one-component oriented planar knot code with crossings together with a specified polygonal realization whose regular projection has that code, there is an explicit finite combinatorial construction of a triangulated containing that same as a subcomplex. An abstract valid code can first be realized by the stated reconstruction procedure and then used as . A good exterior triangulation is the triangulation inherited on the complement of the interior of a regular neighborhood made from one fixed ball around each vertex of and one fixed tube block along each edge, with its boundary torus triangulated and a meridian path marked. The construction gives a good exterior triangulation with at most tetrahedra for one universal constant , and the marked meridian is a path of at most boundary edges. At the construction uses a fixed solid-torus exterior triangulation.
A local crossing is lifted by separating the over- and under-strands in the interval direction; the schematic below records only the projected crossing, with the continuous strand passing over the gapped strand.
\begin{tikzpicture}[scale=1.15]
\draw[very thick] (-1,-1)--(1,1);
\draw[thick] (-1,1)--(-0.18,0.18);
\draw[thick] (0.18,-0.18)--(1,-1);
\node at (0.62,0.78) {over};
\node at (-0.70,0.76) {under};
\end{tikzpicture}
The picture records only the planar local incidence. The proof constructs disjoint arcs in a three-dimensional crossing block and does not infer embeddedness from the drawing.
Statement references
Planar-diagram, Gauss, and signed Dowker–Thistlethwaite codes — dart, crossing, orientation, and face-cycle conventions.
Realizability and face validation for planar-diagram codes — a valid spherical rotation system has a polygonal realization with disk faces.
Planar-code validation and diagram reconstruction — the finite crossing-disk, edge-band and face-cap gluing record.
Planar-code validation and reconstruction procedure properties — the reconstruction record represents the declared oriented diagram.
Hass–Lagarias–Pippenger, §7 — linear-size triangulation of a knot exterior from a diagram.
Facts & Assumptions
Given: A valid connected one-component oriented planar knot code with crossings and a specified polygonal realization of that code.
Planar-diagram, Gauss, and signed Dowker–Thistlethwaite codes: the code gives a finite connected four-valent graph, directed strand pairings, over/under data and a face permutation.
Realizability and face validation for planar-diagram codes: when , the rotation system has a spherical polygonal realization with disk faces.
Planar-code validation and diagram reconstruction: a passing code yields one crossing disk per crossing, one edge band per edge, and one cap per face, with recorded ports and face cycles.
Planar-code validation and reconstruction procedure properties: the output gluing record represents the oriented link diagram described by the input code.
Proof
If , there are darts and paired edges. The connected crossing graph has , , and hence faces by [F2]. The sum of face-boundary port occurrences, counted with multiplicity, is . Choose disjoint small disks around the graph vertices and disjoint narrow rectangular bands along its edges, attached in the prescribed cyclic order. Their union is a connected planar subsurface of the sphere; each boundary component is one face cycle, and the closure of each complementary component is a disk. The total number of vertex-disk ports, band sides and boundary occurrences is bounded by a universal constant times .
Triangulate each vertex disk and edge band by fixed templates. Subdivide every side occurrence on each complementary face boundary circle by a fixed number of new vertices and cone the resulting simple polygon to one interior vertex. Each face of boundary length contributes at most triangles for a fixed , and by step 1.1. Since the face boundary circles of are embedded circles with port occurrences kept distinct, these are regular disk triangulations; matching subdivisions along shared ports and one fixed barycentric subdivision give a genuine finite simplicial triangulation of the projection sphere with triangles.
Take the product of this triangulated sphere with an interval. Each triangular prism is split into three tetrahedra by the fixed staircase subdivision; cap the two ends by coning their triangulated boundary spheres to obtain a triangulated with tetrahedra. In each crossing disk, place the over- and under-strand arcs at distinct interval heights and connect each pair of opposite ports; along each edge band connect its end ports by a linear arc whose height interpolates between the endpoint heights. In a crossing block the two arcs are disjoint because their heights differ; interiors of distinct edge blocks are disjoint, and every edge arc joins only its designated crossing ports. A fixed subdivision of each crossing and edge block makes these finitely many local arc templates subcomplexes. For the supplied , choose the disks and bands along its actual projection. Carry the templates to its actual strand heights by increasing piecewise-linear maps of the interval fibres, fixed at the top and bottom; at a crossing the prescribed two heights have the same order, so both can be matched. Choose the maps identically on shared port collars and extend over the remaining face regions, triangulating the finitely many height graphs and interpolating between successive levels. Extend over the two end balls by coning the boundary maps. These maps give a PL homeomorphism of the template sphere carrying its template knot to the supplied . Transport the triangulation through it. Its abstract simplex count remains , even if the PL parametrizations require further subdivisions in ambient coordinates; thus the same is a subcomplex.
Around each vertex and edge of the 1-subcomplex , take the fixed ball and tube blocks from the definition of a good exterior triangulation. Choose a normal 2-frame at one point, extend it across the finitely many edge and vertex blocks, and adjust the final frame along the last edge by a path of rotations in to agree with the initial frame. Thus their union is the product , a solid torus with triangulated boundary. The number of blocks and tetrahedra per block is constant, so removing its interior leaves a compact triangulated exterior with tetrahedra. At an interior point of a chosen knot edge, the fixed local tube template has a meridian circle using a fixed number of boundary edges; mark that path.
If , use the standard genus-one product decomposition of into two solid tori and the fixed product triangulation of the exterior solid torus as a triangle times a three-edge circle. Splitting its three triangular prisms into three tetrahedra each and marking the three-edge circle on its boundary gives a fixed-size model: this is the original knot's meridian, meeting an exterior disk boundary once. For a supplied crossingless , parametrize its polygonal projection disk and the complementary sphere disk and match its height graph by the same fibre construction as in step 3.1; transport the fixed model through the resulting PL homeomorphism. Increasing to dominate this model and all fixed local template constants in steps 2.1, 3.1 and 4.1 yields both stated bounds. All code-dependent choices use the finite label and port order, so the construction is explicit.
Depends on
Used by
- Haken–Jaco–Tollefson normal-surface unknot search Algorithm
- Worked case: a normal disk in the zero-crossing unknot exterior Example
- Correctness of the Haken finite-box disk search Theorem
- Smooth knots have compatible piecewise-linear exterior models Theorem
- Termination, correctness, and bounds of normal-surface unknot recognition Theorem
- Unknot recognition has a polynomial-bit normal-surface certificate Theorem
Dependency tree · two levels
8 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)