A Modular Formalisation of Finite Group Theory

Georges Gonthier (1) , Assia Mahboubi (2) , Laurence Rideau (3) , Enrico Tassi (4) , Laurent Théry (3)

1 Programming Principles and Tools [Cambridge]
2 MSR - INRIA - Microsoft Research - Inria Joint Centre
3 MARELLE - Mathematical, Reasoning and Software
4 DISI - Department of Computer Science and Engineering [Bologna]

In this paper, we present a formalisation of elementary group theory done in Coq. This work is the first milestone of a long-term effort to formalise Feit-Thompson theorem. As our further developments will heavily rely on this initial base, we took special care to articulate it in the most compositional way.

Mots clés: finite groups; proof assistants; formalisation of mathematics

Domaines: Logique en informatique [cs.LO]; Logiciel mathématique [cs.MS]; Théorie des groupes [math.GR]

Georges Gonthier, Assia Mahboubi, Laurence Rideau, Enrico Tassi, Laurent Théry. A Modular Formalisation of Finite Group Theory. [Research Report] RR-6156, INRIA. 2007, pp.17. ⟨inria-00139131v2⟩