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

When is the complement of the diagonal of a LOTS functionally countable?

L. E. Gutiérrez-Domínguez  and  Rodrigo Hernández-Gutiérrez Departamento de Matemáticas, Universidad Autónoma Metropolitana campus Iztapalapa, Av. San Rafael Atlixco 186, Leyes de Reforma 1a Sección, Iztapalapa, 09310, Mexico city, Mexico [email protected] [email protected]
Abstract.

In a 2021 paper, Tkachuk asked whether there is a non-separable LOTS XX such that X2{x,x:xX}X^{2}\setminus\{\langle x,x\rangle\colon x\in X\} is functionally countable. In this paper we prove that such a space, if it exists, must be an Aronszajn line and admits a 2\leq 2-to-11 retraction to a subspace that is a Souslin line. After this, assuming the existence of a Souslin line, we prove that there is Souslin line that is functionally countable. Finally, we present an example of a functionally countable Souslin line LL such that L2{x,x:xL}L^{2}\setminus\{\langle x,x\rangle\colon x\in L\} is not functionally countable.

Key words and phrases:
functionally countable, linearly ordered space, Aronszajn line, Souslin line
2020 Mathematics Subject Classification:
Primary: 54F05, Secondary: 06A05, 54A35, 54C30.

1. Introduction

A topological space XX is functionally countable if for every continuous function f:Xf\colon X\to\mathbb{R} the image f[X]f[X] is countable. The diagonal of a space XX is the subset ΔX={x,x:xX}\Delta_{X}=\{\langle x,x\rangle\colon x\in X\} of X×XX\times X. In [8], Tkachuk studies spaces XX such that X2ΔXX^{2}\setminus\Delta_{X} is functionally countable. In this note we are interested in the following of Tkachuk’s questions from that paper.

1. Question

[8] Let XX be a linearly ordered space such that X2ΔXX^{2}\setminus\Delta_{X} is functionally countable. Is XX separable?

Under the assumption that XX is compact, in [8] Tkachuk proved that Question 1 has an affirmative answer. In this paper we show that it is consistent with the 𝖹𝖥𝖢\mathsf{ZFC} axioms that the answer to Tkachuk’s Question 1 is in the affirmative without any further topological assumption. In fact, we prove something stronger. Namely, if XX is an uncountable linearly ordered space such that X2ΔXX^{2}\setminus\Delta_{X} is functionally countable, then XX must be an Aronszajn line and there is a Souslin line YXY\subset X and a retraction f:XYf\colon X\to Y; see Theorem 11 below for a more precise statement. Since the existence of Souslin lines is independent of 𝖹𝖥𝖢\mathsf{ZFC}, it is consistent that any space XX satifsying the hypotheses of Tkachuk’s Question 1 is countable.

We also explore the question of whether there is a Souslin line XX such that X2ΔXX^{2}\setminus\Delta_{X} is functionally countable. First, we show that if there is a Souslin line, then there is a functionally countable Souslin line; see Theorem 18 below. This result answers various questions from [9] (see the discussion following). After this we prove that functional countability of a Souslin line XX does not imply that X2ΔXX^{2}\setminus\Delta_{X} is functionally countable; see Theorem 23 below.

2. Preliminaries: linearly ordered sets

In this section we remind the reader about some definitions in the theory of linearly ordered spaces.

Let X,<\langle X,<\rangle be a linearly ordered set. We will assume familiarity with intervals of the form (a,b)(a,b), (,a)(\leftarrow,a), (a,)(a,\rightarrow), [a,b][a,b], (,a](\leftarrow,a] and [a,)[a,\rightarrow), where a,bXa,b\in X. The endpoints of a subset YXY\subset X are min(Y)\min(Y) and max(Y)\max(Y), if they exist. A subset YXY\subset X is said to be densely ordered if for every a,bYa,b\in Y with a<ba<b there exists c(a,b)Yc\in(a,b)\cap Y. A set JXJ\subset X is convex if for all a,bJa,b\in J, a<ba<b implies that (a,b)J(a,b)\subset J. If A,BXA,B\subset X we will say that A<sBA<_{s}B (“AA is setwise before BB”) if for every aAa\in A and bBb\in B, a<ba<b.

Let X,<\langle X,<\rangle and Y,<\langle Y,<\rangle be linearly ordered sets, and let f:XYf\colon X\to Y. If x0<x1x_{0}<x_{1} implies f(x0)<f(x1)f(x_{0})<f(x_{1}) for all x0,x1Xx_{0},x_{1}\in X, we will say that ff is an order embedding. If ff is an order embedding, we will say that YY contains an ordered copy of XX, or that XX can be order-embedded in YY. If ff is also surjective, then it is called an order isomorphism and XX is said to be order isomorphic to YY.

It is well known that for every linearly ordered set X,<\langle X,<\rangle there is a linearly ordered set Y,<\langle Y,<\rangle and an order embedding e:XYe\colon X\to Y such that

  • YY is Dedekind complete, that is, every nonempty subset of YY has a supremum and an infinum, and

  • e[X]e[X] is topologically dense in YY, that is, every nonempty open interval in YY contains an element of e[X]e[X].

Such YY is unique (modulo order isomorphisms) and is the Dedekind completion of XX.

Given a linearly ordered set X,<\langle X,<\rangle, its order topology is the topology τ<\tau_{<} generated by all intervals (,a)(\leftarrow,a) and (a,)(a,\rightarrow) for aXa\in X; X,τ<\langle X,\tau_{<}\rangle is called a linearly ordered topological space (LOTS). A generalized ordered space (GO space) is a subspace of a LOTS. Equivalently, one can say that X,τ\langle X,\tau\rangle is a GO space if and only if there is a linear order << such that τ<τ\tau_{<}\subset\tau and τ\tau has a basis of open sets that are convex; see [6, Chapter VII, 1, A]. In general, a subspace of a LOTS will not be a LOTS but it is easy to see that a subspace YY of a LOTS XX is a LOTS if YY is closed in XX or YY is densely ordered.

Let XX be a LOTS and UU a non-empty open subset of XX. Then UU is the union of a collection of convex open subsets. If we take maximal convex open subsets of UU, we may refer to them as the convex components of the open set UU.

We will consider the ordinal ω1\omega_{1} with its canonical order; ω1\omega_{1}^{\ast} will denote ω1\omega_{1} with the reverse of its canonical order. The existence of ordered copies of ω1\omega_{1} or ω1\omega_{1}^{\ast} is related to first countability in the following way.

2. Lemma

Let YY be a Dedekind complete linearly ordered set and let XYX\subset Y be topologically dense in YY. Then the following are equivalent:

  1. (a)

    XX contains no ordered copy of neither ω1\omega_{1} nor ω1\omega_{1}^{\ast},

  2. (b)

    YY contains no ordered copy of neither ω1\omega_{1} nor ω1\omega_{1}^{\ast}, and

  3. (c)

    YY is first countable with the order topology.

The proof of Lemma 2 is well known and we will not include it. The proof that (a) implies (b) can be found in the recent paper [9, Proposition 3.4].

A linearly ordered set is an Aronszajn line if it is uncountable and has no ordered copies of ω1\omega_{1}, ω1\omega_{1}^{\ast} or any uncountable subset of \mathbb{R}. A Souslin line is a linearly ordered set that with its order topology has countable cellularity (every pairwise disjoint family of open sets is countable) but is not separable (no countable subset is topologically dense). Aronszajn lines exist in 𝖹𝖥𝖢\mathsf{ZFC} (see section 5 in [10]) but it is well known that the existence of Souslin lines is independent of the 𝖹𝖥𝖢\mathsf{ZFC} axioms (see sections III.5 and III.7 in [5]). A relation between Aronszajn lines and Souslin lines can be found in [10, Corollary 3.10].

As it is well known (see [1]), LOTS are hereditarily normal so we will remain in the realm of Tychonoff spaces in our discussion. For a survey of the theory of ordered spaces relevant here from a set-theoretic perspective, see [10]. For a complete survey of properties of LOTS and GO spaces, see [1].

3. Conditions that a counterexample must satisfy

First, let us make the observation that by considering GO spaces we do not get a more difficult problem than that for LOTS. Start with a GO space X,τ\langle X,\tau\rangle such that X2ΔXX^{2}\setminus\Delta_{X} is functionally countable. Let << be a linear order such that τ<τ\tau_{<}\subset\tau (see the previous section) and let YY denote XX with the topology τ<\tau_{<}. Notice that the identity function 𝗂𝖽:XY\mathsf{id}\colon X\to Y is a continuous bijection. But then by considering 𝗂𝖽×𝗂𝖽:X2Y2\mathsf{id}\times\mathsf{id}\colon X^{2}\to Y^{2} and letting ϕ=(𝗂𝖽×𝗂𝖽)(X2ΔX)\phi=(\mathsf{id}\times\mathsf{id})\restriction(X^{2}\setminus\Delta_{X}) we obtain a continuous bijection ϕ:X2ΔXY2ΔY\phi\colon X^{2}\setminus\Delta_{X}\to Y^{2}\setminus\Delta_{Y}. Then YY is a LOTS and, according to [8, Proposition 3.1 (a)], Y2ΔYY^{2}\setminus\Delta_{Y} is functionally countable. Thus, we may restrict our discussion to LOTS (compare with the observation made in [9] before 3.14).

A space XX satisfies the discrete countable chain condition, DCCC for short, if every discrete collection of nonempty open subsets of XX is countable. As observed in [8, Proposition 3.1 (c)], if a space is functionally countable, then it satisfies the DCCC. Thus, a way to prove that a space is not functionally countable is to prove that it does not satisfy the DCCC.

Next, we will prove the following technical result that will allow us to define discrete families of open sets; essentially we are extracting one of the components of the proof of Theorem 3.13 in [8].

3. Lemma

Let XX be a LOTS. Assume that there exists a family 𝒰\mathcal{U} of subsets of XX such that

  1. (i)

    for each U𝒰U\in\mathcal{U} there are nonempty open sets IU,JUUI_{U},J_{U}\subset U with IU<sJUI_{U}<_{s}J_{U}, and

  2. (ii)

    if U,V𝒰U,V\in\mathcal{U} and UVU\neq V, then U<sVU<_{s}V or V<sUV<_{s}U.

Then {IU×JU:U𝒰}\{I_{U}\times J_{U}\colon U\in\mathcal{U}\} is a discrete collection of nonempty open subsets of X2ΔXX^{2}\setminus\Delta_{X}

Proof.

Let x,yXx,y\in X such that xyx\neq y, we need to find an open set WX2W\subset X^{2} such that x,yW\langle x,y\rangle\in W and |{U𝒰:(IU×JU)W}|1\lvert\{U\in\mathcal{U}\colon(I_{U}\times J_{U})\cap W\neq\emptyset\}\rvert\leq 1.

First, consider the case when y<xy<x. Let W0W_{0} and W1W_{1} be open subsets of XX such that yW0(,x)y\in W_{0}\subset(\leftarrow,x), xW1(y,)x\in W_{1}\subset(y,\rightarrow) and W0W1=W_{0}\cap W_{1}=\emptyset. Then W=W0×W1W=W_{0}\times W_{1} is such that x,yW\langle x,y\rangle\in W and (IU×JU)W=(I_{U}\times J_{U})\cap W=\emptyset for all U𝒰U\in\mathcal{U}.

So assume that x<yx<y. We divide our analysis in four cases:

Case 1.

There are U0,U1𝒰U_{0},U_{1}\in\mathcal{U} with U0,U1U_{0},U_{1} such that (IU0JU0)(x,y)(I_{U_{0}}\cup J_{U_{0}})\cap(x,y)\neq\emptyset and (IU1JU1)(x,y)(I_{U_{1}}\cup J_{U_{1}})\cap(x,y)\neq\emptyset.

By our hypothesis we may assume that U0<sU1U_{0}<_{s}U_{1}. Let p(IU0JU0)(x,y)p\in(I_{U_{0}}\cup J_{U_{0}})\cap(x,y) and q(IU1JU1)(x,y)q\in(I_{U_{1}}\cup J_{U_{1}})\cap(x,y). Notice that x<p<q<yx<p<q<y. Let W=(,p)×(q,)W=(\leftarrow,p)\times(q,\rightarrow). Then WW is an open subset of X2X^{2} such that x,yW\langle x,y\rangle\in W; we claim that W(IV×JV)=W\cap(I_{V}\times J_{V})=\emptyset for every V𝒰V\in\mathcal{U}.

Let V𝒰V\in\mathcal{U} and a,bW\langle a,b\rangle\in W. If V=U0V=U_{0} or V<sU0V<_{s}U_{0}, since b>qb>q and qIU1JU1q\in I_{U_{1}}\cup J_{U_{1}}, bJVb\notin J_{V}; thus, a,bIV×JV\langle a,b\rangle\notin I_{V}\times J_{V}. If U0<sVU_{0}<_{s}V, since a<pa<p and pIU0JU0p\in I_{U_{0}}\cup J_{U_{0}}, aIVa\notin I_{V}; thus, a,bIV×JV\langle a,b\rangle\notin I_{V}\times J_{V}.

Case 2.

There exists a unique U𝒰U\in\mathcal{U} such that (IUJU)(x,y)(I_{U}\cup J_{U})\cap(x,y)\neq\emptyset.

Let z(IUJU)(x,y)z\in(I_{U}\cup J_{U})\cap(x,y) and W=(,z)×(z,)W=(\leftarrow,z)\times(z,\rightarrow). Clearly, x,yW\langle x,y\rangle\in W; we claim that W(IV×JV)=W\cap(I_{V}\times J_{V})=\emptyset for every V𝒰{U}V\in\mathcal{U}\setminus\{U\}.

So let V𝒰V\in\mathcal{U} with UVU\neq V and a,bW\langle a,b\rangle\in W. If V<sUV<_{s}U, since z<bz<b and zIUJUz\in I_{U}\cup J_{U}, we conclude that bJVb\notin J_{V}; thus, a,bIV×JV\langle a,b\rangle\notin I_{V}\times J_{V}. If U<sVU<_{s}V, since a<za<z and zIUJUz\in I_{U}\cup J_{U}, we convince ourselves that aIVa\notin I_{V}; thus, a,bIV×JV\langle a,b\rangle\notin I_{V}\times J_{V}.

Case 3.

There exists U𝒰U\in\mathcal{U} such that IU(,x]I_{U}\subset(\leftarrow,x] and JU[y,)J_{U}\subset[y,\rightarrow).

Let W=(,y)×(x,)W=(\leftarrow,y)\times(x,\rightarrow), notice that x,yW\langle x,y\rangle\in W. We claim that W(IV×JV)=W\cap(I_{V}\times J_{V})=\emptyset for every V𝒰{U}V\in\mathcal{U}\setminus\{U\}.

So let V𝒰V\in\mathcal{U} with UVU\neq V and a,bW\langle a,b\rangle\in W. If V<sUV<_{s}U, since JV(,x]J_{V}\subset(\leftarrow,x] and x<bx<b, bJVb\notin J_{V}; therefore, a,bIV×JV\langle a,b\rangle\notin I_{V}\times J_{V}. If U<sVU<_{s}V, since IV[y,)I_{V}\subset[y,\rightarrow) and a<ya<y, aIVa\notin I_{V}; therefore, a,bIV×JV\langle a,b\rangle\notin I_{V}\times J_{V}.

Case 4.

For every U𝒰U\in\mathcal{U} either (IUJU)(,x](I_{U}\cup J_{U})\subset(\leftarrow,x] or (IUJU)[y,)(I_{U}\cup J_{U})\subset[y,\rightarrow).

In this case we also take W=(,y)×(x,)W=(\leftarrow,y)\times(x,\rightarrow). Again, x,yW\langle x,y\rangle\in W. We claim that W(IU×JU)=W\cap(I_{U}\times J_{U})=\emptyset for every U𝒰U\in\mathcal{U}.

Let U𝒰U\in\mathcal{U} and a,bW\langle a,b\rangle\in W. If IUJU(,x]I_{U}\cup J_{U}\subset(\leftarrow,x], since x<bx<b, bJUb\notin J_{U} and thus, a,bIU×JU\langle a,b\rangle\notin I_{U}\times J_{U}. If IUJU[y,)I_{U}\cup J_{U}\subset[y,\rightarrow), since a<ya<y, aIUa\notin I_{U} and thus, a,bIU×JU\langle a,b\rangle\notin I_{U}\times J_{U}.

Since these are all the possible cases, we conclude that {IU×JU:U𝒰}\{I_{U}\times J_{U}\colon U\in\mathcal{U}\} is discrete. ∎

In 1983, Galvin [7] asked if the product of two functionally countable spaces is functionally countable. Independently of each other, Hernández and K.P. Hart solved this question in the negative. The solution given by Hernández appears in [2], where he proves that the product of the LOTS ω1\omega_{1} and the GO subspace {α+1:αω1}{ω1}\{\alpha+1\colon\alpha\in\omega_{1}\}\cup\{\omega_{1}\} of ω1+1\omega_{1}+1 is not functionally countable. We essentially apply Hernandez’s idea along with Lemma 3 here to prove the following.

4. Proposition

Let XX be a LOTS. If XX contains an ordered copy of either ω1\omega_{1} or ω1\omega_{1}^{\ast}, then X2ΔXX^{2}\setminus\Delta_{X} does not satisfty the DCCC and thus, it is not functionally countable.

Proof.

Assume that XX contains an ordered copy of ω1\omega_{1}. So there is {xα:α<ω1}X\{x_{\alpha}\colon\alpha<\omega_{1}\}\subset X such that α<β<ω1\alpha<\beta<\omega_{1} implies xα<xβx_{\alpha}<x_{\beta}.

Given α<ω1\alpha<\omega_{1} there are unique ordinals β<ω1\beta<\omega_{1} that is a limit or 0 and n<ωn<\omega such that α=β+n\alpha=\beta+n; define Uα=(xβ+3n,xβ+3n+3)U_{\alpha}=(x_{\beta+3n},x_{\beta+3n+3}). Then it is easy to see that the family 𝒰={Uα:α<ω1}\mathcal{U}=\{U_{\alpha}\colon\alpha<\omega_{1}\} satisfies the hypothesis of Lemma 3. Thus, XX does not satisfy the DCCC.

If XX contains an ordered copy of ω1\omega_{1}^{\ast}, we may follow an analogous argument to conclude that XX does not satisfy the DCCC. ∎

In particular, from Lemma 2 we can conclude that if XX is a LOTS with X2ΔXX^{2}\setminus\Delta_{X} functionally countable, then XX is first countable. Our next step is proving that XX must be a Aronszajn line; we will need the following.

5. Proposition

If XX is a functionally countable LOTS, then XX does not contain order isomorphic copies of uncountable subsets of \mathbb{R}.

Proof.

We prove the contrapositive implication. Let XX be a LOTS and assume that there is an uncountable YXY\subset X such that there is an order embedding e:Ye\colon Y\to\mathbb{R}; call e[Y]=Ze[Y]=Z. Without loss of generality we may assume that ZZ is bounded in \mathbb{R}. We will find an uncountable AYA\subset Y and define a continuous function f:Xf\colon X\to\mathbb{R} such that fAf\restriction A is injective.

First, let \mathcal{I} be the collection of all open intervals II of \mathbb{R} of the form (a,b)(a,b), where a,ba,b are rational numbers and a<ba<b, such that IZI\cap Z is countable. Let Z0=Z()Z_{0}=Z\cap(\bigcup\mathcal{I}). Then Z0Z_{0} is countable.

Next, let Z1Z_{1} be the set of points xZZ0x\in Z\setminus Z_{0} such that xx is either an immediate succesor or an immediate predecesor of a point in ZZ0Z\setminus Z_{0}. Since c()=ωc(\mathbb{R})=\omega, Z1Z_{1} is countable. Let p=inf(ZZ0)p=\inf(Z\setminus Z_{0}) and q=sup(ZZ0)q=\sup(Z\setminus Z_{0}). Define Z2=Z(Z0Z1{p,q})Z_{2}=Z\setminus(Z_{0}\cup Z_{1}\cup\{p,q\}).

Notice that Z2Z_{2} is an uncountable subset without endpoints satisfying the following property: if a,bZ2a,b\in Z_{2} with a<ba<b, then (a,b)Z2(a,b)\cap Z_{2} is uncountable. Since \mathbb{R} is second countable, Z2Z_{2} has a countable, topologically dense set DZ2D\subset Z_{2}. Then it follows that every time a,bZ2a,b\in Z_{2} and a<ba<b, there exists dDd\in D such that a<d<ba<d<b.

Finally, let A=e[Z2]A=e^{\leftarrow}[Z_{2}] and Q=e[D]Q=e^{\leftarrow}[D]. Since ee is an order embedding, we conclude the following properties:

  1. (i)

    QQ is countable, densely ordered and has no endpoints.

  2. (ii)

    If a,bAa,b\in A and a<ba<b, then there are p,qQp,q\in Q with a<p<q<ba<p<q<b.

As it was famously shown by Cantor, condition (i) implies that QQ is order-isomorphic to the rationals \mathbb{Q}. So we may choose an order isomorphism i:Q(0,1)i\colon Q\to\mathbb{Q}\cap(0,1). Then we define a function f:X[0,1]f\colon X\to[0,1] by

f(x)={0, if {x}<sQ, andsup{i(q):qQ,qx}, otherwise.f(x)=\left\{\begin{array}[]{ll}0,&\textrm{ if }\{x\}<_{s}Q,\textrm{ and}\\ \sup\{i(q)\colon q\in Q,q\leq x\},&\textrm{ otherwise}.\end{array}\right.

It is well known (and can be easily checked by the reader) that ff is continuous. By condition (ii) above it follows that fAf\restriction A is injective. Thus, XX is not functionally countable. ∎

If X2ΔXX^{2}\setminus\Delta_{X} is functionally countable, from [8, Proposition 3.2] we know that XX is functionally countable. Thus, using Propositions 4 and 5 we conclude the following.

6. Theorem

Let XX be a LOTS such that X2ΔX^{2}\setminus\Delta is functionally countable. If XX is uncountable, then XX is an Aronszajn line.

We pause to discuss the proof of Proposition 5. In [9, Theorem 3.10] it was proved that any functionally countable GO space XX has the property that every countable subset of XX has its closure countable. This sounds very similar to what we proved in Proposition 5. Could we use [9, Theorem 3.10] to give a shorter proof of Proposition 5?

In short, we would like to know whether every LOTS with the property that the closure of every countable subset is countable does not contain order isomorphic copies of uncountable subsets of \mathbb{R}. First, notice that there are counterexamples if we consider GO spaces.

7. Observation

There exists a GO space XX with the property that every countable subset of XX has a countable closure but XX contains an uncountable subset that is order isomorphic to \mathbb{R}, and thus, XX is not functionally countable.

Proof.

Let X=(×{0,2})(×{1})X=(\mathbb{Q}\times\{0,2\})\cup(\mathbb{R}\times\{1\}) with the subspace topology of ×3\mathbb{R}\times 3 with the lexicographic order. ∎

In [9, Question 4.7] it was asked if every monotonically normal space of countable extent with the property that the closure of every countable subset is countable, is functionally countable. Recall that GO spaces are monotonically normal ([3, Corollary 5.6]). However, the example of Observation 7 does not have countable extent. As observed in [9, Proposition 3.1], every functionally countable GO space has countable extent. Thus, we may ask the following.

8. Question

Let XX be a GO space where every countable subset has its closure countable. Does it follow that XX contains no order-isomorphic copies of uncountable subsets of \mathbb{R} if either

  1. (a)

    XX is a LOTS or

  2. (b)

    XX has countable extent?

Notice that at the end of [9, Observation 3.11], the authors of that paper make a question that is similar to Question 8.

By looking at the proof of Tkachuk’s Theorem 3.13 from [8], one can notice that some special kinds of isolated points of LOTS have an important role in the proof. It turns out that we will also have to juggle with this kind of points, so we give them a name as follows.

9. Definition

Let X,<\langle X,<\rangle a linearly ordered set and xXx\in X. We will say that xx is lonely if any of the following hold:

  1. (1)

    x=minXx=\min X and there is aXa\in X with x<ax<a, (x,a)=(x,a)=\emptyset, (a,)(a,\rightarrow)\neq\emptyset and a=inf(a,)a=\inf(a,\rightarrow),

  2. (2)

    x=maxXx=\max X and there is aXa\in X with a<xa<x, (a,x)=(a,x)=\emptyset, (,a)(\leftarrow,a)\neq\emptyset and a=sup(,a)a=\sup(\leftarrow,a), or

  3. (3)

    there are a,bXa,b\in X such that a<x<ba<x<b, (a,x)==(x,b)(a,x)=\emptyset=(x,b), (,a)(b,)(\leftarrow,a)\neq\emptyset\neq(b,\rightarrow), a=sup(,a)a=\sup(\leftarrow,a) and b=inf(b,)b=\inf(b,\rightarrow).

Notice that every lonely point in a LOTS is an isolated point but not the other way around since there may be consecutive isolated points.

10. Theorem

Let XX be an uncountable LOTS such that X2ΔXX^{2}\setminus\Delta_{X} is functionally countable. Then there is a Souslin line YXY\subset X and a continuous function f:XYf\colon X\to Y with convex fibers of cardinality less than or equal to 22.

Proof.

Let UU be the set of lonely points of XX, as defined in Definition 9, and let Y=XUY=X\setminus U. Notice that since YY is a closed subspace of XX, it is a LOTS with the subspace topology. We define f:XYf\colon X\to Y in the following way.

  1. (i)

    If xYx\in Y, let f(x)=xf(x)=x.

  2. (ii)

    If x=maxXx=\max X and xUx\in U, let f(x)f(x) be the immediate predecesor of xx.

  3. (iii)

    If xUx\in U and xmaxXx\neq\max X, let f(x)f(x) be the immediate succesor of xx.

It should be clear that ff is continuous and that the fibers of ff are convex with cardinality less than or equal to 22.

First, notice that YY is uncountable. If UU is countable, then this is clear. Otherwise, since fUf\restriction U is clearly injective, f[U]f[U] is an uncountable subset of YY.

Next, let us prove that YY is not separable. By [8, Proposition 3.2], XX is functionally countable. Then by [8, Proposition 3.1(a)] the continuous image YY of XX is functionally countable. If DYD\subset Y is countable, by [9, Theorem 3.10] we conclude that D¯\overline{D} is countable so DD is not dense in YY.

Now, let us prove that c(Y)=ωc(Y)=\omega by assuming the opossite. We would like to apply Lemma 3 to conclude that Y2ΔYY^{2}\setminus\Delta_{Y} does not safisfy the DCCC.

Claim.

There is a pairwise disjoint, ω1\omega_{1}-size collection 𝒱\mathcal{V} of open convex subsets of YY, each of cardinality at least 22.

Define A={xY:{x} is open}A=\{x\in Y\colon\{x\}\textrm{ is open}\}. Assume first that AA is countable. Let 𝒰\mathcal{U} be a collection of ω1\omega_{1}-many open nonempty intervals of YY that are pairwise disjoint. Then there are only countably many elements of 𝒰\mathcal{U} that intersect AA; let 𝒱\mathcal{V} be the collection of all elements of 𝒰\mathcal{U} that do not intersect AA. Then 𝒱\mathcal{V} is of cardinality ω1\omega_{1} and each of its elements is infinite. Thus, 𝒱\mathcal{V} satisfies the conditions in the claim.

Next, consider the case when AA is uncountable. Given a,bAa,b\in A we define aba\sim b if either a=ba=b or [min{a,b},max{a,b}][\min\{a,b\},\max\{a,b\}] is finite. It is easily seen that \sim is an equivalence relation on AA; let =A/\mathcal{E}=A/{\sim} be the set of equivalence classes. Moreover, every element of \mathcal{E} is convex. By the definition of YY it can be shown that every element of \mathcal{E} is of cardinality at least 22. It can also be easily shown that every element of \mathcal{E} is order isomorphic to one of the following ordered sets:

  1. (1)

    a natural number greater than or equal to 22,

  2. (2)

    the set of natural numbers ω\omega,

  3. (3)

    the linearly ordered set ω\omega^{\ast}, which is the reverse order of ω\omega, or

  4. (4)

    the integers \mathbb{Z}.

Thus, every element of \mathcal{E} is a countable open set with at least two points. Since AA is uncountable, \mathcal{E} is uncountable as well. Thus, we may take 𝒱\mathcal{V} to be any subcollection of \mathcal{E} of size ω1\omega_{1} and the conditions in the claim are satisfied.Thus, we may write 𝒱={Vα:α<ω1}\mathcal{V}=\{V_{\alpha}\colon\alpha<\omega_{1}\} and for each α<ω1\alpha<\omega_{1}, IαI_{\alpha} and JαJ_{\alpha} are nonempty open subsets with IαJαVαI_{\alpha}\cup J_{\alpha}\subset V_{\alpha} and Iα<sJαI_{\alpha}<_{s}J_{\alpha}. By Lemma 3 we conclude that {Iα×Jα:α<ω1}\{I_{\alpha}\times J_{\alpha}\colon\alpha<\omega_{1}\} is a discrete family in Y2ΔYY^{2}\setminus\Delta_{Y}.

Let us define a function g:X2ΔXY2g\colon X^{2}\setminus\Delta_{X}\to Y^{2} by g(x,y)=f(x),f(y)g(\langle x,y\rangle)=\langle f(x),f(y)\rangle for all x,yX2Δ\langle x,y\rangle\in X^{2}\setminus\Delta. We will prove that {g[Iα×Jα]:α<ω1}\{g^{\leftarrow}[I_{\alpha}\times J_{\alpha}]\colon\alpha<\omega_{1}\} is a discrete family in X2ΔXX^{2}\setminus\Delta_{X}. Let x0,x1X2ΔX\langle x_{0},x_{1}\rangle\in X^{2}\setminus\Delta_{X}.

If f(x0)f(x1)f(x_{0})\neq f(x_{1}) we know that g(x0,x1)=f(x0),f(x1)Y2ΔYg(\langle x_{0},x_{1}\rangle)=\langle f(x_{0}),f(x_{1})\rangle\in Y^{2}\setminus\Delta_{Y} so there exists an open set WY2ΔYW\subset Y^{2}\setminus\Delta_{Y} with g(x0,x1)Wg(\langle x_{0},x_{1}\rangle)\in W and WW intersects at most one element of {Iα×Jα:α<ω1}\{I_{\alpha}\times J_{\alpha}\colon\alpha<\omega_{1}\}. Thus, g[W]g^{\leftarrow}[W] is an open subset of X2ΔXX^{2}\setminus\Delta_{X} with x0,x1g[W]\langle x_{0},x_{1}\rangle\in g^{\leftarrow}[W] and such that g[W]g^{\leftarrow}[W] intersects at most one element of {g[Iα×Jα]:α<ω1}\{g^{\leftarrow}[I_{\alpha}\times J_{\alpha}]\colon\alpha<\omega_{1}\}.

Now, assume that f(x0)=f(x1)f(x_{0})=f(x_{1}). Then, by the definition of YY and ff, one of x0x_{0} or x1x_{1} must be a lonely point. We will assume that x0<x1x_{0}<x_{1}, that x1maxXx_{1}\neq\max X, and thus, that x0x_{0} is lonely; the other cases can be treated in a similar way. Since x0x_{0} is isolated, W={x0}×(x0,)W=\{x_{0}\}\times(x_{0},\rightarrow) is an open set such that x0,x1W\langle x_{0},x_{1}\rangle\in W. If α<ω1\alpha<\omega_{1} notice that Wg[Iα×Jα]W\cap g^{\leftarrow}[I_{\alpha}\times J_{\alpha}]\neq\emptyset is equivalent to W(f[Iα]×f[Jα])W\cap(f^{\leftarrow}[I_{\alpha}]\times f^{\leftarrow}[J_{\alpha}])\neq\emptyset, which implies that x0f[Iα]x_{0}\in f^{\leftarrow}[I_{\alpha}]; that is, f(x0)Iαf(x_{0})\in I_{\alpha}. Since the elements of 𝒱\mathcal{V} are pairwise disjoint, this can only happen for at most one value of α\alpha. That is, there is at most one element of {g[Iα×Jα]:α<ω1}\{g^{\leftarrow}[I_{\alpha}\times J_{\alpha}]\colon\alpha<\omega_{1}\} that intersects WW.

Thus, we have proved that {g[Iα×Jα]:α<ω1}\{g^{\leftarrow}[I_{\alpha}\times J_{\alpha}]\colon\alpha<\omega_{1}\} is an uncountable discrete family of X2ΔXX^{2}\setminus\Delta_{X}, which is impossible since X2ΔX^{2}\setminus\Delta is assumed to be functionally countable. From this contradiction, we conclude that c(Y)=ωc(Y)=\omega and thus, YY is a Souslin line. ∎

By joining the statements of Theorems 6 and 10 we conclude the following.

11. Theorem

Assume that XX is an uncountable LOTS with X2ΔXX^{2}\setminus\Delta_{X} functionally countable. Then

  • XX is an Aronszajn line,

  • Y=X{xX:x is lonely}Y=X\setminus\{x\in X\colon x\textrm{ is lonely}\} is a Souslin line, and

  • there is a retraction f:XYf\colon X\to Y with convex fibers of cardinality less than or equal to 22.

Thus, in any model of 𝖹𝖥𝖢\mathsf{ZFC} without Souslin lines we obtain an answer to Tkachuk’s question 1.

12. Corollary

Assume that there are no Souslin lines. Let XX be a LOTS such that X2ΔXX^{2}\setminus\Delta_{X} is functionally countable. Then XX is countable.

4. Functionally countable Souslin lines

If we are looking for counterexamples to Tkachuk’s Question 1, according to Theorem 11, one possibility is that such counterexample is a densely ordered Souslin line. Thus, in this section we tackle the question of whether it is consistent that there is a Souslin line LL such that L2ΔLL^{2}\setminus\Delta_{L} is functionally countable. We were unable to solve this question, but we will be proving some related results.

In [8, Proposition 3.2] it was proved that if a space XX is such that X2ΔXX^{2}\setminus\Delta_{X} is functionally countable, then XX is functionally countable.

13. Observation

If there is a Souslin line, there is a Souslin line XX that is not functionally countable and, thus, X2ΔXX^{2}\setminus\Delta_{X} is not functionally countable.

Proof.

By [5, Exercise III.5.33] we may assume that there is a Souslin line XX that is connected with the order topology. Let a,bXa,b\in X be such that a<ba<b. By Urysohn’s lemma there exists a continuous function f:X[0,1]f\colon X\to[0,1] such that f(a)=0f(a)=0 and f(b)=1f(b)=1. Since XX is connected, the image of ff is a connected subset of [0,1][0,1] containing both endpoints 0 and 11. Thus, ff is surjective and XX is not functionally countable. ∎

Next, we prove that the existence of a Souslin line implies the existence of a functionally countable Souslin line. In order to prove this, we first need to understand more about real-valued continuous functions defined on Souslin lines. Recall there is a well-known result that says that the real-valued continuous functions in a separable space are determined once we know their value on a countable dense subset. In Proposition 16 below, we present a generalization of this for densely ordered LOTS with countable cellularity. Before, we establish two elementary facts which we were unable to find in the literature.

14. Lemma

If XX is a LOTS with c(X)=ωc(X)=\omega, then XX is first countable.

Proof.

We prove the contrapositive implication. Assume that XX is not first countable. By Lemma 2, we may assume that there exists {xα:α<ω1}X\{x_{\alpha}\colon\alpha<\omega_{1}\}\subset X such that α<β<ω1\alpha<\beta<\omega_{1} implies xα<xβx_{\alpha}<x_{\beta}. For α<ω1\alpha<\omega_{1}, there are unique ordinals β<ω1\beta<\omega_{1} that is a limit or 0 and n<ωn<\omega such that α=β+n\alpha=\beta+n; let Uα=(xβ,xβ+2)U_{\alpha}=(x_{\beta},x_{\beta+2}). Then {Uα:α<ω1}\{U_{\alpha}\colon\alpha<\omega_{1}\} is an uncountable, pairwise disjoint collection of nonempty open subsets of XX. Thus, c(X)>ωc(X)>\omega. ∎

15. Lemma

Let XX be a densely ordered LOTS with no endpoints such that c(X)=ωc(X)=\omega. Then for every nonempty convex open set UU there exists {an,bn:nω}U\{a_{n},b_{n}\colon n\in\omega\}\subset U such that an<bna_{n}<b_{n} for each nωn\in\omega and U=nω(an,bn)U=\bigcup_{n\in\omega}(a_{n},b_{n}).

Proof.

To simplify the proof, let us assume that XYX\subset Y, where YY is the Dedekind completion of XX. By Lemma 14 and the fact that XX is dense in YY, YY is first countable.

Let UXU\subset X be nonempty open and convex. Define p=infUp=\inf U and q=supUq=\sup U; these two points exist in YY but not necessarily in XX. Let also x0Ux_{0}\in U.

First, let us argue that p,qUp,q\notin U. If pUp\in U then p=min(U)p=\min{(U)}. Since XX has no endpoints, by definition of the order topology in XX there exist x,yXx,y\in X with p(x,y)XUp\in(x,y)\cap X\subset U. But since XX is densely ordered, (x,p)X(x,p)\cap X is a nonempty subset of UU, which is a contradiction. We arrive at a similar contradiction if we asssume that qUq\in U.

Let {B(p,n):nω}\{B(p,n)\colon n\in\omega\} and {B(q,n):nω}\{B(q,n)\colon n\in\omega\} be countable local bases at pp and qq, respectively. Since YY is densely ordered, we may recursively find {yn:n}(p,q)\{y_{n}\colon n\in\mathbb{Z}\}\subset(p,q) with the following properties:

  1. (a)

    y0=x0y_{0}=x_{0},

  2. (b)

    if n<ωn<\omega then y(n+1)(p,yn)UB(p,n)y_{-(n+1)}\in(p,y_{-n})\cap U\cap B(p,n), and

  3. (c)

    if n<ωn<\omega then yn+1(yn,q)UB(q,n)y_{n+1}\in(y_{n},q)\cap U\cap B(q,n).

Then, for each nωn\in\omega, since XX is topologically dense in YY, let an(y(n+1),yn)Xa_{n}\in(y_{-(n+1)},y_{n})\cap X and bn(yn,yn+1)Xb_{n}\in(y_{n},y_{n+1})\cap X. It is not hard to see that {an,bn:nω}\{a_{n},b_{n}\colon n\in\omega\} is as required. ∎

16. Proposition

Let XX be a densely ordered LOTS with c(X)=ωc(X)=\omega, let MM be a second countable regular space and let f:XMf\colon X\to M be continuous. Then there exists a countable set DXD\subset X such that ff is constant at every convex component of XD¯X\setminus\overline{D}. In particular, f(XD¯)f\restriction(X\setminus\overline{D}) attains countably many values.

Proof.

First, notice that if we prove the statement assuming that XX has no endpoints, then the statement holds in general. So, in order to simplify the proof, we assume that XX has no endpoints.

Let \mathcal{B} be a countable base of MM. For each BB\in\mathcal{B}, let 𝒰B\mathcal{U}_{B} be the set of convex components of f[B]f^{\leftarrow}[B]. Let 𝒰={𝒰B:B}\mathcal{U}=\bigcup\{\mathcal{U}_{B}\colon B\in\mathcal{B}\}; then 𝒰\mathcal{U} is a countable set of nonempty open and convex subsets of XX. For each U𝒰U\in\mathcal{U}, by Lemma 15 there exist {anU,bnU:n<ω}U\{a^{U}_{n},b^{U}_{n}\colon n<\omega\}\subset U such that anU<bnUa^{U}_{n}<b^{U}_{n} for each n<ωn<\omega and U={(anU,bnU):n<ω}U=\bigcup\{(a^{U}_{n},b^{U}_{n})\colon n<\omega\}. Define D={anU,bnU:U𝒰,n<ω}D=\{a^{U}_{n},b^{U}_{n}\colon U\in\mathcal{U},n<\omega\}, clearly DD is a countable set.

So let VV be a convex component of XD¯X\setminus\overline{D}, we have to prove that fVf\restriction V is constant. Assume this is not the case and let p0,p1Vp_{0},p_{1}\in V such that f(p)f(q)f(p)\neq f(q). Since MM is Hausdorff, there exists B0,B1B_{0},B_{1}\in\mathcal{B} such that f(p)B0f(p)\in B_{0}, f(q)B1f(q)\in B_{1} and B0B1=B_{0}\cap B_{1}=\emptyset. For i{0,1}i\in\{0,1\}, let UiU_{i} be the element of 𝒰Bi\mathcal{U}_{B_{i}} such that piUip_{i}\in U_{i}. Clearly, U0U1U_{0}\neq U_{1} and since both U0U_{0} and U1U_{1} are convex, we may assume without loss of generality that U0<sU1U_{0}<_{s}U_{1}. For i{0,1}i\in\{0,1\} there exists n(i)<ωn(i)<\omega be such that pi(an(i)Ui,bn(i)Ui)Uip_{i}\in(a^{U_{i}}_{n(i)},b^{U_{i}}_{n(i)})\subset U_{i}. Then,

an(0)U0<p0<bn(0)U0<an(1)U1<p1<bn(1)U1a^{U_{0}}_{n(0)}<p_{0}<b^{U_{0}}_{n(0)}<a^{U_{1}}_{n(1)}<p_{1}<b^{U_{1}}_{n(1)}

and this implies that (p0,p1)D(p_{0},p_{1})\cap D\neq\emptyset. But since VV is convex, (p0,p1)V(p_{0},p_{1})\subset V, so we obtain a contradiction. Thus, we conclude that fVf\restriction V is constant and the result is proved. ∎

17. Question

Can the condition that XX is densely ordered be removed from the hypothesis of Proposition 16?

Recall that a space XX is left-separated if there is an infinite cardinal number κ\kappa and an enumeration X={xα:α<κ}X=\{x_{\alpha}\colon\alpha<\kappa\} such that for every λ<κ\lambda<\kappa the initial segment {xα:α<λ}\{x_{\alpha}\colon\alpha<\lambda\} is closed. If XX is a LOTS, it is known that c(X)d(X)c(X)+c(X)\leq d(X)\leq c(X)^{+} (see [1]) and if XX is densely ordered it is not hard to see that d(X)=w(X)d(X)=w(X).

18. Theorem

If there is a Souslin line, then there exists a functionally countable Souslin line.

Proof.

Let XX be a Souslin line. By [5, Lemma III.5.31], we may assume that XX is densely ordered and contains no separable interval. By the observations we made before the statement, there is a base {Uα:α<ω1}\{U_{\alpha}\colon\alpha<\omega_{1}\} of XX. Recursively we may choose xαUα{xβ:β<α}¯x_{\alpha}\in U_{\alpha}\setminus\overline{\{x_{\beta}\colon\beta<\alpha\}} for all α<ω1\alpha<\omega_{1}. Then L={xα:α<ω1}L=\{x_{\alpha}\colon\alpha<\omega_{1}\} is a left-separated subset of XX. Since LL is dense in XX, LL is also a Souslin line.

We claim that LL is functionally countable. Let f:Lf\colon L\to\mathbb{R} a be continuous function. By Proposition 16, there is a countable set DLD\subset L such that f[LD¯]f[L\setminus\overline{D}] is countable. Since LL is left-separated, D¯{xα:α<β}\overline{D}\subset\{x_{\alpha}\colon\alpha<\beta\} for some β<ω1\beta<\omega_{1}. Then it follows that f[L]{f(xα):α<β}f[LD¯]f[L]\subset\{f(x_{\alpha})\colon\alpha<\beta\}\cup f[L\setminus\overline{D}] so f[L]f[L] is countable. ∎

Let XX be the Souslin line from Theorem 18. If YY is the Dedekind completion of XX, c(Y)=ωc(Y)=\omega and Lemma 14 implies that YY is first countable. By Lemma 2, XX does not have ordered copies of ω1\omega_{1} or ω1\omega_{1}^{\ast}. From this and Proposition 5 we conclude that XX is an Aronszajn line.

19. Question

Is there a functionally countable Aronszajn line in 𝖹𝖥𝖢\mathsf{ZFC}?

We comment that the functionally countable Souslin line from Example 18 answers some questions from [9] in the negative since it is: non-σ\sigma-scattered (Question 4.1), non-strechable (Questions 4.2 and 4.3) and hereditarily Lindelöf but uncountable (Question 4.4). Of course, since our example assumes that there is a Souslin line, these questions from [9] could still have a consistent positive answer.

As the closing result in this paper, we will prove that functional countability of XX does not imply functional countability of X2ΔXX^{2}\setminus\Delta_{X} when XX is a Souslin line; see Theorem 23 below. In order to construct such a counterexample LL, we need two things. First, we need that LL is functionally countable. From the proof of Theorem 18 we can extract the following fact which we will use for that.

20. Lemma

Every densely ordered and left-separated Souslin line is functionally countable.

The second thing we need for our counterexample LL is that L2ΔLL^{2}\setminus\Delta_{L} is not functionally countable. We will again use Tkachuk’s observation ([8, Proposition 3.1(c)]) that it is sufficient to construct an uncountable discrete family of open subsets in L2ΔLL^{2}\setminus\Delta_{L}. It is well known that if XX is a Souslin line, then there is an uncountable cellular family in X2X^{2}; such a family can be found in [4, Lemma 4.3]. In fact, we will use a similar family in our proof.

Recall that a tree is a partially ordered set T,\langle T,\sqsubset\rangle such that for every xTx\in T the set (,x)={yT:yx}(\leftarrow,x)=\{y\in T\colon y\sqsubset x\} of predecesors of xx is well-ordered. Given x,yTx,y\in T we will say that xx and yy are compatible if there exists zTz\in T such that zxz\sqsubset x and zyz\sqsubset y; otherwise, they are incompatible and we write xyx\perp y. The height of xTx\in T is the ordinal number isomorphic to (,x)(\leftarrow,x). For an ordinal α\alpha, TαT_{\alpha} will denote all elements of TT of height α\alpha. An ω1\omega_{1}-tree is a tree such that TαT_{\alpha}\neq\emptyset if α<ω1\alpha<\omega_{1} and Tω1=T_{\omega_{1}}=\emptyset.

21. Definition

Let XX be a linearly ordered set. If T,\langle T,\sqsubset\rangle is a tree, we will say that a collection {xt,yt,zt:tT}X3\{\langle x_{t},y_{t},z_{t}\rangle\colon t\in T\}\subset X^{3} is TT-adequate if the following hold:

  1. (a)

    for all tTt\in T, xt<zt<ytx_{t}<z_{t}<y_{t},

  2. (b)

    if s,tTs,t\in T are such that sts\perp t then [xs,ys][xt,yt]=[x_{s},y_{s}]\cap[x_{t},y_{t}]=\emptyset, and

  3. (c)

    if s,tTs,t\in T are such that sts\sqsubset t then [xt,yt](xs,ys){zs}[x_{t},y_{t}]\subset(x_{s},y_{s})\setminus\{z_{s}\}.

Let XX be a topological space and 𝒮(X)\mathcal{S}\subset\wp(X). Recall that a point pXp\in X is a limit point of 𝒮\mathcal{S} if for every open set UXU\subset X such that pUp\in U the set {S𝒮:US}\{S\in\mathcal{S}\colon U\cap S\neq\emptyset\} is infinite. It is easy to see that 𝒮\mathcal{S} is discrete if and only if {S¯:S𝒮}\{\overline{S}\colon S\in\mathcal{S}\} is pairwise disjoint and no point of XX is a limit point of 𝒮\mathcal{S}.

22. Lemma

Let XX be a densely ordered and first countable LOTS. Given a TT-adequate collection {xt,yt,zt:tT}X3\{\langle x_{t},y_{t},z_{t}\rangle\colon t\in T\}\subset X^{3}, where T,\langle T,\sqsubset\rangle is an ω1\omega_{1}-tree, define 𝒰={(xt,zt)×(zt,yt):tT}\mathcal{U}=\{(x_{t},z_{t})\times(z_{t},y_{t})\colon t\in T\}. Then

  1. (a)

    the closures of elements of 𝒰\mathcal{U} are pairwise disjoint, and

  2. (b)

    if a,bX2ΔX\langle a,b\rangle\in X^{2}\setminus\Delta_{X} is a limit point of 𝒰\mathcal{U}, then a<ba<b and there is a sequence {tn:nω}T\{t_{n}\colon n\in\omega\}\subset T such that

    1. (1)

      for all m<n<ωm<n<\omega, tmtnt_{m}\sqsubset t_{n},

    2. (2)

      for all m<ωm<\omega, xtm<ax_{t_{m}}<a and b<ytmb<y_{t_{m}}, and

    3. (3)

      either a=sup{xtm:mω}a=\sup\{x_{t_{m}}\colon m\in\omega\} or b=inf{ytm:mω}b=\inf\{y_{t_{m}}\colon m\in\omega\}.

Proof.

Condition (a) should be clear, we only check (b). Let a,bX2ΔX\langle a,b\rangle\in X^{2}\setminus\Delta_{X}. It is immediate that if b<ab<a then a,b\langle a,b\rangle is not a limit point of 𝒰\mathcal{U}. Then we assume that a<ba<b holds and there is no sequence {tn:nω}T\{t_{n}\colon n\in\omega\}\subset T with properties (b)(1), (b)(2) and (b)(3); we will prove that a,b\langle a,b\rangle is not a limit point of 𝒰\mathcal{U}.

First, consider

P={tT:(xta)(byt)}.P=\{t\in T\colon(x_{t}\leq a)\wedge(b\leq y_{t})\}.
Claim.

There exists an open set VX2V\subset X^{2} such that a,bV\langle a,b\rangle\in V and V[(xt,zt)×(zt,yt)]=V\cap[(x_{t},z_{t})\times(z_{t},y_{t})]=\emptyset for every tTPt\in T\setminus P.

To prove the claim, we choose c(a,b)c\in(a,b) according to the situation we are in. If [xt,yt](a,b)=[x_{t},y_{t}]\cap(a,b)=\emptyset for all tTPt\in T\setminus P, let c(a,b)c\in(a,b) be arbitrary. Otherwise, let β<ω1\beta<\omega_{1} be the minimal ordinal such that there is sTβPs\in T_{\beta}\setminus P with [xs,ys](a,b)[x_{s},y_{s}]\cap(a,b)\neq\emptyset. If a<ys<ba<y_{s}<b let c=ysc=y_{s}; otherwise it will necessarily follow that a<xs<ba<x_{s}<b and we choose c=xsc=x_{s}. Define V=(,c)×(c,)V=(\leftarrow,c)\times(c,\rightarrow). Then VV is an open set of X2X^{2} with a,bV\langle a,b\rangle\in V. It is not hard to conclude that VV satisfies the claim.

By the claim we may restrict our attention to the case when PP\neq\emptyset. By the definition of TT-adequate, PP is necessarily a \sqsubset-chain of comparable elements of TT and in fact, PP is an initial segment of TT. Notice that the function txtt\mapsto x_{t} for tPt\in P is increasing; likewise the function tytt\mapsto y_{t} for tPt\in P is decreasing.

Next, define Q={tP:a=xtb=yt}Q=\{t\in P\colon a=x_{t}\vee b=y_{t}\}. Notice that by the definition of TT-adequate we now that if t,tTt,t^{\prime}\in T and either xt=xtx_{t}=x_{t^{\prime}} or yt=yty_{t}=y_{t^{\prime}}, then t=tt=t^{\prime}. This implies that |Q|1\lvert Q\rvert\leq 1. Moreover, if qQq\in Q then qq is necessarily the \sqsubset-maximum of PP. Thus, it is sufficient to restrict our attention to the case when PQP\setminus Q is nonempty.

Case 1.

There is pPQp\in P\setminus Q that is the \sqsubset-maximum of PQP\setminus Q.

In this case, xt<xp<a<b<yp<ytx_{t}<x_{p}<a<b<y_{p}<y_{t} for all tP(Q{p})t\in P\setminus(Q\cup\{p\}). Choose c(xp,a)c\in(x_{p},a) and d(b,yp)d\in(b,y_{p}), and define W=(c,d)×(c,d)W=(c,d)\times(c,d). Then WW is an open set in X2X^{2} with a,bW\langle a,b\rangle\in W.

Let tP(Q{p})t\in P\setminus(Q\cup\{p\}). By the definition of TT-adequate we conclude that either zt<xpz_{t}<x_{p} or yp<zty_{p}<z_{t}. If zt<xpz_{t}<x_{p} then (xt,zt)(c,d)=(x_{t},z_{t})\cap(c,d)=\emptyset. If yp<zty_{p}<z_{t}, then (c,d)(zt,yt)=(c,d)\cap(z_{t},y_{t})=\emptyset. In any of the two cases, W[(xt,zt)×(zt,yt)]=W\cap[(x_{t},z_{t})\times(z_{t},y_{t})]=\emptyset.

By taking VV as in the claim, VWV\cap W is an open set containing a,b\langle a,b\rangle that is disjoint from all but at most two elements of 𝒰\mathcal{U}. Thus, a,b\langle a,b\rangle is not a limit point of 𝒰\mathcal{U}.

Case 2.

PQP\setminus Q does not have \sqsubset-maximum.

Let A={xt:tPQ}A=\{x_{t}\colon t\in P\setminus Q\} and B={yt:tPQ}B=\{y_{t}\colon t\in P\setminus Q\}. By considering the Dedekind completion YY of XX, we may take supA=u\sup A=u and infB=v\inf B=v in YY. Since c(Y)=ωc(Y)=\omega, we know from Lemma 14 that YY is first countable. Thus, there is a sequence {tn:nω}PQ\{t_{n}\colon n\in\omega\}\subset P\setminus Q with properties (b)(1), (b)(2), u=sup{xtn:nω}u=\sup\{x_{t_{n}}\colon n\in\omega\} and v=inf{ytn:nω}v=\inf\{y_{t_{n}}\colon n\in\omega\}. Notice that aa is a upper bound of AA and bb is an lower bound of BB. By our assumtion, we know that u<au<a and b<vb<v.

So let c(u,a)Xc\in(u,a)\cap X and d(b,v)Xd\in(b,v)\cap X. Here we may forget about YY and continue working inside XX once again. We conclude that {tn:nω}\{t_{n}\colon n\in\omega\} is cofinal in PQP\setminus Q and for all tPQt\in P\setminus Q, xt<c<ax_{t}<c<a and b<d<ytb<d<y_{t}.

Let W=(c,d)×(c,d)W=(c,d)\times(c,d). Clearly, WW is an open set in X2X^{2} with a,bW\langle a,b\rangle\in W. Let tPQt\in P\setminus Q. Choose tPQt^{\prime}\in P\setminus Q such that ttt\sqsubset t^{\prime}; this is possible by our assumption. By the definition of TT-adequate, we know that either xt<zt<xtx_{t}<z_{t}<x_{t^{\prime}} or yt<zt<yty_{t^{\prime}}<z_{t}<y_{t}. If xt<zt<xtx_{t}<z_{t}<x_{t^{\prime}} then (xt,zt)(c,d)=(x_{t},z_{t})\cap(c,d)=\emptyset. If yt<zt<yty_{t^{\prime}}<z_{t}<y_{t} then (c,d)(zt,yt)=(c,d)\cap(z_{t},y_{t})=\emptyset. Therefore W[(xt,zt)×(zt,yt)]=W\cap[(x_{t},z_{t})\times(z_{t},y_{t})]=\emptyset.

As in the previous case, we may take VV as in the claim above and we conclude that VWV\cap W is an open set containing a,b\langle a,b\rangle that is disjoint from all but at most one element of 𝒰\mathcal{U}. Thus, a,b\langle a,b\rangle is not a limit point of 𝒰\mathcal{U}. ∎

For the proof of the next result, we will use the tree ω<ω1={ωα:α<ω1}\omega^{<\omega_{1}}=\bigcup\{\omega^{\alpha}\colon\alpha<\omega_{1}\} of all well-ordered natural number sequences of countable length. For s,tω<ω1s,t\in\omega^{<\omega_{1}}, we define sts\sqsubset t if tt extends ss as a function; this is usually called the end-extension order. Given nωn\in\omega, n\langle n\rangle will denote the sequence of length 11 with value nn. If sωαs\in\omega^{\alpha} for some α<ω1\alpha<\omega_{1} and iωi\in\omega, sis^{\frown}i denotes the one element of ωα+1\omega^{\alpha+1} such that ssis\sqsubset s^{\frown}i and (si)(α)=i(s^{\frown}i)(\alpha)=i.

23. Theorem

Assume that there exists a Souslin line. Then there exists a Souslin line LL such that LL is functionally countable but L2ΔLL^{2}\setminus\Delta_{L} is not functionally countable.

Proof.

Start with a Souslin line XX. By [5, Lemma III.5.31], we may assume that XX is densely ordered. By repeating the procedure described in Theorem 18, we may assume that XX is left-separated. Since we would like to be able to calculate suprema and infima, we assume that XX is contained in its Dedekind completion YY. Thus, all intervals under discussion will be assumed to be subsets of YY.

We will choose a subset LXL\subset X that is dense in XX. Assume for a moment that we have already defined LL. Then LL is densely ordered and LL is a LOTS with the order induced from XX. In fact, LL is a Souslin line. Also, since XX is left-separated, LL is left-separated. By Lemma 20, LL is a functionally countable Souslin line.

Now, we must explain how to construct LL. We will recursively define a tree T,\langle T,\sqsubset\rangle and a TT-adequate collection {xt,yt,zt:tT}X3\{\langle x_{t},y_{t},z_{t}\rangle\colon t\in T\}\subset X^{3}. By Lemma 22, we know the limit points of 𝒰={(xt,zt)×(zt,yt):tT}\mathcal{U}=\{(x_{t},z_{t})\times(z_{t},y_{t})\colon t\in T\}; we shall define LL to be equal to XX minus these limit points.

The tree TT will be an ω1\omega_{1}-tree where every node has countably many immediate successors and such that all levels of TT are countable. In order to simplify the proof, TT will be a subset of ω<ω1={ωα:α<ω1}\omega^{<\omega_{1}}=\bigcup\{\omega^{\alpha}\colon\alpha<\omega_{1}\}, the order \sqsubset in TT will be given by end-extension and Tαωα+1T_{\alpha}\subset\omega^{\alpha+1} for every α<ω1\alpha<\omega_{1}.

We proceed with the construction of TT by recursion and along with every tTt\in T, we choose xt,yt,ztXx_{t},y_{t},z_{t}\in X. First, let 𝒥\mathcal{J}_{\emptyset} be a maximal pairwise disjoint collection of non-degenerate closed intervals with endpoints in X{infX,supX}X\setminus\{\inf X,\sup X\}. Since c(X)=ωc(X)=\omega, 𝒥\mathcal{J}_{\emptyset} is countable. Moreover, since [infX,supX]𝒥[\inf X,\sup X]\notin\mathcal{J}_{\emptyset} and all elements of 𝒥\mathcal{J}_{\emptyset} have different endpoints, it easily follows that 𝒥\mathcal{J}_{\emptyset} is necessarily infinite. We then enumerate 𝒥={[xn,yn]:nω}\mathcal{J}_{\emptyset}=\{[x_{\langle n\rangle},y_{\langle n\rangle}]\colon n\in\omega\}. For every nωn\in\omega, we choose zn(xn,yn)Xz_{\langle n\rangle}\in(x_{\langle n\rangle},y_{\langle n\rangle})\cap X arbitrarily. We also define T0={n:n<ω}T_{0}=\{{\langle n\rangle}\colon n<\omega\}.

Assume that λ<ω1\lambda<\omega_{1} and we have chosen {Tα:α<λ}\{T_{\alpha}\colon\alpha<\lambda\} and {xt,yt,zt:tTα,α<λ}\{x_{t},y_{t},z_{t}\colon t\in T_{\alpha},\alpha<\lambda\} in such a way the the conditions in Definition 21 are satisfied for all s,t{Tα:α<λ}s,t\in\bigcup\{T_{\alpha}\colon\alpha<\lambda\}. We also require the following condition in our recursion:

  1. ()α(\ast)_{\alpha}

    For α<ω1\alpha<\omega_{1}, {[xt,yt]:tTα}\bigcup\{[x_{t},y_{t}]\colon t\in T_{\alpha}\} is dense in YY.

We start by assuming that λ=γ+1\lambda=\gamma+1 for some γ<ω1\gamma<\omega_{1}. Given tTγt\in T_{\gamma}, let 𝒥t\mathcal{J}_{t} be a maximal pairwise disjoint collection of closed intervals with endpoints in XX, all contained in either (xt,zt)(x_{t},z_{t}) or (zt,yt)(z_{t},y_{t}). Then 𝒥t\mathcal{J}_{t} is countable and infinite. So enumerate 𝒥t={[xtn,ytn]:nω}\mathcal{J}_{t}=\{[x_{t^{\frown}n},y_{t^{\frown}n}]\colon n\in\omega\} and for each nωn\in\omega choose ztn(xtn,ytn)Xz_{t^{\frown}n}\in(x_{t^{\frown}n},y_{t^{\frown}n})\cap X arbitrarily. We also define Tγ+1={tn:tTγ,n<ω}T_{\gamma+1}=\{t^{\frown}n\colon t\in T_{\gamma},n<\omega\}. It should be clear that if ()γ(\ast)_{\gamma} holds, then ()λ(\ast)_{\lambda} holds as well.

Now, assume that λ\lambda is a limit ordinal. Consider the collection λ\mathcal{B}_{\lambda} of all tωλt\in\omega^{\lambda} such that t(α+1)Tαt\restriction{(\alpha+1)}\in T_{\alpha} for all α<λ\alpha<\lambda; that is, the set of all branches through the subtree that has been defined so far. Notice that for tλt\in\mathcal{B}_{\lambda}, t={[xt(α+1),yt(α+1)]:α<λ}\mathcal{I}_{t}=\{[x_{t\restriction(\alpha+1)},y_{t\restriction(\alpha+1)}]\colon\alpha<\lambda\} is a decreasing collection of closed, non-degenerate intervals with endpoints in XX. Then It=tI_{t}=\bigcap\mathcal{I}_{t} is a convex subset of YY. We define 𝒞λ={tλ:|It|>1}\mathcal{C}_{\lambda}=\{t\in\mathcal{B}_{\lambda}\colon\lvert I_{t}\rvert>1\}.

Let at=infIta_{t}=\inf I_{t} and bt=supItb_{t}=\sup I_{t} for every t𝒞λt\in\mathcal{C}_{\lambda}, so that It=[at,bt]I_{t}=[a_{t},b_{t}]. Let DλD_{\lambda} be the set of all xt,yt,ztx_{t},y_{t},z_{t} such that t{Tα:α<λ}t\in\bigcup\{T_{\alpha}\colon\alpha<\lambda\}. Since DλD_{\lambda} is a countable set, DλD_{\lambda} is not dense in XX or YY.

Claim 1.

The set of convex components of YDλ¯Y\setminus\overline{D_{\lambda}} coincides with the collection of the sets of the form (at,bt)(a_{t},b_{t}) for t𝒞λt\in\mathcal{C}_{\lambda}.

We prove Claim 1. First, let UU be a convex component of YDλ¯Y\setminus\overline{D_{\lambda}}. Given α<λ\alpha<\lambda, from property ()α(\ast)_{\alpha} we can conclude that there must exist sαTαs_{\alpha}\in T_{\alpha} such that U[xsα,ysα]U\subset[x_{s_{\alpha}},y_{s_{\alpha}}]; such sαs_{\alpha} is unique (among elements of TαT_{\alpha}) because of property (b) from Definition 21. From property (c) from Definition 21 we conclude that {sα:α<λ}\{s_{\alpha}\colon\alpha<\lambda\} is a \sqsubset-chain so we may take s={sα:α<λ}s=\bigcup\{s_{\alpha}\colon\alpha<\lambda\}. Clearly, sλs\in\mathcal{B}_{\lambda} and UIsU\subset I_{s}. Since UU is open in the densely ordered space YY, in fact s𝒞λs\in\mathcal{C}_{\lambda}. Notice also that since UU is open, U(as,bs)U\subset(a_{s},b_{s}).

Now, let s𝒞λs\in\mathcal{C}_{\lambda}, we must prove that (as,bs)(a_{s},b_{s}) is a convex component of YDλ¯Y\setminus\overline{D_{\lambda}}. To prove this, it is sufficient to prove that (as,bs)Dλ=(a_{s},b_{s})\cap D_{\lambda}=\emptyset and that as,bsDλ¯a_{s},b_{s}\in\overline{D_{\lambda}}.

Given α<λ\alpha<\lambda, since Is[xsα+2,ysα+2]I_{s}\subset[x_{s\restriction{\alpha+2}},y_{s\restriction{\alpha+2}}], by property (c) in Definition 21, Is(xsα+1,ysα+1){zsα+1}I_{s}\subset(x_{s\restriction{\alpha+1}},y_{s\restriction{\alpha+1}})\setminus\{z_{s\restriction{\alpha+1}}\}. In particular notice that, xsα+1,ysα+1,zsα+1Isx_{s\restriction{\alpha+1}},y_{s\restriction{\alpha+1}},z_{s\restriction{\alpha+1}}\notin I_{s}. Further, if tTα{sα+1}t\in T_{\alpha}\setminus\{s\restriction{\alpha+1}\}, property (b) in Definition 21 implies xt,yt,ztIsx_{t},y_{t},z_{t}\notin I_{s}. Thus, (as,bs)Dλ=(a_{s},b_{s})\cap D_{\lambda}=\emptyset.

Now, notice that by the definition of IsI_{s}, {xsα+1:α<λ}\{x_{s\restriction{\alpha+1}}\colon\alpha<\lambda\} is a strictly increasing sequence, {ysα+1:α<λ}\{y_{s\restriction{\alpha+1}}\colon\alpha<\lambda\} is a strictly decreasing sequence, as=sup{xsα+1:α<λ}a_{s}=\sup\{x_{s\restriction{\alpha+1}}\colon\alpha<\lambda\} and bs=inf{ysα+1:α<λ}b_{s}=\inf\{y_{s\restriction{\alpha+1}}\colon\alpha<\lambda\}. This shows that as,bsDλ¯a_{s},b_{s}\in\overline{D_{\lambda}} and, as discussed above, completes the proof of Claim 1.

From Claim 1, YDλ¯Y\setminus\overline{D_{\lambda}}\neq\emptyset, and c(Y)=ωc(Y)=\omega, we conclude that 𝒞λ\mathcal{C}_{\lambda} is nonempty and countable. Define Tλ={tn:t𝒞λ,nω}T_{\lambda}=\{t^{\frown}n\colon t\in\mathcal{C}_{\lambda},n\in\omega\}; this is a countable infinite set. Finally, for each t𝒞λt\in\mathcal{C}_{\lambda}, let 𝒥t\mathcal{J}_{t} be a maximal pairwise disjoint collection of closed intervals with endpoints in XX, all contained in (at,bt)(a_{t},b_{t}). Again it can be easily checked that 𝒥t\mathcal{J}_{t} is countable infinite and we can enumerate 𝒥t={[xtn,ytn]:nω}\mathcal{J}_{t}=\{[x_{t^{\frown}n},y_{t^{\frown}n}]\colon n\in\omega\}. Also, for t𝒞λt\in\mathcal{C}_{\lambda} and nωn\in\omega choose ztn(xtn,ytn)Xz_{t^{\frown}n}\in(x_{t^{\frown}n},y_{t^{\frown}n})\cap X arbitrarily. It should be clear that the inductive hypotheses hold in this step too, including ()λ(\ast)_{\lambda}.

This concludes the recursion. We define

L=X{at,bt:λ<ω1 such that λ is a limit and t𝒞λ}L=X\setminus\{a_{t},b_{t}\colon\exists\lambda<\omega_{1}\textrm{ such that }\lambda\textrm{ is a limit and }t\in\mathcal{C}_{\lambda}\}
Claim 2.

The following properties hold:

  1. (i)

    TT is an ω1\omega_{1}-tree with countable levels,

  2. (ii)

    {xt,yt,zt:tT}\{\langle x_{t},y_{t},z_{t}\rangle\colon t\in T\} is TT-adequate,

  3. (iii)

    for each tTt\in T, xt,yt,ztLx_{t},y_{t},z_{t}\in L, and

  4. (iv)

    {xt,yt,zt:tT}\{x_{t},y_{t},z_{t}\colon t\in T\} is dense in YY.

Items (i) and (ii) should be clear from the construction. Let us next prove (iii). Notice that by construction {xt,yt,zt:tT}X\{x_{t},y_{t},z_{t}\colon t\in T\}\subset X. So let λ<ω1\lambda<\omega_{1} be a limit and sωλs\in\omega^{\lambda}, it is sufficient to prove that {as,bs}{xt,yt,zt:tT}=\{a_{s},b_{s}\}\cap\{x_{t},y_{t},z_{t}\colon t\in T\}=\emptyset.

If α<λ\alpha<\lambda, {as,bs}[xsα+2,ysα+2]\{a_{s},b_{s}\}\subset[x_{s\restriction{\alpha+2}},y_{s\restriction{\alpha+2}}] by the definition of IsI_{s}. By property (c) of Definition 21, we conclude that {as,bs}(xsα+1,ysα+1){zsα+1}\{a_{s},b_{s}\}\subset(x_{s\restriction{\alpha+1}},y_{s\restriction{\alpha+1}})\setminus\{z_{s\restriction{\alpha+1}}\}. This proves that {as,bs}{xt,yt,zt}=\{a_{s},b_{s}\}\cap\{x_{t},y_{t},z_{t}\}=\emptyset for all tTt\in T with tst\sqsubset s.

If tTt\in T and sts\sqsubset t, then since the domain of tt is necessarily a successor ordinal, sits^{\frown}{i}\sqsubset t for some iωi\in\omega. By property (c) of Definition 21, it follows that xt,yt,zt(xsi,ysi)x_{t},y_{t},z_{t}\subset(x_{s^{\frown}{i}},y_{s^{\frown}{i}}). But (xsi,ysi)(as,bs)(x_{s^{\frown}{i}},y_{s^{\frown}{i}})\subset(a_{s},b_{s}) by our construction, so {as,bs}{xt,yt,zt}=\{a_{s},b_{s}\}\cap\{x_{t},y_{t},z_{t}\}=\emptyset.

Finally, let tTt\in T be such that sts\perp t, and let α<ω1\alpha<\omega_{1} with tTαt\in T_{\alpha}. If α<λ\alpha<\lambda, we know that s(α+1),tTαs\restriction({\alpha+1}),t\in T_{\alpha} and s(α+1)ts\restriction({\alpha+1})\perp t. Since {as,bs}[xsα+1,ysα+1]\{a_{s},b_{s}\}\subset[x_{s\restriction{\alpha+1}},y_{s\restriction{\alpha+1}}], by properties (a) and (b) of Definition 21 we conclude that {as,bs}{xt,yt,zt}=\{a_{s},b_{s}\}\cap\{x_{t},y_{t},z_{t}\}=\emptyset. If λα\lambda\leq\alpha, then s,tλωλs,t\restriction\lambda\in\omega^{\lambda} and stλs\neq t\restriction\lambda. Let β=min{γ<λ:s(γ)t(γ)}\beta=\min\{\gamma<\lambda\colon s(\gamma)\neq t(\gamma)\}. Since {as,bs}[xsβ+1,ysβ+1]\{a_{s},b_{s}\}\subset[x_{s\restriction{\beta+1}},y_{s\restriction{\beta+1}}], {xt,yt,zt}[xtβ+1,ytβ+1]\{x_{t},y_{t},z_{t}\}\subset[x_{t\restriction{\beta+1}},y_{t\restriction{\beta+1}}] and s(β+1)t(β+1)s\restriction{(\beta+1)}\perp t\restriction{(\beta+1)}, by property (b) of Definition 21, {as,bs}{xt,yt,zt}=\{a_{s},b_{s}\}\cap\{x_{t},y_{t},z_{t}\}=\emptyset.

Now, we prove statement (iv). Let wYw\in Y and assume that w{xt,yt,zt:tT}¯w\notin\overline{\{x_{t},y_{t},z_{t}\colon t\in T\}}. Given any α<ω1\alpha<\omega_{1}, by property ()α(\ast)_{\alpha} and property (b) of Definition 21, there exists a unique element sαTαs_{\alpha}\in T_{\alpha} such that w(xsα,ysα)w\in(x_{s_{\alpha}},y_{s_{\alpha}}). By properties (b) and (c) of Definition 21 it follows that sαsβs_{\alpha}\sqsubset s_{\beta} whenever α<β<ω1\alpha<\beta<\omega_{1}. But then {xsα:α<ω1}\{x_{s_{\alpha}}\colon\alpha<\omega_{1}\} is an ordered copy of ω1\omega_{1} in XX, this is impossible by Lemma 14 since c(X)=ωc(X)=\omega.

This concludes the proof of all items in Claim 2.

We are ready to prove that LL has the desired properties. First, by properties (iii) and (iv) we conclude that LL is a subset of XX that is dense in YY. As discussed in the begining of the proof, this implies that LL is a functionally countable Souslin line.

Next, for each tTt\in T let Ut=(xt,zt)×(zt,yt)U_{t}=(x_{t},z_{t})\times(z_{t},y_{t}) and consider the set 𝒰={Ut:tT}\mathcal{U}=\{U_{t}\colon t\in T\}. Notice that 𝒰\mathcal{U} is a collection of open subsets of Y×YY\times Y. Further, UtΔY=U_{t}\cap\Delta_{Y}=\emptyset for every tTt\in T. Since LL is dense in YY, UtL2U_{t}\cap L^{2} is a nonempty open subset of L2ΔLL^{2}\setminus\Delta_{L} for every tTt\in T.

Let 𝒱={UtL2:tT}\mathcal{V}=\{U_{t}\cap L^{2}\colon t\in T\}, we claim that this is a discrete uncountable family of open sets. That 𝒱\mathcal{V} is uncountable follows from the fact that TT is an ω1\omega_{1}-tree with countable levels. By (a) in Lemma 22 it follows that 𝒰\mathcal{U} has pairwise disjoint closures in Y2Y^{2}, so 𝒱\mathcal{V} also has pairwise disjoint closures in L2ΔLL^{2}\setminus\Delta_{L}. Notice that, in order to prove that 𝒱\mathcal{V} is discrete, it is sufficient to prove that all limit points of 𝒰\mathcal{U} are in Y2L2Y^{2}\setminus L^{2}.

Assume that a,b\langle a,b\rangle is a limit point of 𝒰\mathcal{U}. According to (b) in Lemma 22, a<ba<b and there is a \sqsubset-decreasing sequence {sn:n<ω}T\{s_{n}\colon n<\omega\}\subset T such that xsn<ax_{s_{n}}<a and b<ysnb<y_{s_{n}} for all n<ωn<\omega, a=sup{xsn:n<ω}a=\sup\{x_{s_{n}}\colon n<\omega\} or b=inf{ysn:n<ω}b=\inf\{y_{s_{n}}\colon n<\omega\}. For each n<ωn<\omega let αn<ω1\alpha_{n}<\omega_{1} be such that snTαns_{n}\in T_{\alpha_{n}}. Notice that αm<αn\alpha_{m}<\alpha_{n} if m<n<ωm<n<\omega. Define λ=sup{αn:n<ω}ω1\lambda=\sup\{\alpha_{n}\colon n<\omega\}\in\omega_{1} and s={sn:n<ω}ωλs=\bigcup\{s_{n}\colon n<\omega\}\in\omega^{\lambda}. But then it easily follows that as=sup{xsn:n<ω}a_{s}=\sup\{x_{s_{n}}\colon n<\omega\} and bs=inf{ysn:n<ω}b_{s}=\inf\{y_{s_{n}}\colon n<\omega\}. Thus, either a=asa=a_{s} or b=bsb=b_{s}. So a,bL2\langle a,b\rangle\notin L^{2}.

This completes the proof that 𝒱\mathcal{V} is an uncountable discrete family of open nonempty subsets of L2ΔLL^{2}\setminus\Delta_{L} and by [8, Proposition 3.1 (c)], L2ΔLL^{2}\setminus\Delta_{L} is not functionally countable. ∎

Notice that the tree TT that we constructed in the proof of Theorem 23 must be a Souslin tree, as it is well known. For example, in the proof of statement (iv) we essentially proved that TT has no countable chains.

To finish this work, we remark the natural follow-up question remains unsolved, unfortunately.

24. Question

Is it consistent that there is a Souslin line LL such that (L×L)ΔL(L\times L)\setminus\Delta_{L} is functionally countable?

Acknowledgements

We wish to thank the referee for their valuable suggestions which helped us improve the paper. Research in this paper was supported by CONACyT’s FORDECYT-PRONACES grant 64356/2020. Research of the first-named author was also supported by a CONACyT doctoral scholarship.

References

  • [1] Harold Bennett and David Lutzer, Linearly Ordered and Generalized Ordered Spaces, Encyclopedia of General Topology (K.P. Hart, J. Nagata, and J.E. Vaughan, eds.), Elsevier Science Ltd., Amsterdam, 2004, pp. 326–330.
  • [2] Fred Galvin and Salvador Hernandez, 6444, The American Mathematical Monthly 92 (1985), no. 6, 434–434.
  • [3] R. W. Heath, David J. Lutzer, and P. L. Zenor, Monotonically normal spaces, Trans. Am. Math. Soc. 178 (1973), 481–493.
  • [4] Kenneth Kunen, Set Theory. An Introduction to Independence Proofs. 2nd print, Stud. Logic Found. Math., vol. 102, Elsevier, Amsterdam, 1983.
  • [5] by same author, Set Theory., Stud. Log. (Lond.), vol. 34, London: College Publications, 2011.
  • [6] Jun-iti Nagata, Modern General Topology. 2nd rev. ed, North-Holland Math. Libr., vol. 33, Elsevier (North-Holland), Amsterdam, 1985.
  • [7] Vladimir Naroditsky, C. Thron, B. Tomaszewski, and Fred Galvin, Advanced problems: 6442-6444, The American Mathematical Monthly 90 (1983), no. 9, 648.
  • [8] Vladimir V. Tkachuk, A Corson compact space is countable if the complement of its diagonal is functionally countable, Studia Sci. Math. Hungar. 58 (2021), no. 3, 398–407.
  • [9] V.V. Tkachuk and R.G. Wilson, Functional countability in GO spaces, Topology Appl. 320 (2022), 108233.
  • [10] Stevo Todorčević, Trees and Linearly Ordered Sets, Handbook of Set-Theoretic Topology (K. Kunen nd J.E. Vaughan, ed.), Elsevier Science Publishers B.V., Amsterdam, 1984, pp. 235–293.