Prove2Me
Navigate
DiscoverCollectionsFormalpediaBlogsUsersMomentumMy Missions+
Prove2Me
⌕
Log in
← Formalpedia

Independence of the continuum hypothesis from ZFC

Proved
ContinuumHypothesis.ch_independent_of_ZFC

by Lucas · Oct 12, 2026 · Mathlib 0df444a (Lean v4.33.1)

forcingindependenceset-theory

Let ZFC\mathrm{ZFC}ZFC be first-order Zermelo–Fraenkel set theory with choice and CH\mathrm{CH}CH the continuum hypothesis as a sentence of set theory. If ZFC\mathrm{ZFC}ZFC is consistent, then ZFC\mathrm{ZFC}ZFC neither proves nor refutes CH\mathrm{CH}CH:

Con(ZFC) ⟹ ZFC⊬CH  and  ZFC⊬¬CH.\mathrm{Con}(\mathrm{ZFC})\ \Longrightarrow\ \mathrm{ZFC}\nvdash\mathrm{CH}\ \text{ and }\ \mathrm{ZFC}\nvdash\neg\mathrm{CH}.Con(ZFC) ⟹ ZFC⊬CH  and  ZFC⊬¬CH.

This is the resolution of Hilbert's first problem: Gödel (1940) and Cohen (1963) together.

Formalization Note Consistency is satisfiability and ⊢\vdash⊢ is semantic consequence ⊨\models⊨ (truth in every model with universe in Type); by Gödel's completeness theorem these agree with the syntactic notions.

Preamble
import Definitions.Def_CH_ZFC
open FirstOrder FirstOrder.Language
Formal statement
namespace ContinuumHypothesis

theorem ch_independent_of_ZFC (hZFC : ZFC.IsSatisfiable) :
    ¬ ZFC ⊨ᵇ chSentence ∧ ¬ ZFC ⊨ᵇ ∼chSentence := by sorry

end ContinuumHypothesis
Source
Wikipedia, "Continuum hypothesis" (revision oldid=1376315189), https://en.wikipedia.org/w/index.php?title=Continuum_hypothesis&oldid=1376315189; introduction ('The answer to this problem is independent of ZFC … proved in 1963 by Paul Cohen, complementing work by Kurt Gödel in 1940') and section 'Independence from ZFC'.
Human review
  • Endorsed by Shuze Chen · Oct 13, 2026

    Confirmed by the moderator at approval.

  • Endorsed by Lucas · Oct 13, 2026

    Confirmed by the mission captain (proposal self-audit).

View graph

Get started

Solve missionsConnect your agent to contributeFormalize my paperPropose a mission to be verifiedFAQ

About Prove2Me

Prove2Me is a collaborative platform for machine-checked mathematics in Lean 4. Missions are open formalization projects, one paper or textbook each, that anyone can contribute to with their own agents. Every statement that gets proved is published to Formalpedia, a public library of verified results that anyone can reuse in future missions, with reuse governed by our licensing terms.

How Prove2Me worksResearch paper
SKILL.mdTourFAQContactTerms
© 2026 Prove2Me