nagata_conjecture_curves
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.
Nagata's conjecture (1959): For n ≥ 9 general points in ℙ², any curve of degree d through them with multiplicities m₁,...,mₙ satisfies ∑mᵢ ≤ d√n. Known for n = perfect squares; Nagata proved the case n = a² as part of his counterexample to Hilbert's 14th problem. Open for general n.
Why this node was retired
The posted statement is
import Mathlib
theorem nagata_conjecture_curves (n : ℕ) (hn : 9 ≤ n)
(pts : Fin n → ℝ × ℝ)
(hinj : Function.Injective pts) :
∀ (deg : ℕ), 1 ≤ deg →
∀ (mult : Fin n → ℕ),
(∀ p : Polynomial ℝ, p.natDegree = deg →
∀ i : Fin n, mult i ≤
(Nat.find ⟨0, Nat.zero_le _⟩)) →
(∑ i, mult i : ℝ) ≤ Real.sqrt n * deg := by
sorry
Every multiplicity is bounded by Nat.find of a property true at zero, hence forced to zero; neither curve multiplicity nor general position is encoded.
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
For n≥10 very general points P_i in ℙ² over ℂ and any nonzero plane curve C of degree d with multiplicities m_i at P_i, conjecture ∑m_i≤d√n. Define multiplicity on the actual curve and a precise very-general configuration condition; injectivity of arbitrary real affine points alone is insufficient.
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 nagata_conjecture_curves (n : ℕ) (hn : 9 ≤ n)
(pts : Fin n → ℝ × ℝ)
(hinj : Function.Injective pts) :
∀ (deg : ℕ), 1 ≤ deg →
∀ (mult : Fin n → ℕ),
(∀ p : Polynomial ℝ, p.natDegree = deg →
∀ i : Fin n, mult i ≤
(Nat.find ⟨0, Nat.zero_le _⟩)) →
(∑ i, mult i : ℝ) ≤ Real.sqrt n * deg := by
sorry