Breakthrough in the Unit Distance Problem
For nearly 80 years, mathematicians have wrestled with a simple question posed by Paul Erdős in 1946: if you place n points in the plane, what is the maximum number of pairs that can be exactly one unit apart? Known as the planar unit distance problem, it is among the most famous and stubborn questions in combinatorial geometry. The longstanding belief was that square grid constructions offered the optimal arrangement for maximizing these unit distance pairs.
OpenAI has now announced that one of its internal AI models has disproved this central conjecture. The model produced an infinite family of point configurations that yield a polynomial improvement over the previously assumed best case. External mathematicians have verified the proof and published a companion paper explaining the reasoning and its significance.
AI as a Research Tool
The result is notable not only for its mathematical importance but also for how it was discovered. The proof came from a general purpose reasoning model, not from a system specifically trained on mathematics or targeted at this particular problem. OpenAI tested the model on a collection of Erdős problems as part of a broader effort to assess whether advanced AI can contribute to frontier research.
This marks the first time that an AI has autonomously solved a prominent open problem central to a subfield of mathematics. The achievement demonstrates a new level of reasoning capability, where the model constructed a long and coherent argument from start to finish. Mathematics serves as a clear testbed for such reasoning because problems are precise and proofs can be checked rigorously.
Source: https://openai.com/index/model-disproves-discrete-geometry-conjecture/
