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.
Full text
Calculating the closed ordinal Ramsey number Rcl(ω⋅2,3)
We show that the closed ordinal Ramsey numberRcl(ω⋅2,3) is equal to ω3⋅2.
Key words and phrases:
Partition calculus, countable ordinals
2010 Mathematics Subject Classification:
Primary 03E02. Secondary 03E10
1. Introduction
For a set of ordinals J, denote the order-type of J by ord(J). For an ordinal α, denote [J]α={X⊆J∣ord(X)=α}. For a nonzero cardinal κ, a natural number n, and ordinals β and αi for all i∈κ, we write
[TABLE]
to mean that for every colouring c:[β]n→κ of subsets of β of size n in κ many colours, there exist some i∈κ and X⊆β such that ord(X)=αi, X is closed in its supremum, and [X]n⊆c−1({i}). Should such an ordinal exist, let Rcl(αi)i∈κn denote the least ordinal β for which the statement β→cl(αi)i∈κn holds. We call Rcl(αi)i∈κn the closed ordinal Ramsey number of (αi)i∈κn. When n is omitted, by convention n=2.
For a history of partition relations and Rado’s arrow notation see [HL10]. The ordinal partition calculus was introduced by Erdős and Rado in [ER56]. Topological partition calculus was considered by Baumgartner in [Bau86]. Baumgartner’s work was continued in recent papers on topological (closed) ordinal partition relations by Caicedo, Hilton, and Piña [Pn15],[Hil16],[CH17].
Caicedo and Hilton proved recently that ω2⋅3≤Rcl(ω⋅2,3)≤ω3⋅100 [CH17, Theorem 8.1] and provided also the upper bound Rcl(ω2,k)≤ωω for every positive integer k [CH17, Theorem 7.1]. The lower bound Rcl(ω2,k)≥ωk+1 is a consequence of [CH17, Theorem 3.1].
In this paper we calculate the exact value Rcl(ω⋅2,3)=ω3⋅2. In a subsequent paper we will show that Rcl(ω2,3)=ω6.
1.1. Description of proof
In order to prove Rcl(ω⋅2,3)≤ω3⋅2, we must show that for each colouring c:[ω3⋅2]2→2 with no homogeneous triples of colour 1, there is some homogeneous Y∈[ω3⋅2]ω⋅2 of colour 0, closed in its supremum. However, the first part of the proof is the canonization of any finite pair-colouring of an ordinal less than ωω.
We show first that for each δ<ωω,k∈\mathdsN and pair-colouring c:[δ]2→k, there exists some X⊆δ, closed in its supremum with ord(X)=δ, such that c↾[X]2 is a canonical colouring (Definition 3.10). A canonical colouring is one such that for “most” {α,β}∈[δ]2, the value c({α,β}) depends only on the Cantor-Bendixson ranks of the points α,β in the topological space δ, and on the Cantor normal form of δ. Canonical colourings will also be used in a future paper in the proof of Rcl(ω2,3)=ω6.
The bound Rcl(ω⋅2,3)≤ω3⋅2 is achieved by a combinatorial analysis of canonical colourings in two colours, and the following simple lemma on finite sets:
Lemma 1.1**.**
Whenever F⊆Fin(\mathdsN) is an infinite ⊆-antichain, there exists an infinite set {Ai:i<ω}⊆F and points {ki:i<ω}⊆\mathdsN such that ki∈Ai∖⋃j=iAj.
Proof.
First, for every countably infinite collection {Ai:i<ω} of distinct finite subsets of \mathdsN, there is some infinite I⊆ω and sets {Xi:i∈I} such that Ai∩Aj=Xi for all i,j∈I such that i<j: we define sets Bn and natural numbers in such that
(1)
B0=ω
2. (2)
in=minBn
3. (3)
Bn+1⊆{i∈Bn∣i>in} is infinite and Ain∩Aj is constant for all j∈Bn+1.
Point 3 is gotten by applying the pigeonhole principle, as Ain is finite and Bn is infinite. Thus Xin=⋂k≥nAik, and hence m<n⟹Xm⊆Xn.
Given an infinite ⊆-antichain F⊆Fin(\mathdsN), we may assume by shrinking it, that it is as above for some enumeration F={Ai}i∈ω. Let Yi=Ai∖Xi. Since F is an antichain, Yi=∅. Moreover, for distinct i,j it holds that Yi∩Aj⊆Xmin{i,j}⊆Xi. This implies that Yi is disjoint from Aj for every i=j. Now choose ki∈Yi arbitrarily.
∎
The bound Rcl(ω⋅2,3)≥ω3⋅2 is achieved by describing a single colouring c:[ω3⋅2]2→2 such that for each θ<ω3⋅2, the colouring c↾[θ]2 demonstrates Rcl(ω⋅2,3)>θ.
2. Preliminaries
For every nonzero ordinal α there exist a unique nonzero k∈\mathdsN and a unique sequence of ordinals β1≥...≥βk such that
[TABLE]
Also, there exist a unique l∈\mathdsN, a sequence of ordinals γ1>⋯>γl, and a sequence of nonzero natural numbers m1,…,ml such that
[TABLE]
These representations of α are two variations of the Cantor normal form of an ordinal α. Here, we shall refer to the first as the Cantor normal form. The Cantor-Bendixson rank111This is the Cantor-Bendixson rank of α as a point in the space of ordinals (CB rank) of α is βk (which is equal to γl), and is denoted by CB(α). We also denote L(α)=ml. For the ordinal α=0, see the following remark.
Remark**.**
We wish to consider CB(α) and L(α) for every ordinal α, but these values do not naturally make sense for [math]. We solve this for α=0 by either omitting [math] completely, or arbitrarily setting CB(0)=0 and L(n)=n+1 for each n∈ω, virtually omitting [math].
Beside the ordinary ≤ order relation on ordinals, we endow the ordinals with an anti-tree ordering <∗⊆≤. By anti-tree, we mean that {β∣α<∗β} is well-ordered by <∗ for all α. This is the same ordering <∗ presented in section 8 of [CH17].
We say that β<∗α whenever α=β+ωγ for some nonzero ordinal γ with γ>CB(β). Equivalently, for some γ>CB(β), α is the least ordinal of CB rank γ with β≤α. We write β⊲∗α if α is the unique immediate successor of β in <∗. A graphical representation of <∗ on ω3⋅2 can be found in Figure A at the end of the paper.
Notation**.**
Let α be some ordinal.
•
Denote T(α)={α}∪{β∣β<∗α} and T=n(α)={β<∗α∣CB(β)=n}.
•
Assuming CB(α)=γ+1 is a successor ordinal, denote
[TABLE]
Equivalently, Fan−(α)={α+ωγ⋅(i+1)∣i∈ω}. Letting α be the unique ordinal such that α⊲∗α, denote
[TABLE]
the unique set of the form Fan−(β) of which α is a member.
Let I be a set of ordinals.
•
Denote by ρI the unique order preserving bijection from I onto ord(I).
•
Write J⊆cofI to mean that J is a cofinal subset of I.
From here onwards, all ordinals are assumed to be smaller than ωω.
2.1. Skeletons
The following is the main notion we use in thinning out arguments.
Definition 2.1**.**
Let δ<ωω be an ordinal. We say that I⊆δ is a skeleton of δ if:
(S1)
I is closed in δ in the order topology;
2. (S2)
ord(I)=δ;
3. (S3)
α<∗β if and and only if ρI(α)<∗ρI(β), for all α,β∈I.
For an arbitrary set of ordinals J, we say that I⊆J is a skeleton of J if ρJ[I] is a skeleton of ord(J). Write I⊆skJ.
Definition 2.2**.**
For each n∈\mathdsN, write I⊆nskJ and say that I is an n-skeleton of J if I⊆skJ and
[TABLE]
Informally, if a fan was not removed entirely in the transition from J to I, then its first n elements were not removed. Note that the relation ⊆0sk is in fact ⊆sk and that ⊆msk implies ⊆nsk whenever m>n.
Observation 2.3**.**
For every natural n, the relation ⊆nsk is transitive.
Definition 2.4**.**
Let δ be an ordinal with Cantor normal form
[TABLE]
For β<δ define CNFδ(β) to be the least i such that β≤ωγ1+⋯+ωγi.
Define CCδ(i)={β<δ∣CNFδ(β)=i}. Explicitly, CCδ(i) is the collection of β<δ such that ∑j=1i−1ωγj<β≤∑j=1iωγj.
Define kδ=k, the number of non-empty components in this decomposition of δ.
The following observation is a straightforward unravelling of the definitions. Note that, by definition, ρI is a <∗-isomorphism.
Observation 2.5**.**
If I⊆skδ for an ordinal δ<ωω, then for every α∈I we have CNFδ(α)=CNFδ(ρI(α)) and CB(α)=CB(ρI(α)).
For the remainder of this section, fix some ordinal δ<ωω.
Observation 2.6**.**
The collection {CCδ(i)∣1≤i≤kδ} is a partition of δ into kδ closed subsets of δ. Moreover, CCδ(kδ) is of order type ωγkδ, and for every i<kδ, the set CCδ(i) is either a singleton (when γi=0) or of order type ωγi+1.
The following lemma follows directly from the definitions and the uniqueness of the Cantor normal form.
Lemma 2.7**.**
Let I⊆δ. Then I⊆nskδ if and only if I∩CCδ(i)⊆nskCCδ(i) for every 1≤i≤kδ. ∎
The following is a way of ensuring an infinite successive thinning out to skeletons is a skeleton.
Definition 2.8**.**
Let γ be some ordinal. For each i<γ, let Ii⊆δ. We say that the collection {Ii:i<γ} is fan preserving if whenever α≤γ is a limit ordinal and β<δ is such that Fan(β)∩Ii is infinite for all i<α, then Fan(β)∩⋂i<αIi is infinite.
Lemma 2.9**.**
Let k be some positive integer. Let {Ii:i<γ} be a fan preserving collection of n-skeletons of ωk+1. Then I=⋂i<γIi is an n-skeleton of ωk+1.
Proof.
By induction on k. Every skeleton of ωk+1 must contain the point ωk and so ωk∈I. Additionally, every skeleton intersects infinitely with Fan−(ωk). By fan preservation, Fan−(ωk)∩I is infinite, and contains the first n elements of Fan−(ωk).
Enumerate Fan−(ωk)∩I={βi:i<ω}. For every α<γ, we have T(βi)∩Iα⊆nskT(βi). The collection {T(βi)∩Iα}α<γ of n-skeletons of T(βi)≅ωk−1+1 is fan preserving. By the induction hypothesis T(βi)∩I is an n-skeleton of T(βi). Thus,
[TABLE]
is an n-skeleton of ωk+1.
∎
Corollary 2.10**.**
Let γ be some ordinal. Whenever {Ii:i<γ} is a fan preserving collection of n-skeletons of δ, then I=⋂i<γIi is an n-skeleton of δ. ∎
Lemma 2.11**.**
Let {Ii:i<γ}, for some ordinal γ, and assume that there is some σ:γ→\mathdsN with finite fibers (that is ∣σ−1[{n}]∣<∞ for each n∈\mathdsN) such that Iα⊆σ(α)sk⋂i<αIi for all i<γ. Then {Ii:i<γ} is a fan preserving collection of skeletons of I0.
Proof.
By induction on γ. Let α≤γ be a limit ordinal such that {Ii}i<j is fan preserving for every j<α. By Corollary 2.10, Ij⊆skI0 for every j<α.
Let β be such that Fan(β)∩Ii is infinite for all i<α. For an arbitrary n∈\mathdsN, let in<α be maximal such that σ(in)≤n. By an induction argument on j, Ij⊆nskIin for every in<j<α. Thus, ∣Fan(β)∩Iα∣≥n for any n∈\mathdsN.
∎
2.2. The sets F(ωk)nr
We will thin out colourings using families of skeletons as in the statement of Lemma 2.11. This compromise prevents us from controlling the colouring on entire sets of the form T=n(α), but it allows us to control it on “large” sets of a specific form.
Let k,r∈\mathdsN. We recursively define a set F(ωk)nr⊆T=n(ωk) for each n≤k (see Figure 1)
[TABLE]
An equivalent non-recursive definition, when n<k, is:
[TABLE]
Note that F(ωk)n0=T=n(ωk).
We extend the definition to an arbitrary α<ωω. Denote k=CB(α). Observe that T(α)≅ωk+1 and define
[TABLE]
Definition 2.12**.**
Fix some α<ωω and n≤CB(α). Define
[TABLE]
Example 2.13**.**
As an instructive example, the set
[TABLE]
is not an element of F(ω2)0.
Observation 2.14**.**
For a fixed n, the set F(α)n is closed under finite intersections. This is due to the fact F(α)nr⊆F(α)ns, whenever r<s. The set F(α)n is the filter on T=n(α) generated by {F(α)nr}r∈\mathdsN.
Observation 2.15**.**
Let δ<ωω be an ordinal, let I⊆skδ and let α∈I. Then ρI[F∩I]∈F(ρI(α))nr, for any F∈F(α)nr.
Observation 2.16**.**
Let θ<ωω be some ordinal and let A⊆T=n(θ) for some n≤CB(θ). Then for any n≤k≤CB(θ), A∈F(θ)nr if and only if
[TABLE]
Corollary 2.17**.**
Let θ be some ordinal and let l1<⋯<lk<CB(θ) and A1,…,Ak be such that Ai∈F(θ)li. Then there exists some X⊆⋃n=1kAn closed in its supremum with ord(X)=ωk. Moreover, X can be chosen such that ρX[X∩F]∈F(ωk)i for any 1≤i≤k and F∈F(θ)li.
Proof.
By induction on k. Choose some B={br:r<ω} with ord(B)=ω such that br∈F(θ)lkr. Let
[TABLE]
By the above lemma Ci∈F(θ)k, and so we have that Ak∩⋂i=1k−1Ci∈F(θ)lk. Denote this set by Ak. For each α∈Ak, by induction hypothesis, choose some Xα⊆⋃i=1k−1(T(α)∩Ai) closed in its supremum with ord(Xα)=ωk−1. Then X=⋃α∈A∩BXα is closed in its supremum with ord(X)=ωk.
∎
3. Reducing a finite pair-colouring to a canonical colouring
For this section fix some ordinal δ<ωω and some positive integer n.
Definition 3.1**.**
Let c:δ→n be some colouring. For r∈\mathdsN, say that c is r-good if for every θ<δ and l<CB(θ), there is some colour c<n such that
[TABLE]
Say that I⊆skδ is r-good with respect to c, if c∘ρI−1 is r-good.
Lemma 3.2**.**
Let c:δ→n be some colouring. Then for any r∈\mathdsN there exists some I⊆rskδr-good with respect to c.
Proof.
By Lemma 2.7, we may assume δ=ωk+1+1 for some k∈\mathdsN. We prove by induction on k.
For i∈\mathdsN, denote Ti:=T(ωk⋅(i+1)). Considering c↾Ti as a colouring of ωk+1, by the induction hypothesis there is some r-good Si⊆rskTi. Since Si is r-good, let fi:k+1→n be the function mapping m to the colour assigned to a large set of α∈Si with CB(α)=m. By the pigeonhole principle, there is an infinite subset B⊆\mathdsN such that fi=fj for all i,j∈B. Let B′=B∪\mathdsN<r and take I={ωk+1}∪⋃i∈B′Si. By construction we have that I⊆rskδ and r-goodness follows by Observation 2.16.
∎
Definition 3.3**.**
Let c:[δ]2→n be some colouring.
Say that c is normal if whenever β1,β2<δ, β1<∗β2, the value c({β1,β2}) depends only on CB(β1), CB(β2) and CNFδ(β2). Namely, there is a function c^, independent of β1,β2, such that
[TABLE]
Say that I⊆skδ is normal with respect to c if c∘ρI−1 is normal.
Notation**.**
For a pair-colouring c:[X]2→n and an element α∈X, write cα for any colouring cα:X→n assigning cα(β)=c({α,β}) to every β∈X∖{α}.
Lemma 3.4**.**
Let c:[δ]2→n be some pair-colouring. Then there exists I⊆skδ normal with respect to c.
Proof.
By Lemma 2.7, it suffices to prove for δ=ωk+1 for k∈\mathdsN. We thin out ωk+1 inductively.
Assume that for every α with CB(α)=m, there exists a function fα such that for every β1,β2∈T(α) with β2<∗β1, we have c({β1,β2})=fα(CB(β1),CB(β2)). We replace ωk+1 with a skeleton J, such that the assumption holds for m+1 with respect to c↾[J]2.
Let α be an ordinal with CB(α)=m+1 and enumerate Fan−(α)={γi:i<ω}. By the pigeonhole principle, we may assume that fγi is constant with i, and denote it by f. Consider the colouring cα:T(α)→n and choose some [math]-good Iα⊆skT(α) as in Lemma 3.2. Let g:m→n be the function defined g(i)=cα(β), where β is any β∈Iα with CB(β)=i. So for every β1,β2∈I with β2<∗β1 we have
[TABLE]
Replacing T(α) with Iα for each α with CB(α)=m+1 gives us a skeleton as we seek.
Iterating this process until the stage m=k leaves us with I⊆skωk+1 as described in the statement of the Lemma.
∎
Definition 3.5**.**
Let c:[δ]2→n be some pair-colouring. For α<δ and r∈\mathdsN, if cα is r-good, say that α is r-good for c. Say that α is good for c whenever α is r-good for c for some natural r.
For I⊆skδ, α∈I, say that α is (r-)good with respect to I for c if ρI(α) is (r-)good for cα∘ρI−1.
Observation 3.6**.**
If J⊆skI⊆skδ and α∈J is r-good with respect to I for c, then α is r-good with respect to J for c.
Lemma 3.7**.**
Let c:[δ]2→n be some pair-colouring. Then there exists some I⊆skδ such that every α∈I is good with respect to I for c.
Proof.
Fix some injection σ:δ→ω. We construct inductively {Iα:α<δ} such that
(1)
I0=δ
2. (2)
Iα⊆σ(α)sk⋂β<αIβ;
3. (3)
α is good with respect to Iα for c.
By Lemma 2.11 and Corollary 2.10, I=⋂α<δIα will be a skeleton as we seek.
Let α<δ and assume that Iγ was constructed as above for all γ<α. Let Jα=⋂γ<αIγ, a skeleton of δ by Lemma 2.11 and Corollary 2.10. Using Lemma 3.2, let Iα⊆σ(α)skJα be σ(α)-good with respect to cα.
∎
Definition 3.8**.**
Let c:[δ]2→n be some pair-colouring. Let α be good for c and denote iα=CNFδ(α).
•
For every iα=m≤kδ, let ϵm=supCCδ(m). For each m=iα and l<CB(ϵm), define tα(m,l) to be the unique colour for which
[TABLE]
Call tα the goodness function of α for c.
Definition 3.9**.**
Let c:[δ]2→n be some pair-colouring. We say that c is uniformly good if
•
Every α∈I is good with respect to I for c.
•
For any α<δ, the goodness function of α depends only on CNFδ(α) and CB(α). Namely, there is a function c, independent of α, such that
[TABLE]
For I⊆skδ, say that I is uniformly good with respect to c if c∘ρI−1 is uniformly good.
Notation**.**
For a function c as in the above definition we abuse notation and write
[TABLE]
where α<δ is such that CNFδ(α)=i1 and CB(α)=j1.
Definition 3.10**.**
Let c:[δ]2→n be some pair-colouring. We say that I⊆skδ is canonical with respect to c if I is normal and uniformly good with respect to c.
We say that c is canonical, if δ itself is canonical with respect to c.
Proposition 3.11**.**
Let c:[δ]2→n be some pair-colouring. Then there exists some I⊆skδ canonical with respect to c.
Colour each element of J by its goodness function with respect to J for c. Exercising Lemma 3.2, choose some J′ such that tα depends only on CNFδ(α) and CB(α). Now use Lemma 3.4 on J′ to receive a skeleton I.
∎
For the purpose of calculating bounds on closed ordinal Ramsey numbers, the above proposition allows us to assume every pair-colouring of δ in finitely many colours is canonical.
4. Colouring in two colours
For this section fix some ordinal δ<ωω.
There is a natural one-to-one correspondence between pair-colourings c:[δ]2→2 and graphs G=(δ,E), given by the rule (α,β)∈E⟺c({α,β})=1.
We say that a graph on δ is canonical if its corresponding colouring is canonical.
Let G=(V,E) be a graph. For v∈V, denote N(v)={u∈V∣(v,u)∈E}. For U⊆V, denote N(U)=⋃v∈UN(v). We say that a set of vertices U⊆V is a clique if [U]2⊆E and that it is independent if [U]2∩E=∅.
When the context is clear, we use graph and colouring terminology interchangeably. When colouring with colours {0,1}, we will always think of 1 as the edge colour and of [math] as the non-edge colour.
Definition 4.1**.**
Let G=(δ,E) be some graph on δ. Let A,B⊆δ be infinite, disjoint and without maxima.
•
Write A⊥B to mean that for all X, if X⊆cofA, then B∖N(X) is finite.
•
Write Aω⊥B if A⊥B and in addition N(a)∩B is finite for every a∈A.
Note that if A⊥B then A0⊥B0 for every A0⊆cofA and B0⊆B.
Lemma 4.2**.**
Let G=(δ,E). Let A,B⊆δ be such that Aω⊥B. Then there is some A0⊆cofA and some B0⊆B, cofinite in B, such that N(b)∩A0 is cofinite in A0, for all b∈B0.
Proof.
We may assume ord(A)=ω by thinning out to a cofinal subset. We thin out A so either N(a)∩B is constant for all a∈A, or N(a)∩B=N(b)∩B for all distinct a,b∈A. Since A⊥B, the latter must hold. Consider F={N(a)∩B∣a∈A} as a partially ordered set under inclusion. By Ramsey’s theorem, in (F,⊆) there exists either an infinite chain or an infinite antichain.
Suppose first that there exists some infinite ⊆-antichain C⊆F. By Lemma 1.1 we choose {ai}i∈ω⊆A and {bi}i∈ω⊆B such that bi∈N(ai)∖N({aj}j=i). Then for X={a2i}i∈ω, the set B∖N(X) is infinite, contradicting A⊥B. Thus, there is some infinite A0⊆A such that {N(a)∩B∣a∈A0} is a chain in (F,⊆). Let B0=N(A0)∩B, which by A⊥B is cofinite in B. For every b∈B0, since b is an element of the well-ordered ascending union ⋃a∈A0N(a)∩B, it must be that b∈N(a) for cofinitely many a∈A0.
∎
4.1. Canonical triangle-free graphs
We say that a graph G=(V,E) is triangle-free if N(v) is independent for every v∈V. For the remainder of this section, fix some canonical triangle-free G=(δ,E) with corresponding colouring c:[δ]2→2.
Notation**.**
For every i≤kδ and j≤CB(supCCδ(i)) denote
[TABLE]
Lemma 4.3**.**
If there exists no independent X⊆δ closed in its supremum with ord(X)=ω2, then the following statements hold
(1)
For fixed i,j, there is at most one l such that c^(i,j,l)=1.
2. (2)
For fixed i1,i2,j, there is at most one l such that c(i1,j;i2,l)=1.
3. (3)
For fixed i1,i2,l, there is at most one j such that c(i1,j;i2,l)=1.
Proof.
Proof of (1):
Assume to the contrary that l1<l2 are such that c^(i,j,lr)=1. Let α∈Lji. Then T=l1(α)∪T=l2(α)⊆N(α). Thus, the set T=l1(α)∪T=l2(α) is independent, and by Corollary 2.17 contains a copy of ω2.
Proof of (2):
Assume to the contrary that l1<l2 are such that c(i1,j;i2,lr)=1. Choose arbitrarily some α∈Lji1 and denote θ=supCCδ(i2). Let Fr=N(α)∩T=lr(θ) and note Fr∈F(γ)lr. Then F1∪F2 is an independent set, and by Corollary 2.17 contains a copy of ω2.
Proof of (3):
Assume to the contrary that j1<j2 are such that c(i1,jr;i2,l)=1. Denote θr=supCCδ(ir). For any α1,α2∈T=j1(θ1)∪T=j2(θ1), by assumption N(α1)∩N(α2)∩T=l(θ2)∈F(θ2)l. So by triangle-freeness {α1,α2}∈/E. Thus, T=j1(θ1)∪T=j2(θ1) is an independent set, which contains a copy of ω2 by Corollary 2.17.
∎
Lemma 4.4**.**
Let B∈F(γ)n for some γ≤δ. Then there exists some B0⊆cofB such that whenever A⊆δ is such that A⊥B and N(a)∩B∈/F(γ)n for each a∈A, it is also the case that Aω⊥B0.
Proof.
For each r∈ω, choose arbitrarily some βr∈F(γ)nr and let B0={βr:r<ω}. Let A be as in the statement. By canonicity, for any α∈A we have B∖N(α)∈F(γ)ns for some s and therefore βr∈/N(α) for all r>s. Thus, N(α)∩B0 is finite. As B0⊆B, we have that Aω⊥B0.
∎
Lemma 4.5**.**
Let C⊆δ. Assume there are some γ<δ, l1<l2<CB(γ) and Fi∈F(γ)li such that C⊥Fi and N(c)∩F2∈/F(γ)l2 for every c∈C. Then for every θ<ω2, there is some independent, closed in its supremum, X⊆F1∪F2⊆δ with ord(X)=θ.
Proof.
By Observation 2.16, we may thin out F2 so that T=l1(β)∩F1∈F(β)l1, for all β∈F2.
By thinning out C to a cofinal subset, we may assume ord(C)=ω. By Lemma 4.4 there is some A2⊆cofF2 with Cω⊥A2. By Lemma 4.2, we may assume that N(β)∩C is cofinite in C for each β∈A2. Without loss of generality, assume ord(A2)=ω and enumerate A2={βi:i<ω}.
Let n∈ω be arbitrary, we find in δ an independent copy of ω⋅(n+1). The set C∩⋂i=02nN(βi) is cofinite in C, so without loss of generality equal to C. For each c∈C, let Ic={i<2n+1∣N(c)∩T=l1(βi)∈F(βi)l1}. By the pigeonhole principle we may assume I:=Ic is constant for all c∈C.
If ∣I∣>n, choose some α∈C, and for each i∈I some Xi⊆cofN(α)∩T=l1(βi)∩F1 with ord(Xi)=ω. Conclude that ⋃i∈I(Xi∪{βi}) contains an independent copy of ω⋅(n+1).
Then assume ∣I∣≤n, and without loss of generality {0,…,n}∩I=∅. For each i≤n, let B0i⊆cofT=l1(βi)∩F1 be as guaranteed by Lemma 4.4. As C⊥T=l1(βj)∩F1 for all j<ω, for i∈/I we have Cω⊥B0i. Iterating Lemma 4.2, construct a descending chain C⊇C0⊇C1⋯⊇Cn of infinite sets such that N(α)∩Ci is cofinite in Ci for cofinitely many α∈B0i. Without loss of generality, for every α∈⋃i≤nB0i the set N(α)∩Cn is cofinite in Cn. Then for any α1,α2∈⋃i=0n(B0i∪{βi}), the sets N(α1),N(α2) intersect in a cofinite subset of Cn. So ⋃i=0n(B0i∪{βi}) is an independent set containing a copy of ω⋅(n+1).
Since n was chosen arbitrarily, we find an independent copy of any θ<ω2.
∎
5. Proof of the theorem
For this section, it is helpful to use Appendix A. Fix δ=ω3⋅2 and write Lji={α∈CCδ(i)∣CB(α)=j}.
Proposition 5.1**.**
Rcl(ω⋅2,3)≤ω3⋅2**
Proof.
Assume that the statement is false. Let c:[δ]2→2 contradict the statement and let G=(δ,E) be the triangle-free graph corresponding to c. By Proposition 3.11 we may assume that c is canonical.
By item 1 of Lemma 4.3, there are j1<j2<3 such that ω3∈/N(Lj11∪Lj21). By item 2, there are l1<l2<3 such that c(1,3;2,l1)=c(1,3;2,l2)=0, and by thinning out to a skeleton we may assume ω3∈/N(Ll12∪Ll22).
Assume for a moment that Ljt1⊥Lls2 for every t,s∈{1,2}. By Lemma 4.5 it is impossible that c(1,jt;2,l2)=0. So c(1,j1;2,l2)=c(1,j2;2,l2)=1 in contradiction to item 3 of Lemma 4.3.
Let, then, t,s∈{1,2} be such that Ljt1⊥Lls2. Let X1⊆cofLjt1 be such that X2:=Lls2∖N(X1) is infinite. By Ramsey’s theorem and triangle-freeness, each Xi contains an infinite independent set. We conclude that X1∪{ω3}∪X2 contains an independent copy of ω⋅2 closed in its supremum, contradicting our assumption.
∎
Proposition 5.2**.**
Rcl(ω⋅2,3)≥ω3⋅2**
Proof.
We define a (canonical) triangle-free graph G=(δ,E) such that the induced subgraph on any θ<δ does not contain an independent closed copy of ω⋅2. Appendix B is a schematic representation of G. The dashed and dotted lines in the figure imply the ⊥ relation between the circled set more to the left-hand side and the circled set (or sets) more to the right-hand side.
We use the notation
[TABLE]
We define E so that c^(i,j+1,j)=1 for all i,j.
In our notation,
[TABLE]
We list the sets of edges that imply c(i1,j1;i2,j2)=1:
[TABLE]
Lastly, we list sets of edges that imply ⊥ while c(i1,j1;i2,j2)=0:
[TABLE]
In the last list, for E1,11,0 and E2,12,0 we do not use the equality sign in order to accommodate edges whose existence was declared previously. We let E be minimal under inclusion and fulfilling our stated requirements.
Claim 1.G=(δ,E) is triangle-free
Proof.
Note that Lji is independent for all i,j.
Assume {ω3,α,β} is a triangle with α<β. Then it must be that α∈L21 and β∈L02. But then, it cannot be that {α,β}∈E. So ω3 takes no part in a triangle.
Consider γ∈L21. Assume T={α,β,γ} is a triangle with α<β. Looking at N(L21), it must be that T⊆CCδ(1). Since ω3∈/T it must be that {CB(α),CB(β)}={0,1}. Since E1,01,1=∅, we have CB(α)=0 and CB(β)=1. Since E1,11,2=∅ we have that (β,γ)∈E1,21,1, implying β<∗γ and α<β<γ. From (α,γ)∈E1,21,0 we get α<∗γ and so α<∗β. So
[TABLE]
with the restrictions (k′−1)−k<l and (k+1)+l<k′ coming from (α,β)∈E1,11,0 with α<∗β and (α,γ)∈E1,21,0 respectively. These two inequalities are contradictory, so γ cannot take part in a triangle.
Consider β∈L11. Assume {α,β,γ} is a triangle with α<γ. We already have enough to guarantee that there are no triangles within CCδ(1). So γ∈CCδ(2) and in particular (β,γ)∈E2,11,1. This leaves no other option but (α,β)∈E1,11,0.
So
[TABLE]
with the restrictions k+l<l′′ and l′′<k′ coming from (α,γ)∈E2,11,0 and (β,γ)∈E2,11,1 respectively, which gives k+l<k′. As k′=k+1, it cannot be that α⊲∗β. Thus, we have the additional restriction k′−k<l from (α,β)∈E1,11,0. This again is contradictory, and so β takes no part in a triangle.
Consider β∈L22. Assume {α,β,γ} is a triangle with α<γ. It must be that α<β<γ, α⊲∗β and γ∈L02. But E2,02,1=∅, and so (α,γ)∈E cannot happen, contrary to our assumption.
Finally, assume {α,β,γ} is a triangle with α<β<γ. The only possibility left is α∈L01, β∈L02, γ∈L12. So
[TABLE]
with l′<l coming from (α,β)∈E2,01,0 and k+l<l′′ coming from (α,γ)∈E2,11,0. If β⊲∗γ, then l′′=l′+1, leading to k+l<l′+1<l+1 which is impossible. So this is not the case, and we get the extra restriction l′′<l′ from (β,γ)∈E2,12,0. This gives us k+l<l′<l in contradiction. All possibilities have been exhausted, and so there are no triangles in G.
∎
Claim 2. Every independent copy of ω⋅2 contained in G, which is closed in its supremum, is cofinal in δ.
Proof.
Let W:=A∪{τ}∪B⊆δ be an independent set with A<τ<B, ord(A)=ord(B)=ω and τ=supA. Assume for the purpose of a contradiction that W⊆θ for some θ<δ. Without loss of generality, let θ=ω3+ω2⋅n for some natural n. For i,j denote L(θ)ji={α∈CCθ(i)∣CB(α)=j}.
By the pigeonhole principle, we may assume that A⊆cofT=jA(τ) for some jA<CB(τ), and B⊆L(θ)lBiB for some iB≤kθ, lB<CB(supCCθ(iB)). Fix such jA,iB,lB. We proceed by eliminating where τ can potentially reside.
As τ is a limit ordinal, CB(τ)>0. Since Fan−(τ)×{τ}⊆E, it also must be that CB(τ)>1 and jA<CB(τ)−1.
Assume τ∈L(θ)31, that is, τ=ω3. Then clearly iB>1, lB=1. For every α∈L(θ)01 the set L(θ)1iB∖N(α) is finite, so jA=0. Also, L(θ)11ω⊥L(θ)1iB, and so jA=1. This contradicts jA<CB(t)−1=2, and so τ∈/L(θ)31. Thus, it must be that CB(τ)=2 and jA=0.
Assume τ∈L21. Note the following:
•
{α>τ}∩L(θ)01⊆N(τ);
•
{α>τ}∩L(θ)11⊆N(A);
•
L(θ)21∖N(α) is finite for every α∈A.
The three listed items guarantee that iB>1. However, for each i>1 note that
•
L(θ)0i⊆N(A);
•
L(θ)1i∖N(α) is finite for every α∈A.
So it cannot be that lB∈{0,1}, a contradiction.
So the only option is that τ∈L(θ)2i for some 1<i≤kθ. We now observe that for each i′>i
•
L(θ)0i′⊆N(τ);
•
L(θ)1i′⊆N(A).
prohibiting lB=0 or lB=1, and therefore the existence of lB. We conclude that there is no θ as we had assumed.
∎
By the claims, taking the induced colouring on any θ<ω3⋅2 demonstrates that θ→cl(ω⋅2,3)2.
∎
This research stemmed from conversations of the author with Jacob Hilton at the 8th ”Young Set Theory” workshop in Jerusalem, October 2015. I thank Hilton for introducing me to the subject matter of this paper, and choosing the right riddles to get me hooked. I also thank the workshop’s organizers and the Israeli Institute of Advanced Studies (IIAS) for providing such a stimulating environment.
I would also like to thank Bill Chen, Jacob Hilton, Menachem Kojman, Nadav Meir and Thilo Weinert for providing valuable feedback on early versions of this paper.
The research was partially supported by ISF grant No. 181/16 and 1365/14.
Bibliography6
The reference list from the paper itself. Each links out to its DOI / PubMed record.
1[Bau 86] James E. Baumgartner. Partition relations for countable topological spaces. J. Combin. Theory Ser. A , 43(2):178–195, 1986.
2[CH 17] Andrés Caicedo and Jacob Hilton. Topological Ramsey numbers and countable ordinals. In Andrés Caicedo, James Cummings, Peter Koellner, and Paul Larson, editors, Foundations of Mathematics , volume 690 of Contemp. Math. , pages 85–118. Amer. Math. Soc., Providence, RI, 2017.
3[ER 56] P. Erdös and R. Rado. A partition calculus in set theory. Bull. Amer. Math. Soc. , 62:427–489, 1956.
4[Hil 16] Jacob Hilton. The topological pigeonhole principle for ordinals. J. Symb. Log. , 81(2):662–686, 2016.
5[HL 10] András Hajnal and Jean A. Larson. Partition relations. In Handbook of set theory. Vols. 1, 2, 3 , pages 129–213. Springer, Dordrecht, 2010.
6[Pn 15] C. Piña. A topological Ramsey classification of countable ordinals. Acta Math. Hungar. , 147(2):477–509, 2015.