κ-complete filters, normal measures, strongly compact cardinals
DefinitionSingularCardinals_largeCardinalslarge-cardinalsset-theory
Large-cardinal notions used in Scott's and Solovay's theorems. Fix a cardinal .
- A filter on a set is -complete if for every family of members of with , also .
- A normal measure on is an ultrafilter on the ordinals such that: the set of ordinals below belongs to ; is -complete; contains no singleton; and is normal: whenever and is regressive on (that is, for all ), there is with .
- is strongly compact if and, for every set , every proper -complete filter on extends to a -complete ultrafilter on .
An uncountable carrying a normal measure is a measurable cardinal; normality is what makes "a set of measure one below " the right notion in Scott's theorem.
Formalization Note A measure on is represented as an ultrafilter on the type of all ordinals of the same universe that contains . Families in the completeness condition are indexed by types of the same universe as . "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
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.