determinacy models and good scales at singular cardinals
play

Determinacy models and good scales at singular cardinals Trevor - PowerPoint PPT Presentation

Background Results Determinacy models and good scales at singular cardinals Trevor Wilson University of California, Irvine Logic in Southern California University of California, Los Angeles November 15, 2014 Trevor Wilson Determinacy


  1. Background Results Determinacy models and good scales at singular cardinals Trevor Wilson University of California, Irvine Logic in Southern California University of California, Los Angeles November 15, 2014 Trevor Wilson Determinacy models and good scales at singular cardinals

  2. Background Results Remark After submitting the title and abstract for this talk, I noticed that the hypothesis of determinacy could be weakened to countable choice for reals, and the conclusion of the existence of good scales could be strengthened in various ways. A better title for the talk would be: Countable choice and combinatorial incompactness principles at singular cardinals. The material about (very) good scales is in an appendix. Trevor Wilson Determinacy models and good scales at singular cardinals

  3. Singular cardinals Background Covering matrices Results Independence from ZFC Symmetric models and countable choice The ordinal numbers 0 , 1 , 2 , 3 . . . , ω, ω + 1 , . . . , ω + ω, ω + ω + 1 , . . . measure the lengths of well-orderings. Example ◮ ω is the order type of the set N = { 0 , 1 , 2 , 3 , . . . } . ◮ ω + 1 is the order type of the set { 0 , 1 / 2 , 3 / 4 , 7 / 8 , . . . 1 } . ◮ ω + ω is the order type of the set { 0 , 1 / 2 , 3 / 4 , 7 / 8 , . . . 1 , 2 , 3 , . . . } . ◮ ω + ω + 1 is the order type of the set { 0 , 1 / 2 , 3 / 4 , 7 / 8 , . . . 1 , 1 + 1 / 2 , 1 + 3 / 4 , 1 + 7 / 8 , . . . 2 } . Trevor Wilson Determinacy models and good scales at singular cardinals

  4. Singular cardinals Background Covering matrices Results Independence from ZFC Symmetric models and countable choice At some point we run out of room in R (but we can still represent ordinals by well-orderings of more general sets.) Definition ω 1 is the least uncountable ordinal. ◮ ω 1 is a cardinal : it does not admit a bijection with any smaller ordinal. ◮ ω 1 = ω + ( cardinal successor .) Definition ω 2 = ω + 1 , ω 3 = ω + 2 , .... Trevor Wilson Determinacy models and good scales at singular cardinals

  5. Singular cardinals Background Covering matrices Results Independence from ZFC Symmetric models and countable choice Notation ω n is also called ℵ n , the n th uncountable cardinal. Definition At the first limit step in the ℵ -sequence, define: ◮ ℵ ω = sup n <ω ℵ n . Equivalently, � where | S n | = ℵ n . ◮ ℵ ω = � � �� n ∈ N S n Remark We can go further: ℵ ω +1 = ℵ + ω , ℵ ω +2 = ℵ + ω +1 , .... Trevor Wilson Determinacy models and good scales at singular cardinals

  6. Singular cardinals Background Covering matrices Results Independence from ZFC Symmetric models and countable choice Definition A cardinal κ is: ◮ regular if sup i <ξ κ i < κ whenever ξ < κ and κ i < κ ◮ singular if it is not regular ◮ countable cofinality if κ = sup i <ω κ i where κ i < κ Example ◮ ℵ 0 is regular: a finite union of finite sets is finite ◮ ℵ 1 is regular: a countable union of countable sets is countable, assuming the Axiom of Countable Choice ◮ ℵ 2 , ℵ 3 ,... are regular, assuming AC ◮ ℵ ω is singular of countable cofinality Trevor Wilson Determinacy models and good scales at singular cardinals

  7. Singular cardinals Background Covering matrices Results Independence from ZFC Symmetric models and countable choice Remark ◮ If κ is a singular cardinal of countable cofinality, then κ is a countable union of sets of size < κ . ◮ If α < κ + then | α | ≤ κ , so α is also a countable union of sets of size < κ . The following definition records this. Definition (Viale 1 ) Let κ be a singular cardinal of countable cofinality. A covering matrix for κ + assigns to each ordinal α < κ + an increasing sequence of subsets ( K α ( i ) : i ∈ N ) such that ◮ α = � i ∈ N K α ( i ) ◮ | K α ( i ) | < κ for all i ∈ N . 1 Note added Nov. 18, 2014: I have been informed that definitions similar to this one and the next one were considered previously by Jensen. Trevor Wilson Determinacy models and good scales at singular cardinals

  8. Singular cardinals Background Covering matrices Results Independence from ZFC Symmetric models and countable choice Definition (Viale) Let κ be a singular cardinal of countable cofinality. A covering matrix ( K α ( i ) : α < κ + , i ∈ N ) for κ + is coherent if whenever α < β < κ + the sequences of subsets of α given by ◮ ( K α ( i ) : i ∈ N ) and ◮ ( K β ( i ) ∩ α : i ∈ N ) are cofinally interleaved with respect to inclusion: every set in one sequence is contained in some set in the other sequence. Remark The existence of coherent covering matrices for successors of singular cardinals is independent of ZFC! Trevor Wilson Determinacy models and good scales at singular cardinals

  9. Singular cardinals Background Covering matrices Results Independence from ZFC Symmetric models and countable choice We consider different models of ZFC: Example ◮ G¨ odel’s constructible universe L is “thin.” It only contains the sets that “need to exist.” ◮ Models of the Proper Forcing Axiom PFA are very “fat.” They have different properties: Example ◮ V = L implies | R | = ℵ 1 . ◮ PFA implies | R | = ℵ 2 . Trevor Wilson Determinacy models and good scales at singular cardinals

  10. Singular cardinals Background Covering matrices Results Independence from ZFC Symmetric models and countable choice Remark V = L and PFA have opposite combinatorial effects: ◮ V = L implies incompactness principles such as � κ . ◮ PFA implies compactness principles such as ¬ � κ . The existence of a coherent covering matrix is a kind of incompactness principle, and in fact we have: Theorem (Viale) Let κ be a singular cardinal of countable cofinality. ◮ V = L implies there is a coherent covering matrix for κ + . ◮ PFA implies there is no coherent covering matrix for κ + . Trevor Wilson Determinacy models and good scales at singular cardinals

  11. Singular cardinals Background Covering matrices Results Independence from ZFC Symmetric models and countable choice Besides the V = L construction, we have this one: Theorem (Viale) Let κ be a singular cardinal of countable cofinality. If there is an inner model W such that 1. ( κ + ) W = κ + , and 2. κ is regular in W , then there is a coherent covering matrix for κ + . Remark The hypothesis is consistent: it can be obtained from a measurable cardinal κ by Prikry forcing. Trevor Wilson Determinacy models and good scales at singular cardinals

  12. Singular cardinals Background Covering matrices Results Independence from ZFC Symmetric models and countable choice Sketch of proof ◮ ( κ + ) W = κ + so for every α < κ + there is a surjection π α : κ → α in W ◮ If α < β < κ + then the sequences ◮ ( π α [ ξ ] : ξ < κ ) and ◮ ( π β [ ξ ] ∩ α : ξ < κ ) are cofinally interleaved because π α and π β live in a model W where κ is regular ◮ κ has countable cofinality, say κ = sup i ∈ N κ i ◮ Define the covering matrix: K α ( i ) = π α [ κ i ] Trevor Wilson Determinacy models and good scales at singular cardinals

  13. Singular cardinals Background Covering matrices Results Independence from ZFC Symmetric models and countable choice Combining these two theorems: Corollary Let κ be a singular cardinal of countable cofinality that is regular in an inner model W . If PFA holds, then ( κ + ) W < κ + . Remark ◮ This also follows from work of Cummings–Schimmerling zamonja–Shelah, using the square principle � ω and Dˇ κ instead of coherent covering matrices. ◮ The relationship between coherent covering matrices and � ω κ is not clear to me. Trevor Wilson Determinacy models and good scales at singular cardinals

  14. Singular cardinals Background Covering matrices Results Independence from ZFC Symmetric models and countable choice Let’s consider the regularity or singularity of ω 1 instead of κ . Definition The Axiom of Countable Choice says that whenever ( S i : i ∈ N ) is a sequence of nonempty sets, there is a sequence ( x i : i ∈ N ) such that x i ∈ S i for all i ∈ N . Definition The Axiom of Countable Choice for Reals (CC R ) is the special case where the sets S i are sets of reals. Remark CC R implies that ω 1 is regular. Trevor Wilson Determinacy models and good scales at singular cardinals

  15. Singular cardinals Background Covering matrices Results Independence from ZFC Symmetric models and countable choice Given a singular strong limit cardinal of countable cofinality, say κ = sup i ∈ N κ i , we can obtain a model where CC R fails: Definition Force with the Levy collapse Col( ω, <κ ) to get a V -generic filter G and define: ξ<κ R V [ G ↾ ξ ] , and ◮ the symmetric reals R ∗ G = � ◮ the symmetric extension V ( R ∗ G ). In the symmetric extension every ordinal ξ < κ is collapsed to be countable but κ itself is not collapsed: V ( R ∗ G ) ◮ ω = κ 1 ◮ V ( R ∗ G ) satisfies “ ω 1 is singular” ◮ CC R fails in V ( R ∗ G ). Trevor Wilson Determinacy models and good scales at singular cardinals

Download Presentation
Download Policy: The content available on the website is offered to you 'AS IS' for your personal information and use only. It cannot be commercialized, licensed, or distributed on other websites without prior consent from the author. To download a presentation, simply click this link. If you encounter any difficulties during the download process, it's possible that the publisher has removed the file from their server.

Recommend


More recommend