# zbMATH — the first resource for mathematics

Formalization of the arithmetization of Euclidean plane geometry and applications. (English) Zbl 1394.68349
Summary: 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 metamathematical properties. This work completes our formalization of the two-dimensional results contained in the book by W. Schwabhäuser et al. [Metamathematische Methoden in der Geometrie. Teil I: Ein axiomatischer Aufbau der euklidischen Geometrie. Berlin etc.: Springer-Verlag (1983; Zbl 0564.51001)]. 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.

##### MSC:
 68T15 Theorem proving (deduction, resolution, etc.) (MSC2010) 03B30 Foundations of classical theories (including reverse mathematics) 03B35 Mechanization of proofs and logical operations 51M04 Elementary problems in Euclidean geometries 68W30 Symbolic computation and algebraic computation
##### Software:
Coq; GCLC; GeoCoq; GEX; JGEX; OpenGeoProver
Full Text: