Journal of Automated Reasoning

, Volume 60, Issue 2, pp 237–254 | Cite as

A Formalization of Metric Spaces in HOL Light

  • Marco Maggesi


We present a computer formalization of metric spaces in the HOL Light theorem prover. Basic results of the theory of complete metric spaces are provided, including the Banach Fixed-Point Theorem, the Baire Category Theorem and the completeness of the space of continuous bounded functions. A decision procedure for a fragment of the elementary theory of metric spaces is also implemented. As an application, the Picard–Lindelöf theorem on the existence of the solutions of ordinary differential equations is proved by using the well-known argument which appeals to the Banach theorem.


Formalization of mathematics Higher-Order Logic Metric spaces 


  1. 1.
    Harrison, J.: A HOL theory of Euclidean space. In: Hurd, J., Melham, T. (eds.), Theorem Proving in Higher Order Logics, 18th International Conference, TPHOLs 2005, volume 3603 of Lecture Notes in Computer Science, pp. 114–129, Springer, Oxford (August 2005)Google Scholar
  2. 2.
    Solovay, R.M., Arthan, R.D., Harrison, J.: Some new results on decidability for elementary algebra and geometry. Ann. Pure Appl. Log. 163(12), 1765–1802 (2012)MathSciNetCrossRefzbMATHGoogle Scholar
  3. 3.
    Carapelle, C.: La formalizzazione degli spazi metrici e teorema di punto fisso nella logica di ordine superiore. Master’s thesis, Corso di Laurea Specialistica in Matematica, Università degli Studi di Firenze (2011), pp. 79Google Scholar
  4. 4.
    The QED Manifesto. In: Proceedings of the 12th International Conference on Automated Deduction, CADE-12, pp. 238–251. Springer, London (1994)Google Scholar
  5. 5.
    de la Cruz, A.: Totally bounded metric spaces. J. Formaliz. Math. 2(4) (September–October 1991)Google Scholar
  6. 6.
    Farmer, W.M., Guttman, J.D., Thayer, F.J.: Little Theories, pp. 567–581. Springer, Berlin (1992)Google Scholar
  7. 7.
    Farmer, W.M., Guttman, J.D., Thayer, F.J.: IMPS: an interactive mathematical proof system. J. Autom. Reason. 11(2), 213–248 (1993)Google Scholar
  8. 8.
    Farmer, W.M., Thayer, F.J.: Two computer-supported proofs in metric space topology. Not. Am. Math. Soc. 38(9), 1133–1138 (1991)Google Scholar
  9. 9.
    Jones, C.: Completing the rationals and metric spaces in LEGO. In: Papers Presented at the Second Annual Workshop on Logical Environments, pp. 297–316. Cambridge University Press, New York (1993)Google Scholar
  10. 10.
    Madsen, J.: Proof of Banach Fixed-Point Theorem in Metamath. From the metamath website: (September 2009)
  11. 11.
    Immler, F., Hölzl, J.: Numerical analysis of ordinary differential equations in Isabelle/HOL. In: Beringer, L., Felty, A. (eds.) Interactive Theorem Proving volume 7406 of Lecture Notes in Computer Science, pp. 377–392. Springer, Berlin (2012)Google Scholar
  12. 12.
    Makarov, E., Spitters, B.: The Picard algorithm for ordinary differential equations in Coq. In: Blazy, S., Paulin-Mohring, C., Pichardie, D. (eds.) Interactive Theorem Proving Volume 7998 of Lecture Notes in Computer Science, pp. 463–468. Springer, Berlin (2013)Google Scholar
  13. 13.
    Earl, A.: Coddington and Norman Levinson. Theory of Ordinary Differential Equations. International Series in Pure and Applied Mathematics. McGraw-Hill, New York (1955)Google Scholar
  14. 14.
    Simmons, G.F.: Differential Equations: With Applications and Historical Notes. Tata McGraw-Hill, New York (1978)Google Scholar

Copyright information

© Springer Science+Business Media Dordrecht 2017

Authors and Affiliations

  1. 1.Dipartimento di Matematica e Informatica “Ulisse Dini”University of FlorenceFlorenceItaly

Personalised recommendations