Formal proofs in real algebraic geometry: from ordered fields to quantifier elimination - Archive ouverte HAL Access content directly
Journal Articles Logical Methods in Computer Science Year : 2012

Formal proofs in real algebraic geometry: from ordered fields to quantifier elimination

(1, 2, 3) , (4, 1, 2, 3)
1
2
3
4

Abstract

This paper describes a formalization of discrete real closed fields in the Coq proof assistant. This abstract structure captures for instance the theory of real algebraic numbers, a decidable subset of real numbers with good algorithmic properties. The theory of real algebraic numbers and more generally of semi-algebraic varieties is at the core of a number of effective methods in real analysis, including decision procedures for non linear arithmetic or optimization methods for real valued functions. After defining an abstract structure of discrete real closed field and the elementary theory of real roots of polynomials, we describe the formalization of an algebraic proof of quantifier elimination based on pseudo-remainder sequences following the standard computer algebra literature on the topic. This formalization covers a large part of the theory which underlies the efficient algorithms implemented in practice in computer algebra. The success of this work paves the way for formal certification of these efficient methods.
Fichier principal
Vignette du fichier
1201.3731.pdf (485.27 Ko) Télécharger le fichier
Origin : Publisher files allowed on an open archive
Loading...

Dates and versions

inria-00593738 , version 1 (17-05-2011)
inria-00593738 , version 2 (02-12-2011)
inria-00593738 , version 3 (17-01-2012)
inria-00593738 , version 4 (16-02-2012)

Identifiers

Cite

Cyril Cohen, Assia Mahboubi. Formal proofs in real algebraic geometry: from ordered fields to quantifier elimination. Logical Methods in Computer Science, 2012, 8 (1:02), pp.1-40. ⟨10.2168/LMCS-8(1:02)2012⟩. ⟨inria-00593738v4⟩
594 View
751 Download

Altmetric

Share

Gmail Facebook Twitter LinkedIn More