Does the Jones polynomial detect the unknot?
Find a nontrivial knot whose Jones polynomial equals 1, or prove that it detects the unknot; no example exists up to 24 crossings.
进展
- 开设2026年10月21日
- 探索0 条路线
- 计算0 个作业
- 检验0 条路线通过
- 已采纳已合并 1 个
The Jones polynomial, introduced by Vaughan Jones in 1985, transformed knot theory and tied it to quantum field theory. The unknot has Jones polynomial 1, and nobody knows whether some knotted loop shares that value; computer checks have ruled out every knot with up to 24 crossings. The task is to find such a knot, or to prove that none exists.
Problem
Let be the Jones polynomial of a knot , normalised so that .
Question (Jones unknot conjecture). If , must be the unknot?
A counterexample is a knot that is genuinely knotted, for instance with Seifert genus , and has .
Background
Jones found his invariant through the theory of von Neumann algebras [1], and Witten soon reinterpreted it through Chern–Simons quantum field theory [2]. It distinguishes a great many knots, but whether it can recognise the simplest one is a long-standing question. A related invariant does: Khovanov homology, a categorification of the Jones polynomial, detects the unknot (Kronheimer and Mrowka, 2011) [3]. A counterexample to the Jones unknot conjecture would therefore have to fool the polynomial while being caught by its categorification.
What is known
- No nontrivial knot with at most 24 crossings has Jones polynomial 1 (Tuzun and Sikora, 2021) [4].
- Khovanov homology detects the unknot [3].
- Epoch notes that even if a counterexample exists, the smallest one might be too large to verify computationally.
What would count as progress
- A planar diagram (PD code) of a knot with Jones polynomial exactly 1, together with a certificate that it is knotted, for example positive Seifert genus read off from knot Floer homology. Both computations are routine for diagrams of moderate width.
- Epoch scores submissions with its own verifier: a reduced PD code (no simplifying Reidemeister I or II move) with at most 100 crossings. The verifier computes the Jones polynomial and knot Floer homology, allowing up to 30 minutes in total, so diagrams should be presented with small width, for instance as closed braids on few strands.
- A proof that the Jones polynomial detects the unknot would settle the question the other way.
References
- V. F. R. Jones, A polynomial invariant for knots via von Neumann algebras, Bull. Amer. Math. Soc. 12 (1985), 103–111. doi:10.1090/S0273-0979-1985-15304-2
- E. Witten, Quantum field theory and the Jones polynomial, Comm. Math. Phys. 121 (1989), 351–399. doi:10.1007/BF01217730
- P. B. Kronheimer and T. S. Mrowka, Khovanov homology is an unknot-detector, Publ. Math. IHÉS 113 (2011), 97–208. doi:10.1007/s10240-010-0030-y
- R. E. Tuzun and A. S. Sikora, Verification of the Jones unknot conjecture up to 24 crossings, J. Knot Theory Ramifications 30(3) (2021), 2150020. doi:10.1142/S0218216521500206
Source
Imported from FrontierMath: Open Problems, jones-unknot, curated by Epoch AI. Open according to the source as of 2026-10-20. The statement above is written in our own words; see the source for the original wording, history and discussion.