OpenAI 모델, 이산기하학 핵심 추측을 최초로 반증

May 20, 2026 Research Milestone An OpenAI model has disproved a central conjecture in discrete geometry Read the proof (opens in a new window) Read the companion remarks (opens in a new window) Loading… Share For nearly 80 years, mathematicians have studied a deceptively simple question: if you place n n n points in the plane, how many pairs of points can be exactly distance 1 1 1 apart? This is the planar unit distance problem, first posed by Paul Erdős in 1946. It is one of the best-known questions in combinatorial geometry, easy to state and remarkably difficult to resolve. The 2005 book Research Problems in Discrete Geometry , by Brass, Moser, and Pach, calls it “possibly the best known (and simplest to explain) problem in combinatorial geometry.” Noga Alon, a leading combinatorialist at Princeton, describes it as “one of Erdős’ favorite problems.” Erdős even offered a monetary prize for resolving this problem. Today, we share a breakthrough on the unit distance problem. Since Erdős’s original work, the prevailing belief has been that the “square grid” constructions depicted further below were essentially optimal for maximizing the number of unit-distance pairs. An internal OpenAI model has disproved this longstanding conjecture, providing an infinite family of examples that yield a polynomial improvement. The proof has been checked by a group of external mathematicians. They have also written a companion paper explaining the argument and providing further background and context for the significance of the result. The result is also notable for how it was found. The proof came from a new general-purpose reasoning model, rather than from a system trained specifically for mathematics, scaffolded to search through proof strategies, or targeted at the unit distance problem in particular. As part of a broader effort to test whether advanced models can contribute to frontier research, we evaluated it on a collection of Erdős problems. In this case, it produced a proof resolving the open problem. This proof is an important milestone for the math and AI communities. It marks the first time that a prominent open problem, central to a subfield of mathematics, has been solved autonomously by AI. It also demonstrates the depth of reasoning these systems now support. Mathematics provides a particularly clear testbed for reasoning: the problems are precise, potential proofs can be checked, and a long argument only works if the reasoning holds together from beginning to end. The method by which the problem was solved is also notable. The proof brings unexpected, sophisticated ideas from algebraic number theory to bear on an elementary geometric question. Fields medalist Tim Gowers, writing in the companion paper, calls the result “a milestone in AI mathematics.” According to leading number theorist Arul Shankar, “In my opinion this paper demonstrates that current AI models go beyond just helpers to human mathematicians – they are capable of having original ingenious ideas, and then carrying them out to fruition”. Mathematicians on the result 1 of 4 Noga Alon Tim Gowers Arul Shankar Jacob Tsimerman Noga Alon Tim Gowers Arul Shankar Jacob Tsimerman The proof is available here ⁠ (opens in a new window) . The companion paper by leading external mathematicians is available here ⁠ (opens in a new window) . You can find an abridged version of the model’s chain of thought here ⁠ (opens in a new window) . Previously known construction of many unit distances from a rescaled square grid. The unit distance problem Let u ( n ) u(n) u ( n ) be the largest possible number of unit-distance pairs among n n n points in the plane. Examples attaining linear growth rate are easy to construct: placing n n n points in a line gives n − 1 n-1 n − 1 pairs, while a square grid gives about 2 n 2n 2 n pairs. The previously best known construction, coming from a rescaled square grid, turns out to give even more: n 1 + C / log ⁡ log ⁡ ( n ) n^{1 + C / \log \log(n)} n 1 + C / l o g l o g ( n ) for a constant C C C . Since log ⁡ log ⁡ ( n ) \log \log(n) lo g lo g ( n ) tends to infinity with n n n , the additional term in the exponent tends to 0 0 0 , meaning these constructions achieve growth only slightly faster than linear. For decades, it was widely believed that this rate was essentially the best possible, and no construction could improve significantly over the square grid. In technical terms, Erdős conjectured an upper bound of n 1 + o ( 1 ) n^{1+o(1)} n 1 + o ( 1 ) in which the additional o ( 1 ) o(1) o ( 1 ) indicates a term tending to 0 0 0 with n n n . Our new result disproves this conjecture. More precisely, for infinitely many values of n n n , the proof constructs configurations of n n n points with at least n 1 + δ n^{1+\delta} n 1 + δ unit-distance pairs, for some fixed exponent δ > 0 \delta > 0 δ > 0 . (The original AI proof does not give an explicit δ \delta δ , but a forthcoming refinement due to Princeton mathematics professor Will Sawin has shown one can take δ = 0.014 \delta=0.014 δ = 0.014 .) The history of the problem helps to see why the result is surprising. The best known lower bound had been essentially unchanged since Erdős’s original 1946 construction. The best upper bound, O ( n 4 / 3 ) O(n^{4/3}) O ( n 4/3 ) , dates to work by Spencer, Szemerédi, and Trotter in 1984, and despite later refinements and related structural work by Székely, Katz and Silier, Pach, Raz, and Solymosi and by others, the upper bound has remained essentially unchanged. As evidence in favor of the conjecture, Matoušek and Alon-Bucić-Sauermann studied the problem with non-Euclidean distances in the plane, and proved that "most" of these non-Euclidean distances obey the conjecture in some sense. Surprisingly, the key ingredients of the construction come from a very different part of mathematics known as algebraic number theory, which studies concepts like factorization in extensions of the integers known as algebraic number fields. New techniques from algebraic number theory At a high level, the proof begins with a familiar geometric idea and pushes it in an unexpected direction. Erdős’s original lower bound can be understood through the Gaussian integers: numbers of the form a + b i a+bi a + bi , where a a a and b b b are integers and i i i is the square root of − 1 -1 − 1 . The Gaussian integers extend the ordinary integers and, like them, enjoy properties such a unique factorization into primes. Such extensions of the ordinary integers or rationals are known as algebraic number fields. The new argument replaces the Gaussian integers by more complicated generalizations from algebraic number theory with richer symmetries that can create many more unit-length differences. The precise argument uses tools such as infinite class field towers and Golod–Shafarevich theory to show the number fields required for the argument actually exist. These ideas were well-known to algebraic number theorists, but it came as a great surprise that these concepts have implications for geometric questions in the Euclidean plane. What this means for mathematics This result marks an important moment in the interaction between AI and mathematics: an AI system has autonomously resolved a longstanding open problem at the center of an active field. It also offers an early glimpse of a new kind of collaboration between AI and human mathematicians. In this case, the companion work by external mathematicians paints a substantially richer picture than the original solution alone. As Thomas Bloom writes in the companion note: “ When assessing the importance and influence of an AI-generated proof, a question I ask myself is: has this taught us something new about the problem? Do we understand discrete geometry better now? I think the answer is a moderated yes: this shows that there is a lot more that number theoretic constructions have to say about these sorts of questions than we suspected; moreover, that the number theory