MathLabs

Kepler conjecture

Solved, 1998GeometryHilbert #18
Statement

In three-dimensional Euclidean space, no arrangement of equal, non-overlapping spheres has a density greater than π/18≈0.74048\pi/\sqrt{18} \approx 0.74048, the density of the face-centered cubic and hexagonal close packings — the familiar way grocers stack oranges or cannonballs.

Hales announced a proof in 1998 (with Samuel Ferguson) combining a classical reduction to finitely many local configurations with an exhaustive computer search — linear-programming bounds checked on roughly 5,000 cases. A panel of twelve referees reported in 2003 that they were "99% certain" the proof was correct but could not verify every computer calculation by hand, so the Annals of Mathematics published it in 2005 with that caveat noted. The Flyspeck project, led by Hales, then built a complete formal proof checked line by line by the HOL Light and Isabelle proof assistants, removing the remaining doubt; Flyspeck was announced complete in 2014, and the formal proof was published in 2017.

  1. Flyspeck: a formal proof of the Kepler conjecture in HOL Light and Isabelle (2015)Thomas Hales, Mark Adams, Gertrud Bauer, Dat Tat Dang, John Harrison, Truong Le Hoang, Cezary Kaliszyk, Victor Magron, Sean McLaughlin, Thang Tat Nguyen, Truong Quang Nguyen, Tobias Nipkow, Steven Obua, Joseph Pleso, Jason Rute, Alexey Solovyev, An Hoai Thi Ta, Trung Nam Tran, Diep Thi Trieu, Josef Urban, Ky Khac Vu, Roland Zumkeller, 2015Difficulty 5/5ResearchCondensed summaryComputer-assisted

References

  1. Thomas C. Hales (2005). A proof of the Kepler conjecture · DOI:10.4007/annals.2005.162.1065
  2. Thomas Hales, Mark Adams, Gertrud Bauer, et al. (2017). A formal proof of the Kepler conjecture · DOI:10.1017/fmp.2017.1
  3. George G. Szpiro (2003). Kepler's Conjecture: How Some of the Greatest Minds in History Helped Solve One of the Oldest Math Problems in the World