The Rooster and the Butterflies

Assia Mahboubi (1, 2)

1 MSR - INRIA - Microsoft Research - Inria Joint Centre
2 SPECFUN - Symbolic Special Functions : Fast and Certified

This paper describes a machine-checked proof of the Jordan- Hölder theorem for finite groups. This purpose of this description is to discuss the representation of the elementary concepts of finite group the- ory inside type theory. The design choices underlying these representa- tions were crucial to the successful formalization of a complete proof of the Odd Order Theorem with the Coq system.

Domaines: Logique en informatique [cs.LO]

Assia Mahboubi. The Rooster and the Butterflies. CICM 2013 - Conferences on Intelligent Computer Mathematics - 2013, Jul 2013, Bath, United Kingdom. pp.1-18, ⟨10.1007/978-3-642-39320-4_1⟩. ⟨hal-00825074v1⟩