Alphabeta Math
TheoremStatement: AI-adaptedProof: AI-generatedPipeline-generatedjudge pass (gpt-6-luna)verified 2026-10-22 (gpt-6.1-sol)
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 K be a smooth oriented knot with a finite regular projection diagram D having n crossings and a supplied product tube. There is a polygonal knot P inside that tube with the same crossing code as D and a smooth rounding K♯ of P such that K♯ is smoothly ambient isotopic to K. The compact exterior of this same P has a good triangulation with at most C(n+1) tetrahedra and a marked path for the original meridian with at most C(n+1) boundary edges, for one universal constant C. The peripheral-preserving exterior homeomorphism transfers this model to K♯.

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 K, its finite regular diagram D, and a supplied product tube.

[A1]

ACω is used only through the smooth isotopy extension in Smooth-to-piecewise-linear knot exterior approximation.

[F1]

Smooth-to-piecewise-linear knot exterior approximation: D admits a polygonal knot P with the same code; a smooth rounding K♯ is smoothly ambient isotopic to K; and a homeomorphism carries P's exterior and marked meridian to those of K♯.

[F2]

Linear-size good exterior triangulation from a planar knot code: for a specified polygonal realization P of the code, the construction triangulates that same exterior with at most C0(n+1) tetrahedra and a meridian path of at most C0(n+1) edges.

Proof

1.1givenA1F1construct

Apply [F1] to the supplied knot and diagram. It gives the polygonal realization P with the same code, the smooth rounding K♯ ambient isotopic to K, and the peripheral-preserving exterior homeomorphism.

2.1F1F2step 1.1construct

Apply [F2] to this same specified polygonal knot P. It gives its good exterior triangulation and marked meridian path with the stated C0(n+1) 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.

3.1F1F2step 1.1step 2.1algebra∎

Taking C=C0 (or a larger fixed constant covering the zero-crossing template) proves the two bounds for the exterior of K♯. Its smooth ambient isotopy to K is supplied by [F1].

Depends on

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