Abstract
Incidence geometry is a well-established theory which captures the very basic properties of all geometries in terms of points belonging to lines, planes, etc. Moreover, projective incidence geometry leads to a simple framework where many properties can be studied. In this article, we consider two very different but complementary mathematical approaches formalizing this theory within the Coq proof assistant. The first one consists of the usual and synthetic geometric axiom system often encountered in the literature. The second one is more original and relies on combinatorial aspects through the notion of rank which is based on the matroid structure of incidence geometry. This paper mainly contributes to the field by proving the equivalence between these two approaches in both 2D and 3D. This result allows us to study the further automation of many proofs of projective geometry theorems. We give an overview of techniques that will be heavily used in the equivalence proof and are generic enough to be reused later in yet-to-be-written proofs. Finally, we discuss the possibilities of future automation that can be envisaged using the rank notion.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
Explore related subjects
Discover the latest articles, news and stories from top researchers in related subjects.References
Baker, H.F.: Principles of geometry, vol. 1. Cambridge University Press, Cambridge (1925)
Bamberg, J., Penttila, T.: Completing Segre’s proof of Wedderburn’s little theorem. Bull. Lond. Math. Soc. 47(3), 483–492 (2015)
Batten, L.M.: Combinatorics of finite geometries. Cambridge University Press, Cambridge (1997)
Bertot, Y., Castéran, P.: Interactive theorem proving and program development, Coq’Art: The calculus of inductive constructions. Texts in theoretical computer science, Springer Science & Business Media (2004)
Boutry, P., Narboux, J., Schreck, P., Braun, G.: Using small scale automation to improve both accessibility and readability of formal proofs in geometry. Automated Deduction in Geometry 2014, 1–19 (2014)
Braun, D., Magaud, N., Schreck, P.: An equivalence proof between rank theory and incidence projective geometry. In: Proceedings of automated deduction in geometry 2016. pp. 62–77. https://hal.inria.fr/hal-01334334 (2016)
Buekenhout, F.: Handbook of incidence geometry: buildings and foundations. Elsevier, Amsterdam (1995)
Castéran, P., Sozeau, M.: A Gentle Introduction to Type Classes and Relations in Coq (2016)
Coq development team: The Coq proof Assistant Reference Manual. https://coq.inria.fr/distrib/current/files/Reference-Manual.pdf (2016)
Coxeter, H.S.M.: Projective geometry springer science & business media (2003)
Dehlinger, C., Dufourd, J.-F., Schreck, P.: Higher-order intuitionistic formalization and proofs in hilbert’s elementary geometry. Automated Deduction in Geometry, 306–324 (2000)
Duprat, J.: Une axiomatique de la géométrie plane en Coq. Journé,es Francophones des Langages Applicatifs (2008)
Fuchs, L., Thery, L.: A formalization of grassmann-cayley algebra in Coq and its application to theorem proving in projective geometry. Automated Deduction in Geometry 6877, 51–67 (2010)
Génevaux, J.-D., Narboux, J, Schreck, P: Formalization of Wu’s simple method in Coq. Certified Programs and Proofs 7086, 71–86 (2011)
Guilhot, F.: Formalisation en Coq et visualisation d’un cours de géometrie pour le lycée. Journé,es Francophones des Langages Applicatifs 7, 15 (2004)
Janičić, P., Narboux, J., Quaresma, P.: The area method: a recapitulation. J. Autom. Reason. 48(4), 489–532 (2012)
Kahn, G.: Constructive geometry according to Jan von Plato (1995)
Kusak, E.: Desargues theorem in projective 3-space. J. of Formalized Mathematics 2 (1990)
Lescuyer, S.: First-class containers in Coq. Stud. Inform. Univ. 9(1), 87–127 (2011)
Li, H., Wu, Y.: Automated short proof generation for projective geometric theorems with Cayley and bracket algebras: I. Incidence geometry. J. Symb. Comput. 36(5), 717–762 (2003)
Magaud, N., Narboux, J., Schreck, P.: Formalizing projective plane geometry in Coq. Automated Deduction in Geometry 6301, 141–162 (2008)
Magaud, N., Narboux, J., Schreck, P.: Formalizing Desargues theorem in Coq using ranks. In: Proceedings of the 2009 ACM symposium on applied computing, 1110–1115 (2009)
Magaud, N., Narboux, J., Schreck, P.: A case study in formalizing projective geometry in Coq: Desargues theorem. Comput. Geom. Theory Appl. 45(8), 406–424 (2012)
Meikle, L., Fleuriot, J.: Formalizing hilbert’s grundlagen in Isabelle/Isar. Theorem proving in higher logics 2758, 319–334 (2003)
Michelucci, D., Foufou, S., Lamarque, L., Schreck, P.: Geometric constraints solving:some tracks. ACM, 185–196 (2006)
Michelucci, D., Schreck, P.: Detecting induced incidences in the projective plane. isiCAD Workshop Citeseer (2004)
Michelucci, D., Schreck, P.: Incidence constraints: a combinatorial approach. Int. J. Comput. Geom. Appl. 16(05n06), 443–460 (2006)
Narboux, J.: A decision procedure for geometry in Coq. Theorem Proving in Higher Order Logics 3223, 225–240 (2004)
Narboux, J.: Mechanical theorem proving in tarski’s geometry. Automated Deduction in Geometry 4869, 139–156 (2006)
Oxley, J.: Matroid theory, vol. 3. Oxford University Press, USA (2006)
Richter-Gebert, J.: Mechanical theorem proving in projective geometry. Ann. Math. Artif. Intell. 13, 139–172 (1995)
Sozeau, M., Oury, N.: First-class type classes. Theorem Proving in Higher Order Logics 5170, 278–293 (2008)
Tarski, A.: What is Elementary Geometry? (1983)
Von Plato, J.: The axioms of constructive geometry. Ann. Pure Appl. Logic 76(2), 169–200 (1995)
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Braun, D., Magaud, N. & Schreck, P. Two cryptomorphic formalizations of projective incidence geometry. Ann Math Artif Intell 85, 193–212 (2019). https://doi.org/10.1007/s10472-018-9604-z
Published:
Issue Date:
DOI: https://doi.org/10.1007/s10472-018-9604-z