This paper was converted on www.awesomepapers.org from LaTeX by an anonymous user.
Want to know more? Visit the Converter page.

Ken’s colorful questions

Iván Ongay-Valverde
Host Institution: Department of Mathematics and Statistics
York University, Toronto, ON, CA
Current Institution: Department of Mathematics
University of Toronto, Toronto, ON, CA
Email: [email protected]
Abstract

The paper surveys some questions concerning coloring axioms which grew out of the discussions the author had with his PhD advisor Ken Kunen.

Dedicated to Ken, Anne and their family.

1 Introduction to coloring axioms

In studying a question of his long time colleague, M. E. Rudin, who asked whether MA and the failure of CH implies that every locally connected, hereditarily Lindelöf, compact space is metrizable Ken Kunen became interested in an example of Filippov [4]. Filippov had used a Luzin set to construct a locally connected, hereditarily Lindelöf, compact space that is not metrizable, and Filippov’s space is also hereditarily separable. Since MA + ¬CH implies that there are no Luzin sets, Kunen wondered whether MA and the failure of CH might refute the existence of such a space. In [10] he discovered some interesting facets of SOCA and used these to show that this is not the case.

Filippov’s construction relies on the geometry of spheres and Ken was able to see in this a useful weakening of a Luzin set. For TnT\subseteq\mathbb{R}^{n} let

T={xy:x,yT&xy}T^{*}=\{x-y:x,y\in T\And x\neq y\}

and Kunen defines TnT\subseteq\mathbb{R}^{n} to be skinny if the closure of {x/x:xT}\{x/\|x\|:x\in T^{*}\} is not the entire surface of the sphere in n\mathbb{R}^{n}. He calls a set EnE\subseteq\mathbb{R}^{n} weakly Luzin if EE is uncountable but every skinny subset of EE is countable. He then shows that the Filippov space constructed from a set EE has no uncountable discrete subsets if and only if EE is weakly Luzin. Furthermore, he shows that weakly Luzin sets and the entangled sets that play a prominent role in the study of colouring axioms have a nice common combinatorial generalization.

With these ideas he is able to show from SOCA that if XX is compact and YY is compact metric with π:XY\pi:X\to Y continuous and if there is some uncountable EYE\subseteq Y such that for all yEy\in E, there are three points {xi,y}i3π1{y}\{x_{i,y}\}_{i\in 3}\subseteq\pi^{-1}\{y\} with disjoint open neighbourhoods Ui,yU_{i,y} of xi,yx_{i,y} with pairwise disjoint ranges under π\pi then X has an uncountable discrete subset. These results stimulated my interest in modifications of colouring axioms.

Following Kunen’s [10, 11, 9], given a topological space EE we denote by E=E2{(x,x):xE}E^{\dagger}=E^{2}\setminus\{(x,x):x\in E\} the square of the space without the diagonal. A set WEW\subseteq E^{\dagger} is symmetric if (x,y)W(x,y)\in W whenever (y,x)W(y,x)\in W. We refer to a symmetric WEW\subseteq E^{\dagger} as a coloring. We shall consider various topological properties of the coloring, for example, if WW is open we say that it is an open coloring. If there is TET\subseteq E such that TWT^{\dagger}\subseteq W then we say that it is WW-connected, WW-homogeneous, or open-homogeneous (when WW is not clopen). If there is TWT\subseteq W such that TW=T^{\dagger}\cap W=\emptyset then we say that it is WW-free, WcW^{c}-homogeneous or closed-homogeneous (when not clopen).

The fundamental concept dealt with in the paper is the Semi Open Coloring Axiom:

Definition 1.1.

Given a collection 𝒳\mathcal{X} of separable metric (or topological) spaces SOCA(𝒳\mathcal{X}) is the statement “Given an uncountable space E𝒳E\in\mathcal{X} and an open coloring WEW\subseteq E^{\dagger}, there is an uncountable TET\subseteq E which is either WW-connected or WW-free (in other words, TT is homogeneous)”. SOCA is SOCA(𝒳\mathcal{X}) when 𝒳\mathcal{X} is the class of all separable metric spaces.

SOCA was arguably Ken’s favourite colouring axiom; In his book [11], he worked out a complete proof of the consistency of SOCA and as mentioned above he put it to good use in [9] and [10].

The axiom itself was introduced by Abraham, Rubin and Shelah in [1] together with another principle called there the Open Coloring Axiom (OCA), which later is usually referred to as OCA[ARS] to distinguish it from the “other” open coloring axiom introduced by Todorčević [17] sometimes denoted by OCA[T] and lately called the Open Graph Axiom (OGA) by Todorčević himself.

Both axioms are consequences of the Proper Forcing Axiom (PFA). Given that the consistency of PFA requires large cardinals the following two somewhat vague questions seem natural:

Question 1.2.

How much of the strength of PFA can be expressed with coloring axioms?

Question 1.3.

How how much of PFA is equiconsistent with ZFC? Can that be expressed with a coloring axiom?

The first question has been studied extensively by Todorčević and his school. In particular, he showed [17] that Martin’s Axiom (MA) is equivalent to the statement that given a separable metric space EE of size less than 𝔠\mathfrak{c} every ccc111A coloring WW is ccc if given pα[E]<ωp_{\alpha}\in[E]^{<\omega}, α<ω1\alpha<\omega_{1}, such that (pα)W(p_{\alpha})^{\dagger}\subseteq W for all α<ω1\alpha<\omega_{1}, there exist α,β<ω1\alpha,\beta<\omega_{1} such that (pαβ)W(p_{\alpha}\cup_{\beta})^{\dagger}\subseteq W. coloring of EE^{\dagger} has an uncountable homogeneous set (see also [18]). Furthermore, Moore [13] showed that OCA[ARS] and OGA together imply that 𝔠=2\mathfrak{c}=\aleph_{2}.

In [1], the relative consistency of ZFC+OCA[ARS] + SOCA + “There is an increasing set222We say that AA\subseteq\mathds{R} is an increasing set if and only it is uncountable and for any one-to-one function fA2f\subseteq A^{2} between two disjoint uncountable subset of AA and any nωn\in\omega, there are a0<a1<<an1a_{0}<a_{1}<...<a_{n-1} such that f(ai)<f(ai+1)f(a_{i})<f(a_{i+1}) for all i<n1i<n-1. ” is established, while an increasing set is a counterexample to OGA as shown in [17]. Hence, SOCA is weaker than OGA, and OCA[ARS] does not imply OGA. Abraham-Rudin-Shelah also showed (in [1]) that SOCA does not imply OCA[ARS]. So the only possible implications left are:

Question 1.4.

Does OCA[ARS] imply SOCA?

Question 1.5.

Does OGA imply OCA[ARS]?

The most famous open problem about the coloring axioms is, of course:

Question 1.6 ([17]).

Is OGA consistent with 𝔠>2\mathfrak{c}>\aleph_{2}?

A positive answer to this question provides a negative answer to the previous one by the aforementioned result of Moore [13]. Moreover, the analogous question for OCA[ARS] has recently been solved in the affirmative by Gilton and Neeman [8].

We conclude this quick overview of coloring axioms by recalling another open problem raised by Todorčević in [17] (see also [19]):

Question 1.7 ([17]).

Is OGA(𝒳\mathcal{X}) consistent for the class 𝒳\mathcal{X} of all regular spaces without uncountable discrete subsets?

An analogous question can be also asked for SOCA:

Question 1.8.

What is the largest family of topological spaces 𝒳\mathcal{X} such that SOCA(𝒳\mathcal{X}) is relatively consistent with ZFC?

2 Weakenings of SOCA

In this section we consider two natural weaker versions of SOCA:

  • Clopen SOCA - the same as SOCA but only for clopen colorings.

  • Dense SOCA - the same as SOCA but only for open dense colorings.

To understand the relation between these principles it is useful to consider the following concept:

Definition 2.1.

Given a topological property PP, an uncountable separable metric space EE and a coloring WW over EE we say that WW can be reduced to a PP-coloring if there is an uncountable set TET\subseteq E such that WTW\cap T^{\dagger} is a coloring with property PP in the topology of TT^{\dagger} induced from EE^{\dagger}.

Obviously, given any collection 𝒳\mathcal{X} of separable metric spaces, the axiom SOCA(𝒳\mathcal{X}) is stronger than both Clopen SOCA(𝒳\mathcal{X}), Dense SOCA(𝒳\mathcal{X}).

Proposition 2.1.

Assume SOCA. Then

  1. 1.

    (Clopen Reduction) All open colorings on a separable metric space can be reduced to clopen colorings.

  2. 2.

    (Dense Reduction) Every open coloring on a separable metric space can be reduced to an open dense or empty coloring.

Proof.

We shall prove both items simultaneously. Given a space EE and an open coloring WW over it, using SOCA there is an uncountable TET\subseteq E that is homogeneous. If TT is WW-connected, then TW=TT^{\dagger}\cap W=T^{\dagger} which is clopen and open dense in TT^{\dagger}. Otherwise, TT is WW-free so TW=T^{\dagger}\cap W=\emptyset which is clopen and empty. ∎

Recall that an uncountable set AA\subseteq\mathds{R} is 22-entangled if for every uncountable collection of pairwise disjoint 22-element subsets of AA, there are pairs (x1,y1)(x_{1},y_{1}), (x2,y2)(x_{2},y_{2}), (w1,z1)(w_{1},z_{1}), (w2,z2)(w_{2},z_{2}) in the collection such that x1<x2x_{1}<x_{2} and y1<y2y_{1}<y_{2}, w1<w2w_{1}<w_{2} but z1>z2z_{1}>z_{2}. The existence of a 22-entangled set follows e.g. from CH, while in [1] it is shown that SOCA implies that there are no 22-entangled sets. Interestingly, Clopen SOCA suffices and, consequently, Clopen SOCA is not a theorem of ZFC.

Theorem 2.2.

Assuming Clopen SOCA or Dense Reduction there are no 22-entangled sets.

Proof.

It suffices to show that given any uncountable linearly ordered separable metric space XX, the increasing open coloring

W={((a,b),(c,d)):a<cb<d}W=\{((a,b),(c,d)):\ a<c\leftrightarrow b<d\}

of X2X^{2} can be reduced to a clopen coloring.

To see this, recursively construct T={xξ=(x1ξ,x2ξ):ξ<ω1}T=\{x_{\xi}=(x_{1}^{\xi},x^{\xi}_{2}):\xi<\omega_{1}\} as follows: Assume xξ=(x1ξ,x2ξ)x_{\xi}=(x_{1}^{\xi},x^{\xi}_{2}) for ξ<α\xi<\alpha have already been chosen. Since α\alpha is countable X2(ξ<α(X×{x2ξ}{x1ξ}×X))X^{2}\setminus\left(\bigcup_{\xi<\alpha}(X\times\{x_{2}^{\xi}\}\cup\{x_{1}^{\xi}\}\times X)\right)\neq\emptyset. Take xαx_{\alpha} to be any point in it.

Now, given two distinct (x,y),(z,w)T(x,y),(z,w)\in T, we have that xyx\neq y and zwz\neq w, hence, ((x,y),(z,w))((x,y),(z,w)) is either in WW or in {((a,b),(c,d)):a<cb>d}\{((a,b),(c,d)):a<c\leftrightarrow b>d\}, but both are open sets. Therefore, TWT\cap W is clopen in TT.

We start the proof from the Dense Reduction by noting the following:

Fact 2.1.

The only way to reduce a clopen coloring to an open dense one is to have an uncountable homogeneous open set.

To see this, let WW be a clopen coloring over EE and assume that TET\subseteq E is an uncountable set that reduces WW to open dense. Notice that, given (a,b)TWc(a,b)\in T^{\dagger}\cap W^{c}, as TT reduces WW to open dense, TWUT^{\dagger}\cap W\cap U\neq\emptyset for every open set (a,b)U(a,b)\in U. On the other hand, as WW is clopen in EE, there is an open set VV such that (a,b)VWc(a,b)\in V\subseteq W^{c}. Clearly, these two assumptions are contradicting each other. Therefore, TWc=T^{\dagger}\cap W^{c}=\emptyset making TT open-homogeneous. This concludes the proof of the fact.

Let WW be the increasing coloring on A2A^{2} where AA is a 22-entangled set. We know that WW can be reduced to a clopen coloring, so lets assume that it is clopen. Notice that for any TA2T\subseteq A^{2}, TWT^{\dagger}\cap W is clopen. Using our fact, the only way to get an open dense coloring or an empty coloring would be finding an uncountable homogeneous set, which does not exist when AA is a 22-entangled set. Then the existance of a 22-entangled set implies the failure of Dense Reduction. ∎

The increasing coloring can be used to show that there is an open coloring which is not reducible to an open dense coloring, hence the phrase “or empty” in the Dense Reduction is necessary. To see this take a subset of 2\mathds{R}^{2} consisting of the graph of a decreasing function and the graph of a countable partial increasing function, and consider the increasing coloring defined above.

Next we shall see that the axioms considered here imply that 𝔟>ω1\mathfrak{b}>\omega_{1} following Todorčević [17] and Moore [12]. We shall call an \leq^{*}-increasing unbounded chain in ωω\omega^{\omega} of minimal length a 𝔟\mathfrak{b}-scale.

Proposition 2.2.

Each of the axioms Clopen SOCA, Dense SOCA and Clopen Reduction implies 𝔟>1\mathfrak{b}>\aleph_{1}.

Proof.

The fact that Clopen SOCA implies 𝔟>1\mathfrak{b}>\aleph_{1} was proved in [12].

Now, assume, towards a contradiction, that every open coloring can be reduced to a clopen coloring and 𝔟=1\mathfrak{b}=\aleph_{1}. Take a 𝔟\mathfrak{b}-scale and let WW be an open coloring such that

Wc={(f,g):fg or fg}W^{c}=\{(f,g):f\geq g\mbox{ or }f\leq g\}

where fgf\leq g means that for all nωn\in\omega, f(n)g(n)f(n)\leq g(n). The above coloring has no uncountable homogeneous set when 𝔟=1\mathfrak{b}=\aleph_{1} (see [17]). Furthermore, using the theory of oscillation of Todorčević [17], in any cofinal (for 𝔟=1\mathfrak{b}=\aleph_{1}, uncountable) set of a 𝔟\mathfrak{b}-scale there are ff and hh, such that hfh\leq^{\ast}f but hfh\not\leq f, so there is a value mm where h(m)>f(m)h(m)>f(m), so WcW^{c} is closed but not clopen. Now, since every uncountable subset of a 𝔟\mathfrak{b}-scale is also a 𝔟\mathfrak{b}-scale (when 𝔟=1\mathfrak{b}=\aleph_{1}), WW can never be reduced to a clopen coloring. This contradicts our assumptions.

Finally, towards a contradiction, assume Dense SOCA and 𝔟=1\mathfrak{b}=\aleph_{1}. Using a 𝔟\mathfrak{b}-scale BB of size 1\aleph_{1}, we can eliminate countably many points to have that every open set is uncountable. Using the same coloring WW as above, every open set in BB^{\dagger} has a subset of the form

{(f,h):n,mωf(n)<h(n) and f(m)>h(m)},\{(f,h):\exists n,m\in\omega f(n)<h(n)\mbox{ and }f(m)>h(m)\},

which is an open set. So WcW^{c} is nowhere dense (nwd). Furthermore, by a theorem of Todorčević [17], every 𝔟\mathfrak{b}-scale has two functions, ff and gg such that f<gf<g. Then, this coloring is open dense but it has no uncountable homogeneous set. ∎

In particular, none of the four axioms considered are theorems of ZFC. It turns out that various combinations of these weakenings of SOCA recover the whole strength of SOCA.

Theorem 2.3.

The following are equivalent:

  1. 1.

    SOCA

  2. 2.

    Clopen SOCA + Clopen Reduction

  3. 3.

    Dense SOCA + Dense Reduction

  4. 4.

    Clopen Reduction + Dense Reduction

  5. 5.

    Dense SOCA + Clopen SOCA

Proof.

We already know that SOCA implies all the other statements. The equivalence of Clauses 2 and 3 with 1 have identical natural proofs: first reducing any open coloring to one of the special kind and then apply the corresponding weakening of SOCA to that special coloring. The rest follows directly from the following two observations:

Fact 2.2.

Dense reduction implies Clopen SOCA.

Fact 2.3.

Dense SOCA implies Clopen reduction.

Fact 2.2 is a direct consequence of Fact 2.1. To show Fact 2.3, let WW be an open coloring over EE. Notice that Wint(Wc)W\cup\mbox{int}(W^{c}) is an open dense coloring over EE, since its complement is W\partial W.333W\partial W denotes the boundary of WW. It is nowhere dense and it can be define either as W¯Wc¯\overline{W}\cap\overline{W^{c}} or as W¯int(W)\overline{W}\setminus\mbox{int}(W)

Using Dense SOCA over Wint(Wc)W\cup\mbox{int}(W^{c}) we either get a closed-homogeneous uncountable set TT, in which case, T(Wint(Wc))=T^{\dagger}\cap(W\cup\mbox{int}(W^{c}))=\emptyset, so TW=T^{\dagger}\cap W=\emptyset is clopen, or we get an uncountable set such that TWint(Wc)T^{\dagger}\subseteq W\cup\mbox{int}(W^{c}). Because both WW and WcW^{c} are open in TT^{\dagger} we have that TT reduces WW to a clopen coloring. This concludes the proof of the facts. ∎

We close this section with a few more natural questions:

Question 2.4.

Is Dense SOCA equivalent to Clopen Reduction?

Question 2.5.

Is Clopen SOCA equivalent to Dense Reduction?.

Question 2.6.

Is Dense SOCA weaker than SOCA?

Question 2.7.

Is Clopen SOCA weaker than SOCA?

Some of these would be settled by a positive answer to the following:

Conjecture 2.8.

Every open coloring can be reduced to a clopen or to an open dense coloring.

As mentioned in the previous section, it is not known if OCA[ARS] implies SOCA. If it turns out that the answer is negative, then the fact that OCA[ARS] implies Clopen SOCA (a clopen coloring is also a cover of EE^{\dagger} by open sets) settles Question 2.7 in the positive.

3 Colorings and Baire spaces

Galvin [5] (see also [9]) showed that SOCA is true for every Polish space. In particular, in uncountable Polish spaces all open colorings can be reduced to clopen ones. Hence also any space that contains an uncountable Polish space has the same reduction property. These ZFC results suggest the following:

Question 3.1.

What is the largest family of topological spaces 𝒳\mathcal{X} such that ZFC implies SOCA(𝒳\mathcal{X})?

In a related work, Ramos-García and Corona-García [3] study the class of topological spaces for which OGA follows from ZFC.

Recall that a metric space EE is a Baire space if no non-empty open subsets of EE is meager, i.e. is not a union of countably many nowhere dense sets. Polish spaces are Baire by the Baire Category Theorem. Nevertheless, not all Baire spaces are Polish or contain a Polish space. For example Luzin sets or Generalized Luzin sets ([11]) are Baire spaces with no Polish subspace (these sets exists, for example, under CH or MA+¬\neg CH, respectively).

Furthermore, as shown in Kunen’s book [11], it is possible to have a Luzin set as counterexample to SOCA, so it is consistent that not all Baire metric spaces satisfy SOCA. We will show here that, if Clopen SOCA is true for Baire spaces, then SOCA is also true for them. In order to prove this, the following notation will be useful:

Notation 3.1.

Given AE2A\subseteq E^{2} and eEe\in E let

Ae={yE:(y,e)A}.A_{e}=\left\{y\in E\ :\ (y,e)\in A\right\}.
Theorem 3.2.

Every open coloring over a separable metric Baire space can be reduced to a clopen one.

Proof.

Let EE be a separable metric Baire space and let WEW\subseteq E^{\dagger} be open and symmetric.

By definition, W\partial W is meager (nowhere dense) and, by the Kuratowski-Ulam Theorem, we have that the set

T0={eE:(W)e is not nowhere dense}T_{0}=\{e\in E\ :\ (\partial W)_{e}\mbox{ is not nowhere dense}\}

is meager.

We can recursively construct a sequence xξ:ξω1\langle x_{\xi}:\xi\in\omega_{1}\rangle contained in ET0E\setminus T_{0} such that, given α<β\alpha<\beta, xβ(W)xαx_{\beta}\notin(\partial W)_{x_{\alpha}}. Once we construct this sequence we will be done: by symmetry of WW, (e,e)W(e,e^{\prime})\in\partial W if and only if (e,e)W(e^{\prime},e)\in\partial W. So, the above sequence will have the property that, given α\alpha and β\beta, (xα,xβ)W(x_{\alpha},x_{\beta})\notin\partial W. In other words, there is an open set OO of EE^{\dagger} such that (xα,xβ)O(x_{\alpha},x_{\beta})\in O and either OW=O\cap W=\emptyset or OWO\subseteq W. Therefore, {xξ:ξω1}W\{x_{\xi}:\xi\in\omega_{1}\}^{\dagger}\cap W will be clopen in {xξ:ξω1}\{x_{\xi}:\xi\in\omega_{1}\}^{\dagger}.

For the construction, assume that we already selected xξx_{\xi} for ξ<α\xi<\alpha, for α<ω1\alpha<\omega_{1}. Since α\alpha is countable, EE is a Baire space and xξT0x_{\xi}\notin T_{0} we have that E(ξ<α(W)xξT0)E\setminus\left(\bigcup_{\xi<\alpha}(\partial W)_{x_{\xi}}\cup T_{0}\right)\neq\emptyset. We just let xαx_{\alpha} be an element of E(ξ<α(W)xξT0)E\setminus\left(\bigcup_{\xi<\alpha}(\partial W)_{x_{\xi}}\cup T_{0}\right).∎

Corollary 3.3.

Dense SOCA(Baire) is true in ZFC.

Proof.

If in the proof above we assume that WW is open dense, then Wc=WW^{c}=\partial W. So, the proof above generates a WW-connected set. ∎

Corollary 3.4.

SOCA(Baire) and Clopen SOCA(Baire) are equivalent.

The following is a variation on a classical proof of Todorčević in [17].

Theorem 3.5.

Assuming CH there is a 2-entangled Luzin set.

Proof.

Let {fα:α<𝔠}\{f_{\alpha}:\alpha<\mathfrak{c}\} be an enumeration of all continuous functions from GδG_{\delta} subsets of \mathds{R} to \mathds{R} and let ={xα:α<𝔠}\mathds{R}=\{x_{\alpha}:\alpha<\mathfrak{c}\} be an enumeration of the reals. Finally, let {Nα:α<𝔠}\{N_{\alpha}:\alpha<\mathfrak{c}\} be an enumeration of all closed nwd sets.

We will construct the 22-entangled Luzin set 𝒮\mathcal{S}\subseteq\mathds{R} by recursion. Assume that we already have 𝒮α={xγξ:ξ<α}\mathcal{S}_{\alpha}=\{x_{\gamma_{\xi}}:\xi<\alpha\}. Let

γα=min{β:xβ(ξ<αNξ)Bα=}\gamma_{\alpha}=\min\{\beta:x_{\beta}\notin(\bigcup_{\xi<\alpha}N_{\xi})\cup B_{\alpha}=\emptyset\}

where

Bα={fχ(xγξ):ξ,χ<α}.B_{\alpha}=\{f_{\chi}(x_{\gamma_{\xi}}):\xi,\chi<\alpha\}.

Notice that BαB_{\alpha} is meager (it is countable) and (ξ<αNξBα)(\bigcup_{\xi<\alpha}N_{\xi}\cup B_{\alpha}) is a countable union of nwd (by CH), so they do not cover \mathds{R}. This shows that (ξ<αNξBα)\mathds{R}\setminus(\bigcup_{\xi<\alpha}N_{\xi}\cup B_{\alpha}) is non empty and γα\gamma_{\alpha} is well defined.

It is clear from the construction, and from the assumption that 𝔠=1\mathfrak{c}=\aleph_{1}, that 𝒮\mathcal{S} is a Luzin set. To show that 𝒮\mathcal{S} is 22-entangled we follow the proof of Lemma 4.2 by Todorčević in [17]. Let {(xαξ,xβξ):ξ<𝔠}2\{(x_{\alpha_{\xi}},x_{\beta_{\xi}}):\xi<\mathfrak{c}\}\subseteq\mathds{R}^{2} be a collection of size continuum of disjoint 22-tuples of 𝒮\mathcal{S}.

Let

K={xαξ:αξ<βξ<𝔠}.K=\{x_{\alpha_{\xi}}:\alpha_{\xi}<\beta_{\xi}<\mathfrak{c}\}.

We can assume that this set is of size continuum. If not, we can run the argument interchanging the roles of αξ\alpha_{\xi} and βξ\beta_{\xi}.

Now, we can define the function g:Kg:K\rightarrow\mathds{R} such that

xαξxβξ.x_{\alpha_{\xi}}\mapsto x_{\beta_{\xi}}.

Furthermore, define the set

K0={sK:|ωg(s)|2},K_{0}=\{s\in K:|\omega_{g}(s)|\geq 2\},

where444Here B1nK(s)B_{\frac{1}{n}}^{K}(s) is the ball of radius 1n\frac{1}{n} with center ss in KK, a subset of \mathds{R}. ωg(s)=nωg[B1nK(s)]¯\omega_{g}(s)=\bigcap_{n\in\omega}\overline{g[B_{\frac{1}{n}}^{K}(s)]} is the oscillation of gg at ss, i.e., all the accumulation points of the images (under gg) of sequences that converge to ss. Notice that |ωg(s)|=1|\omega_{g}(s)|=1 if and only if gg is continuous at ss.

Recall that any partial continouos function from n\mathds{R}^{n} to \mathds{R} can be extended to a partial function whose domain is a GδG_{\delta} set. With this and our construction of 𝒮\mathcal{S} we have that the set K0K_{0} is of size continuum.

Given sK0s\in K_{0}, let asa_{s}, bsb_{s} be two distinct elements in ωg(s)\omega_{g}(s). Without loss of generality, we can assume that as<bsa_{s}<b_{s}. Let rr\in\mathds{Q} such that as<r<bsa_{s}<r<b_{s}. Since we only have countably many rational numbers, we may shrink K0K_{0} in such a way that for all sK0s\in K_{0} the rational number rr is the same. Notice that K0K_{0} still has size continuum.

Take t,sK0t,s\in K_{0} such that t<st<s and take disjoint intervals It,IsI_{t},I_{s} such that tItt\in I_{t} and sIss\in I_{s}. By the definition of ata_{t}, asa_{s}, btb_{t} and bsb_{s} there are t0,t1KItt_{0},t_{1}\in K\cap I_{t} and s0,s1IsKs_{0},s_{1}\in I_{s}\cap K such that g(t0),g(s0)<r<g(t1),g(s1)g(t_{0}),g(s_{0})<r<g(t_{1}),g(s_{1}). Then for the pairs (t0,g(t0))(t_{0},g(t_{0})), (s1,g(s1))(s_{1},g(s_{1})) we have t0<s1t_{0}<s_{1} and g(t0)<g(s1)g(t_{0})<g(s_{1}); and for the pair (t1,g(t1))(t_{1},g(t_{1})), (s0,g(s0))(s_{0},g(s_{0})) we have t1<s0t_{1}<s_{0} but g(t1)>g(s0)g(t_{1})>g(s_{0}). ∎

Note 1.

In the proof of Theorem 3.5, we index the sequence with 𝔠\mathfrak{c} since the entangled part is true in ZFC. The use of CH is only to ensure that the set is Luzin.

As every Luzin set is Baire, we have the following:

Corollary 3.6.

In a model where CH is true, SOCA(Baire) is false.

With this we can conclude that Dense SOCA(Baire) is weaker than Clopen SOCA(Baire) and SOCA(Baire).

4 SOCA for larger uncountable sets

In this section we shall consider higher cardinal extensions of SOCA. This is motivated indirectly by the recent attempts to “lift” Baumgartner’s Theorem [2] to 2\aleph_{2}, i.e. to prove the consistency of every two 2\aleph_{2}-dense sets of reals are order isomorphic (see [14, 7]), and directly by the work of Shelah, Abraham and Rudin’s [1] where they ask if it is possible to have a version of SOCA for 2\aleph_{2}. It fits in the general program to investigate the behaviour of the continuum when it is bigger than 2\aleph_{2} (as discussed in [16]).

A straightforward generalization of SOCA is to ask that the set TT is as big as the space or bigger than a certain cardinal.

Definition 4.1.

SOCA(κ\kappa) is the statement: For all separable metric spaces EE of size bigger or equal to κ\kappa and all open symmetric subsets WW of EE^{\dagger} there exist TET\subseteq E such that |T|κ|T|\geq\kappa and either TWT^{\dagger}\subset W (open-homogeneous) or TW=T^{\dagger}\cap W=\emptyset (closed-homogeneous).

For some spaces, this axiom can be derived from SOCA and MA.

Theorem 4.2 (SOCA and MA).

Given a separable metric space EE of size κ<𝔠\kappa<\mathfrak{c}, with cof(κ)0cof(\kappa)\neq\aleph_{0}, and WEW\subseteq E^{\dagger} open and symmetric such that all closed-homogeneous sets are countable, there is an open-homogeneous set TET\subseteq E of size κ\kappa.

Proof.

Let

E,W={p[E]<ω:x,yp(xy(x,y)W)}.\mathds{C}_{E,W}=\{p\in[E]^{<\omega}:\forall x,y\in p\ (x\neq y\rightarrow(x,y)\in W)\}.

It is enough to show that this is a ccc poset. Once we have this, since it is of size κ<𝔠\kappa<\mathfrak{c}, MA will imply that it is the union of countably many filters. Notice that the union of each filter is an open-homogeneous set and, since {e}E,W\{e\}\in\mathds{C}_{E,W} for all eEe\in E, we have that EE is a countable union of open-homogeneous sets so, it has an open-homogeneous set of size κ\kappa (using its cofinality).

In order to show that E,W\mathds{C}_{E,W} is ccc take {pα:α<ω1}E,W\{p_{\alpha}\ :\ \alpha<\omega_{1}\}\subseteq\mathds{C}_{E,W}. We will show that there exist αβ\alpha\neq\beta such that pαp_{\alpha} is compatible with pβp_{\beta}.

Since |pα|ω|p_{\alpha}|\in\omega for all α\alpha we may assume that {pα:α<ω1}\{p_{\alpha}\ :\ \alpha<\omega_{1}\} is a Δ\Delta-system with root rr. Furthermore, we may assume that |pαr|=|pβr|=m|p_{\alpha}\setminus r|=|p_{\beta}\setminus r|=m. So, we can write pαr={xα0,,xαm1}p_{\alpha}\setminus r=\{x^{0}_{\alpha},...,x^{m-1}_{\alpha}\}

Let \mathcal{B} be a countable basis of EE. For each α\alpha we can choose ViV_{i}\in\mathcal{B} such that for all imi\in m, xiαVix_{i}^{\alpha}\in V_{i} and for all iji\neq j, Vi×VjWV_{i}\times V_{j}\subseteq W (this is possible since WW is open and for all iji\neq j and all γ\gamma (xiγ,xjγ)W(x^{\gamma}_{i},x^{\gamma}_{j})\in W).

We will prove by induction on mm that there exists uncountable many elements that are compatible.

For m=1m=1, let T={xα0:α<ω1}T=\left\{x^{0}_{\alpha}:\alpha<\omega_{1}\right\}. We know that TT do not have any uncountable closed-homogeneous set, so we can use SOCA(1\aleph_{1}) to choose an uncountable open-homogeneous set. Let Sω1S\subseteq\omega_{1} be the indexes of the elements of this open-homogeneous set. Notice that all the elements of {pα:αS}\{p_{\alpha}\ :\ \alpha\in S\} are compatible.

Assume we have the result for mm, we will prove it for m+1m+1.

First, using the induction hypothesis, take {qα:α<ω1}\{q_{\alpha}\ :\ \alpha<\omega_{1}\} such that {qα{xαm}:α<ω1}\{q_{\alpha}\setminus\{x_{\alpha}^{m}\}\ :\ \alpha<\omega_{1}\} are compatible. Now, let T={xαm:α<ω1}T=\{x^{m}_{\alpha}:\alpha<\omega_{1}\}. We know that TT do not have any uncountable closed-homogeneous set, so we can use SOCA(1\aleph_{1}) to choose an uncountable open-homogeneous set. Let Sω1S\subseteq\omega_{1} be the indexes of the elements xαmx_{\alpha}^{m} in that uncountable open-homogeneous set. Notice that all the elements of {qα:αS}\{q_{\alpha}\ :\ \alpha\in S\} are compatible: first, all the elements of {qα{xαm}:αS}\{q_{\alpha}\setminus\{x_{\alpha}^{m}\}\ :\ \alpha\in S\} are compatible; also, we have that (xαm,xβm)W(x_{\alpha}^{m},x^{m}_{\beta})\in W for all α,βS\alpha,\beta\in S and, finally, we have that (xαm,xβj)Vm×VjW(x^{m}_{\alpha},x^{j}_{\beta})\in V_{m}\times V_{j}\subseteq W for all α,βω1\alpha,\beta\in\omega_{1} and all jmj\in m. ∎

The assumption that κ<𝔠\kappa<\mathfrak{c} cannot be improved. Following Note 1 after Theorem 3.5, we can modify Lemma 4.2 of [17] to show:

Theorem 4.3.

There is a set of size continuum XX such that for every collection of size continuum of disjoint 22-tuples of XX there are (x1,y1)(x_{1},y_{1}), (x2,y2)(x_{2},y_{2}), (w1,z1)(w_{1},z_{1}), (w2,z2)(w_{2},z_{2}) such that x1<x2x_{1}<x_{2} and y1<y2y_{1}<y_{2}, w1<z1w_{1}<z_{1} but w2>z2w_{2}>z_{2}.

Theorem 4.3 shows that the increasing coloring for X2X^{2} cannot have a size continuum homogeneous set, so SOCA(κ\kappa) can only be valid for κ<𝔠\kappa<\mathfrak{c}.

In order to prove SOCA, the autors of [1] used sequences of elementary submodels and assumed that their spaces only had countable closed-homogeneous sets using a combinatorial principle (there always exists fast clubs for (special) families of size continuum). Following these ideas Moore and Todorčević in [14] introduced the principle (**) which we shall call MTA:

Definition 4.4 (Moore, Todorčević [14]).

The Moore-Todorčević Axiom for (ω2\omega_{2},2\aleph_{2}, 1\aleph_{1}) (MTA or MTA(ω2,2,1\omega_{2},\aleph_{2},\aleph_{1})) is the statement:

If \mathcal{F} is a collection of one-to-one functions from ω2\omega_{2} to ω2\omega_{2} and ||2|\mathcal{F}|\leq\aleph_{2} then there is g:ω2ω2g:\omega_{2}\rightarrow\omega_{2} which is one-to-one such that

  • for every ff\in\mathcal{F}, {α:f(α)=g(α)}\{\alpha:f(\alpha)=g(\alpha)\} is countable (or of size <1<\aleph_{1}).

  • for every ff\in\mathcal{F}, there is a countable (or of size <1<\aleph_{1}) set Dω2D\subseteq\omega_{2} such that if αβω2D\alpha\neq\beta\in\omega_{2}\setminus D then f(g(α))g(β)f(g(\alpha))\neq g(\beta).

In the same paper were MTA is introduced, the following equivalence is proved:

Lemma 4.5.

For each βω2ω1\beta\in\omega_{2}\setminus\omega_{1}, fix a bijection bβ:βω1b_{\beta}:\beta\rightarrow\omega_{1}. MTA is equivalent to the following statement: whenever \mathcal{F} is a collection of at most 2\aleph_{2} many one-to-one functions from ω1\omega_{1} to ω1\omega_{1}, there is a one-to-one g:ω2ω2g:\omega_{2}\rightarrow\omega_{2} such that, whenever β\beta is closed under gg and ff\in\mathcal{F}, there is a countable DβD\subseteq\beta such that:

  • if ξβD\xi\in\beta\setminus D then

    f(min(bβ(ξ),bβ(g(ξ))))<max(bβ(ξ),bβ(g(ξ))),f(\min(b_{\beta}(\xi),b_{\beta}(g(\xi))))<\max(b_{\beta}(\xi),b_{\beta}(g(\xi))),
  • if ηξβD\eta\neq\xi\in\beta\setminus D then

    f(min(bβ(g(η)),bβ(g(ξ))))<max(bβ(g(η)),bβ(g(ξ))).f(\min(b_{\beta}(g(\eta)),b_{\beta}(g(\xi))))<\max(b_{\beta}(g(\eta)),b_{\beta}(g(\xi))).

Notice that, using the Axiom of Choice, if the functions are countable-to-one, you can also construct a gg with the above mentioned properties. The following lemma was also discovered, independently, by Thomas Gilton [6].

Lemma 4.6.

(20=2+ MTA)(2^{\aleph_{0}}=\aleph_{2}+\mbox{ {MTA}}) Given a separable metric space EE of size 2\aleph_{2} and an open and symmetric WEW\subseteq E^{\dagger} such that all closed-homogeneous sets are countable there is an E0EE_{0}\subseteq E of size 2\aleph_{2} such that the finite open-homogeneous subsets of E0E_{0} ordered by reverse inclusion form a ccc forcing.

Proof.

The proof for this Lemma is inspired, indeed, by Todorčević and Moore [13] and by the proof of the consistency of SOCA with 𝔠>2\mathfrak{c}>\aleph_{2} in Abraham-Rudin-Shelah [1]. The inspiration of the former will be seen on the use of MTA. On the other hand, the strategy that Abraham-Rudin-Shelah used to prove their result was that given a metric space, they created a “tower of models” for each closed set of the metric space and its cartesian powers. After that, they “combined” all of them using their Axiom A1 (which, essentially, guarantees a fast club) and, finally, use the club method.

We will have a similar approach (even using the club method at the end). Nevertheless, we will change A1 for MTA and create “towers of models” for all the pairs of closed sets and an uncountable ordinal of ω2\omega_{2}. We do this as follows:

Let E={eα:α<ω2}E=\{e_{\alpha}:\alpha<\omega_{2}\} and ={Bn:nω}\mathcal{B}=\{B_{n}:n\in\omega\} be a basis for its topology. Fix θ3\theta\geq\aleph_{3}, and bβb_{\beta} bijections between β\beta and ω1\omega_{1} for each βω2ω1\beta\in\omega_{2}\setminus\omega_{1}.

For each closed subset of EnE^{n}, say FF, and each βω2ω1\beta\in\omega_{2}\setminus\omega_{1} we define {MγF,β:γ<ω1}\{M_{\gamma}^{F,\beta}:\gamma<\omega_{1}\} a continuous \in-chain of countable elementary submodels of H(θ),E,\langle H(\theta),E,\mathcal{B}\rangle such that given α<β\alpha<\beta we ensure that eαMbβ(α)+1F,βe_{\alpha}\in M_{b_{\beta}(\alpha)+1}^{F,\beta}. Whenever FF and β\beta are clear from the context we will use the notation MγM_{\gamma} for γω1\gamma\in\omega_{1}.

Notice that, since there are only 2\aleph_{2} pairs (F,β)(F,\beta), we just define 2\aleph_{2} “towers of models” each one of them with ω1\omega_{1} models such that for all γω1\gamma\in\omega_{1}, FMγF,βF\in M^{F,\beta}_{\gamma} and

{eα:α<β}δω1MδF,β.\{e_{\alpha}:\alpha<\beta\}\subseteq\bigcup_{\delta\in\omega_{1}}M^{F,\beta}_{\delta}.

Once again, for FF a closed subset of EnE^{n} and βω2ω1\beta\in\omega_{2}\setminus\omega_{1}, we define fF,β:ω1ω1f_{F,\beta}:\omega_{1}\rightarrow\omega_{1} such that:

fF,β(α)=min{γω1:ξ<α(ebβ1(ξ)Mγ),δγ(ebβ1(δ)Mα+1)}f_{F,\beta}(\alpha)=\min\left\{\gamma\in\omega_{1}:\forall\xi<\alpha\left(e_{b_{\beta}^{-1}(\xi)}\in M_{\gamma}\right),\forall\delta\geq\gamma\left(e_{b_{\beta}^{-1}(\delta)}\notin M_{\alpha+1}\right)\right\}

using the sequence of elementary submodels corresponding to FF and β\beta. These functions are well define, since each MχM_{\chi} is countable, and each of of them is a countable-to-one function.

The combinatorial principle MTA ensures the existance of a one-to-one function g:ω2ω2g:\omega_{2}\rightarrow\omega_{2} satisfying the conditions of Lemma 4.5 for the set {fF,β:βω2ω1,nω,FEn}\{f_{F,\beta}:\beta\in\omega_{2}\setminus\omega_{1},n\in\omega,F\subseteq E^{n}\}.

Let E0={eg(α):α<ω2}E_{0}=\{e_{g(\alpha)}:\alpha<\omega_{2}\}. We claim that this set works.

To prove this, it is enough to show that given an uncountable collection of finite open-homogeneous sets, the union of two of them is open-homogeneous.

Assume that we have 1\aleph_{1}-many finite open-homogeneous sets, say A={xα:α<ω1}A=\{x_{\alpha}:\alpha<\omega_{1}\}. We know that there is an uncountable β<ω2\beta<\omega_{2} such that for all α<ω1\alpha<\omega_{1}, if eξxαe_{\xi}\in x_{\alpha}, then ξ<β\xi<\beta. Furthermore, we can find this β\beta such that it is closed under gg.

Without lost of generality, we can assume that they form a Δ\Delta-system with empty root and they all have size nn. As in Theorem 4.2, we can naturally associate a vector in EnE^{n} to each xαx_{\alpha}. To do so, we enumerate xα={eg(ξα1),,eg(ξαn)}x_{\alpha}=\{e_{g(\xi^{1}_{\alpha})},...,e_{g(\xi^{n}_{\alpha})}\} in such a way that i<ji<j if and only if bβ(g(ξαi))<bβ(g(ξβj))b_{\beta}(g(\xi^{i}_{\alpha}))<b_{\beta}(g(\xi^{j}_{\beta})).

Shrinking AA if necessary, we can assume that, if δ<γ\delta<\gamma, then

max(bβ(ξδn),bβ(g(ξδn)))<min(bβ(ξγ1),bβ(g(ξγ1)).\max(b_{\beta}(\xi^{n}_{\delta}),b_{\beta}(g(\xi^{n}_{\delta})))<\min(b_{\beta}(\xi^{1}_{\gamma}),b_{\beta}(g(\xi^{1}_{\gamma})).

After these reductions, let FF be the closure of {(eg(ξα1),,eg(ξαn)):α<ω1}\{(e_{g(\xi^{1}_{\alpha})},...,e_{g(\xi^{n}_{\alpha})}):\alpha<\omega_{1}\} in EnE^{n}.

We will work with the continuous \in-chain of models associated with FF and β\beta.

Given α<β\alpha<\beta, we say that the height of eαe_{\alpha}, denoted htF,β(eα)=ht(eα)ht^{F,\beta}(e_{\alpha})=ht(e_{\alpha}), is the minimum γ\gamma such that eαMγ+1Mγe_{\alpha}\in M_{\gamma+1}\setminus M_{\gamma}. Given our definition for these chains of models, we have that ht(eγ)bβ(γ)ht(e_{\gamma})\leq b_{\beta}(\gamma) for γβ\gamma\in\beta. On the other hand, the definition of fF,βf_{F,\beta} ensure that, if α,δω1\alpha,\delta\in\omega_{1} and fF,β(α)<δf_{F,\beta}(\alpha)<\delta then ht(ebβ1(ξ))<δht(e_{b^{-1}_{\beta}(\xi)})<\delta for all ξ<α\xi<\alpha, ht(ebβ1(α))<δht(e_{b^{-1}_{\beta}(\alpha)})<\delta and α<ht(ebβ1(χ))\alpha<ht(e_{b_{\beta}^{-1}(\chi)}) for all χδ\chi\geq\delta.

We claim that, for all but countably many ordinals in β\beta, if bβ(g(η))<bβ(g(ξ))b_{\beta}(g(\eta))<b_{\beta}(g(\xi)) then ht(eg(η))<ht(eg(ξ))ht(e_{g(\eta)})<ht(e_{g(\xi)}). To see this, from the second bullet of MTA, we have that there is a countable DD such that if ηξβD\eta\neq\xi\in\beta\setminus D and bβ(g(η))<bβ(g(ξ))b_{\beta}(g(\eta))<b_{\beta}(g(\xi)) then fF,β(bβ(g(η))<bβ(g(ξ))f_{F,\beta}(b_{\beta}(g(\eta))<b_{\beta}(g(\xi)). This means that bβ(g(η))<ht(eg(ξ))b_{\beta}(g(\eta))<ht(e_{g(\xi)}). Since ht(eg(η))bβ(g(η))ht(e_{g(\eta)})\leq b_{\beta}(g(\eta)), we have that ht(eg(η))<ht(eg(ξ))ht(e_{g(\eta)})<ht(e_{g(\xi)}).

The above inequality allow us to find a really useful family of uncountable sets: given α<ω1\alpha<\omega_{1} such that ξαiβD\xi_{\alpha}^{i}\in\beta\setminus D for all i{1,,n}i\in\{1,...,n\}, let μ=ht(eg(ξαn))\mu=ht(e_{g(\xi^{n}_{\alpha})}) and Fα={aEMμ:xα1,,n1aF}F_{\alpha}=\{a\in E\cap M_{\mu}:x_{\alpha}\mathord{\upharpoonright}_{1,...,n-1}\mathbin{\raisebox{4.30554pt}{\scalebox{0.7}{$\frown$}}}a\in F\}. Since bβ(g(ξαi))<b(g(ξαn))b_{\beta}(g(\xi^{i}_{\alpha}))<b(g(\xi^{n}_{\alpha})) for i<ni<n, we have that ht(eg(ξαi))<ht(eg(ξαn))=μht(e_{g(\xi^{i}_{\alpha})})<ht(e_{g(\xi^{n}_{\alpha})})=\mu. Then, eg(ξαi)Mμe_{g(\xi^{i}_{\alpha})}\in M_{\mu}. Also, F,xα1,,n1MμF,x_{\alpha}\mathord{\upharpoonright}_{1,...,n-1}\in M_{\mu}, which implies that FαMμF_{\alpha}\in M_{\mu}. This shows that FαF_{\alpha} is uncountable. To see this, remember that given a countable set LL, if LMμL\in M_{\mu} then LMμL\subseteq M_{\mu}. Therefore, the fact that FαMμF_{\alpha}\in M_{\mu}, ξαnFα\xi^{n}_{\alpha}\in F_{\alpha} but ξαnMμ\xi^{n}_{\alpha}\notin M_{\mu} shows that FαF_{\alpha} is uncountable.

From here, it is enough to follow the exposition of the consistency of SOCA(1\aleph_{1}) as in [11] Lemmas V.6.14 and V.6.15. The technique presented there is the club method used in [1]. The club method has two steps: the preparation and the cloning. For the preparation, we select open sets for each α<ω\alpha<\omega as we exposed here for Theorem 4.2.

Cloning resembles the technique in Theorem 3.5 where we use the oscillation of a discontinuous function, although the contexts are really different. The analogy comes from the fact that both techniques first find points in a set of accumulation points (FF and FαF_{\alpha} here and the oscillation in Theorem 3.5) to fix open sets (IsI_{s}, IrI_{r}, (,r)(-\infty,r) and (r,)(r,\infty) in Theorem 3.5). Afterwards, both technique uses those open sets to find actual elements of the original uncountable set that are compatible (elements of {(eg(ξα1),,eg(ξαn)):α<ω1}\{(e_{g(\xi^{1}_{\alpha})},...,e_{g(\xi^{n}_{\alpha})}):\alpha<\omega_{1}\} here and elements of KK in Theorem 3.5). ∎

We see these results as steps towards the consistency of SOCA(2\aleph_{2}).

Conjecture 4.7.

SOCA(2\aleph_{2}) is consistent.

Proving the conjecture would culminate the work that Ken and I talked so much about.

5 Once you see the stars

Once you see the stars, is impossible to forget them. I was Kenneth Kunen’s last student. He accepted to be my advisor even though he was already retired.

Being Ken’s student forced me to face freedom and taught me how to find questions on my own. I learned early on that Ken was not going to tell me which path to follow, but he was also not going to let me go astray if I needed him.

In 2020, Ken fell ill but, being as responsible and caring as he was, he attended the defence of my disertation [15] virtually. According to his family, a couple of days later he was hospitalized. He died on August 14, 2020, the same day as my birthday.

6 Acknowledgements

The author wants to kindly thank the editors of this issue, Juris Steprāns and the referee for all the suggestions and comments. They helped to improve this article to its current form. I also thank my son and wife for all the support they gave me during my PhD and the hard time that came after it.

References

  • [1] U. Abraham, M. Rubin, and S. Shelah. On the consistency of some partition theorems for continuous colorings, and the structure of 1\aleph_{1}-dense real order types. Ann. Pure Appl. Logic, 29(2):123–206, 1985.
  • [2] J. E. Baumgartner. All 1\aleph_{1}-dense sets of reals can be isomorphic. Fund. Math., 79(2):101–106, 1973.
  • [3] J. A. Corona-García and U. A. Ramos-García. OCA in strong choquet spaces. unpublished article, 2019.
  • [4] V. V. Filippov. Perfectly normal bicompacta. Dokl. Akad. Nauk SSSR, 189:736–739, 1969.
  • [5] F. Galvin. Partition theorems for the real line. Notices Amer. Math. Soc, 15(660):6, 1968.
  • [6] T. Gilton. Personal communucation. Made on April of 2016 during the 9th Appalachian Set Theory Workshop, 2015.
  • [7] T. Gilton and I. Neeman. Side conditions and iteration theorems. In Proceeeding of the 9th Appalachian Set Theory Workshop, 2017.
  • [8] T. Gilton and I. Neeman. Abraham-Rubin-Shelah open colorings and a large continuum. arXiv preprint arXiv:1904.10516, 2019.
  • [9] J. E. Hart and K. Kunen. Arcs in the plane. Topology and its Applications, 158(18):2503–2511, 2011.
  • [10] K. Kunen. Locally connected hereditarily Lindelöf compacta. Topology Appl., 158(18):2473–2478, 2011.
  • [11] K. Kunen. Set theory, volume 34 of Studies in Logic (London). College Publications, London, 2011.
  • [12] J. T. Moore. Continuous colorings associated with certain characteristics of the continuum. Discrete Math., 214(1-3):263–273, 2000.
  • [13] J. T. Moore. Open colorings, the continuum and the second uncountable cardinal. Proc. Amer. Math. Soc., 130(9):2753–2759, 2002.
  • [14] J. T. Moore and S. Todorcevic. Baumgartner’s isomorphism problem for 2\aleph_{2}-dense suborders of \mathds{R}. Arch. Math. Logic, 56(7-8):1105–1114, 2017.
  • [15] I. Ongay-Valverde. Relations between Set Theory and Computability Theory: the case for localization numbers and sets closed under Turing equivalence. The University of Wisconsin-Madison, 2020.
  • [16] S. Todorčević. Comparing the continuum with the first two uncountable cardinals. In Logic and Scientific Methods, pages 145–155. Springer, 1997.
  • [17] S. Todorčević. Partition problems in topology, volume 84 of Contemporary Mathematics. American Mathematical Society, Providence, RI, 1989.
  • [18] S. Todorčević and B. Veličković. Martin’s axiom and partitions. Compositio Math., 63(3):391–408, 1987.
  • [19] B. Veličković. Applications of the Open Coloring Axiom. In Set theory of the continuum (Berkeley, CA, 1989), volume 26 of Math. Sci. Res. Inst. Publ., pages 137–154. Springer, New York, 1992.