The isomorphism relation of theories with S-DOP in generalized Baire spaces
Miguel Moreno
University of Helsinki
Helsinki, Finland
Bar Ilan University
Ramat Gan, Israel
University of Vienna
Vienna, Austria
Abstract
We study the Borel-reducibility of isomorphism relations in the generalized Baire space κκ. In the main result we show for inaccessible κ, that if T is a classifiable theory and T′ is superstable with the strong dimensional order property (S-DOP), then the isomorphism of models of T is Borel reducible to the isomorphism of models of T′. In fact we show the consistency of the following: If κ is inaccessible and T is a superstable theory with S-DOP, then the isomorphism of models of T is Σ11-complete.
Acknowledgement
This work was made under the supervision of Tapani Hyttinen. I want to express my gratitude to him for introducing me to the topic, his valuable advices and support during this work.
I would like to thank the referees for carefully reading the article and providing comments that improve the readability and quality. This research was supported by the Doctoral Programme in Mathematics and Statistics of the University of Helsinki (DOMAST). During the revision and editing of this paper, the author was a postdoc at Bar-Ilan University supported by the European Research Council (grant agreement ERC-2018-StG 802756) and was a postdoc at University of Vienna supported by the Vilho, Yrjö and Kalle Väisälä Foundation of the Finnish Academy of Science and Letters, and the Austrian Science Fund FWF, Grant I 3709-N35.
1 Introduction
One of the main motivations behind the study of the generalized descriptive set theory, is the connections with model theory. The complexity of a theory can be measured using the Borel reducibility in the generalized Baire spaces: We say that T′ is more complex than T if the isomorphism relation of T with universe κ (≅T) is Borel reducible to the isomorphism relation of T′ with universe κ.
Classification theory in Shelah’s stability theory gives another notion of complexity.
The stability theory notion of complexity allows us to compare classifiable theories with non-classifiable theories, but it doesn’t allow us to compare the complexity of two non-classifiable theories. On the other hand, the Borel reducibility notion of complexity allows us to compare the complexity of two theories, no matter if the theories are both non-classifiable. Friedman, Hyttinen, Kulikov and others have studied the connection between these two notions of complexity (see [FHK]).
One of the most important questions regarding the Borel reducibility complexity notion is: Is the Borel reducibility notion of complexity a refinement of the stability theory notion of complexity? To answer this question is one of the objectives pursued by the generalized descriptive set theory. For a theory to be non-classifiable, this one must be either unstable, or superstable with OTOP, or superstable with DOP, or stable unsuperstable. It is natural for model theorists to believe that there is a distinction between the complexity of these four kinds of non-classifiable theories, it is conjectured that this may be reflected in the Borel reducibility complexity notion.
The results reviewed in this introduction require further assumptions and the reader is referred to the original paper for the exact assumptions.
In [HKM] it was shown, under the assumptions of ♢ and κ successor, if T is classifiable and T′ is not, then ≅T is Borel reducible to ≅T′.
In [Fer], [FMR] and [HKM2] it was showed that for certain models of ZFC, if κ is a successor cardinal, then the isomorphism relation of any non-classifiable theory is Σ11-complete. In particular, in [FMR] and [FMR2] different forcings were constructed to obtain this.
It is natural to ask whether the same holds when κ is inaccessible. The case stable unsuperstable was studied in [HM] and the following was found, if T is classifiable and T′ is stable unsuperstable with OCP, then ≅T is continuously reducible to ≅T′, in the models of [Fer], [FMR], and [HKM2] ≅T′ is Σ11-complete.
In [LS] Laskowski and Shelah studied the completeness of ω-stable with DOP. Even though the following question remains open.
Question 1.1**.**
*Is it consistently true: There is a superstable theory with DOP for which the isomorphism relation is Σ11-complete?
*
In this article we focus only in cardinals of the form κ<κ=κ, the only cases are successors and strong inaccessible.
As it was mentioned above, the previous question was answered when κ is a successor ([FMR], [HKM2]), we will focus only on the case κ an inaccessible cardinal. We answer this question in Corollary 5.3, where we show that in the models of [FMR] and [HKM2], the isomorphism relation of any superstable theory with S-DOP is Σ11-complete.
In particular we will prove that there is λ<κ such that Eλ-clubκ≤c≅T(see Definitions 1.4 and 1.3) holds for any T superstable theory with S-DOP. In the main result, Corollary 5.2, we settle the Borel reducibility between classifiable theories and superstable theories with S-DOP.
Here and throughout the paper we assume that κ is an uncountable
cardinal that satisfies κ<κ=κ, M will denote the monster model, and for every finite tuple a, we will denote a∈Alength(a) by a∈A, unless something else is stated.
The generalized
Baire space is the set κκ with the bounded topology. For
every ζ∈κ<κ, the set
[TABLE]
is a basic open set. The open sets are of the form ⋃X where
X is a collection of basic open sets. The collection of
Borel subsets of κκ is the smallest set which
contains the basic open sets and is closed under complement and unions of length κ.
A function f:κκ→κκ is Borel,
if for every open set A⊆κκ the inverse image
f−1[A] is a Borel subset of κκ. Let E1 and E2 be
equivalence relations on κκ. We say that E1 is
Borel reducible to E2, if there is a Borel function f that satisfies (x,y)∈E1⇔(f(x),f(y))∈E2, we call f a reduction of E1 to
E2 and it is denoted by E1≤BE2. If f is continuous,
then E1 is continuously reducible to E2 and it is denoted by E1≤cE2.
Let L={Pn\leavevmode ∣\leavevmode n∈κ\} be a given relation vocabulary of size κ. When we describe a complete theory T in a vocabulary L⊆L, we think of it as a complete L-theory extending T∪{∀xˉ¬Pn(xˉ)\leavevmode ∣\leavevmode Pn∈L\L}. We can code L-structures with domain κ as follows.
Definition 1.2**.**
Fix a bijection π:κ<ω→κ. For every
η∈κκ define the L-structure
Aη with domain κ as follows:
For every relation Pm of arity n, every tuple
(a1,a2,…,an) in κn satisfies
[TABLE]
Definition 1.3** (The isomorphism relation).**
Assume T is a complete first order
theory in a countable vocabulary, L. We define ≅Tκ as the
relation
[TABLE]
We will omit the superscript “κ” in ≅Tκ when it
is clear from the context. For every complete first order theory T in a countable
vocabulary there is an isomorphism relation associated with T,
≅Tκ.
From now on L will be a countable relational vocabulary and every theory is a theory in L.
Definition 1.4**.**
*For every regular cardinal μ<κ, f,g∈κκ are Eμ-clubκ equivalent (f Eμ-clubκ g) if the set {α<κ\leavevmode ∣\leavevmode f(α)=g(α)} contains a μ-club, i.e. it is unbounded and closed under μ-limits.
*
2 Preliminaries
2.1 Coloured trees
Coloured trees have been very useful in the past to reduce Eμ-clubκ to ≅T for certain μ<κ and T non-classifiable, see [FHK], [HM] or [HK]. We will present a variation of these trees that has height λ+2 for λ an uncountable cardinal.
For a tree t, for every x∈t we denote by ht(x) the height of x, the order type of {y∈t\leavevmode ∣\leavevmode y<x}. Define tα={x∈t\leavevmode ∣\leavevmode ht(x)=α} and t<α=∪β<αtβ, denote by x↾α the unique y∈t such that y∈tα and y≤x. If x,y∈t and {z∈t\leavevmode ∣\leavevmode z<x}={z∈t\leavevmode ∣\leavevmode z<y}, then we say that x and y are ∼-related, x∼y, and we denote by [x] the equivalence class of x for ∼.
An α,β-tree is a tree t with the following properties:
∣[x]∣<α for every x∈t.
All the branches have order type less than β in t.
t has a unique root.
If x,y∈t, x has no immediate predecessors and x∼y, then x=y.
Notice that in a α,β-tree, any maximal branch has at most one leaf. Therefore, for any κ+, (λ+2)-tree we can define functions c over tλ.
Definition 2.1**.**
*Let λ be an uncountable cardinal. A coloured tree is a pair (t,c), where t is a κ+, (λ+2)-tree and c is a map c:tλ→κ\{0}.
*
Two coloured trees (t,c) and (t′,c′) are isomorphic, if there is a tree isomorphism f:t→t′ such that for every x∈tλ, c(x)=c′(f(x)).
We can see every coloured tree as a downward closed subset of κ≤λ.
For each f∈κκ, define the tree (If,df) as, If the set of all strictly increasing functions from some θ≤λ to κ and for each η∈If with domain λ, df(η)=f(sup(rang(η))).
For every pair of ordinals α and β, α<β<κ and i<λ define
[TABLE]
Suppose κ is an inaccessible cardinal. If α<β<κ and α,β=0, let {Pγα,β\leavevmode ∣\leavevmode γ<κ} be an enumeration of all downward closed coloured subtrees of R(α,β,i) for all i, in such a way that each possible coloured tree appears cofinally often in the enumeration. Let P00,0 be the tree (If,df).
This enumeration is possible because κ is inaccessible; there are at most ∣⋃i<λP(R(α,β,i))∣≤λ×κ=κ downward closed coloured subtrees, and at most κ×κ<κ=κ coloured trees.
Denote by Q(Pγα,β) the unique ordinal number i such that Pγα,β⊂R(α,β,i).
Definition 2.2**.**
Suppose κ is an inaccessible cardinal.
Order the set λ×κ×κ×κ×κ lexicographically, (α1,α2,α3,α4,α5)>(β1,β2,β3,β4,β5) if for some 1≤k≤5, αk>βk and for every i<k, αi=βi. Order the set (λ×κ×κ×κ×κ)≤λ as a tree by inclusion.
For every f∈κκ define Jf=(Jf,cf) as the subtree of all η:s→λ×κ4, where s≤λ, ordered by extension, and such that the following conditions hold for all i,j<s:
Denote by ηi, 1≤i≤5, the functions from s to κ that satisfy, η(n)=(η1(n),η2(n),η3(n),η4(n),η5(n)).
We will construct the coloured tree Jf intuitively by merging many different coloured trees, η1 fixes a domain of the form [i,j), the functions η2, η3, and η4 fix a coloured tree of the form Pγα,β⊂R(α,β,i), and η5 is an element of Pγα,β that is responsible to define the color.
-
η↾n∈Jf* for all n<s.*
2. 2.
η* is strictly increasing with respect to the lexicographical order on λ×κ4.*
3. 3.
η1(i)≤η1(i+1)≤η1(i)+1.
4. 4.
η1(i)=0* implies η2(i)=η3(i)=η4(i)=0.*
5. 5.
η2(i)≥η3(i)* implies η2(i)=0.*
6. 6.
η1(i)<η1(i+1)* implies η2(i+1)≥η3(i)+η4(i).*
7. 7.
For every limit ordinal α, ηk(α)=supβ<α{ηk(β)} for k∈{1,2}.
8. 8.
η1(i)=η1(j)* implies ηk(i)=ηk(j) for k∈{2,3,4}.*
9. 9.
If for some k<λ, [i,j)=η1−1{k}, then
[TABLE]
Note that 7 implies Q(Pη4(i)η2(i),η3(i))=i.
10. 10.
If s=λ, then either
there exists an ordinal number m such that for every k<m η1(k)<η1(m), for every k≥m η1(k)=η1(m), and the color of η is determined by Pη4(m)η2(m),η3(m):
[TABLE]
where c is the colouring function of Pη4(m)η2(m),η3(m).
Or
there is no such ordinal m and then cf(η)=f(sup(rang(η5))).
The following lemma is a variation of Lemma 4.7 of [HM],
nevertheless the proof is the same in both cases.
Lemma 2.3**.**
Assume κ is an inaccessible cardinal, then for every f,g∈κκ the following holds
[TABLE]
Remark 2.4**.**
For each α<κ define Jfα as
[TABLE]
Notice that every η∈Jf has the following properties:
-
sup(rang(η4))≤sup(rang(η3))=sup(rang(η5))=sup(rang(η2)).**
2. 2.
When η↾k∈Jfα holds for every k∈λ, sup(rang(η5))≤α. If in addition η∈/Jfα, then
sup(rang(η5))=α.
Let us take a look at the sets rang(f) and rang(cf), more specifically at the set {α<κ\leavevmode ∣\leavevmode f(α)∈rang(cf)}.
Remark 2.5**.**
*Assume f∈κκ and let Jf be the respective coloured tree obtained by Definition 2.2. If η∈Jf satisfies Definition 2.2 item 10 (b), then clearly there exists α<κ such that cf(η)=f(α). It is possible that not for every α<κ, there is η∈Jfα+1 such that cf(η)=f(α). Nevertheless the set C={α<κ\leavevmode ∣\leavevmode ∃ξ∈Jfα+1 such that ξ1↾ω=id+1,ξ1↾[ω,λ)=id↾[ω,λ) and cf(ξ)=f(α)} is a λ-club.
*
2.2 Strong DOP
Now, we will recall the dimensional order property and the strong dimensional order property. The independence properties of indiscernible sequences have been a very useful tool to study theories with DOP (see [HaMa], Section 2), this makes superstable theories with DOP and strong independence properties good candidates to answer Question 1.1. Following this direction we will define the strong dimensional property (Lemma 2.10 and Definition 2.14), we will give some important properties that will be useful to construct models of theories with the strong dimensional property. It is an open question whether every superstable theory with DOP has also S-DOP
In [She] Shelah gives an axiomatic approach for an isolation notion, F, and defines the notions F-constructible, F-atomic, F-primary, F-prime and F-saturated.
Definition 2.6**.**
*Denote by Fθa the set of pairs (p,B) with ∣B∣<θ, such that for some A⊇B and c, p∈S(A), c⊨p and stp(c,B)⊢p.
*
In [She] (Definition III 4.2 (2), and Definition V 1.1 (2) and (4)) the notions of stationarization of a type, and orthogonal types are defined.
For p1,p2∈S(A) stationary types the following holds. If p1=tp(a1,A), and p2=tp(a2,A), then p1 is weakly orthogonal to p2 if and only if a1↓Aa2.
A stationary type p∈S(B) is orthogonal to A if for all a,b and D⊃A the following holds: If tp(b,B) is stationary, a⊨p, b↓AB, b↓BD and a↓BD, then a↓Db.
Fact 2.7**.**
*Let B,D⊆M, M a Fωa-saturated model over B∪D, and p∈S(M). If p is orthogonal to D and p does not fork over B∪D, then for every c⊨p↾B∪D the following holds: c↓B∪DM implies tp(c,M)⊥D.
*
A type p∈S(B∪C) is orthogonal to C, if for every Fωa-primary model, M, over B∪C there exists a non-forking extension of p, q∈S(M), orthogonal to C.
In [She] (X.2 Definition 2.1) Shelah defines the dimensional order property, DOP, as follows.
Definition 2.8**.**
*A theory T has the dimensional order property (DOP) if there are Fκ(T)a-saturated models (Mi)i<3, M0⊂M1∩M2, M1↓M0M2, and the Fκ(T)a-prime model, M3, over M1∪M2 is not Fκ(T)a-minimal over M1∪M2.
*
Definition 2.9**.**
Let I be an infinite indiscernible set. We define Av(I,A) the average type of I over A, to be the set
[TABLE]
Recall that an Fκ(T)a-prime model is Fκ(T)a-atomic and Fκ(T)a-saturated.
The rest of the results in this section will be stated and proved for the case of the Fωa isolation. Many of those results can be easily generalized to Fκ(T)a by making small changes on the proof.
From now on we will work only with superstable theories. We know that for every superstable theory T, κ(T)=ω.
The proof of the following lemma is similar to the proof of [[She] X.2 Lemma 2.2].
Lemma 2.10**.**
Let M0⊂M1∩M2 be Fωa-saturated models, M1↓M0M2, M3 Fωa-atomic over M1∪M2 and Fωa-saturated. Then the following conditions are equivalent:
-
There is a non-algebraic type p∈S(M3) orthogonal to M1 and to M2, that does not fork over M1∪M2.
2. 2.
There is an infinite indiscernible I⊆M3 over M1∪M2 that is independent over M1∪M2.
3. 3.
There is an infinite I⊆M3 indiscernible over M1∪M2 and independent over M1∪M2, such that Av(I,M3) is orthogonal to M1 and to M2.
Lemma 2.11** ([HS], Theorem 2.1).**
Let M0≺M1,M2 be Fωa-saturated models, such that M1↓M0M2. Let M3 be an Fωa-prime model over M1∪M2 and let I⊆M3 be an indiscernible over M1∪M2 such that Av(I,M3) is orthogonal to M1 and to M2. If (Bi)i<3 are sets such that:
B0↓M0M1∪M2.
B1↓M1∪B0B2∪M2.
B2↓M2∪B0B1∪M1.
Then
[TABLE]
The following lemma give us sufficient conditions over models M1′, M2′, and M3′ such that, if M1, M2, and M3 are models that satisfy Definition 2.8, then M1′, M2′, and M3′ satisfy Definition 2.8.
Lemma 2.12**.**
Let M0⊂M1∩M2 be Fωa-saturated models, such that M1↓M0M2 and M3, the Fωa-prime model over M1∪M2, is not Fωa-minimal over M1∪M2.
If (Mi′)i<3 are Fωa-saturated models that satisfy:
∀i<3, Mi⊆Mi′.
∀i<3, Mi′↓MiM3.
M1′↓M0′M2′.
*Then M3′ the Fωa-prime model over M1′∪M2′ is not Fωa-minimal over M1′∪M2′.
*
Remark 2.13**.**
*From the previous lemma we can conclude that if I is independent over M1∪M2, then
I is independent over M1′∪M2′.
*
Definition 2.14**.**
We say that a superstable theory T has the strong dimensional order property (S-DOP) if the following holds:
*There are Fωa-saturated models (Mi)i<3, M0⊂M1∩M2, such that M1↓M0M2, and for every M3 Fωa-prime model over M1∪M2, there is a non-algebraic type p∈S(M3) orthogonal to M1 and to M2, such that it does not fork over M1∪M2.
*
From [She] X.2 Lemma 2.2, every superstable theory with S-DOP has DOP.
In [HrSo] Hrushovski and Sokolvić proved that the theory of differentially closed fields of characteristic zero (DCF) has eni-DOP, so it has DOP. The reader can find an outline of this proof in [Mar2]. We will show that DCF also has the S-DOP, this can be done following the proof in [Mar2] or the one in [Mar] which uses Rosenlicht’s Theorem.
More on DCF (proofs, definitions, references, etc) can be found in [Mar].
Let K be a saturated model of DCF, k⊆K and a∈Kn, we denote by k⟨a⟩ the differentially closed subfield generated by k(a). If A⊆K and for all n, every nonzero f∈k{x1,x2,…,xn}, and all a1,a2,…,an∈A it holds that f(a1,a2,…,an)=0, then we say that A is δ-independent over k.
For all k⊆K denote by kdif the differential closure of k in K.
Theorem 2.15** (Hrushovski, Sokolvić, [Mar] Theorem 7.6, [Mar2] Sections 4, 5 ).**
*Suppose K0 is a differentially closed field with characteristic zero, {a,b} is δ-independent over K0, K1=K0⟨a⟩dif, K2=K0⟨b⟩dif, and K=K0⟨a,b⟩dif.
There is a type p over K that does not fork over {a,b} such that K1↓K0K2, p⊥K1, and p⊥K2.
*
Corollary 2.16**.**
*DCF has the S-DOP.
*
Proof.
Let a, b, K1, K2, and p be as in Theorem 2.15. By Theorem 2.15 it is enough to show that p does not fork over K1∪K2. This follows since p does not fork over {a,b}.
3 Construction of models
From now on κ will be an inaccessible cardinal.
In this section we will use coloured trees to construct models of a superstable theory with S-DOP. To do this, we will need some basic results first and fix some notation. Instead of writing Fωa-constructible, Fωa-atomic, Fωa-saturated and Fωa-saturated we will write a-constructible, a-atomic, a-primary, a-prime and a-saturated. From now on T will be a superstable theory with S-DOP.
We will denote by λ(T) the least cardinal such that T is λ-stable. Since T is superstable, then λ(T)≤2ω, we will denote by λ the cardinal (2ω)+.
Definition 3.1**.**
Let us define the dimension of a type p∈S(A) in M by: dim(p,M)=min{∣J∣:J⊆M, J is a maximal independent sequence over A, and ∀a∈J,a⊨p}
Let us define the dimension of an indiscernible I over A in M by:
dim(I,A,M)=min{∣J∣:J is equivalent to I and J is a maximal indiscernible over A in M}. If for all J as above dim(I,A,M)=∣J∣, then we say that the dimension is true.
Lemma 3.2** ([She]).**
*If I is a maximal indiscernible set over A in M, then ∣I∣+κ(T)=dim(I,A,M)+κ(T),
and if dim(I,A,M)≥κ(T), then the dimension is true.
*
Theorem 3.3** ([She]).**
*If M is an a-primary model over A, and I⊆M is an infinite indiscernible set over A, then dim(I,A,M)=ω.
*
For any indiscernible sequence I={ai\leavevmode ∣\leavevmode i<γ}, we will denote by I↾α the sequence I={ai\leavevmode ∣\leavevmode i<α}. Now for every f∈κκ we will use the the tree Jf given in Definition 2.2, to construct the model Af.
Since T has the S-DOP, by Lemma 2.10 and Lemma 2.11 there are a-saturated models A,B,C of cardinality 2ω
and an indiscernible sequence I over B∪C of size κ that is independent over B∪C such that
-
A⊂B∩C, B↓AC.
2. 2.
Av(I,B∪C) is orthogonal to B and to C.
3. 3.
If (Bi)i<3 are sets such that:
B0↓AB∪C.
B1↓B∪B0B2∪C.
B2↓C∪B0B1∪B.
Then,
[TABLE]
By the existence property of forking, for any D⊇A there is F∈Aut(A) such that for all c∈B, stp(F(c),A)=stp(c,A) and F(c)↓AD (the same holds for C).
For every ξ∈(Jf)<λ and every η∈(Jf)λ (recall tα at the beginning of the section 2), let Bξ≅AB, A⪯Bξ, and
Cη≅AC, A⪯Cη, such that the models (Bξ)ξ∈(Jf)<λ and (Cη)η∈(Jf)λ satisfy the following:
Bξ↓A⋃{Bζ,Cθ\leavevmode ∣\leavevmode ζ∈(Jf)<λ∧θ∈(Jf)λ∧ζ=ξ}.
Cη↓A⋃{Bζ,Cθ\leavevmode ∣\leavevmode ζ∈(Jf)<λ∧θ∈(Jf)λ∧θ=η}.
We can choose this models due to the existence property (see above) and the finite character.
Notice that all ξ∈(Jf)<λ and η∈(Jf)λ, satisfy
[TABLE]
Let Fξη be an automorphism of the monster model such that Fξη↾C:C→Cη and Fξη↾B:B→Bξ are isomorphisms and Fξη↾A=id. Denote the sequence I by {wα\leavevmode ∣\leavevmode α<κ}. For all η∈(Jf)λ and every ξ<η, let Iξη={bα\leavevmode ∣\leavevmode α<cf(η)} be an indiscernible sequence over Bξ∪Cη
of size cf(η), that is independent over Bξ∪Cη, and satisfies:
tp(Iξη,Bξ∪Cη)=tp(Fξη(I↾cf(η)),Bξ∪Cη).
Iξη↓Bξ∪Cη⋃{Bζ,Cθ\leavevmode ∣\leavevmode ζ∈(Jf)<λ∧θ∈(Jf)λ}∪⋃{Iζθ\leavevmode ∣\leavevmode ζ=ξ∨θ=η}.
Therefore, there is an elementary embedding G:Bξ∪Cη∪Fξη(I↾cf(η))→Bξ∪Cη∪Iξη given by G↾Bξ∪Cη=id and G(Fξη(I↾cf(η)))=Iξη. So the map Hξη:B∪C∪I↾cf(η)→Bξ∪Cη∪Iξη given by Hξη=G∘(Fξη↾dom(Hξη)) is elementary.
Remark 3.4**.**
To recap, Bξ, Cη, and Iξη satisfy the following:
-
Av(Iξη,Bξ∪Cη)* is orthogonal to Bξ and to Cη.*
2. 2.
If (Bi)i<3 are sets such that:
B0↓ABξ∪Cη.
B1↓Bξ∪B0B2∪Cη.
B2↓Cη∪B0B1∪Bξ.
Then,
[TABLE]
3. 3.
Iξη↓Bξ∪Cη⋃{Bζ,Cθ\leavevmode ∣\leavevmode ζ∈(Jf)<λ∧θ∈(Jf)λ}∪⋃{Iζθ\leavevmode ∣\leavevmode ζ=ξ∨θ=η}.
Definition 3.5**.**
*Let Γf be the set ⋃{Bξ,Cη,Iξη\leavevmode ∣\leavevmode ξ∈(Jf)<λ∧η∈(Jf)λ∧ξ<η} and let Af be the a-primary model over Γf.
Let Γfα be the set ⋃{Bξ,Cη,Iξη\leavevmode ∣\leavevmode ξ,η∈Jfα∧ξ<η}, recall Jfα from Remark 2.4.
*
Fact 3.6**.**
*If α is such that αλ<f(α), sup({cf(η)}η∈Jfα)<α, then ∣Γfα+1∣=f(α).
*
Proof.
Recall that for all ξ∈(Jfα)<λ and η∈(Jfα)λ, Bξ and Cη have cardinality 2ω, and Iξη has cardinality cf(η).
Since Γfα=∪{Bξ,Cη,Iξη\leavevmode ∣\leavevmode ξ∈(Jfα)<λ∧η∈(Jfα)λ∧ξ<η}, we know that ∣Γfα+1∣≤∣Jfα+1∣⋅sup({cf(η)}η∈(Jfα+1)λ). Since ∣Jfα+1∣≤αλ<f(α) and sup({cf(η)}η∈Jfα)<α<f(α), we get ∣Γfα+1∣≤max(f(α),sup({cf(η)}η∈Jfα+1\Jfα)). But every η∈Jfα+1\Jfα with domain λ has rang(η1)=λ and f(α)=cf(η), otherwise sup(rang(η5))<α and η∈Jfα. We conclude ∣Γfα+1∣=f(α).
Lemma 3.7**.**
*For every ξ∈(Jf)<λ, η∈(Jf)λ, ξ<η, let pξη be the type Av(Iξη↾ω,Iξη↾ω∪Bξ∪Cη). If cf(η)>ω, then dim(pξη,Af)=cf(η).
*
Proof.
Denote by S the set Iξη↾ω∪Bξ∪Cη, so pξη=Av(Iξη↾ω,S).
Suppose, towards a contradiction, that dim(pξη,Af)=cf(η). Since Iξη⊂Af, then dim(pξη,Af)>cf(η). Therefore, there is an independent sequence I={ai\leavevmode ∣\leavevmode i<cf(η)+} over S such that I⊂Af and ∀a∈I, a⊨pξη.
By induction on α, it can be proved that Iξη↾ω∪{ai\leavevmode ∣\leavevmode i≤α} is indiscernible over Bξ∪Cη. Therefore Iξη↾ω∪I is indiscernible over Bξ∪Cη.
In particular Iξη↾ω∪I is indiscernible, and Iξη is equivalent to I.
By some forking calculus manipulation and Remark 3.4, it is easy to prove that
tp(Iξη,Bξ∪Cη)⊢tp(Iξη,Γf\Iξη) and Iξη is indiscernible over Γf\Iξη.
We know that tp(I,Bξ∪Cη)=tp(Iξη,Bξ∪Cη), therefore
tp(I,Bξ∪Cη)⊢tp(Iξη,Γf\Iξη). We conclude that tp(I,Bξ∪Cη)⊢tp(I,Γf\Iξη) and since I is indiscernible over Bξ∪Cη, then I is indiscernible over Γf\Iξη.
There are I′,I∗⊆I such that ∣I′∣=cf(η)+ and I′↓(Γf\Iξη)∪I∗Iξη.
In particular I′ is indiscernible over Γf∪I∗, and I′ is indiscernible over Γf.
Let J⊂Af be a maximal indiscernible set over Γf such that I′⊆J. By Lemma 3.2 ∣J∣+κ(T)=dim(J,Γf,Af)+κ(T). Since T is superstable, κ(T)=ω<cf(η)+≤∣J∣ and we conclude that κ(T)<dim(J,Γf,Af)+κ(T). Therefore κ(T)<dim(J,Γf,Af) and by Lemma 3.2 the dimension is true, dim(J,Γf,Af)=∣J∣. So dim(J,Γf,Af)>ω a contradiction with Theorem 3.3.
Lemma 3.8**.**
*For every ξ∈(Jf)<λ, η∈(Jf)λ, ξ<η and α such that c(η)=f(α), where f(α) is a cardinal, there is no independent indiscernible sequence (ci)i<f(α)+ over Bξ∪Cη with c0∈Iξη.
*
Proof.
Denote by J the sequence (ci)i<f(α)+, since T is superstable, there is J′⊆J of power f(α)+ such that c0∈/J′ and satisfies J′↓J↾ω∪Bξ∪CηIξη.
Since J is an independent sequence over Bξ∪Cη, then J′↓Bξ∪CηJ↾ω∪Iξη.
Let us denote by Q the set Bξ∪Cη∪(Iξη↾ω)\{c0},
so J′↓QIξη. Since Av(Iξη,Q) is stationary and Iξη is independent over Bξ∪Cη, we conclude that I′={c0}∪(Iξη\(Iξη↾ω)) is indiscernible over J′∪Q. Especially I′ is indiscernible over Bξ∪Cη∪J′. On the other hand J′↓Bξ∪CηJ↾ω∪Iξη implies that J′↓Bξ∪CηIξη, and since Iξη is independent over Bξ∪Cη, we conclude that Iξη is independent over Bξ∪Cη∪J′. In particular I′ is independent over Bξ∪Cη∪J′.
Claim 3.8.1**.**
J′∪I′* is indiscernible over Bξ∪Cη
*
Proof of Claim 3.8.1.
We will proceed by induction. Let us denote by {di∣i<f(α)} the sequence I′.
Since c0∈I′∩J, c0⊨Av(J′,Bξ∪Cη∪J′), and I′ is indiscernible over J′∪Q, then for every i<f(α),
[TABLE]
Suppose j is such that for all n<j the sequence J′∪{di∣i≤n} is indiscernible over Bξ∪Cη, then J′∪{di∣i<j} is indiscernible over Bξ∪Cη, therefore Av(J′∪{di∣i<j},Bξ∪Cη∪J′∪{di∣i<j})=Av(J′,Bξ∪Cη∪J′∪{di∣i<j}) and it does not fork over Bξ∪Cη∪J′. On the other hand we know that Av(J′,Bξ∪Cη∪J′) is stationary,
dj↓Bξ∪Cη∪J′{di∣i<j} and dj⊨Av(J′,Bξ∪Cη∪J′), we conclude that tp(dj,Bξ∪Cη∪J′∪{di∣i<j}))=Av(J′∪{di∣i<j},Bξ∪Cη∪J′∪{di∣i<j}). Therefore J′∪{di∣i≤j} is indiscernible over Bξ∪Cη. We conclude that J′∪I′ is indiscernible over Bξ∪Cη. This finishes the proof of Claim 3.8.1.
So J′ is equivalent to Iξη and for all d∈J′, d⊨Av(Iξη↾ω,Iξη↾ω∪Bξ∪Cη). Since J′ is independent over Bξ∪Cη and J′↓Bξ∪CηIξη, we conclude that J′ is independent over Iξη↾ω∪Bξ∪Cη, thus dim(pξη,Af)≥f(α)+, but this contradicts Lemma 3.7.
One of the key lemmas for the following section
is Lemma 3.10 (below).
Let us define the nice subsets of Γf. These subsets have a couple of properties, that will be useful when we study the model Af.
Definition 3.9**.**
We say ∅=X⊆Γf is nice if the following holds.
-
If X∩Iξη=∅, then Bξ,Cη⊂X.
2. 2.
If Bξ∩X=∅, then Bξ⊂X.
3. 3.
If Cη∩X=∅, then Cη⊂X.
4. 4.
If ξ<η and Bξ,Cη⊂X, then X∩Iξη is infinite.
The argument for the following Lemma is a variation of the argument used in [HS] in the fourth section.
Lemma 3.10**.**
*Let Z be a nice subset of Γf and d∈Γf\Z. Then for all B finite subset of Z there is f∈Saut(M,B) such that f(d)∈Z.
*
Suppose X and A are nice subsets of Γf. If ξ and η are such that Bξ∪Cη⊆A and Iξη∩X⊆A, then we say that A is X-nice for (ξ,η).
Lemma 3.11**.**
*Suppose Z⊆Γf is nice and B is a-constructable over Z. If X⊆Γf is a nice subset such that Z∪X is nice, then B∪X is a-constructible over Z∪X.
*
Proof.
Let (Z,(ai,Bi)i<γ) be an a-construction for B over Z. Let (Di)i<δ be an enumeration of {Bξ,Cη,Iξη∩X\leavevmode ∣\leavevmode ξ<η∧Bξ∪Cη⊆Z∪X} such that Bξ and Cη are before Iξη in the enumeration. Let Zj be the minimal nice subset of Z∪X that contains Z∪⋃i≤jDi, and it is X-nice for every (x,y) that satisfies: either Bx⊆⋃i≤jDi\Z or Cy⊆⋃i≤jDi\Z.
Claim 3.11.1**.**
(Zj,(ai,Bi)i<γ)* is an a-construction for B∪Zj over Zj, for every j<δ.
*
Proof of Claim 3.11.1.
Suppose, towards a contradiction, that α is the minimal ordinal such that (Zα,(ai,Bi)i<γ) is not an a-construction for B∪Zα over Zα.
By the minimality of α, (Zβ,(ai,Bi)i<γ) is an a-construction for B∪Zβ over Zβ, for every β<α. Therefore for every β<α and i<γ, (tp(ai,Ziβ),Bi)∈Fωa where Ziβ=Zβ∪⋃j<iaj. So (tp(ai,∪β<αZiβ),Bi)∈Fωa for every i<γ, we conclude that α is not a limit cardinal. Let us denote by Z′ the set Zβ, for β the predecessor of α.
The proof is divided in the following cases:
-
Dα=Cη for some Cη⊆X∪Z.
2. 2.
Dα=Bξ for some Bξ⊆X∪Z.
3. 3.
Dα=Iξη∩X, for some Bξ∪Cη⊆X∪Z.
The case 2 is similar to the case 1, we will show only the cases 1 and 3.
Case 1:
Since (Zα,(ai,Bi)i<γ) is not an a-construction over Zα, then by the minimality of Zα, Cη⊆Z′. Therefore, Iξη∩Z′=∅ for every ξ<η. Since X∪Z is nice, then we know that for all Bξ⊆Z′ that satisfies ξ<η, it holds that Bξ⊆X.
Let n be the least ordinal such that (Z′∪Cη∪⋃{Iξη∩X\leavevmode ∣\leavevmode ξ<η∧Bξ⊆Z′},(ai,Bi)i≤n) is not an a-construction over Z′∪Cη∪⋃{Iξη∩X\leavevmode ∣\leavevmode ξ<η∧Bξ⊆Z′}, since a-isolation is the Fωa-isolation, then Bn is finite and we can assume n<ω.
Denote by D the set Cη∪⋃{Iξη∩X\leavevmode ∣\leavevmode ξ<η∧Bξ⊆Z′}.
Since (Z′∪D,(ai,Bi)i<n) is an a-construction over Z′, then C=⋃i<nBi∩(Z′∪D) is such that stp(a0⌢⋯⌢an−1,C)⊢tp(a0⌢⋯⌢an−1,Z′∪D). Notice that C is a subset of Z′.
On the other hand, there is b such that stp(b,Bn)=stp(an,Bn), and tp(b,Z′∪⋃{ai\leavevmode ∣\leavevmode i<n}∪D)=tp(an,Z′∪⋃{ai\leavevmode ∣\leavevmode i<n}∪D). So there are tuples d∈D\A and e∈Z′∪⋃{ai\leavevmode ∣\leavevmode i<n} that satisfy tp(b,e∪d)=tp(an,e∪d). Denote by W the set C∪((Bn∪e)∩Z′), by Lemma 3.10 we know that there is g∈Saut(M,W) such that g(d)∈Z′. We know that, stp(a0⌢⋯⌢an−1,C)⊢tp(a0⌢⋯⌢an−1,Z′∪D), so a0⌢⋯⌢an−1↓CZ′∪D. We conclude that
[TABLE]
and
[TABLE]
Therefore stp(d,C∪Bn∪e)=stp(g(d),C∪Bn∪e) and there is f∈Saut(M,C∪Bn∪e) that satisfies f(d)=g(d).
Since tp(b,e∪d)=tp(an,e∪d) and stp(b,Bn)=stp(an,Bn) hold, then we have that tp(f(b),e∪f(d))=tp(f(an),e∪f(d)), and the strong types of an,b,f(an) and f(b) over Bn are the same strong type. Since (Z′,(ai,Bi)i<γ) is an a-construction, then by the a-isolation we know that stp(a,Bn)⊢tp(an,Z′∪⋃{ai\leavevmode ∣\leavevmode i<n}), on the other hand stp(an,Bn)=stp(f(an),Bn)=stp(f(b),Bn), so tp(f(an),Z′∪⋃{ai\leavevmode ∣\leavevmode i<n})=tp(f(b),Z′∪⋃{ai\leavevmode ∣\leavevmode i<n}). In particular e,f(d)∈Z′, so tp(f(b),e∪f(d))=tp(f(an),e∪f(d)), a contradiction.
Case 3:
By the way (Di)i<δ was defined, we know that Bξ and Cη are before Iξη∩X in the enumeration, so Bξ∪Cξ⊆Z′. We have the following possibilities, either Bξ⊆Z, or Cη⊆Z, or Bξ,Cη⊆Z. In the first two cases, by the way Z′ was defined, we know that Z′ is X-nice for (ξ,η), so Iξη∩X⊂Z′. Therefore, Z′=Zα and (Z′,(ai,Bi)i<γ) is an a-construction for B∪Zα over Zα, a contradiction. Therefore, we need to show only the case when Bξ,Cη⊂Z. Since (Zα,(ai,Bi)i<γ) is not an a-construction over Zα, then Iξη∩X⊆Z′.
Let n be the least ordinal such that (Z′∪(Iξη∩X),(ai,Bi)i≤n) is not an a-construction over Z′∪(Iξη∩X), since a-isolation is the Fωa-isolation, then Bn is finite and we can assume n<ω.
Since (Z′∪(Iξη∩X),(ai,Bi)i<n) is an a-construction over Z′∪(Iξη∩X), then C=⋃i<nBi∩(Z′∪(Iξη∩X)) is such that stp(a0⌢⋯⌢an−1,C)⊢tp(a0⌢⋯⌢an−1,Z′∪(Iξη∩X)). Notice that C is a subset of Z′.
On the other hand, there is b such that stp(b,Bn)=stp(an,Bn), and tp(b,Z′∪⋃{ai\leavevmode ∣\leavevmode i<n}∪(Iξη∩X))=tp(an,Z′∪⋃{ai\leavevmode ∣\leavevmode i<n}∪(Iξη∩X)). Since Z′ is nice, then there is an infinite Iξη′⊂Iξη∩X contained in Z′.
Therefore, there are tuples d∈(Iξη∩X)\Iξη′ and e∈Z′∪⋃{ai\leavevmode ∣\leavevmode i<n} that satisfy tp(b,e∪d)=tp(an,e∪d). Denote by W the set C∪((Bn∪e)∩Z′), by Lemma 3.10 we know that there is g∈Saut(M,W) such that g(d)∈Z′.
Since stp(a0⌢⋯⌢an−1,C)⊢tp(a0⌢⋯⌢an−1,Z′∪(Iξη∩X)), then a0⌢⋯⌢an−1↓CZ′∪(Iξη∩X). Therefore
[TABLE]
and
[TABLE]
So, stp(d,C∪Bn∪e)=stp(g(d),C∪Bn∪e) and there is f∈Saut(M,C∪Bn∪e) that satisfies f(d)=g(d). From here, we finish as in case 1.
This finishes the proof of Claim 3.11.1.
Since for every β<δ and i<γ, (tp(ai,Ziβ),Bi)∈Fωa where Ziβ=Zβ∪⋃j<iaj, then (tp(ai,∪β<δZiβ),Bi)∈Fωa and (Z∪X,(ai,Bi)i<γ) is an a-construction for B∪X over Z∪X.
Fact 3.12**.**
If Z⊆Γf is nice, then for every α<κ the following holds
[TABLE]
Corollary 3.13**.**
If Z⊆Γf is nice, then for every nice set Γ⊆Γf the following holds
[TABLE]
Now, we have all the tools needed to prove the main result on Af.
4 Main result on Af
This section is devoted to prove, for a certain kind of functions, that the models Af and Ag are isomorphic if and only if Jf and Jg are isomorphic coloured trees.
Theorem 4.1**.**
*Assume f,g are functions from κ to Card∩κ\λ such that f(α),g(α)>α++ and f(α),g(α)>αλ. Then Af and Ag are isomorphic if and only if f and g are Eλ-clubκ equivalent.
*
Lemma 4.2**.**
*Assume f,g are functions from κ to κ. If f and g are Eλ-clubκ equivalent, then Af and Ag are isomorphic.
*
Proof.
Assume f and g are Eλ-clubκ equivalent. By Lemma 2.3 Jf and Jg are isomorphic coloured trees, let G:Jf→Jg be an isomorphism. Define Hξη:Bξ∪Cη∪Iξη→BG(ξ)∪CG(η)∪IG(ξ)G(η) by Hξη=HG(ξ)G(η)∘Hξη−1 (where Hrp is the elementary embedding used in the construction of Irp), clearly Hξη is elementary.
It is easy to check that the map
[TABLE]
is elementary.
Let Hˉ be an automorphism that extends H, then Hˉ(Af) is a-primary over Γg. Therefore Hˉ(Af) and Ag are isomorphic, we conclude that Af and Ag are isomorphic.
Lemma 4.3**.**
*Assume f,g are functions from κ to Card∩κ\λ such that f(α),g(α)>α++ and f(α),g(α)>αλ. If Af and Ag are isomorphic, then f and g are Eλ-clubκ equivalent.
*
**Comments: **This lemma has a long proof and it is divided in five claim. In the proof we proceed by contradiction, we assume that f and g are not Eλ-clubκ equivalent and there is an isomorphism Π:Af→Ag. Then we construct an a-primary model F, and find ξ<η and a∈Iξη such that
[TABLE]
By using a, we will construct a independent indiscernible sequence (bi)i<f(α)+ over Π(Bξ∪Cη) in Ag. Finally, we use Π and (bi)i<f(α)+ to construct a sequence (ci)i<f(α)+ indiscernible and independent over Bξ∪Cη with c0∈Iξη, which is a contradiction with Lemma 3.8.
Proof.
Let us assume, towards a contradiction, that f and g are not Eλ-clubκ equivalent and there is an isomorphism Π:Af→Ag. Without loss of generality, we can assume that {α\leavevmode ∣\leavevmode f(α)>g(α)∧cf(α)=λ} is stationary.
Let (Γf,(aif,Bif)i<γ) be an a-construction of Af over Γf. For every α define Afα=Γfα∪⋃{aif\leavevmode ∣\leavevmode i<α}, clearly Afα is not necessary a model.
We say that α<κ is f-good if (Γfα,(aif,Bif)i<α) is an a-construction over Γfα, Afα is an a-primary model over Γfα, and α is a cardinal. Notice that there are club many f-good cardinals.
We say that α is very good if, α is f-good, f(α)>g(α)>α++ and Π(Afα)=Agα.
Claim 4.3.1**.**
There is a very good cardinal α with cofinality λ and η∈Jfα+1 such that
αλ<g(α),
sup({cg(p)}p∈Jgα)<α,
there are cofinally many very good cardinals β<α,
⋃rang(η1)=λ* and ⋃rang(η5)=α.*
Proof of Claim 4.3.1.
Since there are club many α’s satisfying Π(Afα)=Agα and stationary many α’s with cofinality λ such that f(α)>g(α), there are stationary many very good cardinals.
Since there are club many α’s satisfying sup({cg(p)}p∈Jgα)<α, by Remark 2.5 we can choose α a very good cardinal with cofinality λ and η∈Jf with the desire properties. This finishes the proof of Claim 4.3.1.
Notice that by Definition 2.2 item 10, cf(η)=f(α).
Let us choose X⊆Γg and Y⊆γ such that:
Y has power 2ω and is closed (i.e. for all i∈Y, Big⊆Γg∪⋃j∈Yajg).
X has power 2ω and is nice.
D=X∪⋃{aig\leavevmode ∣\leavevmode i∈Y} is the a-primary model over X.
Dα=(X∩Γgα)∪⋃{aig\leavevmode ∣\leavevmode i∈Y∧i<α} is the a-primary model over X∩Γgα.
Π(Cη)⊆D and Π(A)⊆Dα.
If ξ∈(Jg)<λ is such that Bξ⊆X, then for all ζ<ξ, Bζ⊆X.
If θ∈(Jg)λ\Jgα+1 is such that Cθ⊆X, then for all ζ∈Jgα, ζ<θ implies that Bζ⊆X.
Let E be an a-primary model over Γgα+1∪Agα∪D, F be an a-primary model
over E∪⋃{Bξ,Iξθ\leavevmode ∣\leavevmode ξ<θ∧Cθ⊆X\Γgα+1}, and G be an a-primary model over Γg∪F.
Claim 4.3.2**.**
E* is a-constructable over Γgα+1∪X, F is a-constructable over Γgα+1∪X∪⋃{Bξ,Iξθ\leavevmode ∣\leavevmode ξ<θ∧Cθ⊆X\Γgα+1}, and without loss of generality, we can assume G=Ag.
*
Proof of Claim 4.3.2.
Notice that since D=X∪⋃{aig\leavevmode ∣\leavevmode i∈Y} is an a-construction over X, then for all i∈Y, Big⊆X∪⋃j∈Yajg holds.
By the definition of Ag, we know that stp(aig,Big)⊢tp(aig,Γg∪⋃{ajg\leavevmode ∣\leavevmode j<i}). Since Big⊆X∪⋃{ajg\leavevmode ∣\leavevmode j<i∧j∈Y} holds for every i∈Y, then stp(aig,Big)⊢tp(aig,X∪Γgα∪⋃{ajg\leavevmode ∣\leavevmode j<α}∪⋃{ajg\leavevmode ∣\leavevmode j<i∧j∈Y}) holds for all i∈Y\α. We conclude that D∪Agα is a-constructable over X∪Agα. Notice that X∪Γgα is nice, so by Lemma 3.11 X∪Agα is a-constructable over X∪Γgα. We conclude by Lemma 3.11 that E is a-constructable over Γgα+1∪X. Notice that Γgα+1∪X∪⋃{Bξ,Iξθ\leavevmode ∣\leavevmode ξ<θ∧Cθ⊆X\Γgα+1} is nice and by Lemma 3.11 we conclude that F is a-constructable over Γgα+1∪X∪⋃{Bξ,Iξθ\leavevmode ∣\leavevmode ξ<θ∧Cθ⊆X\Γgα+1}. Since F is a-constructable over Γgα+1∪X∪⋃{Bξ,Iξθ\leavevmode ∣\leavevmode ξ<θ∧Cθ⊆X\Γgα+1}, then by Lemma 3.11 G is a-primary over Γgα+1∪X∪⋃{Bξ,Iξθ\leavevmode ∣\leavevmode ξ<θ∧Cθ⊆X\Γgα+1}∪Γg. Therefore, without loss of generality, we can assume G=Ag. This finishes the proof of Claim 4.3.2.
Claim 4.3.3**.**
There are ξ<η and a∈Iξη\(Iξη↾ω) such that
[TABLE]
Proof of Claim 4.3.3.
Since α is λ-cofinal, λ>2ω, and ∣X∣=2ω, there is a very good β<α such that X∩Γgα⊂Γgβ. Let ξ<η be such that Bξ⊆Γfα\Γfβ and ξ∈/Jfβ.
It is not difficult to see that
Π(Bξ)↓Π(A)D,
and since Π(Cη)⊆D, Π(Bξ)↓Π(Cη)D.
Subclaim 4.4**.**
There is a∈Iξη\(Iξη↾ω) such that Π(a)∈/E and
[TABLE]
Proof of Subclaim 4.4.
Suppose, towards a contradiction, that for every a∈Iξη\(Iξη↾ω), Π(a)↓Π(Bξ∪Cη)E. Then, for every a∈Iξη\(Iξη↾ω) there is ba∈E such that Π(a)↓Π(Bξ∪Cη)ba.
The model E was defined as an a-primary model over Γgα+1∪X, therefore ∣E∣≤λ(T)+(∣Γgα+1∪X∣+ω)<ω. Since λ(T)≤2ω and ∣X∣=2ω, we obtain ∣E∣≤2ω+∣Γgα+1∣, by Fact 3.6, we get ∣E∣≤g(α) and ∣E∣<f(α). Since ∣Iξη∣=f(α), then there is b∈E and J={ci\leavevmode ∣\leavevmode i<ω}, a subset of Iξη\(Iξη↾ω) such that for every i<ω, Π(ci)↓Π(Bξ∪Cη)b holds. Since Π(Iξη\(Iξη↾ω)) is independent over Π(Bξ∪Cη), then b↓Π(Bξ∪Cη)∪{Π(cj)\leavevmode ∣\leavevmode j<i}Π(ci) for every i<ω. So T is not superstable, a contradiction. This finishes the proof of Subclaim 4.4.
Notice that Π(Iξη) is indiscernible over Π(Bξ∪Cη). Since Π(Bξ)↓Π(Cη)D, then by domination we get M3↓Π(Cη)D, where M3 is an a-primary model over Π(Bξ∪Cη). So the models M0=M0′=Π(A), M1=M1′=Π(Bξ), M2=Π(Cη) and M2′=D satisfy the assumptions of Lemma 2.12, therefore Π(Iξη) is indiscernible over Π(Bξ)∪D. By Remark 2.13, if M3′ is an a-primary model over Π(Bξ)∪D with Π(Iξη↾ω)⊆M3′, then Av(Π(Iξη↾ω),M3′)⊥D and Π(Iξη) is independent over Π(Bξ)∪D. So, if a is the element given in Subclaim 4.4 and Π(a)∈/M3′ holds, then tp(Π(a),M3′)⊥D.
Subclaim 4.5**.**
tp(Π(a),E)⊥D*
*
Proof of Subclaim 4.5.
Let M3′ be an a-primary model over Π(Bξ)∪D with Π(Iξη↾ω)⊆M3′. Since E is a-saturated, then there is F:M3′→E an elementary embedding such that F↾Π(Bξ)∪D=id. Let b be such that b⊨F(Av(Π(Iξη↾ω),M3′)), since Av(Π(Iξη↾ω),M3′)⊥D, then tp(b,F(M3′))⊥D. By the way Iξη was chosen and Remark 2.13, we know that Π(Iξη) is independent over Π(Bξ)∪D, by Lemma 2.10 we conclude that F(Av(Π(Iξη↾ω),M3′)) doesn’t fork over Π(Bξ)∪D. On the other hand, by Subclaim 4.4 Π(a)↓Π(Bξ∪Cη)E, so Π(a)↓Π(Bξ)∪DF(M3′). By Fact 2.7, since tp(b,F(M3′))⊥D, b↓Π(Bξ)∪DF(M3′) and Π(a)↓Π(Bξ)∪DF(M3′) hold, then tp(Π(a),F(M3′))⊥D.
To show that tp(Π(a),E)⊥D let d and B be such that d↓DE, D⊆B, Π(a)↓EB, and d↓EB.
By transitivity, d↓DE and d↓EB implies that d↓DE∪B. By Subclaim 4.4 we know that Π(a)↓Π(Bξ∪Cη)E, then by transitivity we get Π(a)↓Π(Bξ∪Cη)E∪B. Therefore d↓DF(M3′)∪B and Π(a)↓Π(Bξ)∪DF(M3′)∪B hold, so d↓DF(M3′), d↓F(M3′)B and Π(a)↓F(M3′)B hold. Since tp(Π(a),F(M3′))⊥D, we conclude that Π(a)↓Bb, finishing the proof of Subclaim 4.5.
Let IX be the set ⋃{Br,Irp\leavevmode ∣\leavevmode Br⊆Γgα+1∧r<p∧Cp⊆X\Γgα+1}. Let us show that D↓XIX∪Γgα+1.
If D↓XIX∪Γgα+1, then there are finite c∈D and b∈(IX∪Γgα)\X such that a↓Xb.
Since D is a-constructable over X, then it is a-atomic over X. So, there is a finite A1⊆X such that stp(c,A1)⊢tp(c,X).
Since T is superstable, there is a finite A2⊆X such that c∪b↓A2X. Denote by A the set A1∪A2. Since X is nice, A is a finite subset of X and b∈(IX∪Γgα)\X, then by Lemma 3.10 there is F∈Saut(M,A) such that F(b)∈X. Therefore stp(F(c),A1)⊢tp(c,X), and F(c)↓A1X, we conclude F(c)↓AF(b) and c↓Ab. Since c∪b↓A2X, then c∪b↓AX. Therefore c↓Xb, a contradiction.
By Fact 3.12, we know that IX∪X↓X∩Γgα+1Γgα+1, then IX↓XΓgα+1. Since D↓XIX∪Γgα+1, we conclude that IX↓DΓgα+1.
By the way E was chosen, we know that E is a-constructible over D∪Γgα+1. Since D is a-saturated, we get that Γgα+1⊳DE. By domination we conclude IX↓DE.
Therefore, for every c∈IX we have that c↓DE. Since c↓EE and Π(a)↓EE hold, then by Subclaim 4.5 we conclude that c↓EΠ(a) for every c∈IX. By the finite character we get IX↓EΠ(a).
By the way F was chosen, we know that F is a-constructible over IX∪E, and since E is a-saturated, we conclude that IX⊳EF. Therefore F↓EΠ(a).
Since Π(a)↓Π(Bξ∪Cη)E, by transitivity we conclude Π(a)↓Π(Bξ∪Cη)F. This finishes the proof of Claim 4.3.3.
Claim 4.5.1**.**
*There is an independent indiscernible sequence (bi)i<f(α)+ over Π(Bξ∪Cη) in Ag.
*
Proof of Claim 4.5.1
Recall that Π(a)∈Ag and Ag is a-constructable over F∪Γg. Then Ag is a-atomic over F∪Γg and there is a finite B⊆F∪Γg such that (tp(Π(a),F∪Γg),B)∈Fωa (it is a-isolated) and Π(a)∈N, where N⊆Ag is a-primary over F∪B. Let B′=B\F, there is a nice set Y such that Y∩F=A, B′⊆Y, Y Γg-nice for all (r,p) that satisfy Br,Cp⊂Y, and S={r∈Jg∣(r∈(Jg)<λ∧Br⊂Y)∨(r∈(Jg)λ∧Cr⊂Y)} is finite. Define X={r∈Jg∣(r∈(Jg)<λ∧Br⊂X)∨(r∈(Jg)λ∧Cr⊂X)}. Let Sˉ=S∪{r∈(Jg)<λ∣∃p∈S (r<p)} and Xˉ=X∪{r∈(Jg)<λ∣∃p∈X (r<p)}. By the way Xˉ was defined, we know that for every limit ordinal θ<λ and ζ∈Jg, if for all θ′<θ, ζ↾θ′∈Xˉ holds, then ζ↾θ∈Xˉ. Notice that since cf(α)=λ, if θ<λ is a limit ordinal such that for all θ′<θ, ζ↾θ′∈Jgα+1 holds, then ζ↾θ∈Jgα+1. We conclude that if θ<λ and ζ∈Jg are such that for all θ′<θ, ζ↾θ′∈Xˉ∪Jgα+1 and ζ↾θ∈Sˉ\(Xˉ∪Jgα+1), then θ is a successor ordinal.
Let {ui}i<f(α)+ be a sequence of subtrees of Jg with the following properties:
u0=Sˉ.
Every ui is a tree isomorphic to u0.
If i=j, then ui∩uj=u0∩(Xˉ∪Jgα+1).
Every ζ∈dom(cg)∩u0 satisfies cf(ζ)=cf(Gi(ζ)), where Gi is the isomorphism between u0 and ui.
For every ζ∈u0 and θ<λ such that ζ↾θ∈Xˉ∪Jgα+1 and ζ↾θ+1∈u0\(Xˉ∪Jgα+1), it holds by Definition 2.2 that ζ↾θ has κ many immediate successors in Jg\Jgα+1. Also by Definition 2.2 the elements of Jf are all the functions η:s→λ×κ4 that satisfy the items 1 to 8, therefore each of the immediate successors of ζ↾γ, ζ′, satisfies that in the set {r∈Jf\leavevmode ∣\leavevmode ζ′≤r} there is a subtree isomorphic (as coloured tree) to {p∈u0\(Xˉ∪Jgα+1)∣ζ↾γ+1≤p}.
This and the fact that S is finite, gives the existence of the sequence {ui}i<f(α)+.
By the way we chose the sequence {ui}i<f(α)+, for every i<f(α)+, the isomorphism Gi induces a coloured trees isomorphism Gˉi:Xˉ∪Jgα+1∪u0→Xˉ∪Jgα+1∪ui such that Gˉi↾Xˉ∪Jgα+1=id. Let us denote by zi the tree Xˉ∪Jgα+1∪ui.
Let us define Ui={Br∣r∈zi∧r∈(Jg)<λ}∪{Cp∣p∈zi∧p∈(Jg)λ} and Uˉi=Ui∪{Irp∣Br∈Ui∧Cp∈Ui∧r<p}. Notice that ⋃Uˉi is nice for all i<f(α)+. Since ui is isomorphic to Sˉ, then p∈zi and r<p, implies r∈zi. Therefore, ⋃⋃j=iUˉj is nice for all i<f(α)+.
Subclaim 4.6**.**
*For all i<f(α)+ it holds that ⋃Uˉi↓F⋃⋃j=iUˉj.
*
Proof of Subclaim 4.6.
By the way the sets Uˉi were constructed, we know that (⋃Uˉi)∩(⋃Uˉj)=Γgα+1∪X∪IX for all i=j. Let us denote by F the set Γgα+1∪X∪IX. By Corollary 4.13 we know that
[TABLE]
Let us prove that F↓F⋃⋃j<f(α)+Uˉj. Suppose it is false, then F↓F⋃⋃j<f(α)+Uˉj and there are finite c∈F and b∈⋃⋃j<f(α)+Uˉj such that c↓Fb.
Since F is a-constructable over F, then it is a-atomic over F. So, there is a finite A1⊆F such that stp(c,A1)⊢tp(c,F).
Since T is superstable, there is a finite A2⊆F such that c∪b↓A2F. Denote by A the set A1∪A2. By Lemma 3.10 there is F∈Saut(M,A) such that F(b)∈F. Therefore stp(F(c),A1)⊢tp(c,F), and F(c)↓A1F. So F(c)↓AF(b) and c↓Ab. Since c∪b↓A2F, then c∪b↓AF. Therefore c↓Fb, a contradiction.
Since F↓F⋃⋃j<f(α)+Uˉj and ⋃Uˉi↓F⋃⋃j=iUˉj holds, we conclude that ⋃Uˉi↓F⋃⋃j=iUˉj, finishing the proof of Subclaim 4.6.
The isomorphisms (Gˉi)i<f(α)+ induce the following elementary maps Hrpi:Br∪Cp∪Irp→BGˉi(r)∪CGˉi(p)∪IGˉi(r)Gˉi(p) for all r,p∈z0 (r∈(Jg)<λ and p∈(Jg)λ), given by Hrpi=HGˉi(r)Gˉi(p)∘Hrp−1.
It is easy to check that the map Hi:⋃Uˉ0→⋃Uˉi defined by
[TABLE]
is elementary.
Notice that for any permutation R:f(α)+→f(α)+ and any i<f(α)+, tp(⋃⋃j<iUˉj,Γgα+1∪X∪IX)=tp(⋃⋃j<iUˉR(j),Γgα+1∪X∪IX) holds.
Therefore (⋃Uˉi)i<f(α)+ is an indiscernible sequence over Γgα+1∪X∪IX. So, for all i<f(α)+, stp(⋃Uˉ0,Γgα+1∪X∪IX)=stp(⋃Uˉi,Γgα+1∪X∪IX). Let Gi:F∪⋃Uˉ0→F∪⋃Uˉi, be given by Gi↾F=id and Gi↾⋃Uˉ0=Hi.
It is easy to check that Gi is elementary.
Let us define for all i<f(α)+ the model Mi⊆Ag as an a-primary model over F∪⋃j<iMj∪⋃Uˉi, with N⊆M0 and let b0∈M0 be Π(a) (notice that B⊆Uˉ0 was chosen such that (tp(Π(a),F∪Γg),B)∈Fωa and Π(a)∈N, N is the a-primary model over F∪B). For all 0<i<f(α)+ let Gˉi∈Saut(M,Γgα+1∪X∪IX) be such that Gˉi↾F∪⋃Uˉi=Gi↾F∪⋃Uˉi and bi∈Mi be such that stp(bi,Gi(B))=stp(Gˉi(Π(a)),Gi(B)). We know that (tp(Π(a),F∪Γg),B)∈Fωa, so by a-isolation and the definition of Gˉi we conclude that (tp(bi,Gˉi(F∪⋃Uˉ0)),Gi(B))∈Fωa, so (tp(bi,F∪⋃Uˉi),Gi(B))∈Fωa. Therefore tp(bi,F)=tp(Gˉi(Π(a)),F) and since Gˉi is an automorphism that fix F, we conclude that tp(bi,F)=tp(Π(a),F). On the other hand (tp(bi,F∪⋃Uˉi),Gi(B))∈Fωa implies that bi∪F∪⋃Uˉi is a-constructable over F∪⋃Uˉi, since F is a-saturated then ⋃Uˉi⊳Fbi∪⋃Uˉi. By Subclaim 4.6 we know that ⋃Uˉi↓F⋃⋃j=iUˉj, so by domination we conclude that bi∪⋃Uˉi↓F⋃⋃j=iUˉj, in particular bi↓F⋃⋃j=iUˉj holds for all i<f(α)+.
Notice that for all i<f(α)+, Mi is a-constructable over F∪⋃⋃j≤iUˉj.
Therefore ⋃⋃k≤jUˉk⊳FMj holds for all i<f(α)+, and since bi↓F⋃⋃j=iUˉj holds for all i<f(α)+, then bi↓FMj holds for all j,i<f(α)+, j<i. In particular bi↓F⋃k≤jbk holds for all j,i<f(α)+, j<i. We conclude that bi↓F⋃j<ibj holds for all i<f(α)+.
Since tp(bi,F)=tp(Π(a),F) and Π(a)↓Π(Bξ∪Cη)F, we get that bi↓Π(Bξ∪Cη)F and by transitivity we conclude that bi↓Π(Bξ∪Cη)⋃j<ibj. So (bi)i<f(α)+ is an independent sequence over Π(Bξ∪Cη). Since for i=j we know that tp(bi,F)=tp(bj,F), the types over F are stationary, and bi↓F⋃j<ibj, then we conclude that (bi)i<f(α)+ is an indiscernible sequence over F. This finishes the proof of Claim 4.5.1.
For every i<f(α)+ let ci be Π−1(bi), since Π is an isomorphism, then (ci)i<f(α)+ is an indiscernible sequence over Bξ∪Cη and an independent sequence over Bξ∪Cη, notice that c0=a, so c0∈Iξη. This contradicts Lemma 3.8.
5 Corollaries
Recall that λ is the cardinal (2ω)+.
Corollary 5.1**.**
*If κ is inaccessible, and T is a theory with S-DOP, then Eλ-clubκ≤c≅T.
*
Proof.
Let f and g be elements of κκ.
First we will construct a function F:κκ→κκ such that f Eλ-clubκ g if and only if AF(f) and AF(g) are isomorphic. This is to get over the restrictions on f and g in the hypothesis of Theorem 4.1 .
For every cardinal α<κ, define Sα={β∈Card∩κ\leavevmode ∣\leavevmode λ,α+++,αλ<β}.
Let Gβ be a bijection from κ into Sβ, for every β<κ. For every f∈κκ define F(f) by F(f)(β)=Gβ(f(β)), for every β<κ. Clearly f Eλ-clubκ g if and only if F(f) Eλ-clubκ F(g) i.e. AF(f) and AF(g) are isomorphic and F is continuous.
Finally we need to find G:{F(f)\leavevmode ∣\leavevmode f∈κκ}→κκ such that AG(F(f))≅AF(f) and f↦G(F(f)) is continuous.
Notice that for every f,g∈κκ and α<κ, by Definition 2.2 and the definition of Jfα in Remark 2.4, it holds:
[TABLE]
By Definition 3.5, for every f,g∈κκ and α<κ it holds:
[TABLE]
By the definition of Afα in Theorem 4.1, for every f,g∈κκ and α<κ an F(f)-good and F(g)-good cardinal, it holds:
[TABLE]
In general,since there are club many F(f)-good and F(g)-good cardinals, then by the definition of Afα in Theorem 4.1 we can construct the models Af such that for every f,g∈κκ and α<κ, it holds:
[TABLE]
So we can construct the models Af such that for every f,g∈κκ and α<κ, it holds:
[TABLE]
For every f∈κκ define Cf⊆Card∩κ such that ∀α∈Cf, it holds that for all β ordinal smaller than α, ∣AF(f)β∣<∣AF(f)α∣. For every f∈κκ and α∈Cf choose Efα:dom(AF(f)α)→∣AF(f)α∣ a bijection, such that ∀β,α∈Cf, β<α it holds that Efβ⊆Efα. Therefore ⋃α∈CfEfα=Ef is such that Ef:dom(AF(f))→κ is a bijection, and for every f,g∈κκ and α<κ it holds:
If F(f)↾α=F(g)↾α, then Ef↾dom(AF(f)α)=Eg↾dom(AF(g)α).
Let π be the bijection in Definition 1.2, define the function G by:
[TABLE]
To show that G is continuous, let [η↾α] be a basic open set and ξ∈G−1[[η↾α]]. So, there is β∈Cξ such that for all γ<α, if γ=π(m,a1,a2,…,an), then Eξ−1(ai)∈dom(Aξβ) holds for all i≤n. Since for all ζ∈[ξ↾β] it holds that Aξβ=Aζβ, then for every γ<α that satisfies γ=π(m,a1,a2,…,an), it holds that:
[TABLE]
We conclude that G(ζ)∈[η↾α], and G is continuous.
In [HM] it was proved that if T is a classifiable theory and μ<κ is a regular cardinal, then ≅T is continuously reducible to Eμ-clubκ.
Corollary 5.2**.**
*If κ is an inaccessible and T1 is a classifiable theory and T2 is a superstable theory with S-DOP, then ≅T1≤c≅T2.
*
The last corollaries are about Σ11-completeness.
Suppose E is an equivalence relation on κκ. We say that E is Σ11
if E is the projection of a closed set in κκ×κκ×κκ and it
is Σ11-complete if every Σ11 equivalence relation is
Borel reducible to E.
In [HK] it was proved, under the assumption V=L, that Eμ-clubκ is Σ11-complete for all regular μ<κ. In [FMR], under the assumption GCH, it was proved that there exists a cofinality-preserving GCH-preserving forcing extension in which Eμ-clubκ is Σ11-complete for all regular μ<κ.
Corollary 5.3**.**
Suppose V=L. If κ is an inaccessible and T is a superstable theory with S-DOP, then ≅T is Σ11-complete.
Suppose GCH. There exists a cofinality-preserving GCH-preserving forcing extension in which If κ is an inaccessible and T is a superstable theory with S-DOP, then ≅T is Σ11-complete.