What was already known
Reinhardt proposed the smoothed octagon in 1934. Hales recast the problem in optimal control. Hales and Vajjha reduced the search to trajectories with specified geometric and control constraints.
AI involvement
The-Anh Vu-Le chose the problem and directed the project. The repository credits ChatGPT Pro with drafting the proof and Claude Opus 5.5 with producing the Lean proof. The development uses Hales and Vajjha’s geometric and control-theoretic work.
- Vu-Le’s proof and attributionAI attribution and proof provenance
Importance
The result gives the sharp universal packing density and classifies all minimisers. The proof rules out other switching patterns in Hales’s control problem.
Technical verification
The pinned challenge states the density of the smoothed octagon, the universal lower bound and both directions of the equality case. The project reports that Lean checked all three statements using its standard axioms. Palomar’s preflight verification job passed on the submitted commit.
Formal checking
The pinned challenge states the density of the smoothed octagon, the universal lower bound and both directions of the equality case. The project reports that Lean checked all three statements using its standard axioms. Palomar’s preflight verification job passed on the submitted commit.
- Checker
- Lean 4 kernel through Palomar preflight
- Scope
- 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.
- Basis
- Reported by the linked checker
- Lean statement of the bound and equality case
- Palomar preflight verificationChecked statements and verification scope
- Palomar checking record
Human understanding
Vu-Le reports that no person has reviewed the proof. The repository credits Claude with the accompanying exposition.
Correction and publication history
New curated result with documented central AI work and a scoped checking assessment.
Read this published revision