Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

κ-complete filters, normal measures, strongly compact cardinals

Definition
SingularCardinals_largeCardinals

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

large-cardinalsset-theory

Large-cardinal notions used in Scott's and Solovay's theorems. Fix a cardinal κ\kappaκ.

  1. A filter FFF on a set XXX is κ\kappaκ-complete if for every family (Si)i∈I(S_i)_{i\in I}(Si​)i∈I​ of members of FFF with ∣I∣<κ|I|<\kappa∣I∣<κ, also ⋂i∈ISi∈F\bigcap_{i\in I}S_i\in F⋂i∈I​Si​∈F.
  2. A normal measure on κ\kappaκ is an ultrafilter DDD on the ordinals such that: the set of ordinals below κ\kappaκ belongs to DDD; DDD is κ\kappaκ-complete; DDD contains no singleton; and DDD is normal: whenever A∈DA\in DA∈D and fff is regressive on AAA (that is, f(α)<αf(\alpha)<\alphaf(α)<α for all α∈A\alpha\in Aα∈A), there is β\betaβ with {α:f(α)=β}∈D\{\alpha: f(\alpha)=\beta\}\in D{α:f(α)=β}∈D.
  3. κ\kappaκ is strongly compact if κ>ℵ0\kappa>\aleph_0κ>ℵ0​ and, for every set XXX, every proper κ\kappaκ-complete filter on XXX extends to a κ\kappaκ-complete ultrafilter on XXX.

An uncountable κ\kappaκ carrying a normal measure is a measurable cardinal; normality is what makes "a set of measure one below κ\kappaκ" the right notion in Scott's theorem.

Formalization Note A measure on κ\kappaκ is represented as an ultrafilter on the type of all ordinals of the same universe that contains {α:α<κ}\{\alpha:\alpha<\kappa\}{α:α<κ}. Families in the completeness condition are indexed by types of the same universe as κ\kappaκ. "Proper" means the filter is not the filter of all subsets (Filter.NeBot); without it no cardinal would be strongly compact.

Definition code
import Mathlib

universe u v

namespace SingularCardinals

open Cardinal

/-- A filter `F` is `κ`-complete if it is closed under intersections of fewer than `κ`
of its members. -/
def IsComplete (κ : Cardinal.{u}) {X : Type v} (F : Filter X) : Prop :=
  ∀ (ι : Type u) (s : ι → Set X), #ι < κ → (∀ i, s i ∈ F) → (⋂ i, s i) ∈ F

/-- `D` is a normal measure on `κ`: an ultrafilter on the ordinals that concentrates on the
ordinals below `κ`, is `κ`-complete and nonprincipal, and is normal (every function that is
regressive on a set in `D` is constant on a set in `D`). -/
structure IsNormalMeasure (κ : Cardinal.{u}) (D : Ultrafilter Ordinal.{u}) : Prop where
  Iio_mem : Set.Iio κ.ord ∈ D
  complete : IsComplete κ (D : Filter Ordinal.{u})
  nonprincipal : ∀ α : Ordinal.{u}, ({α} : Set Ordinal.{u}) ∉ D
  normal : ∀ A ∈ D, ∀ f : Ordinal.{u} → Ordinal.{u}, (∀ α ∈ A, f α < α) →
    ∃ β : Ordinal.{u}, {α | f α = β} ∈ D

/-- `κ` is strongly compact if it is uncountable and every proper `κ`-complete filter on any
set extends to a `κ`-complete ultrafilter. -/
def IsStronglyCompact (κ : Cardinal.{u}) : Prop :=
  ℵ₀ < κ ∧ ∀ (X : Type u) (F : Filter X), F.NeBot → IsComplete κ F →
    ∃ U : Ultrafilter X, IsComplete κ (U : Filter X) ∧ (U : Filter X) ≤ F

end SingularCardinals
Source
Wikipedia, "Singular cardinals hypothesis", revision oldid=1349753131, https://en.wikipedia.org/w/index.php?title=Singular_cardinals_hypothesis&oldid=1349753131, paragraphs on Scott's theorem and on Solovay's theorem (standard definitions of normal measure and strongly compact cardinal as in Jech, Set Theory, 3rd ed., Ch. 10 and Ch. 20).
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