Formally Verified Approximations of Definite Integrals
Finding an elementary form for an antiderivative is often a difficult task, so numerical integration has become a common tool when it comes to making sense of a definite integral. Some of the numerical integration methods can even be made rigorous: not only do they compute an approximation of the integral value but they also bound its inaccuracy. Yet numerical integration is still missing from the toolbox when performing formal proofs in analysis.
This paper presents an efficient method for automatically computing and proving bounds on some definite integrals inside the Coq formal system. Our approach is not based on traditional quadrature methods such as Newton-Cotes formulas. Instead, it relies on computing and evaluating antiderivatives of rigorous polynomial approximations, combined with an adaptive domain splitting. This work has been integrated to the CoqInterval library.
- 1.Ahmed, Z.: Ahmed’s integral: the maiden solution. Math. Spectr. 48(1), 11–12 (2015)Google Scholar
- 3.Eaton, J.W., Bateman, D., Hauberg, S., Wehbring, R., Octave, G.N.U.: version 3.8.1 manual: a high-level interactive language for numerical computations (2014)Google Scholar
- 5.Helfgott, H.A.: Major arcs for Goldbach’s problem (2013). http://arxiv.org/abs/1305.2897
- 8.Martin-Dorel, É., Melquiond, G.: Proving tight bounds on univariate expressions with elementary functions in Coq. J. Autom. Reason. 1–31 (2015)Google Scholar
- 9.Mayero, M.: Formalisation et automatisation de preuves en analyses réelle et numérique. Ph.D. thesis, Université Paris VI, December 2001Google Scholar
- 11.Nedialkov, N.S.: Interval tools for ODEs and DAEs. In: Scientific Computing, Computer Arithmetic and Validated Numerics (SCAN) (2006). http://www.cas.mcmaster.ca/~nedialk/vnodelp/