A trivial-Jones nontrivial knot on at most 100 crossings
OpenJonesUnknot.counterexample_100_crossingsThere exists a planar single-component knot diagram with at most crossings whose normalized Jones polynomial is and whose Seifert genus is positive:
This is the concrete form of the FrontierMath counterexample: a nontrivial knot with trivial Jones polynomial presented by a diagram within the benchmark's -crossing limit. It implies the goal. The benchmark also requires the diagram to be reduced (no simplifying Reidemeister I/II move); this is without loss of generality, since reduction preserves the knot and its Jones polynomial and only lowers the crossing number.
Formalization Note. The reducedness requirement is omitted from the formal statement because it is a normalization: a qualifying diagram exists with crossings iff a reduced one does.
import Mathlib import Definitions.Def_ManolescuPiccirillo_PD import Definitions.Def_ManolescuPiccirillo_Kirby import Definitions.Def_ManolescuPiccirillo_Lee1 import Definitions.Def_JonesUnknot_planar import Definitions.Def_JonesUnknot_jones import Definitions.Def_JonesUnknot_genus open ManolescuPiccirillo JonesUnknot
namespace JonesUnknot
theorem counterexample_100_crossings :
∃ D : PD, D.IsKnot ∧ Planar D ∧ D.numCrossings ≤ 100 ∧ jonesA D = 1 ∧ 0 < seifertGenus D := by sorry
end JonesUnknot