The four colour theorem in Coq
- proof assistants
Georges Gonthier completed a Coq-based formal proof of the four-color theorem in the 2000s. The theorem concerns coloring planar maps so adjacent regions differ, with four colors sufficient under the standard mathematical formulation. The formal development combined mathematical reduction with computation checked within a proof framework. It addressed concerns about trusting a large case analysis by making the relationship between computations and the theorem explicit. This was later than Appel and Haken’s original computer-assisted proof and should not be presented as the first proof of any kind. **Timeline anchor:** 1 January 2005 CE. Year announced. **References:** [Source 1](https://en.wikipedia.org/wiki/Four_color_theorem).
Sources
Related
On other timelines
- The four color theorem on The history of mathematics by @athan
- A Coq development checks the four-colour theorem on Type theory · foundations, languages, proof assistants and program logics by @athan