Research notes on every problem, and a library of the papers behind them. Built from the open erdos repository.
Updated
Openai 2026 sharp fourier certificate planar circle packing
corollary_5_2: The manuscript's periodic equality case: a periodic packing of disks of radius 1/2 with covered-area density π/(2√3) has center set isometric to the triangular lattice of minimal distance one; claimed, not verified here.
theorem_1_1: The manuscript's main claim: a real radial Schwartz f on the plane with f(0)=2/√3, Fourier transform 1 at the origin and nonnegative everywhere, and f nonpositive outside the unit disk; formally verified here in Lean.
OpenAI, A sharp Fourier certificate for planar circle packing, OpenAI Math
Release preprint, September 23, 2026. Released under the Apache License 2.0 at
https://github.com/openai/math (revision adc7f1241), folder
preprints/A-sharp-Fourier-certificate-for-planar-circle-packing-September-23-2026;
the held PDF, paper.pdf in the release, is retained as
openai_2026_sharp_fourier_certificate_planar_circle_packing.pdf,
and the release's TeX bundle sits in the same folder.
@misc{OAI:A-sharp-Fourier-certificate-for-planar-circle-packing-September-23-2026,
author = {{OpenAI}},
title = {{A sharp Fourier certificate for planar circle packing}},
howpublished = {OpenAI Math Release preprint
\href{https://github.com/openai/math/blob/main/preprints/A-sharp-Fourier-certificate-for-planar-circle-packing-September-23-2026/paper.pdf}{OAI:A-sharp-Fourier-certificate-for-planar-circle-packing-September-23-2026}},
year = {2026}
}Attestation, recorded as the source's own statements and not as this
corpus's review: the release's root README says its manuscripts were
"produced by an internal OpenAI model", that the collection "includes results
at different stages of verification", that not all of them have Lean
formalizations, and that "Some of the unformalized results could have
issues". The manuscript's own README carries the title, the author line
"OpenAI", the date, the citation block and instructions for running the
release's numerical certificate (Python 3 with python-flint 0.9.0,
verification/verify_all.py, and an optional exact-rational check
verification/check_sjj_rational.py); it adds no statement about how the
text was produced or checked. The title page names no individual author, and
the text names no referee, reader or prior circulation. No refereed
publication, arXiv version or independent review of the manuscript is
recorded here and nothing on this card is independently
reviewed.
Formalization, as the release describes it. The release's
lean/formalization.yaml, its catalogue of papers with a formalized main
result, does not list this manuscript or any manuscript of its family. The
family's Lean page, lean/docs/090.md, does name this manuscript among its
accompanying papers and says that the formalization constructs a radial Schwartz
function on with , ,
real and nonnegative everywhere and for ,
"the sharp Fourier certificate conditions yielding density ", and
that "The separate uniqueness statement for periodic equality cases is outside
this selected theorem". It names the comparator statement file
lean/ComparatorChallenges/PlanarPacking.lean, whose theorem
OAI.sharp_fourier_certificate asserts the existence of a SchwartzMap on
EuclideanSpace ℝ (Fin 2) satisfying a predicate SharpCertificate (radial;
Fourier transform one at the origin; value at the origin; Fourier
transform real with nonnegative real part everywhere; nonpositive where
), with the Fourier transform defined by the kernel
as in the manuscript; the challenge record
PlanarPacking.json names the solution module OAI.Analysis.PlanarPacking.Main
and permits the three standard axioms. The comparator statement reads as the
four conditions of
Theorem 1.1
and nothing more: it does not encode the packing-density consequence,
Corollary 5.2,
or any Erdős problem.
Formal verification. This corpus's verification built
OAI.sharp_fourier_certificate at the release revision named above with the
toolchain leanprover/lean4:v4.34.1 and checked its axioms, which are exactly
propext, Classical.choice and Quot.sound, with no sorry; its fingerprint
was found identical to the comparator challenge. Compared clause by clause with
the manuscript, the statement is
Theorem 1.1
in full: the Fourier transform is the integral against
for the standard volume, a genuine integral
for a Schwartz function, and the four conditions match the printed display
exactly. Theorem 1.1 is therefore formally verified here. Not verified here:
Corollary 5.2,
the zero-set display (5.5) and the density consequence, which the Lean statement
does not encode; the release's interval and rational checkers, which were not
run; and the manuscript's prose proofs, which are not reviewed.
The release groups this manuscript in a family with three others, each filed in this library: Universal optimality of the triangular lattice, An atomic certificate for triangular-lattice universal optimality and Triangular minimality for planar Coulomb renormalized energy. The family description concerns energy minimization by the triangular lattice; this manuscript is a companion result, the sharp linear-programming bound for packing rather than for energy. The manuscript cites none of the three and none of its proofs depends on them, so the relation is the release's grouping and not a dependency in either direction.
Read status: claims checked for Theorem 1.1, Corollary 5.2 and the
statements of Lemma 2.1, Proposition 2.2, Lemma 2.4, Lemma 3.2, Lemma 3.3,
Proposition 3.4, Lemma 4.1, Lemma 4.2, Proposition 4.3, Lemma 5.1,
Proposition 5.3 and Lemma A.1, read clause by clause in the TeX source
(main.tex; sections/introduction.tex, label intro:main;
sections/fourier.tex; sections/interpolation.tex; sections/signs.tex;
sections/normalization.tex, labels normalization:origin-lemma and
normalization:periodic-uniqueness; sections/certificates.tex;
sections/independent-certification.tex, which inputs
sections/rational-check.tex as its Section B.4) on 2026-10-07; the proofs
were read for their structure only and no step was checked; the interval
and rational computations the proofs cite were not run here; nothing here is
independently reviewed. Page numbers below are those of the held PDF (49
pages: title, abstract and contents on pp. 1--2, text from p. 3, references
on p. 49).
Contents
- Section 1, Introduction (pp. 3--5). Scales the disks to radius , so that a packing is a center set with for distinct centers, and defines the upper covered-area density as the limsup over the disks about the origin of the covered fraction of . Recalls that the triangular lattice attains and that Thue's theorem supplies the matching upper bound (citing Hales's exposition of Rogers's argument [5]), and that the linear-programming method of Cohn and Elkies [2] asks for a single function with sign constraints on it and on its Fourier transform; fixes the Fourier convention . States Theorem 1.1: a real radial Schwartz with , , everywhere and outside the open unit disk. Says that the theorem "gives an affirmative answer to the two-dimensional case of Cohn and Elkies's Conjecture 7.3" (p. 3): their Theorem 3.1 gives the density bound for every packing, periodic or not; the rescaled is the equal-origin witness of their Theorem 3.2 with and for . Notes, as the manuscript's own qualification, that every zero of with has integer squared radius, which yields the periodic equality case (Corollary 5.2), while has zeros off the shells of the covolume-one triangular lattice and so "does not meet the additional zero-set requirement" of Cohn and Elkies's Conjecture 8.1 (p. 3). Section 1.1 places the result against Cohn and Elkies's Laguerre--Gaussian numerics with Sturm sign checks, Viazovska's dimension 8 function [10], the dimension 24 function of Cohn, Kumar, Miller, Radchenko and Viazovska [3], Gorbachev's independent bound, the interpolation formulas of Radchenko and Viazovska [7] and of Cohn, Kumar, Miller, Radchenko and Viazovska [4], the latter's Conjecture 7.5 that triangular shell data do not determine a radial Schwartz function, proved by Sardari [8, Theorem 1.7], and a 2026 bachelor's thesis abstract of Zhitniaia [12] announcing a modular-form "magic function" for the hexagonal lattice, compared only through its abstract; the manuscript says the relation of that claim to Theorem 1.1 "remains to be determined" (p. 4). Section 1.2 outlines the construction: Poisson summation forces the function and its transform to vanish on the shells of the lattice and its dual; the triangular lattice normalized to covolume one is a rotation of its dual, so one periodic node set covers both shell sets; double zeros are imposed everywhere except a simple zero with prescribed negative slope at the first physical shell; a trigonometric polynomial divided by linear and quadratic factors gives Hermite cardinal functions (a pattern the text attributes to Carneiro, Littmann and Vaaler [1]); a Gaussian factor makes them Schwartz; a finite matrix and tail estimates solve the coupled equations on ; Bernstein coefficients certify signs on half-gaps; a sine-product barrier covers the unbounded region; Poisson summation fixes the normalization exactly.
- Section 2, Gaussian cardinal functions (pp. 5--10). Fixes , , and the coordinate (the same on the Fourier side); the lattice with basis , has covolume one, is its rotation by a right angle, and the shell coordinate of is . The node set is with , which contains every positive value of (by residues modulo and ) and strictly more ( is not represented). The vanishing factor has double zeros on with periodic node data , tabulated exactly (, ). A cardinal function is with over and an coefficient list. Lemma 2.1 (finite-measure representation): extends to an entire function with a total-variation bound linear in , and ; the node identities , follow (display (2.17), p. 8). Proposition 2.2 (Gaussian Fourier pairing): is real, radial and Schwartz with , where , , and , so and its derivatives decay exponentially. Remark 2.3 records a Hankel representation of on the real axis, "not used as a numerical sign certificate" (p. 10). Section 2.3 takes two cardinal functions with fixed node-zero data and , sets and the pair , , and imposes , and for ; Lemma 2.4 rewrites these as coupled coefficient equations.
- Section 3, Solving the interpolation equations (pp. 11--15). Works on with the operator sending a list to the Fourier-side node data of its cardinal function, and the blocks , , (51 nodes, 102 coordinates), . Table 1 gives rational envelopes for , , and the folded densities on six pieces of ; they yield the row-tail bounds , , , and an atom-column tail below . Remark 3.1 notes that is compact. Lemma 3.2 (finite certificates): for , is invertible with , and , and the tabulated approximate lists (Table 2, integers scaled by , zero beyond node ) satisfy the coefficient equations on with residuals below , with norms below and below past node ; its proof is the interval computation of Appendix A. Lemma 3.3: has a bounded inverse on with for residuals split at node (two Schur complements and Neumann series). Proposition 3.4 (exact interpolation and coefficient enclosure): unique real lists satisfy the equations with the fixed data, each within of its tabulated list in and of norm below ; the text stresses that uniqueness holds within this coefficient family only, shell data alone being insufficient by Sardari's theorem.
- Section 4, Global signs (pp. 16--21). Sets , and . Section 4.1 covers (index ) and (index ) by half-gaps from each node to the adjacent gap midpoints, assigns an order ( at for index , on the rightward half-gap at for index , otherwise) and compares the quotient for the exact function against the tabulated 's Taylor expansion with its terms of order below removed, the difference being controlled by with . Lemma 4.1 (finite Bernstein certificate): the degree- Bernstein coefficients of the truncated tabulated series exceed (), (), () and () on every half-gap; its proof is again Appendix A. Section 4.2 bounds the coefficient-perturbation error (, , by center) and the truncation error (below at five representative triples), giving quotient bounds , , , on the covered intervals. Section 4.3 treats : the rational part , the second derivative of the remainder is below , and Lemma 4.2 gives for the nearest zero (logarithmic concavity on half-gaps and the closed form with , midpoint quotients , , and ), so . Proposition 4.3 (global signs and zeros): the zero sets of on and of on are exactly , and off the nodes, the zero of at is simple and every other listed zero is exactly double; hence where and .
- Section 5, Poisson normalization (pp. 22--25). With and , Poisson summation on for the dilations gives for all , twice differentiable termwise by the Schwartz bounds. Lemma 5.1 (exact origin value): , from the identity at and its first derivative at , where only the six first-shell vectors contribute on the physical side and only the origin term on the Fourier side; this uses the exact jets and not the sign estimates. Section 5.2 proves Theorem 1.1 by , , and records the radial zero sets and with the slope at the exclusion radius. Section 5.3 derives the packing consequence: for a periodic packing with cosets of a lattice of covolume the Poisson comparison gives , hence density at most ; for arbitrary packings it cites Cohn and Elkies's Theorem 3.1 and reconciles the density conventions; the text calls this "the classical packing-density theorem recovered from the new Fourier certificate, not a new density claim" (p. 24). Corollary 5.2 (periodic equality case): a periodic packing of density has center set isometric to , by the integer squared distances forced by the zero set and the even integral lattice argument of Cohn and Elkies's Section 8. Section 5.4, Proposition 5.3 (second differentiated Poisson identity): and hence ; the text says it "is not needed for the construction or its sign proof" (p. 25).
- Appendix A, Finite certificates (pp. 26--34). Section A.1 prints the
exact inputs: Table 2 (the integer coefficient table), the
fixed node-zero data, the exact table norms ,
, and , and two rational
matrices (scaled by ) used as approximate
inverses so that no computed inverse is needed. Section A.2 defines the
moments and
and the first Fejér rule with nodes per piece (exact through
degree , positive weights, after Waldvogel [11]); Lemma A.1
(quadrature moment error): for inputs supported on with
list norm at most , , , and
, the rule's error in each moment is below , by
analytic continuation to disks of radius , a pointwise majorant
and Cauchy's estimate. Section A.3 specifies the interval
evaluation in pseudocode and states that the supplied program encloses
every quantity with Arb [6] through
python-flintat bits, enlarging each moment by , checks individual Bernstein inequalities, and accepts a bound only when the whole enclosure lies strictly on the asserted side; the text says the Arb citation "does not by itself certify this local environment, its call domains, or a run" (p. 32). Section A.4 tabulates the certified matrix bounds (, defects , three grouped product norms, the exterior block below ) with sample enclosures, and the residual bounds below ; Section A.5 the grouped Bernstein lower bounds (for example at , and at , and at nodes --); Section A.6 the named scalar comparisons of the second verifier (row-envelope sums , , , ; the atom tail; nine sign rows; five Taylor representatives; three disk comparisons). - Appendix B, Alternative certification methods (pp. 34--48), whose methods
the primary certificate does not use. Section B.1 fixes 36-digit rationals
, for , , a rounded exponential (Lemma B.1:
error below on its stated domain) and rational upper bounds
for . Section B.2 prescribes a fixed rational evaluation of the full
rule; Lemma B.2 bounds its moment errors by and its
node-constant errors by , and the text says "No matrix,
residual, or Bernstein values are asserted by that error theorem"
(p. 36).
Section B.3 propagates such errors to the operator pairs (below
) and Bernstein sums (below ). Section B.4
(the file
rational-check.tex): the optional programcheck_sjj_rational.pyevaluates the block on by exact rational arithmetic with an rule; Lemma B.3 bounds each entry's error by , and the program checks the two defect norms below and the inverse bounds below , and asserts no execution of the full rational prescription. Section B.5 compares three majorants for that block and closes by saying that they do not extend the program's coverage: it "still checks only the 36 first-block entries and the two inverse certificates, not the residual or Bernstein tables" (p. 43). Section B.6 gives a rational-center Taylor integration scheme: Lemma B.4 (Taylor averages) and Proposition B.5 (two conditional Taylor budgets), described as "a computability statement for each specified finite set of inputs, not a claim that any of its moment sums have been evaluated" (p. 46). Section B.7, Proposition B.6, gives a local node-Taylor formula for the derivatives of the direct cardinal function only. - References (p. 49): twelve entries, Carneiro, Littmann and Vaaler (2013); Cohn and Elkies (2003); Cohn, Kumar, Miller, Radchenko and Viazovska (2017 and 2022); Hales (2000); Johansson (2017); Radchenko and Viazovska (2019); Sardari (arXiv 2102.08753v2); Titi and Garloff (2019); Viazovska (2017); Waldvogel (2006); Zhitniaia (2026 thesis abstract).
The proofs rest on these external inputs, taken at statement level and not
checked here: the two-dimensional Gaussian Fourier transform and Poisson
summation for lattices and their translates (standard, derived in the text);
Cohn and Elkies's Theorem 3.1 (the density bound for arbitrary packings; the
periodic case is proved in the text); the even integral lattice argument of
Cohn and Elkies's Section 8, which the text reproves for Corollary 5.2; the
Bernstein range enclosure of Titi and Garloff, with an elementary proof
given; the first Fejér rule of Waldvogel, with exactness proved; and Arb's
ball arithmetic (Johansson) for the computation itself. The manuscript
flags as computer-assisted the finite certificates Lemma 3.2 and Lemma 4.1,
whose proofs are the interval computation of Appendix A, so that Proposition
3.4, Proposition 4.3, Theorem 1.1 and Corollary 5.2 all depend on that
computation; it flags the Appendix B methods as alternatives that assert no
finite values beyond the first block; it flags the relation to the
Zhitniaia thesis as undetermined; and it states that the rescaled witness
does not satisfy the zero-set condition of Cohn and Elkies's Conjecture 8.1,
that the uniqueness in Proposition 3.4 is within its coefficient family only,
and that the density bound it recovers is the classical one. The release's
folder for this manuscript holds a verification/ directory whose README
says that verify_all.py checks the finite matrix, residual, Bernstein and
scalar comparisons against the supplied data tables and writes result files,
while the analytic quadrature, continuum, and infinite-tail arguments remain
in the article; it is not copied here and was not run here.
Bears on
- Problem 991: does not apply. The problem asks whether the -point sets on maximizing the product of pairwise distances, the minimizers of logarithmic energy, have spherical cap discrepancy . This manuscript concerns planar circle packing: it constructs a Fourier auxiliary function certifying the density and says nothing about the sphere, logarithmic energy or discrepancy; the release's connection to the problem runs through the family's companion manuscripts on energy minimization, not through this one. Theorem 1.1 is formally verified here; the page's status rests on its own acceptance evidence.
- Problem 662: does not apply. In its retained imported wording the problem asks whether, among planar sets with pairwise distances at least , the number of distances at most is bounded by the triangular lattice's count , "with equality perhaps only for the triangular lattice". Theorem 1.1 with Cohn and Elkies's Theorem 3.1 (Section 5.3) yields the global covered-area density bound for sets with the same separation, and Corollary 5.2 recovers the triangular lattice as the unique periodic equality case of that density bound; neither counts pairs below a threshold, a density bound alone does not determine the threshold counts the problem asks about, and the manuscript names no Erdős problem. Theorem 1.1 is formally verified here and Corollary 5.2 is not; the page's open status with its statement-fidelity qualification rests on its own evidence.