REVIEW 2 major objections 5 minor 1 cited by
Hyperbolic knots are not generic
T0 review · 2 major / 5 minor · reviewed 2026-08-14 · deepseek-v4-flash
Pith's one-line read The proportion of hyperbolic knots among prime knots of n or fewer crossings does not converge to 1; prime satellites keep a positive share forever.
desk verdict A short, credible disproof of the Adams conjecture on hyperbolic knot genericity; the new crossing lemma is plausible but under-proved, so the paper deserves review with a request to expand one geometric step. read the letter →
The pith
A machine-rendered reading of the paper's core claim, the machinery that carries it, and where it could break.
The reading
What carries the argument
The load-bearing object is the insoluble crossing of Definition 1: a crossing $x$ in a diagram of a knot $\Gamma$ is soluble if some 3-ball $B$ contains the straight segment $I_x$ projecting to $x$ and $(B,B\cap\Gamma)$ is a trivial 1-string tangle; otherwise it is insoluble. Lemma 1 shows every diagram of a nontrivial knot has an insoluble crossing. The proof uses the Wirtinger presentation: for overarcs $\alpha,\beta$ meeting at $x$, the generator ratio $ab^{-1}$ would have to be trivial for every soluble crossing, forcing the whole knot group to be $\mathbb{Z}$ and the knot to be trivial. Corollary 1 converts the insoluble crossing into a disk decomposition showing the diagram has weak property PT, and that property feeds the satellite-construction machinery of [Mal18] that produces prime satellite knots in abundance.
What would settle it
Exhibit a diagram of a nontrivial knot in which every crossing is soluble in the sense of Definition 1; this would directly refute Lemma 1, the step from which Corollary 1 and the two theorems follow.
Extended reading notes
Core claim
The paper's central claim is a negative asymptotic statement. Let $P_n$ count prime knots with at most $n$ crossings, $S_n$ the prime satellite knots among them, and $H_n$ the hyperbolic knots. Theorem 1 asserts $$ \limsup_{n\to\infty} \frac{S_n}{P_n} > \frac{1}{2\cdot $10^{{17}}$}, \qquad\text{so}\qquad \liminf_{n\to\infty} \frac{H_n}{P_n} < 1-\frac{1}{2\cdot $10^{{17}}$}, $$ which disproves the conjecture that hyperbolic knots are asymptotically all prime knots. Theorem 2 extends the mechanism: for any nontrivial knot $K$, the proportion of prime satellites of $K$ among prime knots has positive limsup, with explicit lower bounds depending only on the crossing number of $K$. The proof runs through Corollary 1, that every prime knot diagram has weak property PT, which follows from Lemma 1 by a unique-factorization argument using the decomposition of knots into prime summands.
Load-bearing premise
The proof's one load-bearing premise is that a certain loop built from two arcs that meet at a crossing can be shrunk into a tiny neighborhood of that crossing with zero linking number, and that a soluble crossing then lets the loop contract without touching the knot; if that picture fails, Lemma 1 and both theorems fail.
Editorial extensions
If this is right
- The crossing-number census of prime knots is not asymptotically hyperbolic: the hyperbolic share has liminf strictly less than $1-1/(2\cdot10^{17})$.
- For every nontrivial knot $K$, prime satellites with companion $K$ occur among prime knots with positive asymptotic density, so no nontrivial companion type disappears from large tables.
- Conjectures 10.1 and 10.2 from [Mal18] are settled: every prime knot diagram, hence every prime knot, has weak property PT.
- The explicit lower bounds in Theorem 2 scale like $10^{-7\,\mathrm{cr}(K)}$ for a prime companion $K$, showing that the nonvanishing effect, though tiny, is uniform across all nontrivial knot types.
- Any probabilistic model of random prime knots weighted by crossing number must assign positive probability to satellite knots; hyperbolicity cannot be treated as a generic property in this ordering.
Reading between the lines
- Beyond the paper, the insoluble-crossing lemma may apply to other diagram families beyond closed prime knots; if so, positive proportions of non-hyperbolic links or tangles would follow for those families too, extending the non-genericity result to richer classes.
- Beyond the paper, the bounds are far too small to be observed in existing knot tables; checking whether the non-hyperbolic share among prime knots up to, say, 20 crossings already exceeds the lower bound would be a concrete numerical test of the mechanism, though the proof sets no rate.
- If the authors' closing conjecture is right, the satellite share tends to $1$ rather than merely staying positive, making hyperbolic knots a vanishing minority in the crossing-number census.
- The lemma also suggests a diagrammatic criterion: a diagram whose every crossing admits a local trivializing ball must be the unknot, so the notion of insoluble crossing could be developed into a check for nontriviality or primeness.
Signed reviews
Editorial analysis
A structured set of objections, weighed in public.
Referee Report
Summary. The paper claims that hyperbolic knots are not generic among prime knots. It introduces the notion of a soluble crossing in a knot diagram and proves (Lemma 1) that every diagram of a nontrivial knot contains an insoluble crossing. From this it derives Corollary 1, that every prime knot diagram has weak property PT, and then uses earlier results of Malyutin [Mal18, Mal19] to conclude that the proportion of prime satellite knots among all prime knots of at most n crossings has positive limsup (Theorem 1), and that for any fixed nontrivial knot K the proportion of prime satellites of K does not tend to zero (Theorem 2). This disproves a conjecture of Adams.
Significance. If the proof is sound, the result resolves a well-known question about the genericity of hyperbolic knots in the negative and shows that satellite knots appear with positive density in the census of prime knots by crossing number. The quantitative lower bounds, although extremely small, are explicit and would be a strong disproof of the convergence conjecture. The main new contribution is the local crossing property and the geometric Lemma 1; the passage from that lemma to the counting statements is a direct application of the authors' prior work. The paper is appropriately concise for an addendum and cites its dependencies clearly. The weak point is the terse proof of Lemma 1, which leaves a load-bearing geometric assertion unjustified.
major comments (2)
- [Lemma 1, proof (paragraph beginning 'We readily see')] The proof's key step is compressed into 'We readily see' immediately after the definition of I_x. The paper needs a full argument that, for overarcs α and β meeting at x, the Wirtinger element ab^{-1} is represented by a simple loop ∆ in an arbitrarily small neighborhood of I_x, and that ∆ has zero linking number with Γ. The zero-linking part follows from abelianization (the total exponent sum of ab^{-1} is zero), but the existence of ∆ as a small meridional loop around I_x, and the fact that the free homotopy can be performed so that ∆ lies in the ball B_3 supplied by solubility, are not demonstrated. This is load-bearing because it is exactly what turns solubility of x into equality of generators a and b; if this geometric assertion fails, Corollary 1 and both theorems lose their foundation. Please provide a detailed proof or a precise citation for this step.
- [Corollary 1, proof] The proof uses Schubert's Unique Factorization Theorem to pass from a nontrivial 1-string tangle in B_1 to the conclusion that the complementary ball B defines a trivial 1-string tangle. This is standard, but the manuscript does not spell out why (B_1, B_1 ∩ Γ) and (B, B ∩ Γ) are the two summands of the prime knot Γ. Since this is the step that actually produces a soluble crossing, one sentence of justification would remove any ambiguity.
minor comments (5)
- [Throughout] The text contains several typographical artifacts, including 'a n addendum', 'h yperbolic', 'the reader t o', and 'cros sing'; these should be corrected in the final version.
- [References] The label [BZ06] appears in the text, but the bibliography entry gives the year as 2003; correct the mismatch.
- [Theorem 2] The definition of λ as 'lim sup_{n→∞} n√Pn' should be written as λ = lim sup_{n→∞} P_n^{1/n} to avoid ambiguity about the n-th root.
- [Corollary 1] The proof refers to 'Fig. 1', but no figure is included in the text; ensure the figure is present and legible in the final version.
- [Lemma 1] The proof implicitly uses the fact that the graph whose vertices are overarcs and whose edges are crossings is connected; stating this explicitly would make the propagation from 'a = b for overarcs meeting at each soluble crossing' to 'a = b for any pair of generators' fully transparent.
Circularity Check
No circularity: the new lemma is proved independently and the cited conditional results are supplied with their missing premise.
full rationale
I walked the derivation chain and found no circular dependency. Lemma 1 is an original geometric statement proved from Wirtinger presentations and facts about trivial 1-string tangles; the 'readily see' assertion about free homotopy to a simple closed curve near I_x is a proof gap regarding geometric detail, but it is not circular because it does not presuppose either the solubility conclusion or the main genericity statements. Corollary 1 follows from Lemma 1 together with Schubert's unique factorization theorem, an external classical result. Theorem 1 is then obtained by citing [Mal18, Theorem 10.3], which is a conditional theorem whose hypotheses are Conjectures 10.1/10.2 of [Mal18]--exactly what Corollary 1 establishes. This is completing a previously conditional result rather than assuming the target conclusion. Similarly, Theorem 2 modifies the proof of Theorem 1 in [Mal19] using the newly established weak property PT for all prime knots. The self-citations are load-bearing in a logical sense, but they are not circular: the cited theorems are parameter-free, published in refereed venues, and their stated assumptions do not include the target genericity statement; the present paper supplies the missing premise. No fitted parameters, no renamed known results, and no prediction-like quantities appear. Therefore the circularity score is 0.
Assumptions & free parameters
assumptions (4)
- standard math Trivial knot detection: if π1(R3∖Γ) ≅ Z then Γ is the unknot (Burde-Zieschang Proposition 3.17).
- standard math Schubert's Unique Factorization Theorem for knots, used in Corollary 1
- domain assumption The constructions, counting bounds, Theorem 10.3 of Mal18, and Theorem 1 and Proposition 1 of Mal19
- ad hoc to paper Wirtinger-generator geometry: a loop representing ab^{-1} for overarcs meeting at a crossing is freely homotopic to a small curve around I_x and has zero linking number with Γ
Cite this review
Pith. "Pith review of Hyperbolic knots are not generic." pith.science (2026). https://pith.science/paper/SJZD5522
@misc{pith2026190806187,
author = {Pith},
title = {Pith review of: Hyperbolic knots are not generic},
year = {2026},
howpublished = {\url{https://pith.science/paper/SJZD5522}},
note = {Machine review of arXiv:1908.06187}
}
abstract
We show that the proportion of hyperbolic knots among all of the prime knots of $n$ or fewer crossings does not converge to $1$ as $n$ approaches infinity. Moreover, we show that if $K$ is a nontrivial knot then the proportion of satellites of $K$ among all of the prime knots of $n$ or fewer crossings does not converge to $0$ as $n$ approaches infinity.
Figures
Forward citations
Cited by 1 Pith paper
-
Knot primality: knot Floer homology, metacyclic representations and twisted homology
A family of purely algebraic prime-knot tests, combining the Heegaard Floer polynomial with metacyclic and twisted-homology obstructions, certifies 99.67% of knots with up to 15 crossings.
Reference graph
Works this paper leans on
-
[1]
Adams, C. C. The Knot Book: An Elementary Introduction to the Mathematical Theory of Knots. New York: W. H. Freeman and Company, 1994
work page 1994
-
[2]
Burde, G. and H. Zieschang. Knots, 2nd ed. de Gruyter Stud. Math. 5. Berlin: de Gruyter, 2003
work page 2003
-
[3]
Malyutin, A. V. ``On the question of genericity of hyperbolic knots.'' Int. Math. Res. Not. (2018). https://doi.org/10.1093/imrn/rny220
-
[4]
Malyutin, A. V. ``Hyperbolic links are not generic.'' (2019): preprint arXiv:1907.04458
arXiv 2019
-
[5]
Die eindeutige Zerlegbarkeit eines Knoten in Primknoten
Schubert, H. Die eindeutige Zerlegbarkeit eines Knoten in Primknoten. Sitz.ber. Heidelb. Akad. Wiss. Math.-Nat.wiss. Kl. Berlin, Heidelberg: Springer-Verlag, 1949
work page 1949
Reviewed August 14, 2026 · model on record in the stance chip above.
Discussion (0). Continue with ORCID to comment.