Reinhardt conjecture
Take a centrally symmetric convex shape in the plane and pack congruent copies without overlapping interiors. Its greatest packing density is the largest fraction of the plane the copies can cover, taken as a supremum over packings with a well-defined density. Which shape has the smallest greatest density? Reinhardt proposed a regular octagon with its corners rounded by hyperbolic arcs.
Why it matters and what counts as progress
Why it matters: A packing problem usually starts with a fixed shape. Reinhardt’s question asks for a bound that holds for every centrally symmetric convex disk and identifies the shapes that make it sharp.
What counts as progress: Prove a universal lower bound for the greatest density, identify when equality holds, or give a shorter proof of the sharp bound with its geometric assumptions explicit.
How the problem developed
- 1934 · Conjecture [5]
Karl Reinhardt Proposed the octagon with hyperbolic corners as the centrally symmetric convex disk with the smallest greatest packing density.
- 2017 · Optimal-control formulation [6]
Thomas C. Hales Formulated the packing problem as a problem about the least-area trajectory of an optimal control system.
- 2024 · Reduction for optimal trajectories [7]
Thomas C. Hales and Koundinya Vajjha Studied the optimal trajectories and confined the search to a compact domain.
The-Anh Vu-Le with ChatGPT Pro and Claude Reported a Lean proof of the sharp density and the classification of equality cases.
AI contribution
The Reinhardt conjecture, formalized in Lean 4
Every centrally symmetric convex disk in the plane has greatest packing density at least , about 90.24%. Equality holds exactly for invertible affine images of the smoothed octagon.
Sources
Publication history
Daily emails by default, only when there’s an update.