and a model theory dichotomy in gdst
play

and a model theory dichotomy in GDST Miguel Moreno (joint work - PowerPoint PPT Presentation

# and a model theory dichotomy in GDST Miguel Moreno (joint work with Gabriel Fernandes and Assaf Rinot) Bar-Ilan University Arctic Set Theory Workshop 2019 January 2019 Miguel Moreno (ASTW19) January 2019 1 / 32 The Main Gap Theorem


  1. ♦ # κ and a model theory dichotomy in GDST Miguel Moreno (joint work with Gabriel Fernandes and Assaf Rinot) Bar-Ilan University Arctic Set Theory Workshop 2019 January 2019 Miguel Moreno (ASTW19) January 2019 1 / 32

  2. The Main Gap Theorem Outline 1 The Main Gap Theorem 2 Generalized Descriptive Set Theory 3 The equivalence non-stationary ideal 4 The dichotomy 5 The ♦ # κ principle Miguel Moreno (ASTW19) January 2019 2 / 32

  3. The Main Gap Theorem Shelah’s Main Gap Theorem Theorem (Main Gap, Shelah) Let T be a first order complete theory in a countable vocabulary and I ( T , α ) the number of non-isomorphic models of T with cardinality | α | . Either, for every uncountable cardinal α , I ( T , α ) = 2 α , or ∀ α > 0 I ( T , ℵ α ) < � ω 1 ( | α | ) . Theorem (Shelah) If T is classifiable and T ′ is not, then T is less complex than T ′ and their complexity are not close. Miguel Moreno (ASTW19) January 2019 3 / 32

  4. The Main Gap Theorem Questions What can we say about the complexity of two different non-classifiable theories? By non-classifiable theories we mean: • Unstable theories. • Stable unsuperstale theories. • Superstable theories with DOP. • Superstable theories with OTOP. Have all the non-classifiable theories the same complexity? Miguel Moreno (ASTW19) January 2019 4 / 32

  5. Generalized Descriptive Set Theory Outline 1 The Main Gap Theorem 2 Generalized Descriptive Set Theory 3 The equivalence non-stationary ideal 4 The dichotomy 5 The ♦ # κ principle Miguel Moreno (ASTW19) January 2019 5 / 32

  6. Generalized Descriptive Set Theory The approach Use Borel-reducibility and the isomorphism relation on models of size κ to define a partial order on the set of all first-order complete countable theories. Miguel Moreno (ASTW19) January 2019 6 / 32

  7. Generalized Descriptive Set Theory The Generalized Cantor space κ is an uncountable cardinal that satisfies κ <κ = κ . The generalized Cantor space is the set 2 κ with the bounded topology. For every ζ ∈ 2 <κ , the set [ ζ ] = { η ∈ 2 κ | ζ ⊂ η } is a basic open set. Miguel Moreno (ASTW19) January 2019 7 / 32

  8. Generalized Descriptive Set Theory κ -Borel sets The collection of κ -Borel subsets of 2 κ is the smallest set which contains the basic open sets and is closed under unions and intersections, both of length κ . A function f : 2 κ → 2 κ is κ - Borel , if for every open set A ⊆ 2 κ the inverse image f − 1 [ A ] is a κ -Borel subset of 2 κ . Miguel Moreno (ASTW19) January 2019 8 / 32

  9. Generalized Descriptive Set Theory Borel reduction Let E 1 and E 2 be equivalence relations on 2 κ . We say that E 1 is Borel reducible to E 2 , if there is a κ -Borel function f : 2 κ → 2 κ that satisfies ( x , y ) ∈ E 1 ⇔ ( f ( x ) , f ( y )) ∈ E 2 . We write E 1 � B E 2 . Miguel Moreno (ASTW19) January 2019 9 / 32

  10. Generalized Descriptive Set Theory Coding structures Fix a relational language L = { P n | n < ω } Definition Let π be a bijection between κ <ω and κ . For every f ∈ 2 κ define the structure A f with domain κ and for every tuple ( a 1 , a 2 , . . . , a n ) in κ n ( a 1 , a 2 , . . . , a n ) ∈ P A f m ⇔ f ( π ( m , a 1 , a 2 , . . . , a n )) = 1 Definition (The isomorphism relation) Given T a first-order countable theory in a countable vocabulary, we say that f , g ∈ 2 κ are ∼ = T equivalent if = T , A f ∼ • A f | = T , A g | = A g or • A f � T , A g � T Miguel Moreno (ASTW19) January 2019 10 / 32

  11. Generalized Descriptive Set Theory The Borel-reducibility hierarchy We can define a partial order on the set of all first-order countable theories T � κ T ′ iff ∼ = T � B ∼ = T ′ Miguel Moreno (ASTW19) January 2019 11 / 32

  12. Generalized Descriptive Set Theory Questions Is the Borel reducibility notion of complexity a refinement of the complexity notion from stability theory? • If T is a classifiable theory and T ′ is not, then T � κ T ′ ? • If T is an unstable theory and T ′ is not, then T ′ � κ T ? • Are all the theories comparable by the Borel reducibility notion of compleity, for every two theories T and T ′ either T � κ T ′ or T ′ � κ T holds? Miguel Moreno (ASTW19) January 2019 12 / 32

  13. Generalized Descriptive Set Theory Unstable Theories Theorem (Friedman, Hyttinen, Kulikov) If T is unstable and T ′ is classifiable, then T � � κ T ′ . Theorem (Asper´ o, Hyttinen, Kulikov, Moreno) Let DLO be the theory of dense linear order without end points. If κ is a Π 1 2 -indescribable cardinal, then T � κ DLO holds for every theory T. Miguel Moreno (ASTW19) January 2019 13 / 32

  14. Generalized Descriptive Set Theory A Borel reducibility counterpart Let H ( κ ) be the following property: If T is classifiable and T ′ is not, then T � κ T ′ and T ′ � � κ T . Theorem (Hyttinen, Kulikov, Moreno) Suppose κ = λ + , 2 λ > 2 ω and λ <λ = λ . 1 If V = L, then H ( κ ) holds. 2 It can be forced that H ( κ ) holds and there are 2 κ equivalence relations strictly between ∼ = T and ∼ = T ′ . Miguel Moreno (ASTW19) January 2019 14 / 32

  15. The equivalence non-stationary ideal Outline 1 The Main Gap Theorem 2 Generalized Descriptive Set Theory 3 The equivalence non-stationary ideal 4 The dichotomy 5 The ♦ # κ principle Miguel Moreno (ASTW19) January 2019 15 / 32

  16. The equivalence non-stationary ideal E 2 λ -club For every regular cardinal λ < κ , the relation E 2 λ -club is defined as follow. Definition On the space 2 κ , we say that f , g ∈ 2 κ are E 2 λ -club equivalent if the set { α < κ | f ( α ) = g ( α ) } contains an unbounded set closed under λ -limits. Miguel Moreno (ASTW19) January 2019 16 / 32

  17. The equivalence non-stationary ideal Non-classifiable theories Theorem (Friedman, Hyttinen, Kulikov) Suppose that κ = λ + = 2 λ and λ <λ = λ . λ -club � B ∼ 1 If T is unstable or superstable with OTOP, then E 2 = T . 2 If λ ≥ 2 ω and T is superstable with DOP, then E 2 λ -club � B ∼ = T . Theorem (Friedman, Hyttinen, Kulikov) Suppose that for all γ < κ , γ ω < κ and T is a stable unsuperstable theory. ω -club � B ∼ Then E 2 = T . Miguel Moreno (ASTW19) January 2019 17 / 32

  18. The equivalence non-stationary ideal Classifiable theories Theorem (Hyttinen, Kulikov, Moreno) Suppose T is a classifiable theory, λ < κ a regular cardinal such that ♦ κ ( cof ( λ )) holds. Then ∼ = T � B E 2 λ -club . Miguel Moreno (ASTW19) January 2019 18 / 32

  19. The dichotomy Outline 1 The Main Gap Theorem 2 Generalized Descriptive Set Theory 3 The equivalence non-stationary ideal 4 The dichotomy 5 The ♦ # κ principle Miguel Moreno (ASTW19) January 2019 19 / 32

  20. The dichotomy Σ 1 1 -completeness An equivalence relation E on 2 κ is Σ 1 1 or analytic , if E is the projection of a closed set in 2 κ × 2 κ × 2 κ and it is Σ 1 1 -complete or analytic complete if it is Σ 1 1 (analytic) and every Σ 1 1 (analytic) equivalence relation is Borel reducible to it. Miguel Moreno (ASTW19) January 2019 20 / 32

  21. The dichotomy Working in L Definition • We define a class function F ♦ : On → L. For all α , F ♦ ( α ) is a pair ( X α , C α ) where X α , C α ⊆ α , C α is a club if α is a limit ordinal and C α = ∅ otherwise. We let F ♦ ( α ) = ( X α , C α ) be the < L -least pair such that for all β ∈ C α , X β � = X α ∩ β if α is a limit ordinal and such pair exists and otherwise we let F ♦ ( α ) = ( ∅ , ∅ ) . • We let C ♦ ⊆ On be the class of all limit ordinals α such that for all β < α , F ♦ ↾ β ∈ L α . Notice that for every regular cardinal α , C ♦ ∩ α is a club. Miguel Moreno (ASTW19) January 2019 21 / 32

  22. The dichotomy Working in L Definition For all regular cardinal α and set A ⊂ α , we define the sequence ( X γ , C γ ) γ ∈ A as the sequence ( F ♦ ( γ )) γ ∈ A , and the sequence ( X γ ) γ ∈ A as the sequence of sets X γ such that F ♦ ( γ ) = ( X γ , C γ ) for some C γ . By ZF − we mean ZFC + ( V = L ) without the power set axiom. By ZF ♦ we mean ZF − with the following axiom: “For all regular ordinals µ < α if ( S γ , D γ ) γ ∈ α is such that for all γ < α , F ♦ ( γ ) = ( S γ , D γ ), then ( S γ ) γ ∈ cof ( µ ) is a diamond sequence.” Miguel Moreno (ASTW19) January 2019 22 / 32

  23. The dichotomy The Key Lemma Lemma (Hyttinen, Kulikov, Moreno) ( V = L ) For any Σ 1 -formula ϕ ( η, ξ, x ) with parameter x ∈ 2 κ , a regular cardinal µ < κ , the following are equivalent for all η, ξ ∈ 2 κ : • ϕ ( η, ξ, x ) • S \ A is non-stationary, where S = { α ∈ cof ( µ ) | X α = η − 1 { 1 } ∩ α } and = ZF ⋄ ∧ ϕ ( η ↾ α, ξ ↾ α, x ↾ α ) ∧ r ( α )) } A = { α ∈ C ♦ ∩ κ | ∃ β > α ( L β | where r ( α ) is the formula “ α is a regular cardinal”. Miguel Moreno (ASTW19) January 2019 23 / 32

Recommend


More recommend