pith. sign in

arxiv: 2605.20695 · v1 · pith:HTMKJTNBnew · submitted 2026-05-20 · 🧮 math.CO · math.NT

Remarks on the disproof of the unit distance conjecture

Noga Alon , Thomas F. Bloom , W. T. Gowers , Daniel Litt , Will Sawin , Arul Shankar , Jacob Tsimerman , Victor Wang
show 1 more author
Melanie Matchett Wood
This is my paper

Pith reviewed 2026-05-21 04:08 UTC · model grok-4.3

classification 🧮 math.CO math.NT
keywords Erdős unit distance conjecturecounterexampleunit distancespoint configurationsalgebraic constructionhuman verification
0
0 comments X

The pith

A human-verified algebraic point set disproves the Erdős unit distance conjecture.

A machine-rendered reading of the paper's core claim, the machinery that carries it, and where it could break.

The paper supplies a compact, hand-checkable version of a counterexample to the Erdős unit distance conjecture, which had claimed that n points in the plane determine at most O(n to the 4/3) unit distances. The authors condense an earlier AI-generated construction into a short argument that draws on algebraic and number-theoretic techniques traceable to Ellenberg-Venkatesh, the Golod-Shafarevich theorem, and Hajir-Maire-Ramakrishna. A reader following the argument sees an explicit finite collection of points whose pairwise distances include more than the conjectured number of exact units. The work therefore shows that the long-standing upper bound does not hold.

Core claim

The authors exhibit a finite point set in the Euclidean plane that realizes more unit distances than the Erdős conjecture permits, presenting the construction in a form short enough for direct human verification and built from algebraic ideas associated with Ellenberg-Venkatesh, Golod-Shafarevich, and Hajir-Maire-Ramakrishna.

What carries the argument

An algebraic construction of a point configuration, obtained by solving systems of polynomial equations or group presentations that force many pairs of points to satisfy the unit-distance equation.

If this is right

  • The maximum number of unit distances among n points in the plane must grow faster than the conjectured O(n^{4/3}) bound.
  • New finite point configurations exist that realize asymptotically more unit distances than previously thought possible.
  • The same style of algebraic construction may be adapted to produce high-distance examples in other metric spaces or for other fixed distances.

Where Pith is reading between the lines

These are editorial extensions of the paper, not claims the author makes directly.

  • AI systems can generate candidate constructions that become transparent once reduced to their essential algebraic steps.
  • The same circle of ideas might be tested on related open questions about incidences or repeated distances in the plane.

Load-bearing premise

The original AI-generated construction contains no undetected algebraic or geometric errors and the human verification step has correctly established that the resulting point set exceeds the conjectured number of unit distances.

What would settle it

An independent enumeration of all pairwise distances in the presented point set that shows the total number of exact unit distances is strictly larger than the maximum allowed by the Erdős conjecture for that number of points.

read the original abstract

We present a short, digested, human-verified version of the recent OpenAI-generated counterexample to the Erd\H{o}s 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.

Editorial analysis

A structured set of objections, weighed in public.

Desk editor's note, referee report, simulated authors' rebuttal, and a circularity audit. Tearing a paper down is the easy half of reading it; the pith above is the substance, this is the friction.

Referee Report

2 major / 2 minor

Summary. The manuscript presents a short, digested, human-verified version of an OpenAI-generated counterexample to the Erdős unit distance conjecture. It claims the existence of a finite point set in the plane realizing strictly more than O(n^{4/3}) unit distances and traces key steps of the argument to ideas from Ellenberg-Venkatesh, Golod-Shafarevich, and Hajir-Maire-Ramakrishna, followed by reflections on the construction.

Significance. A verified counterexample would disprove a central conjecture in discrete geometry and combinatorial number theory. The paper's contribution is in distilling the AI-generated example into a human-accessible form and linking it to prior algebraic and geometric techniques, which could aid independent verification and suggest new directions for constructing extremal point sets.

major comments (2)
  1. The manuscript does not supply the explicit point coordinates, the algebraic relations enforcing unit lengths, or the incidence count that establishes the excess over the O(n^{4/3}) bound. This information is load-bearing for the central claim of a counterexample; without it, the human-verification assertion cannot be checked directly.
  2. The connections to Ellenberg-Venkatesh, Golod-Shafarevich, and Hajir-Maire-Ramakrishna are asserted in the abstract and reflections but are not accompanied by specific theorem citations or a step-by-step mapping showing how those results are adapted to produce the finite point set.
minor comments (2)
  1. State the precise value of n and the exact number of unit distances achieved so that the violation of the conjectured bound can be quantified.
  2. Add a short appendix or diagram clarifying the geometric configuration if the main text is kept deliberately concise.

Simulated Author's Rebuttal

2 responses · 0 unresolved

We thank the referee for the careful reading and constructive comments on the manuscript. We respond to each major comment below and indicate the planned revisions.

read point-by-point responses

  1. Referee: The manuscript does not supply the explicit point coordinates, the algebraic relations enforcing unit lengths, or the incidence count that establishes the excess over the O(n^{4/3}) bound. This information is load-bearing for the central claim of a counterexample; without it, the human-verification assertion cannot be checked directly.

    Authors: We agree that these details are essential for direct verification of the counterexample claim. The present manuscript is a concise, digested overview emphasizing reflections and conceptual links rather than exhaustive computational data. In the revision we will add an appendix containing the explicit coordinates of the finite point set, the algebraic relations (including minimal polynomials) that enforce the unit distances, and a direct count or comparison establishing that the number of unit distances exceeds the O(n^{4/3}) bound. revision: yes

  2. Referee: The connections to Ellenberg-Venkatesh, Golod-Shafarevich, and Hajir-Maire-Ramakrishna are asserted in the abstract and reflections but are not accompanied by specific theorem citations or a step-by-step mapping showing how those results are adapted to produce the finite point set.

    Authors: We acknowledge that the connections are currently stated at a high level. We will revise the manuscript to include precise citations to the relevant theorems in each of these works and insert a short step-by-step outline in the reflections section that maps the key ideas (e.g., algebraic geometry techniques, pro-p group constructions, and class-field-tower methods) onto the steps used to generate the finite point set. revision: yes

Circularity Check

0 steps flagged

No significant circularity: counterexample is externally generated and human-verified

full rationale

The paper presents a digested, human-verified version of an OpenAI-generated counterexample rather than deriving the result from first principles within its own text. Key ideas are attributed to independent prior works by Ellenberg-Venkatesh, Golod-Shafarevich, and Hajir-Maire-Ramakrishna. No load-bearing steps reduce by construction to self-definitions, fitted inputs renamed as predictions, or self-citation chains. The central claim rests on the external construction's correctness and verification, which is not shown to loop back to the paper's own inputs.

Axiom & Free-Parameter Ledger

0 free parameters · 1 axioms · 0 invented entities

Only the abstract is available, so the ledger is necessarily incomplete. No free parameters, invented entities, or non-standard axioms are mentioned in the provided text.

axioms (1)
  • standard math Standard results and techniques from algebraic number theory and algebraic geometry as developed in the cited works of Ellenberg-Venkatesh, Golod-Shafarevich, and Hajir-Maire-Ramakrishna.
    The abstract states that the argument relies crucially on ideas attributable to these prior sources.

pith-pipeline@v0.9.0 · 5609 in / 1362 out tokens · 45534 ms · 2026-05-21T04:08:43.002216+00:00 · methodology

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.

Lean theorems connected to this paper

Citations machine-checked in the Pith Canon. Every link opens the source theorem in the public Lean library.

What do these tags mean?
matches
The paper's claim is directly supported by a theorem in the formal canon.
supports
The theorem supports part of the paper's argument, but the paper may add assumptions or extra steps.
extends
The paper goes beyond the formal theorem; the theorem is a base layer rather than the whole result.
uses
The paper appears to rely on the theorem as machinery.
contradicts
The paper's claim conflicts with a theorem or certificate in the canon.
unclear
Pith found a possible connection, but the passage is too broad, indirect, or ambiguous to say the theorem truly supports the claim.

Reference graph

Works this paper leans on

37 extracted references · 37 canonical work pages

  1. [1]

    Shabnam Akhtari, Jeffrey D. Vaaler, and Martin Widmer,Effective equidistribution of norm one elements in CM-fields, arXiv preprint arXiv:2507.10387, to appear in Annali della Scuola Normale Superiore di Pisa, Classe di Scienze (2025). 2

    work page arXiv 2025

  2. [2]

    Noga Alon, Matija Bucić, and Lisa Sauermann,Unit and distinct distances in typical norms, Geom. Funct. Anal. 35(2025), 1–42. 1, 16

    work page 2025

  3. [3]

    Marcus Appleby, Steven Flammia, Gary McConnell, and Jon Yard,Generating ray class fields of real quadratic fields via complex equiangular lines, Acta Arithmetica192(2020), 211–233. 2

    work page 2020

  4. [4]

    Batyrev and Yuri Tschinkel,Manin’s conjecture for toric varieties, J

    Victor V. Batyrev and Yuri Tschinkel,Manin’s conjecture for toric varieties, J. Algebraic Geom.7(1998), 15–53. 2 17

    work page 1998

  5. [5]

    Mikhail Belolipetsky and Alexander Lubotzky,Manifolds counting and class field towers, Advances in Mathe- matics229(2012), 3123–3146. 2

    work page 2012

  6. [6]

    Bloom,Erdős problem #90,https://www.erdosproblems.com/90, 2026, Accessed 2026-05-09

    Thomas F. Bloom,Erdős problem #90,https://www.erdosproblems.com/90, 2026, Accessed 2026-05-09. 1

    work page 2026

  7. [7]

    Armand Borel and Gopal Prasad,Finiteness theorems for discrete subgroups of bounded covolume in semi-simple groups, Publications Math’ematiques de l’IH’ES69(1989), 119–171. 5

    work page 1989

  8. [8]

    Peter Brass, William Moser, and János Pach,Research problems in discrete geometry, Springer, New York, 2005. 7

    work page 2005

  9. [9]

    Peter Brass, William O. J. Moser, and János Pach,Research problems in discrete geometry, Springer, New York,

    work page

  10. [10]

    ID rnm002, 18 pp

    JordanS.EllenbergandAkshayVenkatesh,Reflection principles and bounds for class group torsion, International Mathematics Research Notices2007(2007), Art. ID rnm002, 18 pp. 2, 3

    work page 2007

  11. [11]

    Paul Erdős,Some of my favourite problems which recently have been solved, Proceedings of the International MathematicalConference, Singapore1981(Singapore, 1981), North-HollandMath.Stud., vol.74, North-Holland, Amsterdam-New York, 1982, pp. 59–79. 8

    work page 1981

  12. [12]

    Paul Erdős,Some of my favourite unsolved problems, A tribute to Paul Erdős (1990), 467–478. 8

    work page 1990

  13. [13]

    Paul Erdős,Some of my favourite problems in number theory, combinatorics, and geometry, Resenhas2(1995), 165–186, Combinatorics Week (Portuguese) (SÃo Paulo, 1994). 8

    work page 1995

  14. [14]

    Paul Erdős,On sets of distances ofnpoints, American Mathematical Monthly53(1946), 248–250. 1, 7

    work page 1946

  15. [15]

    E. S. Golod and I. R. Shafarevich,On the class field tower, Izv. Akad. Nauk SSSR Ser. Mat.28(1964), 261–272 (Russian), English translation: Amer. Math. Soc. Transl. (2) 48 (1965), 91–102. 5

    work page 1964

  16. [16]

    E. S. Golod and I. R. Shafarevich,On class field towers, Fourteen Papers on Logic, Algebra, Complex Variables and Topology, American Mathematical Society Translations, Series 2, vol. 48, American Mathematical Society, Providence, RI, 1965, English translation of the 1964 Russian paper, pp. 91–102. 5

    work page 1965

  17. [17]

    Venkatesan Guruswami,Constructions of codes from number fields, IEEE Transactions on Information Theory 49(2003), 594–603. 2

    work page 2003

  18. [18]

    Larry Guth and Nets Hawk Katz,On the Erdős distinct distances problem in the plane, Annals of Mathematics 181(2015), 155–190. 14

    work page 2015

  19. [19]

    II (Barcelona, 2000) (Carles Casacuberta, Rosa Maria Miró-Roig, Joan Verdera, and Sebastià Xambó-Descamps, eds.), Progress in Mathematics, vol

    Farshid Hajir and Christian Maire,Asymptotically good towers of global fields, European Congress of Math- ematics, Vol. II (Barcelona, 2000) (Carles Casacuberta, Rosa Maria Miró-Roig, Joan Verdera, and Sebastià Xambó-Descamps, eds.), Progress in Mathematics, vol. 202, Birkhäuser, Basel, 2001, pp. 207–218. 16

    work page 2000

  20. [20]

    2, 3, 5, 6, 16

    Farshid Hajir, Christian Maire, and Ravi Ramakrishna,Cutting towers of number fields, Annales Mathématiques du Québec45(2021), 321–345. 2, 3, 5, 6, 16

    work page 2021

  21. [21]

    Helmut Koch,Galois theory ofp-extensions, Springer Monographs in Mathematics, Springer, Berlin, Heidelberg,

    work page

  22. [22]

    Kopp,SIC-POVMs and the Stark conjectures, International Mathematics Research Notices (2021), 13812–13838

    Gene S. Kopp,SIC-POVMs and the Stark conjectures, International Mathematics Research Notices (2021), 13812–13838. 2

    work page 2021

  23. [23]

    Lenstra, H

    Jr. Lenstra, H. W.,Codes from algebraic number fields, Mathematics and Computer Science, II, CWI Mono- graphs, vol. 4, North-Holland Publishing Co., Amsterdam, 1986, Proceedings of the conference held in Amster- dam, 1986, pp. 95–104. 2

    work page 1986

  24. [24]

    Xue-Bin Liang,Theq-ary gilbert-varshamov bound can be improved for all but finitely many positive integersq, 2024, Preprint. 2

    work page 2024

  25. [25]

    S. N. Litsyn and M. A. Tsfasman,Constructive high-dimensional sphere packings, Duke Mathematical Journal 54(1987), 147–161. 2

    work page 1987

  26. [26]

    J. E. Littlewood,On the class-number of the corpusp( √ −k), Proceedings of the London Mathematical Society s2-27(1928), 358–372. 14

    work page 1928

  27. [27]

    Laura Luzzi, Roope Vehkalahti, and Cong Ling,Almost universal codes for MIMO wiretap channels, IEEE Transactions on Information Theory64(2018), 7218–7241. 2

    work page 2018

  28. [28]

    Christian Maire and Frédérique Oggier,Maximal order codes over number fields, Journal of Pure and Applied Algebra222(2018), 1827–1858. 2

    work page 2018

  29. [29]

    James Maynard,Sums of three positive cubes, Journal of the London Mathematical Society113(2026), e70554. 16

    work page 2026

  30. [30]

    Shafarevich,Extensions à points de ramification donnés (en russe), Publications Mathématiques de l’IHÉS18(1963), 71–92 (Russian)

    Igor R. Shafarevich,Extensions à points de ramification donnés (en russe), Publications Mathématiques de l’IHÉS18(1963), 71–92 (Russian). 5

    work page 1963

  31. [31]

    Extensions with prescribed ramification points

    Igor R. Shafarevich,Extensions with given points of ramification, American Mathematical Society Translations, Series 259(1966), 128–149, English translation by J. W. S. Cassels; title also cited as “Extensions with prescribed ramification points”. 5 18

    work page 1966

  32. [32]

    Spencer, Endre Szemerédi, and William T

    Joel H. Spencer, Endre Szemerédi, and William T. Trotter,Unit distances in the euclidean plane, Graph The- ory and Combinatorics (Béla Bollobás, ed.), Academic Press, London, 1984, Proceedings of the Cambridge Conference, 1983, pp. 293–303. 1, 7

    work page 1984

  33. [33]

    Székely,Crossing numbers and hard Erdős problems in discrete geometry, Combinatorics, Probability and Computing6(1997), 353–358

    László A. Székely,Crossing numbers and hard Erdős problems in discrete geometry, Combinatorics, Probability and Computing6(1997), 353–358. 7

    work page 1997

  34. [34]

    Tsfasman,Global fields, codes and sphere packings, Astérisque198–200(1991), 373–396

    Michael A. Tsfasman,Global fields, codes and sphere packings, Astérisque198–200(1991), 373–396. 2

    work page 1991

  35. [35]

    Roope Vehkalahti and Laura Luzzi,Number field lattices achieve gaussian and rayleigh channel capacity within a constant gap, 2015 IEEE International Symposium on Information Theory (ISIT), IEEE, 2015, pp. 436–440. 2

    work page 2015

  36. [36]

    Akshay Venkatesh,A note on sphere packings in high dimension, International Mathematics Research Notices (2013), 1628–1642. 2

    work page 2013

  37. [37]

    Walfisz,On the class-number of binary quadratic forms, Trav. Inst. Math. Tbilissi11(1942), 57–71. 14 Email address:nalon@math.princeton.edu Email address:thomas.bloom@manchester.ac.uk Email address:w.t.gowers@dpmms.cam.ac.uk Email address:daniel.litt@utoronto.ca Email address:wsawin@math.princeton.edu Email address:ashankar@math.toronto.edu Email address:...

    work page 1942