Quasiexact Posets and the Moderate Meet-continuity
Abstract
The study of weak domains and quasicontinuous domains leads to the consideration of two types generalizations of domains. In the current paper, we define the weak way-below relation between two nonempty subsets of a poset and quasiexact posets. We prove some connections among quasiexact posets, quasicontinuous domains and weak domains. Furthermore, we introduce the weak way-below finitely determined topology and study its links to Scott topology and the weak way-below topology first considered by Mushburn. It is also proved that a dcpo is a domain if it is quasiexact and moderately meet continuous with the weak way-below relation weakly increasing.
keywords:
Quasiexact dcpo, Quasicontinuous domain, Weak domain, wf topology, Moderate meet-continuity1 Introduction
Scott [11] proposed a model for information systems using the Scott topology and a binary relation in connection with the information models. For continuous lattices, the relation coincides with the way-below relation. The class of continuous complete lattices was introduced by Scott [12]. However, for general complete lattices, the aforementioned two relations may be distinct.
One of the notable features of continuous lattices is that they admit a unique compact Hausdorff topology for which the meet operation is continuous. This topology, referred to as the CL-topology [4], turns out to be ‘order intrinsic’ - it can be defined merely using the lattice structure. Gierz and Lawson [4] characterized those complete lattices for which the CL-topology is Hausdorff and called them generalized continuous lattices. Gierz et al. [5] introduced the quasicontinuous posets and showed that a complete lattice is generalized continuous if and only if it is quasicontinuous. The key result for establishing the major properties of quasicontinuous dcpos is the Rudin’s Lemma [10].
Coecke and Martin [2] introduced two orders: the Bayesian order on classical states and the spectral order on quantum states. They revealed that the corresponding sets are dcpos with an intrinsic notion of approximation. The operational significance of the orders involved conclusively establishes that physical information has a natural domain-like theoretic structure. Mushburn [14] called the approximation in [2] the weak way-below relation, and defined two topologies on posets: the way-below topology and the weak way-below topology. These topologies coincide with the Scott topology for continuous posets, but are very different for non-continuous posets. Mushburn also showed that while domain representable spaces must be Baire, this is not the case with respect to the new topologies. Thus, Mushburn defined the weak domains and weak domain representable spaces and constructed an example to show that weak domain representable spaces need not be Baire [15].
The class of meet continuous lattices was first introduced by Birkhoff [1]. Later, much investigations on meet continuity for lattices and semilattices sprang up. One can refer to Isbell [8], Hofmann and Stralka [7] and [3]. Kou et al. [9] extended the notion of meet continuity to general dcpos and proved that a dcpo is continuous iff it is meet continuous and quasicontinuous. See [17] and [18] for the investigation of the more general meet-continuous posets and quasicontinuous posets.
As a generalization of the way-below relation between two subsets of posets and the weak way-below relation between elements, we define the weak way-below relation between two subsets of a poset and use this relation to define the quasiexact posets. We show some connections among quasiexact posets, quasicontinuous domains and weak domains. Furthermore, we introduce the weak way-below finitely determined topology (briefly, wf topology) and study its properties as well as its links to Scott topology and weak way-below topology in some special posets. In addition, we prove that a poset is a weak domain if it is moderately meet continuous and quasiexact dcpo with the relation weakly increasing, a result similar to the characterization of domains in terms of meet continuity and quasicontinuity. Finally, employing a result by Shen et al. [16], it is deduced that a dcpo is a domain if and only if it is quasiexact and moderately meet continuous with the weak way-below relation weakly increasing.
2 Preliminaries
In this section we recall some notations, definitions and results to be used later.
For any subset of a poset , we write . A subset is called an upper set if .
A nonempty subset of a poset is directed if every two elements in have an upper bound in . A poset is called a directed complete poset (dcpo, for short) if every directed subset of has a supremum in , denoted by .
For any poset , the way-below relation on is defined as follows: for every directed subset with existing, implies for some . A poset is continuous if for every , the set is directed and . For any , one writs .
A subset of a poset is Scott open if is an upper set and for any directed subset of for which exists, implies . All Scott open subsets of form a topology, called the Scott topology on and denoted by . The space is called the Scott space of , and is denoted by .
A poset is said to be meet continuous111In general, the meet continuity means for dcpos. In the current paper, we slightly misuse this notion. if for any and any directed subset , implies .
For any topological space and a subset , the closure and the interior of are denoted by and , respectively.
Let be a topological space. A nonempty subset of is called irreducible if for any closed sets and , implies or . The space is sober if for every irreducible closed set , there exists a unique such that .
The weak way-below relation on a poset is defined as follows [14]: for any , is called weakly way below , denoted by if for any directed subset of , implies .
Note that for continuous posets, the relations and are the same. For any , we write . Mushburn [14] pointed out the following properties.
Lemma 1.
[14, Theorem 3.1] For any elements in a poset ,
-
(1)
If , then ;
-
(2)
If , then ;
-
(3)
If , then ;
-
(4)
If has the bottom element , then .
It is well-known that the way-below relation is transitive: implies . Whereas, this property may not be true for . In fact, Coecke and Martin [2] showed that the transitivity is true for if and only if .
A poset is called exact if for any , the set is directed and [14]. The relation on a poset is said to be weakly increasing if for any , implies . A poset is called a weak domain if it is an exact dcpo with the relation weakly increasing.
Shen et al. [16] proved the following characterization of exact dcpos.
Proposition 2.
[16] A dcpo is exact if and only if for any , there exists a directed subset such that .
For a poset , the collection of all nonempty subsets of is denoted by . A preorder on is defined by if . This preorder is sometimes called the Smyth order, see [13].
A nonempty family of subsets of a poset is said to be directed if given , , there exists such that , that is , or equivalently, . For any , is way below , written as , if for every directed subset , implies for some . Sometimes, one writes instead of and instead of . For more details one can refer to [3].
Recall that a dcpo is called a quasicontinuous domain if for each the family
is directed and whenever , then there exists with This statement is equivalent to for each the family
is directed and
3 Quasiexact dcpos
We first introduce the following definition, as the generalization of both the way-below relation between two nonempty subsets and the weak way-below relation between two points.
Definition 3
For any poset and , we say that is weakly way below and write , if for every directed subset , implies for some .
The following properties can be verified straightforwardly.
Lemma 4.
For any poset , let and . Then
-
(1)
if and only if for all ;
-
(2)
if and only if ;
-
(3)
and imply ;
-
(4)
and imply .
Thereafter, we write instead of and instead of . By Lemma 4, is unambiguously defined and this fact is similar with the one for the way-below relation.
For any poset and , write
Definition 5
A poset is said to be quasiexact if for each , the family is directed and .
Remark 6.
For any poset , it is easy to verify that implies for any and . Thus, holds for all and . In particular, for any .
Sometimes it is difficult to characterize the weak way-below relation on a poset. To show a poset is quasiexact, it is sufficient to know for any , there are ‘enough’ elements that are weakly way below . In order to elaborate this fact, we first show the following lemmas.
Lemma 7.
For any poset and ,
Lemma 8.
For any poset , let and . If is directed, then is directed provided that each is nonempty.
The following lemma given by Rudin [10] is crucial in proving a number of major properties of quasicontinuous domains, one can also refer to Lemma III-3.3 in [3].
Lemma 9.
(Rudin’s Lemma) For any poset , let be a directed family of nonempty finite subsets of . There exists a directed set such that for every .
Lemma 10.
For any dcpo , let and with . If is a directed family of nonempty finite subsets with , then there exists such that .
Proof 3.1.
Assume, on the contrary that for all . For any , choose such that . Then . It is easy to verify that and . Hence . Thus, is a directed family of nonempty finite subsets. By Rudin’s Lemma, there exists a directed set such that for any . For every , choose such that . Then . Thus, . Note that , so . It follows that . By , there exists such that , which contradicts .
Similar to Proposition 2 for exact posets, we have the following result.
Proposition 11.
A dcpo is quasiexact if and only if for any , there exists a directed subset such that .
Proof 3.2.
It is enough to prove the sufficiency. Let and be a directed family with . Since , it follows that . It remains to show that is directed. Let . By Lemma 7, we have and . By Lemma 8, is a directed collection of nonempty finite subsets of . Furthermore, . By Lemma 10, there exists such that and . Choose such that . Note that . It follows that . Applying Lemma 7 again, we can conclude , whence is directed. So is quasiexact.
We write . For any , we have by Lemma 7. It follows that . Note that for any , so . Therefore, .
Now, we give another characterization of quasiexact dcpos.
Proposition 12.
A dcpo is quasiexact if and only if for any , the collection is directed and .
Proof 3.3.
Theorem 13.
For any dcpo , the following statements are equivalent:
-
()
is quasiexact;
-
()
for any , the collection is directed and ;
-
()
for any , there exists a directed subset such that ;
-
()
for any , there exists a directed subset such that .
Proposition 14.
The cartesian product of a family of quasiexact dcpos is a quasiexact dcpo, provided that at most finitely many do not have a bottom element .
Proof 3.4.
Obviously, is a dcpo. Let be a finite subset of such that has for any and . Consider each . Take for any and . Then .
- Claim 1.
-
.
If , then there exists such that . By the quasiexactness of , there exists such that . Let . Let . Then , but . It follows that . Therefore, . It follows that , whence .
- Claim 2.
-
is a directed subset of .
Let . Suppose that and , where are finite and , moreover, , for any , . For any , . Note that is directed. Choose such that . For any and , obviously, and . Put and
Then , is finite and . Obviously, .
By Proposition 11, is quasiexact.
Some relationships among quasiexact dcpos, weak domains and quasicontinuous domains are shown in the following result.
Proposition 15.
-
(1)
Every exact dcpo is quasiexact. Hence, every weak domain is a quasiexact dcpo.
-
(2)
Every quasicontinuous domain is a quasiexact dcpo.
Proof 3.5.
(i) Let be an exact poset. For any , let . Note that is directed with . Then is directed and
By Proposition 11, is quasiexact.
Quasiexact posets have some weak and quasicontinuous domain-like features, so this terminology seems appropriate.
Shen et al. [16] used two examples to show that quasicontinuous domains need not be weak domains, and that weak domains need not be quasicontinuous domains. Precisely, Example 3.11 in [16] shows that quasicontinuous domains are not necessarily exact, and Example 3.12 in [16] shows that weak domains are not necessarily quasicontinuous.
Here, we shall elaborate some more detailed relationships than those in [16].
The following example shows that quasicontinuous domains are not necessarily weakly increasing. Since every quasicontinuous domain is quasiexact, this example also shows that quasiexact posets need not to be exact or weakly increasing.
Example 3.6.
Let with the order
-
(i)
;
-
(ii)
whenever and ;
-
(iii)
for any ,
where , see Figure 1.

In this example, we can trivially check the following facts.
-
(iv)
If , then if and only if
-
(v)
If , then if and only if
It is also trivial to check that is directed with for every , whence is a quasicontinuous domain. However, the relation is not weakly increasing. Note that . Consider the directed set . Obviously, , but for any . Hence, does not hold. For the point , it is trivial to verify that , whence . Hence, is exact.
The following example shows that quasicontinuous domains need not be exact, even when the relation is weakly increasing.
Example 16
Let and define an order by the following rules:
-
(i)
if for all and ;
-
(ii)
for all and (see Figure 2).

In this example, for any finite set , if and only if and ; if and only if and ; if and only if and . It is easy to verify that is a quasicontinuous domain. Thus, is quasiexact. Note also that for any finite set , if and only if , where ; if and only if and . It is trivial to verify that the relation is weakly increasing. However, is not exact. Consider the top element . For any and , consider the directed set . Then , but for any and . Thus, . Similarly, we can verify that and for any . It follows that . Hence, is not exact.
Examples 3.6 and 16 in the current paper also shows that quasiexacnesst does not imply stronger properties of .
We take Johnstone’s dcpo to illustrate that weak domains are not necessarily quasicontinuous domain, hence quasiexact dcpos with the relation weakly increasing are not necessarily quasicontinuous.
Example 17
(Johnstone space) Let with ordering defined by
-
(i)
if for all ;
-
(ii)
if for all .
In this example, one can easily check the following fact: For any , and , whence, and . Thus, is exact. It is trivial to show that is weakly increasing. However, is not quasicontinuous. By the result in [6, Exercise 8.2.14], is a dcpo with the Scott space non-sober. It follows that is not quasicontinuous.
4 The wf topology and moderate meet continuity
In this section, we investigate the links between the quasiexactness and some topologies on posets.
In [14], when the family generates a topology on a poset , then this topology is called the weak way-below topology (wwb topology, for short), denoted by . The topological space is simply written as .
For the following result, we refer the reader to the Theorems 3.8 and 3.10 in [14].
Lemma 18.
[14] Let be an exact poset. Then generates the wwb topology, which is finer than the Scott topology.
For any subset , we write . Whenever for some , we replace with .
Lemma 19.
If is a quasiexact poset, then generates a topology on .
Proof 4.1.
For any , is directed with . Thus, . Choose arbitrarily , then .
Let be finite sets in with , i.e., and . Note that is directed. There exists such that . For any , if , then , so .
Whenever the family generates a topology on , we call it the weak way-below finitely determined topology (briefly, wf topology) on , denoted by . The topological space will be simply written as .
Remark 20.
-
(1)
For any quasiexact poset , we have for every .
-
(2)
If a poset admits both the wwb topology and the wf topology, then .
Lemma 21.
If is an exact poset, then .
Note that every quasicontinuous dcpo admits the wf topology. However, the following example shows that quasicontinuous dcpos do not necessarily admit the wwb topology.
Example 22
Consider the set with the order defined in Example 16, which shows that is quasicontinuous dcpo. It is trivial to check the following facts:
-
(i)
for any and ;
-
(ii)
.
Note that the family can not cover . Thus, can not generate the wwb topology.
Mushburn [14] constructed an example to show the wwb topology can be strictly finer than the Scott topology.
Proposition 23.
A poset is quasiexact if for any nonempty and any , implies there exists a finite such that .
Proof 4.2.
It is trivial to verify that is directed with whenever the bottom element exists. Without loss of generality, assume that . Note that . For any , we show . Otherwise, there exists a directed set with , but since is an upper set. Thus, . It follows that , a contradiction. By the hypothesis, there exists a finite set such that . This implies that . Furthermore, note that . Then . It follows that . Hence, . It remains to show that is directed. For this, let and . We show that . For any directed set , if , then , i.e, there exists and such that for . Choose such that for . Then for . It follows that . Note that is an upper set. By the hypothesis, there exists a finite set such that . Therefore, is directed.
Proposition 24.
Any poset that has no infinite antichain is quasiexact.
Proof 4.3.
Assume that is a poset with no infinite antichain. For any nonempty and any , if , then by Zorn’s lemma we can pick a maximal antichain in . Note that is finite, contained in . We show . For this, let be a directed set with . Since , eventually, is in . If for some , then . Otherwise, for any . If there exists such that , then is incomparable with each . Note that and that is an antichain in . It follows that is also an antichain in , contradicting the maximality of . So . It cannot be the case since . Note that every large enough in is in , hence in , but not all of them in , and those that are not must be in . Thus, . Applying Proposition 23, we conclude that is quasiexact.
Following the characterization of meet continuous posets by means of Scott topology, we define the following meet continuity.
Definition 25
A poset admitting the wf topology is said to be moderately meet continuous if for any and directed subset , implies that .
Lemma 26.
Let be a moderately meet continuous poset. Then for any .
Proof 4.4.
For convenience, we write and let . Assume , but , that is, does not hold for any . Thus, there exists a directed subset such that , but . By the moderately meet continuity, . Since and , then . Pick . Note that . By the moderately meet continuity again, we have , whence . Pick . The rest can be done in the same manner. In other words, we can pick for any (). Note that and for all . It follows that for all . Thus, . Also note that . Hence, there exists () such that , showing that , a contradiction. Therefore, .
Corollary 27.
Let be a moderately meet continuous quasiexact poset. Then
for any .
By Remark 20 (2) and Corollary 27, we deduce the following result strengthening Mushburn’s result in [14, Theorem 10].
Theorem 28.
If is a moderately meet continuous quasiexact poset, then .
Theorem 29.
Every moderately meet continuous quasiexact poset is exact and meet continuous.
Proof 4.5.
Let be a moderately meet continuous quasiexact. To show that is exact, we consider any .
- Claim 1.
-
is directed.
Let . Then . By the hypothesis, there exists such that . By Corollary 27, we have . So there exists such that . Note that , then and .
- Claim 2.
-
.
Obviously, . For any , by Corollary 27, we can pick such that . Then . It follows that . Hence, . Note that . So .
By Proposition 2, we conclude that is exact.
For any and directed set , if , then by Lemma 21 and the definition of closure, we have . Therefore, is meet continuous.
Shen et al. [16] showed that every meet continuous weak domain is a domain. By Proposition 29, we conclude the following result.
Corollary 30.
A poset is a domain if is a moderately meet continuous quasiexact dcpo with the relation weakly increasing.
In this paper, we explored the quasiexact posets, parallel to the quasicontinuous posets. A new topology, the wf topology on posets is introduced and used to define the moderately meet continuous posets. Although several results on such structures have been obtained, we still have basic problems to solve as illustrated below.
Problem 1. What is the property such that a poset is exact if and only if it is quasiexact and has property ?
It is known that a poset is continuous if and only if it is quasicontinuous and meet continuous [17]. However, we still do not have a similar result for exact posets. It is only proved that every exact poset is quasiexact.
Problem 2. Under what conditions, a quasiexact dcpo is quasicontinuous?
At the moment we just know that every quasicontinuous dcpo is quasiexact. It would be ideal if we could find a property such that a dcpo is quasicontinuous if and only if it is quasiexact and has property .
Acknowledgements
We thank Professor Guohua Wu in Nanyang Technological University for his valuable suggestions.
References
- [1] G. Birkhoff, “Lattice Theory,” Vol. 25. American Mathematical Society Colloquium Publications, 1967. ISBN: 9780821810255
-
[2]
B. Coecke and K. Martin, A partial order on classical and quantum states, in: New Structures in Physics, Lecture Notes in Physics 813, Springer Verlag (2010), pp. 593-683.
https://doi.org/10.1007/978-3-642-12821-9_10 Available online at
https://www.cs.ox.ac.uk/techreports/oucl/rr-02-07.html - [3] G. Gierz, K. Hofmann, K. Keimel, J. Lawson, M. Mislove and D. Scott, Continuous Lattices and Domains, Encyclopedia of Mathematics and its Applications, vol. 93, Cambridge University Press, 2003. ISBN: 9780521803380
-
[4]
G. Gierz and J. Lawson, Generalized continuous and hypercontinuous lattices, The Rocky Mountain Journal of Mathematics, 11 (1981), 271-296.
https://www.jstor.org/stable/44236598 -
[5]
G. Gierz, J. D. Lawson, and A. R. Stralka, Quasicontinuous posets, Houston Journal of Mathematics, 9 (2) (1983), 191-208.
https://www.math.uh.edu/~hjm/vol09-2.html - [6] J. Goubault-Larrecq, Non-Hausdorff Topology and Domain Theory, Selected Topics in Point-set Topology, Vol. 22, Cambridge University Press, 2013. ISBN: 9781107034136
-
[7]
K. H. Hofmann and A. R. Stralka, The algebraic theory of compact Lawson semilattices: applications of Galois connections to compact semilattices, Dissertationes Mathematicae, 137 (1976), 1-54. Avcailable online at:
http://eudml.org/doc/268477 - [8] J. R. Isbell, Meet-continuous lattices, Symposia Mathematica, Vol. XVI (Convegno sui Gruppi Topologici e Gruppi di Lie, INDAM, Rome, 1974), pp. 41–54. Academic Press, London, 1975.
-
[9]
H. Kou, Y. Liu and M. Luo, On meet continuous dcpo, Domain and Process \@slowromancapii@, Semantic Structures in Computation. Kluwer, 2001. DOI:
https://doi.org/10.1007/978-94-017-1291-0_5 - [10] M. E. Rudin, Directed sets which converge, In L.F. McAuley and M.M. Rao, editors, General Topology and Modern Analysis, University of California, Riverside, 1980, pages 305–307. Academic Press, 1981. ISBN: 012481820X
-
[11]
D. S. Scott, Outline of a mathematical of theory of computation, Proceedings of the Fourth Annual Princeton Conference on Information Sciences and System, Princeton University Press, 1970, 169-176. Available online at:
https://www.cs.ox.ac.uk/publications/publication3720-abstract.html -
[12]
D. S. Scott, Continuous lattices, in: Toposes, algebraic geometry and logic, Springer Lecture Notes in Mathematics 274, Springer-Verlag, 1974, pp. 97-136.
https://doi.org/10.1007/BFb0073967 Available online at:
https://www.cs.ox.ac.uk/files/3229/PRG07.pdf -
[13]
M. B. Smyth, Powerdomains, Coventry, UK: Department of Computer Science. (Theory of Computation Report). CS-RR-012, 1976. Available online at:
http://wrap.warwick.ac.uk/46313/1/WRAP_Smyth_cs-rr-012.pdf -
[14]
J. Mashburn, A comparison of three topologies on ordered sets, Topology Proceedings, 31 (1) (2007), 197-217. Available online at:
https://ecommons.udayton.edu/mth_fac_pub/18 -
[15]
J. Mashburn, Linearly ordered topological spaces and weak domain representability, Topology Proceedings, 35 (2010), 149-164. Available online at:
https://ecommons.udayton.edu/mth_fac_pub/20 -
[16]
C. Shen, G. Wu and D. Zhao, Weak domain models of spaces, Electronic Notes in Theoretical Computer Science, 345 (2019), 219-232.
https://doi.org/10.1016/j.entcs.2019.07.025 -
[17]
X. Mao and L. Xu, Quasicontinuity of posets via Scott topology and sobrification. Order, 23 (2006), 359-369.
https://doi.org/10.1007/s11083-007-9054-4 -
[18]
X. Mao and L. Xu, Meet continuity properties of posets. Theoretical Computer Science, 410 (2009), 4234-4240.
https://doi.org/10.1016/j.tcs.2009.06.017