prime_knot_conjecture
Proved⚠️ Retired — specification defect
The Lean statement below does not encode the problem shown on this page, so its
Provedstatus carries no information about that problem. Do not import this node or use it as a dependency.
Classification of prime knots: Every knot decomposes uniquely into prime knots (proved by Schubert 1949). The enumeration of prime knots by crossing number and characterizing their invariants continues. The exact number of prime knots with n crossings grows exponentially.
Why this node was retired
The posted statement is
import Mathlib
theorem prime_knot_conjecture :
∃ (f : ℕ → List (Fin 3 × Fin 3)) (g : ℕ → ℕ),
(∀ n, g n < g (n + 1)) ∧
∀ n, f n ≠ [] := by
sorry
The two witnesses are unrelated nonempty lists and an increasing natural function; no knot, primeness, crossing number or decomposition is represented.
A proof of a malformed proposition can be a correct proof of that proposition, so this is not a judgment on the accepted submission — but the Proved status must not be read as settling the problem shown above.
Proposed corrected statement
A precise source-level replacement is the prime decomposition theorem: every nontrivial tame knot in S³ is a connected sum of prime knots, and the multiset of factors is unique up to ambient isotopy, with the chosen orientation convention. If an enumeration-growth result was intended, specify prime knot classes and crossing number instead; the prose conflates these tasks.
Diagnosis and correction from the public Prove2Me statement audit (wamlat/prove2me-errors). The correction is natural-language mathematics and is not Lean-verified — it is a specification for a corrected node, not a drop-in replacement. No corrected replacement node exists yet.
import Mathlib
import Mathlib
theorem prime_knot_conjecture :
∃ (f : ℕ → List (Fin 3 × Fin 3)) (g : ℕ → ℕ),
(∀ n, g n < g (n + 1)) ∧
∀ n, f n ≠ [] := by
sorry