arxiv: 2605.03350 · v1 · submitted 2026-05-05 · 🧮 math.GT · math.MG

Recognition: unknown

Finite Knot Theory via Ropelength-Filtered Reidemeister Graphs

Makoto Ozawa

Pith reviewed 2026-05-07 13:22 UTC · model grok-4.3

classification 🧮 math.GT math.MG MSC 57M25

keywords knot theoryReidemeister graphsropelengthfinite recognitionthick knotsdiagrammatic classificationprojection directions

0 comments

The pith

Each knot type is recognized up to mirroring by a finite characteristic Reidemeister pattern that first appears in its ropelength-filtered lifted graph at scale L_char,u(K).

A machine-rendered reading of the paper's core claim, the machinery that carries it, and where it could break.

The paper develops finite knot theory by studying thick representatives through ropelength-filtered lifted Reidemeister graphs that record diagram data and admissible moves below a given length bound. It applies the finite-local reconstruction theorem to extract characteristic patterns and defines the finite recognition length L_char,u(K) as the smallest scale at which such a pattern distinguishes the knot up to mirroring. This graph-theoretic construction holds unconditionally for polygonal models and finite-dimensional approximations. A reader would care because the definition supplies a concrete, bounded threshold for knot recognition rather than requiring infinite or exhaustive diagram data.

Core claim

For each knot K and projection direction u, the ropelength-filtered lifted Reidemeister graph G^lifts_Λ,u(K) records all diagram data and Reidemeister moves that lift to admissible thick deformations at ropelength levels below Λ. Using the finite-local reconstruction theorem, characteristic Reidemeister patterns are identified, and the finite recognition length L_char,u(K) is the first such Λ at which a recognizing pattern for K, up to mirroring, appears in the graph.

What carries the argument

The ropelength-filtered lifted Reidemeister graphs G^lifts_Λ,u(K) that encode diagram data together with Reidemeister moves liftable to thick deformations below level Λ.

Load-bearing premise

The corresponding statements for the full C^{1,1} ropelength-sublevel space require explicitly isolated projection-Cerf tameness and coherent finite-pattern thick-movie liftability.

What would settle it

An explicit knot K together with a direction u for which no finite recognizing pattern ever appears in G^lifts_Λ,u(K) at any finite Λ would falsify the recognition claim.

Figures

Figures reproduced from arXiv: 2605.03350 by Makoto Ozawa.

**Figure 1.** Figure 1: The main passage of the paper. Ideal-stratum persistence in the ropelength sublevel spaces is projected to finite Reidemeister data; finite characteristic patterns in the lifted graph give the finite recognition length, and motivate a finite-witness principle for selected natural structures. The role of Cerf theory is to explain why graph growth is governed by wall crossings. This viewpoint is also in line… view at source ↗

**Figure 2.** Figure 2: The no-go principle for global Reidemeistergraph inclusion orders. Once a finite rooted typed neighborhood that is characteristic for K occurs in GS(K′ ), the target knot type is forced to be K or its mirror. Thus the nontrivial object is not full-graph inclusion, but the scale at which such a finite pattern appears in the ropelength-filtered lifted graph. In particular, if there is an embedding Φ: GS(K)… view at source ↗

**Figure 3.** Figure 3: Projection–Cerf bookkeeping. The regular projection regions are separated by codimension-one Reidemeister walls. A generic admissible path crosses these walls one at a time, producing a finite sequence of liftable Reidemeister transitions in the lifted graph. (iii) of type R3 if the singularity is a transverse triple point producing a Reidemeister III transition. We denote the corresponding parts of the … view at source ↗

**Figure 4.** Figure 4: Diagrammatic merge scales and finite recognition. The merge tree records the H0-level shadow of graph growth from ideal components. The finite recognition length records when a characteristic finite Reidemeister pattern becomes visible; the finite principle asks, for specified natural classes, whether invariant or structural data have finite witness scales controlled by this recognition scale. Proof ass… view at source ↗

read the original abstract

This paper develops a form of finite knot theory as a diagrammatic sequel to the ideal-stratum and deformation-persistence framework for knot types. Thick representatives in bounded ropelength sublevel spaces are studied through the finite Reidemeister data visible in generic projections. For each projection direction $u$, we introduce the ropelength-filtered lifted Reidemeister graphs $\mathcal{G}^{\mathrm{lift}}_{\Lambda,u}(K)$, for $\Lambda\ge \mathrm{Rop}(K)$, recording diagram data and Reidemeister moves that lift to admissible thick deformations below the ropelength level $\Lambda$. Using the finite-local reconstruction theorem of Barbensi--Celoria, we define characteristic Reidemeister patterns and the finite recognition length $L_{\mathrm{char},u}(K)$, the first ropelength scale at which a finite pattern recognizing $K$, up to mirroring, appears in the lifted graph. The finite-local graph-theoretic part is unconditional; finite-dimensional and polygonal models provide controlled settings; the corresponding statements for the full $C^{1,1}$ ropelength-sublevel space are conditional on explicitly isolated projection--Cerf tameness and coherent finite-pattern thick-movie liftability hypotheses.

Editorial analysis

A structured set of objections, weighed in public.

Desk editor's note, referee report, simulated authors' rebuttal, and a circularity audit. Tearing a paper down is the easy half of reading it; the pith above is the substance, this is the friction.

Desk Editor's Note private letter to a colleague

New ropelength-filtered Reidemeister graphs and a recognition length are defined cleanly for polygonal knots, but the smooth C^{1,1} claims depend on two unproven tameness hypotheses.

read the letter

The main takeaway is that this paper builds a diagrammatic tool for thick knots by filtering Reidemeister graphs with ropelength and then extracts a finite recognition length from characteristic patterns in those graphs. It applies the Barbensi-Celoria reconstruction theorem directly to the new objects. The graph construction itself is unconditional in the polygonal and finite-dimensional settings, which is a clear strength. Those parts give a controlled way to record which Reidemeister moves lift to admissible thick deformations below a given ropelength bound, and the definitions of the lifted graphs and the recognition length L_char,u(K) follow straightforwardly from that data. The paper is careful to separate this unconditional core from the smooth case. That separation is useful and keeps the claims proportionate. The soft spot is exactly where the abstract says it is: the statements for general C^{1,1} ropelength-sublevel spaces rest on two standing hypotheses about isolated projection-Cerf tameness and coherent finite-pattern thick-movie liftability. Neither is proved or illustrated with examples, so if either fails for a given knot the characteristic pattern may not exist or may not reconstruct the type up to mirror. The recognition length is defined directly from the graph rather than derived from fitted parameters, so there is no circularity in the definition itself. This work is aimed at knot theorists already working with ropelength, ideal strata, or computational recognition of thick embeddings. A reader in that niche can use the new graphs as a concrete object to test or extend. It deserves a serious referee because the polygonal constructions are new, the citation to Barbensi-Celoria is appropriate, and the unconditional part is self-contained. Referees can evaluate whether the hypotheses can be relaxed or verified in special cases. I would send it to peer review and ask the authors to state the scope clearly or supply evidence that the hypotheses hold in the cases they care about.

Referee Report

2 major / 2 minor

Summary. The manuscript develops a diagrammatic approach to finite knot theory by constructing ropelength-filtered lifted Reidemeister graphs G^lift_Λ,u(K) for thick knots. It defines characteristic Reidemeister patterns and the finite recognition length L_char,u(K) as the smallest ropelength at which a pattern recognizing the knot type (up to mirror) appears in the graph, leveraging the Barbensi-Celoria finite-local reconstruction theorem. The construction is unconditional for polygonal and finite-dimensional models but conditional on two tameness hypotheses for the full C^{1,1} ropelength sublevel spaces.

Significance. If the two hypotheses hold, the work could offer a novel way to characterize knot types through finite combinatorial data extracted from projections at controlled ropelength scales, bridging geometric ropelength studies with Reidemeister move graphs. The clear distinction between unconditional polygonal results and conditional smooth results is a positive feature, as is the reliance on an established reconstruction theorem rather than ad-hoc constructions. However, the absence of any computed examples or verification of the hypotheses limits the immediate impact.

major comments (2)

[Abstract] Abstract: The central definitions of characteristic Reidemeister patterns and L_char,u(K) for C^{1,1} knots are stated to rest on the two unverified hypotheses ('explicitly isolated projection--Cerf tameness' and 'coherent finite-pattern thick-movie liftability'), yet the manuscript supplies neither proofs, counterexamples, nor even a plausibility argument for these assumptions; this directly affects whether the finite recognition length is well-defined in the smooth setting that motivates the paper.
[Definition of lifted graphs] The paragraph following the definition of G^lift_Λ,u(K): No explicit construction or reference is provided for how generic projections of thick C^{1,1} knots yield only isolated Cerf singularities inside each ropelength sublevel, leaving the first hypothesis as an unexamined prerequisite for the lifted-graph construction itself.

minor comments (2)

The notation G^lift_Λ,u(K) and L_char,u(K) is introduced clearly but would benefit from an accompanying schematic diagram showing the filtration and lifting process for a simple knot.
Consider adding a short table contrasting the unconditional polygonal results with the conditional C^{1,1} statements to improve readability.

Simulated Author's Rebuttal

2 responses · 1 unresolved

We thank the referee for the careful reading and for emphasizing the conditional character of the smooth-case results. We respond point by point to the major comments and indicate the changes we will make.

read point-by-point responses

Referee: [Abstract] Abstract: The central definitions of characteristic Reidemeister patterns and L_char,u(K) for C^{1,1} knots are stated to rest on the two unverified hypotheses ('explicitly isolated projection--Cerf tameness' and 'coherent finite-pattern thick-movie liftability'), yet the manuscript supplies neither proofs, counterexamples, nor even a plausibility argument for these assumptions; this directly affects whether the finite recognition length is well-defined in the smooth setting that motivates the paper.

Authors: The manuscript states explicitly, both in the abstract and in the body, that the definitions and recognition-length statements for C^{1,1} knots are conditional on the two named hypotheses. The unconditional core of the work consists of the constructions and the finite-local reconstruction for polygonal and finite-dimensional models; these parts do not invoke the hypotheses. In the revision we will add a short paragraph after the statement of the hypotheses that sketches their plausibility by appealing to (i) uniform approximation of C^{1,1} knots by polygons whose ropelength is controlled and (ii) standard genericity results for projections of smooth curves. We do not claim to prove the hypotheses. revision: partial
Referee: [Definition of lifted graphs] The paragraph following the definition of G^lift_Λ,u(K): No explicit construction or reference is provided for how generic projections of thick C^{1,1} knots yield only isolated Cerf singularities inside each ropelength sublevel, leaving the first hypothesis as an unexamined prerequisite for the lifted-graph construction itself.

Authors: The lifted-graph construction for the full C^{1,1} ropelength sublevel space indeed presupposes the first hypothesis (explicitly isolated projection–Cerf tameness). For the polygonal case the construction is direct and unconditional: each diagram has finitely many crossings, and admissible moves are enumerated explicitly. In the revision we will insert a reference to the classical results on generic projections of smooth curves (e.g., the density of Morse and Cerf singularities in the space of projections) and will clarify that the hypothesis is precisely the statement that guarantees the lifted graph remains locally finite at each ropelength level. revision: partial

standing simulated objections not resolved

Verification (or counterexamples) of the two tameness hypotheses for the full C^{1,1} ropelength sublevel spaces.

Circularity Check

0 steps flagged

No significant circularity; central objects are explicit definitions relying on an external theorem

full rationale

The paper constructs the lifted Reidemeister graphs G^lift_Λ,u(K) directly from generic projections and admissible thick deformations below a given ropelength level, then defines L_char,u(K) as the infimum of scales at which a finite pattern recognizing K (up to mirror) appears in that graph, invoking the Barbensi–Celoria finite-local reconstruction theorem only as an external tool to guarantee that such a pattern exists and reconstructs the knot type. This is a definitional step, not a prediction or derivation that reduces to its own inputs by construction. The text explicitly separates the unconditional finite-dimensional/polygonal case from the C^{1,1} case, which rests on two stated hypotheses rather than on any self-referential equation or fitted parameter. No self-citations are load-bearing, no ansatz is smuggled, and no known empirical pattern is merely renamed. The derivation chain therefore remains self-contained against the cited external theorem and the paper's own explicit constructions.

Axiom & Free-Parameter Ledger

0 free parameters · 2 axioms · 3 invented entities

The paper introduces several newly defined objects and relies on two ad-hoc hypotheses for the smooth case; no free parameters are evident from the abstract.

axioms (2)

ad hoc to paper explicitly isolated projection--Cerf tameness
Invoked as necessary condition for statements about the full C^{1,1} ropelength-sublevel space
ad hoc to paper coherent finite-pattern thick-movie liftability hypotheses
Invoked as necessary condition for statements about the full C^{1,1} ropelength-sublevel space

invented entities (3)

ropelength-filtered lifted Reidemeister graphs G^lift_Λ,u(K) no independent evidence
purpose: Record diagram data and admissible Reidemeister moves below ropelength level Λ for each projection direction u
Newly introduced construction in the paper
characteristic Reidemeister patterns no independent evidence
purpose: Finite patterns in the graphs that recognize a knot type up to mirroring
Defined via the Barbensi-Celoria theorem
finite recognition length L_char,u(K) no independent evidence
purpose: Smallest ropelength scale at which a recognizing pattern appears
Newly defined quantity

pith-pipeline@v0.9.0 · 10979 in / 1583 out tokens · 160975 ms · 2026-05-07T13:22:04.691313+00:00 · methodology

discussion (0)

Forward citations

Cited by 1 Pith paper

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score.

Swept-Area Pseudometrics on Ropelength-Filtered Knot Spaces
math.GT 2026-05 unverdicted novelty 6.0

Defines swept-area pseudometrics on ropelength-filtered knot spaces, proves non-degeneracy on polygonal strata, exact distances for concentric unknots and ellipses, and rigidity of the ideal unknot.

Reference graph

Works this paper leans on

17 extracted references · 3 canonical work pages · cited by 1 Pith paper · 1 internal anchor

[1]

V. I. Arnold,Plane curves, their invariants, perestroikas and classifications, inSingu- larities and Bifurcations, Adv. Soviet Math.21, Amer. Math. Soc., Providence, RI, 1994, 33–91

1994
[2]

Baranska, P

J. Baranska, P. Pieranski, and A. Stasiak,Length of the tightest trefoil knot, Phys. Rev. E70(2004), 051810

2004
[3]

Barbensi and D

A. Barbensi and D. Celoria,The Reidemeister graph is a complete knot invariant, Algebr. Geom. Topol.20(2020), no. 2, 643–698. doi:10.2140/agt.2020.20.643

work page doi:10.2140/agt.2020.20.643 2020
[4]

Cantarella, R

J. Cantarella, R. B. Kusner, and J. M. Sullivan,On the minimum ropelength of knots and links, Invent. Math.150(2002), 257–286

2002
[5]

Cerf,La stratification naturelle des espaces de fonctions différentiables réelles et le théorème de la pseudo-isotopie, Inst

J. Cerf,La stratification naturelle des espaces de fonctions différentiables réelles et le théorème de la pseudo-isotopie, Inst. Hautes Études Sci. Publ. Math.39(1970), 5–173. FINITE KNOT THEORY 29

1970
[6]

Cohen-Steiner, H

D. Cohen-Steiner, H. Edelsbrunner, and J. Harer,Stability of persistence diagrams, Discrete Comput. Geom.37(2007), 103–120

2007
[7]

Denne, Y

E. Denne, Y. Diao, and J. M. Sullivan,Quadrisecants give new lower bounds for the ropelength of a knot, Geom. Topol.10(2006), 1–26

2006
[8]

Edelsbrunner and J

H. Edelsbrunner and J. Harer,Computational Topology: An Introduction, American Mathematical Society, Providence, RI, 2010

2010
[9]

Federer,Curvature measures, Trans

H. Federer,Curvature measures, Trans. Amer. Math. Soc.93(1959), 418–491

1959
[10]

Fenchel,Über Krümmung und Windung geschlossener Raumkurven, Math

W. Fenchel,Über Krümmung und Windung geschlossener Raumkurven, Math. Ann. 101(1929), 238–252

1929
[11]

R. A. Litherland, J. Simon, O. Durumeric, and E. Rawdon,Thickness of knots, Topology Appl.91(1999), 233–244

1999
[12]

Milnor,Morse Theory, Annals of Mathematics Studies, No

J. Milnor,Morse Theory, Annals of Mathematics Studies, No. 51, Princeton Univer- sity Press, Princeton, NJ, 1963

1963
[13]

The Ideal Stratum and Deformation Persistence of Knot Types

M. Ozawa,The ideal stratum and deformation persistence of knot types, preprint, arXiv:2604.17905v2 [math.GT], 2026

work page internal anchor Pith review Pith/arXiv arXiv 2026
[14]

Polyak,Invariants of curves and fronts via Gauss diagrams, Topology37(1998), no

M. Polyak,Invariants of curves and fronts via Gauss diagrams, Topology37(1998), no. 5, 989–1009. doi:10.1016/S0040-9383(97)00013-X

work page doi:10.1016/s0040-9383(97)00013-x 1998
[15]

E. J. Rawdon,Approximating the thickness of a knot, inIdeal Knots, Ser. Knots Everything19, World Scientific, 1998, 143–150

1998
[16]

Reidemeister,Knotentheorie, Ergebnisse der Mathematik und ihrer Grenzgebiete, Springer, Berlin, 1932

K. Reidemeister,Knotentheorie, Ergebnisse der Mathematik und ihrer Grenzgebiete, Springer, Berlin, 1932

1932
[17]

Rolfsen,Knots and Links, Publish or Perish, Berkeley, 1976

D. Rolfsen,Knots and Links, Publish or Perish, Berkeley, 1976. Department of Natural Sciences, F aculty of Arts and Sciences, Komazawa University, Tokyo, Japan Email address:w3c@komazawa-u.ac.jp

1976