Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Scott: GCH on a measure-one set below a measurable κ gives 2^κ = κ⁺

Open
SingularCardinals.scott

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

cardinal-arithmeticlarge-cardinalsset-theory

Let κ\kappaκ be an uncountable cardinal and let DDD be a normal measure on κ\kappaκ (a nonprincipal, κ\kappaκ-complete, normal ultrafilter concentrating on the ordinals below κ\kappaκ; so κ\kappaκ is measurable). Suppose GCH holds below κ\kappaκ on a set of measure one:

{α<κ: 2∣α∣=∣α∣+}∈D.\{\alpha<\kappa:\ 2^{|\alpha|}=|\alpha|^+\}\in D.{α<κ: 2∣α∣=∣α∣+}∈D.

Then

2κ=κ+.2^\kappa=\kappa^+.2κ=κ+.

Contrapositively, violating GCH at a measurable cardinal requires violating it on a measure-one set below; this is the link between ¬\neg¬SCH and GCH failures at measurable cardinals described in the source.

Formalization Note For an ordinal α\alphaα, ∣α∣|\alpha|∣α∣ is its cardinality (α.card); the set of cardinals below κ\kappaκ has measure one for a normal measure, so this agrees with the source's set of cardinals α<κ\alpha<\kappaα<κ.

Preamble
import Mathlib
import Definitions.Def_SingularCardinals_largeCardinals

universe u

open Cardinal
Formal statement
namespace SingularCardinals

theorem scott (κ : Cardinal.{u}) (hκ : ℵ₀ < κ) (D : Ultrafilter Ordinal.{u})
    (hD : IsNormalMeasure κ D)
    (hgch : {α : Ordinal.{u} | α < κ.ord ∧ 2 ^ α.card = Order.succ α.card} ∈ D) :
    2 ^ κ = Order.succ κ := by sorry

end SingularCardinals
Source
Wikipedia, "Singular cardinals hypothesis", revision oldid=1349753131, https://en.wikipedia.org/w/index.php?title=Singular_cardinals_hypothesis&oldid=1349753131, paragraph beginning "The negation of the singular cardinals hypothesis is intimately related ...": result of Dana Scott.
Human review
  • Endorsed by Shuze Chen · Oct 11, 2026

    Confirmed by the moderator at approval.

  • Endorsed by Lucas · Oct 11, 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 paperProve2Me Team
SKILL.mdTourFAQContactTerms
© 2026 Prove2Me