A Machine-Checked Proof of the Odd Order Theorem
2013; Springer Science+Business Media; Linguagem: Inglês
10.1007/978-3-642-39634-2_14
ISSN1611-3349
AutoresGeorges 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 Paşca, Laurence Rideau, Alexey Solovyev, E. ̃Tassi, Laurent Théry,
Tópico(s)Mathematics, Computing, and Information Processing
ResumoThis 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.
Referência(s)