Formalization of the Arithmetization of Euclidean Plane Geometry and Applications

Abstract : This paper describes the formalization of the arithmetization of Euclidean plane geometry in the Coq proof assistant. As a basis for this work, Tarski's system of geometry was chosen for its well-known metamath-ematical properties. This work completes our formalization of the two-dimensional results contained in part one of the book by Schwabhäuser Szmielew and Tarski Metamathematische Methoden in der Geometrie. We defined the arithmetic operations geometrically and proved that they verify the properties of an ordered field. Then, we introduced Cartesian coordinates, and provided characterizations of the main geometric predicates. In order to prove the characterization of the segment congruence relation, we provided a synthetic formal proof of two crucial theorems in geometry, namely the intercept and Pythagoras' theorems. To obtain the characterizations of the geometric predicates, we adopted an original approach based on bootstrapping: we used an algebraic prover to obtain new characterizations of the predicates based on already proven ones. The arithmetization of geometry paves the way for the use of algebraic automated deduction methods in synthetic geometry. Indeed, without a " back-translation " from algebra to geometry, algebraic methods only prove theorems about polynomials and not geometric statements. However, thanks to the arithmetization of geometry, the proven statements correspond to theorems of any model of Tarski's Euclidean geometry axioms. To illustrate the concrete use of this formalization, we derived from Tarski's system of geometry a formal proof of the nine-point circle theorem using the Gröbner basis method. Moreover , we solve a challenge proposed by Beeson: we prove that, given two points, an equilateral triangle based on these two points can be constructed in Euclidean Hilbert planes. Finally, we derive the axioms for another automated deduction method: the area method.
Type de document :
Article dans une revue
Journal of Symbolic Computation, Elsevier, In press, Special Issue on Symbolic Computation in Software Science, pp.23. 〈James H. Davenport and Temur Kutsia 〉. 〈10.1016/j.jsc.2018.04.007〉
Liste complète des métadonnées

Littérature citée [33 références]  Voir  Masquer  Télécharger

https://hal.inria.fr/hal-01483457
Contributeur : Julien Narboux <>
Soumis le : dimanche 5 mars 2017 - 22:17:17
Dernière modification le : lundi 16 avril 2018 - 10:05:47
Document(s) archivé(s) le : mardi 6 juin 2017 - 12:47:57

Fichier

extended-arithmetization.pdf
Fichiers produits par l'(les) auteur(s)

Identifiants

Collections

Citation

Pierre Boutry, Gabriel Braun, Julien Narboux. Formalization of the Arithmetization of Euclidean Plane Geometry and Applications. Journal of Symbolic Computation, Elsevier, In press, Special Issue on Symbolic Computation in Software Science, pp.23. 〈James H. Davenport and Temur Kutsia 〉. 〈10.1016/j.jsc.2018.04.007〉. 〈hal-01483457〉

Partager

Métriques

Consultations de la notice

184

Téléchargements de fichiers

223