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.
Liste complète des métadonnées

https://hal.archives-ouvertes.fr/hal-01112822
Contributor : Alain Monteil <>
Submitted on : Tuesday, February 3, 2015 - 4:44:44 PM
Last modification on : Wednesday, September 12, 2018 - 1:16:39 AM

Links full text

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; Jürgen Richter-Gebert. Automated Deduction in Geometry 8th International Workshop, ADG 2010, Munich, Germany, July 22-24, 2010, Revised Selected Papers, 6877, Springer, pp.51--62, 2011, Lecture Notes in Computer Science, 978-3-642-25069-9. ⟨10.1007/978-3-642-25070-5_3⟩. ⟨hal-01112822⟩

Share

Metrics

Record views

306