Construction of Real Algebraic Numbers in Coq

This paper shows a construction in Coq of the set of real algebraic numbers, together with a formal proof that this set has a structure of discrete Archimedean real closed field. This construction hence implements an interface of real closed field. Instances of such an interface immediately enjoy quantifier elimination thanks to a previous work. This work also intends to be a basis for the construction of complex algebraic numbers and to be a reference implementation for the certification of numerous algorithms relying on algebraic numbers in computer algebra.

[1]  Gilles Barthe,et al.  Setoids in type theory , 2003, Journal of Functional Programming.

[2]  Andrea Asperti,et al.  A Bi-Directional Refinement Algorithm for the Calculus of (Co)Inductive Constructions , 2012, Log. Methods Comput. Sci..

[3]  R. Tennant.  Algebra , 1941, Nature.

[4]  Stephen M. Watt,et al.  Intelligent Computer Mathematics , 2014, Lecture Notes in Computer Science.

[5]  Alan Bundy,et al.  Proofs About Lists Using Ellipsis , 1999, LPAR.

[6]  Wim Ruitenburg,et al.  A Course in Constructive Algebra , 1987 .

[7]  Russell O'Connor,et al.  Certified Exact Transcendental Real Number Computation in Coq , 2008, TPHOLs.

[8]  Assia Mahboubi,et al.  Packaging Mathematical Structures , 2009, TPHOLs.

[9]  Herman Geuvers,et al.  Constructive Reals in Coq: Axioms and Categoricity , 2000, TYPES.

[10]  Maribel Fernández,et al.  Curry-Style Types for Nominal Terms , 2006, TYPES.

[11]  David Aspinall,et al.  Formalising Java's Data Race Free Guarantee , 2007, TPHOLs.

[12]  Alin Bostan,et al.  Algorithmique efficace pour des opérations de base en calcul formel. (Fast algorithms for basic operations in computer algebra) , 2003 .

[13]  A constructive version of Laplace's proof on the existence of complex roots , 2013 .

[14]  Jens Brandt,et al.  Theorem Proving in Higher Order Logics , 1997, Lecture Notes in Computer Science.

[15]  Bas Spitters,et al.  Computer Certified Efficient Exact Reals in Coq , 2011, Calculemus/MKM.

[16]  David Delahaye,et al.  A Tactic Language for the System Coq , 2000, LPAR.

[17]  Stefano Berardi,et al.  Selected papers from the International Workshop on Types for Proofs and Programs , 1995 .

[18]  K. Brown,et al.  Graduate Texts in Mathematics , 1982 .

[19]  Assia Mahboubi,et al.  Formal proofs in real algebraic geometry: from ordered fields to quantifier elimination , 2012, Log. Methods Comput. Sci..