Proof Certificates for Algebra and Their Application to Automatic Geometry Theorem Proving

@inproceedings{Grgoire2008ProofCF,
  title={Proof Certificates for Algebra and Their Application to Automatic Geometry Theorem Proving},
  author={Benjamin Gr{\'e}goire and Lo{\"i}c Pottier and Laurent Th{\'e}ry},
  booktitle={Automated Deduction in Geometry},
  year={2008}
}
Integrating decision procedures in proof assistants in a safe way is a major challenge. In this paper, we describe how, starting from Hilbert's Nullstellensatz theorem, we combine a modified version of Buchberger's algorithm and some reflexive techniques to get an effective procedure that automatically produces formal proofs of theorems in geometry. The method is implemented in the Coq system but, since our specialised version of Buchberger's algorithm outputs explicit proof certificates, it… 
Formally Verifying Proofs for Algebraic Identities of Matrices
TLDR
This work considers proof certificates for identities of rectangular matrices, and presents several applications, that is efficiently formalized proofs for important identities of matrices: cancellation properties of triple products with Moore–Penrose pseudoinverses, a generalized Sherman–Morrison–Woodbury formula and an automated derivation of feedback loops in the famous Youla controller parametrization from control theory.
A Synthetic Proof of Pappus’ Theorem in Tarski’s Geometry
TLDR
This paper reports on the formalization of a synthetic proof of Pappus’ theorem, which is an important milestone toward obtaining the arithmetization of geometry, which will allow to provide a connection between analytic and synthetic geometry.
Computer Theorem Proving for Verifiable Solving of Geometric Construction Problems
TLDR
This paper presents a formal logical framework describing the traditional four phases process of geometric construction solving and shows how to put into practice well-known algebra-based methods and field theory, to prove RC-constructibility in the case of problems from Wernick's list.
Solving Geometric Construction Problems Supported by Theorem Proving
TLDR
This paper presents a formal logic framework describing the traditional four phases process of geometric construction solving and shows how to put into practice known methods based on algebra and, in particular, field theory, to prove RC-constructibility in the case of problems from Wernick's list.
On the formalization of foundations of geometry
TLDR
A new proof is exposed that Euclid’s parallel postulate is not derivable from the other axioms of first-order Euclidean geometry, and Pejas’ classification of parallel postulates is refined.
Formalization of Wu's Simple Method in Coq
TLDR
The integration within the Coq proof assistant, of a method for automatic theorem proving in geometry, using an approach based on the validation of a certificate is presented.
Formalization and Implementation of Algebraic Methods in Geometry
TLDR
This work describes the ongoing project of formalization of algebraic methods for geometry theorem proving (Wu's method and the Groebner bases method), their implementation and integration in educational tools, and development of a new, open-source Java implementation of thegebraic methods.
From Tarski to Descartes: Formalization of the Arithmetization of Euclidean Geometry
TLDR
The formalization of the arithmetization of Euclidean geometry in the Coq proof assistant is described, derived from Tarski's system of geometry a formal proof of the nine-point circle theorem using the Grobner basis method.
...
...

References

SHOWING 1-10 OF 35 REFERENCES
Complex quantifier elimination in HOL
TLDR
This work implements, as a HOL derived inference rule, a decision method for the first order algebraic theory of C based on quantifier elimination and implements a more efficient semidecision procedure for the universal fragment based on Gr öbner bases.
Geometry theorem proving using Hilbert's Nullstellensatz
TLDR
Collins’ method based on cylinderical algebraic decomposition technique is, to the authors' knowledge, the only decision procedure implemented so far; see [2, 31 for details.
Automating Elementary Number-Theoretic Proofs Using Gröbner Bases
TLDR
A uniform algorithm for proving automatically a fairly wide class of elementary facts connected with integer divisibility, based on a reduction to ideal membership assertions that are then solved using Grobner bases.
Ritt-Wu's Decomposition Algorithm and Geometry Theorem Proving
An improved Ritt-Wu''s decomposition (of an algebraic set into the union of irreducible varieties) algorithm is given. The algorithm has been used to prove geometric theorems that Wu''s original
A Refutational Approach to Geometry Theorem Proving
A Computational Approach to Pocklington Certificates in Type Theory
TLDR
An encoding of certificates for the proof system Coq is presented which yields radically improved performances by relying heavily on computations inside and outside of the system (two-level approach).
The semantics of reflected proof
TLDR
The authors lay the foundations for reasoning about proofs whose steps include both invocations of programs to build subproofs and references to representations of proofs themselves (reflected proofs), and define a single type of proof which can mention itself.
Verifying Nonlinear Real Formulas Via Sums of Squares
TLDR
This work describes its experience with an implementation in HOL Light, noting some successes as well as difficulties, and describes a new approach to the univariate case that can handle some otherwise difficult examples.
Connecting Gröbner Bases Programs with Coq to do Proofs in Algebra, Geometry and Arithmetics
  • L. Pottier
  • Computer Science, Mathematics
    LPAR Workshops
  • 2008
TLDR
This work describes how it connected three programs that compute Groebner bases to Coq, to do automated proofs on algebraic, geometrical and arithmetical expressions, and produces certificates in order to make the proof scripts independant from the external programs.
Proving Equalities in a Commutative Ring Done Right in Coq
TLDR
A new implementation of a reflexive tactic which solves equalities in a ring structure inside the Coq system is presented, which shows that such reflective methods can be effectively used in symbolic computation.
...
...