Canonical equivalence relations on fronts on FINk
Dimitris VLITAS
Department of Mathematics, University of Toronto, 40 St. George Street, Toronto, Ontario, Canada M5S 2E4
[email protected]
Abstract.
We prove that for every equivalence relateion on a barrier on the space ⟨FINk[∞],≤,r⟩, for any k, there exists Y∈FINk[∞] so that the restriction of the coloring on ⟨Y⟩ is canonical.
1. Introduction
Canonical results in Ramsey theory try to describe equivalence relations in a given Ramsey structure,
based on the underlying pigeonhole principles. The first example of them is the classical Canonization
Theorem by P. Erdős and R. Rado [Er-Ra] which can be presented as follows: Given α≤β≤ω let
[TABLE]
The previous is commonly denoted by [β]α. Then for any n<ω and any finite coloring of
(nω) there is an isomorphic copy M of ω (i.e. the image of an strictly increasing
f:ω→ω) and some
I⊆n(:={0,1,…,n−1}) such that any two n-element subsets have the same color if and only if they agree
on the corresponding relative positions given by I.
This was extended by P. Pudlák and V. Rödl in [Pu-Ro] for colorings of a given uniform
family G of finite subsets of ω by showing that given any
coloring of G of finite subsets of ω, there exists A an infinite subset of ω, a
uniform family T and a mapping f:G→T such that f(X)⊆X for all
X∈G and such that any two X,Y∈G↾A have the same color if and
only if f(X)=f(Y). Since then, many results of similar nature have been obtained (see [Mil], [Vli]).
In 1992 G.T.Gowers [Gow] obtained a stability result for real valued Lipschitz functions defined in the unit sphere c0. This result is actually a consequence of a deep infinite dimensional Ramsey type result, which gives rise to a Ramsey space. In this paper we canonize equivalence relations on that space. To state our result we need to introduce some notions.
Given a positive integer k, let FINk be the set of mappings x:ω→{0,1,…,k}, called k-vectors, whose support suppx={n:x(n)=0} is finite and with k in their range. An element X of FINk[∞] is a sequence X=(xn)n∈ω so that maxsuppxn<minsuppxn+1, for all n∈ω. We write xn<xn+1 to show that maxsuppxn<minsuppxn+1.
Let T:FINk→FINk−1 be the map defined by T(x)(n)=max{x(n)−1,0}.
The k-combinatorial subspace ⟨X⟩ is the set of combinations of the form:
[TABLE]
with the condition that at least one ij=0, j<m+1. By Ti we mean Tix(n)=max(x(n)−i,0), for i>0 and T0=id. Given X=(xn)n∈l, we define the length of X, denoted by ∣X∣, to be equal to l.
For X=(xn)n∈∣X∣, Y=(yn)n∈∣Y∣∈FINk[≤∞], set X≤Y if xn∈⟨Y⟩ for all n<∣X∣. In this case we say that X is a block−subsequence of Y. Then ≤ is a partial ordering on FINk[∞].
For X∈FINk[∞] we define rn(X)=(xi)i∈n. We set AXn={rn(Y):Y≤X} and AX=∪n∈ωAXn.
Next we introduce a topology on FINk[∞] with basic open sets as follows. For s∈AXn, by ∣s∣=n we denote is length. We define
[TABLE]
These set form the basic sets for a topology on the space FINk[∞].
In [To] it is shown that ⟨FINk[∞],≤,r⟩ satisfies axioms A.1−A.4, so it is a topological Ramsey space. Two corollaries of being such a space are the following.
Corollary 1**.**
Let c:AXn→l be a finite coloring. There exists an Y≤X so that c↾AYn is constant.
and
Corollary 2**.**
Let s∈AX and c:[s,X]→l be a finite Suslin measurable coloring. There exists Y≤[s,X] so that c↾[s,Y] is constant.
Recall that a map f:X→Y between two topological spaces is Suslin measurable, if the preimage f−1(U) of every open subset U of Y belong to the minimal σ−field of subsets of X that contains its closed sets and it is closed under the Suslin operation [Ke].
For a family of finite approximation of elements of FINk[∞] called fronts (see Definition 1), we prove the following.
Theorem**.**
Let f:F→ω be a coloring of a front on [∅,X], for X∈FINk[∞]. There exists Y0≤X so that f↾F↾⟨Y0⟩ is canonical.
Here by canonical, we mean that there exists a map ϕ so that for every (t0,…,td−1)∈F↾⟨Y0⟩
[TABLE]
where {i0,…,il,…,j0,…,jm}⊆d and every ti, i<d appears in at most one combination in {Ti0ti0+⋯+Tiltil,…,Tj0tj0+⋯+Tjmtjm}⊂⟨X⟩. Then ϕ is so that for any s,t∈F it holds f(s)=f(t) if and only if ϕ(s)=ϕ(t). We view elements on FINk, the k-vectors, in the set theorytic way, as sets of ordered pairs. The subset is taken in this sense.
The proof of the above theorem is divided in two parts. In the next section we add the necessary definitions and new concepts and we present the first part of the proof. In the final section we present the second part.
2. Main theorem
The above partial ordering ≤ on FINk[∞], allows the finitization ≤fin as follows: for X=(xi)i∈h, Y=(yj)j∈m, we say that X≤finY if and only if X≤Y and (∀l<m),X≰,Y↾l.
For s∈AX and X∈FINk[∞] we define the depth of s in X as follows:
[TABLE]
Given an non empty basic open set [s,X], ∣s∣=n, let
[TABLE]
Now we introduce the notion of a Front.
Definition 1**.**
A family F of finite approximations of reducts of X is called a front, if for every Y≤X, there exists s∈F so that s=rn(Y) and for any two distinct s,t∈F, is not the case that s⊑t.
We distinguish specific instances of fronts on X, the AXn.
Given a front F on [∅,X], we introduce F^ defined as follows:
[TABLE]
observe that ∅∈F^. For t∈F^∖F
[TABLE]
For Y≤X F↾Y={t∈F:t∈AY′,Y′≤Y},
[TABLE]
Finally for s∈AX and X∈FINk[∞] by X/s we denote X∖s. Similarly for s,t∈AX, by X/(s,t) we denote X∖s∩X∖t.
The following proposition is a fact that holds in any topological Ramsey space. For the shake of completeness, we give a proof here in the context of our space.
Proposition 1**.**
Suppose the ⟨FINk[∞],≤,r⟩ has the property that given a property P(⋅,⋅), s∈AX and Y≤X, there exists Z′≤Y so that P(s,Z′). Then there exists Z≤X such that for any s∈AZ it holds that P(s,Z).
Similarly for properties of the form P(⋅,⋅,⋅). If given s,t∈AX and Y≤X, there exists Z′≤Y so that P(s,t,Z′). Then there exists Z≤X so that P(s,t,Z) for all s,t∈AZ.
Proof.
Let t0=r0(X) and X. There exists X0≤X so that P(t0,X0). Set t1=r1(X0) and let X1≤X0 so that P(t1,X1) holds. Set t2=r2(X1). Consider the finite set A2={z∈AX:z≤fint2}. For every z∈A2 there exists Y≤X0 so that P(z,Y). After considering all z∈A2 we get X2≤X1 and t3=r3(X2) so that P(z,X2) holds, for all z∈A2. Suppose we have constructed tn and Xn. Set tn+1=rn+1(Xn). Consider An={z∈AX:z≤fintn+1}. For every z∈An there exists Y≤Xn so that P(z,Y). Therefore we get Xn+1≤Xn so that for any z∈An we have P(z,Xn+1). Set tn+2=rn+2(Xn+1). Proceed in that manner. Observe that for all n∈ω tn⊏tn+1. Set Z=∪n∈ωtn.
Now we prove similarly the second statement of our proposition. Let t0=r0(X) and t1=r1(X) and X. There exists X1≤X so that P(t0,t1,X1). Let t2=r2(X1). Consider the finite set A2={z∈AX:z≤fint2}. For any (s,t)∈[A2]2, there exists Y≤X1 so that P(s,t,Y). By exhausting all possible such a pairs we get X2≤X1 such that for any (s,t)∈[A2]2 it holds that P(s,t,X2). Set t3=r3(X2). Suppose we have constructed tn and Xn. Let tn+1=rn+1(Xn) and An+1={z∈AX:z≤fintn+1}. For any pair (s,t)∈[An]2 there exists Y≤Xn so that P(s,t,Y) holds. After considering all possible such a pairs, we get Xn+1 such that for any (s,t)∈[An+1]2 it holds that P(s,t,Xn+1). Set tn+2=rn+2(Xn+1). Observe that for every n∈ω, tn⊏tn+1. Let Z=∪n∈ωtn.
∎
As mentioned above in [To] is shown that ⟨FINk[∞],≤,r⟩ satisfies a pigeon hole property (axiom A.4 in [To]).
To show that this space satisfies a strengthen pigeon hole property, (Theorem 1 below), we introduce some concepts and definitions from [Ab].
We restrict our attention to the subset of FINk that contains all the k-vectors that are system of staircases.
Definition 2**.**
Given an integer i∈[1,k], let mini,maxi:FINk→ω be the mappings minix=minix−1({i}), maxix=maxx−1({i}), if defined and [math] otherwise. A k-vector x is a system of staircases (sos in short) if and only if
- 1
Range x={0,1,…,k},
2. 2
minix<minjx<maxix, for i<j≤k,
3. 3
for every 1≤i≤k,
- Range x↾[mini−1x,minix)={0,…,i−1},
- Range x↾(maxix,maxi−1x]={0,…,i−1},
- Range x↾[minkx,maxkx]={0,…,k}.
An X=(xn)∈FINk[∞] is a system of staircases if and only if every k-vector xn is an sos. In [Ab] it is shown that for every X∈FINk[∞] there exists Y≤X so that X is sos and that T preserves sos. Next we introduce some mappings.
Definition 3**.**
Let X∈FINk[∞] be a sos. The mapping mini, for i∈[1,k], can be interpreted as
[TABLE]
for w∈⟨X⟩. Extending this, define for I⊆{1,…k}, the mapping minI:⟨A⟩k→FINmaxI⊆FIN≤k by minI(w)(n)=i if n=mini(w), for i∈I and [math] otherwise, i.e. minI(w)={(mini(w),i):i∈I}, and extended by [math]. Similarly, let
[TABLE]
and let maxI:FINk→FINmaxI be defined by maxI(w)={(maxi(s),i):i∈I}, again extended by [math]. Clearly minI=⋁i∈Imini and maxI=⋁i∈Imaxi, where for two mappings f,g:⟨X⟩k→FIN≤k we define (f∨g)(w)=f(w)∨g(w).
For l≤i, let θi,l0:⟨X⟩→FILl be the mappings defined by
- θi,l0(w)={(n,l):n∈(mini(w),mini+1(w)),w(n)=l} extended by [math],
- θi,l1(w)={(n,l):n∈(maxi+1(w),maxi(w)),w(n)=l} extended by [math],
- θl2(w)={(n,l):n∈(mink(w),maxk(w)),w(n)=l} extended by [math], where l≤k.
Definition 4**.**
Let Gmin={min1,…,mink}, Gmax={max1,…,maxk}, Gmidϵ={θi,lϵ:i∈{1,…,k−1},l∈{1,…,i−1}}, for ϵ=0,1 and Gmid={θl2:l∈{1,…,k}∪{0}. Set G=Gmin∪Gmax∪Gmid0∪Gmid1∪Gmid.
Given a k-block sequence X, we say that f:⟨X⟩→FIN≤k is a staircase function if it is in the lattice closure of G. An equivalence relation R on ⟨X⟩ is a staircase relation if the following holds: sRt if and only if f(s)=f(t), for some staircase mapping f. In [Ab] is shown that if f is a staircase map then there are Iϵ⊆{1,…,k},Jϵ⊆{j∈Iϵ:j−1∈Iϵ}, (lj(ϵ))j∈Jϵ with lj(ϵ)≤j−1, for ϵ=0,1 and lk(2) such that
[TABLE]
As with the k-vectors, given two functions f,g:⟨A⟩→FIN≤k, we write f<g to denote that f(w)<g(w), for all w∈⟨A⟩. Therefore any staircase mapping f has a unique decomposition f=∪i∈nfi with f0<f1<⋯<fn−1 in G.
In [Ab] J. Lopez-Abad showed the following.
Theorem 1**.**
For every k and every equivalence relation on FINk there is a system of staircases B such that the equivalence relation restricted to ⟨B⟩ is a staircase equivalence relation.
Observe that the above theorem is the one dimentional case of our main theorem mentioned in the introduction. In other words it takes care of the front AX1, for X∈FINk[∞].
Next we make the following definition.
Definition 5**.**
Given F a front on [∅,X] and f:F→ω. Fix s,t∈F^∖F and X. X separates s and t if and only if for all w∈⟨X/s⟩ and v∈⟨X/t⟩ so that s∪w,t∪v∈F↾X, f(s∪w)=f(t∪v). X mixes s with t, if there is no Y≤X which separates s with t. X decides for s with t if and only if either X mixes s with t, or X separates s with t.
Therefore X mixes s with t if and only if for each Y≤X, there are w∈⟨Y/s⟩ and v∈⟨Y/t⟩ so that s∪w,t∪v∈F↾Y and f(s∪w)=f(t∪v).
The following proposition follows directly from the definitions.
Proposition 2**.**
The following hold.
- (1)
If X mixes (separates) s with t, so does any reduct Y≤X.
2. (2)
For every s,t∈F^∖F if for any w∈[s,X]∣s∣+1 there exists v∈[t,X]∣t∣+1 so that X mixes s∪w with t∪v, then X also mixes s with t.
Next we observe the following.
Proposition 3**.**
Given X and a front F on [∅,X], there exists Z≤X so that for all s,t∈F^↾Z, Z decides s with t.
Proof.
Given s,t and Y≤X it suffices to show that there exists Z≤Y which decides for s and t. Then the statement of the this proposition will follow from Proposition 1 and the property P(s,t,Y) stating that Y decides for s and t. Assume that depthX(s)≤depthX(t) and consider the two-coloring: c′:[t,Y]→2 defined by
[TABLE]
Corollary 2, provides us with Z that either mixes s with t, in the case that c′↾[t,Z]=1, or separates them, in the case that c′↾[t,Z]=0.
∎
The above notion of mixing induced by Definition 5 is not necessarily transitive.
An example of such an equivalence relation is the following. Let X=(xn)n∈ω∈FIN1[∞] and c:AX2→ω, defined as follows c(s,t)=s+t=s∪t. Let s=x0, t=x0+x2 and p=x0+x1+x2. Observe that the depth of s,t and p in X is not the same. Then X mixes s with t and s with p, but X does not mixes t with p. The above example generalizes easily for any k.
In the case of the same depth, mixing is transitive as the next lemma shows.
Lemma 1**.**
Let s,t,p∈AXn, with depthX(s)=depthX(t)=depthX(p). If X mixes s with t and X mixes t with p, then X mixes s with p.
Proof.
Suppose that X mixes s with t and X mixes t with p, but X separates s with p. Consider the two-coloring c1:[p,X]n+1→2 defined by
[TABLE]
Corollary 1, gives us a Y∈[p,X] so that c1↾[p,Y]n+1=1. Similarly we consider the two-coloring c2:[t,Y]n+1→2 defined by:
[TABLE]
which gives us a Z∈[t,Y] so that c2↾[t,Z]n+1=1. But this implies that Z≤X mixes s with p, a contradiction.
∎
Now we are ready to state and prove our main theorem.
Theorem 2**.**
Let f:F→ω be a coloring of a front on X, for X∈FINk[∞]. There exists Y0≤X so that f↾F↾Y0 is canonical.
Let F be any front on ⟨X⟩ and f:F→ω any coloring. Then Theorem 1 looks after the case of front F=AX1. Consider an arbitrary front F. Definition 5 gives us the notion of separation and mixing. We are going to divide the proof in two parts. In the first part we assume that mixing is transitive. In the second part we deal with the case that mixing is not transitive. In the first case we are going to obtain a map ϕ , ϕ(t0,…,td−1)⊆(t0,…,td−1) so that for any s,t∈F it holds that f(s)=f(t) if and only if ϕ(s)=ϕ(t). In the second case we obtain a map ϕ so that ϕ(t0,…,td−1)⊆(Ti0ti0+⋯+Tiltil,…,Tj0tj0+⋯+Tjmtjm), {i0,…,il,…,j0,…,jm}⊆d, and each ti, i<d appears in at most one combination in {Ti0ti0+⋯+Tiltil,…,Tj0tj0+⋯+Tjmtjm}⊂⟨X⟩. Then ϕ has the property that for any s,t∈F it holds f(s)=f(t) if and only if ϕ(s)=ϕ(t).
Assume that mixing is transitive. If s=(s0,…,sn1) is an n-tuple and w,v∈FINk are length one extensions of s, by s∪w we denote the n+1-tuple that extends s by w. From now on for notational simplicity when we write s∪w we mean that s∪{w}=(s0,…,sn1,w) and when we write s∪w+v we mean the n+1-tuple (s0,…,sn1,w+v). For any s∈F^∖F, ∣s∣=n and X∈FINk[∞] with [s,X]=∅, Theorem 1 provides us with a Y∈[s,X] and ϕs so that for s∪w,s∪v∈[s,Y]n+1, Y mixes s∪w with t∪v if and only if ϕs(w)=ϕt(v).
This is done by considering the equivalence relation c:[s,X]n+1→ω, on ⟨X⟩, defined by c(w)=c(v) if and only if X mixes s∪w with s∪v. By Proposition 1, we can assume that for every t∈F^∖F↾X, there exists a staircase map ϕt which induces an equivalence relation on [t,X]n+1.
Assume that X mixes s with t, s,t∈AXn, and consider the two-coloring c′:[t,X]n+1→2 defined by
[TABLE]
The fact that ⟨FINk[∞],≤,r⟩ is a topological Ramsey space gives us a Z≤Y where c′↾[t,Z]n+1 is constant. If the constant value is equal to one, then on Z we have that for every t∪w∈[t,Z]n+1, Z mixes t∪w with s∪w and also ϕt(w)=ϕs(w).
Let c′↾[t,Z]n+1=0. Then for every t∪w∈[t,Z]n+1 either there exists s∪v∈[s,Z]n+1 where Z mixes t∪w with s∪v and ϕs(v)=ϕt(w) or there is no s∪v∈[s,Z]n+1 that Z mixes it with t∪w. This allows to consider the two coloring: c1:[t,Z]n+1→2 defined by:
[TABLE]
Once more there exists Z1∈[t,Z] so that c1↾[t,Z1] is constant. If the constant value is equal to zero, then Z1 separates s with t, a contradiction to the assumption that Z mixes s with t. Suppose that c1↾[t,Z1]=1.
Then for every t∪w∈[t,Z1]n+1 there exists s∪v∈[s,Z1]n+1 so that Z1 mixes t∪w with s∪v and ϕs(v)=ϕt(w). Observe that it might be the case that ϕs=ϕt and for every t∪w∈[t,Z1]n+1, there exists s∪v∈[s,Z1]n+1, w=v, so that Z1 mixes t∪w with s∪v and even though ϕs=ϕt, ϕs(v)=ϕt(w) cause w=v. The assumption that ϕs=ϕt rules out the possibility of Z1 mixing t∪w with s∪w, for any w∈⟨Z1⟩.
Let ϕs=∪i∈αfi, ϕt=∪j∈βgj, α,β∈k+1, and X⊆α,Y⊂β, ∣X∣=∣Y∣, so that for every i∈X there j∈Y so that fi=gj.
Let ϕs′=∪i∈α∖Xfi and ϕt′=∪j∈β∖Ygj.
For every w∈⟨Z1⟩ consider the finite sets:
Aw0={Tiw,i<k:ϕs′(Tiw+v)=ϕs′(Tiw+v′) and ϕt′(Tiw+v)=ϕt′(Tiw+v′) for all v′,v∈⟨Z1/w⟩}.
Notice that Aw0=∅ if and only if {fi,gj:i∈α∖X,j∈β∖Y}⊂Fmin∪Fmid0. Observe also that in the above definition v,v′ play not a role in the value of ϕs′,ϕt′, are needed only for Tiw+v′∈FINk. With Aw0 we associate Fw0={i:Tiw∈Aw0}.
Similarly if {fi,gj:i∈α∖X,j∈β∖Y}⊂Fmax∪Fmid1 we define
Aw1={Tiw,i<k:ϕs′(w′+Tiw)=ϕs′(v′+Tiw) and ϕt′(w′+Tiw)=ϕt′(v′+Tiw) for all v′,w′∈⟨Z1/w⟩}.
With Aw1 we associate Fw1={i:Tiw∈Aw1}. Observe that given ϕs′, ϕt′, Fw0=Fv0 and Fw1=Fv1, for all v. Let
Dw0={(Tjw,Tiw)∈Aw0×Aw0:Z1 mixes s∪Tjw+w′ with t∪Tiw+v′ for all v′,w′∈⟨Z1/w⟩}.
With Dw0 we associate the set Cw0={(j,i):(Tjw,Tiw)∈Dw0}.
Similarly we define
Dw1={(Tjw,Tiw)∈Aw1×Aw1:Z1 mixes s∪w′+Tjw with t∪v′+Tiw for all v′,w′∈⟨Z1/w⟩}.
With Dw1 we associate the set Cw1={(j,i):(Tjw,Tiw)∈Dw1}.
Notice that Cwi, i<2, may contains pairs of the form (j,i), where j=i. In the case that ϕs=ϕt we have that both Cw0 and Cw1 do not contain elements of the form (j,j), j<k. The rest is identical with the case that ϕs=ϕt.
Observe also that for every w0,w1∈⟨Z1⟩, i<k and f∈Fmax∪Fmid1, f(Tiw0+w1)=f(w1). In the case that f∈Fmin∪Fmid0, then f(w0+Tiw1)=f(w0).
Claim 1**.**
Let f,g∈Fmin∪Fmid0∪Fmid, f=g and for i<j, it holds that supp(f(w))⊂[mini(w),mini+1(w)) and also supp(g(w))⊂[minj(w),minj+1(w)). Then for any w∈⟨Z1⟩ there always exists Tk−iz, z<w, so that f(Tk−iz+w)=f(w) and g(Tk−iz+w)=g(w).
Similarly if f,g∈Fmid∪Fmax∪Fmid1, f=g and for i<j, it holds that supp(f(w))⊂(maxi+1(w),maxi(w)] and also supp(g(w))⊂(maxj+1(w),maxj(w)]. For any w∈⟨Z1⟩ there always exists Tk−iz, w<z, so that f(w+Tk−iz)=f(w) and g(w+Tk−iz)=g(w).
Proof.
Let f,g∈Fmin∪Fmid0∪Fmid. Assume that i<j, pick any z<w and consider Tk−iz∈FINi. Notice that f(Tk−iz+w)=f(w) and g(Tk−iz+w)=g(w). This is due to the fact that minj(Tk−iz+w)=minj(w), minj+1(Tk−iz+w)=minj+1(w) and for every θj,l0, l≤j, it holds that θj,l0(Tk−iz+w)=θj,l0(w).
Let f,g∈Fmax∪Fmid1∪Fmid as in the claim. Pick any z>w and consider Tk−iz∈FINi. Notice that f(w+Tk−iz)=f(w) and g(w+Tk−iz)=g(w). This is due to the fact that maxj(w+Tk−iz)=maxj(w), maxj+1(w+Tk−iz)=maxj+1(w) and for every θj,l1, l≤j, it holds that θj,l1(w+Tk−iz)=θj,l1(w).
∎
Observe that on ⟨Z1⟩ there is an one-to-one correspondence between equivalence classes induced by ϕs and ϕt. Let once more f,g∈Fmin∪Fmid0∪Fmid, f=g and supp(f(w))⊂[mini(w),mini+1(w)), supp(g(w))⊂[minj(w),minj+1(w)). The case that i=j occurs only in the following two possibilities. First if f=mini, g=θi,h0 and second if f=θi,h′0, g=θi,h0, h,h′≤i. Let f=mini, g=θi,h0 for h<i and consider w=Tk−iw0+w1. Suppose that Z1 mixes s∪w with t∪w. Pick w0<z<w1 and consider v=Tk−iw0+Tk−hz+w1. Then ϕs(s∪v)=ϕs(s∪w) and ϕt(t∪v)=ϕt(t∪w). Therefore Z1 mixes s∪w with s∪v and t∪w. If Z1 mixes s∪v with t∪v, would imply that Z1 mixes t∪w with t∪v, but ϕt(t∪w)=ϕt(t∪v).
As a result Z1 separates s∪v with t∪v. In the case that h=i then v=Tk−iw0+Tk−iz+w1. Once more Z1 separates s∪v with t∪v.
Let now f=θi,h′0, g=θi,h0. The assumption that f=g implies that h=h′. Suppose once more that Z1 mixes s∪w with t∪w, for w=Tk−iw0+w1. Pick z so that w0<z<w1 and consider v=Tk−iw0+Tk−hz+w1, in the case that h<h′, and v=Tk−iw0+Tk−h′z+w1, in the case that h′<h. In the first case we have that ϕs(s∪v)=ϕs(s∪w) and ϕt(t∪v)=ϕt(t∪w). In the second case we have that ϕs(s∪v)=ϕs(s∪w) and ϕt(t∪v)=ϕt(t∪w). As a consequence Z1 separates s∪v with t∪v. Therefore given f∈ϕs, g∈ϕt, f=g, f,g∈Fmin∪Fmid0∪Fmid and w so that Z1 mixes s∪w with t∪w, there exists v that results from w by addition, so that Z1 separates s∪v with t∪v. Let f,g∈Fmax∪Fmid1∪Fmid and f=g. By an identical argument we have that the above statement holds as well.
To avoid unnecessary length, from now onwards, we are going to assume that for every fn,gm so that fn∈ϕs′ and gm∈ϕt′ it holds that it is not the case that both supp(fn(w)),supp(gm(w))⊂[mini(w),mini+1(w)) or supp(fn(w)),supp(gm(w))⊂(maxi+1(w),maxi(w)], for the same i≤k.
Assume that for n0=minα∖X one of the following holds. First case supp(fn0)⊂[mini0(w),mini0+1(w)) and for all j∈β∖Y, supp(gj(w))⊂[mini(w),mini+1(w)), i0<i or supp(gj(w))⊂(maxi+1(w),maxi(w)] for any i>i0. Second case supp(fn0)⊂(maxi0+1(w),maxi0(w)] and for all j∈β∖Y, it holds that for i>i0 supp(gj(w))⊂[mini(w),mini+1(w)), or supp(gj(w))⊂(maxi+1(w),maxi(w)]. Let gm0 be so that m0=minβ∖Y and either supp(gm0(w))⊂[minim(w),minim+1(w)) or supp(gm0(w))⊂(maxim+1(w),maxim(w)]. Therefore with fn0 we associate i0 and with gm0 we associate im.
For w∈⟨Z1⟩ we introduce two more sets.
Bw0={Tiw:i<k, either ∃i′∈α∖X, or j′∈β∖Y:fi′(Tiw+w′)=fi′(w′) or gj′(Tiw+w′)=gj′(w′),∀w′∈⟨Z1/w⟩},
and
Bw1={Tiw:0=i<k, either ∃i′∈α∖X, or j′∈β∖Y:fi′(w′+Tiw)=fi′(w′) or gj′(w′+Tiw)=gj′(w′),∀w′<w}.
We claim the following.
Claim 2**.**
Let w∈⟨Z1⟩ and assume that for all fn∈ϕs′ and gm∈ϕt′ it holds that fn,gm∈Fmin∪Fmid0. As a result Aw0=∅. There exists
[TABLE]
j0<⋯<jl, so that for every j,i∈Fwˉ0, not necessarily distinct, Z1 separates s∪Tiwˉ+v with t∪Tjwˉ+v′, for any v,v′∈⟨Z1/wˉ⟩.
Proof.
Let w∈⟨Z1⟩ with Aw0=∅ be given and let j=maxFw0. Assume that ϕs=ϕt. Let (j,j)∈Cw0.
Notice that supp(fn0(w))<maxk(w). From above by i0<k we denote the supp(fn0)(w)⊂[mini0(w),mini0+1(w)). We have assumed also that supp(gm0(w))⊂[minim(w),minim(w)) and im≥i0+1.
Pick any z0∈Z1 so that z0<w and set w0=Tk−i0−jz0+w, where Tk−i0−jz0∈FINi0+j. Notice that w0 is a sos and ϕs(Tjw0+w′)=ϕs(Tjw+w′) and ϕt(Tjw0+w′)=ϕt(Tjw+w′).
Next consider Fw00 and Cw00. If Cw00=∅, then (j,j)∈/Cw00. Let j′=maxFw00. If (j′,j′)∈Cw00 repeat the above step to get w1=Tk−i0−j′z1+w0, z1<z0, so that ϕs(Tj′w1+w′)=ϕs(Tj′w0+w′) and ϕt(Tj′w0+w′)=ϕt(Tj′w1+w′).
Observe that (j′,j′)∈/Cw10. Suppose now that both (j0,j1),(j1,j0)∈Cw10, j0<j1. In other words Z1 mixes s∪Tj0w1+w′ with t∪Tj1w1+w′ and also s∪Tj1w1+w′ with t∪Tj0w1+w′.
At this point we need the assumption it is not the case that Tnϕt′=ϕs′, for n<k. We consider here the case where ϕs′=fi0, ϕt′=gm0, im=i0+1 and j1=j0+1. This immediately implies that i0+j1=im+j0.
Assume also that fn0(w)∈FINh and gm0(w)∈FINh′, where h′≤h.
Pick z2<z1 and consider w2=Tk−i0−j1z2+w1.
If Z1 still mixes s∪Tj1w2+w′ with t∪Tj0w2+w′, pick z3 so that z2<z3<w1 and consider w3=Tk−i0−j1z2+Tk−h′−j0z3+w1
Observe that ϕs(s∪Tj1w3+w′)=ϕs(s∪Tj1w2+w′) and ϕt(t∪Tj0w3+w′)=ϕt(t∪Tj0w2+w′). In the case that h′>h+1 then w3=Tk−i0−j1z2+Tk−h−j1z3+w1 and we would have that ϕs(s∪Tj1w3+w′)=ϕs(s∪Tj1w2+w′) and ϕt(t∪Tj0w3+w′)=ϕt(t∪Tj0w2+w′).
Therefore Z1 separates s∪Tj1w3+w′ with t∪Tj0w3+w′. The reason that we need the assumption that Tnϕt′=ϕs′, is that in the case of equality we will not be able by adding z2,z3, as we did just above, to separate s∪Tj1w3 with t∪Tj0w3+w′. This assumption cause not problem, see right after the end of this proof for a justification.
If now (j0,j1)∈Cw30 as well, pick z4<z2 and consider w4=Tk−i0−j0z4+w3. Observe that ϕs(s∪Tj0w4+w′)=ϕs(s∪Tj0w3+w′) and ϕt(t∪Tj1w4+w′)=ϕt(t∪Tj1w3+w′). As a consequence Z1 separates s∪Tj0w4+w′ with t∪Tj1w4+w′. All the other cases are dealt in an identical manner.
Proceed in this manner to get wˉ that satisfies the conclusions of our claim.
In the case that ϕs=ϕt, as remarked above, the possibility of (j,j)∈Cw0 does not occur for every j<k. Suppose that both (j0,j1),(j1,j0)∈Cw0, j0<j1. In other words Z1 mixes s∪Tj0w+w′ with t∪Tj1w+w′ and also s∪Tj1w+w′ with t∪Tj0w+w′ and j0<j1. For z<w, let w0=Tk−i0−j0z+w. Notice that ϕs(Tj0w0+w′)=ϕs(Tj0w+w′) and ϕt(Tj0w0+w′)=ϕt(Tj0w+w′). As a result both (j0,j1) and (j1,j0) are not in Cw00. Proceed in this manner to get the wˉ that satisfies the conclusions of our claim.
∎
Suppose that Tjw,Tiw∈Aw0 and i>j. Suppose also that Ti−jϕt′(w)=ϕs′(w). In the case that Z1 mixes s∪Tiw+v with t∪Tjw+v, it is not possible to separate s∪Tiwˉ+v with t∪Tjwˉ+v, for any wˉ that results from w by means of addition.
The assumption that Ti−jϕt′=ϕs′, causes not problem due to the fact that ⟨FINk[∞],≤,r⟩ is a topological Ramsey space. This reduces to the following sequence of colorings. Let Z∈FINk[∞] and ϕ a staircase function that determines an equivalence relation on ⟨Z=(zn)n∈ω⟩. In the case that every equivalence class of ϕ is infinite we proceed as follows. Let i′<k be minimal so that ϕ(z0+Ti′v)=ϕ(z0+Ti′v′) and for every j<i′, ϕ(z0+Ti′v)=ϕ(z0+Tjv), where v,v′∈⟨Z/z0⟩. Consider the coloring c0:⟨Z/z0⟩→2, defined by
[TABLE]
There exists Z0=(zn0)n∈ω≤Z so that for c0↾⟨Z0⟩ is constant. If the constant value is equal to one, observe that for all z0+Ti′z00, z0+Ti′z00+Ti′v it does hold that ϕz0+Ti′z00′=ϕz0+Ti′z00+Ti′v′, for every v∈⟨Z0/z00⟩. Repeat the above coloring for all j′>i′. Suppose that in theses cases the constant value is equal to zero.
Set w0=z0+Ti′z00, and consider the finite set A={Tjw0:j≤k}. For every v∈A consider the coloring cv:⟨Z0/z10⟩→2 defined by
[TABLE]
After repeating that for all v∈A, j′>i′, we get Z1≤Z0 and w1 so that ϕv+w1′=ϕv+w1+Ti′w′′, for every v∈A and w′∈⟨Z1/w1⟩, in the case that the constant values are equal to zero for the coloring corresponding to all j′>i′. Proceed in this manner to get Z=(wn)n∈ω where our assumption holds. Identical argument holds in the case that we color Ti−jϕz0′=ϕz0+Ti′w′ and Ti−jϕv+z10+Ti′w′=ϕv+z10′.
Observe that for every k, ϕ defines an equivalence relation, where each equivalence class has finitely many elements if and only if ϕ=max1 or ϕ=θ111. In this case we color as follows. Fix w0∈Z and consider the coloring c0:⟨Z/w0⟩→2, defined by
[TABLE]
There exists Z0≤Z so that c2↾⟨Z0/w0⟩ is constant. If c0↾⟨Z0/w0⟩=1, notice that on ⟨Z1/w0⟩, ϕ(w)=ϕ(v) implies that ϕw=ϕv. Then we will get Z1/w0≤Z1 so that our assumption holds. Identical in all other cases.
Notice that if for all fn∈ϕs′ and gm∈ϕt′ it holds that fn,gm∈Fmax∪Fmid1, by an identical argument with that of Claim 2 we get that there always exists wˉ=w+Tj0z0+⋯+Tjlzl, j0<⋯<jl so that for every i,j∈Fwˉ1 Z1 separates s∪w′+Tiwˉ with t∪w′+Tjwˉ.
Observation 1**.**
In the case that both Aw0 and Aw1 are empty sets, supp(fn0(w))<mink(w) and Z1 mixes s∪w with t∪w, then for any z<w, Z1 separates s∪Tk−i0z+w with t∪Tk−i0z+w.
Conversely if supp(fn0(w))>maxk(w) and and Z1 mixes s∪w with t∪w, then for any z>w, Z1 separates s∪w+Tk−i0z with t∪w+Tk−i0z.
For combinatorial purposes we consider strong systems of staircases a subset of the set of system of staircases. A w∈FINk is a strong system of staircases if and only if w=Tk−1w1+Tk−2w2+⋯+Twk−1+wk0+wk1+Twk+1+…Tk−2w2k−2+Tk−1w2k−1, for w1,…w2k−1 system of staircases. From now on we are considering strong system of staircases.
Next we claim the following.
Claim 3**.**
Let w∈Z1/(s,t). There exists Z2≤Z1/w and (Tk−jlzl)l∈{1,…,k−1}, (Tk−jkdzkd)d∈m, where (jl)l∈{1,…,k}, (jkd)d∈m can be equal to [math], so that for all v∈⟨Z2/(s,t)⟩, Tjw,Tiw∈Bw0, not necessarily distinct, Z2 separates s∪Tiw′+v with t∪Tjw′+v. By w′ we denote w′=Tk−1w1+Tk−j1z1+Tk−2w2+Tk−j2z2+⋯+Twk−1+Tk−jk−1zk1+wk0+Tk−jk0zk0+⋯+Tk−jkm−1zkm−1+wk1+Twk+1+…Tk−2w2k−2+Tk−1w2k−1.
Proof.
Let w∈Z1/(s,t), Tk−jw,Tk−iw∈Bw0, so that f∈ϕs′ witnesses that Tk−iw∈Bw0 and g∈ϕt′ witnesses that Tk−jw∈Bw0. Consider the coloring c2:⟨Z1/w⟩→2 defined as follows.
[TABLE]
By the fact that we are in a topological Ramsey space, we get Z2≤Z1/w so that c2↾⟨Z2⟩ is constant. If the constant value is equal to one, then the conclusions of our claim are satisfied for w′=w.
Let the constant value be equal to zero. At this point we need the assumption that Tngm0w=fi0(w), for n=im−i0. This assumption causes not a problem, see right after the end of this proof.
Let f(w)∈FINh, g(w)=FINh′ and assume that f(w)=Tj−ig(w), i<j and fi0<f. Add Tk−i0−iz to the right of Tk−i0−iwi0+i, where i0<k is so that supp(fi0(w))⊂[mini0(w),mini0+1(w)), for fi0∈ϕs′ as defined above, and observe that for all v′∈⟨Z2⟩, ϕs(Tk−iw′+v′)=ϕs(Tk−iw+v′) and ϕt(Tk−jw′+v′)=ϕt(Tk−jw+v′). If now f(w)=Tj−ig(w), i<j and h<h′, add Tk−h−iz to the right of wk0 and notice that ϕs(Tk−iw′+v′)=ϕs(Tk−iw+v′) and ϕt(Tk−jw′+v′)=ϕt(Tk−jw+v′). Similarly in all the other cases.
Finally in the case that h=h′, assuming that i<j add Tk−h−iz to the right of wk0 and observe that ϕs(Tk−iw′+v′)=ϕs(Tk−iw+v′), ϕt(Tk−jw′+v′)=ϕt(Tk−jw+v′). In the case that j<i, add Tk−h−jz to the right of wk0 and observe that ϕs(Tk−iw′+v′)=ϕs(Tk−iw+v′) and ϕt(Tk−jw′+v′)=ϕt(Tk−jw+v′).
Repeat this step to all possible such pairs Tk−jw,Tk−iw∈Bw0 to get w′ that satisfies the conclusions of our claim.
∎
Suppose f∈ϕs′ witnesses that Tiw∈Bw0 and g∈ϕt′ witnesses that Tjw∈Bw0 and i>j. Suppose also that Ti−jg(w)=f(w) and there is not g′∈ϕt′ with g′=g, g′<g and f′∈ϕs′, f′=f, f′<f. In the case that Z1 mixes s∪Tiw+v with t∪Tjw+v, for all v∈Z1/w, it is not possible to separate s∪Tiw′+v with t∪Tjw′+v, for any w′ that results from w by addition. This occurs in the case that either Ti−jg(w)=f(w) and there is not f′∈ϕs′, f′=f where f′<f and g′∈ϕt′, g′=g so that g′<g. This condition in our context of s and t as above, amounts to Tngm0=fi0, for n<k.
The assumption that Tngm0(w)=fi0(w), causes not problem due to the fact that ⟨FINk[∞],≤,r⟩ is a topological Ramsey space. This reduces to the following sequence of colorings. Let Z∈FINk[∞] and ϕ a staircase function that determines an equivalence relation on ⟨Z=(zn)n∈ω⟩. In the case that every equivalence class of ϕ is infinite we proceed as follows. Let i<k be minimal so that ϕ(z0+Tiv)=ϕ(z0+Tiv′) and for every j<i, ϕ(z0+Tiv)=ϕ(z0+Tjv), where v,v′∈⟨Z/z0⟩. We are going to consider here the case where n=im−i0. The case of any other n is identical. Consider the coloring c0:⟨Z/z0⟩→2, defined by
[TABLE]
There exists Z0=(zn0)n∈ω≤Z so that for c0↾⟨Z0⟩ is constant. If the constant value is equal to one, observe that for every z0+Tiz00, z0+Tiz00+Tiv it does hold that fi0z0+Tiz00=fi0z0+Tiz00+Tiv, for all v∈⟨Z0/z00⟩. In other words i0∈X, i.e. fi0z0+Tiz00∈/ϕz0+Tiz00′ and fi0z0+Tiz00+Tiv∈/ϕz0+Tiz00+Tiv′.
Notice that we can repeat this up to k−3 times, cause the new fi0′z0+Tiz00 is so that supp(fi0′z0+Tiz00)⊆(mini0′(z0+Tiz00),mini0′+1(z0+Tiz00)) for i0′>i0. Therefore we will get to a block subsequence Z that either the first alternative does not hold, or ϕz0+Tiz00+Tiv=ϕz0+Tiz00+Tiv′, for all v,v′∈⟨Z/(z0+Tiz00)⟩. Repeat the above coloring for every j>i. Assuming that in all these colorings the constant value is [math], set w0=z0+Tiz00, and consider the finite set A={Tjw0:j≤k}. For every v∈A consider the coloring cv:⟨Z0/z10⟩→2 defined by
[TABLE]
After repeating that for all v∈A, as above, we get Z1≤Z0 and w1 so that fi0v+w1=fi0v+w1+Tiw′, for every v∈A and w′∈⟨Z1/w1⟩. Proceed in this manner to get Z=(wn)n∈ω where our assumption holds. The above argument is identical in the case that fi0∈ϕz0+Tiw′, gm0∈ϕz0′ and fi0∈ϕv+z10+Tiw′, gm0∈ϕv+z10′.
Observe that for every k, ϕ defines an equivalence relation, where each equivalence class has finitely many elements if and only if ϕ=max1 or ϕ=θ111. In this case we color as follows. Fix w0∈Z and consider the coloring c0:⟨Z/w0⟩→2, defined by
[TABLE]
There exists Z0≤Z so that c0↾⟨Z0/w0⟩ is constant. If c0↾⟨Z0/w0⟩=1, notice that on ⟨Z1/w0⟩, ϕ(w)=ϕ(v) implies that fi0w=fi0v, where fi0w∈ϕw,fi0v∈ϕv. As a result {fi0w,fi0v}⊆ϕw∩ϕv. Observe that we can repeat this step up to k−3 times. Then we will get Z′≤Z1 so that our assumption holds.
Next we prove the following.
Claim 4**.**
Let w∈⟨Z1⟩ be given. There exists Z3≤Z1/w and (Tk−jizi)i∈{1,…,k−1}, where any (ji)i∈i∈{1,…,k−1}, can be equal to [math], so that for all v∈⟨Z3/(s,t)⟩, Tk−jv,Tk−iv∈Bv1, Z3 separates s∪w′+Tk−iv with t∪w′+Tk−jv, where w′=Tk−1w1+Tk−2w2+⋯+Twk−1+wk0+wk1+Tk−jk−1zk+1+Twk−1+⋯+Tk−j2z2+Tk−2w2k−2+Tk−1w2k−1+Tk−j1z1.
Proof.
Let w∈⟨Z1⟩ be given. Let Tk−jw,Tk−iw∈Bw1 where f∈ϕs′ witnesses that Tk−iw∈Bw1 and g∈ϕt′ witnesses that Tk−jw∈Bw1. Assume that i<j and f(w)∈FINh, g(w)∈FINh′. Consider the coloring c3:⟨Z1/w⟩→2 defined as follows.
[TABLE]
By the fact that we are in a topological Ramsey space, we get Z3≤Z1/w so that c3↾⟨Z3⟩ is constant. If the constant value is equal to one, then the conclusions of our claim are satisfied for w′=w. If the constant value is equal to zero we proceed as follows. We have assumed that i<j which implies that k−i>k−j. Add Tk−jzj to the left of Tk−jwj and notice that ϕs(w′+Tk−iv′)=ϕs(w+Tk−iv′) and ϕt(w′+Tk−jv′)=ϕt(w+Tk−jjv′).
Repeat that for all possible pairs Tk−jv,Tk−iv∈Bv1, to get w′ that satisfies the conclusions of our claim.
∎
Given s,t as above and Z1 so that c1↾[t,Z1]n+1=1. Pick a z′∈Z1/(s,t). If Z1 mixes s∪z′ with t∪z′ and supp(fi0)<mink, then for z0<z, we get w=Ti0z0+z′ so that ϕs(s∪z′)=ϕs(s∪w) and ϕt(t∪z′)=ϕt(t∪w).
Observe that Z1 separates s∪w with t∪w. This is due to the fact the equivalence class, induced by ϕs, of z′ is mixed with that of z′, induced by ϕt. Notice that since ϕt(t∪z′)=ϕt(t∪w), w and z′ are in the same equivalence class, induced by ϕt. If now Z1 mixes s∪w with t∪w it would imply that w is the same class with z′ contradicting that ϕs(s∪z′)=ϕs(s∪Tiz+z′).
We are going to construct a Z′∈[t,Z1] so that Z′ separates s with t. This gives us a contradiction, which would imply that the possibility c′↾[t,Z]n+1=0 does not occur.
Consider w∈Z1. In the case that Aw0=∅ by Claim 2 we get wˉ, so that for every i,j∈Fw0, Z1 separates s∪Tiwˉ+w′ with t∪Tjwˉ+w′, for all w′∈⟨Z1/wˉ⟩. By Claim 3 there exists Z2≤Z1 and w′, so that for every i,j, Tiw,Tjw∈Bw0, Z2 separates s∪Tjw′+v with t∪Tiw′+v′, for all v,v′∈⟨Z2/w′⟩. Notice that it might be the case that Cw′0=∅. In this case by an addition we get w~ so that Cw~0=∅. This addition does not ruin the conclusions of Claim 3 cause in the case that Z2 separates s∪Tiw′+Tiw+v with t∪Tjw+v and it also separates s∪Tiw′′+Tiw′+Tiw+v with t∪Tjw+v. Notice also that Claim 3 contributes only on at most ∣ϕs′∣ many levels of the staircase. If it contributes on all {1,…,k−1} levels, then ∣Aw0∣=1.
Set w0=w~. For s∪w0 there exists t∪v′∈[t,Z1/w0]n+1 so that Z1 mixes them. Conversely t∪w0 is mixed with s∪v. Let Z2 be the reduct of Z1 that avoids v,v′, i.e. v,v′∈/AZ1.
Suppose that we have constructed w0,…wn−1 and Zn with the property that Zn separates s∪w with t∪v for w,v∈⟨w0,…,wn−1⟩. Pick wn′∈Zn/wn−1. By Claim 2 we get wnˉ so that for every i,j∈Fwnˉ0, Zn separates s∪Tiwnˉ+v′ with t∪Tjwnˉ+v′, for all v′∈⟨Zn/wnˉ⟩. Next by Claim 3 we get wn′ so that Zn separates s∪Tiwn′+v′ with t∪Tjwn′+v′ for all Tjwn′,Tiwn′∈Bwn′0, v′∈⟨Zn/wn′⟩. Once more let wn~ be so that Cwn~0=∅. Set wn=wn~ and let Zn+1≤Zn so that Zn+1 avoids all v,v′∈⟨Zn/wn⟩ where Zn mixes s∪wn with t∪v, t∪wn with s∪v′ and t∪Tjw+wn with s∪v′, s∪Tjw+wn with t∪v, for Tjw∈Bw0, w∈⟨w0,…,wn−1⟩. In this way we built Z=(wn)n∈ω that separates s with t.
The case where Aw1=∅ is identical with the above, except that we are using Claim 2 and then Claim 4, instead of Claim 2 and then Claim 3.
Now suppose that ϕs and ϕt are so that for all w both Aw0=Aw1=∅. As a result we consider only Bw0=∅ and Bw1=∅. We start by picking w. Observation 1 gives us wˉ so that Z1 separates s∪wˉ with t∪wˉ. Then apply Claim 3 to get w0′ and Z1′≤Z1, so that for every Tjw0′,Tjw0′∈Bw0′0, Z1′ separates s∪Tiw0′+v with t∪Tjw0′+v, for all v∈⟨Z1′/w0′⟩. Next by Claim 4 we get w0′′ and Z1′′≤Z1′ so that Z1′′ separates s∪w0′′+Tiv with t∪w0′′+Tjv, for all v∈⟨Z1′′/w1~⟩, Tjv,Tiv∈Bv1. As above observe that it might be the case that Z1′′ mixes s∪w0′′ with t∪w0′′. In this case add Tk−i0z to w0′′ so that the resulting w0~ has the property that Z1′′ separates s∪w0~ with t∪w0~. Set w0=w0~. Let Z2≤Z1 that avoids v,v′∈⟨Z1′′⟩ where Z1′′ mixes s∪w0 with t∪v and t∪w0 with s∪v′.
Suppose that we have constructed w0,…wn−1 and Zn with the property that Zn separates s∪w with t∪v for w,v∈⟨w0,…,wn−1⟩. Pick w∈Zn/wn−1. By Observation 1 we get wˉ so that Zn separates s∪wˉ with t∪wˉ. By Claim 3 we get wn′ and Zn′ so that Zn′ separates s∪Tiwn′+w′ with t∪Tjwn′+w′, for all w′∈⟨Zn′/wn′⟩, Tjwn′,Tiwn′∈Bwn′0. Then by Claim 4 we get wn′′ and Zn′′ so that Zn′′ separates s∪wn′′+Tiv with t∪wn′′+Tjv for all v∈⟨Zn′′/wn′⟩, Tjv,Tiv∈Bv1. As we noticed above, it might be the case that Zn′′ mixes s∪wn′′ with t∪wn′′. Add Tk−i0z to wn′′, so that the resulting wn~ has the property they Zn′′ separates s∪wn~ with t∪wn~. Set wn=wn~. Let Zn+1≤Zn′′ so that it avoids all v,v′∈⟨Zn′′/wn⟩ where Zn′′ mixes s∪wn with t∪v, t∪wn with s∪v′ and s∪Tiw+wn with t∪v, t∪Tiw+wn with s∪v as well as s∪w+Tiwn with t∪v and conversely, for w∈⟨w0,…,wn−1⟩, Tiw∈Bw0, Tiwn∈Bwn1. Let Z=(wn)n∈ω. Then Z separates s with t.
As a result we have that c′↾[t,Z]=1. Therefore if X mixes s with t, then on ⟨Z⟩ we have that ϕs=ϕt. Proposition 2 tells us that this is in fact an if and only if statement.
Now we are in a position to define the inner map ϕ as follows
[TABLE]
Next we show that for every s,t∈F it holds that f(s)=f(t) if and only if ϕ(s)=ϕ(t).
Lemma 2**.**
The following are true for all Y≤X.
- (1)
Let s,t∈F^∖F. If ϕs=∅ and ϕt=∅, there exists w∈[s,X]∣s∣+1 so that X mixes t with s∪w with at most one equivalence class of [s,X]∣s∣+1.
2. (2)
If X separates s with t, then its separates s∪w with t∪v for all w∈[s,X]∣s∣+1 and v∈[t,X]∣t∣+1.
3. (3)
If s⊏t, s,t∈F and ϕ(s)=ϕ(t), then X mixes s with t.
Proof.
Suppose that X mixes t with s∪w, and also t with s∪v, and ϕs(w)=ϕs(v). By Lemma 1, we get that X mixes s∪w with s∪v, a contradiction.
Suppose that X separates s with t and there exists w∈[s,X]∣s∣+1 and v∈[t,X]∣t∣+1 so that X mixes s∪w with t∪v. This means that for every Y≤X there exists w′∈Fs∪w↾Y and v′∈Ft∪v↾Y so that f(s∪w∪w′)=f(t∪v∪v′). Therefore Y mixes s∪w∪w′ with t∪v∪v′, a contradiction to our assumption that X separates s with w.
Suppose now that s,t∈F, s⊏t and ϕ(s)=ϕ(t). This means that for all j∈[∣s∣,∣t∣], ϕrj(t)=∅, which, by an induction on n=[∣s∣,∣t∣], implies that s gets mixed by X with all the extensions of r∣s∣(t). In particular X mixes s with t.
∎
Lemma 3**.**
For s,t∈F^ if ϕ(s)=ϕ(t), then X mixes s with t. In particular if s,t∈F and ϕ(s)=ϕ(t), then c(s)=c(t).
Proof.
The proof is by induction on l<max(depthX(s),depthX(t)). For l=0, s∩r0(U)=t∩r0(X)=∅, so X mixes s∩r0(X) with t∩r0(X). Assume that X mixes s∩rl−1(X) with t∩rl−1(X) and consider s∩rl(X) and t∩rl(X). If s∩rl(X)=∅ and t∩rl(X)=∅, then we must have that ϕs∩rl(X)=∅. This implies that s∩rl(X) is mixed with s∩rl−1(X) which is mixed with t∩rl(X). Therefore s∩rl(X) is mixed with t∩rl(X). Similarly if s∩rl(X)=∅ and t∩rl(X)=∅.
∎
Lemma 4**.**
For s,t∈F^, s=t it doesn’t hold that ϕ(s)⊑ϕ(t).
Proof.
Suppose that there are s,t∈F^ with ϕ(s)⊏ϕ(t). Let j<ω be so that ϕ(s)=ϕ(rj(t)). There is at least one i∈ω,i>j so that ϕri(t)=∅. Assume that ϕrj(t)=∅, which implies that X mixes s with rj(t)∪v, for some v that belongs to the equivalence relation on [rj(t),X]j+1 induced by ϕrj(t). But then consider a reduct Y≤X that avoids v. Then Y separates s with rj(t), a contradiction.
∎
Lemma 5**.**
For s,t∈F, if c(s)=c(t), then ϕ(s)=ϕ(t).
Proof.
Let s,t∈F with c(s)=c(t). Then for every l<max(depthX(s),depthX(t)), X mixes s∩X(l) with t∩X(l). We show by induction that for all such an l it holds that ϕ(s∩X(l))=ϕ(t∩X(l)). For l=0 s∩X(0)=t∩X(0)=∅. Assume that ϕ(s∩X(l−1))=ϕ(t∩X(l−1)) and consider s∩X(l) and t∩X(l). Assume that s∩X(l)=∅ and t∩X(l)=∅. If ϕs∩X(l−1)=∅ then we must have that t=t∩X(l). If that was the case it will contradict the above lemma since ϕ(t)=ϕ(t∩X(l))⊏ϕ(s). Notice that X mixes s∩X(l−1) with t∩X(l−1), since ϕ(s∩X(l−1))=ϕ(t∩X(l−1)). This implies that ϕs∩X(l−1)=ϕt∩X(l−1). But s∩X(l)=∅, ϕs∩X(l−1)=∅ and t∩X(l)=∅, a contradiction.
∎
Obviously ϕ is an inner mapping, i.e. for every t∈F, ϕ(t)⊆t. Lemma 4 shows that is not the case that ϕ(s)⊑ϕ(t), for s=t. The fact that X mixes s with t if and only if for every s∪w∈[s,X]∣s∣+1 then for t∪w∈[t,U]∣t∣+1, X mixes s∪w with t∪w and ϕs(w)=ϕt(v) implies that ϕ(s)⊈ϕ(t).
Next we prove that ϕ is maximal among all other mappings representing f:F↾X→ω.
Lemma 6**.**
Suppose Y≤X and there is another ϕ′ map, satisfying that for all t0,t1∈F↾Y f(t0)=f(t1) if and only if ϕ′(t0)=ϕ′(t1). Then there exists Z≤Y so that for every s∈F↾Z ϕ′(s)⊆ϕ(s).
Proof.
By Corollary 2 and Proposition 1, we can assume that ϕ′ has the form of Definition 2. To see this, for any t∈F↾X, i<∣t∣, by Corollary 2 there exists X′∈[ri(t),X] so that for every s⊃ri(t), ϕ′(s)∩s(i)=g(s(i)), for g∈G, as in Definition 4. If this is done for an arbitrary t∈F↾X, by Proposition 1 we can assume that it holds for every t∈F↾X.
Pick t∈F↾Y. Let n=∣t∣. For i<n consider both ϕri(t)′ and ϕri(t). Consider the two coloring c′:[ri(t),Y]i+1→2, defined by
[TABLE]
There exists Z′≤[ri(t),Y] so that c′↾[ri(t),Z′]i+1 is constant and equal to one. Observe that we can only have for every extension v of ri(t), so that ri(t)∪v∈[ri(t),Z′]i+1, ϕri(t)′(v)⊆ϕri(t)(v). This is due to the fact that both ϕ′ and ϕ witness the same f↾(F↾⟨Y⟩). By Proposition 1, there exists Z≤Z′ that satisfies the conclusions of our proposition.
∎
This looks after the transitive case.
3. Non transitive mixing
We consider now the case when mixing from Definition 5 is not transitive. For every k, and a coloring f:F→ω, where F is a front, our definition of mixing says that X∈FINk[∞] mixes s with t, where s,t∈F^, if and only if for every Y≤X there are sˉ,tˉ∈F↾Y, so that s⊑sˉ, t⊑tˉ and f(sˉ)=f(tˉ). As the example in the last section illustrates, it might be the case that sˉ∖s,tˉ∖t are not in Y/(s,t). Therefore the mixing is not actually taking place on the ”tail” of X. As Lemma 1 demonstrates when the mixing is taking place on the ”tail” of X, then transitivity holds. This necessitates the introduction of the notion of weak mixing as follows.
Definition 6**.**
Let f:F→ω, where F is a front on X∈FINk[∞]. For s,t∈F^ we say that X weakly mixes s with t, if depthX(s)<depthX(t) and there exist wst∈t∖s so that for every Y≤X, [s,Y]=∅, [t,Y]=∅, there exists sˉ,tˉ∈F↾Y, t⊑tˉ, s∪wst+v⊑sˉ, for some v∈Y/wst, such that f(sˉ)=f(tˉ).
Notice that if X weakly mixes s with t, then X mixes s with t.
The very first instance of the above definition is the following case. Let F=AX2, s∈AX1 and ϕs=∅. Assume also that for a fixed w′∈X/s ϕw′=∅ and f(s∪w′)=f(w′∪v). As a consequence f(s∪w′)=f(w′∪v), for every v∈⟨X/w′⟩.
Observe that any Y≤X, so that both [s,Y]=∅ and [w′,Y]=∅, Y mixes s with w′, but ϕs=ϕw′. In fact in this case the mixing of s and w′ is already decided from the depthX(w′), and is irrelevant to the ”tail” of X. According to Definition 6 X weakly mixes s with w′ and wsw′=w′, v=∅. Observe that the above happens cause ϕw′=∅. If ϕw′=∅ then a reduct X′≤X would separate s with w′. Let c:AX1→2 defined by
[TABLE]
There exists Y≤X so that c↾AY1 is constant. On Y instances of s and w′ as above do not occur. Let F be a front of the form AXn, for n∈ω. Then by induction on n and a coloring as above, we can also assume that if X weakly mixes s and t then for every t∪v∈[t,X]∣t∣+1 there exists s∪wst+v′∈[s,X]∣s∣+1, v′=∅, so that X mixes t∪v with s∪wst+v′.
Next we observe the following.
Claim 5**.**
If s is weakly mixed by X with t and t is also weakly mixed with p, then X weakly mixes s with p as well and wst⊆wsp. Similarly in the case that X weakly mixes s with t, X mixes, not weakly, t with p, then X weakly mixes s with p and wst⊆wsp.
Proof.
In the first case, by definition, we have that depthX(s)<depthX(t)<depthX(p). Suppose X weakly mixes s with t, then for wst∈t∖s we have that for every Y≤X, compatible with both s,t, there exists sˉ,tˉ∈F↾Y where s∪wst⊑sˉ, t⊑tˉ and f(sˉ)=f(tˉ). Consider the coloring c:[t,X]∣t∣+1→2 defined by
[TABLE]
There is X0≤X so that c↾[t,X0]∣t∣+1=1. By a similar coloring we get a further reduct X1≤X0, wtp∈p∖t, so that every p∪v∈[p,X1]∣p∣+1 is mixed by X1 with
t∪wt+v′, for v′∈⟨X1/wtp⟩. Then X1 mixes s with p. If X1 mixes, but doesn’t mixes weakly, p with s, then we would have that for every v∈⟨X1/p⟩ there exists v′,v′′⟨X1/p⟩ so that X1 mixes p∪v with s∪v′ and p∪v with t∪wtp+v′′. As a result X mixes s∪v′ with t∪wtp+v′′, a contradiction. Therefore there exists wsp∈p∖s where for every v∈⟨X1/p⟩, there exists v′,v′′∈⟨X1/p⟩, so that X1 mixes p∪v with s∪wsp+v′ and p∪v with t∪wtp+v′′. This implies that wst⊆wsp and as a result wst⊆p∖s.
Now in the case that X mixes, but not weakly, t with p, then X mixes s with p. If s and p are mixed by X, not weakly, then we can assume that for every v∈⟨X1/p⟩, there exists v′,v′′⟨X1/p⟩ so that X mixes p∪v with both t∪v′′ and s∪v′, contradicting that s, t are weakly mixed. Therefore there exists wsp∈p∖s so that for every v∈⟨X1/p⟩, there exists v′,v′′∈⟨X1/p⟩, where X1 mixes p∪v with s∪wsp+v′ and p∪v with t∪v′′. As a result X1 mixes s∪wsp+v′ with t∪v′′ as well. This implies that wst⊆wsp⊆p∖s.
∎
The above claim shows the following. Let s,t∈F^∖F, ∣s∣=∣t∣=n, so that are weakly mixed by X, i.e. for every Y≤X there are extensions s∪wst⊏sˉ and t⊑tˉ, sˉ,tˉ∈F↾Y, so that f(sˉ)=f(tˉ). Any p∈F^∖F, ∣p∣=n, where there exists p⊑pˉ∈F↾X with f(sˉ)=f(tˉ)=f(pˉ), is so that wst⊆p∖s as well. Observe that wst is in the second part of the tuple s∪v, but on the first part of pˉ and tˉ. As a consequence f factors through addition. Therefore transitivity is ruined if and only if f factors through addition.
Define ϕ in this case as follows.
[TABLE]
where (gi)i∈n∈F, n<d−1 and we require that if lh=0, for some h<n, then i0=0. Obviously ϕ(t)⊆(Ti0ti0+⋯+Tiltil0,…,Tj0tj0+⋯+Tjmtjlm−1). Notice that the arguments in Lemmas 2−−6 hold identically with this ϕ as well.
Then (2) covers the case where the mixing is not transitive. As a result the proof of Theorem 2 is complete.