A formal proof of the independence of the continuum hypothesis

We describe a formal proof of the independence of the continuum hypothesis (CH) in the Lean theorem prover. We use Boolean-valued models to give forcing arguments for both directions, using Cohen forcing for the consistency of ¬ CH and a σ-closed forcing for the consistency of CH.

[1]  Russell O'Connor.  Essential Incompleteness of Arithmetic Verified by Coq , 2005, TPHOLs.

[2]  Stefan Berghofer.  First-Order Logic According to Fitting , 2007, Arch. Formal Proofs.

[3]  Tom Melham,et al.  Theorem Proving in Higher Order Logics, 18th International Conference, TPHOLs 2005, Oxford, UK, August 22-25, 2005, Proceedings , 2005, TPHOLs.

[4]  J. Paris,et al.  The Type Theoretic Interpretation of Constructive Set Theory , 1978 .

[5]  William B. Easton,et al.  Powers of regular cardinals , 1970 .

[6]  P. J. Cohen,et al.  THE INDEPENDENCE OF THE CONTINUUM HYPOTHESIS, II. , 1964, Proceedings of the National Academy of Sciences of the United States of America.

[7]  Yuri I. Manin,et al.  A Course in Mathematical Logic for Mathematicians , 2009 .

[8]  Justin Tatch Moore.  The method of forcing , 2019 .

[9]  K. Gödel.  The Consistency of the Axiom of Choice and of the Generalized Continuum-Hypothesis. , 1938, Proceedings of the National Academy of Sciences of the United States of America.

[10]  Tom Ridge,et al.  A Mechanically Verified, Sound and Complete Theorem Prover for First Order Logic , 2005, TPHOLs.

[11]  Donald A. Martin,et al.  Internal cohen extensions , 1970 .

[12]  Lawrence C. Paulson,et al.  The Reflection Theorem: A Study in Meta-theoretic Reasoning , 2002, CADE.

[13]  Peter Aczel,et al.  The Type Theoretic Interpretation of Constructive Set Theory: Inductive Definitions , 1986 .

[14]  Steven Givant,et al.  Introduction to Boolean Algebras , 2008 .

[15]  Sebastian Ullrich,et al.  Counting immutable beans: reference counting optimized for purely functional programming , 2019, IFL.

[16]  Lawrence C. Paulson,et al.  Mechanizing set theory , 1996, Journal of Automated Reasoning.

[17]  Floris van Doorn,et al.  A formalization of forcing and the unprovability of the continuum hypothesis , 2019, ITP.

[18]  John Harrison,et al.  Handbook of Practical Logic and Automated Reasoning , 2009 .

[19]  Emmanuel Gunther,et al.  First steps towards a formalization of Forcing , 2018, LSFA.

[20]  Dana S. Scott,et al.  A proof of the independence of the continuum hypothesis , 1967, Mathematical systems theory.

[21]  Lawrence C. Paulson,et al.  Set theory for verification: I. From foundations to functions , 1993, Journal of Automated Reasoning.

[22]  Jeremy Avigad,et al.  The Lean Theorem Prover (System Description) , 2015, CADE.

[23]  J. R. Buzeman.  Introduction To Boolean Algebras , 1961 .

[24]  Danko Ilik,et al.  Constructive Completeness Proofs and Delimited Control , 2010 .

[25]  P. Aczel.  The Type Theoretic Interpretation of Constructive Set Theory: Choice Principles , 1982 .

[26]  John Harrison,et al.  Formalizing Basic First Order Model Theory , 1998, TPHOLs.

[27]  Natarajan Shankar,et al.  Metamathematics, machines, and Gödels's proof , 1994, Cambridge tracts in theoretical computer science.

[28]  Thai Son Hoang,et al.  The Unit-B method: refinement guided by progress concerns , 2015, Software & Systems Modeling.

[29]  Joel David Hamkins,et al.  Well-founded Boolean ultrapowers as large cardinal embeddings , 2012 .

[30]  F. Hartogs,et al.  Über das Problem der Wohlordnung , 1915 .

[31]  Benjamin Werner,et al.  Sets in Types, Types in Sets , 1997, TACS.

[32]  C PaulsonLawrence.  Set theory for verification. I , 1993 .

[33]  Saharon Shelah,et al.  Infinite abelian groups, whitehead problem and some constructions , 1974 .

[34]  Lawrence C. Paulson,et al.  The Relative Consistency of the Axiom of Choice - Mechanized Using Isabelle/ZF , 2008, CiE.

[35]  F. Stephan,et al.  Set theory , 2018, Mathematical Statistics with Applications in R.

[36]  G. Cantor,et al.  Ein Beitrag zur Mannigfaltigkeitslehre. , 1878 .

[37]  The mathlib Community.  The lean mathematical library , 2020, CPP.

[38]  Jens Brandt,et al.  Theorem Proving in Higher Order Logics , 1997, Lecture Notes in Computer Science.

[39]  John L. Bell,et al.  Set Theory: Boolean-Valued Models and Independence Proofs , 2005 .

[40]  Jeremy Avigad,et al.  A metaprogramming framework for formal verification , 2017, Proc. ACM Program. Lang..

[41]  C. Luther,et al.  INDEPENDENCE OF THE CONTINUUM HYPOTHESIS , 2009 .

[42]  Emmanuel Gunther,et al.  Mechanization of Separation in Generic Extensions , 2019, ArXiv.

[43]  Anders Schlichtkrull,et al.  Formalization of Logic in the Isabelle Proof Assistant , 2018 .