pith. sign in

arxiv: 2602.21659 · v2 · pith:SBPOKNZZnew · submitted 2026-02-25 · 🧮 math.GT

Crossing Numbers of Knots on Closed Surfaces

Pith reviewed 2026-05-22 11:28 UTC · model grok-4.3

classification 🧮 math.GT
keywords surface crossing numbertunnel numberHeegaard deficiencyknot diagramamalgamationsurface knot
0
0 comments X

The pith

A knot must cross a closed surface at least twice the excess of its tunnel number over the surface's Heegaard deficiency.

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

The paper establishes inequalities that relate the surface crossing number of a knot to its tunnel number and to the Heegaard deficiency of the surface. Zero crossings are possible only when the tunnel number does not exceed the deficiency; any larger tunnel number forces a positive lower bound on crossings that grows linearly with the excess. This shows that the deficiency measures how much of the knot's tunnel complexity the surface can absorb without requiring crossings. The inequalities follow from estimates on ascending numbers and bridge numbers in surface diagrams together with an amalgamation argument for Heegaard splittings relative to the surface. Connected-sum constructions demonstrate that the linear lower bound is of the correct order.

Core claim

For a knot K in S^3 and a closed connected surface F with Heegaard deficiency delta(F), the surface crossing number c(K;F) satisfies c(K;F)=0 only if t(K) <= delta(F), and otherwise c(K;F) >= 2(t(K)-delta(F))+1. The deficiency therefore quantifies the amount of tunnel complexity that F can absorb without producing crossings. The argument combines a surface ascending-number estimate, a bridge-number estimate for surface diagrams, and an amalgamation argument for Heegaard splittings relative to F.

What carries the argument

The amalgamation argument for Heegaard splittings relative to F, which merges the ascending-number and bridge-number estimates for surface diagrams to bound crossings by excess tunnel number.

If this is right

  • Knots whose tunnel number exceeds the deficiency of F must cross F at least once and in fact at least twice the excess plus one.
  • The minimal crossing number grows linearly with the amount by which the tunnel number exceeds the deficiency.
  • Families obtained by connected sum achieve the linear lower bound, confirming that the order is sharp.

Where Pith is reading between the lines

These are editorial extensions of the paper, not claims the author makes directly.

  • The same style of argument might produce analogous bounds when other knot invariants replace tunnel number.
  • For a torus, where delta(F) is typically small, most knots with positive tunnel number are forced to cross the surface.
  • The result gives a criterion for when a knot can lie entirely in one of the two manifolds bounded by F.

Load-bearing premise

The surface ascending-number estimate, the bridge-number estimate for surface diagrams, and the amalgamation argument for relative Heegaard splittings together yield the stated inequalities between crossing number and tunnel excess.

What would settle it

A knot whose tunnel number equals delta(F) plus one yet admits a diagram with zero crossings on F would violate the lower bound.

Figures

Figures reproduced from arXiv: 2602.21659 by Makoto Ozawa.

Figure 1
Figure 1. Figure 1: A schematic cross-section of the amalgamation of Heegaard splittings. The amalgamated surface F ′ (dashed blue) is obtained from F by tubing along the 1-handles of the compression bodies C1 and C2. The knot K (red) is in a bridge position with respect to F and is isotoped to be disjoint from the 1-handles, preserving its bridge arcs in the resulting handlebodies bounded by F ′ . 4.4. Step 4. Completion of … view at source ↗
read the original abstract

Let c(K;F) denote the surface crossing number of a knot K with respect to a closed connected surface F in S^3. We relate c(K;F) to the tunnel number t(K) and to the Heegaard deficiency delta(F)=g(M_1;F)+g(M_2;F)-g(F), where S^3=M_1 union_F M_2. The zero-crossing case gives a structural obstruction: if c(K;F)=0, then t(K) <= delta(F). Conversely, if t(K)>delta(F), then c(K;F) >= 2(t(K)-delta(F))+1. Thus the Heegaard deficiency of F measures the amount of tunnel complexity that can be absorbed by F without producing crossings. The proof combines a surface ascending-number estimate, a bridge-number estimate for surface diagrams, and an amalgamation argument for Heegaard splittings relative to F. We also construct connected-sum families showing that the lower bound has the correct linear order.

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.

Referee Report

1 major / 2 minor

Summary. The manuscript defines the surface crossing number c(K;F) of a knot K with respect to a closed connected surface F in S^3. It proves that c(K;F)=0 implies t(K) ≤ δ(F), where δ(F) is the Heegaard deficiency of the splitting S^3 = M1 ∪_F M2, and conversely that t(K) > δ(F) implies c(K;F) ≥ 2(t(K)−δ(F))+1. The argument combines a surface ascending-number estimate, a bridge-number estimate for diagrams on F, and an amalgamation construction for relative Heegaard splittings; connected-sum families are used to show that the linear lower bound is of the correct order.

Significance. If the stated inequalities are established, the paper supplies a quantitative obstruction relating surface crossing numbers to tunnel numbers and Heegaard deficiencies, clarifying how much tunnel complexity can be absorbed by F without crossings. The explicit linear coefficient and the connected-sum sharpness examples are useful features that make the result falsifiable and potentially applicable to questions about knots on surfaces in 3-manifolds.

major comments (1)
  1. [amalgamation argument in the proof of the lower bound] The amalgamation argument for relative Heegaard splittings (proof of the main inequality, following the sketch in the abstract) must be expanded to show explicitly how the bridge-number estimate on F produces the precise coefficient 2 in c(K;F) ≥ 2(t(K)−δ(F))+1. Standard amalgamation adds genus additively; without a detailed accounting of how excess tunnels are realized by crossings (including any positioning or stabilization steps), it is not immediate that the factor is forced rather than a weaker linear term.
minor comments (2)
  1. [Introduction] The definition of δ(F) should be restated explicitly in the introduction or §1 rather than only in the abstract, to improve readability for readers who begin with the main statements.
  2. [sharpness examples] In the connected-sum families used to establish sharpness, the precise count of added crossings per summand should be recorded in a small table or lemma to make the linear order verification fully transparent.

Simulated Author's Rebuttal

1 responses · 0 unresolved

We thank the referee for the careful reading of our manuscript and for the positive evaluation of its significance. We address the single major comment below and will incorporate the requested expansion in the revised version.

read point-by-point responses
  1. Referee: [amalgamation argument in the proof of the lower bound] The amalgamation argument for relative Heegaard splittings (proof of the main inequality, following the sketch in the abstract) must be expanded to show explicitly how the bridge-number estimate on F produces the precise coefficient 2 in c(K;F) ≥ 2(t(K)−δ(F))+1. Standard amalgamation adds genus additively; without a detailed accounting of how excess tunnels are realized by crossings (including any positioning or stabilization steps), it is not immediate that the factor is forced rather than a weaker linear term.

    Authors: We agree that the current sketch of the amalgamation construction for relative Heegaard splittings, while combining the surface ascending-number estimate and the bridge-number estimate for diagrams on F, would benefit from a more explicit step-by-step derivation of the coefficient 2. In the revision we will expand this portion of the proof to detail the positioning of the excess tunnels, the necessary stabilizations relative to F, and the precise manner in which the surface bridge-number estimate forces the factor of 2 (rather than a weaker linear coefficient) in the lower bound for c(K;F). revision: yes

Circularity Check

0 steps flagged

No circularity: bounds derived from independent diagram estimates and amalgamation arguments

full rationale

The paper establishes the stated inequalities by combining a surface ascending-number estimate, a bridge-number estimate for diagrams on F, and an amalgamation argument for Heegaard splittings relative to F. These components are presented as standard topological estimates and splitting techniques that do not reduce to fitted parameters or self-referential definitions of c(K;F), t(K), or delta(F). The connected-sum families are used only to confirm the linear order of the lower bound, providing external verification rather than circular input. No self-citation chains or ansatz smuggling appear in the derivation sketch, leaving the central claims self-contained against external benchmarks.

Axiom & Free-Parameter Ledger

0 free parameters · 2 axioms · 0 invented entities

The paper rests on standard facts about Heegaard splittings and diagram estimates in 3-manifold topology; no free parameters or new postulated entities are introduced in the abstract.

axioms (2)
  • standard math Standard properties of Heegaard splittings and their amalgamation in 3-manifolds
    Invoked in the amalgamation argument for splittings relative to F.
  • domain assumption Existence of surface ascending-number and bridge-number estimates for diagrams on closed surfaces
    Used to relate crossing numbers to tunnel numbers.

pith-pipeline@v0.9.0 · 5692 in / 1455 out tokens · 54165 ms · 2026-05-22T11:28:59.401612+00:00 · methodology

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.

Lean theorems connected to this paper

Citations machine-checked in the Pith Canon. Every link opens the source theorem in the public Lean library.

What do these tags mean?
matches
The paper's claim is directly supported by a theorem in the formal canon.
supports
The theorem supports part of the paper's argument, but the paper may add assumptions or extra steps.
extends
The paper goes beyond the formal theorem; the theorem is a base layer rather than the whole result.
uses
The paper appears to rely on the theorem as machinery.
contradicts
The paper's claim conflicts with a theorem or certificate in the canon.
unclear
Pith found a possible connection, but the passage is too broad, indirect, or ambiguous to say the theorem truly supports the claim.

Reference graph

Works this paper leans on

16 extracted references · 16 canonical work pages

  1. [1]

    Bachman,A note on Kneser-Haken finiteness, Proc

    D. Bachman,A note on Kneser-Haken finiteness, Proc. Amer. Math. Soc.132(2004), 899–902

  2. [2]

    Casson and C.McA

    A.J. Casson and C.McA. Gordon,Reducing heegaard splittings, Topology and its Applications27(1987), 275–283

  3. [3]

    Clark,The Heegaard Genus Of Manifolds Obtained By Surgery On Links And Knots, International Journal of Mathematics and Mathematical Sciences3(1980), 583–589

    B. Clark,The Heegaard Genus Of Manifolds Obtained By Surgery On Links And Knots, International Journal of Mathematics and Mathematical Sciences3(1980), 583–589

  4. [4]

    Davies and A

    D. Davies and A. Zupan,Natural properties of the trunk of a knot, J. Knot Theory Ramifications26(2017), 1750080

  5. [5]

    Doll,A generalized bridge number for links in 3-manifolds, Math

    H. Doll,A generalized bridge number for links in 3-manifolds, Math. Ann.294(1992), 701–717

  6. [6]

    I. A. Dynnikov,Three-page approach to knot theory. Encoding and local moves, Funct. Anal. Its Appl.33(1999), 260–269

  7. [7]

    R. W. Ghrist,Flows onS 3 supporting all links as orbits, Electronic Research An- nouncements of the AMS1(1995), 91–97. J. Amer. Math. Soc.14(2001), 399–428

  8. [8]

    J. Hass, J. C. Lagarias, and N. Pippenger,The computational complexity of knot and link problems, Journal of the ACM (JACM),46(1999), 185–211

  9. [9]

    Morimoto,Tunnel number, connected sum and meridional essential surfaces, Topology39(2000), 469–485

    K. Morimoto,Tunnel number, connected sum and meridional essential surfaces, Topology39(2000), 469–485. 14 MAKOTO OZA W A

  10. [10]

    Morimoto,On the additivity ofh-genus of knots, Osaka J

    K. Morimoto,On the additivity ofh-genus of knots, Osaka J. Math.31(1994), 137– 145

  11. [11]

    Morimoto, M

    K. Morimoto, M. Sakuma and Y. Yokota,Identifying tunnel number one knots, J. Math. Soc. Japan48(1996), 667–688

  12. [12]

    Ozawa,Non-triviality of generalized alternating knots, J

    M. Ozawa,Non-triviality of generalized alternating knots, J. Knot Theory and its Ramifications15(2006), 351–360

  13. [13]

    Ozawa,Ascending number of knots and links, J

    M. Ozawa,Ascending number of knots and links, J. Knot Theory and its Ramifications 19(2010), 15–25

  14. [14]

    Ozawa,Waist and trunk of knots, Geom

    M. Ozawa,Waist and trunk of knots, Geom. Dedicata149(2010), 85–94

  15. [15]

    Scharlemann and J

    M. Scharlemann and J. Schultens,The tunnel number of the sum ofnknots is at leastn, Topology38(1999), 265–270

  16. [16]

    Schultens,The Classification of Heegaard Splittings for (Compact Orientable Sur- face)×S 1, Proc

    J. Schultens,The Classification of Heegaard Splittings for (Compact Orientable Sur- face)×S 1, Proc. London Math. Soc.67(1993), 425–448. Department of Natural Sciences, F aculty of Arts and Sciences, Komazawa University, 1-23-1 Komazawa, Setagaya-ku, Tokyo, 154-8525, Japan Email address:w3c@komazawa-u.ac.jp