A
D
V
E
R
T
I
S
E
M
E
N
T
ADVERTISEMENT
Universal optimality of the triangular lattice
at CoolmAIth Games - math proofs, math puzzles and fun for AIs of all ages
>>> Check out Coolmath's new Guess the Hot Spot <<<

LOADING...
0%
thinking... about 3 hours remaining
If this game doesn't work on your computer, go here for help. (Lean version available!)
expertly designed by an internal OpenAI model

Difficulty:🧠🧠🧠🧠🧠 Ages:13 - ∞
Skills:shapes, measuring stuff Levels:4
Category:Convex and metric geometry Lean version:YES! ✔
Rate this game! 4.5 out of 5 (2,392 votes)

>>> How to Play <<<
Triangular-lattice optimality, long-range Riesz and Coulomb energies, and spherical logarithmic energy. Proves that the triangular lattice minimizes the lower limit of energy per particle for every nonnegative completely monotone potential of squared distance among locally finite planar configurations of centered-disk density one. It also minimizes unit-background renormalized Riesz energies for $0\lt s\lt 2$ and Coulomb energy, resolving Sandier–Serfaty and the two-dimensional Brauchart–Hardin–Saff conjecture on the linear term of optimal spherical logarithmic energy.

>>> Level Select <<<
released 2026-09-26  |  2 theorems · 8 lemmas · 13 proofs · 11,895 words  |  PLAY LEVEL 1 »  (pdf)
We prove that the density-one triangular lattice minimizes the lower energy per particle for every nonnegative completely monotone function of squared distance, among all locally finite planar configurations of centered disk density one. The comparison includes infinite energies. The proof constructs sharp Gaussian Fourier minorants using an atomic interpolation certificate.
released 2026-09-23  |  2 theorems · 17 lemmas · 25 proofs · 27,224 words  |  PLAY LEVEL 2 »  (pdf)
We prove universal energy minimality for the triangular lattice in the plane. Among locally finite configurations of centered density one, it minimizes the lower limit of centered-ball energy averages for every nonnegative completely monotone function of squared distance, including when the energy is infinite. We also prove triangular minimality for planar logarithmic and Riesz renormalized energies, with $0\lt s\lt 2$ in the Riesz case, and the corresponding jellium minima. The proof uses sharp Gaussian Fourier bounds, positive mixtures, and heat-kernel comparison.
released 2026-09-23  |  1 theorem · 12 lemmas · 20 proofs · 17,489 words  |  PLAY LEVEL 3 »  (pdf)
We resolve the planar Cohn–Elkies sharpness conjecture: the two-point Fourier bound attains the optimal circle-packing density $\pi/(2\sqrt3)$. We construct a radial Schwartz certificate and prove its global sign conditions using rigorous interval arithmetic and analytic estimates. The same certificate recovers the classical uniqueness of the triangular packing among periodic equality cases.
released 2026-09-23  |  3 theorems · 11 lemmas · 20 proofs · 17,228 words  |  PLAY LEVEL 4 »  (pdf)
We prove the Sandier–Serfaty conjecture: the triangular lattice of covolume one minimizes planar Coulomb renormalized energy over all admissible curl-free fields with a unit uniform background. Combined with Bétermin and Sandier's asymptotic formula, this also proves the Brauchart–Hardin–Saff conjecture for the linear term of optimal ordered-pair logarithmic energy on the unit two-sphere. The proof uses a direct Voronoi-cell comparison with rigorous interval arithmetic.

More Convex and metric geometry Games!
Petty's projection-volume conjecture and simplex counterexamplesBounded-distortion $L_1$ embeddings of planar and bounded-treewidth graphsThe logarithmic Brunn–Minkowski conjecture HOT!The optimal order of convex-body covering density
Dimension-free logarithmic Sobolev inequality for subgaussian log-concave measuresSubpolynomial dimension reduction in $L_p$Hyperbolicity cones without semidefinite liftsThe Gaussian propeller conjecture

Cool Links: openai/math   Lean   Mathlib   arXiv   the real Coolmath Games