On Woodins HOD Conjecture, large cardinals beyond Choice, and class - - PowerPoint PPT Presentation

on woodin s hod conjecture large cardinals beyond choice
SMART_READER_LITE
LIVE PREVIEW

On Woodins HOD Conjecture, large cardinals beyond Choice, and class - - PowerPoint PPT Presentation

On Woodins HOD Conjecture, large cardinals beyond Choice, and class forcing Joan Bagaria 12th Panhellenic Logic Symposium June 26-30, 2019 Anogeia, Crete, Greece Jensens L Dichotomy theorem Theorem (Jensen, 1975) Either V is close to L


slide-1
SLIDE 1

On Woodin’s HOD Conjecture, large cardinals beyond Choice, and class forcing

Joan Bagaria 12th Panhellenic Logic Symposium June 26-30, 2019 Anogeia, Crete, Greece

slide-2
SLIDE 2

Jensen’s L Dichotomy theorem

Theorem (Jensen, 1975)

Either V is close to L or is far from it.

slide-3
SLIDE 3

Jensen’s L Dichotomy theorem

Theorem (Jensen, 1975)

Either V is close to L or is far from it. Namely, either

  • 1. every singular cardinal λ is singular in L, and (λ+)L = λ+, or
slide-4
SLIDE 4

Jensen’s L Dichotomy theorem

Theorem (Jensen, 1975)

Either V is close to L or is far from it. Namely, either

  • 1. every singular cardinal λ is singular in L, and (λ+)L = λ+, or
  • 2. every uncountable cardinal is inaccessible in L.
slide-5
SLIDE 5

Jensen’s L Dichotomy theorem

Theorem (Jensen, 1975)

Either V is close to L or is far from it. Namely, either

  • 1. every singular cardinal λ is singular in L, and (λ+)L = λ+, or
  • 2. every uncountable cardinal is inaccessible in L.

The L-Dichotomy is resolved by large cardinals (e.g., the existence

  • f a measurable cardinal) imply that the second alternative, in

which L is far from V, is the true one.

slide-6
SLIDE 6

Woodin’s HOD Dichotomy theorem

Theorem (Woodin 20101)

If there exists an extendible cardinal, then either V is close to HOD

  • r is far from it.

1Suitable extender models I, JML 2010.

slide-7
SLIDE 7

Woodin’s HOD Dichotomy theorem

Theorem (Woodin 20101)

If there exists an extendible cardinal, then either V is close to HOD

  • r is far from it. Namely, if κ is an extendible cardinal, then either
  • 1. every singular cardinal λ > κ is singular in HOD and

(λ+)HOD = λ+, or

1Suitable extender models I, JML 2010.

slide-8
SLIDE 8

Woodin’s HOD Dichotomy theorem

Theorem (Woodin 20101)

If there exists an extendible cardinal, then either V is close to HOD

  • r is far from it. Namely, if κ is an extendible cardinal, then either
  • 1. every singular cardinal λ > κ is singular in HOD and

(λ+)HOD = λ+, or

  • 2. every regular cardinal λ κ is measurable in HOD.

1Suitable extender models I, JML 2010.

slide-9
SLIDE 9

Woodin’s HOD Dichotomy theorem

Theorem (Woodin 20102)

If there exists an extendible cardinal, then either V is close to HOD

  • r is far from it. Namely, if κ is an extendible cardinal, then either
  • 1. every singular cardinal λ > κ is singular in HOD and

(λ+)HOD = λ+, or

  • 2. every regular cardinal λ κ is ω-strongly measurable in HOD.

2Suitable extender models I, JML 2010.

slide-10
SLIDE 10

In the case of the HOD-Dichotomy, it is not known if any large cardinal axiom (consistent with ZFC) may imply the second alternative.

slide-11
SLIDE 11

In the case of the HOD-Dichotomy, it is not known if any large cardinal axiom (consistent with ZFC) may imply the second alternative. Moreover, the development of the inner model program for a supercompact cardinal, as carried out by Woodin, provides strong evidence for the first alternative of the Dichotomy.

slide-12
SLIDE 12

The HOD Conjecture

Woodin’s HOD Conjecture

The theory ZFC + “There exists an extendible cardinal” proves that there is a proper class of regular cardinals which are not ω-strongly measurable in HOD (hence the first alternative of the HOD Dichotomy holds, i.e., V is close to HOD).

slide-13
SLIDE 13

Structural Reflection

A class of structures C (of the same kind) is given by some formula ϕ(x), which may contain set parameters, so that C = {A : ϕ(A)}.

slide-14
SLIDE 14

Structural Reflection

A class of structures C (of the same kind) is given by some formula ϕ(x), which may contain set parameters, so that C = {A : ϕ(A)}.

Structural Reflection

SR(C): There exists a cardinal κ that reflects C, i.e., for every A in C there exist B in C ∩ Vκ and an elementary embedding from B into A.

slide-15
SLIDE 15

Structural Reflection

A class of structures C (of the same kind) is given by some formula ϕ(x), which may contain set parameters, so that C = {A : ϕ(A)}.

Structural Reflection

SR(C): There exists a cardinal κ that reflects C, i.e., for every A in C there exist B in C ∩ Vκ and an elementary embedding from B into A.

Theorem

SR(Σ1) holds, i.e., SR(C) holds for every Σ1 definable class C.

slide-16
SLIDE 16

Structural Reflection

Theorem (Magidor 1970)

The following are equivalent:

  • 1. SR(Π1)
  • 2. SR(Σ2)
  • 3. There exists a supercompact cardinal.
slide-17
SLIDE 17

Structural Reflection

Theorem (Magidor 1970)

The following are equivalent:

  • 1. SR(Π1)
  • 2. SR(Σ2)
  • 3. There exists a supercompact cardinal.

Theorem

  • 1. SR(Π2)
  • 2. SR(Σ3)
  • 3. There exists an extendible cardinal.
slide-18
SLIDE 18

SR and the L-Dichotomy

Let C be the Π1 definable (without parameters) class of structures

  • f the form Lβ, ∈, γ, where γ and β are cardinals (in V) and

γ < β.

slide-19
SLIDE 19

SR and the L-Dichotomy

Let C be the Π1 definable (without parameters) class of structures

  • f the form Lβ, ∈, γ, where γ and β are cardinals (in V) and

γ < β.

Theorem

The following are equivalent:

  • 1. SR(C)
slide-20
SLIDE 20

SR and the L-Dichotomy

Let C be the Π1 definable (without parameters) class of structures

  • f the form Lβ, ∈, γ, where γ and β are cardinals (in V) and

γ < β.

Theorem

The following are equivalent:

  • 1. SR(C)
  • 2. 0♯ exists (i.e., there exists a non-trivial elementary embedding

j : L → L).

slide-21
SLIDE 21

SR and the L-Dichotomy

Let C be the Π1 definable (without parameters) class of structures

  • f the form Lβ, ∈, γ, where γ and β are cardinals (in V) and

γ < β.

Theorem

The following are equivalent:

  • 1. SR(C)
  • 2. 0♯ exists (i.e., there exists a non-trivial elementary embedding

j : L → L).

  • 3. The second alternative of the L-Dichotomy holds.
slide-22
SLIDE 22

SR and the L-Dichotomy

Let C be the Π1 definable (without parameters) class of structures

  • f the form Lβ, ∈, γ, where γ and β are cardinals (in V) and

γ < β.

Theorem

The following are equivalent:

  • 1. SR(C)
  • 2. 0♯ exists (i.e., there exists a non-trivial elementary embedding

j : L → L).

  • 3. The second alternative of the L-Dichotomy holds.

In the case of the HOD-Dichotomy the situation is completely different.

slide-23
SLIDE 23

SR and the HOD-Dichotomy

Definition (Woodin 2010)

A transitive class model N of ZFC is a weak extender model for the supercompactness of κ if for every γ > κ there exists a normal fine measure U on Pκ(γ) such that

  • 1. N ∩ Pκ(γ) ∈ U, and
  • 2. U ∩ N ∈ N.
slide-24
SLIDE 24

SR and the HOD-Dichotomy

Definition (Woodin 2010)

A transitive class model N of ZFC is a weak extender model for the supercompactness of κ if for every γ > κ there exists a normal fine measure U on Pκ(γ) such that

  • 1. N ∩ Pκ(γ) ∈ U, and
  • 2. U ∩ N ∈ N.

Theorem (Woodin 2010)

Suppose that κ is an extendible cardinal. Then the following are equivalent.

  • 1. The first alternative of the HOD-Dichotomy holds.
  • 2. There is a weak extender model N for the supercompactness
  • f κ such that N ⊆ HOD.
  • 3. HOD is a weak extender model for the supercompactness of κ.
slide-25
SLIDE 25

SR and the HOD-Dichotomy

In analogy with the L case, in which SR(C), for a particular Π1-definable class C of structures in L, yields the second alternative

  • f the L-Dichotomy (i.e., L is far from V), one would expect,

assuming the existence of an extendible cardinal, that SR(C), for Π1-definable clases C of structures in N, would fail strongly for any weak extender model N for a supercompact.

slide-26
SLIDE 26

SR and the HOD-Dichotomy

In analogy with the L case, in which SR(C), for a particular Π1-definable class C of structures in L, yields the second alternative

  • f the L-Dichotomy (i.e., L is far from V), one would expect,

assuming the existence of an extendible cardinal, that SR(C), for Π1-definable clases C of structures in N, would fail strongly for any weak extender model N for a supercompact. But just the opposite holds:

Theorem

  • 1. If N is a weak extender model for δ supercompact, then SR(C)

holds for every Σ2-definable class C of structures in N.

slide-27
SLIDE 27

SR and the HOD-Dichotomy

In analogy with the L case, in which SR(C), for a particular Π1-definable class C of structures in L, yields the second alternative

  • f the L-Dichotomy (i.e., L is far from V), one would expect,

assuming the existence of an extendible cardinal, that SR(C), for Π1-definable clases C of structures in N, would fail strongly for any weak extender model N for a supercompact. But just the opposite holds:

Theorem

  • 1. If N is a weak extender model for δ supercompact, then SR(C)

holds for every Σ2-definable class C of structures in N.

  • 2. If there exists a supercompact cardinal, then SR(C) holds for

every Σ2-definable class C of structures in HOD.

slide-28
SLIDE 28

Transcendence over HOD

By Woodin’s Universality Theorem, all known large cardinals consistent with ZFC are consistent with the first alternative of the HOD Dichotomy.

slide-29
SLIDE 29

Transcendence over HOD

By Woodin’s Universality Theorem, all known large cardinals consistent with ZFC are consistent with the first alternative of the HOD Dichotomy.

Question

Is there any (natural) SR principle or, more generally, any large cardinal principle that would yield the second alternative to the HOD Dichotomy?

slide-30
SLIDE 30

Large cardinals beyond Choice

Definition

A cardinal δ is a Berkeley cardinal if for every transitive set M such that δ ∈ M and every η < δ there exists an elementary embedding j : M → M with η < crit(j) < δ.

slide-31
SLIDE 31

Large cardinals beyond Choice

Definition

A cardinal δ is a Berkeley cardinal if for every transitive set M such that δ ∈ M and every η < δ there exists an elementary embedding j : M → M with η < crit(j) < δ. Berkeley cardinals contradict the Axiom of Choice. Moreover, if δ0 is the least Berkeley cardinal, then there exists γ < δ0 such that Vγ | = ZF + “There exists a Reinhardt cardinal ”

slide-32
SLIDE 32

The HOD Conjecture and Berkeley cardinals

Using some results from Woodin (2010) we showed the following:

Theorem (B.-Koellner-Woodin, 20183)

(ZF) If the HOD Conjecture holds, then there are no Berkeley cardinals.

3Large Cardinals Beyond Choice. To appear

slide-33
SLIDE 33

The HOD Conjecture and Berkeley cardinals

Using some results from Woodin (2010) we showed the following:

Theorem (B.-Koellner-Woodin, 20183)

(ZF) If the HOD Conjecture holds, then there are no Berkeley cardinals. This points to a possible candidate for a large-cardinal principle compatible with ZFC that would yield the second alternative of the HOD Dichotomy.

3Large Cardinals Beyond Choice. To appear

slide-34
SLIDE 34

N-Berkeley cardinals

Let N be an inner model of ZFC.

slide-35
SLIDE 35

N-Berkeley cardinals

Let N be an inner model of ZFC.

Definition

A cardinal δ is an N-Berkeley cardinal if for every transitive set M ∈ N such that δ ∈ M and every η < δ there exists an elementary embedding j : M → M with η < crit(j) < δ.

slide-36
SLIDE 36

N-Berkeley cardinals

Let N be an inner model of ZFC.

Definition

A cardinal δ is an N-Berkeley cardinal if for every transitive set M ∈ N such that δ ∈ M and every η < δ there exists an elementary embedding j : M → M with η < crit(j) < δ. When N = L, the existence of an N-Berkeley cardinal is equivalent to the existence of 0♯.

slide-37
SLIDE 37

N-Berkeley cardinals

Let N be an inner model of ZFC.

Definition

A cardinal δ is an N-Berkeley cardinal if for every transitive set M ∈ N such that δ ∈ M and every η < δ there exists an elementary embedding j : M → M with η < crit(j) < δ. When N = L, the existence of an N-Berkeley cardinal is equivalent to the existence of 0♯. What about when N = HOD?

slide-38
SLIDE 38

HOD-Berkeley cardinals

Theorem (Woodin)

Assume ZFC and that there exists an extendible cardinal. If there exists a HOD-Berkeley cardinal, then the second alternative of the HOD Dichotomy holds, hence HOD is far from V.

slide-39
SLIDE 39

The HOD Conjecture and class forcing

slide-40
SLIDE 40

Large cardinals are preserved by small forcing

Theorem (Levy-Solovay 1967)

All usual large cardinals are preserved by small (i.e., of size less than the cardinal) forcing notions. E.g., inaccessible, measurable, supercompact, etc.

slide-41
SLIDE 41

Large cardinals are destroyed by big forcing

Any uncountable cardinal can be easily destroyed by some big forcing notion, e.g., by collapsing it.

slide-42
SLIDE 42

Large cardinals are destroyed by big forcing

Any uncountable cardinal can be easily destroyed by some big forcing notion, e.g., by collapsing it. And the inaccessibility of any given cardinal κ can be easily destroyed without collapsing any cardinals, e.g., by adding κ-many subsets of ω.

slide-43
SLIDE 43

Large cardinals are destroyed by big forcing

Any uncountable cardinal can be easily destroyed by some big forcing notion, e.g., by collapsing it. And the inaccessibility of any given cardinal κ can be easily destroyed without collapsing any cardinals, e.g., by adding κ-many subsets of ω. So, the general question is: What (big) forcing notions do preserve large cardinals?

slide-44
SLIDE 44

Large cardinals are destroyed by big forcing

Any uncountable cardinal can be easily destroyed by some big forcing notion, e.g., by collapsing it. And the inaccessibility of any given cardinal κ can be easily destroyed without collapsing any cardinals, e.g., by adding κ-many subsets of ω. So, the general question is: What (big) forcing notions do preserve large cardinals? For instance, does blowing up the power-set of κ preserve the large cardinal properties of κ?

slide-45
SLIDE 45

Making a large cardinal indestructible

If the GCH holds below a measurable cardinal κ, then the standard forcing P that adds κ++-many subsets of κ destroys the measurability of κ.

slide-46
SLIDE 46

Making a large cardinal indestructible

If the GCH holds below a measurable cardinal κ, then the standard forcing P that adds κ++-many subsets of κ destroys the measurability of κ. The forcing P is < κ-directed closed.

slide-47
SLIDE 47

Making a large cardinal indestructible

If the GCH holds below a measurable cardinal κ, then the standard forcing P that adds κ++-many subsets of κ destroys the measurability of κ. The forcing P is < κ-directed closed. Richard Laver (1978): If κ is a supercompact cardinal, then there is a forcing notion (the Laver preparation) that preserves the supercompactness of κ and makes it indestructible under further < κ-directed closed forcing.

slide-48
SLIDE 48

Preserving Σ3-correct cardinals

If κ is supercompact, then Vκ Σ2 V. Hence, after the Laver preparation forcing, V[G]κ Σ2 V[G] for every V-generic filter G ⊆ P, whenever P is < κ-directed closed.

slide-49
SLIDE 49

Preserving Σ3-correct cardinals

If κ is supercompact, then Vκ Σ2 V. Hence, after the Laver preparation forcing, V[G]κ Σ2 V[G] for every V-generic filter G ⊆ P, whenever P is < κ-directed closed. However, a similar Laver-indestructibility result for Σ3-correct cardinals, and in particular for extendible cardinals, is not possible.

slide-50
SLIDE 50

Theorem (B-Hamkins-Tsaprounis-Usuba 2015)

Suppose that Vκ ≺Σ2 Vλ and G ⊆ P is a V-generic filter for nontrivial strategically <κ-closed forcing P ∈ Vη, where η λ . Then for every θ η, Vκ = V[G]κ ⊀Σ3 V[G]θ.

slide-51
SLIDE 51

Theorem (B-Hamkins-Tsaprounis-Usuba 2015)

Suppose that Vκ ≺Σ2 Vλ and G ⊆ P is a V-generic filter for nontrivial strategically <κ-closed forcing P ∈ Vη, where η λ . Then for every θ η, Vκ = V[G]κ ⊀Σ3 V[G]θ. In particular, every extendible cardinal κ is destroyed by any nontrivial strategically <κ-closed set forcing.

slide-52
SLIDE 52

Theorem (B-Hamkins-Tsaprounis-Usuba 2015)

Suppose that Vκ ≺Σ2 Vλ and G ⊆ P is a V-generic filter for nontrivial strategically <κ-closed forcing P ∈ Vη, where η λ . Then for every θ η, Vκ = V[G]κ ⊀Σ3 V[G]θ. In particular, every extendible cardinal κ is destroyed by any nontrivial strategically <κ-closed set forcing. However, extendible cardinals, and even stronger large cardinal principles, implying Σn-correctness, n 3, are preserved by suitable class-forcing iterations.

slide-53
SLIDE 53

C(n)-extendible cardinals

For each n < ω, let C(n) be the Πn-definable closed unbounded proper class of ordinals α that are Σn-correct, i.e., such that Vα Σn V.

slide-54
SLIDE 54

C(n)-extendible cardinals

For each n < ω, let C(n) be the Πn-definable closed unbounded proper class of ordinals α that are Σn-correct, i.e., such that Vα Σn V.

Definition

A cardinal κ is C(n)-extendible (for n 1) if for every λ > κ there exists an elementary embedding j : Vλ → Vµ, some µ, with critical point κ, j(κ) > λ, and j(κ) ∈ C(n).

slide-55
SLIDE 55

C(n)-extendible cardinals

For each n < ω, let C(n) be the Πn-definable closed unbounded proper class of ordinals α that are Σn-correct, i.e., such that Vα Σn V.

Definition

A cardinal κ is C(n)-extendible (for n 1) if for every λ > κ there exists an elementary embedding j : Vλ → Vµ, some µ, with critical point κ, j(κ) > λ, and j(κ) ∈ C(n). A cardinal κ is extendible iff it is C(1)-extendible.

slide-56
SLIDE 56

C(n)-extendible cardinals and Vopěnka’s Principle

Recall that Vopěnka’s Principle (VP) is the schema asserting that for every (definable) proper class of structures of the same type there exist distinct A and B in the class with an elementary embedding j : A → B.

slide-57
SLIDE 57

C(n)-extendible cardinals and Vopěnka’s Principle

Recall that Vopěnka’s Principle (VP) is the schema asserting that for every (definable) proper class of structures of the same type there exist distinct A and B in the class with an elementary embedding j : A → B.

Theorem (B. 2012)

VP(Πn+1), namely VP restricted to classes of structures that are Πn+1-definable, is equivalent to the existence of a C(n)-extendible

  • cardinal. Hence VP is equivalent to the existence of a

C(n)-extendible cardinal for each n 1.

slide-58
SLIDE 58

C(n)-extendible cardinals and Vopěnka’s Principle

Recall that Vopěnka’s Principle (VP) is the schema asserting that for every (definable) proper class of structures of the same type there exist distinct A and B in the class with an elementary embedding j : A → B.

Theorem (B. 2012)

VP(Πn+1), namely VP restricted to classes of structures that are Πn+1-definable, is equivalent to the existence of a C(n)-extendible

  • cardinal. Hence VP is equivalent to the existence of a

C(n)-extendible cardinal for each n 1. Brooke-Taylor (2011) shows that VP is indestructible under ORD-length iterations with Easton support of increasingly directed-closed forcing notions (without the need of any preparatory forcing!).

slide-59
SLIDE 59

Preserving C(n)-extendible cardinals under class forcing

Question

What ORD-length forcing iterations preserve extendible and C(n)-extendible cardinals?

slide-60
SLIDE 60

Preserving C(n)-extendible cardinals under class forcing

Question

What ORD-length forcing iterations preserve extendible and C(n)-extendible cardinals? The problem is how to lift (a proper class of) elementary embeddings of the form j : Vλ → Vµ witnessing the C(n)-extendibility of crit(j), to j : Vλ[Gλ] → Vµ[Gµ] where G is P-generic over V.

slide-61
SLIDE 61

Magidor’s characterization of supercompact cardinals

Theorem (Magidor 1971)

For a cardinal δ, the following statements are equivalent:

  • 1. δ is a supercompact cardinal.
  • 2. For every λ > δ in C(1) and for every a ∈ Vλ, there exist
  • rdinals ¯

δ < ¯ λ < δ and there exist some ¯ a ∈ V¯

λ and an

elementary embedding j : V¯

λ −

→ Vλ such that:

◮ cp(j) = ¯

δ and j(¯ δ) = δ.

◮ j(¯

a) = a.

◮ ¯

λ ∈ C(1).

slide-62
SLIDE 62

Σn-supercompact cardinals

Definition

If λ > δ is in C(n), then we say that δ is λ-Σn-supercompact if for every a ∈ Vλ, there exist ¯ δ < ¯ λ < δ and ¯ a ∈ V¯

λ, and there exists

elementary embedding j : V¯

λ −

→ Vλ such that:

◮ cp(j) = ¯

δ and j(¯ δ) = δ.

◮ j(¯

a) = a.

◮ ¯

λ ∈ C(n). We say that δ is Σn−supercompact if it is λ-Σn-supercompact for every λ > δ in C(n).

slide-63
SLIDE 63

Theorem (Poveda 2018, Boney 2018)

A cardinal δ is Σn+1-supercompact if and only if it is C(n)-extendible.

slide-64
SLIDE 64

Theorem (Poveda 2018, Boney 2018)

A cardinal δ is Σn+1-supercompact if and only if it is C(n)-extendible. In particular, a cardinal is extendible if and only if it is Σ2-supercompact.

slide-65
SLIDE 65

Lifting λ-Σn-supercompact embeddings

In a recent joint work with A. Poveda we make use of this characterization of C(n)-extendibility to show that many ORD-length forcing iterations P preserve C(n)-extendible cardinals.

slide-66
SLIDE 66

Lifting λ-Σn-supercompact embeddings

In a recent joint work with A. Poveda we make use of this characterization of C(n)-extendibility to show that many ORD-length forcing iterations P preserve C(n)-extendible cardinals. For this, one lifts ground model embeddings j : V¯

λ −

→ Vλ witnessing the λ-Σn+1-supercompactness of δ to embeddings j : V[G]¯

λ −

→ V[G]λ verifying in V[G] the same property.

slide-67
SLIDE 67

Lifting λ-Σn-supercompact embeddings

In a recent joint work with A. Poveda we make use of this characterization of C(n)-extendibility to show that many ORD-length forcing iterations P preserve C(n)-extendible cardinals. For this, one lifts ground model embeddings j : V¯

λ −

→ Vλ witnessing the λ-Σn+1-supercompactness of δ to embeddings j : V[G]¯

λ −

→ V[G]λ verifying in V[G] the same property. Key point: The cardinals λ for which this will be possible need to be sufficiently correct.

slide-68
SLIDE 68

P-reflecting cardinals

Let P be an ORD-length iteration.

slide-69
SLIDE 69

P-reflecting cardinals

Let P be an ORD-length iteration. Let us call a cardinal λ is P-reflecting if P forces that V[ ˙ G]λ ⊆ Vλ[ ˙ Gλ]. (Hence, if G is P-generic over V, then V[G]λ = Vλ[Gλ].)

slide-70
SLIDE 70

P-reflecting cardinals

Let P be an ORD-length iteration. Let us call a cardinal λ is P-reflecting if P forces that V[ ˙ G]λ ⊆ Vλ[ ˙ Gλ]. (Hence, if G is P-generic over V, then V[G]λ = Vλ[Gλ].) A second reflection property of λ that will be required in our arguments is that Vλ, ∈, P ∩ Vλ ≺Σk V, ∈, P for some big-enough k.

slide-71
SLIDE 71

P-reflecting cardinals

Let P be an ORD-length iteration. Let us call a cardinal λ is P-reflecting if P forces that V[ ˙ G]λ ⊆ Vλ[ ˙ Gλ]. (Hence, if G is P-generic over V, then V[G]λ = Vλ[Gλ].) A second reflection property of λ that will be required in our arguments is that Vλ, ∈, P ∩ Vλ ≺Σk V, ∈, P for some big-enough k. Let C(k)

P

be the closed and unbounded class of such cardinals λ.

slide-72
SLIDE 72

A key lemma

The following is a key lemma:

Lemma

Suppose P is a definable iteration. If κ is a P-reflecting cardinal in C(k)

P

, then P forces V[ ˙ G]κ ≺Σk V[ ˙ G].

slide-73
SLIDE 73

A key lemma

The following is a key lemma:

Lemma

Suppose P is a definable iteration. If κ is a P-reflecting cardinal in C(k)

P

, then P forces V[ ˙ G]κ ≺Σk V[ ˙ G]. Thus, we give such cardinals a name:

Definition

A cardinal κ is P-Σk-reflecting if it is P-reflecting and belongs to C(k)

P

.

slide-74
SLIDE 74

P-Σn-supercompactness

Definition (B.-Poveda 2018)

If P is a definable iteration, then we say that a cardinal δ is P-Σn-supercompact if there exists a proper class of P-Σn-reflecting cardinals, and for every such cardinal λ > δ and every a ∈ Vλ there exist ¯ δ < ¯ λ < δ and ¯ a ∈ V¯

λ, and there exists an elementary

embedding j : V¯

λ −

→ Vλ such that:

◮ cp(j) = ¯

δ and j(¯ δ) = δ.

◮ j(¯

a) = a.

◮ ¯

λ is P-Σn-reflecting.

slide-75
SLIDE 75

Suitable iterations

Definition

A forcing iteration P is suitable if it is the direct limit of an Easton support iteration4 Pλ; ˙ Qλ : λ < ORD such that for each λ,

  • 1. If λ is an inaccessible cardinal, then Pλ ⊆ Vλ.
  • 2. There is some θ > λ such that

Pν “ ˙ Qν is λ-directed closed ” for all ν θ.

4Recall that an Easton support iteration is a forcing iteration where direct

limits are taken at inaccessible stages and inverse limits elsewhere.

slide-76
SLIDE 76

Suitable iterations

Definition

A forcing iteration P is suitable if it is the direct limit of an Easton support iteration4 Pλ; ˙ Qλ : λ < ORD such that for each λ,

  • 1. If λ is an inaccessible cardinal, then Pλ ⊆ Vλ.
  • 2. There is some θ > λ such that

Pν “ ˙ Qν is λ-directed closed ” for all ν θ. Recall that a partial ordering P is weakly homogeneous if for any p, q ∈ P there is an automorphism π of P such that π(p) and q are compatible.

4Recall that an Easton support iteration is a forcing iteration where direct

limits are taken at inaccessible stages and inverse limits elsewhere.

slide-77
SLIDE 77

Main preservation theorem

Theorem (B.-Poveda 2018)

Suppose m, n 1 and m n + 1. Suppose P is a weakly homogeneous Γm-definable suitable iteration and there exists a proper class of P-Σn+1-reflecting cardinals. If δ is a P-Σn+1-supercompact cardinal, then P “ δ is C(n)-extendible”.

slide-78
SLIDE 78

Preserving VP level-by-level

Theorem (Brooke-Taylor 2011)

Let P be a definable suitable iteration. If VP holds in V, then VP holds in VP.

slide-79
SLIDE 79

Preserving VP level-by-level

Theorem (Brooke-Taylor 2011)

Let P be a definable suitable iteration. If VP holds in V, then VP holds in VP.

Theorem

Let n, m 1 be such that m n + 1, and let P be a weakly thomogeneous Γm-definable suitable iteration. Then,

  • 1. If Γ = Σ or n > 1, and VP(Πm+n) holds, then VP(Πn+1)

holds in VP.

  • 2. If Γ = Π and n = 1, VP(Πm+1) holds, and ORD is

Πm+2-Mahlo, then VP(Π2) holds in VP.

slide-80
SLIDE 80

C(n)-extendible cardinals and the GCH

Let P = Pα; ˙ Qα : α ∈ ORD be the standard Jensen’s proper class iteration for forcing the global GCH. Namely, the direct limit of the iteration with Easton support where P0 is the trivial forcing and for each ordinal α, if Pα “α is an uncountable cardinal”, then Pα “ ˙ Qα = Add(α+, 1)”, and Pα “ ˙ Qα is trivial”, otherwise.

slide-81
SLIDE 81

C(n)-extendible cardinals and the GCH

Let P = Pα; ˙ Qα : α ∈ ORD be the standard Jensen’s proper class iteration for forcing the global GCH. Namely, the direct limit of the iteration with Easton support where P0 is the trivial forcing and for each ordinal α, if Pα “α is an uncountable cardinal”, then Pα “ ˙ Qα = Add(α+, 1)”, and Pα “ ˙ Qα is trivial”, otherwise. P is weakly homogeneous, suitable, and Π1-definable.

slide-82
SLIDE 82

C(n)-extendible cardinals and the GCH

Let P = Pα; ˙ Qα : α ∈ ORD be the standard Jensen’s proper class iteration for forcing the global GCH. Namely, the direct limit of the iteration with Easton support where P0 is the trivial forcing and for each ordinal α, if Pα “α is an uncountable cardinal”, then Pα “ ˙ Qα = Add(α+, 1)”, and Pα “ ˙ Qα is trivial”, otherwise. P is weakly homogeneous, suitable, and Π1-definable.

Theorem (Tsaprounis 2013)

Forcing with P preserves C(n)-extendible cardinals.

slide-83
SLIDE 83

Changing the power-set function on regular cardinals

A class function E from the class REG of infinite regular cardinals to the class of cardinals is an Easton function if:

  • 1. cf(E(κ)) > κ, for all κ ∈ REG
  • 2. If κ λ, then F(κ) F(λ)
slide-84
SLIDE 84

Changing the power-set function on regular cardinals

A class function E from the class REG of infinite regular cardinals to the class of cardinals is an Easton function if:

  • 1. cf(E(κ)) > κ, for all κ ∈ REG
  • 2. If κ λ, then F(κ) F(λ)

Let PE = limPα, ˙ Qα : α ∈ ORD be the forcing iteration with Easton support where P0 is the trivial forcing and for each ordinal α, if Pα “α is a regular cardinal”, then Pα “ ˙ Qα = Add(α, E(α))”, and Pα “ ˙ Qα is trivial” otherwise.

slide-85
SLIDE 85

Changing the power-set function on regular cardinals

A class function E from the class REG of infinite regular cardinals to the class of cardinals is an Easton function if:

  • 1. cf(E(κ)) > κ, for all κ ∈ REG
  • 2. If κ λ, then F(κ) F(λ)

Let PE = limPα, ˙ Qα : α ∈ ORD be the forcing iteration with Easton support where P0 is the trivial forcing and for each ordinal α, if Pα “α is a regular cardinal”, then Pα “ ˙ Qα = Add(α, E(α))”, and Pα “ ˙ Qα is trivial” otherwise. If the GCH holds in the ground model, then PE preserves all cardinals and cofinalities and forces that 2κ = E(κ) for every regular cardinal κ.

slide-86
SLIDE 86

Changing the power-set function on regular cardinals

A class function E from the class REG of infinite regular cardinals to the class of cardinals is an Easton function if:

  • 1. cf(E(κ)) > κ, for all κ ∈ REG
  • 2. If κ λ, then F(κ) F(λ)

Let PE = limPα, ˙ Qα : α ∈ ORD be the forcing iteration with Easton support where P0 is the trivial forcing and for each ordinal α, if Pα “α is a regular cardinal”, then Pα “ ˙ Qα = Add(α, E(α))”, and Pα “ ˙ Qα is trivial” otherwise. If the GCH holds in the ground model, then PE preserves all cardinals and cofinalities and forces that 2κ = E(κ) for every regular cardinal κ. PE is suitable and weakly homogeneous.

slide-87
SLIDE 87

Changing the power-set function on regular cardinals

Theorem (B.-Poveda 2018)

If E is a ∆2-definable Easton function, then PE preserves C(n)-extendible cardinals, all n 1. More generally, if E is a Πm-definable Easton function (m > 1) and λ is C(m+n−1)-extendible, then PE forces that λ is C(n)-extendible, all n 1 such that m n + 1.

slide-88
SLIDE 88

Changing the power-set function on regular cardinals

Theorem (B.-Poveda 2018)

If E is a ∆2-definable Easton function, then PE preserves C(n)-extendible cardinals, all n 1. More generally, if E is a Πm-definable Easton function (m > 1) and λ is C(m+n−1)-extendible, then PE forces that λ is C(n)-extendible, all n 1 such that m n + 1. The theorem is sharp: If κ is the least C(n)-extendible cardinal, then the Easton function E that sends ℵ0 to κ and every uncountable regular cardinal λ to max {λ+, κ} is Πn+2-definable and destroys κ being inaccessible. In the case n = 1 this gives in fact an example of a Π2-definable Easton function E such that PE destroys an extendible cardinal.

slide-89
SLIDE 89

Forcing V "far" from HOD

Let C = Pα; ˙ Qα : α ∈ ORD be the Easton support iteration where P0 is the trivial forcing and for each ordinal α, if Pα “α is regular” then Pα “ ˙ Qα = ˙ Coll(α, α+)”, and Pα “ ˙ Qα is trivial” otherwise.

slide-90
SLIDE 90

Forcing V "far" from HOD

Let C = Pα; ˙ Qα : α ∈ ORD be the Easton support iteration where P0 is the trivial forcing and for each ordinal α, if Pα “α is regular” then Pα “ ˙ Qα = ˙ Coll(α, α+)”, and Pα “ ˙ Qα is trivial” otherwise.

Theorem (B.-Poveda 2018)

Forcing with C preserves C(n)-extendible cardinals (hence also VP) and forces (λ+)HOD < λ+, for every regular cardinal λ.

slide-91
SLIDE 91

Forcing V "far" from HOD

Let C = Pα; ˙ Qα : α ∈ ORD be the Easton support iteration where P0 is the trivial forcing and for each ordinal α, if Pα “α is regular” then Pα “ ˙ Qα = ˙ Coll(α, α+)”, and Pα “ ˙ Qα is trivial” otherwise.

Theorem (B.-Poveda 2018)

Forcing with C preserves C(n)-extendible cardinals (hence also VP) and forces (λ+)HOD < λ+, for every regular cardinal λ. Note: Forcing (λ+)HOD < λ+, for some singular cardinal λ, while preserving some extendible cardinal smaller than λ would refute Woodin’s HOD Conjecture.

slide-92
SLIDE 92

Forcing further disagreement between V and HOD

Let K be a function on the class of infinite cardinals such that K(λ) > λ, for every λ, and K is increasingly monotone. Let PK be the direct limit of an iteration Pα; ˙ Qα : α ∈ ORD with Easton support where P0 is the trivial forcing and for each ordinal α, if Pα “α is regular” then Pα “ ˙ Qα = ˙ Coll(α, K(α))”, and Pα “ ˙ Qα is trivial” otherwise.

slide-93
SLIDE 93

Forcing further disagreement between V and HOD

Let K be a function on the class of infinite cardinals such that K(λ) > λ, for every λ, and K is increasingly monotone. Let PK be the direct limit of an iteration Pα; ˙ Qα : α ∈ ORD with Easton support where P0 is the trivial forcing and for each ordinal α, if Pα “α is regular” then Pα “ ˙ Qα = ˙ Coll(α, K(α))”, and Pα “ ˙ Qα is trivial” otherwise. PK preserves all inaccessible cardinals that are closed under K. Moreover, for each α such that Pα “α is regular”, the remaining part of the iteration after stage α is α-closed, hence it preserves α. Also, if K is Πm-definable (m 1), then PK is also Πm-definable.

slide-94
SLIDE 94

Theorem (B.-Poveda 2018)

If K is ∆2-definable, then PK preserves C(n)-extendible cardinals, all n 1. More generally, if K is Πm-definable (m > 1) and λ is C(m+n−1)-extendible, then PK forces that λ is C(n)-extendible, all n 1 such that m n + 1. Moreover, PK forces (λ+)HOD K(λ) < λ+ for all infinite regular cardinals λ.

slide-95
SLIDE 95

The function K may be taken so that PK destroys many singular cardinals in HOD while preserving extendible cardinals.

slide-96
SLIDE 96

The function K may be taken so that PK destroys many singular cardinals in HOD while preserving extendible cardinals. For example, let K be such that K(λ) is the least singular cardinal in HOD greater than λ, i.e., K(λ) = (λ+ω)HOD. Then, K is ∆2-definable, and we have the following.

slide-97
SLIDE 97

The function K may be taken so that PK destroys many singular cardinals in HOD while preserving extendible cardinals. For example, let K be such that K(λ) is the least singular cardinal in HOD greater than λ, i.e., K(λ) = (λ+ω)HOD. Then, K is ∆2-definable, and we have the following.

Corollary

PK preserves extendible cardinals and forces (λ+ω)HOD < λ+ for every regular cardinal λ.

slide-98
SLIDE 98