Thomas Callister Hales
June 4, 1958 |
San Antonio, Texas
|Institutions||University of Pittsburgh
University of Michigan
|Alma mater||Princeton University|
|Doctoral advisor||Robert Langlands|
|Known for||Proving Kepler conjecture|
|Notable awards||Chauvenet Prize(2003)
David P. Robbins Prize(2007)
Thomas Callister Hales (born June 4, 1958) is an American mathematician working on the Langlands program. He is known in the area for having worked on the fundamental lemma, and proving a special case of it over the group Sp(4). Many of his ideas were incorporated into the final proof, due to Ngô Bảo Châu. He is also known for his proof of the Kepler conjecture on sphere packing.
In 1998, Hales submitted his paper on the computer-aided proof of the Kepler conjecture; a centuries-old problem in discrete geometry which states that the most space-efficient way to pack spheres is in a tetrahedron shape. He was aided by graduate student Samuel Ferguson. In 1999, Hales proved the honeycomb conjecture, he also stated that the conjecture may have been present in the minds of mathematicians before Marcus Terentius Varro.
After 2002, Hales became the University of Pittsburgh's Mellon Professor of mathematics. In 2003, Hales started work on Flyspeck to vindicate his proof of the Kepler conjecture. His proof relied on computer calculation to verify conjectures. The project used two proof assistants; HOL Light and Isabelle. Annals of Mathematics accepted the proof in 2005; but was only 99% sure of the proof. In August 2014, the Flyspeck team's software finally verified the proof to be correct.
Awards and memberships
- Hales, Thomas C. (1994), "The status of the Kepler conjecture", The Mathematical Intelligencer, 16 (3): 47–58, doi:10.1007/BF03024356, ISSN 0343-6993, MR 1281754
- The Honeycomb Conjecture,Discrete and Computational Geometry pages 1-22 for volume = 25 Issue 1 (2001)
- A proof of the Kepler conjecture, Annals of Mathematics pages 1065-1185 from Volume 162 Issue 3 (2005)
- Hales, Thomas C. (2006), "Historical overview of the Kepler conjecture", Discrete & Computational Geometry, 36 (1): 5–20, doi:10.1007/s00454-005-1210-2, ISSN 0179-5376, MR 2229657
- Hales, Thomas C.; Ferguson, Samuel P. (2006), "A formulation of the Kepler conjecture", Discrete & Computational Geometry, 36 (1): 21–69, doi:10.1007/s00454-005-1211-1, ISSN 0179-5376, MR 2229658
- Hales, Thomas C.; Ferguson, Samuel P. (2011), The Kepler Conjecture: The Hales-Ferguson Proof, New York: Springer, ISBN 978-1-4614-1128-4
- A formal proof of the Kepler conjecture, (2015) by 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
- Flyspeck Project
- Hales solves oldest problem in discrete geometry The University Record (University of Michigan), September 16, 1998
- Hales, Thomas C. (2000). "Cannonballs and Honeycombs". Notices of the AMS. 47 (4): 440–449.
- Hales, Thomas C. (2007). "The Jordan Curve Theorem, Formally and Informally". Amer. Math. Monthly. 114: 882–894.
- List of Fellows of the American Mathematical Society, retrieved 2013-01-19.
- Hales, Thomas C. (2001). "The Honeycomb Conjecture". Discrete and Computational Geometry. 25 (1): 1–22. arXiv: . doi:10.1007/s004540010071. MR 1797293.