A formalization of grassmann-cayley algebra in COQ and its application to theorem proving in projective geometry

  • Authors:
  • Laurent Fuchs;Laurent Théry

  • Affiliations:
  • XLIM-SIC UMR CNRS 6172 - Poitiers University, France;INRIA Sophia Antipolis - Méditerranée, France

  • Venue:
  • ADG'10 Proceedings of the 8th international conference on Automated Deduction in Geometry
  • Year:
  • 2010

Quantified Score

Hi-index 0.00

Visualization

Abstract

This paper presents a formalization of Grassmann-Cayley algebra [6] that has been done in the COQ [2] 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 [7,1] are interactively derived. A method that automatically proves projective geometric theorems [11] is also translated successfully into the proposed formalization.