This paper explores the properties of tree properties in model theory, providing criteria for SOP$_2$ and SOP$_1$, and examining the relationship between TP$_2$ and Kim-forking, with implications for supersimplicity.
Contribution
It introduces type-counting criteria for SOP$_2$ and SOP$_1$, and investigates the connection between TP$_2$ and Kim-forking, advancing understanding of independence notions.
Findings
01
Type-counting criteria for SOP$_2$ and SOP$_1$ are established.
02
A theory is supersimple iff there are no countably infinite Kim-forking chains.
03
Relationships between TP$_2$ and Kim-forking are clarified.
Abstract
Tree properties are introduced by Shelah, and it is well-known that a theory has TP (the tree property) if and only if it has TP1 or TP2. In any simple theory (i.e., a theory not having TP), forking supplies a good independence notion as it satisfies symmetry, transitivity, extension, local character, and type-amalgamation. Shelah also introduced SOPn (n-strong order property). Recently it is proved that in any NSOP1 theory (i.e. a theory not having SOP1) holding nonforking existence, Kim-forking also satisfies all the mentioned independence properties except base monotonicity (one direction of transitivity). These results are the sources of motivation for this paper. Mainly, we produce type-counting criteria for SOP2 (which is equivalent to TP1) and SOP1. In addition, we study relationships between TP2 and Kim-forking, and obtain that a theory is…
Equations6
G={qδ}∪⋃{G(δ⌈i)⌢⟨ji⟩∣i<κ,ji<λ,ji=δ(i)},
G={qδ}∪⋃{G(δ⌈i)⌢⟨ji⟩∣i<κ,ji<λ,ji=δ(i)},
d⌣∣AiKai0∗\mboxandd⌣∣AiKAi+1
d⌣∣AiKai0∗\mboxandd⌣∣AiKAi+1
d⌣∣EiKai0∗\mboxandhenced⌣∣EiKEi+1.
d⌣∣EiKai0∗\mboxandhenced⌣∣EiKEi+1.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Tree properties are introduced by Shelah, and it is well-known that
a theory has TP (the tree property) if and only if it has
TP1 or TP2.
In any simple theory (i.e., a theory not having TP), forking supplies a good independence notion as it satisfies
symmetry, full transitivity, extension, local character, and type-amalgamation, over sets.
Shelah also introduced SOPn (n-strong order property). Recently it is proved that in any NSOP1 theory (i.e. a
theory not having SOP1) holding nonforking existence, Kim-forking also satisfies all the mentioned independence properties except base monotonicity (one direction of full transitivity). These results are the sources of motivation for this paper.
Mainly, we produce type-counting criteria for SOP2 (which is equivalent to TP1) and SOP1. In addition, we study relationships between TP2 and Kim-forking, and obtain that
a theory is supersimple iff there is no countably infinite Kim-forking chain.
The first author has been partially funded by a Spanish government grant MTM2017-86777-P and a Catalan DURSI grant 2017SGR-270. The second author has been supported by Samsung Science Technology Foundation under Project Number SSTF-BA1301-03 and an NRF of Korea grant 2018R1D1A1A02085584.
In this paper we study various notions of tree properties, and we mainly produce type-counting criteria for SOP1 and SOP2.
TP (the tree property) is introduced by S. Shelah in [17], and it is shown that in any simple theory (a theory not having TP),
forking satisfies
local character, finite character, extension, and later in [10],[14],
symmetry, full transitivity, and type-amalgamation of Lascar types, over arbitrary sets.
In [16], it is claimed that a theory has TP if and only if it has TP1 or TP2, and a complete proof is supplied in [13].
On the other hand, in [18], Shelah introduces the notions of n-strong order properties (SOPn) for n≥3, which further classify theories having
TP1. More precisely, a theory has SOPn if there is a formula φ(x,y) (∣x∣=∣y∣) defining a directed graph that has an infinite
chain but no cycle of length ≤n. Hence SOPn+1 implies SOPn, but it is known that the implication is not reversible for each n≥3.
As we are not dealing with SOPn for n≥3 in this note, we do not give many details on this.
For n=1,2, Shelah defines SOPn separately as follows.
Definition 0.1**.**
(1)
We say a formula φ(x,y) has SOP2 if
there is a set {aα∣α∈2<ω} of tuples such that
(a)
for each β∈2ω,
{φ(x,aβ⌈n)∣n∈ω}
is consistent, and
2. (b)
for each incomparable pair γ,γ′∈2<ω,
{φ(x,aγ),φ(x,aγ′)} is inconsistent.
A theory T has SOP2 if some formula in T has SOP2.
2. (2)
We say a formula φ(x,y) has SOP1 if
there is a set {aα∣α∈2<ω} of tuples such that
(a)
for each β∈2ω,
{φ(x,aβ⌈n)∣n∈ω}
is consistent, and
2. (b)
for each β∈2<ω,
{φ(x,aγ),φ(x,aβ⌢1)} is inconsistent whenever β⌢0⊴γ.
A theory Thas SOP1 if some formula in T has SOP1. We say a theory Tis NSOP1 if T does not have
SOP1.
Hence it follows that SOP2 implies SOP1. It is known for a theory that SOP3 implies SOP2, and SOP2 is equivalent to TP1.
It is still an open question whether conversely, SOP1 implies SOP3, or SOP2. The random parametrized equivalence relations (Example 3.4), an infinite dimensional vector space over an algebraically closed field with a bilinear form, and
ω-free PAC fields are typical examples having non-simple but NSOP1 theories.
Recently in [7],[8], it is shown that in any NSOP1 theory, over models, ‘Kim-forking’ satisfies all the aforementioned axioms that forking satisfies in simple theories, except base monotonicity (one direction of full
transitivity). Then it is proved in
[6], [4] that the same axioms hold over arbitrary sets in any NSOP1 theory having nonforking existence. So far summarized results justify our study of various tree properties in this paper.
Throughout this note, we use standard notation. We work in a large saturated model M of a complete theory T in a language L, and a,b,… (A,B,…) denote finite (small, resp.) tuples (sets, resp.) from M, unless said otherwise.
We write a≡Ab to mean tp(a/A)=tp(b/A).
As is customary, for cardinals κ,λ, we write λκ, λ<κ to denote {f∣f:κ→λ}, {f∣f:α→λ,α∈κ} respectively, or their cardinalities, and it will be clear from context which one they mean. As usual, we can look at λ<κ={f∣f:α→λ,α<κ} as a tree, and we give a partial order ⊴ to it. Namely we let α⊴β for α,β∈λ<κ, when α=β⌈dom(α). Thus we say α,β are incomparable if so are they in the ordering ⊴. Also α⌢β denotes the concatenation of β after α. When
β=⟨i0,…,in⟩ where i0,…,in∈λ, we may simply write αi0⋯in to mean α⌢β, so for example α⌢1 or α1 indeed means α⌢⟨1⟩.
In this note if we write a set as {pi∣i∈I} then
pi=pj for i=j∈I. Given a sequence of tuples ⟨ci∣i<κ⟩ and j<κ, we write c<j, c>j to abbreviate ⟨ci∣i<j⟩, ⟨ci∣j<i<κ⟩, respectively.
We now state definitions and facts including those already mentioned that will be freely used throughout the paper.
Definition 0.2**.**
(1)
We say an L-formula φ(x,y) has the k-tree property (k-TP) where k≥2, if there is the set of tuples
{cβ∣β∈ω<ω} (from M) such that
for each α∈ωω, {φ(x,cα⌈n)∣n∈ω} is consistent, while for any β∈ω<ω,
{φ(x,cβ⌢i)∣i∈ω} is
k-inconsistent (i.e. any k-subset is inconsistent). A formula has the tree property (TP) if it has k-TP for some k≥2. We say T has TP if a formula in T has this property. We say T is simple if T does not have TP.
2. (2)
A formula ψ(x,y) has the tree property of the first kind (TP1)
if there are
tuples aα (α∈ω<ω) such that {ψ(x,aβ⌈n)∣n∈ω} is consistent for each β∈ωω,
while ψ(x,aα)∧ψ(x,aγ) is inconsistent whenever α,γ∈ω<ω
are incomparable. A theory has TP1 if so has a formula.
3. (3)
We say a formula ψ(x,y)∈L has
the tree property of the second kind (TP2)
if there are tuples
aji (i,j<ω) such that for each i,
{ψ(x,aji)∣j<ω} is 2-inconsistent, whereas for any f∈ωω,
{ψ(x,af(i)i)∣i<ω} is consistent. We say T has TP2 if a formula has so in T.
Fact 0.3**.**
(1)
The following are equivalent.
(a)
A theory T has TP.
2. (b)
T* has 2-TP.*
3. (c)
T* has either TP1 or TP2.*
2. (2)
A formula has TP1* iff it has SOP2.*
3. (3)
If a formula has SOP1* then it has 2-TP.*
In Fact 0.3(1), the equivalence of (a) and (b) is shown in [16],
and that of (a) and (c) is claimed in [16], but a correct proof is stated in [13].
Fact 0.3(2)(3) easily come from the definitions.
In Section 1, we supply type-counting criteria for SOP2. These are generalizations of those in
[12], and we use similar techniques in [1] where analogous criteria for TP are stated.
In Section 2, in parallel, we produce type-counting criteria for SOP1.
In Section 3, we study TP2 in relation with Kim-independence and local weights. In particular we show that T is supersimple iff there is no Kim-forking chain of length ω.
1. Type-counting criteria for SOP2
When Shelah introduces the class of simple theories in [17], he states and proves type-counting criteria for TP.
Then in [1], the first author improves those and suggests more elaborate criteria for TP.
Later in [12], type-counting criteria for TP1 (equivalently for SOP2) analogous to the type-counting results of [17] are suggested.
In [15], another type-counting criteria for SOP2 is suggested.
Now in this section, we supply more refined criteria for SOP2, which are analogous to those for TP in [1].
Definition 1.1**.**
Let φ(x,y) be an L-formula. Assume infinite cardinals κ,λ are given. We define
NTφ2(κ,λ) as the supremum of cardinalities ∣F∣ of sets F of positive φ-types p(x) over some fixed set A of cardinality λ satisfying that
(1)
∣p(x)∣=κ for every p(x)∈F, and
2. (2)
for every subfamily {pi∣i<λ+}⊆F, there are disjoint subsets τj⊂λ+ with ∣τj∣=λ+, and families
{pi′∣pi′⊆pi,i∈τj}(j=0,1) such that ∣pi∖pi′∣<κ for each i∈τ0∪τ1, and every formula
in ⋃i∈τ1pi′ is inconsistent with every formula in
⋃i∈τ0pi′.
Notice that if ∣F∣≤λ then the condition (2) is vacuous.
We define NT2(κ,λ) in a similar way, with the only difference that each partial type p(x)∈F (with finite x) may contain any formula over A, not only instances of a fixed φ(x,y), while still ∣p(x)∣=κ.
Now given a formula φ, we give type-counting criteria for SOP2, in terms of NTφ2.
Theorem 1.2**.**
Let κ,λ denote infinite cardinals. The following are equivalent for a formula φ(x,y)∈L.
(1)
φ(x,y)* has SOP2.*
2. (2)
NTφ2(ω,ω)≥ω1**
3. (3)
NTφ2(ω,ω)≥2ω.**
4. (4)
NTφ2(κ,λ)≥λ+* for some κ,λ.*
5. (5)
NTφ2(κ,λ)≥λ+* for any
κ,λ with
λ<κ=λ and λκ>λ.*
6. (6)
NTφ2(κ,λ)≥λκ* for any
κ,λ such that
λ<κ=λ and λκ>λ.*
Proof.
(1)⇒(6) Assume φ(x,y) has SOP2. Suppose that
for infinite κ,λ, we have λ<κ=λ and λκ>λ.
Hence κ≤λ. We will show that NTφ2(κ,λ)≥λκ.
Since φ has TP1 as in Fact 0.3(2),
by compactness, there is a tree of formulas
{φ(x,aσ)∣σ∈λ<κ} witnessing TP1 w.r.t. λ<κ (i.e. for each β∈λκ, qβ(x):={φ(x,aβ⌈i)∣i<κ} is consistent, while for any incomparable α,γ∈λ<κ,
{φ(x,aα),φ(x,aγ)} is inconsistent).
Let A be the set of
parameters in the tree.
We let F:={qβ(x)∣β∈λκ}. Note that
∣F∣=λκ>λ=λ<κ=∣A∣.
We want to show that F satisfies the condition (2) in Definition 1.1.
Thus assume a set G={qβ∣β∈τ} is given, where
τ⊆λκ with ∣τ∣=λ+. Now
for each σ∈λ<κ, we let
Gσ:={p∈G∣φ(x,aσ)∈p}.
Claim. There are μ∈λ<κ and s0<s1∈λ such that
∣Gμ⌢⟨s0⟩∣=∣Gμ⌢⟨s1⟩∣=λ+: Suppose not. Then for each
σ∈λ<κ there is at most one s<λ such that
∣Gσ⌢⟨s⟩∣=λ+. Thus the only possibility is that there is δ∈λκ such that
for each i∈κ, ∣Gδ⌈i∣=λ+, while for each j∈λ with j=δ(i), we have ∣G(δ⌈i)⌢⟨j⟩∣≤λ. Since
[TABLE]
it follows that ∣G∣≤1+λ⋅λ⋅κ=λ, a contradiction.
Hence the claim follows.
Now let τ0,τ1 be
the disjoint subsets of τ indexing the sets Gμ⌢⟨s0⟩ and Gμ⌢⟨s1⟩, respectively,
so Gμ⌢⟨sj⟩={pi∈G∣i∈τj} (j=0,1).
We now put for each i∈τ0∪τ1, pi′:=pi∖qμ where
qμ={φ(x,aσ)∣σ⊴μ}.
Hence ∣pi∖pi′∣<κ.
Moreover clearly each formula in ⋃i∈τ1pi′ is inconsistent with every formula
in ⋃i∈τ0pi′.
Therefore Definition 1.1(2) holds.
(6)⇒(5)⇒(2)⇒(4)
and (6)⇒(3)⇒(2) Clear.
(4)⇒(1)
Assume NTφ2(κ,λ)≥λ+ for some infinite κ and λ. Hence there is a family F={qi∣i<λ+} over
a set A with ∣A∣≤λ satisfying the condition in Definition 1.1(2).
We will produce an SOP2 tree for φ from F.
Claim. There exist a function f:2<ω→A, a family {Gσ∣σ∈2<ω} of types, and a family
{τσ⊆λ+∣σ∈2<ω} such that for all σ∈2<ω,
(i)
∣τσ∣=λ+; τσ0 and τσ1 are disjoint subsets of τσ,
2. (ii)
Gσ is of the form {pi∣pi⊆qi,i∈τσ} (so ∣Gσ∣=λ+) with
∣qi∖pi∣<κ, and for j∈{0,1}, Gσj is of the form {pi′∣pi′⊆pi∈Gσ,i∈τσj} with ∣pi∖pi′∣<κ,
3. (iii)
for aσ:=f(σ) we have φ(x,aσ)∈⋂Gσ, and
4. (iv)
each formula in ⋃Gσ0
is inconsistent with every formula in ⋃Gσ1.
Proof of Claim.
We construct such a function and sets by induction on the length of σ. When σ=∅, choose φ(x,bi) from each qi∈F. Then
since ∣A∣<λ+ and λ+ is regular (or just by counting), there must be a subset
τ∅⊆λ+ of size λ+ such that
bi are equal (say, to a∅) for all i∈τ∅. Then set f(∅)=a∅. Also, set G∅:={qi∣i∈τ∅}, so φ(x,a∅)∈⋂G∅.
Assume now the induction hypothesis for σ. We will find
sets and function values corresponding to
σ0 and σ1. Write Gσ={pi∣i∈τσ}.
Since F satisfies Definition 1.1(2), there exist disjoint subsets τσj′⊆τσ of size λ+ (j=0,1) and a subset pi′⊆qi with ∣qi∖pi′∣<κ for each i∈τσ0′∪τσ1′, such that every formula in ⋃i∈τσ0′pi′ is inconsistent with each formula in ⋃i∈τσ1′pi′.
We now let pi′′:=pi∩pi′ for i∈⋃j=0,1τσj′, and let
Gσj′:={pi′′∣i∈τσj′}. Then clearly pi′′⊆pi, ∣qi∖pi′′∣<κ, and ∣pi∖pi′′∣<κ.
Now since again ∣A∣≤λ, for j∈{0,1},
there must be a set τσj⊆τσj′ with ∣τσj∣=λ+ such that for some dj∈A (which we put aσj=f(σj)), φ(x,dj)∈⋂i∈τσjpi′′. Therefore if we let
Gσj:={pi′′∣i∈τσj}, then τσj, f(σj) and Gσj, for j=0,1, satisfy all the required conditions for the induction step, and the proof for Claim is complete.
Now, using the properties described in Claim, we see that the tree {φ(x,aσ)∣σ∈2<ω} witnesses SOP2.
Indeed given any σ,β,γ∈2<ω,
the formula φ(x,aσ⌢0⌢β) is inconsistent with φ(x,aσ⌢1⌢γ).
∎
We now give type-counting criteria for SOP2, for a theory.
Theorem 1.3**.**
Let κ,λ denote infinite cardinals. The following are equivalent.
(1)
T* has SOP2.*
2. (2)
For every regular κ>∣T∣, there is λ≥2κ such that
NT2(κ,λ)>λ.
3. (3)
For some regular κ>∣T∣ and some λ≥2κ,
we have NT2(κ,λ)>λ.
4. (4)
For every κ,λ with λ<κ=λ and λκ>λ,
we have NT2(κ,λ)≥λκ.
5. (5)
For every κ,λ with λ<κ=λ and λκ>λ,
we have NT2(κ,λ)>λ.
Proof.
(1)⇒(4) The same proof of (1)⇒(6) for Theorem 1.2 shows this.
(2)⇒(3), (4)⇒(5) Clear.
(3)⇒(1) Assume (3) with the given κ,λ. Hence there is a family F of arbitrary types over A with ∣A∣=λ,
satisfying the conditions (2) and (3) in Definition 1.1. There is no harm to assume that ∣F∣=λ+ and we write F={qi∣i<λ+}. Since ∣qi∣=κ,
we write qi={φαi(x,aαi)∣α<κ}, where aαi∈A. Now since ∣T∣κ=2κ<λ+, there must be a subset
τ of λ+ with ∣τ∣=λ+ such that the sequence
⟨φαi(x,yαi)∣α<κ⟩ stays the same, say ⟨φα(x,yα)∣α<κ⟩, for every
i∈τ.
Moreover since κ(>∣T∣) is regular, there must be a subset μ⊆κ of size κ such that φα(x,yα) stays the same, say φ(x,y), for all α∈μ. Now we let
F1:={{φ(x,aαi)∣α∈μ}∣i∈τ}. Then it easily follows that F1 also satisfies Definition 1.1(1) and (2).
Moreover each type in F1 is a positive φ-type. Therefore (1) follows
by Theorem 1.2(4)⇒(1).
(5)⇒(2) Assume (5). Now given regular κ>∣T∣, let
λ:=ℶκ(κ). Then λ<κ=λ<λκ. Hence by (5), we have NT2(κ,λ)>λ.
∎
2. Type-counting criteria for SOP1
As said in the beginning of Section 1, type-counting criteria for SOP2 are given in [12] as well.
But for the first time, here we state and prove type-counting criteria for a formula to have SOP1.
Definition 2.1**.**
We say a formula φ(x,y) has ω<ω-SOP1 if
there is a set {aα∣α∈ω<ω} of tuples such that
(1)
for each β∈ωω,
{φ(x,aβ⌈n)∣n∈ω}
is consistent, and
2. (2)
for each β∈ω<ω and each pair m<n∈ω,
{φ(x,aγ),φ(x,aβn)} is inconsistent whenever βm⊴γ.
Fact 2.2**.**
A formula has SOP1 iff it has ω<ω-SOP1.
Proof.
(⇐) Clear.
(⇒) Assume φ(x,y) and
{aα∣α∈2<ω} witness SOP1. Now for each n>1, define a 1−1 map fn:n<ω→2<ω such that fn(∅):=∅, and for α∈n<ω and m<n, fn(αm):=fn(α)0⋯0n−m−11.
It follows that
An:={afn(α)∣α∈n<ω} forms an
n<ω-SOP1 tree for φ, and then compactness yields an ω<ω-SOP1 tree for the formula.
∎
Definition 2.3**.**
Let φ(x,y)∈L. For any two infinite cardinals κ,λ, we define NTφ1(κ,λ) as the supremum of cardinalities ∣F∣ of sets F of positive φ-types
over some fixed set A of cardinality λ satisfying that
(1)
∣q(x)∣=κ for every q(x)∈F, and
2. (2)
given any subfamily G={qi∣i<λ+} of F and a family G′={pi∣pi⊆qi,i<λ+} where ∣qi∖pi∣<κ
for each i<λ+,
there are disjoint subsets τ0,τ1 of λ+
with ∣τj∣=λ+ (j=0,1), and Gj′={pi′∣pi′⊆pi,i∈τj} with ∣pi∖pi′∣<κ for each i∈τ0∪τ1,
such that for every pi′∈G1′ there is a formula in pi′ which is inconsistent with each formula in ⋃G0′.
Notice that if ∣F∣≤λ then the condition (2) is vacuous.
Theorem 2.4**.**
Assume φ(x,y) is an L-formula, and κ,λ denote infinite cardinals. The following are equivalent.
(1)
φ(x,y)* has SOP1.*
2. (2)
NTφ1(ω,ω)≥ω1**
3. (3)
NTφ1(ω,ω)≥2ω.**
4. (4)
NTφ1(κ,λ)≥λ+* for some κ,λ.*
5. (5)
NTφ1(κ,λ)≥λ+* for any
λ and any regular κ with
λ<κ=λ and λκ>λ.*
6. (6)
NTφ1(κ,λ)≥λκ* for any
λ and regular κ such that
λ<κ=λ and λκ>λ.*
Proof.
(1)⇒(6) Assume φ(x,y) has SOP1. Suppose that
for regular κ, and infinite λ, we have λ<κ=λ and λκ>λ. We will show that NTφ1(κ,λ)≥λκ.
Since φ has ω<ω-SOP1 as in Fact 2.2,
by compactness, there is a tree of formulas
{φ(x,aσ)∣σ∈λ<κ} witnessing SOP1 w.r.t. λ<κ (i.e. for each β∈λκ, qβ(x):={φ(x,aβ⌈i)∣i<κ} is consistent, while for any α∈λ<κ and u<v∈λ,
{φ(x,aγ),φ(x,aα⌢⟨v⟩)} is inconsistent for any γ⊵α⌢⟨u⟩). Let A be the set of
parameters in the tree.
We let F:={qβ(x)∣β∈λκ}. Note that
∣F∣=λκ>λ=λ<κ=∣A∣.
We want to show that F satisfies the condition (2) in Definition 2.3, Thus assume a set G={pβ⊆qβ∣β∈τ} is given where ∣qβ∖pβ∣<κ and τ⊆λκ with ∣τ∣=λ+. Since ∣qβ∖pβ∣<κ and κ is regular, for each β∈τ, there must exist an ordinal iβ<κ such that {φ(x,aβ⌈i)∣iβ≤i<κ}⊆pβ. Note that λ<κ=λ implies κ<λ+. Thus there exists a subset τ′′⊆τ
of size λ+ such that iβ stays the same, say i0 for every β∈τ′′. Once more, since λ<κ=λ, for some subset τ′⊆τ′′
of size λ+, β⌈i0 stays the same for every β∈τ′. Namely, there is
σ0∈λ<κ such that σ0=β⌈i0 (and hence aσ0=aβ⌈i0) for all
β∈τ′.
Now let G′:={pβ∈G∣β∈τ′}, and for σ(⊵σ0)∈λ<κ, we let
Gσ′:={p∈G′∣φ(x,aσ)∈p}.
Claim. There are μ(⊵σ0)∈λ<κ and s0<s1∈λ such that
∣Gμ⌢⟨s0⟩′∣=∣Gμ⌢⟨s1⟩′∣=λ+: Suppose not. Thus for each σ⊵σ0∈λ<κ there is at most one s<λ such that
∣Gσ⌢⟨s⟩′∣=λ+. Then it lead a contradiction by the similar cardinality computation in the proof
of Claim in that of Theorem 1.2 (1)⇒(6). Hence the claim follows.
Now let τ0,τ1 be
the disjoint subsets of τ′ indexing the sets Gμ⌢⟨s0⟩′ and Gμ⌢⟨s1⟩′, respectively,
so Gμ⌢⟨sj⟩′={pi∈G′∣i∈τj} (j=0,1).
We now put for each i∈τ0∪τ1, pi′:=pi∖qμ where
qμ={ψ(x,aσ)∣σ⊴μ}.
Notice that the formula φ(x,aμs1)∈⋂i∈τ1pi′ is inconsistent with any formula
in ⋃i∈τ0pi′.
Hence Definition 2.3(2) holds.
(6)⇒(5)⇒(2)⇒(4)
and (6)⇒(3)⇒(2) Clear.
(4)⇒(1) Assume NTφ1(κ,λ)≥λ+ for some infinite λ and κ. Hence there is a family F={qi∣i<λ+} over
a set A with ∣A∣≤λ satisfying the conditions Definition 2.3(1) and (2).
We will produce an SOP1 tree for φ from F.
Claim. There exist a function f:2<ω→A, a family {Gσ∣σ∈2<ω} of families of types, and a family
{τσ⊆λ+∣σ∈2<ω} such that, for all σ∈2<ω,
(i)
∣τσ∣=λ+; τσ0 and τσ1 are disjoint subsets of τσ,
2. (ii)
Gσ is of the form {pi∣pi⊆qi,i∈τσ} (so ∣Gσ∣=λ+) with
∣qi∖pi∣<κ, and for j∈{0,1}, Gσj is of the form {pi′∣pi′⊆pi∈Gσ,i∈τσj} with ∣pi∖pi′∣<κ,
3. (iii)
for aσ:=f(σ) we have φ(x,aσ)∈⋂Gσ,
and φ(x,aσ1)∈⋂Gσ1 is inconsistent with every formula in ⋃Gσ0.
Proof of Claim.
We construct such a function and sets by induction on the length of σ. When σ=∅, choose φ(x,bi) from each qi∈F. Then
since ∣A∣≤λ, there is a subset
τ∅⊆λ+ of size λ+ such that
the bi are equal (say, to a∅) for all i∈τ∅. Then set f(∅)=a∅. Also, set G∅:={qi∣i∈τ∅}, so φ(x,a∅)∈⋂G∅.
Assume now the induction hypothesis for σ. We will find
sets and function values corresponding to
σ0 and σ1. Write Gσ={pi∣i∈τσ}.
Since F satisfies Definition 2.3(2), there exist disjoint subsets τσj′⊆τσ of size λ+ (j=0,1) and a subset pi′⊆pi with ∣pi∖pi′∣<κ for each i∈τσ0′∪τσ1′, such that for every pi′∈H1, there is a formula φ(x,ai′)∈pi′ inconsistent with each formula in ⋃H0, where
Hj={pi′∣i∈τσj′}.
Now since again ∣A∣≤λ,
there must be a set τσ1⊆τσ1′ with ∣τσ1∣=λ+ such that ai′ are all equal for all i∈τσ1, which we put f(σ1)=aσ1. Thus if we let
Gσ1:={pi′∣i∈τσ1}, then φ(x,aσ1)∈⋂Gσ1 is inconsistent with each formula in ⋃H0. Similarly if we choose φ(x,bi′)∈qi′∈H0, there must be a subset τσ0⊆τσ0′ of size λ+ such that bi′ stays the same for each i∈τσ0, which we let f(σ0)=aσ0. Then let Gσ0:={pi′∣i∈τσ0}, so φ(x,aσ0)∈⋂Gσ0. Therefore, τσj, f(σj) and Gσj, for j=0,1, satisfy all the required conditions for the induction step, and the proof for Claim is complete.
Now, using the properties described in Claim, we see that the tree {φ(x,aσ)∣σ∈2<ω} witnesses SOP1.
Indeed given any σ∈2<ω,
the formula φ(x,aσ1) is inconsistent with any φ(x,aγ) where γ⊵σ0.
∎
We finish this section by asking the following: Given a theory, are there criteria for SOP1 analogous to Theorem 1.3 for SOP2?
3. Kim-forking and TP2
We begin this section by recalling basic definitions.
Definition 3.1**.**
(1)
We say a formula φ(x,a0)divides over a set A, if there is an A-indiscernible sequence ⟨ai∣i<ω⟩
such that {φ(x,ai)∣i<ω} is inconsistent. A formula forks over A if the formula implies a finite disjunction of formulas, each of which divides over A. A type divides/forks over A if the type implies a formula which divides/forks over A. We write a⌣∣AB (a⌣∣AdB) if tp(a/AB) *does not fork * (divide, resp.) over A.
2. (2)
An A-indiscernible sequence ⟨ai∣i<ω⟩ is said to be a Morley sequence overA if
ai⌣∣Aa<i holds for each i<ω.
3. (3)
We say a formula φ(x,a0)Kim-divides overA if {φ(x,ai)∣i<ω} is inconsistent for some Morley sequence ⟨ai∣i<ω⟩ over A. A formula Kim-forks over A if the formula implies a finite disjunction of formulas, each of which Kim-divides over A.
4. (4)
A type Kim-divides/forks over A if the type implies a formula which Kim-divides/forks over A. We write c⌣∣AKB if tp(c/AB) *does not Kim-fork * over A. Hence ⌣∣⇒⌣∣K\mboxand⌣∣d.
Originally in [7], the notion of Kim-dividing is introduced over a model, using the notion of a Morley sequence in a global invariant extension of a type over the model. There it is shown that, over a model, that notion is equivalent to the one stated in Definition 3.1(3). Since in general even in a simple theory, there need not exist a global invariant extension of a type over a set, instead in [6] the above definition in (3) is coherently given as Kim-dividing over an arbitrary set.
As is well-known, in any simple T, ⌣∣ satisfies symmetry, full transitivity (that is: for any d and A⊆B⊆C, d⌣∣AB and d⌣∣BC iff d⌣∣AC), extension, local character, finite character, and
3-amalgamation of Lascar types. Moreover in such T, ⌣∣=⌣∣d=⌣∣K [10], and nonforking existence (that is: d⌣∣AA for any d and A) holds.
As we will not deal with these facts, see [2] or [11] for more details. Further advances are discovered in [7],[8],[6],[4] recently. Namely, it is shown that in any NSOP1 T having nonforking existence (as said any simple T, and all the known NSOP1 T have this), the notions of Kim-forking and Kim-dividing coincide, and ⌣∣K supplies a good independence notion since it satisfies all the aforementioned properties that hold of ⌣∣ in simple theories, except base monotonicity (so there can exist d and A⊆B⊆C such that d⌣∣AKC but d⌣∣BKC holds).
In this section we study TP2 in relation with Kim-forking. In particular we show that
if T has TP2 then there is a non-continuous Kim-forking chain of arbitrarily large length (Proposition 3.6),
by which we prove that T is supersimple iff there is no Kim-forking chain of length ω (Theorem 3.7).
We also show that in any T holding TP2, there is a type having arbitrarily large local weight
with respect to ⌣∣K (Proposition 3.8).
This section might be considered as an expository note, since all the results in this section are more or less straightforward consequences of known facts 3.3 and 3.5. In particular,
the referee of this paper points out to us that Proposition 3.6 follows from a result in [3].
Recall that a sequence ⟨Ai∣i<κ⟩ of sets is said to be
continuous if
for each limit δ<κ,
Aδ=⋃i<δAi.
There do not exist finite d and a continuous increasing sequence ⟨Mi∣i<∣T∣+⟩ of ∣T∣-sized models
such that
for each i<∣T∣+, d⌣∣MiKMi+1.
Indeed the following is implicitly shown in [9] using Fact 0.4. We supply a proof for completeness.
Fact 3.3**.**
If T has SOP1 then for each infinite cardinal κ, there exist a finite tuple d and a continuous increasing sequence ⟨Aα∣α<κ⟩ of sets
such that
for each α<κ, ∣Aα∣≤∣α∣⋅ω and d⌣∣AαKAα+1.
Proof.
Assume T has SOP1.
Given an infinite κ, by using compactness, there are a formula φ(x,y) and an indiscernible
sequence ⟨aibi∣i∈Z⋅κ⟩ satisfying Fact 0.4. Namely, ai≡(ab)<ibi for all i∈Z⋅κ,
{φ(x,ai)∣i∈Z⋅κ} is realized by say d, and
{φ(x,bi)∣i∈Z⋅κ} is 2-inconsistent (*).
Now for n<ω, let An={aibi∣i∈Z⋅(n+1)}, and for ω≤α<κ, let Aα={aibi∣i∈Z⋅α}. Then clearly ⟨Aα∣α∈κ⟩ is a continuous increasing sequence with ∣Aα∣≤ω⋅∣α∣. Moreover
for
each bi∈Aα+1∖Aα, the countable sequence Ibi(⊂Aα+1∖Aα) of successive bj’s starting from bi
is a finitely satisfiable indiscernible (so Morley) sequence in tp(bi/Aα). Thus by (),
φ(x,bi) Kim-divides over Aα. Then since ai≡Aαbi, again by ()
we have that d⌣∣AαKai. Note that ai∈Aα+1∖Aα.
Hence d⌣∣AαKAα+1 as wanted.
∎
Contrary to Fact 3.2(2), as in the following example, in NSOP1 T, there can exist a non-continuous increasing Kim-forking sequence of length ∣T∣+ of ≤∣T∣-sized sets, and arbitrary lengths continuous increasing Kim-forking sequences.
Example 3.4**.**
[4]
Let T be the theory of
the random parametrized equivalence relations, i.e., the the Fraïssé
limit of the class of finite models with two sorts (P,E) and a ternary relation
∼ on P×P×E such that, for each e∈E,
x∼ey forms an equivalence relation on P.
So in a model of T, there are two sorts P and E as described above.
Let d∈P. Given a cardinal κ, choose distinct
ei∈E, and di∈P (i<κ) such that d∼eidi, but dj∼ekdi for each j<i and
k≤i.
Let Di=((ed)<i)ei. Note that the sequence ⟨Di∣i<κ⟩ is increasing but not continuous (for example, D<ω⊊Dω). Notice further that d⌣∣DiKdi, so d⌣∣DiKDi+1 for each i<κ.
Moreover, there is a continuous increasing Kim-forking sequence of length
κ of κ-sets. We work with the same chosen elements above. Let C:={ei∣i<κ}⊂E, and let
Ci:=Cd<i. Clearly ⟨Ci∣i<κ⟩ is a continuous increasing sequence of κ-sets.
Now for each i<κ, it follows d⌣∣CiKdi, and hence d⌣∣CiKCi+1.
Now we can ask whether such phenomena happen in any non-simple NSOP1 T. We show that indeed in any theory with TP2, such sequences can be found.
The following fact is well-known and a proof can
be found for example in [13]. Recall that an array ⟨aij∣i<κ,j<λ⟩ is said to be indiscernible111In some literature this notion is called strongly indiscernible over A if for
Li:=⟨aij∣j<λ⟩, ⟨Li∣i<κ⟩ is A-indiscernible, and A-mutually indiscernible (i.e.,
each Li is indiscernible over ⋃{Lj∣j(=i)<κ}A).
Fact 3.5**.**
The following are equivalent.
(1)
φ(x,y)* has TP2.*
2. (2)
Let κ be an infinite cardinal. There is an indiscernible array ⟨aij∣i<κ,j<ω+ω⟩ such that
(a)
for each i<κ, {φ(x,aij)∣j<ω+ω} is 2-inconsistent, and
2. (b)
for any f:κ→ω+ω, {φ(x,aif(i))∣i<κ} is consistent.
Proposition 3.6**.**
Assume T has TP2. Let κ be an infinite cardinal.
(1)
There are a finite tuple d and an increasing non-continuous sequence of sets Ai(i<κ) of size ∣i∣⋅ω(<κ) such that d⌣∣AiKAi+1 for each i<κ. In particular there is an increasing countable sequence of countable sets Bi such that d⌣∣BiKBi+1 for each i<ω.
2. (2)
There are a finite tuple d and an increasing continuous sequence of sets Ei(i<κ) of size κ such that d⌣∣EiKEi+1 for each i<κ.
Proof.
(1) Due to Fact 3.5 and compactness, there are a formula φ(x,y) and an array ⟨aij∣i<κ,j∈ω+ω∗⟩
where ω∗:={i∗∣i∈ω} with the reversed order of ω (so for i∗,j∗∈ω∗, we have n<i∗ for all n∈ω, and j∗<i∗ if i<j) such that
(a)
for each i<κ, {φ(x,aij)∣j∈ω+ω∗} is 2-inconsistent,
2. (b)
for any f:κ→ω+ω∗, {φ(x,aif(i))∣i<κ} is consistent, and
3. (c)
the array is mutually indiscernible, i.e., for any i<κ,
Li:=⟨aij∣j∈ω+ω∗⟩ is indiscernible over ⋃{Lj∣j(=i)<κ}.
For each i∈κ, we let Ii:=⟨aij∣j<ω⟩, and let Ji:=⟨aij∗∣j<ω⟩ where aij∗=aij∗ with j∗∈ω∗, so as a set Li=Ii∪Ji.
Now due to (b), there is d⊨{φ(x,ai0∗)∣i<κ}. Put
Ai={Ik∣k≤i}∪{ak0∗∣k<i}. Then ∣Ai∣=∣i∣⋅ω. Now by (c), Ji is finitely satisfiable, so Morley over Ai. Hence, by (a) we have
[TABLE]
for each i<κ. Notice that the sequence ⟨Ai∣i<κ⟩ is not continuous, for example A<ω=Aω∖Iω⊊Aω.
For the second statement of (1), simply put Bi=Ai for i<ω.
(2) We keep use the same d in (1). Let E:=I<κ, and for i<κ let
Ei:=E∪{ak0∗∣k<i}. Now due to (c) again, for i∈κ,
Ji is Morley over Ei.
Therefore we have
[TABLE]
as wanted. Note that clearly ⟨Ei∣i<κ⟩ is a continuous increasing sequence with each ∣Ei∣=κ.
∎
As said before Fact 3.2, the referee of this paper points out that Proposition 3.6 directly follows from
the proof of Lemma 4.7 in [3] as well. Thus the above proof might be considered as the one describing
the proposition as a straightforward consequence of Fact 3.5.
Now we recall that T is supersimple if for any finite a, and a set A, there is a finite subset A0 of A such that
a⌣∣A0A. As is well-known T is supersimple iff there does not exist a countably infinite forking chain (see for example, [11]). The following theorem says that the same holds with a countably infinite Kim-forking chain.
Theorem 3.7**.**
The following are equivalent.
(1)
T* is supersimple.*
2. (2)
There do not exist finite d and an increasing sequence
of sets Ai (i<ω) such that d⌣∣AiKAi+1 for each i<ω.
3. (3)
There do not exist finite d and an increasing sequence
of countable sets Ai (i<ω) such that d⌣∣AiKAi+1 for each i<ω.
Proof.
(1)⇒(2) is well-known as said before this theorem, and (2)⇒(3) is obvious.
(3)⇒(1) We prove this contrapositively. Suppose T is not supersimple. If T is simple, then since ⌣∣=⌣∣K,
again it is well-known that there exist such a tuple and a sequence described in (3). If T is NSOP1 but not simple, then T has TP2 and Proposition 3.6 says there are such a tuple and a sequence.
If T has SOP1 then the existence of such a tuple and a sequence is guaranteed in Fact 3.3.
∎
As pointed out in [8], T is NSOP1 iff there do not exist
tuples ai (i<ω), a model M, and an L-formula φ(x,y)
such that for each i<ω,
ai≡Ma0, ai⌣∣MKa<i,
φ(x,ai) Kim-divides over M, and {φ(x,ai)∣i<ω} is consistent. However only a slightly weaker condition always holds in any T having TP2.
Proposition 3.8**.**
Assume φ(x,y) has TP2. Then for each infinite κ, there are a set A with ∣A∣≤κ, and finite tuples d, ci (i<κ)
such that
(1)
d⊨φ(x,ci),
2. (2)
φ(x,ci)* Kim-divides over A (so
d⌣∣AKci) witnessed by a Morley sequence (ci∈)Ji over A
with Ji≡J0 (so ci≡c0), and*
3. (3)
As in the proof of Proposition 3.6, there is an indiscernible array ⟨aij∣i<κ,j∈ω+ω∗⟩
such that
(a)
for each i<κ, {φ(x,aij)∣j∈ω+ω∗} is 2-inconsistent,
2. (b)
for any f:κ→ω+ω∗, {φ(x,aif(i))∣i<κ} is consistent, and
3. (c)
for any i<κ,
Li=⟨aij∣j∈ω+ω∗⟩ is indiscernible over ⋃{Lj∣j<κ,j=i}.
Again for each i∈κ, let Ii=⟨aij∣j<ω}, and Ji=⟨aij∗∣j<ω⟩ where aij∗=aij∗ with j∗∈ω∗. We further let ci:=ai0∗. Now by (b), there is
d⊨{φ(x,ci)∣i<κ}.
We now put A:=I<κ, so ∣A∣=κ. Now due to (c), each Ji is a Morley sequence over A , and
tp(ci/A{ck∣k<κ,k=i}) is finitely satisfiable in A. Hence (3) follows, and (2) follows as well due to (a).
∎
Bibliography18
The reference list from the paper itself. Each links out to its DOI / PubMed record.
1[1] Enrique Casanovas. The number of types in simple theories. Annals of Pure and Applied Logic 98 (1999), 69-86.
2[2] Enrique Casanovas. Simple theories and hyperimaginaries . Cambridge University Press, Cambridge, 2011.
3[3] Artem Chernikov. Theories without the tree property of the second kind. Annals of Pure and Applied Logic 165 (2014), 695-723.
4[4] Artem Chernikov, Byunghan Kim, and Nicholas Ramsey. Transitivity, lowness, and ranks in NSOP 1 theories. Preprint.
5[5] Artem Chernikov and Nicholas Ramsey. On model-theoretic tree properties. Journal of Mathematical Logic 16 (2016).
6[6] Jan Dobrowolski, Byunghan Kim, and Nicholas Ramsey. Independence over arbitrary sets in NSOP 1 theories. Preprint.
7[7] Itay Kaplan and Nicholas Ramsey. On Kim-independence. To appear in Journal of European Mathematical Society .
8[8] Itay Kaplan and Nicholas Ramsey. Transitivity of Kim-independence. https://arxiv.org/abs/1901.07026.