Thomas Callister Hales
Thomas Callister Hales (born June 4, 1958) is an American mathematician working in the areas of representation theory, discrete geometry, and formal verification. In representation theory he is known for his work on the Langlands program and the proof of the fundamental lemma over the group Sp(4) (many of his ideas were incorporated into the final proof, due to Ngô Bảo Châu). In discrete geometry, he settled the Kepler conjecture on the density of sphere packings and the honeycomb conjecture. In 2014, he announced the completion of the Flyspeck Project, which formally verified the correctness of his proof of the Kepler conjecture.
|Alma mater||Princeton University|
|Known for||Proving Kepler conjecture|
|Institutions||University of Pittsburgh |
University of Michigan
|Doctoral advisor||Robert Langlands|
|Doctoral students||Julia Gordon|
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.
In 2017, he initiated the Formal Abstracts project which aims to provide formalised statements of the main results of each mathematical research paper in the language of an interactive theorem prover. The goal of this project is to benefit from the increased precision and interoperability that computer formalisation provides while circumventing the effort that a full-scale formalisation of all published proofs currently entails. In the long term, the project hopes to build a corpus of mathematical facts which would allow for the application of machine learning techniques in interactive and automated theorem proving.
Awards and membershipsEdit
- 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
- Hales, Thomas C. (2001). "The Honeycomb Conjecture". Discrete and Computational Geometry. 25 (1): 1–22. arXiv:math/9906042. doi:10.1007/s004540010071. MR 1797293.
- Hales, Thomas C. (2005). "A proof of the Kepler conjecture". Annals of Mathematics. 162 (3): 1065–1185. arXiv:math/9811078. doi:10.4007/annals.2005.162.1065.
- 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, arXiv:math/9811078, 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
- Hales, Thomas C.; Adams, Mark; Bauer, Gertrud; Dat Tat Dang; Harrison, John; Truong Le Hoang; Kaliszyk, Cezary; Magron, Victor; McLaughlin, Sean; Thang Tat Nguyen; Truong Quang Nguyen; Nipkow, Tobias; Obua, Steven; Pleso, Joseph; Rute, Jason; Solovyev, Alexey; An Hoai Thi Ta; Trung Nam Tran; Diep Thi Trieu; Urban, Josef; Ky Khac Vu; Zumkeller, Roland (2015). "A formal proof of the Kepler conjecture". arXiv:1501.02155 [math.MG].
- Flyspeck Project
- Hales solves oldest problem in discrete geometry The University Record (University of Michigan), September 16, 1998
- Aron, Jacob (August 12, 2014). "Proof confirmed of 400-year-old fruit-stacking problem". New Scientist. Retrieved May 10, 2017.
- Project website https://formalabstracts.github.io/, retrieved 2020-01-10.
- 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. JSTOR 27642361.
- List of Fellows of the American Mathematical Society, retrieved 2013-01-19.