A formal proof of Sylow's theorem -: An experiment in abstract algebra with Isabelle HOL

被引:0
作者
Kammüller, F [1 ]
Paulson, LC [1 ]
机构
[1] Univ Cambridge, Comp Lab, Cambridge CB2 1TN, England
关键词
Sylow's theorem; Isabelle; theorem proving;
D O I
10.1023/A:1006269330992
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
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.
引用
收藏
页码:235 / 264
页数:30
相关论文
共 15 条
  • [1] [Anonymous], 1994, LECT NOTES COMPUTER, DOI DOI 10.1007/BFB0030556
  • [2] TELESCOPIC MAPPINGS IN TYPED LAMBDA-CALCULUS
    DEBRUIJN, NG
    [J]. INFORMATION AND COMPUTATION, 1991, 91 (02) : 189 - 204
  • [3] DEBRUIJN NG, 1980, HB CURRY ESSAYS COMB, P579, DOI DOI 10.1016/S0049-237X(08)70203-9)
  • [4] DOWEK G, 1990, 1283 INRIA
  • [5] IMPS - AN INTERACTIVE MATHEMATICAL PROOF SYSTEM
    FARMER, WM
    GUTTMAN, JD
    THAYER, FJ
    [J]. JOURNAL OF AUTOMATED REASONING, 1993, 11 (02) : 213 - 248
  • [6] Gunter Elsa. L., 1989, MSCIS8938 U PENNS
  • [7] GUTTAG JV, 1993, TEXTS MONOGRAPHS COM
  • [8] Herstein I.N., 1964, TOPICS ALGEBRA
  • [9] KAMMULLER F, 1998, 449 U CAMBR COMP LAB
  • [10] OWRE S, 1993, PVS SPECIFICATION LA