A Formalization of Grassmann-Cayley Algebra in COQ and Its Application to Theorem Proving in Projective Geometry

Laurent Fuchs 1, * Laurent Thery 2
* Corresponding author
1 SIC
XLIM - XLIM, Université de Poitiers
2 MARELLE - Mathematical, Reasoning and Software
CRISAM - Inria Sophia Antipolis - Méditerranée
Abstract : This paper presents a formalization of Grassmann-Cayley algebra that has been done in the COQ proof assistant. The formalization is based on a data structure that represents elements of the algebra as complete binary trees. This allows to define the algebra products recursively. Using this formalization, published proofs of Pappus' and Desargues' theorem are interactively derived. A method that automatically proves projective geometric theorems is also translated successfully into the proposed formalization.
Document type :
Conference papers
Pascal Schreck, Julien Narboux and Jürgen Richter-Gebert. Automated Deduction in Geometry, ADG 2010, Jul 2010, Munich, Germany. Springer, 6877, pp.51--62, 2011, Lecture Notes in Computer Science. <10.1007/978-3-642-25070-5_3>
Liste complète des métadonnées


https://hal.archives-ouvertes.fr/hal-00657901
Contributor : Laurent Fuchs <>
Submitted on : Monday, January 9, 2012 - 2:34:35 PM
Last modification on : Wednesday, July 29, 2015 - 1:22:52 AM
Document(s) archivé(s) le : Monday, November 19, 2012 - 1:00:56 PM

File

fuchs_thery_adg10_postproc_fin...
Files produced by the author(s)

Identifiers

Collections

Citation

Laurent Fuchs, Laurent Thery. A Formalization of Grassmann-Cayley Algebra in COQ and Its Application to Theorem Proving in Projective Geometry. Pascal Schreck, Julien Narboux and Jürgen Richter-Gebert. Automated Deduction in Geometry, ADG 2010, Jul 2010, Munich, Germany. Springer, 6877, pp.51--62, 2011, Lecture Notes in Computer Science. <10.1007/978-3-642-25070-5_3>. <hal-00657901>

Share

Metrics

Record views

529

Document downloads

310