Sealing the Universally Baire sets Nam Trang (joint with - - PowerPoint PPT Presentation

sealing the universally baire sets
SMART_READER_LITE
LIVE PREVIEW

Sealing the Universally Baire sets Nam Trang (joint with - - PowerPoint PPT Presentation

Sealing LSA over UB Results Sealing and Inner Model Theory Open problems Proof outlines Sealing the Universally Baire sets Nam Trang (joint with G.Sargsyan) University of North Texas Luminy Workshop in Set Theory September 2227,


slide-1
SLIDE 1

Sealing LSA − over − UB Results Sealing and Inner Model Theory Open problems Proof outlines

Sealing the Universally Baire sets

Nam Trang (joint with G.Sargsyan)

University of North Texas Luminy Workshop in Set Theory September 22–27, 2019 Nam Trang (joint with G.Sargsyan) Sealing the Universally Baire sets 1 / 27

slide-2
SLIDE 2

Sealing LSA − over − UB Results Sealing and Inner Model Theory Open problems Proof outlines

Sealing

A set of reals A is γ-universally Baire if there are trees T, U on ω × λ for some λ such that A = p[T] = R\p[U] and whenever g is a < Hom-generic, in V [g], p[T] = R\p[U]. We write Ag for p[T]V [g]; this is the canonical interpretation of A in V [g]. A is universally Baire if A is γ-universally Baire for all γ.

Nam Trang (joint with G.Sargsyan) Sealing the Universally Baire sets 2 / 27

slide-3
SLIDE 3

Sealing LSA − over − UB Results Sealing and Inner Model Theory Open problems Proof outlines

Sealing

A set of reals A is γ-universally Baire if there are trees T, U on ω × λ for some λ such that A = p[T] = R\p[U] and whenever g is a < Hom-generic, in V [g], p[T] = R\p[U]. We write Ag for p[T]V [g]; this is the canonical interpretation of A in V [g]. A is universally Baire if A is γ-universally Baire for all γ. Let Hom∞ be the set of universally Baire sets. Given a generic g, we let Hom∞

g

= (Hom∞)V [g] and Rg = RV [g]. Also, if A = p[T] for some tree T, then let Ag = p[T] ∩ V [g].

Nam Trang (joint with G.Sargsyan) Sealing the Universally Baire sets 2 / 27

slide-4
SLIDE 4

Sealing LSA − over − UB Results Sealing and Inner Model Theory Open problems Proof outlines

Sealing

A set of reals A is γ-universally Baire if there are trees T, U on ω × λ for some λ such that A = p[T] = R\p[U] and whenever g is a < Hom-generic, in V [g], p[T] = R\p[U]. We write Ag for p[T]V [g]; this is the canonical interpretation of A in V [g]. A is universally Baire if A is γ-universally Baire for all γ. Let Hom∞ be the set of universally Baire sets. Given a generic g, we let Hom∞

g

= (Hom∞)V [g] and Rg = RV [g]. Also, if A = p[T] for some tree T, then let Ag = p[T] ∩ V [g]. Definition (Woodin) Sealing is the conjunction of the following statements.

1 For every set generic g, L(Hom∞

g , Rg) AD+ and P(Rg) ∩ L(Hom∞ g , Rg) = Hom∞ g .

2 For every set generic g over V , for every set generic h over V [g], there is an elementary

embedding j : L(Hom∞

g , Rg) → L(Hom∞ h , Rh).

such that for every A ∈ Hom∞

g , j(A) = Ah.

Nam Trang (joint with G.Sargsyan) Sealing the Universally Baire sets 2 / 27

slide-5
SLIDE 5

Sealing LSA − over − UB Results Sealing and Inner Model Theory Open problems Proof outlines

Tower Sealing

Definition (Woodin) Tower Sealing is the conjunction of:

1 For any set generic g, L(Hom∞

g ) AD+, and Hom∞ g

= P(R) ∩ L(Hom∞

g , Rg).

2 For any set generic g, in V [g], suppose δ is Woodin. Whenever G is V [g]-generic for either

the P<δ-stationary tower or the Q<δ-stationary tower at δ, then j(Hom∞

g ) = Hom∞ g∗G ,

where j : V [g] → M ⊂ V [g ∗ G] is the generic elementary embedding given by G.

Nam Trang (joint with G.Sargsyan) Sealing the Universally Baire sets 3 / 27

slide-6
SLIDE 6

Sealing LSA − over − UB Results Sealing and Inner Model Theory Open problems Proof outlines

Tower Sealing

Definition (Woodin) Tower Sealing is the conjunction of:

1 For any set generic g, L(Hom∞

g ) AD+, and Hom∞ g

= P(R) ∩ L(Hom∞

g , Rg).

2 For any set generic g, in V [g], suppose δ is Woodin. Whenever G is V [g]-generic for either

the P<δ-stationary tower or the Q<δ-stationary tower at δ, then j(Hom∞

g ) = Hom∞ g∗G ,

where j : V [g] → M ⊂ V [g ∗ G] is the generic elementary embedding given by G. Theorem (Woodin, [Lar04]) Suppose there is a proper class of Woodin cardinals. Let δ be a supercompact cardinal and G be V -generic such that in V [G], Vδ+1 is countable. Then Sealing and Tower Sealing hold in V [G].

Nam Trang (joint with G.Sargsyan) Sealing the Universally Baire sets 3 / 27

slide-7
SLIDE 7

Sealing LSA − over − UB Results Sealing and Inner Model Theory Open problems Proof outlines

Tower Sealing

Definition (Woodin) Tower Sealing is the conjunction of:

1 For any set generic g, L(Hom∞

g ) AD+, and Hom∞ g

= P(R) ∩ L(Hom∞

g , Rg).

2 For any set generic g, in V [g], suppose δ is Woodin. Whenever G is V [g]-generic for either

the P<δ-stationary tower or the Q<δ-stationary tower at δ, then j(Hom∞

g ) = Hom∞ g∗G ,

where j : V [g] → M ⊂ V [g ∗ G] is the generic elementary embedding given by G. Theorem (Woodin, [Lar04]) Suppose there is a proper class of Woodin cardinals. Let δ be a supercompact cardinal and G be V -generic such that in V [G], Vδ+1 is countable. Then Sealing and Tower Sealing hold in V [G]. Remark: Assume there is a proper class of Woodin cardinals. For any A ∈ Hom∞, one can seal the model L(A, R), i.e. for any set generic extension V [g], there is an elementary embedding j : L(A, R) → L(Ag, Rg) such that j(A) = Ag.

Nam Trang (joint with G.Sargsyan) Sealing the Universally Baire sets 3 / 27

slide-8
SLIDE 8

Sealing LSA − over − UB Results Sealing and Inner Model Theory Open problems Proof outlines

LSA

A cardinal κ is OD-inaccessible if for every α < κ there is no surjection f : P(α) → κ that is definable from ordinal parameters.

Nam Trang (joint with G.Sargsyan) Sealing the Universally Baire sets 4 / 27

slide-9
SLIDE 9

Sealing LSA − over − UB Results Sealing and Inner Model Theory Open problems Proof outlines

LSA

A cardinal κ is OD-inaccessible if for every α < κ there is no surjection f : P(α) → κ that is definable from ordinal parameters. Definition (Woodin, Sargsyan) The Largest Suslin Axiom, abbreviated as LSA, is the conjunction of the following statements:

1 AD+. 2 There is a largest Suslin cardinal. 3 The largest Suslin cardinal is OD-inaccessible. Nam Trang (joint with G.Sargsyan) Sealing the Universally Baire sets 4 / 27

slide-10
SLIDE 10

Sealing LSA − over − UB Results Sealing and Inner Model Theory Open problems Proof outlines

LSA

A cardinal κ is OD-inaccessible if for every α < κ there is no surjection f : P(α) → κ that is definable from ordinal parameters. Definition (Woodin, Sargsyan) The Largest Suslin Axiom, abbreviated as LSA, is the conjunction of the following statements:

1 AD+. 2 There is a largest Suslin cardinal. 3 The largest Suslin cardinal is OD-inaccessible.

Clause (3) of LSA is equivalent to “the largest Suslin cardinal is a member of the Solovay sequence".

Nam Trang (joint with G.Sargsyan) Sealing the Universally Baire sets 4 / 27

slide-11
SLIDE 11

Sealing LSA − over − UB Results Sealing and Inner Model Theory Open problems Proof outlines

LSA

A cardinal κ is OD-inaccessible if for every α < κ there is no surjection f : P(α) → κ that is definable from ordinal parameters. Definition (Woodin, Sargsyan) The Largest Suslin Axiom, abbreviated as LSA, is the conjunction of the following statements:

1 AD+. 2 There is a largest Suslin cardinal. 3 The largest Suslin cardinal is OD-inaccessible.

Clause (3) of LSA is equivalent to “the largest Suslin cardinal is a member of the Solovay sequence". Prior to [ST], LSA was not known to be consistent. [ST] shows that it is consistent relative to a Woodin cardinal that is a limit of Woodin cardinals. Nowadays, the axiom plays a key role in many aspects of inner model theory, and features prominently in Woodin’s Ultimate L framework (see [Woo17, Definition 7.14] and Axiom I and Axiom II on page 97 of [Woo17]).

Nam Trang (joint with G.Sargsyan) Sealing the Universally Baire sets 4 / 27

slide-12
SLIDE 12

Sealing LSA − over − UB Results Sealing and Inner Model Theory Open problems Proof outlines

LSA − over − UB

Definition (Sargsyan-T.) Let LSA − over − uB be the statement: For all V -generic g, in V [g], there is A ⊆ Rg such that L(A, Rg) LSA and Hom∞

g

is the Suslin co-Suslin sets of L(A, Rg).

Nam Trang (joint with G.Sargsyan) Sealing the Universally Baire sets 5 / 27

slide-13
SLIDE 13

Sealing LSA − over − UB Results Sealing and Inner Model Theory Open problems Proof outlines

Equiconsistency results

Theorem (Sargsyan-T., 2018-2019, [ST19b]) Sealing, Tower Sealing, and LSA − over − uB are equiconsistent over “there exists a proper class

  • f Woodin cardinals and the class of measurable cardinals is stationary".

Nam Trang (joint with G.Sargsyan) Sealing the Universally Baire sets 6 / 27

slide-14
SLIDE 14

Sealing LSA − over − UB Results Sealing and Inner Model Theory Open problems Proof outlines

Equiconsistency results

Theorem (Sargsyan-T., 2018-2019, [ST19b]) Sealing, Tower Sealing, and LSA − over − uB are equiconsistent over “there exists a proper class

  • f Woodin cardinals and the class of measurable cardinals is stationary".

In the above theorem, one can add to the list of equiconsistencies the following statements:

1

LSA − over − uB− be the statement: For all V -generic g, in V [g], there is A ⊆ Rg such that L(A, Rg) LSA and Hom∞

g

is contained in the Suslin co-Suslin sets of L(A, Rg).

Nam Trang (joint with G.Sargsyan) Sealing the Universally Baire sets 6 / 27

slide-15
SLIDE 15

Sealing LSA − over − UB Results Sealing and Inner Model Theory Open problems Proof outlines

Equiconsistency results

Theorem (Sargsyan-T., 2018-2019, [ST19b]) Sealing, Tower Sealing, and LSA − over − uB are equiconsistent over “there exists a proper class

  • f Woodin cardinals and the class of measurable cardinals is stationary".

In the above theorem, one can add to the list of equiconsistencies the following statements:

1

LSA − over − uB− be the statement: For all V -generic g, in V [g], there is A ⊆ Rg such that L(A, Rg) LSA and Hom∞

g

is contained in the Suslin co-Suslin sets of L(A, Rg).

2

Sealing−: “for any set generic g, Hom∞

g

= P(R) ∩ L(Hom∞

g , Rg) and there is no ω1 sequence

  • f reals in L(Hom∞

g , Rg)." Nam Trang (joint with G.Sargsyan) Sealing the Universally Baire sets 6 / 27

slide-16
SLIDE 16

Sealing LSA − over − UB Results Sealing and Inner Model Theory Open problems Proof outlines

Equiconsistency results

Theorem (Sargsyan-T., 2018-2019, [ST19b]) Sealing, Tower Sealing, and LSA − over − uB are equiconsistent over “there exists a proper class

  • f Woodin cardinals and the class of measurable cardinals is stationary".

In the above theorem, one can add to the list of equiconsistencies the following statements:

1

LSA − over − uB− be the statement: For all V -generic g, in V [g], there is A ⊆ Rg such that L(A, Rg) LSA and Hom∞

g

is contained in the Suslin co-Suslin sets of L(A, Rg).

2

Sealing−: “for any set generic g, Hom∞

g

= P(R) ∩ L(Hom∞

g , Rg) and there is no ω1 sequence

  • f reals in L(Hom∞

g , Rg)."

generic − LSA: “for any set generic extension V [g] of V , there is a set A ∈ V [g] such that L(A, RV [g]) LSA" is strictly weaker than the above hypotheses.

Nam Trang (joint with G.Sargsyan) Sealing the Universally Baire sets 6 / 27

slide-17
SLIDE 17

Sealing LSA − over − UB Results Sealing and Inner Model Theory Open problems Proof outlines

Equiconsistency results

Theorem (Sargsyan-T., 2018-2019, [ST19b]) Sealing, Tower Sealing, and LSA − over − uB are equiconsistent over “there exists a proper class

  • f Woodin cardinals and the class of measurable cardinals is stationary".

In the above theorem, one can add to the list of equiconsistencies the following statements:

1

LSA − over − uB− be the statement: For all V -generic g, in V [g], there is A ⊆ Rg such that L(A, Rg) LSA and Hom∞

g

is contained in the Suslin co-Suslin sets of L(A, Rg).

2

Sealing−: “for any set generic g, Hom∞

g

= P(R) ∩ L(Hom∞

g , Rg) and there is no ω1 sequence

  • f reals in L(Hom∞

g , Rg)."

generic − LSA: “for any set generic extension V [g] of V , there is a set A ∈ V [g] such that L(A, RV [g]) LSA" is strictly weaker than the above hypotheses. Corollary Sealing, Tower Sealing are consistent relative to “there is a Woodin cardinal which is a limit of Woodin cardinals".

Nam Trang (joint with G.Sargsyan) Sealing the Universally Baire sets 6 / 27

slide-18
SLIDE 18

Sealing LSA − over − UB Results Sealing and Inner Model Theory Open problems Proof outlines

Equiconsistency results (cont.)

Definition Suppose P is hybrid premouse. We say that P is almost excellent if

1 P T0, where T0 says “There are unboundedly many Woodin cardinals + the class of

measurable cardinals is stationary + no measurable cardinal that is a limit of Woodin cardinals carries a normal ultrafilter concentrating on the set of measurable cardinals."

Nam Trang (joint with G.Sargsyan) Sealing the Universally Baire sets 7 / 27

slide-19
SLIDE 19

Sealing LSA − over − UB Results Sealing and Inner Model Theory Open problems Proof outlines

Equiconsistency results (cont.)

Definition Suppose P is hybrid premouse. We say that P is almost excellent if

1 P T0, where T0 says “There are unboundedly many Woodin cardinals + the class of

measurable cardinals is stationary + no measurable cardinal that is a limit of Woodin cardinals carries a normal ultrafilter concentrating on the set of measurable cardinals."

2 There is a Woodin cardinal δ of P such that P “P0 =def (P|δ)# is a hod premouse of lsa

type", P is an sts premouse based on P0 and P “SP, which is a short tree strategy for P0, is splendid".

Nam Trang (joint with G.Sargsyan) Sealing the Universally Baire sets 7 / 27

slide-20
SLIDE 20

Sealing LSA − over − UB Results Sealing and Inner Model Theory Open problems Proof outlines

Equiconsistency results (cont.)

Definition Suppose P is hybrid premouse. We say that P is almost excellent if

1 P T0, where T0 says “There are unboundedly many Woodin cardinals + the class of

measurable cardinals is stationary + no measurable cardinal that is a limit of Woodin cardinals carries a normal ultrafilter concentrating on the set of measurable cardinals."

2 There is a Woodin cardinal δ of P such that P “P0 =def (P|δ)# is a hod premouse of lsa

type", P is an sts premouse based on P0 and P “SP, which is a short tree strategy for P0, is splendid".

3 Given any τ < δP0 such that (P0|τ)# is of lsa type, there is M ✁ P such that τ is a

cutpoint of M and M “τ is not a Woodin cardinal".

Nam Trang (joint with G.Sargsyan) Sealing the Universally Baire sets 7 / 27

slide-21
SLIDE 21

Sealing LSA − over − UB Results Sealing and Inner Model Theory Open problems Proof outlines

Equiconsistency results (cont.)

Definition Suppose P is hybrid premouse. We say that P is almost excellent if

1 P T0, where T0 says “There are unboundedly many Woodin cardinals + the class of

measurable cardinals is stationary + no measurable cardinal that is a limit of Woodin cardinals carries a normal ultrafilter concentrating on the set of measurable cardinals."

2 There is a Woodin cardinal δ of P such that P “P0 =def (P|δ)# is a hod premouse of lsa

type", P is an sts premouse based on P0 and P “SP, which is a short tree strategy for P0, is splendid".

3 Given any τ < δP0 such that (P0|τ)# is of lsa type, there is M ✁ P such that τ is a

cutpoint of M and M “τ is not a Woodin cardinal". We say that P is excellent if in addition to the above clauses, P satisfies an self-iterability hypothesis above δ. If P is excellent then we let δP be the δ of clause 2 above and P0 = ((P|δP)#)P.

Nam Trang (joint with G.Sargsyan) Sealing the Universally Baire sets 7 / 27

slide-22
SLIDE 22

Sealing LSA − over − UB Results Sealing and Inner Model Theory Open problems Proof outlines

Equiconsistency results (cont.)

Definition Suppose P is hybrid premouse. We say that P is almost excellent if

1 P T0, where T0 says “There are unboundedly many Woodin cardinals + the class of

measurable cardinals is stationary + no measurable cardinal that is a limit of Woodin cardinals carries a normal ultrafilter concentrating on the set of measurable cardinals."

2 There is a Woodin cardinal δ of P such that P “P0 =def (P|δ)# is a hod premouse of lsa

type", P is an sts premouse based on P0 and P “SP, which is a short tree strategy for P0, is splendid".

3 Given any τ < δP0 such that (P0|τ)# is of lsa type, there is M ✁ P such that τ is a

cutpoint of M and M “τ is not a Woodin cardinal". We say that P is excellent if in addition to the above clauses, P satisfies an self-iterability hypothesis above δ. If P is excellent then we let δP be the δ of clause 2 above and P0 = ((P|δP)#)P. For the (⇒) direction:

Nam Trang (joint with G.Sargsyan) Sealing the Universally Baire sets 7 / 27

slide-23
SLIDE 23

Sealing LSA − over − UB Results Sealing and Inner Model Theory Open problems Proof outlines

Equiconsistency results (cont.)

Definition Suppose P is hybrid premouse. We say that P is almost excellent if

1 P T0, where T0 says “There are unboundedly many Woodin cardinals + the class of

measurable cardinals is stationary + no measurable cardinal that is a limit of Woodin cardinals carries a normal ultrafilter concentrating on the set of measurable cardinals."

2 There is a Woodin cardinal δ of P such that P “P0 =def (P|δ)# is a hod premouse of lsa

type", P is an sts premouse based on P0 and P “SP, which is a short tree strategy for P0, is splendid".

3 Given any τ < δP0 such that (P0|τ)# is of lsa type, there is M ✁ P such that τ is a

cutpoint of M and M “τ is not a Woodin cardinal". We say that P is excellent if in addition to the above clauses, P satisfies an self-iterability hypothesis above δ. If P is excellent then we let δP be the δ of clause 2 above and P0 = ((P|δP)#)P. For the (⇒) direction: Assume Sealing or LSA − over − UB along with the given large cardinal hypothesis.

Nam Trang (joint with G.Sargsyan) Sealing the Universally Baire sets 7 / 27

slide-24
SLIDE 24

Sealing LSA − over − UB Results Sealing and Inner Model Theory Open problems Proof outlines

Equiconsistency results (cont.)

Definition Suppose P is hybrid premouse. We say that P is almost excellent if

1 P T0, where T0 says “There are unboundedly many Woodin cardinals + the class of

measurable cardinals is stationary + no measurable cardinal that is a limit of Woodin cardinals carries a normal ultrafilter concentrating on the set of measurable cardinals."

2 There is a Woodin cardinal δ of P such that P “P0 =def (P|δ)# is a hod premouse of lsa

type", P is an sts premouse based on P0 and P “SP, which is a short tree strategy for P0, is splendid".

3 Given any τ < δP0 such that (P0|τ)# is of lsa type, there is M ✁ P such that τ is a

cutpoint of M and M “τ is not a Woodin cardinal". We say that P is excellent if in addition to the above clauses, P satisfies an self-iterability hypothesis above δ. If P is excellent then we let δP be the δ of clause 2 above and P0 = ((P|δP)#)P. For the (⇒) direction: Assume Sealing or LSA − over − UB along with the given large cardinal hypothesis. Construct an excellent hybrid premouse P by a (convoluted) variant of the hybrid fully backgrounded constructions.

Nam Trang (joint with G.Sargsyan) Sealing the Universally Baire sets 7 / 27

slide-25
SLIDE 25

Sealing LSA − over − UB Results Sealing and Inner Model Theory Open problems Proof outlines

Equiconsistency results (cont.)

Definition Suppose P is hybrid premouse. We say that P is almost excellent if

1 P T0, where T0 says “There are unboundedly many Woodin cardinals + the class of

measurable cardinals is stationary + no measurable cardinal that is a limit of Woodin cardinals carries a normal ultrafilter concentrating on the set of measurable cardinals."

2 There is a Woodin cardinal δ of P such that P “P0 =def (P|δ)# is a hod premouse of lsa

type", P is an sts premouse based on P0 and P “SP, which is a short tree strategy for P0, is splendid".

3 Given any τ < δP0 such that (P0|τ)# is of lsa type, there is M ✁ P such that τ is a

cutpoint of M and M “τ is not a Woodin cardinal". We say that P is excellent if in addition to the above clauses, P satisfies an self-iterability hypothesis above δ. If P is excellent then we let δP be the δ of clause 2 above and P0 = ((P|δP)#)P. For the (⇒) direction: Assume Sealing or LSA − over − UB along with the given large cardinal hypothesis. Construct an excellent hybrid premouse P by a (convoluted) variant of the hybrid fully backgrounded constructions. For the (⇐) direction: show Sealing and LSA − over − UB holds in PColl(ω,P0).

Nam Trang (joint with G.Sargsyan) Sealing the Universally Baire sets 7 / 27

slide-26
SLIDE 26

Sealing LSA − over − UB Results Sealing and Inner Model Theory Open problems Proof outlines

Inequivalence

Motivated by the following result: Theorem (Steel, Woodin) Assume there is a proper class of measurables. The following are equivalent:

1 L(R)V P ≡ L(R)V Q for all posets P, Q. 2 For all posets P, V P ADL(R). 3 For all posets P, V P “there is no ω1 sequence of distinct reals in L(R)". Nam Trang (joint with G.Sargsyan) Sealing the Universally Baire sets 8 / 27

slide-27
SLIDE 27

Sealing LSA − over − UB Results Sealing and Inner Model Theory Open problems Proof outlines

Inequivalence

Motivated by the following result: Theorem (Steel, Woodin) Assume there is a proper class of measurables. The following are equivalent:

1 L(R)V P ≡ L(R)V Q for all posets P, Q. 2 For all posets P, V P ADL(R). 3 For all posets P, V P “there is no ω1 sequence of distinct reals in L(R)".

We address the question of whether Sealing and LSA − over − UB are equivalent. The short answer is NO.

Nam Trang (joint with G.Sargsyan) Sealing the Universally Baire sets 8 / 27

slide-28
SLIDE 28

Sealing LSA − over − UB Results Sealing and Inner Model Theory Open problems Proof outlines

Inequivalence (cont.)

The Unique Branch Hypothesis (UBH) is the statement that every non-dropping plus-2 iteration tree T on V has at most one cofinal well-founded branch. The Generic Unique Branch Hypothesis (gUBH) says that UBH holds in all set generic extensions.

Nam Trang (joint with G.Sargsyan) Sealing the Universally Baire sets 9 / 27

slide-29
SLIDE 29

Sealing LSA − over − UB Results Sealing and Inner Model Theory Open problems Proof outlines

Inequivalence (cont.)

The Unique Branch Hypothesis (UBH) is the statement that every non-dropping plus-2 iteration tree T on V has at most one cofinal well-founded branch. The Generic Unique Branch Hypothesis (gUBH) says that UBH holds in all set generic extensions. We say (P, Ψ) is an iterable pair if P is a pre-iterable structure and Ψ is a strategy for it. Given a strong limit cardinal κ and F ⊆ Ord, set W Ψ,F

κ

= (Hκ, F ∩ κ, P|κ, ΨP|κ↾Hκ, ∈).

Nam Trang (joint with G.Sargsyan) Sealing the Universally Baire sets 9 / 27

slide-30
SLIDE 30

Sealing LSA − over − UB Results Sealing and Inner Model Theory Open problems Proof outlines

Inequivalence (cont.)

The Unique Branch Hypothesis (UBH) is the statement that every non-dropping plus-2 iteration tree T on V has at most one cofinal well-founded branch. The Generic Unique Branch Hypothesis (gUBH) says that UBH holds in all set generic extensions. We say (P, Ψ) is an iterable pair if P is a pre-iterable structure and Ψ is a strategy for it. Given a strong limit cardinal κ and F ⊆ Ord, set W Ψ,F

κ

= (Hκ, F ∩ κ, P|κ, ΨP|κ↾Hκ, ∈).

Nam Trang (joint with G.Sargsyan) Sealing the Universally Baire sets 9 / 27

slide-31
SLIDE 31

Sealing LSA − over − UB Results Sealing and Inner Model Theory Open problems Proof outlines

Inequivalence (cont.)

The Unique Branch Hypothesis (UBH) is the statement that every non-dropping plus-2 iteration tree T on V has at most one cofinal well-founded branch. The Generic Unique Branch Hypothesis (gUBH) says that UBH holds in all set generic extensions. We say (P, Ψ) is an iterable pair if P is a pre-iterable structure and Ψ is a strategy for it. Given a strong limit cardinal κ and F ⊆ Ord, set W Ψ,F

κ

= (Hκ, F ∩ κ, P|κ, ΨP|κ↾Hκ, ∈). Given a structure Q in a language extending the language of set theory with a transitive universe, and an X ≺ Q, we let MX be the transitive collapse of X and πX : MX → Q be the inverse of the transitive collapse. In general, the preimages of objects in X will be denoted by using X as a

  • subscript. Suppose in addition Q = (R, ...P...) where P is a pre-iterable structure and Φ is an

iteration strategy of P. We will then write X ≺ (Q|Φ) to mean that X ≺ Q and the strategy

  • f PX that we are interested in is ΦπX , the pullback of Φ via πX . We set ΛX = ΦπX .

Nam Trang (joint with G.Sargsyan) Sealing the Universally Baire sets 9 / 27

slide-32
SLIDE 32

Sealing LSA − over − UB Results Sealing and Inner Model Theory Open problems Proof outlines

Inequivalence (cont.)

Definition We say Ψ is a generically universally Baire (guB) strategy for a pre-iterable P = (P, E) if there is a formula φ(x) in the language of set theory augmented by three relation symbols and F ⊆ Ord such that for every inaccessible cardinal κ and for every countable X ≺ (W Ψ,F

κ

|ΨP|κ) whenever

(a)

g ∈ V is MX -generic for a poset of size < κX and

(b)

T ∈ MX [g] is such that for some inaccessible η < κX , T is an iteration of PX |η, the following conditions hold:

1 if lh(T ) is a limit ordinal and T ∈ dom(ΛX ) then ΛX (T ) ∈ MX [g], 2 T is according to ΛX if and only if MX [g] φ[T ].

We say that (φ, F) is a generic prescription of Ψ.

Nam Trang (joint with G.Sargsyan) Sealing the Universally Baire sets 10 / 27

slide-33
SLIDE 33

Sealing LSA − over − UB Results Sealing and Inner Model Theory Open problems Proof outlines

Inequivalence (cont.)

We let ile(P) be the set of inaccessible-length extenders of P. More precisely ile(P) consists of extenders E ∈ P such that P “lh(E) is inaccessible and Vlh(E) = V Ult(V ,E)

lh(E)

." We say that P is a pre-iterable structure if P = (P, ile(P)) where P is a transitive model of ZFC.

Nam Trang (joint with G.Sargsyan) Sealing the Universally Baire sets 11 / 27

slide-34
SLIDE 34

Sealing LSA − over − UB Results Sealing and Inner Model Theory Open problems Proof outlines

Inequivalence (cont.)

We let ile(P) be the set of inaccessible-length extenders of P. More precisely ile(P) consists of extenders E ∈ P such that P “lh(E) is inaccessible and Vlh(E) = V Ult(V ,E)

lh(E)

." We say that P is a pre-iterable structure if P = (P, ile(P)) where P is a transitive model of ZFC. Definition We say that self-iterability holds if the following holds in V .

1 gUBH. 2 V = (V , ile(V)) is a pre-iterable structure that has a guB-iteration strategy. Nam Trang (joint with G.Sargsyan) Sealing the Universally Baire sets 11 / 27

slide-35
SLIDE 35

Sealing LSA − over − UB Results Sealing and Inner Model Theory Open problems Proof outlines

Inequivalence (cont.)

We let ile(P) be the set of inaccessible-length extenders of P. More precisely ile(P) consists of extenders E ∈ P such that P “lh(E) is inaccessible and Vlh(E) = V Ult(V ,E)

lh(E)

." We say that P is a pre-iterable structure if P = (P, ile(P)) where P is a transitive model of ZFC. Definition We say that self-iterability holds if the following holds in V .

1 gUBH. 2 V = (V , ile(V)) is a pre-iterable structure that has a guB-iteration strategy.

Notice that because of clause 1, the iteration strategy in clause 2 is unique.

Nam Trang (joint with G.Sargsyan) Sealing the Universally Baire sets 11 / 27

slide-36
SLIDE 36

Sealing LSA − over − UB Results Sealing and Inner Model Theory Open problems Proof outlines

Inequivalence (cont.)

We let ile(P) be the set of inaccessible-length extenders of P. More precisely ile(P) consists of extenders E ∈ P such that P “lh(E) is inaccessible and Vlh(E) = V Ult(V ,E)

lh(E)

." We say that P is a pre-iterable structure if P = (P, ile(P)) where P is a transitive model of ZFC. Definition We say that self-iterability holds if the following holds in V .

1 gUBH. 2 V = (V , ile(V)) is a pre-iterable structure that has a guB-iteration strategy.

Notice that because of clause 1, the iteration strategy in clause 2 is unique. Theorem (Sargsyan-T., 2018-2019, [ST19c]) Assume self-iterability holds, and suppose there is a class of Woodin cardinals and a strong

  • cardinal. Let κ be the least strong cardinal of V and let g ⊆ Coll(ω, κ+) be V -generic. Then

V [g] Sealing.

Nam Trang (joint with G.Sargsyan) Sealing the Universally Baire sets 11 / 27

slide-37
SLIDE 37

Sealing LSA − over − UB Results Sealing and Inner Model Theory Open problems Proof outlines

Inequivalence (cont.)

No Long Extender (NLE) is the statement: there is no countable, ω1 + 1-iterable pure extender premouse M such that there is a long extender on the M-sequence.

Nam Trang (joint with G.Sargsyan) Sealing the Universally Baire sets 12 / 27

slide-38
SLIDE 38

Sealing LSA − over − UB Results Sealing and Inner Model Theory Open problems Proof outlines

Inequivalence (cont.)

No Long Extender (NLE) is the statement: there is no countable, ω1 + 1-iterable pure extender premouse M such that there is a long extender on the M-sequence. Theorem (Sargsyan-T., 2019, [ST19c]) Let V be the universe of an lbr hod mouse with a proper class of Woodin cardinals and a strong

  • cardinal. Assume NLE. Let κ be the least strong cardinal of P and g ⊆ Coll(ω, κ+) be

V -generic. Then V [g] Sealing holds and LSA − over − UB fails. Therefore, Sealing and LSA − over − UB are not equivalent.

Nam Trang (joint with G.Sargsyan) Sealing the Universally Baire sets 12 / 27

slide-39
SLIDE 39

Sealing LSA − over − UB Results Sealing and Inner Model Theory Open problems Proof outlines

Inequivalence (cont.)

No Long Extender (NLE) is the statement: there is no countable, ω1 + 1-iterable pure extender premouse M such that there is a long extender on the M-sequence. Theorem (Sargsyan-T., 2019, [ST19c]) Let V be the universe of an lbr hod mouse with a proper class of Woodin cardinals and a strong

  • cardinal. Assume NLE. Let κ be the least strong cardinal of P and g ⊆ Coll(ω, κ+) be

V -generic. Then V [g] Sealing holds and LSA − over − UB fails. Therefore, Sealing and LSA − over − UB are not equivalent. The notion of least-branch hod mice (lbr hod mice) is defined precisely in [Ste16, Section 5].

Nam Trang (joint with G.Sargsyan) Sealing the Universally Baire sets 12 / 27

slide-40
SLIDE 40

Sealing LSA − over − UB Results Sealing and Inner Model Theory Open problems Proof outlines

Inequivalence (cont.)

No Long Extender (NLE) is the statement: there is no countable, ω1 + 1-iterable pure extender premouse M such that there is a long extender on the M-sequence. Theorem (Sargsyan-T., 2019, [ST19c]) Let V be the universe of an lbr hod mouse with a proper class of Woodin cardinals and a strong

  • cardinal. Assume NLE. Let κ be the least strong cardinal of P and g ⊆ Coll(ω, κ+) be

V -generic. Then V [g] Sealing holds and LSA − over − UB fails. Therefore, Sealing and LSA − over − UB are not equivalent. The notion of least-branch hod mice (lbr hod mice) is defined precisely in [Ste16, Section 5].

Nam Trang (joint with G.Sargsyan) Sealing the Universally Baire sets 12 / 27

slide-41
SLIDE 41

Sealing LSA − over − UB Results Sealing and Inner Model Theory Open problems Proof outlines

Sealing dichotomy

If M is a model that conforms to the norms of modern inner model theory and has some very basic closure properties then M “there is a well-ordering of reals in L(Hom∞, R)". As AD implies the reals cannot be well-ordered, M cannot satisfy Sealing.

Nam Trang (joint with G.Sargsyan) Sealing the Universally Baire sets 13 / 27

slide-42
SLIDE 42

Sealing LSA − over − UB Results Sealing and Inner Model Theory Open problems Proof outlines

Sealing dichotomy

If M is a model that conforms to the norms of modern inner model theory and has some very basic closure properties then M “there is a well-ordering of reals in L(Hom∞, R)". As AD implies the reals cannot be well-ordered, M cannot satisfy Sealing. Sealing Dichotomy Either no large cardinal theory implies Sealing or the Inner Model Problem for some large cardinal cannot have a solution conforming to the modern norms.

Nam Trang (joint with G.Sargsyan) Sealing the Universally Baire sets 13 / 27

slide-43
SLIDE 43

Sealing LSA − over − UB Results Sealing and Inner Model Theory Open problems Proof outlines

Sealing dichotomy

If M is a model that conforms to the norms of modern inner model theory and has some very basic closure properties then M “there is a well-ordering of reals in L(Hom∞, R)". As AD implies the reals cannot be well-ordered, M cannot satisfy Sealing. Sealing Dichotomy Either no large cardinal theory implies Sealing or the Inner Model Problem for some large cardinal cannot have a solution conforming to the modern norms. Our improved upper bound for Sealing puts its consistency strength well within the short extender

  • region. Though we do not expect Sealing to be a consequence of any such large cardinal

hypothesis in this region.

Nam Trang (joint with G.Sargsyan) Sealing the Universally Baire sets 13 / 27

slide-44
SLIDE 44

Sealing LSA − over − UB Results Sealing and Inner Model Theory Open problems Proof outlines

Inner Model Problem (IMPr) and the Core Model Induction

Our interpretation of IMPr is influenced by John Steel’s view on Gödel’s Program (see [Ste14]). In a nutshell, the idea is to develop a theory that connects various foundational frameworks such as Forcing Axioms, Large Cardinals, Determinacy Axioms etc with one another. In this view, IMPr is the bridge between all of these natural frameworks and IMPr needs to be solved under variety of hypotheses, such as PFA or failure of Jensen’s principles. Our primary tool for solving IMPr in large-cardinal-free contexts is the Core Model Induction (CMI).

Nam Trang (joint with G.Sargsyan) Sealing the Universally Baire sets 14 / 27

slide-45
SLIDE 45

Sealing LSA − over − UB Results Sealing and Inner Model Theory Open problems Proof outlines

Inner Model Problem (IMPr) and the Core Model Induction

Our interpretation of IMPr is influenced by John Steel’s view on Gödel’s Program (see [Ste14]). In a nutshell, the idea is to develop a theory that connects various foundational frameworks such as Forcing Axioms, Large Cardinals, Determinacy Axioms etc with one another. In this view, IMPr is the bridge between all of these natural frameworks and IMPr needs to be solved under variety of hypotheses, such as PFA or failure of Jensen’s principles. Our primary tool for solving IMPr in large-cardinal-free contexts is the Core Model Induction (CMI). In the earlier days, CMI was perceived as an inductive method for proving determinacy in models such as L(R). The goal was to prove that Lα(R) AD by induction on α. In those earlier days, which is approximately the period 1995-2010, the method worked by establishing intricate connections between large cardinals, universally Baire sets and determinacy.

Nam Trang (joint with G.Sargsyan) Sealing the Universally Baire sets 14 / 27

slide-46
SLIDE 46

Sealing LSA − over − UB Results Sealing and Inner Model Theory Open problems Proof outlines

Derived Model Theorem and the Core Model Induction

Recall Woodin’s Derived Model Theorem. A typical situation works as follows. Suppose λ is a limit of Woodin cardinals and g ⊆ Coll(ω, < λ) is generic. Let R∗ = ∪α<λRV [g∩Coll(ω,α)]. Working in V (R∗), let Hom = {A ⊆ R : L(A, R) AD}. Then

Nam Trang (joint with G.Sargsyan) Sealing the Universally Baire sets 15 / 27

slide-47
SLIDE 47

Sealing LSA − over − UB Results Sealing and Inner Model Theory Open problems Proof outlines

Derived Model Theorem and the Core Model Induction

Recall Woodin’s Derived Model Theorem. A typical situation works as follows. Suppose λ is a limit of Woodin cardinals and g ⊆ Coll(ω, < λ) is generic. Let R∗ = ∪α<λRV [g∩Coll(ω,α)]. Working in V (R∗), let Hom = {A ⊆ R : L(A, R) AD}. Then Theorem (Woodin) L(Hom, R) AD.

Nam Trang (joint with G.Sargsyan) Sealing the Universally Baire sets 15 / 27

slide-48
SLIDE 48

Sealing LSA − over − UB Results Sealing and Inner Model Theory Open problems Proof outlines

Derived Model Theorem and the Core Model Induction

Recall Woodin’s Derived Model Theorem. A typical situation works as follows. Suppose λ is a limit of Woodin cardinals and g ⊆ Coll(ω, < λ) is generic. Let R∗ = ∪α<λRV [g∩Coll(ω,α)]. Working in V (R∗), let Hom = {A ⊆ R : L(A, R) AD}. Then Theorem (Woodin) L(Hom, R) AD. In Woodin’s theorem, Hom is maximal as there are no more (strongly) determined sets in the universe that are not in Hom. If one assumes that λ is a limit of strong cardinals then Hom above is just HomV (R∗)

.

Nam Trang (joint with G.Sargsyan) Sealing the Universally Baire sets 15 / 27

slide-49
SLIDE 49

Sealing LSA − over − UB Results Sealing and Inner Model Theory Open problems Proof outlines

Derived Model Theorem and the Core Model Induction

Recall Woodin’s Derived Model Theorem. A typical situation works as follows. Suppose λ is a limit of Woodin cardinals and g ⊆ Coll(ω, < λ) is generic. Let R∗ = ∪α<λRV [g∩Coll(ω,α)]. Working in V (R∗), let Hom = {A ⊆ R : L(A, R) AD}. Then Theorem (Woodin) L(Hom, R) AD. In Woodin’s theorem, Hom is maximal as there are no more (strongly) determined sets in the universe that are not in Hom. If one assumes that λ is a limit of strong cardinals then Hom above is just HomV (R∗)

. The aim of CMI is to do the same for other natural set theoretic frameworks, such as forcing axioms, combinatorial statements etc. Suppose T is a natural set theoretic framework and V T. Let κ be an uncountable cardinal. One way to perceive CMI is the following. (CMI at κ) Saying that one is doing Core Model Induction at κ means that for some g ⊆ Coll(ω, κ), in V [g], one is proving that L(Hom∞, R) AD+.

Nam Trang (joint with G.Sargsyan) Sealing the Universally Baire sets 15 / 27

slide-50
SLIDE 50

Sealing LSA − over − UB Results Sealing and Inner Model Theory Open problems Proof outlines

Derived Model Theorem and the Core Model Induction

Recall Woodin’s Derived Model Theorem. A typical situation works as follows. Suppose λ is a limit of Woodin cardinals and g ⊆ Coll(ω, < λ) is generic. Let R∗ = ∪α<λRV [g∩Coll(ω,α)]. Working in V (R∗), let Hom = {A ⊆ R : L(A, R) AD}. Then Theorem (Woodin) L(Hom, R) AD. In Woodin’s theorem, Hom is maximal as there are no more (strongly) determined sets in the universe that are not in Hom. If one assumes that λ is a limit of strong cardinals then Hom above is just HomV (R∗)

. The aim of CMI is to do the same for other natural set theoretic frameworks, such as forcing axioms, combinatorial statements etc. Suppose T is a natural set theoretic framework and V T. Let κ be an uncountable cardinal. One way to perceive CMI is the following. (CMI at κ) Saying that one is doing Core Model Induction at κ means that for some g ⊆ Coll(ω, κ), in V [g], one is proving that L(Hom∞, R) AD+. (CMI below κ) Saying that one is doing Core Model Induction below κ means that for some g ⊆ Coll(ω, < κ), in V [g], one is proving that L(Hom∞, R) AD+.

Nam Trang (joint with G.Sargsyan) Sealing the Universally Baire sets 15 / 27

slide-51
SLIDE 51

Sealing LSA − over − UB Results Sealing and Inner Model Theory Open problems Proof outlines

Derived Model Theorem and the Core Model Induction

Recall Woodin’s Derived Model Theorem. A typical situation works as follows. Suppose λ is a limit of Woodin cardinals and g ⊆ Coll(ω, < λ) is generic. Let R∗ = ∪α<λRV [g∩Coll(ω,α)]. Working in V (R∗), let Hom = {A ⊆ R : L(A, R) AD}. Then Theorem (Woodin) L(Hom, R) AD. In Woodin’s theorem, Hom is maximal as there are no more (strongly) determined sets in the universe that are not in Hom. If one assumes that λ is a limit of strong cardinals then Hom above is just HomV (R∗)

. The aim of CMI is to do the same for other natural set theoretic frameworks, such as forcing axioms, combinatorial statements etc. Suppose T is a natural set theoretic framework and V T. Let κ be an uncountable cardinal. One way to perceive CMI is the following. (CMI at κ) Saying that one is doing Core Model Induction at κ means that for some g ⊆ Coll(ω, κ), in V [g], one is proving that L(Hom∞, R) AD+. (CMI below κ) Saying that one is doing Core Model Induction below κ means that for some g ⊆ Coll(ω, < κ), in V [g], one is proving that L(Hom∞, R) AD+. In both cases, the aim might be less ambitious. It might be that one’s goal is to just produce Γ ⊆ Hom∞ such that L(Γ, R) is a determinacy model with desired properties.

Nam Trang (joint with G.Sargsyan) Sealing the Universally Baire sets 15 / 27

slide-52
SLIDE 52

Sealing LSA − over − UB Results Sealing and Inner Model Theory Open problems Proof outlines

UB − Covering

Suppose we do our CMI below κ. The current methodology for proving that HODL(Hom∞,R) has the desired large cardinals is via a failure of certain covering principle involving HODL(Hom∞,R). Set H− = (HOD|Θ)L(Hom∞,R).

Nam Trang (joint with G.Sargsyan) Sealing the Universally Baire sets 16 / 27

slide-53
SLIDE 53

Sealing LSA − over − UB Results Sealing and Inner Model Theory Open problems Proof outlines

UB − Covering

Suppose we do our CMI below κ. The current methodology for proving that HODL(Hom∞,R) has the desired large cardinals is via a failure of certain covering principle involving HODL(Hom∞,R). Set H− = (HOD|Θ)L(Hom∞,R). We simply let H be the union of all hod mice extending H whose countable submodels have iteration strategies in L(Hom∞, R).

Nam Trang (joint with G.Sargsyan) Sealing the Universally Baire sets 16 / 27

slide-54
SLIDE 54

Sealing LSA − over − UB Results Sealing and Inner Model Theory Open problems Proof outlines

UB − Covering

Suppose we do our CMI below κ. The current methodology for proving that HODL(Hom∞,R) has the desired large cardinals is via a failure of certain covering principle involving HODL(Hom∞,R). Set H− = (HOD|Θ)L(Hom∞,R). We simply let H be the union of all hod mice extending H whose countable submodels have iteration strategies in L(Hom∞, R). Let now g ⊆ Coll(ω, κ) be V -generic. Because |Vκ| = κ, we have that |H−|V [g] = ℵ0 and |H|V [g] ≤ ℵ1. Letting η = Ord ∩ H, L(Hom∞

g , Rg) “there is an η-sequence of distinct reals".

Nam Trang (joint with G.Sargsyan) Sealing the Universally Baire sets 16 / 27

slide-55
SLIDE 55

Sealing LSA − over − UB Results Sealing and Inner Model Theory Open problems Proof outlines

UB − Covering

Suppose we do our CMI below κ. The current methodology for proving that HODL(Hom∞,R) has the desired large cardinals is via a failure of certain covering principle involving HODL(Hom∞,R). Set H− = (HOD|Θ)L(Hom∞,R). We simply let H be the union of all hod mice extending H whose countable submodels have iteration strategies in L(Hom∞, R). Let now g ⊆ Coll(ω, κ) be V -generic. Because |Vκ| = κ, we have that |H−|V [g] = ℵ0 and |H|V [g] ≤ ℵ1. Letting η = Ord ∩ H, L(Hom∞

g , Rg) “there is an η-sequence of distinct reals".

Assuming Sealing, we get that η < ω1 as under Sealing, L(Hom∞

g , Rg) AD, and under AD there

is no ω1-sequence of reals. Therefore, in V , η < κ+ as we have that (κ+)V = ωV [g]

1

. Letting now Definition UB − Covering : cfV (Ord ∩ H) ≥ κ,

Nam Trang (joint with G.Sargsyan) Sealing the Universally Baire sets 16 / 27

slide-56
SLIDE 56

Sealing LSA − over − UB Results Sealing and Inner Model Theory Open problems Proof outlines

UB − Covering

Suppose we do our CMI below κ. The current methodology for proving that HODL(Hom∞,R) has the desired large cardinals is via a failure of certain covering principle involving HODL(Hom∞,R). Set H− = (HOD|Θ)L(Hom∞,R). We simply let H be the union of all hod mice extending H whose countable submodels have iteration strategies in L(Hom∞, R). Let now g ⊆ Coll(ω, κ) be V -generic. Because |Vκ| = κ, we have that |H−|V [g] = ℵ0 and |H|V [g] ≤ ℵ1. Letting η = Ord ∩ H, L(Hom∞

g , Rg) “there is an η-sequence of distinct reals".

Assuming Sealing, we get that η < ω1 as under Sealing, L(Hom∞

g , Rg) AD, and under AD there

is no ω1-sequence of reals. Therefore, in V , η < κ+ as we have that (κ+)V = ωV [g]

1

. Letting now Definition UB − Covering : cfV (Ord ∩ H) ≥ κ, Sealing implies that UB − Covering fails at measurable cardinals. A similar argument can be carried out by only assuming that κ is a singular strong limit cardinal.

Nam Trang (joint with G.Sargsyan) Sealing the Universally Baire sets 16 / 27

slide-57
SLIDE 57

Sealing LSA − over − UB Results Sealing and Inner Model Theory Open problems Proof outlines

Sealing and UB − covering

The argument that has been used to show that H has large cardinals proceeds as follows. Pick a target large cardinal φ, which for technical reasons we assume is a Σ2-formula. Assume H ∀Hom¬φ(Hom). Thus far, in many major applications of the CMI, the facts that

Nam Trang (joint with G.Sargsyan) Sealing the Universally Baire sets 17 / 27

slide-58
SLIDE 58

Sealing LSA − over − UB Results Sealing and Inner Model Theory Open problems Proof outlines

Sealing and UB − covering

The argument that has been used to show that H has large cardinals proceeds as follows. Pick a target large cardinal φ, which for technical reasons we assume is a Σ2-formula. Assume H ∀Hom¬φ(Hom). Thus far, in many major applications of the CMI, the facts that φ − Minimality : H ∀γ¬φ(γ) and ¬ UB − Covering: cfV (H ∩ Ord) < κ

Nam Trang (joint with G.Sargsyan) Sealing the Universally Baire sets 17 / 27

slide-59
SLIDE 59

Sealing LSA − over − UB Results Sealing and Inner Model Theory Open problems Proof outlines

Sealing and UB − covering

The argument that has been used to show that H has large cardinals proceeds as follows. Pick a target large cardinal φ, which for technical reasons we assume is a Σ2-formula. Assume H ∀Hom¬φ(Hom). Thus far, in many major applications of the CMI, the facts that φ − Minimality : H ∀γ¬φ(γ) and ¬ UB − Covering: cfV (H ∩ Ord) < κ hold have been used to prove that there is a universally Baire set not in Hom∞

g

where g ⊆ Coll(ω, κ) or g ⊆ Coll(ω, < κ) (depending where we do CMI), which is obviously a contradiction.

Nam Trang (joint with G.Sargsyan) Sealing the Universally Baire sets 17 / 27

slide-60
SLIDE 60

Sealing LSA − over − UB Results Sealing and Inner Model Theory Open problems Proof outlines

Sealing and UB − covering

The argument that has been used to show that H has large cardinals proceeds as follows. Pick a target large cardinal φ, which for technical reasons we assume is a Σ2-formula. Assume H ∀Hom¬φ(Hom). Thus far, in many major applications of the CMI, the facts that φ − Minimality : H ∀γ¬φ(γ) and ¬ UB − Covering: cfV (H ∩ Ord) < κ hold have been used to prove that there is a universally Baire set not in Hom∞

g

where g ⊆ Coll(ω, κ) or g ⊆ Coll(ω, < κ) (depending where we do CMI), which is obviously a contradiction. Because of the work done in the first 15 years of the 2000s, it seemed as though this is a general pattern that will persist through the short extender region. That is, for any φ that is in the short extender region, either φ − Minimality must fail or UB − Covering must hold.

Nam Trang (joint with G.Sargsyan) Sealing the Universally Baire sets 17 / 27

slide-61
SLIDE 61

Sealing LSA − over − UB Results Sealing and Inner Model Theory Open problems Proof outlines

Sealing and UB − covering

The argument that has been used to show that H has large cardinals proceeds as follows. Pick a target large cardinal φ, which for technical reasons we assume is a Σ2-formula. Assume H ∀Hom¬φ(Hom). Thus far, in many major applications of the CMI, the facts that φ − Minimality : H ∀γ¬φ(γ) and ¬ UB − Covering: cfV (H ∩ Ord) < κ hold have been used to prove that there is a universally Baire set not in Hom∞

g

where g ⊆ Coll(ω, κ) or g ⊆ Coll(ω, < κ) (depending where we do CMI), which is obviously a contradiction. Because of the work done in the first 15 years of the 2000s, it seemed as though this is a general pattern that will persist through the short extender region. That is, for any φ that is in the short extender region, either φ − Minimality must fail or UB − Covering must hold. The main way the work on consistency of Sealing affects IMPr in the short extender region is by implying that this methodology cannot work at the level of Sealing and beyond.

Nam Trang (joint with G.Sargsyan) Sealing the Universally Baire sets 17 / 27

slide-62
SLIDE 62

Sealing LSA − over − UB Results Sealing and Inner Model Theory Open problems Proof outlines

One path forward

One way to move forward with CMI past Sealing is to develop techniques for building third order canonical objects, objects that are canonical subsets of Hom∞. CMI should be viewed as a technique for proving that certain type of covering holds rather than a technique for showing that HOD has large cardinals.

Nam Trang (joint with G.Sargsyan) Sealing the Universally Baire sets 18 / 27

slide-63
SLIDE 63

Sealing LSA − over − UB Results Sealing and Inner Model Theory Open problems Proof outlines

One path forward

One way to move forward with CMI past Sealing is to develop techniques for building third order canonical objects, objects that are canonical subsets of Hom∞. CMI should be viewed as a technique for proving that certain type of covering holds rather than a technique for showing that HOD has large cardinals. Conjecture Assume NLE and suppose there are unboundedly many Woodin cardinals and strong cardinals. Let κ be a limit of Woodin cardinals and strong cardinals such that either cof(κ) = κ or cof(κ) = ω. Then there is a transitive model M of ZFC − Powerset such that

1 cof(Ord ∩ M) ≥ κ, 2 M has a largest cardinal ν, 3 for any g ⊆ Coll(ω, < κ), letting R∗ =

α<κ RV [g∩Coll(ω,α)], in V (R∗),

L(M,

α<ν(M|α)ω, Hom∞, R) AD.

Nam Trang (joint with G.Sargsyan) Sealing the Universally Baire sets 18 / 27

slide-64
SLIDE 64

Sealing LSA − over − UB Results Sealing and Inner Model Theory Open problems Proof outlines

One path forward

One way to move forward with CMI past Sealing is to develop techniques for building third order canonical objects, objects that are canonical subsets of Hom∞. CMI should be viewed as a technique for proving that certain type of covering holds rather than a technique for showing that HOD has large cardinals. Conjecture Assume NLE and suppose there are unboundedly many Woodin cardinals and strong cardinals. Let κ be a limit of Woodin cardinals and strong cardinals such that either cof(κ) = κ or cof(κ) = ω. Then there is a transitive model M of ZFC − Powerset such that

1 cof(Ord ∩ M) ≥ κ, 2 M has a largest cardinal ν, 3 for any g ⊆ Coll(ω, < κ), letting R∗ =

α<κ RV [g∩Coll(ω,α)], in V (R∗),

L(M,

α<ν(M|α)ω, Hom∞, R) AD.

Remark: G. Sargsyan has shown that the conjecture holds in various lbr hod mice.

Nam Trang (joint with G.Sargsyan) Sealing the Universally Baire sets 18 / 27

slide-65
SLIDE 65

Sealing LSA − over − UB Results Sealing and Inner Model Theory Open problems Proof outlines

Hierarchy relations

Large Cardinals Determinacy HOD Combinatorial Theories Supercompact PFA, MM WLW ? ? LSA − over − UB excellent Sealing WLW ω1 is (str/super)compact lsa-type hod pair LSA Θ reg-hypo ADR+Θ regular Regular lim of Wdns ω1 is P(R)-spct, MM(c) ω1 is P(R)-str.cpct. non-domestic ADR + DC ω1 Woodins ADR-hypo ADR ω Woodins ω Woodins AD 1 Woodin AD + ω1 is R-str.cpct.

Nam Trang (joint with G.Sargsyan) Sealing the Universally Baire sets 19 / 27

slide-66
SLIDE 66

Sealing LSA − over − UB Results Sealing and Inner Model Theory Open problems Proof outlines

Core Model Induction test question

As mentioned above, CMI becomes very difficult past Sealing. A good test question for CMI practitioners is.

Nam Trang (joint with G.Sargsyan) Sealing the Universally Baire sets 20 / 27

slide-67
SLIDE 67

Sealing LSA − over − UB Results Sealing and Inner Model Theory Open problems Proof outlines

Core Model Induction test question

As mentioned above, CMI becomes very difficult past Sealing. A good test question for CMI practitioners is. Open Problem Prove that Con(PFA) implies Con(WLW).

Nam Trang (joint with G.Sargsyan) Sealing the Universally Baire sets 20 / 27

slide-68
SLIDE 68

Sealing LSA − over − UB Results Sealing and Inner Model Theory Open problems Proof outlines

Core Model Induction test question

As mentioned above, CMI becomes very difficult past Sealing. A good test question for CMI practitioners is. Open Problem Prove that Con(PFA) implies Con(WLW). We know from the results above that WLW is stronger than Sealing and is roughly the strongest natural theory at the limit of traditional methods for proving iterability. We believe it is plausible to develop CMI methods for obtaining canonical models of WLW from just PFA.

Nam Trang (joint with G.Sargsyan) Sealing the Universally Baire sets 20 / 27

slide-69
SLIDE 69

Sealing LSA − over − UB Results Sealing and Inner Model Theory Open problems Proof outlines

Core Model Induction test question

As mentioned above, CMI becomes very difficult past Sealing. A good test question for CMI practitioners is. Open Problem Prove that Con(PFA) implies Con(WLW). We know from the results above that WLW is stronger than Sealing and is roughly the strongest natural theory at the limit of traditional methods for proving iterability. We believe it is plausible to develop CMI methods for obtaining canonical models of WLW from just PFA. Assuming PFA and there is a Woodin cardinal, then there is a canonical model of WLW. The proof is not via CMI methods, but just an observation that the full-backgrounded construction as done in [Nee02] reaches a model of WLW. The Woodin cardinal assumption is important here. The argument would not work if one assumes just PFA and/or a large cardinal milder than a Woodin cardinal, e.g. a measurable cardinal or a strong cardinal.

Nam Trang (joint with G.Sargsyan) Sealing the Universally Baire sets 20 / 27

slide-70
SLIDE 70

Sealing LSA − over − UB Results Sealing and Inner Model Theory Open problems Proof outlines

Core Model Induction test question

As mentioned above, CMI becomes very difficult past Sealing. A good test question for CMI practitioners is. Open Problem Prove that Con(PFA) implies Con(WLW). We know from the results above that WLW is stronger than Sealing and is roughly the strongest natural theory at the limit of traditional methods for proving iterability. We believe it is plausible to develop CMI methods for obtaining canonical models of WLW from just PFA. Assuming PFA and there is a Woodin cardinal, then there is a canonical model of WLW. The proof is not via CMI methods, but just an observation that the full-backgrounded construction as done in [Nee02] reaches a model of WLW. The Woodin cardinal assumption is important here. The argument would not work if one assumes just PFA and/or a large cardinal milder than a Woodin cardinal, e.g. a measurable cardinal or a strong cardinal. The paper [ST19a] is the first step towards this goal; in [ST19a], we have constructed from PFA hod mice (Z-hod pairs) that are stronger than an excellent hybrid mouse.

Nam Trang (joint with G.Sargsyan) Sealing the Universally Baire sets 20 / 27

slide-71
SLIDE 71

Sealing LSA − over − UB Results Sealing and Inner Model Theory Open problems Proof outlines

Core Model Induction test question

As mentioned above, CMI becomes very difficult past Sealing. A good test question for CMI practitioners is. Open Problem Prove that Con(PFA) implies Con(WLW). We know from the results above that WLW is stronger than Sealing and is roughly the strongest natural theory at the limit of traditional methods for proving iterability. We believe it is plausible to develop CMI methods for obtaining canonical models of WLW from just PFA. Assuming PFA and there is a Woodin cardinal, then there is a canonical model of WLW. The proof is not via CMI methods, but just an observation that the full-backgrounded construction as done in [Nee02] reaches a model of WLW. The Woodin cardinal assumption is important here. The argument would not work if one assumes just PFA and/or a large cardinal milder than a Woodin cardinal, e.g. a measurable cardinal or a strong cardinal. The paper [ST19a] is the first step towards this goal; in [ST19a], we have constructed from PFA hod mice (Z-hod pairs) that are stronger than an excellent hybrid mouse.

Nam Trang (joint with G.Sargsyan) Sealing the Universally Baire sets 20 / 27

slide-72
SLIDE 72

Sealing LSA − over − UB Results Sealing and Inner Model Theory Open problems Proof outlines

Equivalence/equiconsistency at the level of Sealing

Conjecture Are the following theories equiconsistent?

1 Sealing + “There is a proper class of Woodin cardinals". 2 LSA − over − uB + “There is a proper class of Woodin cardinals". 3 Tower Sealing + “There is a proper class of Woodin cardinals". Nam Trang (joint with G.Sargsyan) Sealing the Universally Baire sets 21 / 27

slide-73
SLIDE 73

Sealing LSA − over − UB Results Sealing and Inner Model Theory Open problems Proof outlines

Equivalence/equiconsistency at the level of Sealing

Conjecture Are the following theories equiconsistent?

1 Sealing + “There is a proper class of Woodin cardinals". 2 LSA − over − uB + “There is a proper class of Woodin cardinals". 3 Tower Sealing + “There is a proper class of Woodin cardinals".

Conjecture Suppose there are unboundedly many Woodin cardinals and the class of measurable cardinals is

  • stationary. Then the following are equivalent.

1 Sealing. 2 Sealing+. 3 Weak Sealing. 4 Sealing−. 5 Tower Sealing. Nam Trang (joint with G.Sargsyan) Sealing the Universally Baire sets 21 / 27

slide-74
SLIDE 74

Sealing LSA − over − UB Results Sealing and Inner Model Theory Open problems Proof outlines

Theorem (Sargsyan-T., 2018-2019, [ST19c]) Assume self-iterability holds, and suppose there is a class of Woodin cardinals and a strong

  • cardinal. Let κ be the least strong cardinal of V and let g ⊆ Coll(ω, κ+) be V -generic. Then

V [g] Sealing.

Nam Trang (joint with G.Sargsyan) Sealing the Universally Baire sets 22 / 27

slide-75
SLIDE 75

Sealing LSA − over − UB Results Sealing and Inner Model Theory Open problems Proof outlines

Theorem (Sargsyan-T., 2018-2019, [ST19c]) Assume self-iterability holds, and suppose there is a class of Woodin cardinals and a strong

  • cardinal. Let κ be the least strong cardinal of V and let g ⊆ Coll(ω, κ+) be V -generic. Then

V [g] Sealing. Working in V [g ∗ h], let D(h, η, δ, λ) be the club of countable X ≺ ((Wλ[g ∗ h], u)|Ψg

η,δ)

such that HV

ι ∪ {g} ⊆ X.

Nam Trang (joint with G.Sargsyan) Sealing the Universally Baire sets 22 / 27

slide-76
SLIDE 76

Sealing LSA − over − UB Results Sealing and Inner Model Theory Open problems Proof outlines

Theorem (Sargsyan-T., 2018-2019, [ST19c]) Assume self-iterability holds, and suppose there is a class of Woodin cardinals and a strong

  • cardinal. Let κ be the least strong cardinal of V and let g ⊆ Coll(ω, κ+) be V -generic. Then

V [g] Sealing. Working in V [g ∗ h], let D(h, η, δ, λ) be the club of countable X ≺ ((Wλ[g ∗ h], u)|Ψg

η,δ)

such that HV

ι ∪ {g} ⊆ X.

Suppose A ∈ Hom∞

g∗h. Then for a club of X ∈ D(h, η, δ, λ), A is Suslin, co-Sulsin captured by

(MX , δX , ΛX ) and A is projective in ΛX . Given such an X, we say X captures A.

Nam Trang (joint with G.Sargsyan) Sealing the Universally Baire sets 22 / 27

slide-77
SLIDE 77

Sealing LSA − over − UB Results Sealing and Inner Model Theory Open problems Proof outlines

Theorem (Sargsyan-T., 2018-2019, [ST19c]) Assume self-iterability holds, and suppose there is a class of Woodin cardinals and a strong

  • cardinal. Let κ be the least strong cardinal of V and let g ⊆ Coll(ω, κ+) be V -generic. Then

V [g] Sealing. Working in V [g ∗ h], let D(h, η, δ, λ) be the club of countable X ≺ ((Wλ[g ∗ h], u)|Ψg

η,δ)

such that HV

ι ∪ {g} ⊆ X.

Suppose A ∈ Hom∞

g∗h. Then for a club of X ∈ D(h, η, δ, λ), A is Suslin, co-Sulsin captured by

(MX , δX , ΛX ) and A is projective in ΛX . Given such an X, we say X captures A. Let k ⊆ Coll(ω, Hom∞

g∗h) be generic, and let (Ai : i < ω) = Hom∞ g∗h and (wi : i < ω) = Rg∗h be

generic enumerations in V [g ∗ h ∗ k]. Let (Xi : i < ω) ∈ V [g ∗ h ∗ k] be such that for each i

1 Xi ∈ D(h, η, δ, λ), and 2 Xi captures Ai.

In particular, Ai is projective in ΛX ′

i , where X ′

i = Xi ∩ Wλ.

Nam Trang (joint with G.Sargsyan) Sealing the Universally Baire sets 22 / 27

slide-78
SLIDE 78

Sealing LSA − over − UB Results Sealing and Inner Model Theory Open problems Proof outlines

Theorem (Sargsyan-T., 2018-2019, [ST19c]) Assume self-iterability holds, and suppose there is a class of Woodin cardinals and a strong

  • cardinal. Let κ be the least strong cardinal of V and let g ⊆ Coll(ω, κ+) be V -generic. Then

V [g] Sealing. Working in V [g ∗ h], let D(h, η, δ, λ) be the club of countable X ≺ ((Wλ[g ∗ h], u)|Ψg

η,δ)

such that HV

ι ∪ {g} ⊆ X.

Suppose A ∈ Hom∞

g∗h. Then for a club of X ∈ D(h, η, δ, λ), A is Suslin, co-Sulsin captured by

(MX , δX , ΛX ) and A is projective in ΛX . Given such an X, we say X captures A. Let k ⊆ Coll(ω, Hom∞

g∗h) be generic, and let (Ai : i < ω) = Hom∞ g∗h and (wi : i < ω) = Rg∗h be

generic enumerations in V [g ∗ h ∗ k]. Let (Xi : i < ω) ∈ V [g ∗ h ∗ k] be such that for each i

1 Xi ∈ D(h, η, δ, λ), and 2 Xi captures Ai.

In particular, Ai is projective in ΛX ′

i , where X ′

i = Xi ∩ Wλ.

We set M0

n = M′ Xn, π0 n = πX0, P0 = Vλ.

Nam Trang (joint with G.Sargsyan) Sealing the Universally Baire sets 22 / 27

slide-79
SLIDE 79

Sealing LSA − over − UB Results Sealing and Inner Model Theory Open problems Proof outlines

Theorem (Sargsyan-T., 2018-2019, [ST19c]) Assume self-iterability holds, and suppose there is a class of Woodin cardinals and a strong

  • cardinal. Let κ be the least strong cardinal of V and let g ⊆ Coll(ω, κ+) be V -generic. Then

V [g] Sealing. Working in V [g ∗ h], let D(h, η, δ, λ) be the club of countable X ≺ ((Wλ[g ∗ h], u)|Ψg

η,δ)

such that HV

ι ∪ {g} ⊆ X.

Suppose A ∈ Hom∞

g∗h. Then for a club of X ∈ D(h, η, δ, λ), A is Suslin, co-Sulsin captured by

(MX , δX , ΛX ) and A is projective in ΛX . Given such an X, we say X captures A. Let k ⊆ Coll(ω, Hom∞

g∗h) be generic, and let (Ai : i < ω) = Hom∞ g∗h and (wi : i < ω) = Rg∗h be

generic enumerations in V [g ∗ h ∗ k]. Let (Xi : i < ω) ∈ V [g ∗ h ∗ k] be such that for each i

1 Xi ∈ D(h, η, δ, λ), and 2 Xi captures Ai.

In particular, Ai is projective in ΛX ′

i , where X ′

i = Xi ∩ Wλ.

We set M0

n = M′ Xn, π0 n = πX0, P0 = Vλ.

Then inductively define sequences (Mi

n : i, n < ω), (πi n : i, n < ω), (Λi : i ≤ ω),

(τ i,i+1

n

: i, n < ω),etc. as described in the following diagram.

Nam Trang (joint with G.Sargsyan) Sealing the Universally Baire sets 22 / 27

slide-80
SLIDE 80

Sealing LSA − over − UB Results Sealing and Inner Model Theory Open problems Proof outlines

P0 P

′ 0, F0

U0 P1 F0 P

′ 1, F1

U1 P2 F1 P

′ 2, F2

U2 Pω

. . .

M0 M

′ 0, E0

M1 M2 M3 Mω

. . .

T0 π0 σ0 E0 E1 M0

1

M1

1

M

′ 1, E1

M2

1

M3

1

1

. . .

E0, τ 0,1

1

= τ1 T1 π0

1

π1

1

σ1 E1 M0

2

M1

2

M2

2

M

′ 2, E2

M3

2

2

π0

2

E0, τ 0,1

2

E1, τ 1,2

2

T2 π2

2

σ2 E2 E2 E2

. . .

M0

n

M1

n

M2

n

M3

n

n

. . .

E0, τ 0,1

n

E1, τ 1,2

n

E2, τ 2,3

n

. . .

πω

n

. . . . . . . . . . . .

π0

n

Figure: Diagram of the main argument

Nam Trang (joint with G.Sargsyan) Sealing the Universally Baire sets 23 / 27

slide-81
SLIDE 81

Sealing LSA − over − UB Results Sealing and Inner Model Theory Open problems Proof outlines

Let Mω

n be the direct limit of the {Mk n : k < ω} under the maps τ k,l n ’s.

Nam Trang (joint with G.Sargsyan) Sealing the Universally Baire sets 24 / 27

slide-82
SLIDE 82

Sealing LSA − over − UB Results Sealing and Inner Model Theory Open problems Proof outlines

Let Mω

n be the direct limit of the {Mk n : k < ω} under the maps τ k,l n ’s.

Lemma DM(G)Mω

0 [G] = L(Hom∞

g∗h, Pg∗h).

Nam Trang (joint with G.Sargsyan) Sealing the Universally Baire sets 24 / 27

slide-83
SLIDE 83

Sealing LSA − over − UB Results Sealing and Inner Model Theory Open problems Proof outlines

Let Mω

n be the direct limit of the {Mk n : k < ω} under the maps τ k,l n ’s.

Lemma DM(G)Mω

0 [G] = L(Hom∞

g∗h, Pg∗h).

To get Sealing, dovetail two such iterations.

Nam Trang (joint with G.Sargsyan) Sealing the Universally Baire sets 24 / 27

slide-84
SLIDE 84

Sealing LSA − over − UB Results Sealing and Inner Model Theory Open problems Proof outlines

References I

Paul B. Larson, The stationary tower, University Lecture Series, vol. 32, American Mathematical Society, Providence, RI, 2004, Notes on a course by W. Hugh Woodin. MR 2069032 Itay Neeman, Inner models in the region of a Woodin limit of Woodin cardinals, Ann. Pure

  • Appl. Logic 116 (2002), no. 1-3, 67–155. MR MR1900902 (2003e:03100)

Grigor Sargsyan and Nam Trang, The largest suslin axiom, Submitted. Available at math.rutgers.edu/∼gs481/lsa.pdf. , A core model induction past the largest suslin axiom, In preparation. , The exact consistency strength of the generic absoluteness for the universally baire sets, To appear. , Sealing from iterability, To appear. John R. Steel, Gödel’s program, Interpreting Gödel, Cambridge Univ. Press, Cambridge, 2014, pp. 153–179. MR 3468186 , Normalizing iteration trees and comparing iteration strategies, Available at math.berkeley.edu/∼steel/papers/Publications.html.

Nam Trang (joint with G.Sargsyan) Sealing the Universally Baire sets 25 / 27

slide-85
SLIDE 85

Sealing LSA − over − UB Results Sealing and Inner Model Theory Open problems Proof outlines

References II

  • W. Hugh Woodin, In search of Ultimate-L: the 19th Midrasha Mathematicae Lectures, Bull.
  • Symb. Log. 23 (2017), no. 1, 1–109. MR 3632568

Nam Trang (joint with G.Sargsyan) Sealing the Universally Baire sets 26 / 27

slide-86
SLIDE 86

Sealing LSA − over − UB Results Sealing and Inner Model Theory Open problems Proof outlines

Thank you!

Nam Trang (joint with G.Sargsyan) Sealing the Universally Baire sets 27 / 27