OpenAI Model Disproves Central Conjecture in Discrete Geometry
Original: An OpenAI model has disproved a central conjecture in discrete geometry
Why This Matters
First autonomous AI solution to a prominent open mathematics problem demonstrates advanced reasoning capabilities
An OpenAI model has solved the planar unit distance problem, a prominent 80-year-old mathematics question first posed by Paul Erdős in 1946. The AI disproved the longstanding belief that square grid constructions were optimal for maximizing unit-distance pairs, providing a polynomial improvement through algebraic number theory techniques.
The planar unit distance problem asks how many pairs of n points in a plane can be exactly distance 1 apart. Since Erdős posed this question in 1946, mathematicians believed square grid constructions were essentially optimal. OpenAI's general-purpose reasoning model disproved this conjecture by finding an infinite family of examples with polynomial improvement. The proof uses sophisticated algebraic number theory techniques applied to elementary geometry. External mathematicians verified the proof and wrote a companion paper. Fields medalist Tim Gowers called it 'a milestone in AI mathematics.' Number theorist Arul Shankar noted the AI showed 'original ingenious ideas' beyond just assisting humans. This marks the first time AI has autonomously solved a prominent open problem central to a mathematics subfield.