Published June 5, 2026 | Version 1.0

Norm packets and unit distances: the geometric reduction in Sawin's construction

Authors/Creators

Description

The recent disproof of the Erdős unit-distance conjecture (Alon, Bloom, Gowers, Litt, Sawin, Shankar, Tsimerman, Wang, and Wood, following the OpenAI construction; and Sawin) proceeds in two logically separable halves: an arithmetic half that produces, inside a CM number field of large degree, a "norm packet" — exponentially many algebraic integers of a single prescribed relative norm — and a geometric half that converts such a packet into many unit distances in the plane through a cut-and-project model set. The arithmetic half is the deep input: in the present note it is treated as a hypothesis, while in the construction of Sawin and of the nine-author account it is supplied by the tower lemma together with the Frobenius-cutting argument of Hajir, Maire, and Ramakrishna; pushing its quantitative reach toward Sawin's ceiling is governed by relative class-number lower bounds (his Remark 14), subtle because of potential Siegel zeros. The geometric half, by contrast, is robust and essentially elementary once standard facts about model sets are granted. This note isolates and states that geometric half as a self-contained conditional implication — a norm packet of size M yields at least about Mn/4 pairs of an n-point planar set at a single distance, hence about n^(1+δ) unit distances when M grows polynomially in n — records a clean proof, and makes explicit the exponent bookkeeping (the exponent as a ratio of two logarithms, amplification over scale) together with the exponential-in-degree fragility flagged in the author's earlier audit. No new theorem about unit distances is claimed. Positioned between the existence theorems of the nine-author account and Sawin and the explicit exponent computations of Sawin, Emmerich, and the author, the reduction is the bridge on which the latter turn; its value is that it is load-bearing, and that isolating it exhibits the arithmetic bottleneck — a relative class-number lower bound of the kind in Sawin's Remark 14 — in clean form.

Files

Norm packets and unit distances.pdf

Files (10.4 MB)

Name Size Download all
md5:882612b0f00e043a3277fcec4d70e6fc
10.4 MB Preview Download

Additional details

References

  • W. Sawin, "An explicit lower bound for the unit distance problem", arXiv:2605.20579 (2026). doi:10.48550/arXiv.2605.20579
  • N. Alon, T. F. Bloom, W. T. Gowers, D. Litt, W. Sawin, A. Shankar, J. Tsimerman, V. Wang, M. M. Wood, "Remarks on the disproof of the unit distance conjecture", arXiv:2605.20695 (2026). doi:10.48550/arXiv.2605.20695
  • F. Hajir, C. Maire, R. Ramakrishna, "Cutting towers of number fields", Annales mathématiques du Québec 45 (2021), 321–345. doi:10.1007/s40316-021-00156-8
  • M. T. M. Emmerich, "Optimizing Explicit Unit-Distance Lower-Bound Certificates", arXiv:2606.03419 (2026). doi:10.48550/arXiv.2606.03419
  • G. Frisina, "An optimized explicit exponent for the unit-distance problem within Sawin's construction", Zenodo (2026). https://doi.org/10.5281/zenodo.20553929
  • G. Frisina, "Critical Audit of an AI-Assisted Norm-Packet Strategy for the Planar Unit-Distance Problem", Zenodo (2026). https://doi.org/10.5281/zenodo.20480532
  • R. V. Moody, "Meyer sets and their duals", in: The Mathematics of Long-Range Aperiodic Order (Waterloo, ON, 1995), NATO ASI Ser. C 489, Kluwer, Dordrecht (1997), 403–441.
  • M. Baake, U. Grimm, "Aperiodic Order. Vol. 1: A Mathematical Invitation", Encyclopedia of Mathematics and its Applications 149, Cambridge University Press (2013).
  • P. Erdős, "On sets of distances of n points", American Mathematical Monthly 53 (1946), 248–250. doi:10.2307/2305092
  • J. Spencer, E. Szemerédi, W. T. Trotter, "Unit distances in the Euclidean plane", in: Graph Theory and Combinatorics (Cambridge, 1983), Academic Press, London (1984), 293–303.