AIProofWatch
← Archive

OpenAI reports: Nagata’s plane-curve conjecture

OpenAI reports that, at r at least ten very general complex plane points, the total multiplicity of every nonzero effective degree-d curve is strictly less than d times the square root of r.

Sources for this record

What was already known

Square values of the point count were covered by Nagata’s original cases. The unresolved target includes all point counts at least ten and unequal assigned multiplicities.

What changed and why it matters

Extends the square-root interpolation bound to all stated point counts and nonhomogeneous multiplicities.

The AI contribution

OpenAI attributes these manuscripts to its internal model. The entry does not infer individual human contributions beyond that publisher attribution.

Limitations

Very general points are required; arbitrary configurations are not covered. The strict inequality does not start at nine points and does not describe every special interpolation problem. Preprint. This is a source-statement and significance assessment, not a proof audit. No independent checking or successful formal compilation is asserted by this entry.

Verification evidence

Evidence labels show what supports the claim. Importance rates its impact if correct.

Author claim

The publisher reports the scoped result. AIProofWatch has not independently validated its correctness.

Accessible artifact / proof

The original written argument is accessible. Availability does not establish a successful proof check or Lean verification.

Correction and publication history

2026-10-11 · publication

Historical report added after statement, scope, and importance review. No proof audit or formal checking asserted; subscriber alerts disabled.

Read this published revision