Mathematics
Remarks on the disproof of the unit distance conjecture
A team of leading mathematicians presents a human-verified exposition of an AI-generated counterexample that disproves the long-standing Erdos unit distance conjecture.
Imagine you scatter a bunch of dots on a piece of paper. The question is: how many pairs of those dots can be exactly 1 inch apart? The Erdős unit distance conjecture asked whether there's a specific mathematical formula that limits how often this can happen as you add more and more dots. Think of it like asking how many friendships can exist in a town where friends are defined as people who live exactly one mile apart — there's a suspected maximum, and Erdős guessed what that maximum should be. For decades, no one could prove or disprove his guess. Now, an AI apparently found a specific arrangement of dots (a 'counterexample') that breaks the expected limit, proving Erdős's conjecture was wrong. A team of elite mathematicians then checked and explained the AI's work in this paper.
- 01
Presents a short, digested, human-verified version of an OpenAI-generated counterexample to the Erdos unit distance conjecture
- 02
The disproof relies on ideas attributed to Ellenberg-Venkatesh, Golod-Shafarevich, and Hajir-Maire-Ramakrishna
- 03
Provides expository reflections on the structure and implications of the counterexample
- 04
The paper spans 19 pages as an expository note based on very recent developments in combinatorics and number theory
We present a short, digested, human-verified version of the recent OpenAI-generated counterexample to the Erdos unit distance conjecture, and a sequence of reflections on it. The argument relies crucially on ideas that may, at least in retrospect, be attributed to Ellenberg-Venkatesh, Golod-Shafarevich, and Hajir-Maire-Ramakrishna.