Abstract
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 the 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.
This work was supported by the Microsoft Research - Inria Joint Center.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Arthan, R.: Some group theory, available at http://www.lemma-one.com/ProofPower/examples/wrk068.pdf
Avigad, J., Donnelly, K., Gray, D., Raff, P.: A Formally Verified Proof of the Prime Number Theorem. ACM Transactions on Computational Logic (to appear)
Bailey, A.: Representing algebra in LEGO. Master’s thesis, University of Edinburgh (1993)
Barthe, G., Capretta, V., Pons, O.: Setoids in type theory. Journal of Functional Programming 13(2), 261–293 (2003)
Bender, H., Glauberman, G.: Local analysis for the Odd Order Theorem. London Mathematical Society Lecture Note Series, vol. 188. Cambridge University Press, Cambridge (1994)
Constantine, G.M.: Group Theory, available at http://www.pitt.edu/~gmc/algsyl.html
Feit, W., Thompson, J.G.: Solvability of groups of odd order. Pacific Journal of Mathematics 13(3), 775–1029 (1963)
Geuvers, H., Wiedijk, F., Zwanenburg, J.: A Constructive Proof of the Fundamental Theorem of Algebra without Using the Rationals. In: Callaghan, P., Luo, Z., McKinna, J., Pollack, R. (eds.) TYPES 2000. LNCS, vol. 2277, pp. 96–111. Springer, Heidelberg (2002)
Gonthier, G.: A computer-checked proof of the four-colour theorem, available at http://research.microsoft.com/~gonthier/4colproof.pdf
Gonthier, G.: Notations of the four colour theorem proof, available at http://research.microsoft.com/~gonthier/4colnotations.pdf
Gordon, M.J.C., Melham, T.F.: Introduction to HOL: a theorem proving environment for higher-order logic. Cambridge University Press, Cambridge (1993)
Gunter, E.: Doing Algebra in Simple Type Theory. Technical Report MS-CIS-89-38, University of Pennsylvania (1989)
Kammüller, F., Paulson, L.C.: A Formal Proof of Sylow’s Theorem. Journal of Automating Reasoning 23(3-4), 235–264 (1999)
The Coq development team: The Coq proof assistant reference manual. LogiCal Project, Version 8.1 (2007)
The Mizar Home Page, http://www.mizar.org/
Paulin-Mohring, C.: Définitions Inductives en Théorie des Types d’Ordre Supérieur. Habilitation à diriger les recherches, Université Claude Bernard Lyon I (December 1996)
Paulson, L.C. (ed.): Isabelle: a generic theorem prover. LNCS, vol. 828. Springer, Heidelberg (1994)
Peterfalvi, T.: Character Theory for the Odd Order Theorem. London Mathematical Society Lecture Note Series, vol. 272. Cambridge University Press, Cambridge (2000)
The Flyspeck Project, http://www.math.pitt.edu/~thales/flyspeck/
Rideau, L., Théry, L.: Formalising Sylow’s theorems in Coq. Technical Report 0327, INRIA (2006)
Werner, B.: Une théorie des Constructions Inductives. PhD thesis, Paris 7 (1994)
Wielandt, H.: Ein beweis für die Existenz der Sylowgruppen. Archiv der Mathematik 10, 401–402 (1959)
Yu, Y.: Computer Proofs in Group Theory. J. Autom. Reasoning 6(3), 251–286 (1990)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2007 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Gonthier, G., Mahboubi, A., Rideau, L., Tassi, E., Théry, L. (2007). A Modular Formalisation of Finite Group Theory. In: Schneider, K., Brandt, J. (eds) Theorem Proving in Higher Order Logics. TPHOLs 2007. Lecture Notes in Computer Science, vol 4732. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-74591-4_8
Download citation
DOI: https://doi.org/10.1007/978-3-540-74591-4_8
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-74590-7
Online ISBN: 978-3-540-74591-4
eBook Packages: Computer ScienceComputer Science (R0)