The category of well-filtered dcpo’s is not -faithful
Abstract
The Ho-Zhao problem asks whether any two dcpo’s with isomorphic Scott closed set lattices are themselves isomorphic, that is, whether the category of dcpo’s and Scott-continuous maps is -faithful. In 2018, Ho, Goubault-Larrecq, Jung and Xi answered this question in the negative, and they introduced the category of dominated dcpo’s and proved that it is -faithful. Dominated dcpo’s subsume many familiar families of dcpo’s in domain theory, such as the category of bounded-complete dcpo’s and that of sober dcpo’s, among others. However, it is unknown whether the category of dominated dcpo’s dominates all well-filtered dcpo’s, a class strictly larger than that of bounded-complete lattices and that of sober dcpo’s. In this paper, we address this very natural question and show that the category of well-filtered dcpo’s is not -faithful, and as a result of it, well-filtered dcpo’s need not be dominated in general. Since not all dcpo’s are well-filtered, our work refines the results of Ho, Goubault-Larrecq, Jung and Xi.
As a second contribution, we confirm that the Lawson’s category of -compact dcpo’s is -faithful. Moreover, we locate a class of dcpo’s which we call weakly dominated dcpo’s, and show that this class is -faithful and strictly larger than .
Keywords: Ho-Zhao Problem, -faithfulness, well-filtered dcpo’s, weakly dominated dcpo’s.
1 Introduction
One of the most important topologies on posets is the so-called Scott topology, which consists of upper subsets that are inaccessible by suprema of directed subsets in given posets, and has been playing prominent rôle in domain theory, non-Hausdorff topology and denotational semantics, among others. As can be seen from definition, Scott topologies are uniquely determined by the order structure on posets. A more intriguing question is the converse: does the Scott topology of a poset determine the order of the poset? In order to form this question more rigorously, we let denote the set of all Scott closed subsets of a poset , ordered by inclusion. The poset is a complete lattice for each . The aforementioned question is then formalized as:
If and are posets with isomorphic to (, in symbols), is it true that ?
This question was perfectly answered by Zhao and Fan in [15], where they showed that each poset admits a so-called dcpo-completion , with the property that is a directly-complete poset (dcpo for short) and . Hence, any poset which fails to be a dcpo, together with its dcpo-completion , fails the above question. This observation has led Ho and Zhao narrow this question to the category of dcpo’s and Scott-continuous maps [7], and they call a full subcategory of -faithful if for every pair and in , implies . In [7], Ho and Zhao identified the category of bounded complete dcpo’s as one of -faithful subcategories of , and asked whether the category itself is -faithful. The question was later dubbed the Ho-Zhao problem. In 2016, Ho, Goubault-Larrecq, Jung and Xi exhibited a dcpo which is not sober in the Scott topology, and showed that and its sobrification serve as instances for the fact that fails to be -faithful. In addition, they gave a -faithful full subcategory of , which consists of the so-called dominated dcpo’s. Notably, the category of dominated dcpo’s subsumes many known -faithful subcategories of dcpo’s, for example, the category of sober dcpo’s and that of bounded-complete lattices, to name a few. In Section , we show that the category of dominated dcpo’s also includes the category of -compact dcpo’s.
Generalizing both sober dcpo’s and -compact dcpo’s, well-filtered dcpo’s are ones that are well-filtered in the Scott topology, and the category of well-filtered dcpo’s is a strictly smaller subclass of . A natural question arises as whether well-filtered dcpo’s also are subsumed under dominated dcpo’s, or whether the category is -faithful? In this paper, we will mainly investigate this natural question and give concrete examples to deduce that is not -faithful. Hence, well-filtered dcpo’s may fail to be dominated. Our examples make use of an example given by Zhao and Xi in [16], where they showed that is a well-filtered dcpo, but not sober in its Scott topology.
While the paper itself displays a negative result, it refines the results of Ho, Goubault-Larrecq, Jung and Xi, and it also reveals the distinction between the category and the newly found , where the later class definitely needs more clarification. Finally, we introduce the category of weak dominated dcpo’s, and show that it is a -faithful category that is strictly larger than the class of dominated dcpo’s.
2 Preliminaries
In this section, we introduce some basic concepts and notations that will be used in this paper.
Let be a partially ordered set (poset, for short), is directed (resp., filtered) if is nonempty and for any finite subset , there is a such that is an upper bound (resp., a lower bound) of . A poset is called directed complete (dcpo, for short) if every directed subset of has a least upper bound, which we denote by , or . For any subset , let = a for some and = for some . Specifically, we write = and = . We will call an upper set (resp., a lower set) if = (resp., = ).
A subset of is Scott open if = and for any directed subset for which sup exists, sup implies . Accordingly, is Scott closed if = and for any directed subset of with sup existing, implies sup . The set of all Scott open sets of forms the Scott topology on , which is denoted by , and the set of all Scott closed sets of is denoted by . Furthermore, for a subset of , we will use or to denote the closure of with respect to the Scott topology on . The space also is denoted by , some authors refer such a space, a poset endowed with the Scott topology, a Scott space. Recall that the lower topology on is defined to have the principal filters for as subbasic closed sets.
For a space , the partial order X, defined by if and only if is in the closure of , is called the specialization order on . Naturally, the closure of a single point is , the order considered here is, of course, the specialization order. The specialization order on a Scott space coincides with the original order on . A subset of is compact if every open cover of admits a finite subcover, and the saturation of a subset is the intersection of all open sets that contain it. A subset is called to be saturated if it equals its saturation. Besides, for every subset of , the saturation of coincides with under the specialization order. Every compact saturated subset in a Scott space is of the form , where is the set of minimal elements of [8]. And usually, we use to denote the set of all non-empty compact saturated subsets of .
A space is sober if every irreducible closed subset of is the closure of some unique singleton set , where is called irreducible if for closed subsets and implies that or . We denote the set of all closed irreducible subsets of by . Every sober space is a well-filtered space, in the sense that for every filtered family (in the conclusion order) of compact saturated subsets and every open subset of , implies that there is already some with . Well-filtered spaces can also be characterized by the so-called KF-sets. In a space , a nonempty subset of is said to have the compactly filtered property ( property), if there exists a filtered family such that is a minimal closed set that intersects all members of . We call such a set a -set and denote by the set of all closed -sets of . It is shown in [14] that a space is well-filtered if and only if every -set of is the closure of some unique singleton set . Finally, we remark that every -set is irreducible, i.e., for each space [14].
3 -compact dcpo’s are dominated
In this section, we deduce that the category of dominated dcpo’s subsumes the category of -compact dcpo’s.
Definition 3.1.
[9] Let be a space and be its order of specialization. We equip X also with its -topology defined from the order of specialization. We say that is -compact if every closed subset of is compact in the -topology.
Definition 3.2.
[6] Given , we write if there is such that . We write for the set . A dcpo is called dominated if for every closed irreducible subset of , the collection is Scott closed in .
Lemma 3.3.
Let be an -compact dcpo. Then is a dominated dcpo.
Proof.
From the definition of dominated dcpo’s, it suffices to prove that is a Scott closed subset of for any . To this end, let be a directed subset of . Then there exists such that for any . This means that for any . Note that is closed in the lower topology and is filtered. Then the fact that is -compact reveals that . Since , we have . Hence, . ∎
From the above lemma, we can arrive at the following theorem immediately.
Theorem 3.4.
The category of -compact dcpo’s is -faithful.
We know that -compact dcpo’s are well-filtered dcpo’s. It is nature to ask whether the category of well-filtered dcpo’s is -faithful. Next, we study the problem.
4 The category of well-filtered dcpo’s is not -faithful
In this section, we first give the definition of a dcpo , which will be shown to be well-filtered but not sober in the Scott topology. Moreover, we will see that is isomorphic to , where is the poset of all irreducible closed subsets of in the set inclusion order, and is a sober dcpo. Since is not sober, it cannot be isomorphic to . Hence, the pair of well-filtered dcpo’s and illustrates that the category of well-filtered dcpo’s is not -faithful.
4.1 The definition of the counterexample
Let be the first non-countable ordinal and be the set of all ordinals strictly less than . Then consists of all finite and infinite countable ordinals.
Remark 4.1.
[3] The following results about are well-known:
-
1.
, where denotes the cardinality of .
-
2.
is sequentially complete. That is, for every countable subsequence , , here the is taken with respect to the usual linear order on ordinals.
-
3.
For any , is a finite or countably infinite subset of .
Now let us review a poset given by Zhao and Xi in [16]. We will use this poset as building blocks for our dcpo . Let and . The order on is given by if and only if:
-
•
and , or
-
•
and if ,
and the order structure of can be easily depicted, as in Figure .
Figure 1: A non-sober well-filtered dcpo .
We gather some known results about . The reader can find details in [16].
Lemma 4.2.
-
1.
The poset is a dcpo;
-
2.
is well-filtered, but not sober in the Scott topology;
-
3.
The only closed irreducible subset of that is not a principal ideal is itself.
For each , we use the convention to denote the set of elements on the -th level of . That is, . We call the maximal level in . Similarly, we say that elements of the form , are in the -th column of .
The process of constructing is similar to that of in [6]. An informal description of this construction is as follows: We begin with and for each level of , we add a copy of below and identify maximal points of with elements in in the canonical way – identifying in with in . No order relation between the non-maximal elements of two different is introduced. Now, we repeat this copy-and-identify process and add copies of below non-maximal levels of , copies of below non-maximal levels of these copies of which are already added in the previous step, and proceed infinitely countable many times.
In order to keep all copies of in right place, we use strings on to index them. To start with, we let be the set of finite strings of elements in , and for any , is such that adding the element to the front of , and is the concatenation of and . Now, we use to denote the original , where is the empty string; for strings of length , i.e., , denotes the copy of that is attached below of , the -th level of ; for strings of length larger than or equal to , say with and being the obvious remaining substring of , denotes the copy of that is attached below the -level of which is already well placed by induction. Then, the union will be the underlying set of our poset . However, there are two issues to be settled. First, we need to denote elements in this big union. This is easy, as we can use with to denote the element in in the canonical way. Second, we need to take the identifying process into the consideration. In this scenario, we will identify , the element in , with , the maximal point in . What we get after this identification is the correct underlying set of our poset .
Note that we equate the elements of with of , each element of can be marked as the form of , , and may be . As appears as the second coordinate of each element in , we simply omit it. By doing so it enables us to use to label all elements of . With this all in mind, we now give the rigorous definition of .
Let be . We define the following relations on (where ), which is reminiscent of the order on in [6].
-
•
if ;
-
•
if ;
-
•
if and .
In the third dotted item, denotes the least ordinal appearing in the string , hence makes sense. The definitions of these three kinds of relations are similar to that on given by Ho et al. in [6], and we can obtain a partial order through the following results, where we use to mean composition of relations.
Proposition 4.3.
-
1.
are transitive and irreflexive, respectively.
-
2.
-
3.
-
4.
-
5.
-
6.
is transitive and irreflexive.
-
7.
is a partial order relation on .
Definition 4.4.
We define to be the poset which consists of the set and the order relation in 4.3.
In the rest of this section, we will prove in steps that is a well-filtered dcpo and that the pair and its sobrification witness the fact that the category of well-filtered is not -faithful.
4.2 is a dcpo
Sketch of the proof. We prove that is a dcpo by showing that every chain in has a supremum [10, Corollary 2]. Since always exists when itself has a largest element, we only need to take care of the case where is a strictly increasing chain without a largest element. And of course, in the latter case must be infinite and we call such chains non-trivial. Similar to Proposition 5.3 in [6], we will be able to show that every non-trivial chain in contains a cofinal chain of the form , where and are fixed, and is an infinite subset of . This means that every non-trivial chain in eventually stays in the -column of copy for some string . Hence, in order to prove that is a dcpo, we only need to verify the existence of suprema of non-trivial chains in that particular form, which is then doable.
Proposition 4.5.
is a .
Proof.
Let be a non-trivial chain in .
: contains a cofinal chain of the form , with and fixed.
Let be a non-trivial chain. Each relationship has to be one of the five types listed in item (6) of Proposition 4.3. All of these, except , strictly reduce the length of the string , so they can occur only finitely often along the chain. Therefore, from some index onward, the connecting relationship must always be which implies that the shape of the entries , , is as stated.
: If is uncountable, then .
Since for any , is an upper bound of . It remains to confirm that is the least upper bound of . Assume that is another upper bound of . Then each must be related to it by one of the five types listed in Proposition 4.3. We set
,
where . It follows that at least one of the five sets is uncountable from the uncountability of .
Case 1, is uncountable. For any , , then and can be written as for some fixed . It is obvious that is countable, which contradicts the fact that is uncountable.
Case 2, is uncountable. For any , , so we have and . Assume that , where . Then when or when .
Case 3, is uncountable. For any , , that is, there exists such that . Then and can be fixed since all of these have the same lengths as , and . Set which has been fixed. So we have or .
Case 4, is uncountable. For any , , then for some . If , then for all , which will result in a contradiction as is countable, but is uncountable. Thus and for any . The fact that is a fixed countable ordinal guarantees the existence of with . It follows that according to . Hence, it turns out that .
Case 5, is uncountable. For any , , that is, there exists such that for any . Then and can be fixed because all of these have the same lengths as , and . Set which has been fixed. Thus . Similar to the proof of Case , we can get that .
: If is countably infinite, then , where .
It is evident that is an upper bound of because for each . Assume that is another upper bound. Now we set the same set as which in Claim . Then there must exist at least one of the five sets being the cofinal subset of . One sees directly that if is a cofinal subset of .
Case 1, is cofinal in . For each , , this means and if we set for some fixed. Then . Thus or .
Case 2, is cofinal in . For each , , then and , which yields that .
Case 3, is cofinal in . Then for each , , that is, there is such that . This implies that and can be fixed because all of these have the same lengths as , and . Set which has been fixed. Hence, holds.
Case 4, is cofinal in . Then for each , , so for some and . If or for all , then for each . This manifests that . Note that and . As a result, . If and there is a for some , then because of . It follows that . So we can gain that .
Case 5, is cofinal in . For each , we know . This means that there exists satisfying for each . So and can be fixed as since the length of each is same as , and . This suggests that . By using similar analysis of Case , we can obtain that .
This covers all cases to be considered and we conclude that is a . ∎
4.3 The Scott closed irreducible subsets of
Next, we shall characterize the Scott closed irreducible subsets of and make a conclusion that , where .
The following lemma is immediate and we omit the proof.
Lemma 4.6.
Let be a subset of . Then is Scott closed if it is downward closed and contains the sups of every non-trivial chain of the form contained in , where .
Lemma 4.7.
Let be a Scott closed subset. If contains uncountable number of elements of for some , then .
Proof.
Let be a subset of with an uncountable set . For any , since each element of is related to by the relation and is a downward closed set. Thus for any , , which implies that . ∎
Proposition 4.8.
For any , is Scott closed and irreducible.
Proof.
: is Scott closed.
Obviously, is a lower set. Now it remains to confirm that contains the supremum of every non-trivial chain of the form contained in by Lemma 4.6. To this end, let be a non-trivial chain. We set
,
where . Then there exists at least one of the five sets being the cofinal subset of whether is countable infinite or uncountable.
Case 1, is cofinal in . For any , for some . Then we have if we set as for some . Under this condition, is countable and . So or .
Case 2, is cofinal in . For any , for some . We can get that and , so or .
Case 3, is cofinal in . For any , there is such that . Then we have , and has the same length as , which leads to the result that can be fixed as . Thus or .
Case 4, is cofinal in . For any , for some . Then and hence, or .
Case 5, is cofinal in . For any , for some , which implies that there exists such that . Then and has the same length as . This yields that can be fixed as . It follows that or .
Now we can gain our desired result that is Scott closed.
: is irreducible.
It suffices to deduce that is irreducible. Let be two Scott open subsets of with . Then choose and . Because , we can find and for some from the Scott openness of and . Without loss of generality, suppose that , then , which result in the conclusion that . Therefore, is irreducible. ∎
From the above proposition, we know that must be Scott irreducible closed sets. Conversely, to prove that , we need to consider endowed with the order at first, which is defined in the following.
Based on the observation of the definition of the order relation on , we can find that the two relations concern only the strings component of points . We use them to define an order on (where , ):
-
•
if
-
•
if .
Then is transitive and irreflexive, hence, is an order relation on , and with the order relation is a poset. We denote it by and describe parts of in Figure .
Remark 4.9.
Combine with the order on , we have:
-
1.
If , then ;
-
2.
If , then ,
where , .
We state and derive an analogous result for with the aid of [6, Proposition 5.9] and Proposition 4.5.
Proposition 4.10.
-
1.
For any , is a linear ordered subset of .
-
2.
The poset endowed with the Scott topology is sober.
-
3.
The map defined by is Scott continuous.
Figure 2: The order on .
We remark that for any chain (or ), exists and (or ) since there exists (or ) being a cofinal subset of (or ), where (or ) is the subset of . Thus in the following context, we can regard any non-trivial chain in (or in ) as the form of (or ) with some (or ). In addition, a straightforward verification establishes that when is uncountable, and when is countable.
Lemma 4.11.
Let be a subset of . If is closed for the of any uncountable non-trivial chain, then we have , where
.
Proof.
One sees immediately that and , then it remains to prove that is Scott closed.
Claim 1: is closed for the of any uncountable chain contained in .
Assume that be an uncountable chain. Then there exists such that for each . If for any , or , then is an uncountable chain of , so by the assumption that is closed for the of any uncountable non-trivial chain. This yields that . If there exists , then for all . Thus or . The case of which there exists is similar to the former. So .
Claim 2: is Scott closed.
Let be a non-trivial chain of with being uncountable. Then there exists being a countable chain such that for any . We distinguish the following two cases:
Case 1, For each , or . If is uncountable, then there must exist being uncountable such that is a cofinal subset of . By Claim , we have . Thus . If is countable, then there exists a such that the set is uncountable, which implies that is a cofinal subset of . It follows that if we set as for some . This means that . So we can obtain that is a countable set, which is impossible.
Case 2, There exists such that or (since the proof of the two cases are similar, we omit that of the latter). Then we have for all . Hence, or , so .
So we have proved that is closed for the of any uncountable chain. Ones sees obviously that is closed for the of any countable chain and is a lower set. We can conclude that is Scott closed. ∎
Lemma 4.12.
Let be a Scott closed irreducible subset of . Then exists and , where is the Scott continuous map defined in Proposition 4.10.
Proof.
By reason that is irreducible in and is Scott continuous, we have . Then there exists such that from the sobriety of , which results in . It suffices to show that .
: is closed for the of any uncountable non-trivial chain, and a lower set.
Due to the item (2) in Remark 4.9, the result that is a lower set follows immediately. Let be an uncountable non-trivial chain in . If for any , is uncountable, where , then by Lemma 4.7, so for each . Because is uncountable and is Scott closed, for any . It follows that . If is countable for some , then the fact that is a lower set implies that for any . This means that is countable for any , which guarantees the existence of with the property for all , owing to the uncountability of . Thus for each . Therefore, we have for any as is Scott closed, that is, .
Assume for the sake of a contradiction that . By Claim 1, we know . This infers that , where
.
This implies that there exists a countable chain satisfying . Assume that , where is a countable subset, that is, . Then there must exist such that is countable. If not, is uncountable for all , then by Lemma 4.7, and for each , , which reveals that , that is, , a contradiction. Thus is countable for some . This guarantees the existence of . Now we let , . Set
.
: is Scott closed.
Let be a non-trivial chain in . If is cofinal in , then obviously, is less than or equal to . Therefore, it belongs to . If is cofinal in , then for any , there exist and such that . Let
,
and
,
where . Now we need to distinguish the following cases.
Case 1, is cofinal in . For any , there exist and such that . Then and is a chain contained in , so exists and . This means that and . We conclude that .
Case 2, or is cofinal in . It is easy to verify that , so we omit the proof here.
Case 3, is cofinal in . For any , there exist and such that , so . The finiteness of the length of ensures the existence of such that is cofinal in . Assume that , then . If or for all , then for any and is countable under this condition. It follows that as . This indicates that . Thus that holds. Else, and there is a such that . Then we have according to , which leads that . Hence .
Case 4, is cofinal in . For any , there exist and such that , that is, for some . Then there exists such that is cofinal in as the length of is finite and . The rest of the proof is similar to Case . Thus we have .
Therefore, is Scott closed.
Note that and is irreducible. Then or .
Claim 3: .
Suppose . Then . The continuity of results in . It follows that as is closed for the sups of any uncountable non-trivial chain (the proof is similar to that of ). Then . This means for some countable chain . Since , we can obtain that is a cofinal subset of , which yields that there exists a such that . So we can find such that . However, according to the construction of , the result that follows immediately, which is a contradiction to the fact that . Hence, .
Now we claim that for any , there is a such that . Suppose not, if there is a such that for any with , , then for each , , and we know that , which contradicts the assumption that .
Thus for any , there is a such that . It follows that for , we can find such that , . The assumption that reveals that for some . It turns out that there is in satisfying that . Write . The Scott closedness of indicates that . Let . Then as and , which yields . Note that is nonempty by reason of . Then is nonempty. Pick . We can get that from .
Now we set , then .
: is Scott closed.
By the construction of , we know
.
The set is obviously a lower set. So it remains to prove that is closed for the of any non-trivial chain. To begin with, we first notice that . Suppose , then because of the fact that , which is a contradiction to the assumption that . It follows that . In other words,
.
Let be a non-trivial chain in . If is cofinal in , then . Else, is cofinal in . Then, for any , there exists such that and . We set
,
and
,
where . Now we need to distinguish the following cases.
Case 1, is cofinal in . For any , there exist and with such that . Then we have and is a chain in . It follows that from the Scott closedness of . Furthermore, . It is obvious that since for each . So we have .
Case 2, or is cofinal in . Clearly, in this case.
Case 3, is cofinal in . For any , there exist and with such that . Then . Since the length of is finite, there exists such that is cofinal in . Let . Then and for all . If or for each , then , which implies that and is countable. So . Thus . If and for some , then , which yields that . This means that by the fact that .
Case 4, is cofinal in . For any , there exist and with such that , that is, there is a for each such that . We can also find to make cofinal in . Then with a process similar to that in Case , we conclude that .
Therefore, is Scott closed. Since is irreducible in , we have or . If , then for any , . This means that , a contradiction. Thus . It follows that , that is, there exists such that . Now we need to distinguish the following two cases.
Case , . Then , where , and . Via , we have . So . The assumption that indicates that . Then . This implies or . Hence, it turns out that , which yields that and by reason of the fact that . This is a contradiction to the assumption that .
Case , . Then . This means that , which leads that . It violates the assumption that .
In a conclusion, . ∎
Theorem 4.13.
The irreducible closed subsets of are just closures of single elements and the closures of levels.
Proof.
Let be an irreducible closed subset of and . Then we have by Lemma 4.12, which implies that and , it is equal to saying that . Next we want to show that or for some . If is uncountable, then and so holds. Else, the set is countable, pick such that . Let . Then . Now we construct a Scott closed set containing . For , we know exists and . Let
, ,
where . And for any , we set
.
Now let , where are defined as follows:
-
•
if
-
•
if
-
•
if .
: If is a non-trivial chain, then is countable.
Assume that there exists an uncountable non-trivial chain contained in . Then for any , there is a such that , that is, with . It is easy to verify that and if for any . In addition, note that for each , which means that . The fact that for any suggests that . This reveals that is a chain by Proposition 4.10, which ensures that we can find a cofinal subset of in which there is only the relation among all elements. For any with , it turns out that . Note that for any with , we can conclude that because for any and is a lower set. Then the fact that is a chain infers that or for any with . Due to the assumption that , we can deduce that , so . Now for a fixed , we have . Because is uncountable and for any , the set is uncountable. It follows that is uncountable. Furthermore, is uncountable, which contradicts the fact that is countable.
: is Scott closed.
One sees clearly that is a lower set. So it remains to confirm that is closed for the of any non-trivial chain.
Let be a non-trivial chain in , where . Now we need to distinguish the following cases.
Case 1, is cofinal in . For any , there are and such that , without loss of generality, assume that . We set
and
,
where .
Case 1.1, is cofinal in . For any , there exists with such that . Then and there is a unique such that since for each . Thus .
Case 1.2, or is cofinal in . It can be easily verified that in both cases, so we omit the proof here.
Case 1.3, is cofinal in . For any , there exists with such that . We can find such that is cofinal in by reason that for each and the length of is finite. If , that is, , then . It follows that for each , which implies that . Hence, . Suppose that , that is, . Under this condition, we assume , where or . In the case that and there exists a , then , and so . In the case that or for all , we can get that for each . Since and is countable, is countable under each case and . Thus we have . Note that . Hence, .
Case 1.4, is cofinal in . The argument of this case is similar to the above case.
Case 2, is cofinal in . For any , there are such that . We set
and
,
where .
Case 2.1, is cofinal in . For any , there exist and such that . Then . It turns out that or . As , that is, is uncountable for any . Next, we claim that . Assume that there is a such that . By , we have for some . This indicates that , or else, since and , a contradiction. Thus or . The assumption that guarantees the existence of such that . It follows that or , which will result in a contradiction since there would be a maximal element of being strictly less than an element of . Therefore, . For the converse, By reason that contains a uncountable set , we know that . Let . If , then or since . By the assumption that again, we can find satisfying . Then or , but this will contradict to the fact that . Hence, we can obtain . Now suppose that there are such that . From , we can identify for some . Furthermore, as for any , this is to say . Note that we have assumed that , we have , a contradiction. So for any , there exists a unique such that , which leads to the result that , and we can conclude that .
Case 2.2, or is cofinal in . One sees immediately that in the case.
Case 2.3, is cofinal in . For any , there exist and such that . Then we have for any , which implies . Thus for any given , .
Case 2.4, is cofinal in . The proof is similar to Case .
Case 3, is cofinal in . For any , there exist such that . Set
and
,
where .
Case 3.1, is cofinal in . For any , there are such that . Then and . We know each is countable by Claim 1, so there exists a chain of the form is cofinal in . It follows that is a chain in . Again applying Claim 1, we know that is a countable chain. So there exists a chain of the form contained in as a cofinal subset, and . Hence, we can get that , and hence .
The proof of the residual cases are similar to that of the case 2.2, case 2.3, case 2.4, respectively. Therefore, is Scott closed. Because and , . So our proof will be complete if we can illustrate that cannot be contained in . Suppose not, , then .
-
•
If , then there is with such that , so . Since , , that is, . Thus and so , but this contradicts to the fact that .
-
•
If , then there are such that . This yields that . As is uncountable, so is . This means that , which induces . As a result, . It follows that , so we know that is uncountable, which indicates that is uncountable, but this violates the assumption that is countable.
-
•
If , then there are being a countable chain and with . For any , there is a such that , where , or and or . Then there must exist being a cofinal subset of , where for any . Because for any , we have , . This implies that for each , thus . As , . We can conclude that . This means that , where denotes the string length of for any . But from , we know , a contradiction. Hence, , and so .
In a conclusion, for every irreducible closed subset of , we have proved that either or . ∎
4.4 is well-filtered
In this subsection, we confirm that is well-filtered. First, we consider the compact saturated subsets of .
Lemma 4.14.
If is a compact saturated subset of , then is finite, that is, for some finite subset .
Proof.
Assume for the sake of a contradiction that is infinite. Then for any finite subset contained in , we set . We claim that is Scott closed. To this end, let be a non-trivial chain contained in . For any , there is a such that . Assume that for some , then . So or from Proposition 4.10. Since , . Thus for any , there exists a unique such that . It follows that , which yields that . The set is obviously a lower set, and therefore, is Scott closed. Note that is filtered and , where denotes is a finite subset of . Then we arrive at . Pick , which means that , which is absurd. ∎
Lemma 4.15.
If is a compact saturated subset of , then for any , is countable, where .
Proof.
Assume that there is a such that is uncountable. Then pick , where denotes the set of all positive integers. We know that is countable, which ensures the existence of . Now for each , we set
,
where .
: For each , is Scott closed.
Let be a non-trivial chain contained in .
Case 1, is cofinal in . Then for any , there is such that . For convenience we set
,
where .
Case 1.1, is cofinal in . For any , for some , which implies that , and . So .
Case 1.2, or is cofinal in . In this case, for any , is less than a fixed point , where . Hence .
Case 1.3, is cofinal in . For any , for some . Then for some . If and there is a , then and we can get that . If or for all , then is countable and . So we have and or . Now we need to distinguish the following two cases.
Case 1.3.1, . Then or . This implies that . One sees immediately that . Hence, .
Case 1.3.2, . Then we can find such that . This means that , and we also have that .
Case 1.4, is cofinal in . For any , for some . That is, there is an , such that . Then there is a fixed such that being a cofinal subset of since each and the length of is finite. Then and the residual analysis is similar to that of the above case.
Case 2, is cofinal in . That is, for any , there exists and such that , with . Similar to the above case, we set
,
where .
Case 2.1, is cofinal in . For any , there exist and such that . Then . Thus for each . It follows that for any . This means that . Hence, .
Case 2.2, or is cofinal in . For the case, it is easy to verify that .
Case 2.3, is cofinal in . For any , there exist and such that . Then we have , that is . Thus for any fixed , we have . Therefore, .
Case 2.4, is cofinal in . The proof is similar to Case .
One sees immediately that is a lower set for any . Thus is Scott closed for each .
Since is filtered and , . Choose . We claim that for any . Suppose not, there are such that . Assume that with or , and or , then we can obtain that from the uncountability of . It follows that
for some , which implies contradiction as . Now we suppose that for some , then . This means that there is an such that , and hence, since both of them are minimal elements of . The fact that indicates that , that is, . However, this is impossible. Therefore, the original hypothesis doesn’t hold. So is countable for any . ∎
Lemma 4.16.
If is a compact saturated subset of , then for any , is countable, where .
Proof.
Suppose that there exists such that is uncountable. Let
By Lemma 4.15, we have is countable for any , which implies that must be uncountable. Then pick as a countable subset of , besides, for each , we extract so that , where denotes all positive integers. Then set
and
.
Note that each is countable and if . Now we construct as follows:
,
where .
: For any chain , is countable.
Suppose that there is a chain being uncountable. Then there must exist an uncountable chain contained in for some . That is to say, for any , and so is equal to . Then is a single set, which contradicts the uncountability of .
: For any , is Scott closed.
To this end, let be a non-trivial chain contained in .
Case 1, is cofinal in . For any , there are such that , where each can be assumed to be the minimal element of by the constructions of and . We set
,
where .
Case 1.1, is cofinal in . For any , there are some such that . Then and there is an such that from the minimality in of for any . Thus , which means .
Case 1.2, or is cofinal in . It is easy to demonstrate that in the case.
Case 1.3, is cofinal in . For any , there are some such that . Then , which yields that is unique at the moment, denoted by , that is, for any , there exists such that . Because , and we pick only a minimal element of on each level for any , is a fixed point denoted by . Thus and so .
Case 1.4, is cofinal in . For any , there are some such that , that is, for some . Then is unique since the length of each is same as that of , written as . Assume for some . It follows that in light of , where may be .
Let , where . Then for any with . Therefore, . If and there is , then . So we have . If or for each , then or . The fact that suggests that , which leads to that . Now we need to distinguish the following two cases.
Case 1.4.1, . Then . Note that or , which yields that .
Case 1.4.2, . Then there exists such that , which results in the conclusion that .
Case 2, is cofinal in . That is to say, for any , there are some and a chain such that . Now we set
,
and
,
where .
Case 2.1, is cofinal in . For any , there are and such that . Then . By Claim , we know that must be countable, which ensures the existence of the countable chain being the cofinal subset of . It follows that . This implies that for any . So .
Case 2.2, or is cofinal in . For any or , there are some and such that or . Then , that is, . Hence, for any given or , which leads to that .
Case 2.3, or is cofinal in . The analysis of this case is similar to Case .
As is a lower set for each , is Scott closed. Because is filtered and for any , the set meets . Choose . The uncountability of guarantees the existence of with . Now we claim that there exist , such that . Suppose not, for any , any with , . Then we could find such that , i.e., . It follows that
,
which is a contradiction since the left side of the inclusion is uncountable but the right is countable. Hence, there exists , such that . Now based on the above discussion, we shall know that for any chain . Suppose not, for some and . For each , can be written as with or or . Note that there is a cofinal subset of of the form , in which for each , or . According to , we can get that
.
This violates the assumption that both and are minimal elements of . As a result, for , . But this is impossible with a similar reason in the proof of Lemma 4.15. ∎
Lemma 4.17.
If is a compact saturated subset of , then is countable.
Proof.
By way of contradiction, suppose that is uncountable. In virtue of Lemma 4.15, we have is countable for any . The fact that induces that is uncountable, where the map is defined by . In addition, the continuity of reveals that is a compact subset of . Then is finite due to Lemma 4.14, which yields that there is such that is uncountable. Since the length of is finite, there exists such that is uncountable. This contradicts the result of Lemma 4.16. Hence, is countable. ∎
Theorem 4.18.
is well-filtered.
Proof.
Recall that a space if well-filtered if and only if all its -sets are closures of singletons. We assume that is not well-filtered. Then there exists a -set for some by Theorem 4.13 and that all -sets are irreducible. This implies that there is a filtered family contained in such that is a minimal closed set that intersects each . Set , then a straightforward verification establishes that and is still a minimal closed set that intersects each . Note that for each . Now we fix and let , then is a cofinal subset of and is a minimal closed set that intersects each . The assumption that implies that for all . Pick for each .
: There exists such that for any .
Assume for the sake of a contradiction that for any , there is such that , that is, . Let . Then is cofinal in and so is a minimal closed set that intersects each . The minimality of infers that . This indicates that is uncountable. If not, is countable, we set . Then it is easy to verify that is Scott closed and , but , which is a contradiction to the minimality of . The above discussion also reveals that is uncountable. Now we let
,
then it follows that each is countable by Lemma 4.17. Note that for any given , is a cofinal subset of . This means that , which yields that is uncountable for a similar reason as . Therefore,
is uncountable for all , and is uncountable. It turns out that . Given , for any , there is such that . The countability of ensures the existence of with and being uncountable, by the aids of the equation and the uncountability of the set . Thus there is a with . In a conclusion, we can find and satisfying , with for any , which means that or . The fact that , for any suggests that from the minimality of . This implies that . It follows that . The fact that indicates that , where . Then is finite by Lemma 4.14, which leads to
.
It follows that for some , that is, . Then according to . It turns out that there is a chain of the form being a cofinal subset of enjoying . This means that or . Note that for any . Then assume . We notice that or , and conclude that . We claim that . If not, . The fact that deduces , then , that is, , a contradiction. Hence, , so . This implies that is uncountable because , which in turn implies that , and it means or . Then . But this is a contradiction to the fact that . Therefore, Claim holds.
: There exists such that .
Assume that for any , is not contained in . Then from the fact that for any . We pick , then for all . This contradicts Claim .
: is finite.
We proceed by contradiction. Suppose that is infinite. By Lemma 4.17, we know that is countable. Let , where denotes all positive natural numbers. Then we can identify , which is an upper bound of .
For any , set
.
It is easy to check that is Scott closed for any . By the construction of , we have for each . Then the compactness of implies that . Choose . It follows that . Now the remaining arguments are similar to that in Lemma 4.15.
: For any .
By way of contradiction, assume that there is a such that , that is, there exists . It follows that there is such that , which implies . The fact that suggests that . It indicates that , which contradicts as is contained in .
Now let , which is a cofinal subset of , and so is a minimal closed set intersects , for any . Assume and set . Then is Scott closed. Note that for any from Cliam 4. But . This violates the minimality of . So our assumption that is not well-filtered must have been wrong. ∎
4.5 is not -faithful
In this subsection, we will show that is not -faithful by using the well-filtered dcpo constructed above. It is trivial to check that and are not homeomorphism. Thus if we derive and is well-filtered, then this suffices to show that the category is not -faithful.
Theorem 4.19.
, that is, the family of Scott closed subsets of and are isomorphic.
Proof.
One sees clearly that the Scott topology of is isomorphic to the lower Vietoris topology of , which is the family , where . Note that endowed with the lower Vietoris topology is well-filtered. So it remain to prove that the Scott topology of and the lower Vietoris topology of coincide. It is clear to see that each closed set in the lower Vietoris topology is Scott closed. Now we show the converse. To this end, for each , we write and choose . Then it suffices to show that is Scott closed and .
First, by Proposition 2.2 (4) in [6], we know that for the dcpo , is Scott closed. Next, we confirm that . That is trivial. Conversely, let . Then . By Theorem 4.13, we know that . If is the form for some , then evidently. Else, for some . It follows that for each , there is such that . It turns out that since is a lower set. Furthermore, we get that for each as . Note that is a directed family contained in and is Scott closed. Then . So . Indeed, we have proved that . ∎
5 The category of weak dominated dcpo’s is -faithful
Finally, we give a -faithful category, that of weakly dominated dcpo’s, which is strictly larger than the category of dominated dcpo’s.
Definition 5.1.
[7] Let be a poset and . We say that is beneath y, denoted by , if for every nonempty Scott closed set for which exists, the relation always implies that . An element of a poset is called -compact if . If for some poset , then the set of all -compact elements of is denoted by .
The following proposition is a corollary of [7, Proposition 3.4].
Proposition 5.2.
is a subdcpo of .
Corollary 5.3.
[7] The family of sets is a subset of .
The following results is crucial for further discussion.
Lemma 5.4.
Let be a poset. Then is a Scott closed subset of for each .
Proof.
One sees directly that is a lower set since each element in is a lower set. Let be a directed subset of . Then there exists such that for any . It follows that because is a lower set. From Corollary 5.3, we know that for any . The fact that is a lower set in implies that . This means that is a directed subset of , which yields that . Hence, . ∎
Definition 5.5.
Let be a poset. A set is said to be a -compact set, if is a -compact element of .
C-compact sets are preserved by Scott-continuous functions.
Lemma 5.6.
Let be two posets, if the function is Scott continuous, then is a -compact set of for any .
Proof.
We prove that . To this end, let with . Then . We write .
We claim that is a Scott closed set of . Obviously, is a lower set. Let be a directed subset of . Then we know that there is with for each . It follows that , which means that for any . The fact that is a lower set in tells us that for each . Then we have is a directed subset of . As is Scott closed, it follows that . Thus, .
It is easy to see that . Then the assumption that is a -compact element of guarantees the existence of such that . So we conclude . Again, as is Scott closed, hence a lower set, we obtain that . As a result, is a -compact set of . ∎
Lemma 5.7.
Let be a poset and . If is closed under suprema of -compact sets, then .
Lemma 5.8.
For arbitrary dcpo’s D and E, if and only if .
Proof.
Assume that is an isomorphism. Then the map that sends a Scott closed subset of to witnesses an isomorphism between and . ∎
Definition 5.9.
Given , we write if there is such that . We write for the set .
Lemma 5.10.
Let be a dcpo and .
.
is a -compact set of .
Proof.
The first statement is trivial because for any .
For the second statement, it suffices to prove that . To this end, let with .
: .
For any , . Then there is such that for each . It follows that , and we have .
: .
It is obvious that is a lower set. Let be a directed subset of . Then there exists with for every . By Corollary 5.3, we know that for every . It follows that the Scott closure , taken inside , is contained in . Then as is a lower set. This deduces that since is a directed subset of . It turns out that . Therefore, . In a conclusion, is Scott closed in .
Since is a -compact element of and , that holds. This means that there exists such that . It turns out that , which yields that . So . ∎
Definition 5.11.
A dcpo is called -compactly complete if every -compact subset of has a supremum.
Proposition 5.12.
Let be a dcpo. Then is -compactly complete. Especially, for any .
Proof.
It suffices to prove that . To this end, let with . Then for any . The fact that is a -compact element of implies that . This means that , where . Ones sees obviously that is a Scott closed set of .
Now we claim that is a Scott closed set of . Clearly, is a lower set. Let be a directed subset of . Then there exists with for any . This means that for any . By Lemma 5.4, we know that the set is Scott closed for , which leads to that , as is Scott closed. It follows that is a directed subset of . So . This implies that . So, .
Note that . Then from the fact that . So there exists with , and then . Thus by Scott closedness of . ∎
Finally, we introduce the category of all weakly dominated dcpo’s which serves as a -faithful category.
Definition 5.13.
A dcpo is called weakly dominated if for every , the collection is Scott closed in .
Definition 5.14.
Let be a -compactly complete dcpo and . We write if for all closed -compact subsets , implies that . We say that is -compact if , and denote the set of all -compact elements by .
Lemma 5.16.
A dcpo is weakly dominated, if and only if implies for all .
Proof.
If is weakly dominated, then by Lemma 5.10. Assume , then . This means that .
Conversely, if implies for all . We need to check that is Scott closed in . The set is obviously a lower set. Let be a directed subset of . Then it remains to show that by the assumption that implies . For any , if , then hat implies that . Note that is a Scott closed set of and is a directed subset of . We conclude that . ∎
By observing the above results, we can get the following corollaries.
Proposition 5.17.
For a weakly dominated dcpo , the only -compact elements of are exactly the principal ideals , .
Theorem 5.18.
Let and be weakly dominated dcpo’s. The following are equivalent:
-
1.
;
-
2.
;
-
3.
.
The following theorem follows immediately.
Theorem 5.19.
The category of all weakly dominated dcpo’s is -faithful.
6 Weakly dominated dcpo’s may fail to be dominated
From the definitions of dominated dcpo’s and weakly dominated dcpo’s and the fact that is contained in for each dcpo , we could easily see that dominated dcpo’s are weakly dominated. We show in this section, by giving a concrete example, that weak dominated dcpo’s form a strictly larger class than that of dominated ones. As we will see, our example is given in Example 6.4, which relies on two steps of preliminary constructions that are based on Isbell’s complete lattice and Johnstone’s dcpo.
Example 6.1.
Let denote the maps from to , , , , where is the set of positive natural numbers. An order on is defined as follows:
if and only if:
-
•
, ;
-
•
, .
Next, let , where is the set of real numbers. Then there exists an injection such that for any with . We write by for any and by for any . An order on is defined as: if and only if:
-
•
, in ;
-
•
. If , then there exists , such that , and . Else, , then there exists such that and .
Lemma 6.2.
The poset is a dcpo with the fact that there are only finitely many minimal upper bounds for each pair of elements in .
Proof.
The proof is similar to [11, Fact 4.1]. ∎
Example 6.3.
Let , where is the set of all positive natural numbers. We write by for any and by for any . An order on is defined as: if and only if:
-
•
, , ;
-
•
, , .
Then (We depict as in Figure ).
Proof.
: rhs lhs.
By Corollary 5.3, we know that is contained in . For any , is Scott closed. It remains to prove that and are -compact elements of . To this end, let with . For any , the result follows obviously. Observing the order on , we get that the Scott closed set . Then belongs to for all . Note that is a directed subset of . Then as is Scott closed. Therefore, is a -compact element of . The proof of that runs similarly.
: lhs rhs.
Let . For the sake of a contradiction we assume that .
-
: .
Assume that there is . Then . One sees immediately that is Scott closed from the order of . Because is contained in , is irreducible. It follows that or . The assumption that implies that . This means that , which yields that . A contradiction.
-
: Define . Then is infinite.
Suppose is finite. Let . According to , we have that is finite. Then . The set is Scott closed as is finite. It is easy to see that is Scott closed. From the irreducibility of and the fact that belongs to , we know that . This indicates that there exists such that , which is a contradiction. Hence, is infinite.
The assumption that implies that there exists a minimum natural number such that is finite for any . If not, for any , there exists such that is infinite. As is Scott closed, we have that . This yields , a contradiction. We write , and distinguish the following two cases for .
Case : is finite. Then . Since is finite for any , we have is Scott closed. The finiteness of ensures that is Scott closed. Similar to the proof of Claim 2.2, we know that for some . A contradiction.
Case : is infinite. Note that is infinite for any . Then as is Scott closed. It follows that for any with , the set is infinite from the infiniteness of . Define . If E is finite, then there is such that is infinite. It follows that as is the minimum natural number with the property that is finite for any . This contradicts that . Else, is infinite. Then we could find with . This guarantees the existence of such that , which yields that for any with . Then we would know that , again from the Scott closedness of . But that violates the assumption that . In summary, we have that Claim 2 holds.
In a conclusion, . ∎
Figure 3: The order between different blocks on .
Now we construct a weakly dominated dcpo based the above dcpo’s and , which fails to be dominated.
Example 6.4.
Let . Fix , where the function is defined as in Example 6.1. An order on is defined as if and only if:
-
•
in ;
-
•
in ;
-
•
, , .
Then is weak dominated, but not dominated.
Proof.
: is not dominated.
Similar to the argument of [11, Remark 4.1], is an irreducible closed set. Set . Notice that is a directed subset of , but . Hence, by definition, is not dominated.
: .
The right side of the equation is obviously contained in the left side by Example 6.3. Conversely, let . By way of contradiction we assume that .
We distinguish the cases whether is contained in :
Case : . In this case we claim that is a -compact element of . To this end, let with . Then the fact that is a Scott closed set of indicates that is a Scott closed subset of . It follows that as . So we have is a -compact element of , that is, . That is a contradiction.
Case : . Then . We claim that . Note that . By the definition of , one sees immediately that is a Scott closed set of . Since is a -compact element of , we know that is irreducible. This means that or . The assumption that implies that . In other words, . Similar to the proof of Example 6.3, we have . Define . It is obvious that is a lower set of . We want to show that is Scott closed. To this end, let be a non-trivial chain of . Now we distinguish the following two cases for .
Case : . Then the fact that is Scott closed concludes that .
Case : . Then there exists such that for any . This means that there exists such that for all . Now we need to further distinguish the following two cases.
Case : for any . If is a finite set, then there exists such that for any . It follows that . Otherwise, is an infinite set. Then for any . In light of Example 6.1, we have that is a dcpo with the condition that there are only finitely many minimal upper bounds of each pair of elements in , which yields that for any , must be the form of , for some fixed and , and this reveals that is a directed subset of since is a lower set. Scott closedness of then implies that . Hence, .
Case : there exists such that . Then for any . For any with , we know . This implies that by the order defined on , which yields that for any . It turns out that for any . Thus, .
In the both sub-cases, hence in the Case 2.2, is Scott closed.
Now in the Case 2, we then know that since . This gives that for some or . A contradiction. Hence we finish proving Claim 2.
Now it is trivial to check that is Scott closed for . So Indeed, is weak dominated, but not dominated. ∎
Acknowledgement
This work is supported by the National Natural Science Foundation of China (No.12401596, No.12231007 and No.12371457).
References
- [1] A. Alghoussein, A.S. Ibrahim, A Counterexample to the Generalized Ho-Zhao Problem, Journal of Mathematics Research, 7(3) (2015) 137-140.
- [2] D. Drake, W.J. Thron, On the representations of an abstract lattice as the family of closed sets of a topological space, Transactions of the American Mathematical Society, 120(1) (1965) 57-71.
- [3] R. Engelking, General Topology, Sigma Series in Pure Mathematics, 1989.
- [4] G. Gierz, K. H. Hofmann, K. Keimel, J. D. Lawson, M. Mislove, D. S. Scott, Continuous Lattices and Domains, Cambridge University Press, 2003.
- [5] J. Goubault-Larrecq, Non-Hausdorff Topology and Domain Theory, Cambridge University Press, 2013.
- [6] W. Ho, J. Goubault-Larrecq, A. Jung, X. Xi, The Ho-Zhao Problem, Logical Methods in Computer science, 14(1:7) (2018) 1-19.
- [7] W. Ho, D. Zhao, Lattices of Scott-closed sets, Commentationes Mathematicae Universitatis Carolinae, 50(2) (2009) 297-314.
- [8] X. Jia, Meet-continuity and locally compact sober dcpo’s, PHD thesis, University of Birmingham, 2018.
- [9] J. D. Lawson, G. Wu, X. Xi, Well-filtered spaces, compactness, and the lower topology, Houston Journal of Mathematics, 46 (2020) 283-294.
- [10] G. Markowsky, Chain-complete posets and directed sets with applications, Algebra Universalis, 6 (1976) 53-68.
- [11] H. Miao, Z. Yuan, Q. Li, A discussion of well-filteredness and sobriety, Topology and its Applications, 291 (2020) 107450.
- [12] H. Miao, Q. Li, D. Zhao, On two problems about sobriety of topological spaces, Topology and its Applications, 295 (2021) 107667.
- [13] H. Miao, L. Wang, Q. Li, D-completion, well-filterification and sobrification, arXiv: 2101.04894.
- [14] C. Shen, X. Xi, X. Xu, D. Zhao, On well-filtered reflections of spaces, Topology and its Applications, 267 (2019) 106869.
- [15] D. Zhao, T. Fan, Dcpo-completion of posets, Theoretical Computer Science, 411 (2010) 2167-2173.
- [16] D. Zhao, X. Xi, Y. Chen, A new dcpo whose Scott topology is well-filtered but not sober, Topology and its Applications, 252 (2019) 97-102.