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.
A Machine-Checked Proof of the Odd Order Theorem / Georges Gonthier; Andrea Asperti; Jeremy Avigad; Yves Bertot; Cyril Cohen; François Garillot; Stéphane Roux; Assia Mahboubi; Russell O’Connor; Sidi Ould Biha; Ioana Pasca; Laurence Rideau; Alexey Solovyev; Enrico Tassi; Laurent Théry. - STAMPA. - 7998:(2013), pp. 163-179. (Intervento presentato al convegno Interactive Theorem Proving - 4th International Conference, ITP 2013 tenutosi a Rennes, France nel July 22-26, 2013) [10.1007/978-3-642-39634-2_14].
A Machine-Checked Proof of the Odd Order Theorem
ASPERTI, ANDREA;
2013
Abstract
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.I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.
