Research notes on every problem, and a library of the papers behind them. Built from the open erdos repository.
Updated
Statement
Let and let
be the triangular lattice of covolume one. For a locally finite set and the closed disk of radius about the origin, write and ; the configuration has centered disk density one when as . For the manuscript's energy is the lower limit over ordered pairs,
well defined in because density one makes positive for large .
Theorem 1.1 (Universal energy minimality, p. 2). Suppose is smooth and completely monotone: for all integers and all . If is locally finite and has centered disk density one, then, with both sides taken in ,
The manuscript's own qualifications: the class includes every Gaussian , , and every inverse power , ; the potential may be singular at zero and the lattice sum may diverge, in which case the claim is ; no separation or local occupancy bound is imposed on ; the theorem identifies the minimum value and not the set of minimizers; the density and lower-energy formulation is that of Cohn, Kumar, Miller, Radchenko and Viazovska (Definitions 1.1--1.3 of their 2022 paper). The manuscript states that it does not claim a sharp auxiliary function for each mixed completely monotone potential, the per-potential quantifier of the Cohn--Kumar conjecture; it claims sharp auxiliary functions for every Gaussian and the energy inequality for every potential in the class.
Source. OpenAI, Universal optimality of the triangular lattice, release
folder Universal-optimality-of-the-triangular-lattice-September-23-2026;
TeX sections/01-uniform-gaussian-theorem.tex, environment
thm:universal with the definitions above it (PDF pp. 1--2); the proof is
completed in sections/07-shifted-mixtures.tex (PDF pp. 38--39). Read on
2026-10-07. The card
records the provenance
and the release's own attestations.
Read depth. Claims checked: the statement, the definitions of , of centered disk density and of , and the qualifying sentences of Section 1 were read clause by clause in the TeX source. The proof, Sections 2--7 with Appendix A (Appendix C is a conditional alternative), was read for its structure (below) and no step was checked; the computer-checked Proposition 3.3 was not rerun. Nothing here is independently reviewed.
Proof pointer
The proof occupies Sections 2--7 (pp. 5--39) and has three stages.
The first stage, Sections 2--5, proves Theorem 2.1 (p. 6): for every real there are entire functions and a real radial Schwartz with and , , such that and on for , with , and at every point of the node set . Every nonzero shell of lies in , and the dual lattice is a rotation of , so the contacts needed for both lattices are imposed at once; the manuscript prescribes data on this periodic superset and proves uniqueness only within its summable coefficient system, in contrast with the non-uniqueness Talebizadeh Sardari proved for the shells alone. Section 2 encodes the nodes by a sine product with double zeros, writes cardinal functions with summable coefficients as integrals of compactly supported spectral measures, damps by to get radial Schwartz functions, and computes their Fourier transforms through the complex Gaussian transform, giving a second kernel whose jets at distant nodes decay like uniformly in the input locations. The two sides are coupled, and , so the contacts become a linear system data on pairs of lists. Section 3 fixes finite reference columns on the 84 nodes up to 168 by a positive Fejér rule (exact through degree 383, error below ) and finite geometric sums of the quadrature block, and states Proposition 3.3, a finite certificate of norm bounds and of strict lower bounds for 37,310 Bernstein coefficients and ten tail quantities, over five parameter boxes with endpoints ; its proof is the release's Arb ball computation. Section 4 (Proposition 4.1) solves the exact system by inverting the finite block and a Neumann series for the Schur complement on the tail, with the exact lists within of the reference lists. Section 5 proves the signs: on by subtracting value and slope at each node, dividing by the squared distance, approximating the quotient by a degree-40 polynomial whose Bernstein coefficients the certificate bounds below, and absorbing the list, truncation and target errors with margin ; for by the positivity of the low-node rational part, the barrier at a nearest zero, and a remainder with double zeros and second derivative below .
The second stage, Section 6, turns the pair into a sharp Gaussian bound. Proposition 6.1 proves, for real even Schwartz with and any of centered disk density one, that , by Cauchy--Schwarz for the positive form with the point measure on and area measure on the disk of radius ; the cross term is controlled uniformly in the point positions because every point of has a disk of radius inside the larger disk. Lemma 6.2 gives, for every , a radial Schwartz with , equality on and vanishing transform on : for take and multiply the Theorem 2.1 pair by ; for use the pair at and Fourier complementation. Poisson summation over identifies with the lattice Gaussian sum, giving display (6.6): the Gaussian energy inequality for every and every competitor, with no periodicity assumed of the competitor.
The third stage, Section 7, passes to the class. Lemma 7.1 represents a smooth on with alternating derivative signs as for a positive measure of mass with no atom at zero, by a finite-difference solution of the discrete moment problem and a compactness argument that keeps endpoint atoms. Proposition 7.2 applies this to the shift , whose mass is finite even for singular ; for the kernel is the Gaussian with , the endpoint is the constant kernel, and Fatou's lemma with Tonelli's theorem transfers the Gaussian inequalities to the mixture along any sequence . After is used termwise, tends to zero in the lattice sum alone, by monotone convergence. The completion (pp. 38--39) shows has centered disk density one and that its energy is at most the lattice sum, so equality holds, including the infinite case.
Dependencies
External results cited at statement level, none checked here: the background-measure linear-programming argument of Cohn and de Courcy-Ireland (Proposition 2.2 of their Gaussian core paper) and Cohn and Zhao (Theorem 3.3 of their sphere packing bounds paper), of which the manuscript re-proves the form it needs; the Gaussian duality calculation of Cohn and Miller (Section 6 of their paper on optimal functions in dimensions 8 and 24), given in full here; the Hausdorff--Bernstein--Widder representation theorem, of which Lemma 7.1 proves the finite-measure form used; the first Fejér quadrature rule as described by Waldvogel, whose exactness and positivity are proved in the text; the Bernstein coefficient enclosure as in Titi and Garloff; the Arb ball arithmetic of Johansson, which the computer check of Proposition 3.3 uses; the complex Gaussian transform and Poisson summation, proved or standard. The energy and density definitions follow Cohn, Kumar, Miller, Radchenko and Viazovska. The two companion manuscripts of the release are cited for the framework and as an independent proof, not as premises. The proof of Proposition 3.3 is a computer-assisted step whose program is held in the release, not here.
Bears on
- Problem 662: does not apply. The problem counts pairs, or distinct distances, at most in sets of minimum separation one; the page records two variants. A threshold indicator is not a completely monotone function of squared distance and the theorem's hypothesis is a density, not a separation. The theorem neither supports nor contradicts any variant on the page; the claim is unverified here and the page's status rests on its own evidence.
- Problem 991: does not apply. The theorem concerns planar energies and says nothing about point sets on or their cap discrepancy; its logarithmic consequence, Corollary 8.1, is likewise a planar statement with no spherical or discrepancy content. The claim is unverified here and the page's status is unchanged by it.