Weakly Meet -continuity and -continuity
Abstract
Based on the concept of weakly meet -continuity put forward by Xu and Luo in [13], we further prove that if the subset system satisfies certain conditions, a poset is -continuous if and only if it is weakly meet -continuous and -quasicontinuous, which improves a related result given by Ruan and Xu in [10]. Meanwhile, we provide a characterization for the poset to be weakly meet -continuous, that is, a poset with a lower hereditary -Scott topology is weakly meet -continuous if and only if it is locally weakly meet -continuous. In addition, we introduce a monad on the new category and characterize its - algebras concretely.
keywords:
Weakly meet -continuous poset \sep-continuous poset \sepMonad\sep- algebras1 Introduction
Recall that the concept of subset system on the category of posets was proposed by Wright et al. in [12]. It originally aimed at applying posets with -set structures to problems in computer science, particularly, to fixed point semantics for programming language. In addition, the set system includes many systems of sets which we are familiar with, such as directed sets, finite sets, connected sets and so on. Later, based on the suggestion given by Wright to study the generalized counterpart of continuous poset by replacing directed sets with -sets, in [2], Baranga defined a kind of generalized way-below relation based on the -sets whose supremum exists. Furthermore, the author gave some characterizations for the -algebraic posets. Besides, Ern introduced the concept of -continuous posets by lending support to the cut operator of directed subsets instead of the existing sups, which is a pure order concept on posets, no longer depending on the dcpo. Recently, Zhang and Xu made use of the cut operator of directed sets again to define a new way-below relation between subsets, and then introduced -quasicontinuous posets (see [14]). Combining with the notion of subset system, Xu and Luo in [13] gave the definition of -quasicontinuous posets, and then, Ruan and Xu investigated its properties in [10] concretely and mainly made the conclusion: when the subset system satisfies some conditions, a poset is -continuous if and only if it is -quasicontinuous and meet -continuous.
In this paper, we will first see that there is another characterization of -continuous posets. More precisely, in the case where the subset system satisfies certain conditions, a poset is -continuous if and only if it is -quasicontinuous and weakly meet -continuous, which is a result stronger than that given by Xu in [10], meanwhile, it reveals that the requirement of ‘’ is unnecessary. Then we focus on the weakly meet -continuity of a poset, and show that a poset with a lower hereditary -Scott topology is weakly meet -continuous if and only if it is locally weakly meet -continuous. In order to investigate the -faithful property, Ho and Zhao in [8] introduced a new beneath relation by the Scott closed subsets whose sups exist. Based on their work, we find there exists a monad on . Associating with the subset system, we will introduce a generalized beneath relation using the cuts of -Scott closed subsets, which is not necessary to consider whether the supremum exists. On this basis, we find a monad on the category and characterize its Eilenberg-Moore algebras concretely.
2 Preliminaries
Let be a poset. For any , we write a for some , = for some . In particular, = and = . A subset is an upper set (resp., a lower set) if = (resp., = ). Let and denote the sets of all upper and lower bounds of , respectively. The cut operator is defined by for all . Obviously, if the supremum of exists, then iff . If for some subset of , let . In particular, we write as . We denote by if is a finite subset of poset , and let . A mapping is defined by .
For any space , the partial order defined by iff is contained in the closure of is called the specialization order. The topology on the poset generated by all principal filters as a subbasis for the closed sets is called the lower topology and denoted by .
Let denote the category of posets and monotone mappings. By [12], a subset system on is a function which assigns to each poset, a set of subsets of such that
-
•
for any , and
-
•
if in and , then .
is called a Z-complete poset (, for short), if exists for each . A closure system on the set is a non-empty family of subsets of which satisfies:
-
•
for every nonempty family , and
-
•
.
Definition 2.1.
Let be a poset and let . The topology generated by the subbasic open subsets is called -Scott topology on and denoted by .
Let , obviously, is a subbasis for the closed subsets with respect to -Scott topology. We use to denote the set composed of all closed subsets regarding -Scott topology. Note that for any , so the definition above is the same as that given in [10]. Besides, the family and are closure systems on , and the closure operators can be defined as follows: For any , , .
Definition 2.2.
([10]) Let be a poset and .
-
\normalshape(1)
is called -way below , denoted by , if for any implies . is shortly written as . Let . Specifically, we write .
-
\normalshape(2)
is called a weak -continuous poset, if for all . In addition, if , then is called -continuous.
-
\normalshape(3)
is called an -quasicontinuous poset, if for all , and .
Definition 2.3.
([15]) A subset system is hereditary if for any order embedding (that is, for any ), , if and only if .
Definition 2.4.
([10]) Let be a subset system.
-
\normalshape(1)
is called , if for any poset , , we have .
-
\normalshape(2)
is said to have the , if for any poset , , we have .
-
\normalshape(3)
ia said to have the property , if for any poset , , we have .
Definition 2.5.
([10]) A subset system is said to have the , if for any poset , , , , and . Then there exists such that
-
(i)
for any , ,
-
(ii)
,
-
(iii)
, and
-
(iv)
for any , implies .
is called a , if is union-complete and possesses the Rudin property.
3 Weakly meet -continuous posets
Definition 3.1.
([10]) is called weakly meet -continuous if for all and all with , we have ; is called meet -continuous if for all and all with , we have .
Lemma 3.2.
Let be a poset. The following conditions are equivalent:
-
is weakly meet -continuous.
-
For any and any , .
Proof 3.3.
Assume that , and . Then there exists an with and . Since is weakly meet -continuous, we have , which implies that . Thus by . So and holds.
For any , , if and there is a such that , then by (2), . Since , we have , this means . So .
Lemma 3.4.
Let be a -complete semilattice. The following conditions are equivalent:
-
is weakly meet -continuous;
-
For any , , .
Proof 3.5.
We first claim that if . It is obvious that is an upper bound of . Suppose is also an upper bound of and , that is, . Since by (1) and , we have . But this contracts the fact that . Thus . Now let , then , which implies . Since , we have , that is, .
For any , , we need to prove . Assume with . Then there exists an , and . Thus and by (2). Now for , we define a monotone mapping by . Then . Hence, for some as , which implies that , that is, . So is weakly meet -continuous by Lemma 3.2.
Proposition 3.6.
Let be a poset. The following conditions are equivalent:
-
is weakly meet -continuous;
-
is weakly meet -continuous.
Proof 3.7.
By Lemma 3.4, we only need to prove that for any , , that is, . Assume and with . Then we have by Lemma 3.2. As , for some , this means since and is a lower set. Moreover, . So , and holds. Obviously, the conversely inclusion holds.
It is sufficient to prove that for any , . Let with . Then there exists an such that , which implies . In addition, we know since the mapping defined by is monotone. As is weakly meet -continuous, we have . It is easy to verify that and . So , that is, belongs to this intersection. Moreover, there exists an element satisfying and for some , this means . Hence, , and is weakly meet -continuous.
Lemma 3.8.
Let be a weakly meet -continuous poset. If is a finite subset of , then .
Proof 3.9.
Suppose and there exists an element , but . Then for any , that is, there exists such that , but , for . For with , by weakly meet -continuity. Then , which implies that there is a . By and , we have . Similarly, we get that and . So there is a . By induction, we find , where , clearly, . Since , for some , this implies , which contradicts that . Hence, .
Lemma 3.10.
([10]) Let be a Rudin subset system which has the finite family union property and an -quasicontinuous poset. Then the following statements hold.
-
For any finite set in , .
-
If , then if and only if for any , there exists such that .
Lemma 3.11.
Let be a Rudin subset system which has the finite family union property. If is weakly meet -continuous and -quasicontinuous, then for any finite subset of , we have
.
Proof 3.12.
Proposition 3.13.
([13]) Let be a Rudin subset system which possesses property. If is an -continuous poset, then is -quasicontinuous, and for any , .
Proposition 3.14.
([10]) Let be an -continuous poset. Then is weakly meet -continuous.
Proposition 3.15.
Let be a weakly meet -continuous poset. If for any , , there are , such that , and , then is weak -continuous.
Proof 3.16.
It suffices to prove that for any . Suppose that there is a but . Then there are , such that , and , so . Since by Lemma 3.2 and , we have . Thus there is an such that . It follows that , then . But this contradicts that .
Theorem 3.17.
Let P be a poset and a Rudin subset system which possesses the finite family union property and property. If for each , then the following conditions are equivalent:
-
is -continuous;
-
is weakly meet -continuous and -quasicontinuous;
-
is weakly meet -continuous, and for any in , there are , such that , and .
4 Posets with lower hereditary Z-Scott topology
Definition 4.1.
Let be a poset. The -Scott topology on is called if for each closed subbasis of , the -Scott topology of poset is precisely generated by the subbasic closed subsets of the form , where , that is, .
Definition 4.2.
Let , be two posets. A mapping is called -continuous if for any , .
It is obvious that is monotone if is -continuous.
Lemma 4.3.
Let and be two posets and . Consider the following three conditions:
-
is -continuous.
-
For any , .
-
for each .
Then .
Proof 4.4.
Straightforward.
Lemma 4.5.
Let be a poset and a subset hereditary subset system. Consider the following conditions:
-
The -Scott topology on is lower hereditary.
-
The inclusion map is -continuous for any .
-
For any and , .
-
For any and , .
-
For any , is filtered.
Then .
Proof 4.6.
It is easy to verify that .
It is clear that . Assume . Then and . Since is subset hereditary, . Thus we have by . Now we only need to prove that . Assume , . Then and as , which implies that , so . Hence, .
We want to prove that for any . For each , let and . Then because is subset hereditary. It follows that , which means since . Thus and . Conversely, for any , let with . Then and since . This implies that . So , and hence, holds.
Clearly, . Conversely, assume , . Then . Since is filtered, there is a such that . This implies , so . It follows that by . Thus .
Example 4.7.
The condition (5) in the above lemma is not equivalent to others. Let be the set of natural numbers and with the partial order defined by iff in or in or and (see Fig. 1 for a better understanding). One can easily sees that for any and , , but is not filtered.
Corollary 4.8.
Every zcpo has a lower hereditary -Scott topology.
Proof 4.9.
Since exists for any , is filtered.
Definition 4.10.
A poset is called locally weakly meet -continuous if as a subposet of is weakly meet -continuous for each .
Lemma 4.11.
Let be a poset with a lower hereditary -Scott topology and . Then for any , we have .
Proof 4.12.
Straightforward.
Theorem 4.13.
Let be a poset with a lower hereditary -Scott topology and be subset hereditary. Then is weakly meet -continuous if and only if is locally weakly meet -continuous.
Proof 4.14.
: For any , let , . Then . Since the -Scott topology of is lower hereditary, by Lemma 4.5, we have . Thus . It follows that by the weakly meet -continuity of . Therefore, by Lemma 4.11.
: Suppose , . For any , we have and as is subset hereditary. Since , we have , which implies that . So by Lemma 4.11 again.
Proposition 4.15.
Let be a poset with a lower hereditary -Scott topology. If is weak -continuous and for any , , , then is -continuous.
Proof 4.16.
We need to prove that . Since is weak -continuous, . Assume , with . Then since the -Scott topology on is lower hereditary. So by , which implies that in . Therefore, . Hence, , where the last equality holds as . Moreover, implies , so is -continuous.
Proposition 4.17.
Let be a poset with a lower hereditary -Scott topology and be subset hereditary. If for any , is -continuous and , then is -continuous.
Proof 4.18.
We only need to prove that . By assumption, is -continuous, we have . Now we show that . Let in and with . We can find that and for each . Claim that . Assume . Since is -continuous and , we have and . It follows that as . Moreover, as and is subset hereditary. This implies that . So holds. Thus in . As implies that , we have . Hence, . Then . It is self-evident that , where the last equality holds as . So is -continuous.
Theorem 4.19.
Let be a poset with a lower hereditary -Scott topology and be subset hereditary. Then the following conditions are equivalent:
-
is -continuous and for any and ;
-
is -continuous and for any .
5 A monad on POSETδ
In this part, denotes the category whose objects are all posets and morphisms are -continuous mappings. We will give a monad on and characterize its Eilenberg-Moore algebras.
Definition 5.1.
Let be a poset and .
-
is called - , denoted by , if for any with , .
-
is said to be - if for all , .
Notice that the set automatically. There are some common properties about the relation being similar to the .
Proposition 5.2.
Let be a poset and .
-
implies ;
-
implies ;
-
if has a bottom , then always holds.
Proposition 5.3.
Let be a poset and . Then the supremum of in exists and is exactly .
Proof 5.4.
Clearly, it is enough to show that . For any with , there is for each such that . Then we have and as is a lower set. Since the monotonicity of the mapping defined by implies that , . Now consider each , we have , which means . Thus , and holds.
Definition 5.5.
Let be a poset.
-
An element of is called - if . We use to denote the set of all -compact elements of .
-
is called - if for each , .
Notably, we call a - complete lattice a - lattice for short. Obviously, is a - lattice for any poset .
Lemma 5.6.
Let be a Galois connection between two posets and , where , . Then preserves cuts of any subset of , that is, for any .
Proof 5.7.
It suffices to show that for any . Let be an upper bound of . Then for each , we have , and so . It follows that . Thus , which implies , so . Hence, .
Lemma 5.8.
Let be a Galois connection between two posets and , where , . Then for any , .
Proof 5.9.
Let be a -set of with . Then for any , there is a such that , this means . Thus and since . The conclusion of Lemma 5.6 indicates that . Therefore, .
Lemma 5.10.
Let be a Galois connection between two posets and , where , . Consider the following two conditions:
-
For any , .
-
preserves the relation .
Then ; if is -continuous, then .
Proof 5.11.
: We need to show that for any in . Let with . Then for some . By the condition (1), we have and hence, . Lemma 5.8 indicates that , then as . Thus there is an such that , which implies . It follows that . Therefore, preserves the relation .
: By the -continuity of , we know for each . Thus in order to show for any , it suffices to prove that for each , . For each , since , we have . Then because and , which implies . Thus .
Lemma 5.12.
If is a , then is also a .
Proof 5.13.
We just need to prove that for any . Let with . Then , and so by . Thus , this means . Hence, and . It follows that is a .
The above lemma ensures that hold. There is an example illustrating that doesn’t hold if is not a .
Example 5.14.
Let be the poset consist of all natural numbers and . is the greatest element of and , . Now consider , where is the family of all directed subsets. It is easy to verify that . For , , however, since .
We denote by the category which has all -prealgebraic lattices as objects and maps that have an upper adjoint and preserve the relation as morphisms. Next, we will investigate the relation between the categories and .
Theorem 5.15.
Let and be two functors between and . Here is defined by associating a -prealgebraic lattice with the poset and a morphism in with the map defined by
, ;
is defined by assigning a poset to the -prealgebraic lattice and the -continuous mapping to defined as follows:
, .
Then is left adjoint to with unit and counit given by
, , and
, ,
respectively.
Proof 5.16.
Step 1: Verify that functors and are well-defined by showing that and are morphisms in , , respectively. We claim that is -continuous, that is, for any . Since is a complete lattice, by Lemma 5.12, is a . Thus we only need to prove that . More precisely, to show . From the fact that has an upper adjoint, we know holds. So it is easy to see that
Hence, is -continuous.
We proceed to show has an upper adjoint and preserves the relation . It is obvious that preserves arbitrary sups in , by Corollary -3.5 in [6], has an upper adjoint. Moreover, the upper adjoint is given by
.
By Proposition 5.3, we know for any . It follows that
.
Therefore, from the conclusion of Lemma 5.10, we get that preserves . So is a morphism in .
Step 2: To show is left adjoint to in detail. Obviously, is -continuous, that is, a morphism in . Now let be a -prealgebraic lattice and -continuous. We define
.
It is easy to find that . Thus for the remainder, we need to prove that is a unique morphism in such that . Note that preserves arbitrary sups in and is a complete lattice, so has an upper adjoint, denoted by . More specifically, for any ,
Then again by Lemma 5.10, we check that for any to affirm preserves . Since and are complete lattices, we only need to prove . To this end, consider each which satisfies , that is, . Then as . It follows that , in addition, . Thus holds, hence, . Besides, clearly, is unique. Therefore, we can conclude that is left adjoint to .
Next, we will give a monad on . Before this, let us recall the following conclusion:
Proposition 5.17.
[3] Let and be functors such that is left adjoint to with and the unit and counit, respectively. Then is a monad on .
Now, by combining the above two conclusions, and is written as , we obtain the following.
Theorem 5.18.
The endofunctor together with two natural transformation and is a monad on the category . More precisely, for each , and are defined as:
,
,
respectively.
Recall that an - algebra for a monad on a category is a pair , where is a morphism in called a structure map which satisfies and . In addition, we call a poset if for any exists.
Theorem 5.19.
There exists a structure map in such that is an - algebra of the monad if and only if is a .
Proof 5.20.
: We claim that exists for any . Consider each , from the facts that and is order-preserving, we have . This implies since . Thus is an upper bound of . Assume that is another upper bound of , which means . So by the monotonicity of again. It follows that , and hence .
: Since is a , we can define by . One can easily verify that and . For the remaining part, what we need to prove is that is a morphism in , that is, is -continuous. To this end, let be a -set of . Since for every upper bound of , we have for each , which implies and so is an upper bound of . Thus for every , , which means . It follows that . Hence, is -continuous.
Refer to [11], if is a monad on the category , the category - consists of all -algebras as objects and morphisms of -algebras as morphisms. Here a morphism of -algebras between and in - is a morphism in which satisfies .
Combining with the characterization of -algebras, we can deduce that is a -algebra morphism if and only if for every .
References
-
[1]
Bandelt, H.J., M. Ern, The category of Z-continuous posets,
Journal of Pure and Applied Algebra, 30 (1983): 219-226.
https://doi.org/10.1016/0022-4049(83)90057-9 -
[2]
Baranga, A., -continuous posets,
Discrete Mathematics, 152 (1996): 33-45.
https://doi.org/10.1016/0012-365X(94)00307-5 -
[3]
Barr, M. and C. Wells, “Category Theory Lecture Notes for ESSLLI”, Lecture Notes for ESSLLI, 1999. Available online at:
https://fldit-www.cs.tu-dortmund.de/~peter/barrwells.pdf - [4] Davey, B.A. and H.A. Priestley, “Introduction to lattices and order”, Cambridge University Press, 2002. ISBN: 9780521784511
-
[5]
Ern, M., Scott convergence and Scott topology in partially ordered sets II,
Continuous lattices. Springer, Berlin, Heidelberg, (1981): 61-96.
https://doi.org/10.1007/BFb0089904 -
[6]
Gierz, G., K. H. Hofmann, K. Keimel, J. D. Lawson, M. Mislove, and D. S. Scott, “Continuous Lattices and Domains”, Volume 93 of Encyclopedia of Mathematics and its Applications, Cambridge University Press, 2003.
https://doi.org/10.1017/CBO9780511542725 -
[7]
Goubault-Larrecq, J.,“Non-Hausdorff Topology and Domain Theory”, Volume 22 of New Mathematical Monographs, Cambridge University Press, 2013.
https://doi.org/10.1017/CBO9781139524438 -
[8]
Ho, W.K. and D.S. Zhao, Lattices of Scott-closed sets,
Commentationes Mathematicae Universitatis Carolinae, 50 (2009): 297-314. Available online at:
http://dml.cz/dmlcz/133435 -
[9]
Mao, X.X. and L.S. Xu,
Meet continuity properties of posets,
Theoretical Computer Science 410 (2009): 4234-4240.
https://doi.org/10.1016/j.tcs.2009.06.017 -
[10]
Ruan, X.J. and X.Q. Xu,
-Quasicontinuous posets and meet -continuous posets,
Topology and Its Applications 230 (2017): 295-307.
https://doi.org/10.1016/j.topol.2017.08.045 -
[11]
Schalk, A.,
Algebras for generalized power constructions,
Technische Hochschule Darmstadt, Doctoral thesis, 1993. Available online at:
https://www.cs.man.ac.uk/~schalk/publ/diss.ps.gz -
[12]
Wright, J.B., E.G. Wagner, J.W. Thatcher, A uniform approach to inductive posets and inductive closure,
Theoretical Computer Science, 7 (1978): 57-77.
https://doi.org/10.1016/0304-3975(78)90040-3 -
[13]
Xu, X.Q., M.K. Luo and Y. Huang, Quasi Z-continuous domains and Z-meet continuous domains,
Acta Mathematica Sinica. Chinese Series, 48 (2005): 221-234.
https://doi.org/10.3321/j.issn:0583-1431.2005.02.002 (Chinese) and English listing -
[14]
Zhang, W.F. and X.Q. Xu, -Quasicontinuous posets,
Theoretical Computer Science 574 (2015): 78-85.
https://doi.org/10.1016/j.tcs.2015.01.037 -
[15]
Zhao, D.S., Closure spaces and completions of posets,
Semigroup Forum 90 (2015): 545-555.
https://doi.org/10.1007/s00233-015-9692-6