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

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.
Document type :
Journal articles
Complete list of metadatas

Cited literature [34 references]  Display  Hide  Download

https://hal.inria.fr/inria-00593738
Contributor : Cyril Cohen <>
Submitted on : Thursday, February 16, 2012 - 2:19:27 PM
Last modification on : Thursday, July 4, 2019 - 3:56:24 PM
Long-term archiving on : Wednesday, December 14, 2016 - 6:20:07 AM

File

1201.3731.pdf
Publisher files allowed on an open archive

Identifiers

Collections

Citation

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

Share

Metrics

Record views

868

Files downloads

1166