A Machine-Checked Proof of the Odd Order Theorem

This paper reports on a six-year collaborative effort that culminated in a complete formalization of a proof of the Feit-Thompson Odd Order Theorem in the Coq proof assistant. The formalized proof is constructive, and relies on nothing but the axioms and rules of the foundational framework implemented by Coq. To support the formalization, we developed a comprehensive set of reusable libraries of formalized mathematics, including results in finite group theory, linear algebra, Galois theory, and the theories of the real and complex algebraic numbers.

[1]  A. Tarski.  A Decision Method for Elementary Algebra and Geometry , 2023 .

[2]  B. Huppert,et al.  Finite Groups II , 1982 .

[3]  P. M. Neumann.  FINITE GROUPS II, III (Grundlehren der mathematischen Wissenschaften, 242, 243) , 1985 .

[4]  Wim Ruitenburg,et al.  A Course in Constructive Algebra , 1987 .

[5]  Thierry Coquand,et al.  The Calculus of Constructions , 1988, Inf. Comput..

[6]  Thierry Coquand,et al.  Inductively defined types , 1988, Conference on Computer Logic.

[7]  J. C. McConnell.  GALOIS THEORY (Universitext) , 1991 .

[8]  G. Glauberman,et al.  Local Analysis for the Odd Order Theorem: Maximal Subgroups , 1995 .

[9]  Michael Hedberg,et al.  A coherence theorem for Martin-Löf's type theory , 1998, Journal of Functional Programming.

[10]  P. M. Neumann,et al.  The collected papers of William Burnside , 1999 .

[11]  M. Aschbacher.  Finite Group Theory: Index , 2000 .

[12]  T. Peterfalvi.  Character theory for the odd order theorem , 2000 .

[13]  M. Thesis.  Proof as Method: A New Case for Proof in Mathematics Curricula , 2003 .

[14]  Ralf Hinze,et al.  Fun with phantom types , 2003 .

[15]  Jessi Berkelhammer.  From Reducibility to Extensionality The two editions of Principia Mathematica , 2003 .

[16]  Harm Derksen.  The Fundamental Theorem of Algebra and Linear Algebra , 2003, Am. Math. Mon..

[17]  H. Kurzweil,et al.  The theory of finite groups : an introduction , 2004 .

[18]  Pierre Castéran,et al.  Interactive Theorem Proving and Program Development , 2004, Texts in Theoretical Computer Science An EATCS Series.

[19]  Aaron Hertz May.  A Constructive Version of the Hilbert Basis Theorem , 2004 .

[20]  D. White.  Axiomatics, methodology, and Dedekind’s theory of ideals , 2004 .

[21]  J. Avigad,et al.  Aspects of Ergodic Theory in Subsystems of , 2004 .

[22]  Xavier Leroy,et al.  Formal certification of a compiler back-end or: programming a compiler with a proof assistant , 2006, POPL '06.

[23]  Enrico Tassi,et al.  A Modular Formalisation of Finite Group Theory , 2007, TPHOLs.

[24]  David Aspinall,et al.  Formalising Java's Data Race Free Guarantee , 2007, TPHOLs.

[25]  Ioana Pasca,et al.  Canonical Big Operators , 2008, TPHOLs.

[26]  Enrico Tassi,et al.  A Small Scale Reflection Extension for the Coq system , 2008 .

[27]  Georges Gonthier,et al.  Formal Proof—The Four- Color Theorem , 2008 .

[28]  T. Hales.  Formal Proof , 2008 .

[29]  The Review of Symbolic Logic , 2008, Rev. Symb. Log..

[30]  H. Towsner.  Some results in logic and ergodic theory , 2008 .

[31]  Jeremy Avigad,et al.  A Language for Mathematical Knowledge Management , 2008 .

[32]  Michael Norrish,et al.  seL4: formal verification of an OS kernel , 2009, SOSP '09.

[33]  David Corwin.  Galois Theory , 2009 .

[34]  Erwin Schrödinger International,et al.  Supported by the Austrian Federal Ministry of Education, Science and Culture , 1689 .

[35]  John Harrison,et al.  Without Loss of Generality , 2009, TPHOLs.

[36]  Assia Mahboubi,et al.  Packaging Mathematical Structures , 2009, TPHOLs.

[37]  A. Mahboubi,et al.  A formal quantier elimination for algebraically closed elds , 2010 .

[38]  D. Passman,et al.  Character Theory of Finite Groups , 2010 .

[39]  Assia Mahboubi,et al.  An introduction to small scale reflection in Coq , 2010, J. Formaliz. Reason..

[40]  Assia Mahboubi,et al.  A formal quantifier elimination for algebraically closed fields , 2010, AISC'10/MKM'10/Calculemus'10.

[41]  Yves Bertot,et al.  Interactive Theorem Proving and Program Development: Coq'Art The Calculus of Inductive Constructions , 2010 .

[42]  Georges Gonthier.  Point-Free, Set-Free Concrete Linear Algebra , 2011, ITP.

[43]  Benjamin Grégoire,et al.  A Modular Integration of SAT/SMT Solvers to Coq through Proof Witnesses , 2011, CPP.

[44]  Derek Dreyer,et al.  How to make ad hoc proof automation less ad hoc , 2011, ICFP '11.

[45]  Russell O'Connor,et al.  Classical mathematics for a constructive world , 2010, Mathematical Structures in Computer Science.

[46]  Jeremy Avigad,et al.  Type inference in mathematics , 2011, Bull. EATCS.

[47]  Cyril Cohen,et al.  Construction of Real Algebraic Numbers in Coq , 2012, ITP.

[48]  W. Feit,et al.  SOLVABILITY OF GROUPS OF ODD ORDER , 2012 .

[49]  Brian Campbell,et al.  An Executable Semantics for CompCert C , 2012, CPP.

[50]  Stephen M. Watt,et al.  Intelligent Computer Mathematics , 2014, Lecture Notes in Computer Science.

[51]  Jeremy Avigad,et al.  Formally verified mathematics , 2014, Commun. ACM.