Abstract and Applied Analysis

Volume 2012 (2012), Article ID 891239, 11 pages

doi:10.1155/2012/891239

Research Article

Reflective Full Subcategories of the Category of -Posets

Hongping Liu, Qingguo Li, and Xiangnan Zhou

College of Mathematics and Econometrics, Hunan University, Changsha 410082, China

Received 3 June 2012; Accepted 31 October 2012

Academic Editor: Josef Diblík

Copyright © 2012 Hongping Liu et al. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.

Abstract.

This paper focuses on the relationship between L-posets and complete L-lattices from the categorical view. By considering a special class of fuzzy closure operators, we prove that the category of complete L-lattices is a reflective full subcategory of the category of L-posets with appropriate morphisms. Moreover, we characterize the Dedekind-MacNeille completions of L-posets and provide an equivalent description for them.

1. Introduction

Fuzzy order was originated from the literature of Zadeh [1] and later was broadly studied. A fuzzy ordered set (an -poset) is the fundamental idea of fuzzy ordered structures. Some people studied it from the fuzzy set theory such as [2–8], and others considered it as a category (see [9–11]). All these works enriched the theories of fuzzy orders and fuzzy ordered structures. At present, we are about to consider fuzzy ordered sets as objects in the framework of category. As we are all know that the researches on category can be reflected on its reflective full subcategories whose structures are better than . Searching for such subcategories provides a new approach to study primary category.

In recent years, the completion theory for fuzzy ordered sets attracts much attention. Wagner [9] introduced the enriched Dedekind-MacNeille completion for a category enriched over a commutative unital quantale. Blohlávek [12] described the Dedekind-MacNeille completion for an -ordered set as an application of the theory of concept lattices in the fuzzy setting. Xie et al. [13] built and characterized the Dedekind-MacNeille completions for -posets. In [14], Wang and Zhao proposed join-completions for -ordered sets and investigated their characterizations. It was shown that each join-completion is in bijective correspondence with a consistent fuzzy closure operator , and it has a universal property with respect to -homomorphisms. It also mentioned that the relationship between the categories of -posets and complete -lattices will be of concern in the future. This problem is closely related to the appropriate morphisms chosen, respectively. How about when -homomorphisms endowed on -posets and fuzzy-join-preserving mappings are chosen for complete -lattices? This is our first motivation for this paper. After analysis, we discover that the latter category is a reflective full subcategory of the former with respect to a special class of fuzzy closure operators, but not for any one (a counterexample is given). The special class of fuzzy closure operators is singled out in this paper. Moreover, when a completion has a universal property, we can declare that it is a join-completion. But there are so many join-completions, thus which type is it? This is the other motivation of this paper. We prove that it is exactly the Dedekind-MacNeille completion up to isomorphism.

This paper is organized as follows. In Section 2, we list some basic definitions and well-known results for fuzzy order theory. In Section 3, we discuss the relationship between -homomorphisms and fuzzy-join-preserving mappings then single out a special class of fuzzy closure operators such that the category of complete -lattices is a reflective full subcategory of the category of -posets. In Section 4, we characterize the Dedekind-MacNeille completions for -posets and give an equivalent description for them. In Section 5, we summarize all the content and reach a conclusion.

2. Preliminaries

A complete residuated lattice [15] is a structure such that (1) is a complete lattice with the greatest element 1 and least element 0; (2) is a commutative monoid with the identity 1, and is isotone at both arguments; (3) is an adjoint pair, that is, if and only if for all . Usually, we abbreviate by simply. Some basic properties of complete residuated lattices are collected here ([15–17]).

(1);(2) if and only if ; (3);(4); (5); (6); (7), ;(8), ;(9); (10), ;(11);(12).

In this paper, always denotes a complete residuated lattice unless otherwise stated, and denotes the set of all -subsets of a nonempty set . For all , we define

Then is also a complete residuated lattice. If no confusion arises, we always do not discriminate the constant value function with , for example, and for every .

Fuzzy order was first introduced by Zadeh [1], from then on, different kinds of fuzzy order have been introduced and studied by different authors (the reader is referred to [3, 6, 9, 11, 18–20] for details). In this paper, we adopt the definition of fuzzy order introduced by Fan and Zhang [3, 6].

Definition 2.1. An -partial order (also called an -order) on is an -relation satisfying:

(1), ;(2), ;(3), .

Then is called an -partially ordered set or an -poset for simplicity.

It is worth noting that Blohlávek defined another fuzzy order in [12, 16], and it was shown to be equivalent to the above definition by Yao [5].

There are some important -posets which are mentioned in many papers, such as [3, 4, 19, 21]. For example, in an -poset , define for all , then is also an -poset. In a complete residuated lattice , define by for all , then is an -poset. For all , define , then is an -poset.

In the following, some basic and very important definitions and results related to the theory of -poset are listed. The reader is referred to [2–9, 11–13, 20] for details.

Definition 2.2. Let be an -poset, , . is called a fuzzy join (resp., fuzzy meet) of denoted by (resp., ) if

(1), (resp., ;(2),    resp., .

It is easy to see that the fuzzy join or the fuzzy meet is unique in an -poset if it exists, and (resp., ) if and only if (resp., ) for all . If and exist for all , then is said to be a complete -lattice.

In an -poset , for any , we usually define as for each and dually define . For any , it is called an -lower set if for all , or an -upper set if for all . When is an -lower set, we have , and when is an -upper set.

For each map from a set to an -poset , there exist -forward powerset operators defined as for all , and an -backward powerset operator defined as for each .

Definition 2.3. Let be -posets and be a map. Then

(1) is said to be -order-preserving or -monotone if for all ;(2) is an -order-embedding if for all ;(3) is said to be fuzzy-join-preserving if for any such that exists, it implies that exists and ;(4) is said to be fuzzy-meet-preserving if for any such that exists, it implies that exists and .

Definition 2.4. Let , be -posets, , be -order-preserving maps. If for all , then is called a fuzzy Galois connection between and . is called the left adjoint of , and dually is the right adjoint of .

It is worth noting that for any map , there is a useful fuzzy Galois connection between and .

Theorem 2.5. Let be -posets, , and let be maps.

(1)If is complete, then is -order-preserving and has a right adjoint if and only if for each ;(2)If is complete, then is -order-preserving and has a left adjoint if and only if for each .

Definition 2.6. Let be an -poset, a complete -lattice. If there exists an -order-embedding , then is said to be a completion of via . Besides, if is join-dense in (refer to [13]), then we say that is a join-completion of via .

For an -poset and , then we have which is called upper bound and lower bound of , respectively.

Define and . Then both and are join-completions of , respectively, via -order-embedding given by and -order-embedding given by (the reader is referred to [13] for details). They are known as the Dedekind-MacNeille completions for .

3. Reflective Full Subcategories of -Posets

The aim of this section is to study the relationship between -posets and complete -lattices in categorical terms, which is closely related to the universal property of join-completions determined by a fuzzy closure operator. We refer to [22] for general category theory.

Definition 3.1. A subcategory of a category is said to be reflective in if for each -object , there exists an -object and a -morphism such that for each -morphism there exists a unique -morphism with .

Assume that the reader is familiar with the concepts of fuzzy closure operators and fuzzy closure systems. If is a fuzzy closure operator on , then there is an associated fuzzy closure system and vice versa (refer to [12, 23] for details).

Definition 3.2 (see [14]). Let be an -poset. A fuzzy closure operator on is called a consistent fuzzy closure operator if .

As shown in the literature [14], join-completions are in bijective correspondence with consistent fuzzy closure operators.

Definition 3.3 (see [14]). Let , be -posets and a consistent fuzzy closure operator on . A mapping is called a -homomorphism if for all , .

Theorem 3.4 (see [14]). Let be a -poset, a consistent fuzzy closure operator on , and a completion of via . Then, the following are equivalent:

(1) is a join-completion of via ;(2) is a -homomorphism. Moreover, for each complete -lattice and each -homomorphism , there exists a unique fuzzy-join-preserving mapping such that .

Considering Theorem 3.4, we do want to know that whether the category of complete -lattices with fuzzy-join-preserving mappings, in symbol -Sup, is a reflective full subcategories of the category whose objects are -posets and arrows are -homomorphisms associated with a consistent fuzzy closure operator , which is denoted by -POS. In fact, the answer is positive for some special consistent fuzzy closure operators. But as in Example 3.5, when , there exists some -homomorphisms on complete -lattices but not fuzzy-join-preserving. So -Sup is not a full subcategory of -POS. Sequentially, it is not a reflective full subcategory of -POS neither.

Example 3.5. Let with , and with , then and are complete -lattices where . Define as , . It easily checked that is a -homomorphism, but it is not fuzzy-join-preserving.

In the sequel, we try to seek for those special fuzzy closure operators in order to give some reflective full subcategories for the category of -posets.

Definition 3.6. Let be an -poset and a fuzzy closure operator on . Then, is called an essential fuzzy closure operator if for all with exists.

Note that an essential fuzzy closure operator is also a consistent fuzzy closure operator, not vice versa. The following proposition shows that “essential” is a sufficient and necessary condition for the equivalence of -homomorphisms and fuzzy-join-preserving mappings on complete -lattices.

Proposition 3.7. Let , be complete -lattices, and let a mapping from to , be a consistent fuzzy closure operator on . Then

(1)Assume that is essential, we have is a -homomorphism if and only if it is fuzzy-join-preserving;(2)Assume that is a -homomorphism if and only if it is fuzzy-join-preserving, then is essential.

Proof. (1) Suppose that is essential. If is an -homomorphism, then is -order-preserving by Lemma 4.3 in [14]. For any , clearly . For the other direction, let , then . By Lemma 2.19(1) in [8], we have , and so . By assumption, and so . It implies that . Thus , that is, . Therefore, and is fuzzy-join-preserving. Conversely, if is fuzzy-join-preserving. Then for any , it is easy to check that at first. Furthermore,

Hence, since is essential. Thus , it implies that is an -homomorphism.

(2) If is not essential, then for -homomorphism , we have , where for . As shown in the proof of (1), we can see that . It induces that , so . Then cannot be fuzzy-join-preserving, and it contradicts with premise. Thus is essential.

Corollary 3.8. (1) If is an essential fuzzy closure operator, then -Sup is a full subcategory of -POS().

(2) If -Sup is a full subcategory of   POS() associated with a consistent fuzzy closure operator, then is essential.

Proposition 3.9. Let be an -poset and an essential fuzzy closure operator on . Then there exists a join-completion of via an -homomorphism . Moreover, for each complete -lattice and -homomorphism , there exists an unique fuzzy-join-preserving mapping such that the following diagram commutes:

(3.2)

Proof. Since is an essential fuzzy closure operator, then is a consistent fuzzy closure operator. By the Literature [14], we can see that is a join-completion of via -homomorphism . Thus the result follows immediately from Theorem 3.4.

Theorem 3.10. (1) If is an essential fuzzy closure operator, then -Sup is a reflective full subcategory of -POS().

(2) If -Sup is a reflective full subcategory of -POS() associated with a consistent fuzzy closure operator, then is essential.

Proof. It follows from Corollary 3.8 and Proposition 3.9.

Remark 3.11. For an -poset , let . By Lemma in [13], we can see that . So is an essential fuzzy closure operator, and its associated completion is exactly the Dedekind-MacNeille completion via -homomorphism (it is called lower-continuous mapping in Section 4). Thus -Sup is a reflective full subcategory of -POS().

It is easy to see that can be viewed as . With the duality of the -order, when mappings dual to -homomorphism are chosen to serve as morphisms on -posets, the corresponding morphisms on complete -lattices need to be changed to fuzzy-meet-preserving mappings. Then the dual result is obtained immediately. We list it in the following and leave the proof to the reader.

Definition 3.12. Let be -posets, a mapping. Then is said to be upper-continuous if for all .

Let -Inf denote the category of complete -lattices with fuzzy-meet-preserving mappings, and the -Pos denote the category whose objects are all -posets and arrows are upper-continuous mappings.

Theorem 3.13. -Inf is a reflective full subcategory of -POS.

4. The Characterizations of the Dedekind-MacNeille Completions for -Posets

From previous works, we have known that for an -poset, each join-completion has a universal property, and any completion with a universal property must be a join-completion. In this section, we study the characterizations of one special join-completion–-the Dedekind-MacNeille completion and obtain a stronger result that a complete -lattice with a universal property is exactly the Dedekind-MacNeille completion up to isomorphism.

Definition 4.1. Let be -posets, a mapping, and . Then is said to be lower-continuous if for all .

Theorem 4.2. Let be -posets, and let be a lower-continuous mapping. Then there exists a unique fuzzy-join-preserving mapping such that the following diagram commutes:

(4.1)

Proof. First, define by , then we show that has a right adjoint. In fact, define by . Then for any , , it implies that forms a fuzzy Galois connection. By Theorem 2.5, is fuzzy-join-preserving.

Next, to show that the diagram commutes amount to showing that for every . Clearly, since is -order-preserving. In the other direction, since is an -lower set, so for any , we have . It implies that , that is, . Thus , as needed.

Finally, we show that is unique. Suppose that there is another fuzzy-join-preserving mapping satisfying the diagram commutes; we show that for all . Since is join-dense in , it suffices to show that for all . That is obvious since the diagram commutes.

Corollary 4.3. Let be a lower-continuous mapping of an -poset into a complete -lattice . Then there exists a unique fuzzy-join-preserving mapping such that the following diagram commutes:

(4.2)

Proof. By Theorem 4.2, there exists a commutative diagram as follows, and the mapping is an -order-isomorphism since is a complete -lattice. Let , then is a unique fuzzy-join-preserving mapping such that the following diagram commutes:

(4.3)

Corollary 4.4. The Dedekind-MacNeille completion operator is a covariant functor from -POS() to -Sup.

Corollary 4.5. In the category -Sup, is the free object generated by an -poset .

Theorem 4.6. Let be an -poset and a complete -lattice. Then is isomorphic to the Dedekind-MacNeille completion if and only if it satisfies the following condition.

There exists a lower-continuous mapping such that for every lower-continuous mapping of into a complete -lattice , there exists a unique fuzzy-join-preserving mapping such that the following diagram commutes:

(4.4)

Proof. Suppose that is isomorphic to , then there exists an -order-isomorphism . We define as , then it is easily checked that is a lower-continuous mapping. If is a lower-continuous mapping of into complete -lattice . By Corollary 4.3, there exists a unique fuzzy-join-preserving mapping such that . Let , then is a unique fuzzy-join-preserving mapping such that .

For the second part, assume that the condition holds. By Corollary 4.3, the diagrams below commute:

(4.5)

By the uniquess condition, and . Thus is isomorphic to .

Since can be regarded as , when we replace the lower-continuous mapping by upper-continuous mapping and fuzzy-join-preserving mapping by fuzzy-meet-preserving mapping, then the dual results of Theorem 4.2 and Corollary 4.3 are obtained naturally. Sequentially, the following observations are immediate, and the proofs are trivial, so we omit them.

Proposition 4.7. (1) The Dedekind-MacNeille completion operator is a covariant functor from -Pos to -Inf.

(2) In the category -Inf, is the free object generated by an -poset .

Theorem 4.8. Let be an -poset and a complete -lattice. Then is isomorphic to the Dedekind-MacNeille completion if and only if it satisfies the following condition.

There exists an upper-continuous mapping such that for every upper-continuous mapping of into a complete -lattice , there exists a unique fuzzy-meet-preserving mapping such that the following diagram commutes:

(4.6)

5. Conclusion

In this paper, we consider the relationship between -posets and complete -lattices in the categorical framework. After analysis of the characterizations of the join-completions, we prove that the category of complete -lattices with fuzzy-join-preserving mappings is a reflective full subcategory of the category of -posets with -homomorphisms related to an essential fuzzy closure operator. Furthermore, we characterize the Dedekind-MacNeille completions. It is shown that they are the unique free objects (up to isomorphism) generated by an -poset in the category of complete -lattices. It offers an equivalent description for them. Maybe we will continue to focus on the completion theory for fuzzy ordered sets, we will try to propose and characterize other completions for -posets in the future.

Acknowledgments

This work was supported by the National Science Foundation of China (Grants nos. 11071061, 11101135), the National Basic Research Program (no. 2011CB311808), and Hunan Provincial Innovation Foundation for Postgraduate (no. CX2011B158).

References

L. A. Zadeh, “Similarity relations and fuzzy orderings,” Information Sciences, vol. 3, pp. 177–200, 1971.

R. Bělohlávek, “Fuzzy Galois connections,” Mathematical Logic Quarterly, vol. 45, no. 4, pp. 497–504, 1999.

L. Fan, “A new approach to quantitative domain theory,” Electronic Notes in Theoretic Computer Science, vol. 45, pp. 77–87, 2001.

W. Yao, “-fuzzy Scott topology and Scott convergence of stratified -filters on fuzzy dcpos,” Electronic Notes in Theoretical Computer Science, vol. 257, pp. 135–152, 2009.

W. Yao, “Quantitative domains via fuzzy sets: part I: continuity of fuzzy directed complete posets,” Fuzzy Sets and Systems, vol. 161, no. 7, pp. 973–987, 2010.

Q.-Y. Zhang and L. Fan, “Continuity in quantitative domains,” Fuzzy Sets and Systems, vol. 154, no. 1, pp. 118–131, 2005.

Q.-Y. Zhang and L. Fan, “A kind of L-fuzzy complete lattice and adjoint functor theorem for LF-Poset,” in Proceedings of the 4th International Symposium on Domain Theory, Hunan University, Changsha, China, June 2006.

Q. Zhang, W. Xie, and L. Fan, “Fuzzy complete lattices,” Fuzzy Sets and Systems, vol. 160, no. 16, pp. 2275–2291, 2009.

K. R. Wagner, Solving recursive domain equations with enriched cetegories [Ph.D. thesis], Carnegie Mellon University, Technical Report CMU-CS-94-159, 1994.

K. R. Wagner, “Liminf convergence in -categories,” Theoretical Computer Science, vol. 184, no. 1-2, pp. 61–104, 1997.

H. Lai and D.-X. Zhang, “Complete and directed complete -categories,” Theoretical Computer Science, vol. 388, no. 1–3, pp. 1–25, 2007.

R. Bělohlávek, “Concept lattices and order in fuzzy logic,” Annals of Pure and Applied Logic, vol. 128, no. 1–3, pp. 277–298, 2004.

W. Xie, Q. Zhang, and L. Fan, “The Dedekind-MacNeille completions for fuzzy posets,” Fuzzy Sets and Systems, vol. 160, no. 16, pp. 2292–2316, 2009.

K. Wang and B. Zhao, “Join-completions of -ordered sets,” Fuzzy Sets and Systems, vol. 199, pp. 92–107, 2012.

M. Ward and R. P. Dilworth, “Residuated lattices,” Transactions of the American Mathematical Society, vol. 45, no. 3, pp. 335–354, 1939.

R. Bělohlávek, Fuzzy Relational Systems: Foundation and Principles, Kluwer Academic/Plenum Publishers, New York, NY, USA, 2002.

P. Hájek, Metamathematics of Fuzzy Logic, Kluwer Academic Publishers, Dordrecht, The Netherland, 1998.

H. Lai and D. Zhang, “Fuzzy preorder and fuzzy topology,” Fuzzy Sets and Systems, vol. 157, no. 14, pp. 1865–1885, 2006.

I. Stubbe, “Categorical structures enriched in a quantaloid: categories, distributors and functors,” Theory and Applications of Categories, vol. 14, pp. 1–45, 2005.

I. Stubbe, “Categorical structures enriched in a quantaloid: tensored and cotensored categories,” Theory and Applications of Categories, vol. 16, no. 14, pp. 283–306, 2006.

H.-L. Lai and D.-X. Zhang, “Many-valued complete distributivity,” http://arxiv.org/abs/math/0603590

S. Mac Lane, Categories for the Working Mathematician, Springer, New York, NY, USA, 1971.

R. Bělohlávek, “Fuzzy closure operators,” Journal of Mathematical Analysis and Applications, vol. 262, no. 2, pp. 473–489, 2001.