When is the complement of the diagonal of a LOTS functionally countable?
Abstract.
In a 2021 paper, Tkachuk asked whether there is a non-separable LOTS such that is functionally countable. In this paper we prove that such a space, if it exists, must be an Aronszajn line and admits a -to- 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 such that is not functionally countable.
Key words and phrases:
functionally countable, linearly ordered space, Aronszajn line, Souslin line2020 Mathematics Subject Classification:
Primary: 54F05, Secondary: 06A05, 54A35, 54C30.1. Introduction
A topological space is functionally countable if for every continuous function the image is countable. The diagonal of a space is the subset of . In [8], Tkachuk studies spaces such that is functionally countable. In this note we are interested in the following of Tkachuk’s questions from that paper.
1. Question
[8] Let be a linearly ordered space such that is functionally countable. Is separable?
Under the assumption that is compact, in [8] Tkachuk proved that Question 1 has an affirmative answer. In this paper we show that it is consistent with the 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 is an uncountable linearly ordered space such that is functionally countable, then must be an Aronszajn line and there is a Souslin line and a retraction ; see Theorem 11 below for a more precise statement. Since the existence of Souslin lines is independent of , it is consistent that any space satifsying the hypotheses of Tkachuk’s Question 1 is countable.
We also explore the question of whether there is a Souslin line such that 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 does not imply that 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 be a linearly ordered set. We will assume familiarity with intervals of the form , , , , and , where . The endpoints of a subset are and , if they exist. A subset is said to be densely ordered if for every with there exists . A set is convex if for all , implies that . If we will say that (“ is setwise before ”) if for every and , .
Let and be linearly ordered sets, and let . If implies for all , we will say that is an order embedding. If is an order embedding, we will say that contains an ordered copy of , or that can be order-embedded in . If is also surjective, then it is called an order isomorphism and is said to be order isomorphic to .
It is well known that for every linearly ordered set there is a linearly ordered set and an order embedding such that
-
•
is Dedekind complete, that is, every nonempty subset of has a supremum and an infinum, and
-
•
is topologically dense in , that is, every nonempty open interval in contains an element of .
Such is unique (modulo order isomorphisms) and is the Dedekind completion of .
Given a linearly ordered set , its order topology is the topology generated by all intervals and for ; 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 is a GO space if and only if there is a linear order such that and 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 of a LOTS is a LOTS if is closed in or is densely ordered.
Let be a LOTS and a non-empty open subset of . Then is the union of a collection of convex open subsets. If we take maximal convex open subsets of , we may refer to them as the convex components of the open set .
We will consider the ordinal with its canonical order; will denote with the reverse of its canonical order. The existence of ordered copies of or is related to first countability in the following way.
2. Lemma
Let be a Dedekind complete linearly ordered set and let be topologically dense in . Then the following are equivalent:
-
(a)
contains no ordered copy of neither nor ,
-
(b)
contains no ordered copy of neither nor , and
-
(c)
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 , or any uncountable subset of . 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 (see section 5 in [10]) but it is well known that the existence of Souslin lines is independent of the 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 such that is functionally countable. Let be a linear order such that (see the previous section) and let denote with the topology . Notice that the identity function is a continuous bijection. But then by considering and letting we obtain a continuous bijection . Then is a LOTS and, according to [8, Proposition 3.1 (a)], is functionally countable. Thus, we may restrict our discussion to LOTS (compare with the observation made in [9] before 3.14).
A space satisfies the discrete countable chain condition, DCCC for short, if every discrete collection of nonempty open subsets of 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 be a LOTS. Assume that there exists a family of subsets of such that
-
(i)
for each there are nonempty open sets with , and
-
(ii)
if and , then or .
Then is a discrete collection of nonempty open subsets of
Proof.
Let such that , we need to find an open set such that and .
First, consider the case when . Let and be open subsets of such that , and . Then is such that and for all .
So assume that . We divide our analysis in four cases:
Case 1.
There are with such that and .
By our hypothesis we may assume that . Let and . Notice that . Let . Then is an open subset of such that ; we claim that for every .
Let and . If or , since and , ; thus, . If , since and , ; thus, .
Case 2.
There exists a unique such that .
Let and . Clearly, ; we claim that for every .
So let with and . If , since and , we conclude that ; thus, . If , since and , we convince ourselves that ; thus, .
Case 3.
There exists such that and .
Let , notice that . We claim that for every .
So let with and . If , since and , ; therefore, . If , since and , ; therefore, .
Case 4.
For every either or .
In this case we also take . Again, . We claim that for every .
Let and . If , since , and thus, . If , since , and thus, .
Since these are all the possible cases, we conclude that 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 and the GO subspace of is not functionally countable. We essentially apply Hernandez’s idea along with Lemma 3 here to prove the following.
4. Proposition
Let be a LOTS. If contains an ordered copy of either or , then does not satisfty the DCCC and thus, it is not functionally countable.
Proof.
Assume that contains an ordered copy of . So there is such that implies .
Given there are unique ordinals that is a limit or and such that ; define . Then it is easy to see that the family satisfies the hypothesis of Lemma 3. Thus, does not satisfy the DCCC.
If contains an ordered copy of , we may follow an analogous argument to conclude that does not satisfy the DCCC. ∎
In particular, from Lemma 2 we can conclude that if is a LOTS with functionally countable, then is first countable. Our next step is proving that must be a Aronszajn line; we will need the following.
5. Proposition
If is a functionally countable LOTS, then does not contain order isomorphic copies of uncountable subsets of .
Proof.
We prove the contrapositive implication. Let be a LOTS and assume that there is an uncountable such that there is an order embedding ; call . Without loss of generality we may assume that is bounded in . We will find an uncountable and define a continuous function such that is injective.
First, let be the collection of all open intervals of of the form , where are rational numbers and , such that is countable. Let . Then is countable.
Next, let be the set of points such that is either an immediate succesor or an immediate predecesor of a point in . Since , is countable. Let and . Define .
Notice that is an uncountable subset without endpoints satisfying the following property: if with , then is uncountable. Since is second countable, has a countable, topologically dense set . Then it follows that every time and , there exists such that .
Finally, let and . Since is an order embedding, we conclude the following properties:
-
(i)
is countable, densely ordered and has no endpoints.
-
(ii)
If and , then there are with .
As it was famously shown by Cantor, condition (i) implies that is order-isomorphic to the rationals . So we may choose an order isomorphism . Then we define a function by
It is well known (and can be easily checked by the reader) that is continuous. By condition (ii) above it follows that is injective. Thus, is not functionally countable. ∎
If is functionally countable, from [8, Proposition 3.2] we know that is functionally countable. Thus, using Propositions 4 and 5 we conclude the following.
6. Theorem
Let be a LOTS such that is functionally countable. If is uncountable, then 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 has the property that every countable subset of 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 . First, notice that there are counterexamples if we consider GO spaces.
7. Observation
There exists a GO space with the property that every countable subset of has a countable closure but contains an uncountable subset that is order isomorphic to , and thus, is not functionally countable.
Proof.
Let with the subspace topology of 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 be a GO space where every countable subset has its closure countable. Does it follow that contains no order-isomorphic copies of uncountable subsets of if either
-
(a)
is a LOTS or
-
(b)
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 a linearly ordered set and . We will say that is lonely if any of the following hold:
-
(1)
and there is with , , and ,
-
(2)
and there is with , , and , or
-
(3)
there are such that , , , and .
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 be an uncountable LOTS such that is functionally countable. Then there is a Souslin line and a continuous function with convex fibers of cardinality less than or equal to .
Proof.
Let be the set of lonely points of , as defined in Definition 9, and let . Notice that since is a closed subspace of , it is a LOTS with the subspace topology. We define in the following way.
-
(i)
If , let .
-
(ii)
If and , let be the immediate predecesor of .
-
(iii)
If and , let be the immediate succesor of .
It should be clear that is continuous and that the fibers of are convex with cardinality less than or equal to .
First, notice that is uncountable. If is countable, then this is clear. Otherwise, since is clearly injective, is an uncountable subset of .
Next, let us prove that is not separable. By [8, Proposition 3.2], is functionally countable. Then by [8, Proposition 3.1(a)] the continuous image of is functionally countable. If is countable, by [9, Theorem 3.10] we conclude that is countable so is not dense in .
Now, let us prove that by assuming the opossite. We would like to apply Lemma 3 to conclude that does not safisfy the DCCC.
Claim.
There is a pairwise disjoint, -size collection of open convex subsets of , each of cardinality at least .
Define . Assume first that is countable. Let be a collection of -many open nonempty intervals of that are pairwise disjoint. Then there are only countably many elements of that intersect ; let be the collection of all elements of that do not intersect . Then is of cardinality and each of its elements is infinite. Thus, satisfies the conditions in the claim.
Next, consider the case when is uncountable. Given we define if either or is finite. It is easily seen that is an equivalence relation on ; let be the set of equivalence classes. Moreover, every element of is convex. By the definition of it can be shown that every element of is of cardinality at least . It can also be easily shown that every element of is order isomorphic to one of the following ordered sets:
-
(1)
a natural number greater than or equal to ,
-
(2)
the set of natural numbers ,
-
(3)
the linearly ordered set , which is the reverse order of , or
-
(4)
the integers .
Thus, every element of is a countable open set with at least two points. Since is uncountable, is uncountable as well. Thus, we may take to be any subcollection of of size and the conditions in the claim are satisfied.Thus, we may write and for each , and are nonempty open subsets with and . By Lemma 3 we conclude that is a discrete family in .
Let us define a function by for all . We will prove that is a discrete family in . Let .
If we know that so there exists an open set with and intersects at most one element of . Thus, is an open subset of with and such that intersects at most one element of .
Now, assume that . Then, by the definition of and , one of or must be a lonely point. We will assume that , that , and thus, that is lonely; the other cases can be treated in a similar way. Since is isolated, is an open set such that . If notice that is equivalent to , which implies that ; that is, . Since the elements of are pairwise disjoint, this can only happen for at most one value of . That is, there is at most one element of that intersects .
Thus, we have proved that is an uncountable discrete family of , which is impossible since is assumed to be functionally countable. From this contradiction, we conclude that and thus, is a Souslin line. ∎
11. Theorem
Assume that is an uncountable LOTS with functionally countable. Then
-
•
is an Aronszajn line,
-
•
is a Souslin line, and
-
•
there is a retraction with convex fibers of cardinality less than or equal to .
Thus, in any model of without Souslin lines we obtain an answer to Tkachuk’s question 1.
12. Corollary
Assume that there are no Souslin lines. Let be a LOTS such that is functionally countable. Then 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 such that 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 is such that is functionally countable, then is functionally countable.
13. Observation
If there is a Souslin line, there is a Souslin line that is not functionally countable and, thus, is not functionally countable.
Proof.
By [5, Exercise III.5.33] we may assume that there is a Souslin line that is connected with the order topology. Let be such that . By Urysohn’s lemma there exists a continuous function such that and . Since is connected, the image of is a connected subset of containing both endpoints and . Thus, is surjective and 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 is a LOTS with , then is first countable.
Proof.
We prove the contrapositive implication. Assume that is not first countable. By Lemma 2, we may assume that there exists such that implies . For , there are unique ordinals that is a limit or and such that ; let . Then is an uncountable, pairwise disjoint collection of nonempty open subsets of . Thus, . ∎
15. Lemma
Let be a densely ordered LOTS with no endpoints such that . Then for every nonempty convex open set there exists such that for each and .
Proof.
To simplify the proof, let us assume that , where is the Dedekind completion of . By Lemma 14 and the fact that is dense in , is first countable.
Let be nonempty open and convex. Define and ; these two points exist in but not necessarily in . Let also .
First, let us argue that . If then . Since has no endpoints, by definition of the order topology in there exist with . But since is densely ordered, is a nonempty subset of , which is a contradiction. We arrive at a similar contradiction if we asssume that .
Let and be countable local bases at and , respectively. Since is densely ordered, we may recursively find with the following properties:
-
(a)
,
-
(b)
if then , and
-
(c)
if then .
Then, for each , since is topologically dense in , let and . It is not hard to see that is as required. ∎
16. Proposition
Let be a densely ordered LOTS with , let be a second countable regular space and let be continuous. Then there exists a countable set such that is constant at every convex component of . In particular, attains countably many values.
Proof.
First, notice that if we prove the statement assuming that has no endpoints, then the statement holds in general. So, in order to simplify the proof, we assume that has no endpoints.
Let be a countable base of . For each , let be the set of convex components of . Let ; then is a countable set of nonempty open and convex subsets of . For each , by Lemma 15 there exist such that for each and . Define , clearly is a countable set.
So let be a convex component of , we have to prove that is constant. Assume this is not the case and let such that . Since is Hausdorff, there exists such that , and . For , let be the element of such that . Clearly, and since both and are convex, we may assume without loss of generality that . For there exists be such that . Then,
and this implies that . But since is convex, , so we obtain a contradiction. Thus, we conclude that is constant and the result is proved. ∎
17. Question
Can the condition that is densely ordered be removed from the hypothesis of Proposition 16?
Recall that a space is left-separated if there is an infinite cardinal number and an enumeration such that for every the initial segment is closed. If is a LOTS, it is known that (see [1]) and if is densely ordered it is not hard to see that .
18. Theorem
If there is a Souslin line, then there exists a functionally countable Souslin line.
Proof.
Let be a Souslin line. By [5, Lemma III.5.31], we may assume that is densely ordered and contains no separable interval. By the observations we made before the statement, there is a base of . Recursively we may choose for all . Then is a left-separated subset of . Since is dense in , is also a Souslin line.
We claim that is functionally countable. Let a be continuous function. By Proposition 16, there is a countable set such that is countable. Since is left-separated, for some . Then it follows that so is countable. ∎
Let be the Souslin line from Theorem 18. If is the Dedekind completion of , and Lemma 14 implies that is first countable. By Lemma 2, does not have ordered copies of or . From this and Proposition 5 we conclude that is an Aronszajn line.
19. Question
Is there a functionally countable Aronszajn line in ?
We comment that the functionally countable Souslin line from Example 18 answers some questions from [9] in the negative since it is: non--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 does not imply functional countability of when is a Souslin line; see Theorem 23 below. In order to construct such a counterexample , we need two things. First, we need that 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 is that 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 . It is well known that if is a Souslin line, then there is an uncountable cellular family in ; 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 such that for every the set of predecesors of is well-ordered. Given we will say that and are compatible if there exists such that and ; otherwise, they are incompatible and we write . The height of is the ordinal number isomorphic to . For an ordinal , will denote all elements of of height . An -tree is a tree such that if and .
21. Definition
Let be a linearly ordered set. If is a tree, we will say that a collection is -adequate if the following hold:
-
(a)
for all , ,
-
(b)
if are such that then , and
-
(c)
if are such that then .
Let be a topological space and . Recall that a point is a limit point of if for every open set such that the set is infinite. It is easy to see that is discrete if and only if is pairwise disjoint and no point of is a limit point of .
22. Lemma
Let be a densely ordered and first countable LOTS. Given a -adequate collection , where is an -tree, define . Then
-
(a)
the closures of elements of are pairwise disjoint, and
-
(b)
if is a limit point of , then and there is a sequence such that
-
(1)
for all , ,
-
(2)
for all , and , and
-
(3)
either or .
-
(1)
Proof.
Condition (a) should be clear, we only check (b). Let . It is immediate that if then is not a limit point of . Then we assume that holds and there is no sequence with properties (b)(1), (b)(2) and (b)(3); we will prove that is not a limit point of .
First, consider
Claim.
There exists an open set such that and for every .
To prove the claim, we choose according to the situation we are in. If for all , let be arbitrary. Otherwise, let be the minimal ordinal such that there is with . If let ; otherwise it will necessarily follow that and we choose . Define . Then is an open set of with . It is not hard to conclude that satisfies the claim.
By the claim we may restrict our attention to the case when . By the definition of -adequate, is necessarily a -chain of comparable elements of and in fact, is an initial segment of . Notice that the function for is increasing; likewise the function for is decreasing.
Next, define . Notice that by the definition of -adequate we now that if and either or , then . This implies that . Moreover, if then is necessarily the -maximum of . Thus, it is sufficient to restrict our attention to the case when is nonempty.
Case 1.
There is that is the -maximum of .
In this case, for all . Choose and , and define . Then is an open set in with .
Let . By the definition of -adequate we conclude that either or . If then . If , then . In any of the two cases, .
By taking as in the claim, is an open set containing that is disjoint from all but at most two elements of . Thus, is not a limit point of .
Case 2.
does not have -maximum.
Let and . By considering the Dedekind completion of , we may take and in . Since , we know from Lemma 14 that is first countable. Thus, there is a sequence with properties (b)(1), (b)(2), and . Notice that is a upper bound of and is an lower bound of . By our assumtion, we know that and .
So let and . Here we may forget about and continue working inside once again. We conclude that is cofinal in and for all , and .
Let . Clearly, is an open set in with . Let . Choose such that ; this is possible by our assumption. By the definition of -adequate, we know that either or . If then . If then . Therefore .
As in the previous case, we may take as in the claim above and we conclude that is an open set containing that is disjoint from all but at most one element of . Thus, is not a limit point of . ∎
For the proof of the next result, we will use the tree of all well-ordered natural number sequences of countable length. For , we define if extends as a function; this is usually called the end-extension order. Given , will denote the sequence of length with value . If for some and , denotes the one element of such that and .
23. Theorem
Assume that there exists a Souslin line. Then there exists a Souslin line such that is functionally countable but is not functionally countable.
Proof.
Start with a Souslin line . By [5, Lemma III.5.31], we may assume that is densely ordered. By repeating the procedure described in Theorem 18, we may assume that is left-separated. Since we would like to be able to calculate suprema and infima, we assume that is contained in its Dedekind completion . Thus, all intervals under discussion will be assumed to be subsets of .
We will choose a subset that is dense in . Assume for a moment that we have already defined . Then is densely ordered and is a LOTS with the order induced from . In fact, is a Souslin line. Also, since is left-separated, is left-separated. By Lemma 20, is a functionally countable Souslin line.
Now, we must explain how to construct . We will recursively define a tree and a -adequate collection . By Lemma 22, we know the limit points of ; we shall define to be equal to minus these limit points.
The tree will be an -tree where every node has countably many immediate successors and such that all levels of are countable. In order to simplify the proof, will be a subset of , the order in will be given by end-extension and for every .
We proceed with the construction of by recursion and along with every , we choose . First, let be a maximal pairwise disjoint collection of non-degenerate closed intervals with endpoints in . Since , is countable. Moreover, since and all elements of have different endpoints, it easily follows that is necessarily infinite. We then enumerate . For every , we choose arbitrarily. We also define .
Assume that and we have chosen and in such a way the the conditions in Definition 21 are satisfied for all . We also require the following condition in our recursion:
-
For , is dense in .
We start by assuming that for some . Given , let be a maximal pairwise disjoint collection of closed intervals with endpoints in , all contained in either or . Then is countable and infinite. So enumerate and for each choose arbitrarily. We also define . It should be clear that if holds, then holds as well.
Now, assume that is a limit ordinal. Consider the collection of all such that for all ; that is, the set of all branches through the subtree that has been defined so far. Notice that for , is a decreasing collection of closed, non-degenerate intervals with endpoints in . Then is a convex subset of . We define .
Let and for every , so that . Let be the set of all such that . Since is a countable set, is not dense in or .
Claim 1.
The set of convex components of coincides with the collection of the sets of the form for .
We prove Claim 1. First, let be a convex component of . Given , from property we can conclude that there must exist such that ; such is unique (among elements of ) because of property (b) from Definition 21. From property (c) from Definition 21 we conclude that is a -chain so we may take . Clearly, and . Since is open in the densely ordered space , in fact . Notice also that since is open, .
Now, let , we must prove that is a convex component of . To prove this, it is sufficient to prove that and that .
Given , since , by property (c) in Definition 21, . In particular notice that, . Further, if , property (b) in Definition 21 implies . Thus, .
Now, notice that by the definition of , is a strictly increasing sequence, is a strictly decreasing sequence, and . This shows that and, as discussed above, completes the proof of Claim 1.
From Claim 1, , and , we conclude that is nonempty and countable. Define ; this is a countable infinite set. Finally, for each , let be a maximal pairwise disjoint collection of closed intervals with endpoints in , all contained in . Again it can be easily checked that is countable infinite and we can enumerate . Also, for and choose arbitrarily. It should be clear that the inductive hypotheses hold in this step too, including .
This concludes the recursion. We define
Claim 2.
The following properties hold:
-
(i)
is an -tree with countable levels,
-
(ii)
is -adequate,
-
(iii)
for each , , and
-
(iv)
is dense in .
Items (i) and (ii) should be clear from the construction. Let us next prove (iii). Notice that by construction . So let be a limit and , it is sufficient to prove that .
If , by the definition of . By property (c) of Definition 21, we conclude that . This proves that for all with .
If and , then since the domain of is necessarily a successor ordinal, for some . By property (c) of Definition 21, it follows that . But by our construction, so .
Finally, let be such that , and let with . If , we know that and . Since , by properties (a) and (b) of Definition 21 we conclude that . If , then and . Let . Since , and , by property (b) of Definition 21, .
Now, we prove statement (iv). Let and assume that . Given any , by property and property (b) of Definition 21, there exists a unique element such that . By properties (b) and (c) of Definition 21 it follows that whenever . But then is an ordered copy of in , this is impossible by Lemma 14 since .
This concludes the proof of all items in Claim 2.
We are ready to prove that has the desired properties. First, by properties (iii) and (iv) we conclude that is a subset of that is dense in . As discussed in the begining of the proof, this implies that is a functionally countable Souslin line.
Next, for each let and consider the set . Notice that is a collection of open subsets of . Further, for every . Since is dense in , is a nonempty open subset of for every .
Let , we claim that this is a discrete uncountable family of open sets. That is uncountable follows from the fact that is an -tree with countable levels. By (a) in Lemma 22 it follows that has pairwise disjoint closures in , so also has pairwise disjoint closures in . Notice that, in order to prove that is discrete, it is sufficient to prove that all limit points of are in .
Assume that is a limit point of . According to (b) in Lemma 22, and there is a -decreasing sequence such that and for all , or . For each let be such that . Notice that if . Define and . But then it easily follows that and . Thus, either or . So .
This completes the proof that is an uncountable discrete family of open nonempty subsets of and by [8, Proposition 3.1 (c)], is not functionally countable. ∎
Notice that the tree 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 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 such that 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.