Mekler’s construction and tree properties
JinHoo Ahn
Department of Mathematics Yonsei University 50 Yonsei-Ro Seodaemun-Gu, Seoul 03722, South Korea
[email protected]
Abstract.
Mekler developed a way to produce a pure group from any given structure where the construction preserves κ-stability for any cardinal κ. Not only the stability, it is known that his construction preserves various model-theoretic properties such as simplicity, NIP, and NTP2. Inspired by the last result, we show that the construction also preserves NTP1(NSOP2) and NSOP1. As a corollary, we obtain that if there is a theory of finite language which is non-simple NSOP1, or which is NSOP2 but has SOP1, then there is a pure group theory with the same properties, respectively.
The author was supported by Samsung Science Technology Foundation under Project Number SSTF-BA1301-03, and has been supported by an NRF of Korea grant 2018R1D1A1A02085584
Keywords— NTP1, NSOP1, tree indiscerniblility, Mekler’s construction
1. Introduction
Suppose a structure M of finite language has more than one element, then there is a graph N which is bi-interpretable with M [6, Thm 5.5.1].
This implies if M has a model-theoretic property like stability and simplicity, then one can find a graph which has the same properties of M.
Unlike the graph, it is not easy to see whether there is a group which preserves a model-theoretic property of M.
A partial answer to this problem was found by Mekler. In [9], he constructed a group G where Th(G) has the same stability spectrum as Th(M).
This group is not bi-interpretable with M, however, so it does not preserve all the properties of M. For example, even though M is ℵ0-categorical, the group G may not be.
Later, it is proved that many other properties related with Shelah’s classification program are preserved by Mekler’s construction.
Baudisch and Pentzel proved that simplicity is preserved by the construction, and assuming stability, Baudisch proved that CM-triviality is also preserved [1].
Recently, Chernikov and Hempel proved that the construction preserves NIP, k-dependence, and NTP2 [3].
Thus, it is natural to expect that the construction preserves NSOP1 and other non-simple theories [3, Conjecture 1].
In this paper we show that the conjecture is true for the following tree properties; NTP1(NSOP2) and NSOP1.
To prove them, we analogously follow the argument used in the proof of preservation of NTP2 in [3].
The difference is that parameters witnessing TP2 formula is an array, not a tree. Hence, we find an appropriate generalized indiscernibility for each properties substituting the role of mutual indiscernibility.
We use one of the tree indiscernibility, called strong indiscernibility (see Definition 2.4) [8, 12].
SOP1 formula also have parameters of a tree, but the strong indiscernibility is not much helpful.
We recall [7, Proposition 2.4], the equivalent conditions of NSOP1, to obtain parameters of array ω×2 called SOP1-array (see Definition 3.10).
We preview the corollaries of the main results.
Corollary 1.1**.**
- (1)
There is a non-simple NSOP1* pure group theory.*
2. (2)
If there is an NSOP2* theory which has SOP1, then there is a pure group theory with the same properties.*
The first one is obtain by the preservation of simplicity and NSOP1.
Any example of non-simple NSOP1 theory on finite language can be transformed into a pure group by the construction.
Similarly, any NSOP2 theory with SOP1 on finite language can be transformed into a pure group.
Thus, NSOP1 and NSOP2 are equivalent if and only if they are equivalent on the pure group theories.
The paper is organized as follows.
In section 2, we introduce the notions about strong indiscerniblility on trees from [8] and [12].
In section 3, using strong indiscernibility, we find equivalent conditions of NTP1. And then, we define an SOP1-array and find equivalent conditions of NSOP1.
In section 4, we describe and summarize definitions and facts of Mekler’s construction following by [6] and [3].
In section 5, we first observe some combinatorial remarks on trees in [5], then show our main results that Mekler’s construction preserves NTP1 and NSOP1.
2. Tree indiscernibility
Consider a tree <λκ of height λ which has κ many branches. Each element in the tree can be regarded as a string. We denote ⟨⟩ as an empty string, 0α as a string of α many zeros, and α as a string ⟨α⟩ of length one.
Definition 2.1**.**
Fix a tree <λκ, and let η,ν,ξ∈<λκ.
- (1)
(Ordering) η⊲ν if ν⌈α=η for some ordinal α∈ dom(ν).
2. (2)
(Meet) ξ=η∧ν if ξ is the meet of η and ν, i.e., ξ=η⌈β, when β=⋃{α≤ dom(η)∩dom(ν)∣η⌈α=ν⌈α}. For ηˉ∈<λκ, νˉ is the meet closure of ηˉ if νˉ={η1∧η2∣η1,η2∈ηˉ}.
3. (3)
(Incomparability) η⊥ν if they are ⊴-incomparable, i.e., ¬(η⊴ν) and ¬(ν⊴η).
4. (4)
(Lexicographic order) η<lexν if
η⊲ν, or
η⊥ν and ∃α(η⌈α=ν⌈αandη(α)<ν(α)).
Definition 2.2**.**
A strong language L0 is defined by the collection {⊲,∧,<lex}
We may view the tree <λκ as an L0-structure.
Definition 2.3**.**
A tree B=<λ′κ′ is called a subtree of A=<λκ if B⊆A and the inclusion map is an embedding in the language {⊴,<lex}.
Fix a complete first order theory T(with language L). Let M⊨T be a monster model. From now on, we will work in this M.
Definition 2.4**.**
[8]
Fix a structure I with language LI. For a set {bi∣i∈I}, we say it is I-indexed indiscernible if for any finite iˉ and jˉ from I,
qftp(iˉ)I = qftp(jˉ)I ⇒ (bi)i∈iˉ≡(bj)j∈jˉ.
I is called the index structure. In particular, we say a set {bη∣η∈<λκ} is strongly indiscernible if it is I-indexed indiscernible for I the L0-structure on <λκ.
Remark 2.5**.**
Let {aη∣η∈<λκ} be a strongly indiscernible tree.
- (1)
For all ν1,ν2∈λκ, (aν1⌈α)α<λ≡(aν2⌈α)α<λ
2. (2)
For all η1ˉ,η2ˉ∈<λκ, if νiˉ is the meet-closure of ηiˉ for each i=1,2, then qftp(η1ˉ) = qftp(η2ˉ) implies qftp(ν1ˉ) = qftp(ν2ˉ)
3. (3)
For all η⊥ν∈<λκ, and ξ∈<λκ, η<lexν⇒aηaν≡aξ⌢0aξ⌢0
4. (4)
For any η∈<λκ, the tree (a0⌢η)η∈<λκ is strongly indiscernible over (aν1⌈α)α∈dom(η)
Proof.
See [4] and [8].
∎
Definition 2.6**.**
[8]
Let I be an index structure.
- (1)
The EM-type of a set of parameters A={ai∣i∈I}, EMI(A), is the collection of formulas φ(xi1,…,xin) in L with variables {xi∣i∈I} such that for all j1,…,jn∈I, if j1…jn≡qfi1…in, then ⊨φ(aj1,…,ajn).
2. (2)
A set B={bη∣η∈I} is based on a set A={aν∣ν∈I} if for all η1,…,ηn∈I and for all φ(xη1,…,xηn) in L, there exists some ν1,⋯,νn∈I such that
ν1…νn≡Iqfη1…ηn, and
bη1…bηn≡φaν1…aνn
In particular, when I is L0-structure <λκ, we say B is strongly based on A whenever B is based on A.
Remark 2.7**.**
Let B={bη∣η∈I} and A={aν∣ν∈I}. Then B is based on A if and only if B⊨EMI(A).
Definition 2.8**.**
For an index structure I, we say I-indexed indiscernibles have the modeling property if given any A={aν∣ν∈I}, there is an I-indexed indiscernible B={bη∣η∈I} such that B is based on A(or equivalently, B⊨EMI(A)).
Fact 2.9**.**
[12]
Let <ωω be the universe of the index structure. The strong indiscernibles have the modeling property.
As a corollary, we may assume the index structure as <λκ where both λ and κ are infinite cardinals.
3. Tree properties
Definition 3.1**.**
We say a subset {ηi∣i<k}⊆<λκ is a collection of k distant siblings if given i1=i2 and j1=j2, all of which are less than k, ηi1∧ηi2=ηj1∧ηj2.
We may extend the result in Proposition 2.5(3).
Remark 3.2**.**
Let {aη∣η∈<λκ} be a strongly indiscernible tree. For any collection of distant siblings {ηi∣i<k}⊆<λκ and for any ξ∈<λκ, if ηi<lexηj for each i<j<k then aη0⋯aηk−1≡aξ⌢0⋯aξ⌢k−1
Definition 3.3**.**
[5, 8, 12]
Fix k≥2.
- (1)
φ(x;y) has SOP1 if there is a (aη∣η∈<ω2) such that
For all η∈ω2, {φ(x;aη⌈α)∣α<ω} is consistent,
For all ξ,ν∈<ω2, if ξ⌢0⊴ν, then {φ(x;aξ⌢1),φ(x;aν)} is inconsistent.
2. (2)
φ(x;y) has SOP2 if there is a (aη∣η∈<ω2) such that
For all η∈ω2, {φ(x;aη⌈α)∣α<ω} is consistent,
For all ξ,ν∈<ω2, if ξ⊥ν, then {φ(x;aξ),φ(x;aν)} is inconsistent.
3. (3)
φ(x;y) has the tree property of the first kind (TP1) if there is (aη∣η∈<ωω) such that
For all η∈ωω, {φ(x;aν⌈α)∣α<ω} is consistent,
For all η⊥ν∈<ωω, {φ(x;aη),φ(x;aν)} is inconsistent.
4. (4)
φ(x;y) has weak k-TP1 if there is (aη∣η∈<ωω) such that
For all η∈ωω, {φ(x;aν⌈α)∣α<ω} is consistent,
For any collection of distant siblings {ηi∣i<k}, {φ(x;aηi)∣i<k} is inconsistent.
5. (5)
We say T has TP1 (resp. SOP1, SOP2) if there is a formula having TP1 (resp. SOP1, SOP2). If not, we say T is NTP1 (resp. NSOP1, NSOP2). We say T has weak-TP1 if there is a formula having k-TP1 for some k.
Fact 3.4**.**
[4]
- (1)
φ(x;y) has TP1 if and only if there is a strongly indiscernible tree (aη∣η∈<ωω) such that
- (a)
{φ(x,aη⌈α)∣α<ω} is consistent for some η∈ωω.
2. (b)
{φ(x,aν⌢i)∣i<ω} is pairwise inconsistent for some ν∈<ωω.
2. (2)
T has weak-TP1 if and only if T has TP1.
Remark 3.5**.**
φ(x;y) has weak-TP1 if and only if there is a strongly indiscernible tree (aη∣η∈<ωω) such that
- (a)
{φ(x,a0i)∣i<ω} is consistent.
2. (b)
{φ(x,aν⌢i)∣i<ω} is k-inconsistent for some ν∈<ωω and k≥2.
To prove the main theorem, we first establish the characterization of given model theoretic property. For example, in [3], Chernikov and Hempel stated the following proposition cited from [2];
Fact 3.6**.**
Let T be a theory and M⊨T a monster model. Let κ:=∣T∣+. The following are equivalent:
- (1)
T is NTP2.
2. (2)
for any array (ai,j:i∈κ,j∈ω) of finite tuples with mutually indiscernible rows and a finite tuple b, there is some α∈κ satisfying the following:
for any i>α, there is some b′ such that
- (a)
(ai,j∣j<ω) is indiscernible over b′, and
2. (b)
tp(b/ai,0)=tp(b′/ai,0).
The basic idea of 3.6 is to find an indiscernible sequence over some b′ which has the same type with given b over some element in that sequence. The trick in the proof can be seen on [10, Lemma 1.4], too. We apply the same trick on NTP1 with the notions of strong indiscernibility.
Proposition 3.7**.**
Let κ>2∣T∣ be some sufficiently large regular cardinal. Then TFAE.
- (1)
T* is NTP*1**
2. (2)
For any strongly indiscernible tree (aη∣η∈<κκ) of finite tuples and a finite tuple b, there is some β<κ and b′ such that
- (a)
(a0β⌢i∣i<ω)* is indiscernible over b′, and*
2. (b)
tp(b/a0β⌢0)* = tp*(b′/a0β⌢0),
3. (3)
For any strongly indiscernible tree (aη∣η∈<κκ) of finite tuples and a finite tuple b, there is some γ<κ satisfying the following:
for any β>γ, there is some b′ such that
- (a)
(a0β⌢i∣i<ω)* is indiscernible over b′, and*
2. (b)
tp(b/a0β⌢0)* = tp*(b′/a0β⌢0).
Proof.
(1) ⇒ (2). Assume T is NTP1, and let A=(aη∣η∈<κκ) and b be given.
By pigeonhole principle, there is a subsequence (αi∣i<ω) in the set of successor ordinals smaller than κ such that for all i<j<ω, αi+<αj<κ and tp(a0αi/b) = tp(a0αj/b). We inductively define a subtree (aη′∣η∈<ωω) in A as follows;
a⟨⟩′=a0α0,
for any η∈<ωω, if aη′=aρ for some ρ∈<κκ with Dom(ρ)=αi, then for each j<ω, aη⌢j′=aρ′⌢j where ρ′=ρ⌢0δ for some δ so that Dom(ρ′⌢j)=αi+1.
Note that (a0i′∣i<ω) is a subsequence of (a0α∣α<κ), and for any η,ν∈<ωω, if aη′=aη′, aν′=aν′, aη∧ν′=aξ for η′,ν′, and ξ∈<κκ, then ξ=η′∧ν′. Moreover, the subtree is strongly indiscernible, too.
Let p(x,a0′) := tp(b/a0′) and q(x) := ⋃i<ωp(x,ai′). We claim that q is consistent.
Suppose not. Then by compactness and strong indiscernibility, there is a formula φ(x,y) such that φ(x,a0′)∈p(x,a0′) and {φ(x,ai′)∣i<ω} is k-inconsistent for some k<ω.
On the other hand, b realizes ⋃i<ωp(x,a0i′), so it realizes {φ(x,a0i′)∣i<ω}.
As a result, φ has weak k-TP1, and fact 3.4 further says that T has TP1.
By claim, we can find a realization b′⊨q(x).
We may assume (ai′∣i<ω) is indiscernible over b′ by Ramsey and compactness. Note that tp(b/a0′) = tp(b′/a0′) since b′⊨p(x,a0′). Thus, if ai′=a0β⌢i for some β, then this β and b′ is the desired one.
(2) ⇒ (3). Assume (2) holds. For a strongly indiscernible tree (aη∣η∈<κκ) and a finite tuple b, we will say Q(β) holds on (aη∣η∈<κκ) and b when there is a b′ such that (a0β⌢i∣i<ω) is indiscernible over b′, and tp(b/a0β⌢0) = tp(b′/a0β⌢0).
Suppose there is a strongly indiscernible tree (aη∣η∈<κκ) and a finite tuple b such that for any γ<κ, there is a β>γ which does not satisfy Q. Then, since cf(κ)=κ, we can find a cofinal map f:κ→κ such that for any i,j<κ, 1<f(i)+<f(j), and f(i) does not satisfy Q.
Now, construct the following map g:<κκ→<κκ . First, if η=⟨⟩, then g(η)=⟨⟩ For other non-empty string η∈<κκ, Dom(g(η))= Sup{f(l)+∣l∈Dom(η)}, and for each i<Dom(g(η)),
(g(η))(i)={η(j)0if i=f(j)+ for some j<κ,otherwise.
Then we define aη′=ag(η). The subtree (aη′∣η∈<κκ) is strongly indiscernible, and for each β<κ, Q(β) does not hold on (aη′∣η∈<κκ) and b. This contradicts to (2).
(3) ⇒ (1). Assume (3) holds. Suppose T has TP1 witnessed by φ(x;y) and (aη∣η∈<κκ).
We may assume the tree (aη∣η∈<κκ) is strongly indiscernible by the modeling property.
Note (a) and (b) in 3.3(3) still hold. Take b⊨{φ(x,a0α)∣α<κ}. By the assumption, we have some ordinals γ<β<κ and b′ such that
- (a)
(a0β⌢i∣i<ω) is indiscernible over b′, and
2. (b)
tp(b/a0β⌢0) = tp(b′/a0β⌢0).
Choose an automorphism σ where it fixes a0β⌢0 and sends b′ to b. Denote (ai′∣i<ω) to (σ(a0β⌢i)∣i<ω), then it is indiscernible over b. Since a0′ is as same as a0β⌢0,
b⊨φ(x,a0′), and then the indiscernibility implies that for all i<ω, b⊨φ(x,ai′). But this is a contradiction because {φ(x,ai′)∣i<ω} is 2-inconsistent, as well as {φ(x,a0β⌢i)∣i<ω} is.
∎
Analogously, We find a lemma for SOP1. Unlike the case of TP1, we cannot use the strong indiscernibility.
For instance, let A be a tree which has the inconsistency condition of SOP1 and let B be a strong indiscernible tree based on A.
There is no guarantee that B has the inconsistency condition.
Hence, we need another indiscernibility which matches up to SOP1.
To find this, we recall results in [4] and [7].
Fact 3.8**.**
[4]
Suppose φ(x;y) with the tree (cη∣η∈<κ2) have SOP1 where κ≥2∣T∣. Then there is a sequence (ηi,νi)i<ω of elements of <κ2 such that
- (1)
cηi≡cη<icν<icνi for all i<ω,
2. (2)
{φ(x;cηi)∣i<ω} is consistent, and
3. (3)
{φ(x,cνi)∣i<ω} is 2-inconsistent.
Kaplan and Ramsey [7] proved more general result about SOP1.
Fact 3.9**.**
The following are equivalent;
- (1)
T has SOP1.
2. (2)
There is a formula φ and an array (ci,j)i<ω,j<2 so that
- (a)
ci.0≡c<i,0c<i,1ci,1 for all i<ω
2. (b)
{φ(x;ci,0)∣i<ω} is consistent
3. (c)
{φ(x,ci,1)∣i<ω} is 2-inconsistent.
3. (3)
There is a formula φ and an array (ci,j)i<ω,j<2 so that
- (a)
ci.0≡c<i,0c<i,1ci,1 for all i<ω
2. (b)
{φ(x;ci,0)∣i<ω} is consistent
3. (c)
{φ(x,ci,1)∣i<ω} is k-inconsistent for some k≥2.
From these facts, we derive a new kind of indiscernibility.
Definition 3.10**.**
We say (ci,j)i<ω,j<2 is an SOP1-array indiscernible over A if
- (1)
(ci,0ci,1)i<ω is an (order) indiscernible sequence over A, and
2. (2)
ci.0≡Ac<i,0c<i,1ci,1 for all i<ω.
Note that we may replace the array in 3.9 to an indiscernible SOP1-array .
Remark 3.11**.**
Let an indiscernible SOP1-array (ci,j)i<ω,j<2 be given.
- (1)
For any κ>ω, there is a indiscernible SOP1-array (ci,j′)i<κ,j<2 such that ci,j=ci,j′ for all i<ω and j<2.
2. (2)
For any n<ω, (ci,j)n≤i<ω,j<2 is an SOP1-array indiscernible over {ci,j∣i<n,j<2}.
Proposition 3.12**.**
Let κ>2∣T∣ be some sufficiently large regular cardinal. Then TFAE.
- (1)
T* is NSOP*1**
2. (2)
For any indiscernible SOP1*-array (ai,j)i<κ,j<2 of finite tuples and a finite tuple b, there is some β<κ and some b′ such that*
- (a)
tp(b,aβ,0)* = tp*(b′,a0,1),
2. (b)
(ai,1∣i<ω)* is indiscernible over b′.*
3. (3)
For any indiscernible SOP1*-array (ai,j)i<κ,j<2 of finite tuples and a finite tuple b, there is some γ<κ satisfying the following:*
for any number β>γ, there is some b′ such that
- (a)
tp(b,aβ,0)* = tp*(b′,a0,1),
2. (b)
(ai,1∣i<ω)* is indiscernible over b′.*
Proof.
(1) ⇒ (2). Assume T is NSOP1, and let (ai,j)i<κ,j<2 and b in (2) be given.
Using the pigeonhole principle, take an indiscernible SOP1-subarray (ai,0′ai,1′)i<ω in (ai,0ai,1)i<κ where tp(ai,0′/b)=tp(aj,0′/b) for all i,j<ω.
Now let p(x,y)= tp(b,a0,0′), and q(x)=⋃i<ωp(x,ai,1′). We claim that q is consistent.
Suppose not. Then by indiscernibility and compactness, there is a formula φ(x,y) in p(x,y) such that {φ(x,ai,1′)∣i<ω} is k-inconsistent for some natural number k.
On the other hand, since φ(x,ai,0′) is in tp(b/ai,0′) for each i<ω, {φ(x,ai,0′)∣i<ω} is consistent.
Hence φ has SOP1 by Fact 3.9, which is a contradiction.
Let yˉ=(yi)i<ω where for each i<ω, ∣yi∣=∣ai,1′∣, and let Π(x,yˉ) be the union of ⋃i<ωp(x,yi), Φ(yˉ), and Ψ(x,yˉ) where Φ(yˉ)=tp((ai,1′)i<ω) and Ψ(x,yˉ) means that (yi)i<ω is indiscernible over x.
By Ramsey and compactness, Π(x,yˉ) is consistent. Let (b′′,(ai,1′′)i<ω) be a realization of Π(x,yˉ).
Since Φ(yˉ)=tp((ai,1′)i<ω)=tp((ai,1)i<ω), we have (ai,1∣i<ω) is indiscernible over some b′ where tp(b′,a0,1) = tp(b′′,a0,1′′)=p(x,y0) = tp(b,a0,0′).
Note a0,0′=aβ,0 for some β<κ.
(2) ⇒ (3). For an indiscernible SOP1-array (ai,j)i<κ,j<2 and a finite tuple b, we will say Q(β) holds on (ai,j)i<κ,j<2 and b when there is a b′ such that tp(b/aβ,0) = tp(b′/a0,1), and (ai,1∣i<ω) is indiscernible over b′.
Assume (2) holds but (3) does not hold, that is, there is an indiscernible SOP1-array (ai,j)i<κ,j<2 and a tuple b such that for any γ<κ, there is some β>γ which does not satisfy Q.
From this and cf(κ)=κ, we choose an increasing sequence (βi)i<κ of ordinal numbers such that for each βi, Q does not hold.
Now take a subarray (aβi,0aβi,1)i<κ in (ai,0ai,1)i<κ.
This array is still indiscernible, so by (2), there is some j<κ and some b′ such that tp(b,aβj,0) = tp(b′,aβ0,1), and (aβi,1∣i<ω) is indiscernible over b′.
Since tp((aβi,1)i<ω)=tp((ai,1)i<ω) by indiscernibility, we may assume that there is some j<κ and some b′ such that tp(b,aβj,0) = tp(b′,a0,1), and (ai,1∣i<ω) is indiscernible over b′. This contradicts that Q(βj) does not hold.
(3) ⇒ (1). Assume (3) holds. Suppose T has SOP1.
By fact3.9(2) and compactness, we have a formula φ(x;y) which witnesses SOP1 with an indiscernible SOP1-array (ai,j)i<κ,j<2.
Let b be a realization of ⋀i<κφ(x,ai,0). By assumption, there is some ordinals γ<β<κ and some b′ such that
- (a)
tp(b,aβ,0) = tp(b′,a0,1),
2. (b)
(ai,1∣i<ω) is indiscernible over b′.
From (a), we have ⊨φ(b′,a0,1), and then from (b), we have ⊨φ(b′,a1,1). This contradicts that {φ(x,ai,1)∣i<κ} is 2-inconsistent.
∎
4. Mekler’s construction
We recall the definitions and facts from [6].
For a graph A and its vertices a and b, we say R(a,b) if a and b are connected by a single edge in A.
Definition 4.1**.**
A graph A which has at least two vertices is called nice if
- (a)
For any two distinct vertices a and b, there is some vertex c=a,b such that R(a,c) but ¬R(b,c);
2. (b)
There are no triangles nor squares.
Definition 4.2**.**
[1, 9]
Fix an odd prime p. For a nice graph A, let F(A) be the free nilpotent group of class 2 and exponent p generated freely by the vertices of A. Assume that A is enumerated with some relation < not in the original language. Then the Mekler group of A, denoted by G(A), is defined as follows;
G(A)=F(A)/⟨{[a,b]∣a,b∈A,a<b,and A⊨R(a,b)}⟩.
In other words, G(A) is a group defined in the variety of nilpotent groups of class 2 and exponent p such that the generators are the vertices of A and that for any a and b in G(A), [a,b]=1 if and only if a<b and A⊨R(a,b).
We can see the definition in the point of view of vector spaces. Let Z(F(A)) be the center of F(A). Then both Z(F(A)) and F(A)/Z(F(A)) are all elementary abelian p-groups so they can be considered as a Fp-vector space with basis {[a,b]∣a,b∈A,a<b} and {a/Z(F(A))∣a∈A} respectively.
The same is true for the Mekler group G(A). If Z(G(A)) is the center of G(A), then both Z(G(A)) and G(A)/Z(G(A)) can be considered as a Fp-vector space. The basis of Z(G(A)) is {[a,b]∣a,b∈A,a<b, and A⊨¬R(a,b)}, and the basis of G(A)/Z(G(A)) is {a/Z(F(A))∣a∈A}.
Definition 4.3**.**
For any element g,h of G(A), we say
- (1)
g∼h if C(g)=C(h), where C(g) is the centraliser of g in G(A),
2. (2)
g≈h if for some c in the center Z(G) and some r (0≤r<p), h=gr⋅c,
3. (3)
g≡Zh if g⋅Z(G)=h⋅Z(G).
Remark 4.4**.**
For any element g,h of G(A), g≡Zh⇒g≈h⇒g∼h.
Definition 4.5**.**
Let g be an element in G(A).
- (1)
g is isolated if every non-central element of G(A) which commutes with g is ≈-equivalent to g.
2. (2)
We say an element g is of type q if q is the number of ≈-classes in the ∼-class of g.
3. (3)
We say g is of type qι (resp. qν) if g is of type q and isolated (resp. of type q and not isolated).
Definition 4.6**.**
For every element g of type p, we say an element b is a handle of g if it is of type 1ν and commutes with g.
As a remark, we note that for any g of type p, the handle of g exists and is unique up to ∼-equivalence.
Fact 4.7**.**
Every non-central element of G(A) is of exactly one of the four type 1ν,1ι,p−1,p; the classes of elements of each type are 0-definable.
Now, let G be a model of Th(G(A)). Let us say an element of G is proper if it is not a product of any elements of type 1ν in G.
Definition 4.8**.**
- (1)
A 1ν-transversal of G, denoted by Xν, is a set consisting of one representative for each ∼-class of elements of type 1ν in G.
2. (2)
A p-transversal of G, denoted by Xp, is a set of pairwise ∼-inequivalent proper elements of type p in G which is maximal with the property that if Y is a finite subset of Xp and all elements of Y have the same handle, then Y is a independent modulo the subgroup generated by all elements of type 1ν in G and Z(G).
3. (3)
A 1ι-transversal of G, denoted by Xι, is a set of representatives of ∼-classes of proper elements of type 1ι in G shich is maximal independent modulo the subgroup generated by all elements of types 1ι and p in G, together with Z(G).
4. (4)
A subset X of G is called a transversal of G if it is the union of some 1ν-transversal Xν, A p-transversal Xp, and 1ι-transversal Xι of G.
Note that all the sets in the above definition are definable.
Fact 4.9**.**
Let A be a nice graph. For a model G⊨ Th(G(A)), define an interpretation Γ such that Γ(G) is a graph where the set of vertices is {g∈G∣g is a noncentral element of type 1ν}/∼ and the edge relation is {([g]∼,[h]∼)∣[g,h]=1 in G}. Then Γ(G)⊨ Th(A).
From 4.9, we see that if Xν is a 1ν-transversal, then the set can be regarded as a graph which models Th(A).
Fact 4.10**.**
Let C be an infinite nice graph, and G⊨ Th(G(C)).
If X=Xν∪Xp∪Xι is a transversal of G, then there is a subgroup HX≤Z(G) such that G=⟨X⟩×HX for some HX≤Z(G). Moreover, if G is saturated and uncountable, then both Γ(G) and HX are also saturated.
Since HX is an elementary abelian p-group, we sometimes say G is isomorphic to ⟨X⟩×⟨HX⟩.
Fact 4.11**.**
Let G is a saturated model of Th(G(C)) and let κ=∣G∣. If X=Xν∪Xp∪Xι is a transversal of G, then
- (a)
for any xν∈Xν, the cardinality of {xp∈Xp∣xν is the handle of xp} is either zero or κ, and
2. (b)
∣Xι∣=κ
As we mentioned in 4.9, Xν can be regarded as a graph where two vertices are joined (connected by a single edge) if they commute in G.
In this point of view, we can find a supergraph by extending the set of vertices to X and then giving the edge relation with the same rule.
Then each xp∈Xp is joined to a unique vertex in Xν, which is the handle of xp, while each xι∈Xι is joined to no vertex.
This kind of supergraph is called a cover. See [3] for more precise proof.
We give more facts from [3].
Fact 4.12**.**
- (1)
Let G be a saturated model of Th(G(C)), and let X and HX be the sets in 4.10 so that G=⟨X⟩×HX. If f is a bijection between two small sets Y=Yν∪Yp∪Yι and Z=Zν∪Zp∪Zι of X with the following properties;
- (a)
f(Yν)=Zν, f(Yp)=Zp, and f(Yι)=Zι,
2. (b)
for any yp∈Yp, the handle of yp is same as the handle of f(yp),
3. (c)
tp(Yν)=tp(Zν) in Γ,
then f can be extended to an automorphism σ of G.
Moreover, for any hˉ, kˉ∈HX, if tp(hˉ)=tp(kˉ) in HX, then we may assume σ sends hˉ to kˉ.
2. (2)
Let G be a model of Th(G(C)), and xˉ=xˉν⌢xˉp⌢xˉι and yˉ be two small tuples of variables. Then there is a partial type π(xˉ,yˉ) such that G⊨π(aˉ,bˉ) if and only if we can extend aˉ to a transversal X of G and find H containing bˉ so that H is an independent set in Z(G) and G=⟨X⟩×⟨H⟩.
5. Preseervation
In [5], džamonja and Shelah introduced a way to choose a monochromatic subtree when the given tree <κ2 is colored by θ many colors where ∣θ∣<κ and κ is a regular cardinal. The following is the key observation.
Fact 5.1**.**
Let κ be a regular cardinal and let θ be a set of colors such that ∣θ∣<κ. For any coloring f:<κ2→θ, there is a color c∈θ and an element ν∗∈<κ2 such that for any ν∈<κ2 satisfying ν∗⊴ν, there is ρ∈<κ2 with ν⊴ρ, f(ρ)=c.
Let us say a subtree B⊆A is f-monochromatic if there is a color c such that for all b∈B, f(b)=c.
Lemma 5.2**.**
Let κ be an uncountable regular cardinal and f:<κ2→ω be a coloring.
- (1)
If φ(x;y) and (aη∣η∈<κ2) witness SOP2*, then there is a f-monochromatic subtree (aη′∣η∈<ω2) of (aη∣η∈<κ2) such that φ and (aη′∣η∈<ω2) witness SOP2.*
2. (2)
If φ(x;y) and (aη∣η∈<κ2) witness SOP1*, then there is a f-monochromatic subtree (aη′∣η∈<ω2) of (aη∣η∈<κ2) such that φ and (aη′∣η∈<ω2) witness SOP1.*
3. (3)
If φ(x;y) and (aη∣η∈<κκ) witness TP1*, then there is a f-monochromatic subtree (aη′∣η∈<ωω) of (aη∣η∈<κκ) such that φ and (aη′∣η∈<ωω) witness TP1.*
Proof.
(1) Let c and ν∗ be the element in Fact 5.1. We construct a subtree (aη′∣η∈<ω2) in (aη∣η∈<κ2) inductively as follows;
a⟨⟩′=aρ where ρ is any element satisfying ν∗⊴ρ and f(ρ)=c,
for any η∈<ω2, if aη′ = aρ for some ρ∈<κ2 , then aη⌢0′=aρ′ where ρ⌢0⊴ρ′ and f(ρ′)=c, and aη⌢1′=aρ′ where ρ⌢1⊴ρ′ and f(ρ′)=c.
φ and the subtree witness SOP2.
(2) We use a different version of the Fact 5.1 which has one more condition on ρ: ρ is of the form ξ⌢1 for some ξ.
This can be proved by the same way used in 5.1, so we omit the proof.
Define a⟨⟩′ as same as the previous one, but give a small modification in the induction step. For any η∈<ω2, let aη′ = aρ for some ρ∈<κ2.
Take aη⌢1′=aρ′ where ρ⊴ρ′, f(ρ′)=c and ρ′ is of the form ξ⌢1 for some ξ.
Then take aη⌢0′=aρ′′ where ξ⌢0⊴ρ′′ and f(ρ′′)=c. φ and the subtree witness SOP1, too.
(3) In (aη∣η∈<κκ), consider the subtree (aη∣η∈<κ2).
Find (aη′∣η∈<ω2) as in the proof of (1), and then construct (aη′′∣η∈<ωω) inductively as follows;
a⟨⟩′′=a⟨⟩′,
for any η∈<ωω, if aη′′=aρ for some ρ∈<ω2, then aη⌢i′′=aρ⌢1i⌢0′ for each i<ω.
φ and the last subtree witness TP1, too.
∎
Theorem 5.3**.**
For any infinite nice graph C, Th(G(C)) is NTP1 if and only if Th(C) is NTP1.
Proof.
Since C is interpretable in G(C), if Th(C) has TP1, then Th(G(C)) also has TP1.
Suppose Th(C) is NTP1 and Th(G(C)) has TP1. Let G be a monster model of Th(G(C)), X be a transversal of G so that G=⟨X⟩×⟨H⟩ for some H as in Fact 4.10.
We have a formula φ(x,y) and a tree (aη∣η∈<κκ) of finite tuples in G for some sufficiently large regular cardinals κ so that they witness TP1.
Note that for each η∈<κκ, aη is of the form tη(xˉη,hˉη) for some terms tη∈LG, and for some small tuples xˉη=xˉην⌢xˉηp⌢xˉηι∈X, and hˉη∈H.
By Lemma 5.2, we may assume tη=t∈LG, and ∣xˉην∣,∣xˉηp∣,∣xˉηι∣,∣hˉη∣ are constant for all η∈<ωω.
To obtain handle correspondence, add handles of elements in the tuple xˉηp to the beginning of xˉην for all η∈<ωω.
Taking φ′(x,y′):=φ(x,t(y′)) with ∣y′∣=∣xˉη⌢hˉη∣ and bˉη:=xˉη⌢hˉη, we have φ′∈LG and the tree (bˉη∣η∈<ωω) still satisfy TP1.
By modeling property of strong indiscernibility and compactness, we can find (cˉη∣η∈<κκ) with cˉη=yˉη⌢mˉη=yˉην⌢yˉηp⌢yˉηι⌢mˉη to be a strongly indiscernible tree where (cˉη∣η∈<ωω) based on (bˉη∣η∈<ωω).
Note φ′ and the tree still witness TP1. Also, by 4.12(2), we can assume each yˉη and mˉη are in some Y and M where Y is a transversal of G and M is an independent set in Z(G) and G=⟨Y⟩×⟨M⟩.
Let c be a realization of ⋀α<κφ′(x,cˉ0α).
Write c=s(y,m) for some terms s∈LG, and for some tuples y=yν⌢yp⌢yι∈Y, and m∈M.
Again, To obtain handle correspondence, add handles of elements in the tuple yp to the beginning of yν.
Take ψ(x′,y′)=φ′(s(x′),y′), then for all η⊥ν∈<κκ, {ψ(x′,cˉη),ψ(x′,cˉν)} is inconsistent and y⌢m realizes ⋀α<κψ(x′,cˉ0α). Since y⌢m∩⋃{cˉ0α∣α<κ} is finite, we may assume the tree is strongly indiscernible over y⌢m∩⋃{cˉ0α∣α<κ}.
Now, consider yν and the tree (yˉην∣η∈<κκ) in Yν.
Applying 4.9, we can regard the elements as vertices of a graph. This graph satisfies NTP1 theory Th(C), so there is some γ satisfying 3.7(2).
Then for each β+>γ, we have a tuple y′ν such that tpΓ(yν/yˉν0β⌢0)=tpΓ(y′ν/yˉν0β⌢0) and tpΓ(yˉν0β⌢0/y′ν)=tpΓ(yˉν0β⌢1/y′ν).
On the other hand, observe that Th(⟨M⟩) is a theory of vector spaces, so that the theory is stable and has quantifier elimination.
Then for tuple m and the tree (mˉη∣η∈<ωω) in ⟨M⟩, we can apply Corollary 3.7 to have some γ′ satisfying 3.7(2).
Fix a successor ordinal β+ larger then γ and γ′, and let y′ν and m′ be the tuples given by Corollary 3.7. Recall that the tree (yˉη⌢mˉη∣η∈<ωω) is strongly indiscernible over y⌢m∩⋃{cˉ0α∣α<ω}. So, as in [3, Theorem 5.6], we can find a handle preserving bijection which can be extended by Fact 4.12(1) to have
- (1)
tpG(ym/yˉ0β⌢0mˉ0β⌢0)=tpG(y′m′/yˉ0β⌢0mˉ0β⌢0), and
2. (2)
tpG(yˉ0β⌢0mˉ0β⌢0/y′m′)=tpG(yˉ0β⌢1mˉ0β⌢1/y′m′).
From these conditions, we have G⊨ψ(y′m′,yˉ0β⌢0mˉ0β⌢0)∧ψ(y′m′,yˉ0β⌢1mˉ0β⌢1), but this contradicts that for any η⊥ν∈<κκ, {ψ(x′,yˉηmˉη),ψ(x′,yˉνmˉν)} is inconsistent.
∎
Theorem 5.4**.**
For any infinite nice graph C, Th(G(C)) is NSOP1 if and only if Th(C) is NSOP1.
Proof.
Since C is interpretable in G(C), if Th(C) has SOP1, then Th(G(C)) also has SOP1.
Suppose Th(C) is NSOP1 and Th(G(C)) has SOP1. Again, we take G to be a monster model of Th(G(C)), X to be a transversal of G so that G=⟨X⟩×⟨H⟩ for some H as in Fact 4.10.
We have a formula φ(x,y) and a tree (aη∣η∈<κ2) of finite tuples in G for some sufficiently large regular cardinals κ.
Note that for each η∈<κ2, aη is of the form tη(xˉη,hˉη) for some terms tη∈LG, and for some small tuples xˉη=xˉην⌢xˉηp⌢xˉηι∈X, and hˉη∈H.
By Lemma 5.2, we may assume tη=t∈LG, and ∣xˉην∣,∣xˉηp∣,∣xˉηι∣,∣hˉη∣ are constant for all η∈<κ2.
To obtain handle correspondence, add handles of elements in the tuple xˉηp to the beginning of xˉην for all η∈<κ2.
Taking φ′(x,y′):=φ(x,t(y′)) with ∣y′∣=∣xˉη⌢hˉη∣ and aˉη′:=xˉη⌢hˉη, we have a formula φ′∈LG and the tree (aˉη′∣η∈<κ2) also witness SOP1.
By Fact 3.8, we can choose an array (bˉi,j)i<ω,j<2 in (aˉη′∣η∈<ωω) such that
- (1)
bˉi,0≡bˉ<i,0bˉ<i,1bˉi,1 for all i<ω,
2. (2)
{φ′(x;bˉi,0)∣i<ω} is consistent, and
3. (3)
{φ′(x,bˉi,1)∣i<ω} is 2-inconsistent.
Consider an indiscernible sequence (cˉi,0cˉi,1)i<κ realizing EM((bˉi,0bˉi,1)i<ω).
The new array (cˉi,j)i<κ,j<2 is an indiscernible SOP1-array and satisfies aforementioned conditions.
Also, cˉi,j is of the form yˉi,j⌢mˉi,j and there are some Y and M such that Y is a transversal of G extended from {yˉi,j∣i<κ,j<2}, M is an independent set in Z(G) containing {mˉi,j∣i<κ,j<2}, and G=⟨Y⟩×⟨M⟩.
Let c be a realization of ⋀i<κφ′(x,cˉi,0).
Write c=s(y,m) for some terms s∈LG, and for some tuples y=yν⌢yp⌢yι∈Y, and m∈M.
Again, To obtain handle correspondence, add handles of elements in the tuple yp to the beginning of yν.
Take ψ(x′,y′)=φ′(s(x′),y′), then for all i<j<κ, {ψ(x′,cˉi,1),ψ(x′,cˉj,1)} is inconsistent and y⌢m realizes ⋀i<κψ(x′,cˉi,0).
Since y⌢m∩⋃{cˉi,0∣i<κ} is finite, we may assume the array is an SOP1-array indiscernible over y⌢m∩⋃{cˉi,0∣i<κ}.
Now, consider yν and the array (yˉi,jν∣i<κ,j<2) in Yν.
Applying 4.9, we can regard the elements as vertices of a graph. This graph is a model of NSOP1 theory Th(C), so there is some γ satisfying 3.12(2).
Then for each β>γ, we have a tuple y′ν such that tpΓ(yν/yˉνi,0)=tpΓ(y′ν/yˉν0,1) and tpΓ(yˉν0,1/y′ν)=tpΓ(yˉν1,1/y′ν).
On the other hand, observe that Th(⟨M⟩) is a theory of vector spaces, so that the theory is stable and has quantifier elimination.
Then for the tuple m and the array (mˉi,jν∣i<ω,j<2) in ⟨M⟩, we can apply Corollary 3.12 to have some γ′ satisfying 3.12(2).
Fix some ordinal β larger then γ and γ′, and let y′ν and m′ be the tuples given by 3.12. We will find a handle preserving bijection which can be extended by Fact 4.12(1) to have
- (1)
tpG(ym/yˉβ,0mˉβ,0)=tpG(y′m′/yˉ0,1mˉ0,1), and
2. (2)
tpG(yˉ0,1mˉ0,1/y′m′)=tpG(yˉ1,1mˉ1,1/y′m′),
for some tuple y′=y′νy′py′ι.
From the above two type equivalence, we have G⊨ψ(y′m′,yˉ0,1mˉ0,1)∧ψ(y′m′,yˉ1,1mˉ1,1), and this contradicts that for any i<j<κ, {ψ(x′,yˉi,1mˉi,1),ψ(x′,yˉj,1mˉj,1)} is inconsistent.
We finish our proof by illustrating the way to find tuple y′=y′νy′py′ι. For a finite tuple zˉ and a natural number k, denote (zˉ)k to be the k-th element of zˉ.
Let yι be the tuple of length l. For each i<l, if (yι)i is (yˉιβ,0)k for some k, then choose yi′ι to be (yˉι0,1)k, and if (yι)i is not in yˉιβ,0, then choose (y′ι)i to be any element in Yι∖yˉι0,1.
Let yp be the tuple of length l′. For each i<l′, either (yp)i is in yˉpβ,0 or not.
Assume first that (yp)i is (yˉpβ,0)k for some k. Then choose (y′p)i to be (yˉp0,1)k.
Second, suppose (yp)i is not in yˉpβ,0. Recall that (yν)i is the handle of (yp)i. We have either (yν)i is in yˉνβ,0 or not.
If (yν)i is (yˉνβ,0)k, then choose (y′p)i to be any element in Yp∖yˉp0,1 whose handle is (yˉν0,1)k.
Otherwise, choose (yν)i to be any element in Yp whose handle is (y′ν)i.
Mapping each element in yyˉβ,0 to y′yˉ0,1 by their natural order, we have a bijection which satisfies hypotheses in 4.12(1).
As a result, tpG(y/yˉβ,0)=tpG(y′/yˉ0,1).
It remains to check the bijection from yˉ0,1y′ to yˉ1,1y′ is well-defined. Suppose the (yˉ0,1)k is equal to the (y′)k′ for some k and k′.
Since tpG(y/yˉβ,0)=tpG(y′/yˉ0,1), (yˉβ,0)k=(y)k′.
This element is in y⌢m∩⋃{cˉi,0∣i<κ}, hence for every i<κ, (yˉi,0)k is (y)k′.
By the definition of indiscernible SOP1-array, the (yˉi,1)k is (y)k′, too.
Thus (y′)k′, (yˉ0,1)k, (yˉ1,1)k, and (y)k′ are all the same elements.
This comes out again if we assume k-th element of yˉ1,1 is equal to the k′-th element of y′.
Therefore, we have a well-defined bijection from yˉ0,1y′ to yˉ1,1y′.
∎
Corollary 5.5**.**
- (1)
There is a non-simple NSOP1* pure group theory.*
2. (2)
If there is an NSOP2* theory which has SOP1, then there is a pure group theory with the same properties.*
Proof.
(1) Fix a structure M of finite language such that Th(M) is non-simple and NSOP1.
Then by [6, Theorem 5.5.1, Exercise 5.5.9], there is a nice graph C bi-interpretable with M.
Since Mekler’s construction preserves simplicity and NSOP1, the theory of Mekler group of C is non-simple and NSOP1, too.
(2) Follow the same argument above.
∎