Journal of Automated Reasoning

, Volume 23, Issue 3, pp 235–264

A Formal Proof of Sylow's Theorem

Authors

  • Florian Kammüller
    • Computer LaboratoryUniversity of Cambridge
  • Lawrence C. Paulson
    • Computer LaboratoryUniversity of Cambridge
Article

DOI: 10.1023/A:1006269330992

Cite this article as:
Kammüller, F. & Paulson, L.C. Journal of Automated Reasoning (1999) 23: 235. doi:10.1023/A:1006269330992

Abstract

The theorem of Sylow is proved in Isabelle HOL. We follow the proof by Wielandt that is more general than the original and uses a nontrivial combinatorial identity. The mathematical proof is explained in some detail, leading on to the mechanization of group theory and the necessary combinatorics in Isabelle. We present the mechanization of the proof in detail, giving reference to theorems contained in an appendix. Some weak points of the experiment with respect to a natural treatment of abstract algebraic reasoning give rise to a discussion of the use of module systems to represent abstract algebra in theorem provers. Drawing from that, we present tentative ideas for further research into a section concept for Isabelle.

Sylow's theoremIsabelletheorem proving

Copyright information

© Kluwer Academic Publishers 1999