An improved lower bound for the distortion of a knotted curve

We prove that every non-trivial rectifiable tame knot embedding K ⊂ R³ has distortion δ(K) > 6.32. Consequently, the infimum within every non-trivial knot type is at least 6.32. The proof combines an acyclic essential-secant bootstrap, exact compatible affine radial transfers, covered joint-radius propagation, exact profile convolution, ordered failure boundaries, and retained distortion constraints through a common interior knot point. The complete computer-assisted certificate chain was run independently at 96-bit and 192-bit precision; each run certified 2,024,886 boxes across 52 sequential stages and 132 uniform regional results, with all 26 verification-source hashes frozen. This record contains the 19-page version 1.0 preprint and its complete reproducible source and verification package. The preprint has not been submitted to or accepted by a journal.

Authors

Institutions

Publication Details

Journal
Zenodo (CERN European Organization for Nuclear Research)
Published
2026-09-13
DOI
https://doi.org/10.5281/zenodo.22700127
Primary Topic
Geometric and Algebraic Topology
Type
preprint
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
preprint

An improved lower bound for the distortion of a knotted curve

Andrew A. Schoen
Zenodo (CERN European Organization for Nuclear Research)
Geometric and Algebraic Topology
preprint

An improved lower bound for the distortion of a knotted curve

Andrew A. Schoen
preprint en

Abstract

We prove that every non-trivial rectifiable tame knot embedding K ⊂ R³ has distortion δ(K) > 6.32. Consequently, the infimum within every non-trivial knot type is at least 6.32. The proof combines an acyclic essential-secant bootstrap, exact compatible affine radial transfers, covered joint-radius propagation, exact profile convolution, ordered failure boundaries, and retained distortion constraints through a common interior knot point. The complete computer-assisted certificate chain was run independently at 96-bit and 192-bit precision; each run certified 2,024,886 boxes across 52 sequential stages and 132 uniform regional results, with all 26 verification-source hashes frozen. This record contains the 19-page version 1.0 preprint and its complete reproducible source and verification package. The preprint has not been submitted to or accepted by a journal.

Zenodo (CERN European Organization for Nuclear Research)
Colorado Education Initiative (US)
Geometric and Algebraic Topology
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.