Formal Verification of Nonlinear Inequalities with Taylor Interval Approximations
We present a formal tool for verification of multivariate nonlinear inequalities. Our verification method is based on interval arithmetic with Taylor approximations. Our tool is implemented in the HOL Light proof assistant and it is capable to verify multivariate nonlinear polynomial and non-polynomial inequalities on rectangular domains. One of the main features of our work is an efficient implementation of the verification procedure which can prove non-trivial high-dimensional inequalities in several seconds. We developed the verification tool as a part of the Flyspeck project (a formal proof of the Kepler conjecture). The Flyspeck project includes about 1000 nonlinear inequalities. We successfully tested our method on more than 100 Flyspeck inequalities and estimated that the formal verification procedure is about 3000 times slower than an informal verification method implemented in C++. We also describe future work and prospective optimizations for our method.
KeywordsInterval Arithmetic Original Domain Taylor Approximation Polynomial Inequality Nonlinear Inequality
Unable to display preview. Download preview PDF.
- 1.Harrison, J.: The HOL Light theorem prover (2010), http://www.cl.cam.ac.uk/~jrh13/hol-light/index.html
- 2.Solovyev, A.: A tool for formal verification of nonlinear inequalities (2012), http://flyspeck.googlecode.com/files/FormalVerifier.pdf
- 3.Solovyev, A.: Formal Computations and Methods. PhD thesis, University of Pittsburgh (2012), http://d-scholarship.pitt.edu/16721/
- 4.Hales, T.C.: Introduction to the Flyspeck project. In: Coquand, T., Lombardi, H., Roy, M.F. (eds.) Mathematics, Algorithms, Proofs. Dagstuhl Seminar Proceedings, vol. 05021, Internationales Begegnungs- und Forschungszentrum für Informatik (IBFI), Schloss Dagstuhl, Germany (2006), http://drops.dagstuhl.de/opus/volltexte/2006/432 Google Scholar
- 5.Hales, T.C.: The Flyspeck Project (2012), http://code.google.com/p/flyspeck
- 7.Hales, T.C.: Dense Sphere Packings: a blueprint for formal proofs. London Math. Soc. Lecture Note Series, vol. 400. Cambridge University Press (2012)Google Scholar
- 10.Collins, G.E.: Quantifier elimination for real closed fields by cylindrical algebraic decomposition. In: Brakhage, H. (ed.) GI-Fachtagung 1975. LNCS, vol. 33, pp. 134–183. Springer, Heidelberg (1975)Google Scholar
- 16.Zumkeller, R.: Global Optimization in Type Theory. PhD thesis, École Polytechnique Paris (2008)Google Scholar
- 17.Muñoz, C., Narkawicz, A.: Formalization of a representation of Bernstein polynomials and applications to global optimization. Journal of Automated Reasoning (2012) (accepted for publication)Google Scholar
- 19.Zumkeller, R.: Sergei. A Global Optimization Tool (2009), http://code.google.com/p/sergei/