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 boundary-parallel disk fails the meridian test
Statement refuted
Every connected admissible normal surface in a finite triangulated knot exterior with nonempty boundary and Euler characteristic one passes the odd-meridian-intersection test for an essential normal disk.
Statement references
Normal-surface coordinates and the Haken cone — normal vertex-link triangles and normal-coordinate conventions.
Finite normal-coordinate tests characterize essential disk candidates — the essential-boundary test in the normal-disk filter.
Hass–Lagarias–Pippenger, Lemma 4.2 and §5 — disk recognition and the meridian-intersection condition.
Erickson, “Normal Surfaces and Knots,” §§14.2–14.4 — boundary-parallel disks and normal-surface filtering.
Facts & Assumptions
Given: A finite simplicial triangulation of a compact knot exterior with torus boundary and a marked meridian curve in its boundary triangulation.
Let be any finite simplicially triangulated knot exterior with boundary torus and marked meridian . For a boundary vertex , its normal link is a properly embedded boundary-parallel disk: its boundary is the link of in , a contractible simple closed curve. The link is connected, has nonempty boundary and Euler characteristic one, but its boundary has even mod-two intersection with , so the normal-surface filter rejects this candidate. Rejecting this one boundary-parallel disk does not determine whether the knot is nontrivial.
Normal-surface coordinates and the Haken cone: a normal surface meets each tetrahedron in a union of triangle and quadrilateral disks, and its face arcs match. In a simplicial triangulation of a PL -manifold, the link of a boundary vertex is a triangulated disk.
Finite normal-coordinate tests characterize essential disk candidates: an admissible vector is an essential disk candidate exactly when it is connected, has nonempty boundary, Euler characteristic one, and odd mod-two meridian intersection.
Counterexample
The link of a boundary vertex in a triangulated -manifold is a closed disk: its local link is a -ball. In each tetrahedron containing the link meets that tetrahedron in the small triangle parallel to the opposite face; it misses tetrahedra not containing . Across each shared face these triangles have matching normal arcs, so [F1] makes the link a normal surface. Its boundary is , a simple closed curve in the small boundary-star disk of , hence contractible in . The local half-ball star shows the disk is boundary-parallel.
The link disk is connected, has nonempty boundary, and has Euler characteristic one. Its boundary is null-homotopic, so its projection to the product-circle factor has degree zero. After a transverse PL perturbation, the parity of intersections with a fibre meridian equals the parity of preimages of a regular point under that projection; a lift with zero net degree crosses the level an even number of times. Hence the intersection parity is zero.
The disk therefore passes the first three tests in [F2] but fails the odd-intersection test, so the filter rejects this candidate. This conclusion concerns this boundary-parallel disk only; it does not rule out any other normal essential disk in and therefore does not classify the knot.
Depends on
Used by
Nothing in the library uses this result yet.
Dependency tree · two levels
6 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)