The Kepler conjecture the Hales-Ferguson proof by Thomas Hales, Samuel Ferguson ; including a special issue of Discrete & computational geometry

The Kepler conjecture, one of geometry's oldest unsolved problems, was formulated in 1611 by Johannes Kepler and mentioned by Hilbert in his famous 1900 problem list. The Kepler conjecture states that the densest packing of three-dimensional Euclidean space by equal spheres is attained by the “cannonball" packing. In a landmark result, this was proved by Thomas C. Hales and Samuel P. Ferguson, using an analytic argument completed with extensive use of computers. This book centers around six papers, presenting the detailed proof of the Kepler conjecture given by Hales and Ferguson, published in 2006 in a special issue of __Discrete & Computational Geometry__. Further supporting material is also presented: a follow-up paper of Hales et al (2010) revising the proof, and describing progress towards a formal proof of the Kepler conjecture. For historical reasons, this book also includes two early papers of Hales that indicate his original approach to the conjecture. The editor's two introductory chapters situate the conjecture in a broader historical and mathematical context. These chapters provide a valuable perspective and are a key feature of this work. **Thomas C. Hales**, Mellon Professor of Mathematics at the University of Pittsburgh, began his efforts to solve the Kepler conjecture before 1992. He is a pioneer in the use of computer proof techniques, and he continues work on a formal proof of the Kepler conjecture as the aim of the Flyspeck Project (F, P and K standing for Formal Proof of Kepler). **Samuel P. Ferguson** completed his doctorate in 1997 under the direction of Hales at the University of Michigan. In 1995, Ferguson began to work with Hales and made significant contributions to the proof of the Kepler conjecture. His doctoral work established one crucial case of the proof, which appeared as a singly authored paper in the detailed proof. **Jeffrey C. Lagarias**, Professor of Mathematics at the University of Michigan, Ann Arbor, was a co-guest editor, with Gábor Fejes-Tóth, of the special issue of __Discrete & Computational Geometry__ that originally published the proof. The Kepler Conjecture, One Of Geometry's Oldest Unsolved Problems, Was Formulated In 1611 By Johannes Kepler And Mentioned By Hilbert In His Famous 1900 Problem List. The Kepler Conjecture States That The Densest Packing Of Three-dimensional Euclidean Space By Equal Spheres Is Attained By The “cannonball Packing. In A Landmark Result, This Was Proved By Thomas C. Hales And Samuel P. Ferguson, Using An Analytic Argument Completed With Extensive Use Of Computers. This Book Centers Around Six Papers, Presenting The Detailed Proof Of The Kepler Conjecture Given By Hales And Ferguson, Published In 2006 In A Special Issue Of Discrete & Computational Geometry. Further Supporting Material Is Also Presented: A Follow-up Paper Of Hales Et Al (2010) Revising The Proof, And Describing Progress Towards A Formal Proof Of The Kepler Conjecture. For Historical Reasons, This Book Also Includes Two Early Papers Of Hales That Indicate His Original Approach To The Conjecture.^ The Editor's Two Introductory Chapters Situate The Conjecture In A Broader Historical And Mathematical Context. These Chapters Provide A Valuable Perspective And Are A Key Feature Of This Work. Thomas C. Hales, Mellon Professor Of Mathematics At The University Of Pittsburgh, Began His Efforts To Solve The Kepler Conjecture Before 1992. He Is A Pioneer In The Use Of Computer Proof Techniques, And He Continues Work On A Formal Proof Of The Kepler Conjecture As The Aim Of The Flyspeck Project (f, P And K Standing For Formal Proof Of Kepler). Samuel P. Ferguson Completed His Doctorate In 1997 Under The Direction Of Hales At The University Of Michigan. In 1995, Ferguson Began To Work With Hales And Made Significant Contributions To The Proof Of The Kepler Conjecture. His Doctoral Work Established One Crucial Case Of The Proof, Which Appeared As A Singly Authored Paper In The Detailed Proof. Jeffrey C.^ Lagarias, Professor Of Mathematics At The University Of Michigan, Ann Arbor, Was A Co-guest Editor, With Gábor Fejes-tóth, Of The Special Issue Of Discrete & Computational Geometry That Originally Published The Proof. Pt. 1. Introduction And Survey -- Pt. 2. Proof Of The Kepler Conjecture -- Pt. 3. A Revision To The Proof Of The Kepler Conjecture -- Pt. 4. Initial Papers Of The Hales Program. Jeffrey C. Lagarias, Editor. Including A Special Issue Of Discrete & Computational Geometry.--t.p. Includes Bibliographical References And Indexes. The Kepler conjecture, one of geometry's oldest unsolved problems, was formulated in 1611 by Johannes Kepler and mentioned by Hilbert in his famous 1900 problem list. The Kepler conjecture states that the densest packing of three-dimensional Euclidean space by equal spheres is attained by the "(Bcannonball" packing. In a landmark result, this was proved by Thomas C. Hales and Samuel P. Ferguson, using an analytic argument completed with extensive use of computers. This book centers around six papers, presenting the detailed proof of the Kepler conjecture given by Hales and Ferguson, published in 2006 in a special issue of Discrete & Computational Geometry. Further supporting material is also presented: a follow-up paper of Hales et al (2010) revising the proof, and describing progress towards a formal proof of the Kepler conjecture. For historical reasons, this book also includes two early papers of Hales that indicate his original approach to the conjecture. The editor's two introductory chapters situate the conjecture in a broader historical and mathematical context. These chapters provide a valuable perspective and are a key feature of this work. Thomas C. Hales, Mellon Professor of Mathematics at the University of Pittsburgh, began his efforts to solve the Kepler conjecture before 1992. He is a pioneer in the use of computer proof techniques, and he continues work on a formal proof of the Kepler conjecture as the aim of the Flyspeck Project (F, P and K standing for Formal Proof of Kepler). Samuel P. Ferguson completed his doctorate in 1997 under the direction of Hales at the University of Michigan. In 1995, Ferguson began to work with Hales and made significant contributions to the proof of the Kepler conjecture. His doctoral work established one crucial case of the proof, which appeared as a singly authored paper in the detailed proof. Jeffrey C. Lagarias, Professor of Mathematics at the University of Michigan, Ann Arbor, was a co-guest editor, with Gábor Fejes-Tóth, of the special issue of Discrete & Computational Geometry that originally published the proof Front Matter....Pages i-xiv Front Matter....Pages 1-2 The Kepler Conjecture and Its Proof....Pages 3-26 Bounds for Local Density of Sphere Packings and the Kepler Conjecture....Pages 27-57 Front Matter....Pages 59-64 Historical Overview of the Kepler Conjecture....Pages 65-82 A Formulation of the Kepler Conjecture....Pages 83-133 Sphere Packings, III. Extremal Cases....Pages 135-176 Sphere Packings, IV. Detailed Bounds....Pages 177-234 Sphere Packings, V. Pentahedral Prisms....Pages 235-274 Sphere Packings, VI. Tame Graphs and Linear Programs....Pages 275-337 Front Matter....Pages 339-340 A Revision of the Proof of the Kepler Conjecture....Pages 341-376 Front Matter....Pages 377-378 Sphere Packings, I....Pages 379-431 Sphere Packings, II....Pages 433-449 Errata....Pages E1-E4 Back Matter....Pages 451-456