Thomas Callister Hales

From Wikipedia, the free encyclopedia
  (Redirected from Thomas C. Hales)
Jump to: navigation, search
Thomas Hales
Halescropped.jpg
Born (1958-06-04) June 4, 1958 (age 56)
San Antonio, Texas
Residence United States
Nationality American
Fields Mathematics
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)

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 1998 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 pyramid shape. Hales also proved the honeycomb conjecture.

Education[edit]

He received his Ph.D. from Princeton University in 1986.

Career in mathematics[edit]

Hales, formerly at the University of Michigan, and now University of Pittsburgh Mellon Professor of mathematics, advocates the formalization of mathematics to ensure rigor in an era where proofs are becoming increasingly complex and computers are becoming necessary to perform verification. Hales's current project, called Flyspeck, seeks to formalize his proof of the Kepler conjecture in the computer theorem prover HOL Light. [1] [2] [3]

In 2012 he became a fellow of the American Mathematical Society.[4]

Notes[edit]

  1. ^ Hales's page at the University of Pittsburgh Math Department
  2. ^ Flyspeck Project
  3. ^ Hales solves oldest problem in discrete geometry The University Record (University of Michigan), September 16, 1998
  4. ^ List of Fellows of the American Mathematical Society, retrieved 2013-01-19.

External links[edit]