Formally Verified Approximations of Definite Integrals

Assia Mahboubi, Guillaume Melquiond, Thomas Sibut-Pinote*

*Corresponding author for this work

Research output: Contribution to JournalArticleAcademicpeer-review

Abstract

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. Our approach also handles improper integrals, provided that a factor of the integrand belongs to a catalog of identified integrable functions. This work has been integrated to the CoqInterval library.

Original languageEnglish
Pages (from-to)281-300
Number of pages20
JournalJournal of Automated Reasoning
Volume62
Issue number2
DOIs
Publication statusPublished - 15 Feb 2019
Externally publishedYes

Keywords

  • Decision procedure
  • Definite integrals
  • Formal proof
  • Improper integrals
  • Interval arithmetic
  • Numeric computations
  • Polynomial approximations
  • Real analysis

Fingerprint

Dive into the research topics of 'Formally Verified Approximations of Definite Integrals'. Together they form a unique fingerprint.

Cite this