REVIEW
3-manifold decision problems and Riemann hypotheses
Geometric Topology · Submitted 4 Nov 2026 · 23 references
Pith's verdict: The conditional theorem is correct and the note is honest about its own scope, but the abstract's "unconditional" claim is not what the body proves.
T0 · AI review
Why Pith says this
Highlight any text to comment on it.
Referee report
The paper
The paper claims
Four fundamental 3-manifold decision problems lie in coNP assuming only a uniform zero-free strip for Dedekind zeta functions—not the generalized Riemann hypothesis.
The reading
What carries the argument
The load-bearing object is the quasi-Riemann hypothesis for Dedekind zeta functions (Hypothesis 1.2): a universal constant $\epsilon > 0$ such that every Dedekind zeta function $\zeta_K(s)$ has no zeroes with $\mathrm{Re}(s) > 1 - \epsilon$. It enters the argument through the effective Chebotarev density theorem of [FSW26] (Theorem 3.1), quoted as an input: counting prime ideals $\mathfrak{q} \subset \mathcal{O}_K$ of norm at most $x$ in a given conjugacy class is accurate to within $c \cdot \frac{\#C}{\#G} x^{1-\epsilon} \log(\Delta_L^{1/\epsilon} x^{[L:\mathbb{Q}]})$. From this, Corollary 3.3 bounds the count of prime ideals of norm $\leq x$ in $K = \mathbb{Q}[x]/\langle f\rangle$. The Dedekind–Kummer theorem (Theorem 2.4) converts roots of $f$ mod $p$ into prime ideals of norm $p$, and Lemma 3.4 bounds the discriminant by $\log \Delta_f < 2d(\log(d+1) + \log\|f\|)$, so the non-trivial error term is $x^{1-\epsilon}$. Choosing $x$ with $x^\epsilon > 2h(d,\log\|f\|)\cdot(\log x)^2$ forces the root count positive, and such $x$ is polynomial in $d$ and $\log\|f\|$.
Extended reading notes
Core claim
The central claim is Theorem 1.3: modulo Hypothesis 1.2, each of unknot recognition, 3-sphere recognition, torus knot recognition, hyperbolic knot recognition, and hyperbolicity of cusped 3-manifolds lies in coNP. The proof has two parts. First, following Kuperberg, each decision problem reduces to asking for a nonabelian representation $\pi_1(Y) \to \mathrm{SL}(2,\mathbb{C})$, which by Koiran's work is equivalent to finding a root of a single irreducible polynomial $f \in \mathbb{Z}[x]$ modulo some prime $p$. Second, the size of $p$ is controlled by the effective Chebotarev density theorem: the cited prior work [FSW26] proved that Hypothesis 1.2 implies an error term of size $c \cdot \frac{\#C}{\#G} x^{1-\epsilon} \log(\Delta_L^{1/\epsilon} x^{[L:\mathbb{Q}]})$ in counting primes of norm at most $x$. Because the discriminant enters only logarithmically and the zero-free region is uniform over all number fields with one fixed $\epsilon$, the authors read off that $x$ can be chosen polynomial in $d$ and $\log\|f\|$, proving Theorem 2.1. Theorem 2.1 then plugs into Kuperberg's framework verbatim, yielding Theorem 1.3 and the corollaries on nonabelian homomorphisms to $\mathrm{SL}(2,\mathbb{F}_p)$ and regular nonabelian covers of degree at most $e^{\mathrm{poly}(n)}$.
Load-bearing premise
The results rest, quoted without proof, on Theorem 3.1 from [FSW26]: that the quasi-Riemann hypothesis implies an effective Chebotarev density theorem whose error term has precisely the stated polynomial dependence on the discriminant and on $x^{1-\epsilon}$, uniform over all number fields with one fixed $\epsilon$.
Editorial extensions
If this is right
- If the claimed machine-checked proof of Hypothesis 1.2 stands, 3-sphere recognition is in coNP unconditionally; the paper states this is the first unconditional proof of that fact.
- Hyperbolicity of cusped 3-manifolds is in coNP, a problem for which the paper says no other unconditional strategy appears in the literature.
- Theorem 2.3 follows: a finite-volume hyperbolic 3-manifold, the complement of a nontrivial knot, or a non-$\mathbb{S}^3$ integer homology sphere admits a regular nonabelian cover of degree at most $e^{\mathrm{poly}(n)}$ when triangulated with $n$ tetrahedra.
- The certificates are the same simple objects as under GRH—explicit matrices over $\mathrm{SL}(2,\mathbb{F}_p)$—so the advantage is purely in the hypothesis needed, not in certificate complexity.
- If Hypothesis 1.2 holds, the same reasoning bounds the least size of nonabelian finite quotients of many knot and 3-manifold groups, extending the analogue of Kuperberg's Theorem 5.1.
Reading between the lines
- If Hypothesis 1.2 is ever proved with any fixed $\epsilon > 0$, the same pipeline may apply to other algebraic decision problems whose certificates reduce to finding roots of polynomials over finite fields, replacing GRH by the weaker zero-free strip.
- The paper raises an epistemic question it does not try to resolve: a machine-checked proof that no human has yet understood would, in the authors' framing, convert a conditional theorem into an unconditional one, and they deliberately decline to make that leap.
- The claimed value $\epsilon = 1/32$ in the machine-checked proof implies a discriminant exponent of $32$ in the Chebotarev error term, but because the exponent is constant, the certificate length stays polynomial; a proof valid only for a much smaller $\epsilon$ would inflate the hidden constants but not the complexity class.
- The paper's contribution is explanatory rather than new topology: it isolates exactly which property of GRH the certificate-length arguments use, namely uniformity of a zero-free strip over all number fields, which may help guide future unconditional certificate constructions.
Original abstract
Beginning with Kuperberg's work on unknot recognition, several fundamental decision problems in 3-manifold topology have been shown to be in coNP assuming the generalized Riemann hypothesis. In this note, we explain how recent developments around the quasi-Riemann hypothesis yield unconditional versions of these results, leading for example to the first unconditional proof that 3-sphere recognition is in coNP.
The compiled record
The paper's own sentences, arranged, kept beside the review and separate from it. Each label is drawn from a closed vocabulary; the number beside it is the probability the classifier gave that label. Numbers in the tables are the authors', checked by code. No sentence in this record was written by a model.
The abstract, sentence by sentence
Beginning with Kuperberg's work on unknot recognition, several fundamental decision problems in 3-manifold topology have been shown to be in coNP assuming the generalized Riemann hypothesis. In this note, we explain how recent developments around the quasi-Riemann hypothesis yield unconditional versions of these results, leading for example to the first unconditional proof that 3-sphere recognition is in coNP.
background contribution method result interpretation main claim
| # | sentence | role | the authors' own work | states the main conclusion | strength |
|---|---|---|---|---|---|
| s0 | Beginning with Kuperberg's work on unknot recognition, several fundamental decision problems in 3-manifold topology have been shown to be in coNP assuming the generalized Riemann hypothesis. | background 1.00 | 0.04 | 0.07 | asserted 1.00 |
| s1 | In this note, we explain how recent developments around the quasi-Riemann hypothesis yield unconditional versions of these results, leading for example to the first unconditional proof that 3-sphere recognition is in coNP. | contribution 0.90 | 0.83 | 0.88 | asserted 1.00 |
What was examined, and what was not
- arXiv listing abstract v1
- full text
- figures and tables
- references and citing sentences
- relations to other papers
- P abstract
- S sections
- T body sentences
- C citations
- R cross-paper relations
References
Discussion
Disagree with the review, or know something it missed? Leave a comment, highlight any passage above to comment on it, or challenge this review formally.