Kammüller, Florian; Paulson, Lawrence C. A formal proof of Sylow’s theorem. An experiment in abstract algebra with Isabelle H0L. (English) Zbl 0943.68149 J. Autom. Reasoning 23, No. 3-4, 235-264 (1999). Summary: The theorem of Sylow is proved in Isabelle H0L. 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. Cited in 4 Documents MSC: 68T15 Theorem proving (deduction, resolution, etc.) (MSC2010) 03B35 Mechanization of proofs and logical operations 20E07 Subgroup theorems; subgroup growth 20-04 Software, source code, etc. for problems pertaining to group theory Keywords:Isabelle HOL Software:Secondary Sylow; Locales; IMPS; LARCH; PVS; Automath; Isabelle PDFBibTeX XMLCite \textit{F. Kammüller} and \textit{L. C. Paulson}, J. Autom. Reasoning 23, No. 3--4, 235--264 (1999; Zbl 0943.68149) Full Text: DOI