Abstract
Lebesgue integration is a fundamental concept in many mathematical theories, such as real analysis, probability and information theory. Reported higher-order-logic formalizations of the Lebesgue integral either do not include, or have a limited support for the Borel algebra, which is the canonical sigma algebra used on any metric space over which the Lebesgue integral is defined. In this paper, we overcome this limitation by presenting a formalization of the Borel sigma algebra that can be used on any metric space, such as the complex numbers or the n-dimensional Euclidean space. Building on top of this framework, we have been able to prove some key Lebesgue integral properties, like its linearity and monotone convergence. Furthermore, we present the formalization of the “almost everywhere” relation and prove that the Lebesgue integral does not distinguish between functions which differ on a null set as well as other important results based on this concept. As applications, we present the verification of Markov and Chebyshev inequalities and the Weak Law of Large Numbers theorem.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Berberian, S.K.: Fundamentals of Real Analysis. Springer, Heidelberg (1998)
Bogachev, V.I.: Measure Theory. Springer, Heidelberg (2006)
Coble, A.R.: Anonymity, Information, and Machine-Assisted Proof. PhD thesis, University of Cambridge, UK (2009)
Cover, T.M., Thomas, J.A.: Elements of Information Theory. Wiley-Interscience, Hoboken (1991)
Goldberg, R.R.: Methods of Real Analysis. Wiley, Chichester (1976)
Halmos, P.R.: The foundations of probability. The American Mathematical Monthly 51(9), 493–510 (1944)
Harrison, J.: Theorem Proving with the Real Numbers. Springer, Heidelberg (1998)
Harrison, J.: A HOL Theory of Euclidean Space. In: Hurd, J., Melham, T. (eds.) TPHOLs 2005. LNCS, vol. 3603, pp. 114–129. Springer, Heidelberg (2005)
Hasan, A., Tahar, S.: Formal Verification of Tail Distribution Bounds in the HOL Theorem Prover. Mathematical Methods in the Applied Sciences 32(4), 480–504 (2009)
Hurd, J.: Formal Verifcation of Probabilistic Algorithms. PhD thesis, University of Cambridge, UK (2002)
Lester, D.: Topology in PVS: Continuous Mathematics with Applications. In: workshop on Automated Formal Methods, pp. 11–20. ACM, New York (2007)
Mhamdi, T., Hasan, O., Tahar, S.: Formalization of the Lebesgue Integration Theory in HOL. Technical Report, ECE Dept., Concordia University (April 2009), http://hvg.ece.concordia.ca/Publications/TECH_REP/MLP_TR10/
Munkres, J.: Topology. Prentice Hall, Englewood Cliffs (1999)
Papoulis, A.: Probability, Random Variables, and Stochastic Processes. Mc-Graw Hill, New York (1984)
Richter, S.: Formalizing Integration Theory with an Application to Probabilistic Algorithms. In: Slind, K., Bunker, A., Gopalakrishnan, G.C. (eds.) TPHOLs 2004. LNCS, vol. 3223, pp. 271–286. Springer, Heidelberg (2004)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2010 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Mhamdi, T., Hasan, O., Tahar, S. (2010). On the Formalization of the Lebesgue Integration Theory in HOL. In: Kaufmann, M., Paulson, L.C. (eds) Interactive Theorem Proving. ITP 2010. Lecture Notes in Computer Science, vol 6172. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-14052-5_27
Download citation
DOI: https://doi.org/10.1007/978-3-642-14052-5_27
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-14051-8
Online ISBN: 978-3-642-14052-5
eBook Packages: Computer ScienceComputer Science (R0)