betaFeedback

WorksMathematics

A proof of the Reinhardt conjecture

Abstract

We prove the Reinhardt conjecture: among centrally symmetric convex disks in the plane, the smoothed regular octagon has the least optimal lattice packing density, and equality holds precisely for its nonsingular affine images. The proof combines explicit bounds on the number of control arcs, local cost inequalities and rigorous finite verification of the remaining switching types.

Introduction

For a centrally symmetric convex disk D⊂R2D \subset\mathbb{R}^{2} with nonempty interior, let

δL(D)=sup⁡L∣D∣det⁡L,\delta_{L}(D)=\sup_{\mathcal{L}}\frac{|D|}{\det\mathcal{L}},

where the supremum is over lattices whose translates of int⁡D\operatorname{int} D are pairwise disjoint. The Reinhardt problem asks for the minimum of δL(D)\delta_{L}(D). Nonsingular affine transformations preserve this density.

In 1934, Reinhardt proposed the smoothed regular octagon as a minimizer [6]. It is obtained by rounding the corners of a regular octagon with arcs of hyperbolas. The problem is unusual even among planar packing questions: the disk that minimizes its best lattice packing density is neither a polygon nor an ellipse.

Mahler developed a variational approach in 1947 [4]. His programme separates two questions. The first is whether every minimizing disk is a smoothed polygon, with finitely many straight and hyperbolic boundary pieces. The second is whether that polygon must be the smoothed regular octagon. These are commonly called Mahler’s first conjecture and the Reinhardt conjecture, respectively. Nazarov proved local extremality of the Reinhardt octagon in 1986; the English translation appeared in 1988 [5]. This established the conjectured disk as a local minimizer, while leaving the global problem unresolved.

Hales gave a variational formulation [1] and subsequently formulated the problem as an optimal-control problem [2]. In this formulation, a constant vertex control traces one arc of a smoothed polygon. An obstruction to a finite description is the possible accumulation of infinitely many switches in finite time. Hales and Vajjha excluded this behavior and proved Mahler’s first conjecture [3, Theorem 16.3.1]. Their theorem applies to every original global minimizer itself, and supplies a finite positive control representation. It does not supply a numerical bound on the number of its arcs.

We prove the second conjecture, including the full equality statement.

Theorem 1.1 (The Reinhardt conjecture). Let DoctD_{\mathrm{oct}} be the smoothed regular octagon. Every centrally symmetric convex disk D⊂R2D \subset\mathbb{R}^{2} with nonempty interior satisfies

δL(D)≥δL(Doct)=8−42−log⁡222−1.\delta_{L}(D) \ge\delta_{L}(D_{\mathrm{oct}}) = \frac{8-4\sqrt{2}-\log2}{2\sqrt{2}-1}.

Equality holds precisely when DD is a nonsingular affine image of DoctD_{\mathrm{oct}}.

The proof begins by making qualitative finiteness quantitative. In § 3.6, a uniform positive cost for every thirteen consecutive control arcs gives the explicit bound N<26⋅2160<2165N < 26 \cdot2^{160} < 2^{165} for the number NN of positive maximal pieces at a prescribed fundamental cut. The estimate uses the geometric bounds and switching equations of the original minimizing problem. It precedes the sharper inequalities adapted to particular switching words.

The local estimates of Part I provide lower costs for forward pairs, five-arc sources, returned supports and larger cores. The capacity theorem, Theorem 6.2, combines these estimates while charging each physical arc with total weight at most one. Applied to maximal runs of positive and negative increments, they first give B≤20B \le20, hence N≤21N \le21, in § 4.2; here BB is the number of essential switches. The twist and switching restrictions then leave 1355 necessary cyclic words. Proposition 17.1 excludes 1334 by exact rational combinations of local costs, leaving 21 words and the sharper bounds B≤13B \le13, N≤14N \le14. The all-length run argument in § 4.6–§ 4.10 obtains the same list directly. The numbers 1355 and 21 count candidate words, rather than arcs.

The passage from those twenty-one words to six types uses further geometry. § 4.13–§ 4.23 combine returned and crossed-core cost bounds with comparisons at the actual arc endpoints, a conditional bound for the cost of a central triple, and exhaustive alternatives for the necessary equations. Theorem 24.1 leaves precisely R01–R06 as necessary types: three have eight essential arcs and three have nine. Parts III and IV exclude them individually, using their closure equations, geometric reductions and rigorous finite covers. The short-chain rigidity argument in Appendix A then identifies the smoothed regular octagon and gives the equality statement. Appendix H specifies the mathematical inputs and checking procedures for the computational steps; the accompanying reader archive supplies their algorithms and fixed data.

Acknowledgments

The author proposed the argument giving an explicit finite upper bound for the number of control arcs. ChatGPT dot carried out the sustained exploration of local cost lower bounds. ChatGPT 6.1 Sol carried out the proofs of the six remaining types R01–R06 and the organization of the manuscript. The author retains responsibility for the mathematical claims and their presentation.

The author thanks Chuanming Zong and Thomas Hales for the seminar discussions around 2015 through which they introduced him to this problem. For more than a decade, leaving this conjecture unresolved made him restless. The purpose of this paper is to show that the conjecture can be resolved. The present proof is long, and the author hopes that further work will lead to a shorter and more beautiful proof.

Part I. Geometry, sources, and local costs

The geometric problem and its normalization

The finite reduction is applied to a global minimizer of the original geometric problem. We first specify the trajectory, the full lift, and the changes of coordinates under which the local estimates will be used. The foundational interfaces are stated here; their detailed proofs appear after the finite assembly, and are referenced explicitly below.

The original minimizing class

For a centrally symmetric convex disk DD with nonempty interior, write

δL(D)=sup⁡L∣D∣det⁡L.\delta_L(D)=\sup_{\mathcal{L}}\frac{|D|}{\det\mathcal{L}}.

where the supremum is over lattices whose translates of DD have pairwise disjoint interiors. An original global minimizer is a disk attaining the infimum of this quantity over all centrally symmetric convex disks. The density is unchanged by nonsingular affine transformations. The normalization used here fixes the area of a minimum-area circumscribed centrally symmetric hexagon to 232\sqrt{3} and represents its moving frame in SL2(R)\mathrm{SL}_2(\mathbb{R}).

The geometric formulation, existence and reconstruction results are the inputs of [2, Sections 2.2–2.3] and [3, Chapters 2–3]. In particular, the regular representation of an arbitrary original minimizer uses [3, Lemma 2.2.5, Lemmas 2.4.2–2.4.3, and Proposition 3.1.9]. The statements below concern that minimizing disk and its actual trajectory, rather than merely an equal-cost representative of a relaxed problem.

Set

D∗=diag⁡(31/4,3−1/4),J=(0−110),R∗=12(1−311)=D∗eπJ/3D∗−1.D_*=\operatorname{diag}(3^{1/4},3^{-1/4}),\qquad J=\begin{pmatrix}0&-1\\1&0\end{pmatrix},\qquad R_*=\frac{1}{2}\begin{pmatrix}1&-3\\1&1\end{pmatrix}=D_*e^{\pi J/3}D_*^{-1}.

For W=(u,v)W=(u,v), put

Ω={(u,v):−1<u<1, v>0, u2+v2>1},S=u2+v2−1.(1)\Omega=\{(u,v):-1<u<1,\ v>0,\ u^2+v^2>1\},\qquad S=u^2+v^2-1. \tag*{(1)}

The three vertex fields and the frame velocity are

F0=(v,v21+u),F1=(−v(1−u2+v2)S,2uv2S),F2=(v,v2u−1),F_0=\left(v,\frac{v^2}{1+u}\right),\qquad F_1=\left(-\frac{v(1-u^2+v^2)}{S},\frac{2uv^2}{S}\right),\qquad F_2=\left(v,\frac{v^2}{u-1}\right),
X(W)=1v(u−u2−v21−u),A∗=(03/2−1/20).X(W)=\frac{1}{v}\begin{pmatrix}u&-u^2-v^2\\1&-u\end{pmatrix},\qquad A_*=\begin{pmatrix}0&3/2\\-1/2&0\end{pmatrix}.

The admissible controls are all measurable maps into the full triangle Δ={ρ∈R3:ρj≥0, ∑jρj=1}\Delta=\{\rho\in\mathbb{R}^3:\rho_j\geq0,\ \sum_j\rho_j=1\}. The equations and physical cost are

W′=∑j=02ρjFj(W),G′=GX(W),G(t)∈SL2(R),(2)W'=\sum_{j=0}^{2}\rho_jF_j(W),\qquad G'=GX(W),\qquad G(t)\in\mathrm{SL}_2(\mathbb{R}), \tag*{(2)}
ℓ(W)=tr⁡(A∗X(W))=3+u2+v22v,C=∫0Tℓ(W(t)) dt,∣D∣=3C.(3)\ell(W)=\operatorname{tr}(A_*X(W))=\frac{3+u^2+v^2}{2v},\qquad C=\int_0^T\ell(W(t))\,\mathrm{d}t,\qquad|D|=\sqrt{3}C. \tag*{(3)}

Here tt is physical time; the identity X2=−IX^2=-I fixes its scale. The six curves

G(t)qj,qj=D∗(cos⁡(jπ/3),sin⁡(jπ/3))t,0≤j≤5,G(t)q_j,\qquad q_j=D_*\left(\cos(j\pi/3),\sin(j\pi/3)\right)^t,\qquad0\le j\le5,

reconstruct the normalized boundary. The group and state endpoints are

G(0)=I,G(T)=R∗,W(T)=R∗−1⋅W(0),(4)G(0)=I,\qquad G(T)=R_*,\qquad W(T)=R_*^{-1}\cdot W(0), \tag*{(4)}

with the usual fractional linear action on u+ivu+iv. There is also a real winding condition: the path D∗−1G(t)D∗D_*^{-1}G(t)D_* is homotopic with endpoints fixed to eπJt/(3T)e^{\pi Jt/(3T)}. Thus its lifted rotation has increment π/3\pi/3, with no additional whole turn. Closing only WW, closing only a matrix trace, or imposing the angle merely modulo 2π2\pi would change the problem.

For clarity, the weights in (2.3) preserve the original measurable-control class. If μ\mu denotes the original barycentric control, then

(d0,d1,d2)=(1+uv,S2v,1−uv),ρj=μjdj∑kμkdk,μj=ρj/dj∑kρk/dk.(5)(d_0,d_1,d_2)=\left(\frac{1+u}{v},\frac{S}{2v},\frac{1-u}{v}\right),\qquad \rho_j=\frac{\mu_jd_j}{\sum_k\mu_kd_k},\qquad \mu_j=\frac{\rho_j/d_j}{\sum_k\rho_k/d_k}. \tag*{(5)}

All djd_j are positive on Ω\Omega, so these maps are measurable inverses and preserve the vertices. The half-plane coordinates of [3] are (u,v)/3(u,v)/\sqrt{3}; its control α\alpha corresponds to μ=(α2,α0,α1)\mu=(\alpha_2,\alpha_0,\alpha_1). The matrix conjugation and the commutator identity establishing this convention are given later in equation (A.1). No change of physical time is involved.

Compactness and admissible replacements

Theorem 2.1 (Geometric compactness). Every normalized original global minimizer has its state trajectory in the compact subset KK of Ω\Omega specified by the following six inequalities:

v≤15(1+u),v≤15(1−u),S≥2v/15,v≤93/2,v\le15(1+u),\qquad v\le15(1-u),\qquad S\ge2v/15,\qquad v\le9\sqrt{3}/2,
(u+1)2+v2≥8v93,(u−1)2+v2≥8v93.(6)(u+1)^2+v^2\ge\frac{8v}{9\sqrt{3}},\qquad(u-1)^2+v^2\ge\frac{8v}{9\sqrt{3}}. \tag*{(6)}

On this set, the rates a=v/(1+u)a=v/(1+u), b=v/(1−u)b=v/(1-u) and c=2v/Sc=2v/S obey

0<a,b,c≤15,a+b,a+c,b+c≤75037,99200≤v≤395.(7)0<a,b,c\le15,\qquad a+b,a+c,b+c\le\frac{750}{37},\qquad\frac{99}{200}\le v\le\frac{39}{5}. \tag*{(7)}

The compactness assertion is exactly [3, Definition 5.0.1 and Theorem 5.0.2], written in the present coordinates; the elementary consequences (2.8) are proved in Lemma A.1. These inequalities constrain the original minimizing trajectory. They are not additional restrictions on a local competitor: the admissible replacement problem remains the full control triangle in Ω\Omega.

References

No references were extracted for this paper.

Paper details

vlnc:W_dpfvw89n
Version
v1 · latest
Published
Fresh — added to the Hub within the last 30 days
Added
License
CC BY 4.0
Usage

views · 0

downloads · 0

A view counts once per browser per day, a download each time the PDF is requested.

  • Mathematics

ChatGPT dot, ChatGPT 6.1 Sol

View statement
Looking for related papers…
Contents