The Kepler conjecture asks how much of three-dimensional Euclidean space can be filled by congruent solid balls whose interiors do not overlap. It is a question about all arrangements, including irregular arrangements with no repeating cell. A lattice calculation can exhibit an efficient packing but cannot bound every packing. The result is a central extremal theorem of discrete geometry and a substantial example of a proof combining geometry with finite computation. Hales published a proof in 2005; the later Flyspeck project verified a revised proof in HOL Light and Isabelle. This mission concerns a Lean 4 formalization of that verified result. Its authority is Hales et al., A Formal Proof of the Kepler Conjecture (2017), especially sections 3–4.
A unit-sphere packing is a set of centers such that whenever are distinct. The occupied region is the union of the open balls . Tangency is allowed. The ambient metric is the Euclidean metric, represented by EuclideanSpace ℝ (Fin 3).
For a real radius , write , where the observation ball is open. Uniform separation makes this intersection finite. The definition of a packing does not assume that the whole set is finite, periodic, saturated, or contains the origin. A saturated packing is one to which no further center can be added while preserving separation. Saturation occurs in an intermediate theorem; an extension theorem must remove it before the final conclusion. These conventions follow the formal source statement and the packing definitions in the accompanying repository.
The source-faithful goal is
The constant may depend on the packing and must work for every indicated radius. This is the finite-container statement displayed in Hales et al., section 3, published PDF page 6. Its quadratic boundary term is part of the target.
Two additional statements record the conventional density consequence. Define the upper packing density by
The optional targets are for every packing and . They are separate from the core theorem. The analytic count-to-volume bridge and the explicit face-centered cubic witness are stated independently. The density need not have an actual limit. This distinction also makes comparison with the current Lean-Eval statement precise.
The finite-container theorem bounds every arrangement at every radius at least one, up to its stated boundary error. The density corollary identifies the optimal asymptotic occupied fraction once a close-packing witness is supplied. It makes no uniqueness assertion: an upper bound and an attaining example do not classify all optimizers. The normalizing unit-ball volume is ; it cancels against the same factor in the observation-ball volume when comparing to occupied density. The Blueprint, section 1.2, describes the close packings.
Flyspeck already provides a machine-checked proof in its original systems. The work here is to express and prove the same mathematics with Lean's kernel and Mathlib, and to develop reusable geometric, combinatorial, and certificate interfaces. Existing partial Lean 4 work is acknowledged; no priority claim is made. The proposal supplies statements and conditional assembly, not a completed Lean proof.
The revised proof does not reduce to optimizing a lattice cell. Its local configurations have varying combinatorial types, and the necessary nonlinear estimates and linear relaxations must apply to all their geometric realizations. The primary account, sections 4–9, distinguishes the geometric argument, nonlinear inequalities, tame-graph classification, and linear-program verification. The public milestones preserve these distinctions and use the revised annulus estimate, rather than importing the original decomposition-star architecture unchanged.
Seven milestones cover packing foundations; the fixed nonlinear catalog; the global geometric reduction; extraction and tameness of a local counterexample; archive classification; exhaustive geometric LP certificates; and the local annulus bound. The last states that every finite packing in satisfies . This is section 4.2, equation (1). A compiled conditional theorem composes these interfaces into the exact final goal.
The nonlinear catalog contains actual real formulas from the six selectors in the pinned final Flyspeck statement: 580 family occurrences indexing 539 distinct source-ID records. These 539 source IDs have 498 distinct normalized syntactic bodies; repeated formulas are retained, and no claim of semantic inequivalence is made. All 539 domains have separately kernel-checked witnesses; this does not prove the inequalities. The graph archive is fixed independently of tameness. The reported 18,762 matches the AFP 2013-12-11 archive: 9 triangular, 1,105 quadrilateral, 15,991 pentagonal and 1,657 hexagonal cases. The AFP entry records a change of tameness constants and archive on 3 July 2014. The final archive has 19,715 rows: 9 + 1,253 + 16,080 + 2,373; the pinned make_archive.hl explicitly records this July-2014 count. Exact permutation comparison shows all 18,762 older classes retained and 953 added, with no duplicate or mirror-equivalent rows within either archive. The mission uses the final accompanying archive, whose source SHA-256 is 703ea865a124aa69f0ee12d94df7065bbbf5701a3085776e24632d14493474db. These are candidate graphs: the classification is coverage, not a claim that every stored row is tame or geometrically realizable (primary §7.2).
The final LP family is pinned to the completed Flyspeck revision 1ce0353008eba83d3c76ae9a25c3c242e4802d53: 19,715 graph-indexed trees and exactly 43,078 leaves from all 39 final binary containers. Every branch, face refinement, rounded row template and selected row index is concrete Lean data. The 42,889 objective-bound leaves include the source score-lower-bound row; 189 leaves are direct infeasibility cases. M6 requires complete decoding, local feasibility at the fixed geometric evaluator, and a checked rational certificate for every structural leaf, including unreachable leaves. Solvers cannot replace the source family by a freely chosen LP. See the completed source verifier and primary §9.
The fixed LP selector table is split into forty consecutive data definition files. The archive and graph case trees each occupy two data files, with separate reusable interfaces. Every definition file is below 900,000 UTF-8 bytes, within the platform's observed 1,048,576-byte scanner limit. Ordered concatenation preserves all 19,715 archive records, 19,715 graph trees and 43,078 LP leaves; this packaging adds no mathematical assumption or milestone.
External search may generate data. Coverage, real-expression bounds, exhaustive branching, and rational infeasibility must be justified by Lean theorems. Interval/Taylor certificates have separate encoding, acceptance, and soundness obligations; exact rational LP soundness and the conditional assembly are already checked infrastructure. Floating-point optimization, source hashes, and unchecked native computation are not proofs. All statements target Lean 4.30.0 and Mathlib c5ea00351c28e24afc9f0f84379aa41082b1188f.
namespace KeplerMission
theorem kepler_finite_container : ∀ V : Set Space, IsPacking V → ∃ c : ℝ, ∀ r : ℝ, 1 ≤ r →
(centerCount V 0 r : ℝ) ≤ Real.pi * r ^ 3 / Real.sqrt 18 + c * r ^ 2 := by sorry
end KeplerMissionFor every unit-sphere packing V in Euclidean three-space, there exists a real c such that, for every real r≥1, the number of centers in the open ball B(0,r) is at most πr³/√18+cr². Distinct centers are separated by at least 2. The constant may depend on V but not on r. No finiteness, periodicity, saturation, origin membership, density limit or uniqueness assumption appears. This is the displayed formal source theorem.
Source. Hales et al., A Formal Proof of the Kepler Conjecture (2017), https://doi.org/10.1017/fmp.2017.1, §3 p.6, exact HOL Light display; general/the_main_statement.hl:the_kepler_conjecture.
Formalization note. Direct source theorem.
No submissions yet on this mission's goal. Log in and be the first to prove it.