The Feit–Thompson theorem in Coq
- proof assistants
Georges Gonthier and a large team completed a Coq formalization of the Feit–Thompson odd-order theorem in 2012. The theorem states that every finite group of odd order is solvable, a major result in finite-group theory. Formalization required substantial algebraic libraries and careful reconstruction of arguments, not merely loading the original paper into a checker. It demonstrated that proof-assistant methods could handle a deep, extended mathematical development. The original theorem and its later formal verification are distinct achievements with different dates and contributors. **Timeline anchor:** 1 September 2012 CE. Announced September 2012. **References:** [Source 1](https://en.wikipedia.org/wiki/Feit–Thompson_theorem).
Sources
Related
On other timelines
- The odd-order theorem formalization is published on Type theory · foundations, languages, proof assistants and program logics by @athan