Formalizing Pick's Theorem in Isabelle/HOL

被引:0
|
作者
Binder, Sage [1 ]
Kosaian, Katherine [2 ]
机构
[1] Univ Iowa, Iowa City, IA 52242 USA
[2] Iowa State Univ, Ames, IA 50011 USA
来源
基金
美国国家科学基金会;
关键词
Pick's theorem; Isabelle/HOL; formalization; geometry;
D O I
10.1007/978-3-031-66997-2_7
中图分类号
TP301 [理论、方法];
学科分类号
081202 ;
摘要
We formalize Pick's theorem for finding the area of a simple polygon whose vertices are integral lattice points. We are inspired by John Harrison's formalization of Pick's theorem in HOL Light, but tailor our proof approach to avoid a primary challenge point in his formalization, which is proving that any polygon with more than three vertices can be split (in its interior) by a line between some two vertices. We detail the approach we use to avoid this step and reflect on the pros and cons of our eventual formalization strategy. We use the theorem prover Isabelle/HOL, and our formalization involves augmenting the existing geometry libraries in various foundational ways (e.g., by adding the definition of a polygon and formalizing some key properties thereof).
引用
收藏
页码:109 / 126
页数:18
相关论文
共 50 条
  • [21] Proof of the basic theorem on concept lattices in Isabelle/HOL
    Sertkaya, B
    Oguztüzün, H
    COMPUTER AND INFORMATION SCIENCES - ISCIS 2004, PROCEEDINGS, 2004, 3280 : 976 - 985
  • [22] Formalizing the LLL Basis Reduction Algorithm and the LLL Factorization Algorithm in Isabelle/HOL
    René Thiemann
    Ralph Bottesch
    Jose Divasón
    Max W. Haslbeck
    Sebastiaan J. C. Joosten
    Akihisa Yamada
    Journal of Automated Reasoning, 2020, 64 : 827 - 856
  • [23] Formalizing the Metatheory of Logical Calculi and Automatic Provers in Isabelle/HOL (Invited Talk)
    Blanchette, Jasmin Christian
    PROCEEDINGS OF THE 8TH ACM SIGPLAN INTERNATIONAL CONFERENCE ON CERTIFIED PROGRAMS AND PROOFS (CPP' 19), 2019, : 1 - 13
  • [24] Formalizing the Cox-Ross-Rubinstein Pricing of European Derivatives in Isabelle/HOL
    Echenim, Mnacho
    Guiol, Herve
    Peltier, Nicolas
    JOURNAL OF AUTOMATED REASONING, 2020, 64 (04) : 737 - 765
  • [25] Formalizing the LLL Basis Reduction Algorithm and the LLL Factorization Algorithm in Isabelle/HOL
    Thiemann, Rene
    Bottesch, Ralph
    Divason, Jose
    HasIbeck, Max W.
    Joosten, Sebastiaan J. C.
    Yamada, Akihisa
    JOURNAL OF AUTOMATED REASONING, 2020, 64 (05) : 827 - 856
  • [26] A formal proof of Sylow's theorem -: An experiment in abstract algebra with Isabelle HOL
    Kammüller, F
    Paulson, LC
    JOURNAL OF AUTOMATED REASONING, 1999, 23 (3-4) : 235 - 264
  • [27] FORMALIZING A MODAL LOGIC FOR CCS IN THE HOL THEOREM PROVER
    NESI, M
    IFIP TRANSACTIONS A-COMPUTER SCIENCE AND TECHNOLOGY, 1993, 20 : 279 - 294
  • [28] Formalizing the Cox-Ross-Rubinstein Pricing of European Derivatives in Isabelle/HOL
    Echenim, Mnacho
    Guiol, Hervé
    Peltier, Nicolas
    Journal of Automated Reasoning, 2019, 64 (04): : 737 - 765
  • [29] Comprehending Isabelle/HOL's Consistency
    Kuncar, Ondrej
    Popescu, Andrei
    PROGRAMMING LANGUAGES AND SYSTEMS (ESOP 2017): 26TH EUROPEAN SYMPOSIUM ON PROGRAMMING, 2017, 10201 : 724 - 749
  • [30] Importing HOL into Isabelle/HOL
    Obua, Steven
    Skalberg, Sebastian
    AUTOMATED REASONING, PROCEEDINGS, 2006, 4130 : 298 - 302