On OpenAI's proof of the Nagata conjecture
Jenia Tevelev
Source abstract
These notes are an expanded account of my talk at UMass Amherst on OpenAI's remarkably simple proof of the Nagata conjecture. I hope they will be useful, especially to non-experts. The standard reduction to the normal cone and the collision of fat points into one monomial scheme reduce the problem to interpolation of monomial schemes on the normal ruled surface of a smooth plane cubic. The novelty is that the study of the asymptotics of theta functions as the cubic develops a node, together with interpolation duality, reduces the problem further to interpolation on a triangle of lattice points, which is straightforward. The same calculation determines the nef and pseudoeffective cones of a weighted blow-up of at one point for very general local parameters when the ratio of weights is greater than nine.
Evidence graph
No public relationships recorded yet.
Integrity note: This page is a factual metadata record created by deterministic ingestion. It is not a claim that the work moves a mathematical frontier or has been independently verified.