Journal of Automated Reasoning

, Volume 59, Issue 4, pp 389–423 | Cite as

A Formally Verified Proof of the Central Limit Theorem

  • Jeremy AvigadEmail author
  • Johannes Hölzl
  • Luke Serafin


We describe a proof of the Central Limit Theorem that has been formally verified in the Isabelle proof assistant. Our formalization builds upon and extends Isabelle’s libraries for analysis and measure-theoretic probability. The proof of the theorem uses characteristic functions, which are a kind of Fourier transform, to demonstrate that, under suitable hypotheses, sums of random variables converge weakly to the standard normal distribution. We also discuss the libraries and infrastructure that supported the formalization, and reflect on some of the lessons we have learned from the effort.


Interactive theorem proving Measure theory Central limit theorem 



We are grateful to Tobias Nipkow, Lawrence Paulson, Makarius Wenzel, and the entire Isabelle team for the ongoing development of Isabelle. We are especially grateful to Tobias for steadfast encouragement and support. We thank our two anonymous referees for a very careful reading and helpful comments. Avigad and Serafin’s work has been partially supported by NSF Grant DMS-1068829, and Avigad’s work has been partially supported by AFOSR Grants FA9550-12-1-0370 and FA9550-15-1-0053. Hölzl’s work has been partially supported by DFG Projects Ni 491/15-1 and Ni 491/16-1.


  1. 1.
    Avigad, J., Hölzl, J., Serafin, L.: A formally verified proof of the central limit theorem (preliminary announcement) CoRR (2014).
  2. 2.
    Ballarin, C.: Interpretation of locales in Isabelle: theories and proof contexts. In: Borwein, J.M., Farmer, W.M. (eds.) Mathematical Knowledge Management 2006. Lecture Notes in Artificial Intelligence, pp. 31–43. Springer, Berlin (2006)CrossRefGoogle Scholar
  3. 3.
    Billingsley, P.: Probability and Measure. Wiley Series in Probability and Mathematical Statistics, A Wiley-Interscience Publication, 3rd edn. Wiley, New York (1995)Google Scholar
  4. 4.
    Boldo, S., Lelay, C., Melquiond, G.: Improving real analysis in coq: a user-friendly approach to integrals and derivatives. In: Hawblitzel, C., Miller, D. (eds.) Certified Programs and Proofs—-Second International Conference, CPP 2012, Kyoto, Japan, December 13–15, 2012. Proceedings, volume 7679 of Lecture Notes in Computer Science, pp. 289–304. Springer (2012)Google Scholar
  5. 5.
    Boldo, S., Lelay, C., Melquiond, G.: Formalization of real analysis: a survey of proof assistants and libraries. Math. Struct. Comput. Sci. 26(7), 1196–1233 (2016)CrossRefzbMATHMathSciNetGoogle Scholar
  6. 6.
    Church, A.: A formulation of the simple theory of types. J. Symb. Logic 5, 56–68 (1940)CrossRefzbMATHMathSciNetGoogle Scholar
  7. 7.
    Fischer, H.: A History of the Central Limit Theorem: From Classical to Modern Probability Theory. Springer, New York (2011)CrossRefzbMATHGoogle Scholar
  8. 8.
    Galton, F.: Natural Inheritance. Macmillan, London (1889)CrossRefGoogle Scholar
  9. 9.
    Gottliebsen, H.: Transcendental functions and continuity checking in PVS. In: Theorem Proving in Higher-Order Logics (TPHOLs) 2000, pp. 197–214. Springer, Berlin (2000)Google Scholar
  10. 10.
    Hales, T., Adams, M., Bauer, G., Dang, D.T., Harrison, J., Le Hoang, T., Kaliszyk, C., Magron, V., McLaughlin, S., Nguyen, T.T., Nguyen, T.Q., Nipkow, T., Obua, S., Pleso, J., Rute, J., Solovyev, A., Ta, A.H.T., Tran, T.N., Trieu, D.T., Urban, J., Vu, K.K., Zumkeller, R.: A formal proof of the Kepler conjecture. arXiv:1501.02155
  11. 11.
    Harrison, J: Formalizing basic complex analysis. In: Matuszewski, R., Zalewska, A. (eds.) From Insight to Proof: Festschrift in Honour of Andrzej Trybulec, volume 10(23) of Studies in Logic, Grammar and Rhetoric. University of Białystok, pp. 151–165 (2007)Google Scholar
  12. 12.
    Hölzl, J., Heller, A.: Three chapters of measure theory in Isabelle/HOL. In: van Eekelen, M.C.J.D., Geuvers, H., Schmaltz, J., Wiedijk, F. (eds.) Interactive Theorem Proving (ITP) 2011, volume 6898 of Lecture Notes in Computer Science. Springer, pp. 135–151 (2011)Google Scholar
  13. 13.
    Hölzl, J., Immler, F., Huffman, B.: Type classes and filters for mathematical analysis in Isabelle/HOL. In: Blazy, S., Paulin-Mohring, C., Pichardie, D. (eds.) Interactive Theorem Proving. Lecture Notes in Computer Science, vol. 7998, pp. 279–294. Springer, Berlin (2013)CrossRefGoogle Scholar
  14. 14.
    Immler, F., Traut, C.: The flow of odes. In: Blanchette, J.C., Merz, S. (eds.) Interactive Theorem Proving—7th International Conference, ITP 2016, Nancy, France, August 22-25, 2016, Proceedings, volume 9807 of Lecture Notes in Computer Science. Springer, pp. 184–199 (2016)Google Scholar
  15. 15.
    Krebbers, R., Spitters, B.: Type classes for efficient exact real arithmetic in coq. Log. Methods Comput. Sci. 9(1), 1–27 (2011)zbMATHMathSciNetGoogle Scholar
  16. 16.
    Mhamdi, T., Hasan, O., Tahar, S.: Formalization of entropy measures in HOL. In: van Eekelen, M.C.J.D., Geuvers, H., Schmaltz, J., Wiedijk, F. (eds.) Interactive Theorem Proving—Second International Conference, ITP 2011, Berg en Dal, The Netherlands, August 22–25, 2011. Proceedings, volume 6898 of Lecture Notes in Computer Science. Springer, pp. 233–248 (2011)Google Scholar
  17. 17.
    Nipkow, T., Paulson, L.C., Wenzel, M.: Isabelle/HOL. A proof assistant for higher-order logic, volume 2283 of Lecture Notes in Computer Science. Springer, Berlin (2002)Google Scholar
  18. 18.
    Paulson, L.C.: Three years of experience with sledgehammer, a practical link between automatic and interactive theorem provers. In: Schmidt, R.A., Schulz, S., Konev, B. (eds.) Proceedings of the 2nd Workshop on Practical Aspects of Automated Reasoning, PAAR-2010, Edinburgh, Scotland, UK, July 14, 2010, volume 9 of EPiC Series. EasyChair, pp. 1–10 (2010)Google Scholar
  19. 19.
    Qasim, M., Hasan, O., Elleuch, M., Tahar, S.: Formalization of normal random variables in HOL. In: Kohlhase, M., Johansson, M., Miller, B.R., de Moura, L., Tompa, F.W. (eds.) Intelligent Computer Mathematics—9th International Conference, CICM 2016, Bialystok, Poland, July 25–29, 2016, Proceedings, volume 9791 of Lecture Notes in Computer Science. Springer, pp. 44–59 (2016)Google Scholar
  20. 20.
    Serafin, L.: A formally verified proof of the Central Limit Theorem. Master’s thesis, Carnegie Mellon University (2015)Google Scholar
  21. 21.
    Wenzel, M.: Type classes and overloading in higher-order logic. In: Gunter, E., Felty, A. (eds.) Proceedings of the 10th International Conference on Theorem Proving in Higher Order Logics (TPHOLs’97), pp. 307–322. Murray Hill, New Jersey (1997)CrossRefGoogle Scholar
  22. 22.
    Wenzel, M.: Isabelle/Isar—a versatile environment for human-readable formal proof documents. Ph.D. thesis, Institut für Informatik, Technische Universität München (2002)Google Scholar

Copyright information

© Springer Science+Business Media Dordrecht 2017

Authors and Affiliations

  1. 1.Carnegie Mellon UniversityPittsburghUSA
  2. 2.Technische Universität MünchenMunichGermany

Personalised recommendations