A Machine-Checked Proof of the Odd Order Theorem [chapter]

Georges Gonthier, Andrea Asperti, Jeremy Avigad, Yves Bertot, Cyril Cohen, François Garillot, Stéphane Le Roux, Assia Mahboubi, Russell O'Connor, Sidi Ould Biha, Ioana Pasca, Laurence Rideau (+3 others)
2013 Lecture Notes in Computer Science  
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
more » ... the theories of the real and complex algebraic numbers.
doi:10.1007/978-3-642-39634-2_14 fatcat:43zakbhshbftjfdptlw2fzyskm