Finite witness principle for knot theory
Finite witness principle for knot theory
Let be a specified class of standard geometric or topological invariants, structures, or decompositions of knot types. For each , each knot type , and each generic projection direction , a finite witness scale is a number such that, for every , some finite subgraph, finite pattern, or finite decorated portion of the ropelength-filtered diagrammatic dynamics contains enough prescribed data to recover according to a finite rule specified for that class of structures.
Finite witness principle. For each , each knot type , and each generic projection direction , there exists a finite witness scale
Moreover, for such a specified class one expects a natural nondecreasing control function , or more generally , such that
whenever the finite recognition length is defined under the hypotheses of the paper. The strongest form asks whether, for broad concrete classes of invariants and structures, the relevant finite witness is already present at the recognition scale itself. This is presented as a programmatic principle rather than a theorem, and the source does not provide evidence resolving it.
Sources & referencesView supporting material
Primary source
Makoto Ozawa, “Finite Knot Theory via Ropelength-Filtered Reidemeister Graphs”, arXiv:2605.03350 (2026).
Progress summary
Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.
Solutions 0
Sign in to submit a solution.
No solutions have been posted yet.