Ω-logic III: Woodin cardinals and proper classes of large cardinals
DefinitionOmegaLogic_LargeCardinalsLarge-cardinal hypotheses used in Ω-logic. The universe of sets is ZFSet.{u}, and an ordinal is identified with the von Neumann ordinal β.toZFSet.
Elementary embeddings. IsElementaryEmbedding j N says that is a transitive class, that , and that for every formula of set theory and all sets ,
IsCriticalPoint j κ says that for all ordinals and .
Woodin cardinals (primer, Definition 1.5). IsWoodin δ says that is a cardinal and that for every function , given as a set of ordered pairs, there is with and an elementary embedding with critical point such that
ProperClassWoodin says that the Woodin cardinals are unbounded in the ordinals. ProperClassInaccessible says the same of the strongly inaccessible cardinals.
Classes, such as and , are arbitrary Lean functions and predicates on ZFSet. For Woodin cardinals this is equivalent to the first-order definition by extenders.
import Definitions.Def_OmegaLogic_Semantics
/-!
# Ω-logic, part 3: Woodin cardinals
* `OmegaLogic.IsElementaryEmbedding j N` : `j : V → N` is an elementary embedding of the
universe into a transitive class `N`.
* `OmegaLogic.IsWoodin δ` : `δ` is a Woodin cardinal.
* `OmegaLogic.ProperClassWoodin`, `OmegaLogic.ProperClassInaccessible`.
Here the universe of sets `V` is `ZFSet.{u}` and ordinals are `Ordinal.{u}`, identified with
von Neumann ordinals via `Ordinal.toZFSet`.
Source: Bagaria–Castells–Larson, *An Ω-logic primer*, Definition 1.5.
-/
namespace OmegaLogic
universe u
open ZFSet
/-- `j : V → N` is an elementary embedding of the universe `V` into the transitive class
`N ⊆ V`: `j` maps into `N` and for every formula `φ(x₀,…,x_{k-1})` of set theory and all sets
`a₀,…,a_{k-1}`, `V ⊨ φ(a⃗)` iff `N ⊨ φ(j(a⃗))`. -/
def IsElementaryEmbedding (j : ZFSet.{u} → ZFSet.{u}) (N : Set ZFSet.{u}) : Prop :=
(∀ x ∈ N, ∀ y ∈ x, y ∈ N) ∧ (∀ x, j x ∈ N) ∧
∀ (k : ℕ) (φ : setLang.Formula (Fin k)) (a : Fin k → (Set.univ : Set ZFSet.{u}))
(b : Fin k → N), (∀ i, (b i).1 = j (a i).1) → (φ.Realize a ↔ φ.Realize b)
/-- `κ` is the critical point of `j`: `j` fixes every ordinal below `κ` and moves `κ`. -/
def IsCriticalPoint (j : ZFSet.{u} → ZFSet.{u}) (κ : Ordinal.{u}) : Prop :=
(∀ β < κ, j β.toZFSet = β.toZFSet) ∧ j κ.toZFSet ≠ κ.toZFSet
/-- **Woodin cardinal** (primer, Definition 1.5): `δ` is a cardinal and for every function
`f : δ → δ` there is `κ < δ` with `f[κ] ⊆ κ` and an elementary embedding `j : V → N` with
critical point `κ` such that `V_{j(f)(κ)} ⊆ N`. -/
def IsWoodin (δ : Ordinal.{u}) : Prop :=
δ.card.ord = δ ∧
∀ f : ZFSet.{u}, IsFunc δ.toZFSet δ.toZFSet f →
∃ κ < δ, (∀ β < κ, ∀ y, pair β.toZFSet y ∈ f → y ∈ κ.toZFSet) ∧
∃ (j : ZFSet.{u} → ZFSet.{u}) (N : Set ZFSet.{u}),
IsElementaryEmbedding j N ∧ IsCriticalPoint j κ ∧
∃ y, pair κ.toZFSet y ∈ j f ∧ ∀ x : ZFSet.{u}, x.rank < y.rank → x ∈ N
/-- There is a proper class of Woodin cardinals. -/
def ProperClassWoodin : Prop := ∀ γ : Ordinal.{u}, ∃ δ, γ < δ ∧ IsWoodin δ
/-- There is a proper class of strongly inaccessible cardinals. -/
def ProperClassInaccessible : Prop :=
∀ γ : Ordinal.{u}, ∃ κ : Cardinal.{u}, γ < κ.ord ∧ κ.IsInaccessible
end OmegaLogic