Disproof of Erdős Unit Distance Conjecture

• The paper presents a counterexample by constructing infinite planar point sets with n^(1+δ) (δ≈0.014) unit-distance pairs, refuting the classical conjecture.
• It employs a synthesis of discrete geometry and arithmetic methods from CM number fields and infinite class-field towers to derive explicit bounds.
• The approach bridges combinatorial geometry and number theory, offering new insights for tackling related problems in extremal and incidence geometry.

The Erdős unit distance conjecture, posed in 1946, asserts that for all $\epsilon>0$, there exists a constant $C_\epsilon$ such that any $n$-point set $P\subset \mathbb{R}^2$ determines at most $C_\epsilon n^{1+\epsilon}$ pairs of points at unit distance, or, equivalently, that the function $U(n)$—the maximal number of unit distances among $n$ planar points—satisfies $U(n)=n^{1+o(1)}$. This conjecture has shaped decades of combinatorial geometry, yet recent breakthroughs have established explicit counterexamples demonstrating that $U(n)$ can exceed $n^{1+\delta}$ for some absolute $C_\epsilon$0 and infinitely many $C_\epsilon$1, refuting the conjecture. These results synthesize techniques from discrete geometry, algebraic number theory, and the theory of infinite class field towers, revealing a deep and previously unexploited bridge between geometric and arithmetic phenomena (Alon et al., 20 May 2026, Sawin, 20 May 2026).

1. Formulation of the Erdős Unit Distance Conjecture and Its Disproof

The original conjecture is that for every $C_\epsilon$2, there exists $C_\epsilon$3 such that

$C_\epsilon$4

for any $C_\epsilon$5-point set $C_\epsilon$6. Equivalently, $C_\epsilon$7, the maximal number of unit-distance pairs among $C_\epsilon$8 points in the plane, grows as $C_\epsilon$9. Erdős's classical lower bound, given by placing points on an integer grid, yields $n$0, and previously no construction substantially exceeded $n$1.

The work of Alon, Bloom, Gowers, Litt, Sawin, Shankar, Tsimerman, and Wang presents a human-verified proof of a counterexample originally generated by an OpenAI system, establishing:

Theorem 1.1 (main counterexample):

There exists $n$2 and an infinite sequence of finite planar point sets $n$3 with $n$4 such that

$n$5

Thus, for infinitely many $n$6, $n$7, disproving the conjecture $n$8 (Alon et al., 20 May 2026).

Sawin constructs explicit sets with $n$9 points yielding more than $P\subset \mathbb{R}^2$0 unit-distance pairs, providing an explicit exponent (Sawin, 20 May 2026).

2. Core Geometric and Number-Theoretic Lemmas

The proof architecture relies on transforming an arithmetic property of lattices in high-dimensional complex vector spaces into a geometric property of planar point sets.

Let $P\subset \mathbb{R}^2$1 be a full-rank lattice, normalized so that all nonzero $P\subset \mathbb{R}^2$2 have $P\subset \mathbb{R}^2$3 for some $P\subset \mathbb{R}^2$4 and the projection onto the first coordinate is injective. Let $P\subset \mathbb{R}^2$5 denote the unit-norm lattice points. The geometric “window” plus “translate-and-count” lemma [(Alon et al., 20 May 2026), Lemma 2.1] shows that for large $P\subset \mathbb{R}^2$6, one can obtain planar sets $P\subset \mathbb{R}^2$7 with

$P\subset \mathbb{R}^2$8

where $P\subset \mathbb{R}^2$9 and $C_\epsilon n^{1+\epsilon}$0 is a constant depending on the lattice. If $C_\epsilon n^{1+\epsilon}$1, one obtains $C_\epsilon n^{1+\epsilon}$2 for some fixed $C_\epsilon n^{1+\epsilon}$3 independent of $C_\epsilon n^{1+\epsilon}$4, and letting $C_\epsilon n^{1+\epsilon}$5 produces infinitely many sets with superlinear unit-distance complexity.

3. Construction of Lattices with Many Unit-Norm Points

The lattice construction exploits properties of CM number fields $C_\epsilon n^{1+\epsilon}$6 (i.e., totally imaginary quadratic extensions of totally real number fields) and their rings of integers $C_\epsilon n^{1+\epsilon}$7 The approach generalizes the techniques of Ellenberg–Venkatesh in the context of $C_\epsilon n^{1+\epsilon}$8-torsion bounds in class groups:

• Fix a CM field $C_\epsilon n^{1+\epsilon}$9 of degree $U(n)$0 and select $U(n)$1 distinct prime ideals $U(n)$2 of $U(n)$3, none conjugate to another.
• Define $U(n)$4 for integers $U(n)$5, and set $U(n)$6 where $U(n)$7 means $U(n)$8 has absolute value $U(n)$9 in every complex embedding.
• A pigeonhole argument in the class group yields $n$0, with $n$1 the class number.

These unit-norm elements translate into planar point-set constructions via the geometric lemma, provided that the parameters $n$2 and $n$3 (minimum norm, covolume) are controlled (Alon et al., 20 May 2026).

4. Infinite Class Field Towers and Prime Splitting

To maintain bounded discriminant and control parameter growth as $n$4, the construction lets $n$5 run through the layers of an infinite class-field tower as in the Golod–Shafarevich theorem:

• Take $n$6 for totally real fields $n$7 in a tower unramified outside a finite set $n$8 of rational primes, with all splitting completely at some $n$9.
• The Golod–Shafarevich theorem ensures the infinitude of such towers, and the fields can be chosen so that parameters (root discriminant, minimum norm) stay bounded.
• The “Frobenius-cutting” technique of Hajir–Maire–Ramakrishna enables the construction of towers with infinitely many split primes satisfying required congruence conditions, crucial for assembling many unit-norm elements.

This infinite-tower machinery allows taking $U(n)=n^{1+o(1)}$0 while keeping all technical requirements met (Alon et al., 20 May 2026).

5. Explicit Lower Bounds and the Optimization of Parameters

Sawin refines this framework to deliver explicit bounds:

• The exponent $U(n)=n^{1+o(1)}$1 in $U(n)=n^{1+o(1)}$2 unit-distance pairs is computable in terms of the degree $U(n)=n^{1+o(1)}$3, root discriminant $U(n)=n^{1+o(1)}$4 of $U(n)=n^{1+o(1)}$5, prime sets $U(n)=n^{1+o(1)}$6 and $U(n)=n^{1+o(1)}$7, assignments of prime multiplicities $U(n)=n^{1+o(1)}$8, and geometric window radius $U(n)=n^{1+o(1)}$9.
• By optimizing these parameters with
  • $U(n)$0,
  • $U(n)$1 a set of 22 primes,
  • $U(n)$2
  • $U(n)$3,
  • one achieves $U(n)$4, so for infinitely many $U(n)$5 there exist planar sets with $U(n)$6 unit-distance pairs (Sawin, 20 May 2026).

6. Methodological Significance and Verification

All combinatorial and number-theoretic lemmas used in the proofs are classical or elementary, including:

• The geometry-of-numbers window-counting argument
• The class-group pigeonhole principle
• Golod–Shafarevich theory for infinite towers
• Class number bounds in terms of discriminant

The proofs have been independently digested and rewritten by human experts, ensuring each step is rigorous and transparently justified. The innovation lies in applying the degree-growth flexibility of class field towers (traditionally not exploited in combinatorial geometry), in conjunction with explicit prime splitting and the arithmetic properties of number fields.

7. Reflections, Extensions, and Impact

These results mark the first disproof of the Erdős unit distance conjecture, dramatically changing the landscape of combinatorial geometry. The approach underscores a profound new connection between discrete geometry and high-degree arithmetic, with potential implications for related extremal problems such as distinct distances and higher-dimensional analogues.

Prominent reflections from the authors and other mathematicians include:

• The realization that the possibility of increasing the number field degree offers far more constructional flexibility than previously considered,
• The observation that prior research predominantly focused on upper bounds,
• The suggestion that the AI-generated proof required only short “hint-sequences” for human verification,
• The novelty of varying the underlying number field, rather than just selection of special primes,
• The sociological and citation implications for mathematics in the AI era.

A plausible implication is that this arithmetic-geometric paradigm could stimulate advances in related incidence problems, and that analytic improvement of class number estimates or refinements to local conditions may further push the exponent above $U(n)$7 (Alon et al., 20 May 2026, Sawin, 20 May 2026). However, certain limitations (such as the construction only producing infinitely many $U(n)$8) and natural barriers (e.g., trivial lower bound $U(n)$9 for exponent with these methods) remain.

---

Paper	Main Contribution	Exponent Achieved
"Remarks on the disproof of the unit distance conjecture" (Alon et al., 20 May 2026)	Human-verified, concise exposition of the AI-derived counterexample; lattice and number-field machinery; explicit mechanism for infinite $n^{1+\delta}$0	Existence of $n^{1+\delta}$1
"An explicit lower bound for the unit distance problem" (Sawin, 20 May 2026)	Fully explicit parameter selection; detailed proof with class-number and discriminant computation	$n^{1+\delta}$2

The disproof inaugurates a new era in additive combinatorics and discrete geometry, establishing a paradigm wherein infinite-dimensional number-theoretic constructions yield sharp incidence bounds unreachable by geometric extremal methods alone.