An Exponent of 1.043 for the Unit Distance Problem

Primarily AI-generated textHuman understanding: some partsmath.CO — Combinatoricsmath.NT — Number Theory

Contributed by Eric Naslund

Version 1 / Oct 02, 2026 / CC BY 4.0

Abstract

Let u(U)u(U) count the unordered pairs at distance one in a finite planar set UU. We construct finite sets UjU_j with ∣Uj∣→∞|U_j|\to\infty and u(Uj)/∣Uj∣1.043171→∞u(U_j)/|U_j|^{1.043171}\to\infty. The largest exponent previously claimed, apart from preliminary versions of the present work, is 1.03581.0358, in the author's unpublished manuscript. The method is the number-field construction of OpenAI and Sawin. Here unit distances come from elements of relative norm one in quadratic extensions K/FK/F in which FF has both real and complex places, and the fields come from an infinite pro-22 tower over $\Q(\sqrt{241})$, ramified only above 22, 33 and 55, with Frobenius conditions at the two primes above 2929 and at one prime above 4141. The relative zeta value is bounded through the dihedral quotients of the tower group: the tower group has 2727 quotients isomorphic to the dihedral group of order~88; fifteen of them detect, by a census, the residue degree of the primes that split completely in the Kummer field up to norm 4⋅10134\cdot10^{13}, and seven of them generate a field EW′′E_{W''} of degree 81928192 contained in every field of the tower. We write ζEW′′\zeta_{E_{W''}} as a product of LL-functions of degrees 22, 44 and~88, evaluate the 576576 of degrees 44 and 88 rigorously at 2121 real points near~11, and combine the values through a kernel inequality with coefficients of both signs. Finite facts and numerical inequalities are certified by exact computation and interval arithmetic. Partial formalization PALOMAR-2026-10-01-000018 v2

Provenance statement

This work was done with extensive AI use, with agents developing the mathematics and writing the paper. I supervised and prompted the AI agents that produced this work. While this has been edited to improve readability, I recommend the reader also make use of their AI model of choice to ask the paper questions. The construction over $\Q(\sqrt{241})$, the computations that certify it, the Lean formalization of the reduction of the proof of exponent $1.0427$ to one explicit zeta inequality, and this paper were produced with a combination of Claude Opus 5.5, ChatGPT Sol 5.6, ChatGPT Astra 6, working as agents in Claude Code and Codex. The construction adapts the author's previous manuscript which obtained 0.0358 which was also written with AI tools.

Formalizations

Tools used

OpenAI
ChatGPTVersion Astra 6
OpenAI
ChatGPTVersion Sol 5.6
Anthropic
Claude OpusVersion 5.5
Meta
MuseVersion Spark 1.3 Contributor

References

  1. Noga Alon, Thomas F. Bloom, W. T. Gowers, Daniel Litt, Will Sawin, Arul Shankar, Jacob Tsimerman, Victor Wang, and Melanie Matchett Wood, Remarks on the disproof of the unit distance conjecture , 2026, arXiv:2605.20695v1; https://arxiv.org/abs/2605.20695v1 .arXiv
  2. Leonardo de Moura and Sebastian Ullrich, The Lean 4 theorem prover and programming language , Automated Deduction---CADE 28 (Cham) (Andr é Platzer and Geoff Sutcliffe, eds.), Lecture Notes in Computer Science, vol. 12699, Springer, 2021, pp. 625--635.
  3. Tim Dokchitser, Computing special values of motivic LL -functions , Experimental Mathematics 13 (2004), no. 2, 137--149.
  4. Michael T. M. Emmerich, Optimizing explicit unit-distance lower-bound certificates , 2026, arXiv:2606.03419v5, June 9, 2026 (v1 June 2, 2026); certificate with =0.015263 =0.015263 ; https://arxiv.org/abs/2606.03419v5 .arXiv
  5. Michael T. M. Emmerich and Francesco Cordella, Optimized certificate for the unit distance problem with extended prime number range , Zenodo record, June 5, 2026, Certificate and verification code. https://doi.org/10.5281/zenodo.20551478 .DOI
  6. Paul Erd o s, On sets of distances of nn points , The American Mathematical Monthly 53 (1946), no. 5, 248--250, https://doi.org/10.1080/00029890.1946.11991674 .DOI
  7. , Some problems in number theory, combinatorics and combinatorial geometry , Mathematica Pannonica 5 (1994), no. 2, 261--269.
  8. Mikhail Ershov, Golod--Shafarevich groups: a survey , International Journal of Algebra and Computation 22 (2012), no. 5, 1230001, 68 pages.
  9. Ralph H. Fox, Free differential calculus. I : Derivation in the free group ring , Annals of Mathematics 57 (1953), no. 3, 547--560.
  10. E. S. Golod and I. R. Shafarevich, On the class field tower , Izv. Akad. Nauk SSSR Ser. Mat. 28 (1964), no. 2, 261--272 (Russian), English translation: Amer. Math. Soc. Transl. (2) 48 (1965), 91--102; https://www.mathnet.ru/eng/im2955 .link
Show all 42 referencesShow fewer references
  1. Farshid Hajir, Christian Maire, and Ravi Ramakrishna, Cutting towers of number fields , Annales math é matiques du Qu é bec 45 (2021), no. 2, 321--345.
  2. Erich Hecke, Eine neue Art von Zetafunktionen und ihre Beziehungen zur Verteilung der Primzahlen . Zweite Mitteilung , Mathematische Zeitschrift 6 (1920), 11--51, https://doi.org/10.1007/BF01202991 .DOI
  3. S. A. Jennings, The structure of the group ring of a pp -group over a modular field , Transactions of the American Mathematical Society 50 (1941), no. 1, 175--185, https://doi.org/10.2307/1989916 .DOI
  4. Fredrik Johansson, Rigorous high-precision computation of the Hurwitz zeta function and its derivatives , Numerical Algorithms 69 (2015), no. 2, 253--270.
  5. , Arb : Efficient arbitrary-precision midpoint-radius interval arithmetic , IEEE Transactions on Computers 66 (2017), no. 8, 1281--1292, https://doi.org/10.1109/TC.2017.2690633 .DOI
  6. St é phane Louboutin, Explicit bounds for residues of Dedekind zeta functions, values of LL -functions at s=1s=1 , and relative class numbers , Journal of Number Theory 85 (2000), no. 2, 263--282, https://doi.org/10.1006/jnth.2000.2545 .DOI
  7. James S. Milne, Lectures on é tale cohomology , 2013, Version 2.21, March 22, 2013; https://www.jmilne.org/math/CourseNotes/LEC.pdf .link
  8. , Algebraic number theory , 2020, Version 3.08, July 19, 2020; https://www.jmilne.org/math/CourseNotes/ANT.pdf .link
  9. , Class field theory , 2020, Version 4.03, August 6, 2020; https://www.jmilne.org/math/CourseNotes/CFT.pdf .link
  10. mlewko , Post in the discussion thread of Erd o s P roblem #90 , Erd o s Problems forum, May 21, 2026, Reports =0.031849981 =0.031849981 in Sawin's criterion, with finite data found by ChatGPT; accessed September 30, 2026; https://www.erdosproblems.com/forum/thread/90 .link
  11. Eric Naslund, Answer to `` W hat is the unit distance exponent?'' , MathOverflow, answer 511576, 2026, Posted May 23, 2026, last edited June 9, 2026; accessed September 30, 2026; https://mathoverflow.net/a/511576 .link
  12. , An exponent of 1.04273 for the unit distance problem: L ean formalization at exponent 1.04271.0427, conditional on one zeta inequality , Palomar registry, PALOMAR-2026-10-01-000018, version 1, 2026, https://palomar-registry.org/entry?id=PALOMAR-2026-10-01-000018&version=1 ; Lean 4 source at https://github.com/enaslund/unit-distance-bound-0.0427/tree/e0ac836176016dbefae28646bc91fc3a5aca30e8/lean .link
  13. , An improved explicit lower bound for the unit distance problem , Unpublished manuscript, 2026, Records exponent 1.03583241.0358324. https://github.com/enaslund/unit-distance-bound-0.0427/tree/8ab94da4ba4faf6f6d8fe43c298f04c3b284e796/papers/0.0358324 .link
  14. , Supplementary programs and data for `` A n exponent of 1.04273 for the unit distance problem'' , GitHub repository, directory papers/0.04273/certificates , 2026, https://github.com/enaslund/unit-distance-bound-0.0427 .link
  15. National Institute of Standards and Technology , NIST Digital Library of Mathematical Functions , 2026, Release 1.2.8, September 15, 2026; accessed September 27, 2026; https://dlmf.nist.gov/ .link
  16. J ü rgen Neukirch, Alexander Schmidt, and Kay Wingberg, Cohomology of number fields , 2 ed., Grundlehren der mathematischen Wissenschaften, vol. 323, Springer, Berlin, Heidelberg, 2008.
  17. OpenAI , Planar point sets with many unit distances , Research manuscript, May 20, 2026, https://cdn.openai.com/pdf/74c24085-19b0-4534-9c90-465b8e29ad73/unit-distance-proof.pdf .link
  18. Erd o s unit distance exponent , Entry 84a of Optimization Constants in Mathematics , a crowdsourced repository started by Terence Tao, 2026, Accessed September 30, 2026; https://teorth.github.io/optimizationproblems/constants/84a.html .link
  19. Bjorn Poonen, Rational points on varieties , Graduate Studies in Mathematics, vol. 186, American Mathematical Society, Providence, RI, 2017, https://math.mit.edu/ poonen/papers/Qpoints.pdf .link
  20. Claudio Quadrelli, Pro- pp groups with few relations and universal Koszulity , Mathematica Scandinavica 127 (2021), no. 1, 28--42, https://doi.org/10.7146/math.scand.a-123644 .DOI
  21. D. G. Quillen, On the associated graded ring of a group ring , Journal of Algebra 10 (1968), no. 4, 411--418, https://doi.org/10.1016/0021-8693(68)90069-0 .DOI
  22. Will Sawin, An explicit lower bound for the unit distance problem , 2026, arXiv:2605.20579v1; https://arxiv.org/abs/2605.20579v1 .arXiv
  23. Jean-Pierre Serre, A course in arithmetic , Graduate Texts in Mathematics, vol. 7, Springer, New York, 1973.
  24. Joel Spencer, Endre Szemer é di, and William T. Trotter, Jr., Unit distances in the Euclidean plane , Graph Theory and Combinatorics (B é la Bollob á s, ed.), Academic Press, London, 1984, https://trotter.math.gatech.edu/papers/44.pdf , pp. 293--303.link
  25. spiderduckpig , Answer to `` W hat is the unit distance exponent?'' , MathOverflow, answer 511531, 2026, Posted May 21, 2026, with 1+1.031883065539641+ 1.03188306553964 ; comment of May 22, 2026 proposing a weighted count in the Zassenhaus filtration in Sawin's Golod--Shafarevich step, with 0.0333487156372102 0.0333487156372102; last edited June 9, 2026; accessed September 30, 2026; https://mathoverflow.net/a/511531 .link
  26. L á szl ó A. Sz é kely, Crossing numbers and hard Erd o s problems in discrete geometry , Combinatorics, Probability and Computing 6 (1997), no. 3, 353--358, https://doi.org/10.1017/S0963548397002976 .DOI
  27. John T. Tate, Fourier analysis in number fields and Hecke 's zeta-functions , Algebraic Number Theory (J. W. S. Cassels and A. Fr ö hlich, eds.), Academic Press, London, 1967, Originally a Princeton University doctoral thesis, 1950; https://www.lms.ac.uk/publications/algebraic-number-theory , pp. 305--347.link
  28. The FLINT team , FLINT : F ast L ibrary for N umber T heory , 2026, Version 3.6.0, used through python-flint 0.9.0; https://flintlib.org .link
  29. The mathlib Community , The Lean mathematical library , Proceedings of the 9th ACM SIGPLAN International Conference on Certified Programs and Proofs, ACM, 2020, pp. 367--381.
  30. The mpmath development team , mpmath : A Python library for arbitrary-precision floating-point arithmetic , 2023, Version 1.3.0; https://github.com/mpmath/mpmath/releases/tag/1.3.0 .link
  31. The PARI Group , PARI/GP , Universit é de Bordeaux, 2025, Version 2.17.2; https://pari.math.u-bordeaux.fr/ .link
  32. M. A. Tsfasman and S. G. Vl a du t , Infinite global fields and the generalized Brauer--Siegel theorem , Moscow Mathematical Journal 2 (2002), no. 2, 329--402, https://doi.org/10.17323/1609-4514-2002-2-2-329-402 .DOI

Version history

  1. v1 · 66 pagesSubmitted by Eric NaslundInitial depositSupersededOct 01, 2026
  2. v2 · 101 pagesSubmitted by Eric NaslundSubmitted as a new versionCurrentOct 10, 2026