Research Article | Open Access

Xiaoli He, Yanhong She, "A Lattice-Theoretic Approach to Multigranulation Approximation Space", *The Scientific World Journal*, vol. 2014, Article ID 785932, 6 pages, 2014. https://doi.org/10.1155/2014/785932

# A Lattice-Theoretic Approach to Multigranulation Approximation Space

**Academic Editor:**Yunqiang Yin

#### Abstract

In this paper, we mainly investigate the equivalence between multigranulation approximation space and single-granulation approximation space from the lattice-theoretic viewpoint. It is proved that multigranulation approximation space is equivalent to single-granulation approximation space if and only if the pair of multigranulation rough approximation operators forms an order-preserving Galois connection, if and only if the collection of lower (resp., upper) definable sets forms an (resp., union) intersection structure, if and only if the collection of multigranulation upper (lower) definable sets forms a distributive lattice when , and if and only if . The obtained results help us gain more insights into the mathematical structure of multigranulation approximation spaces.

#### 1. Introduction

The theory of rough sets, proposed by Pawlak [1, 2], is a formal tool for the study of intelligent systems characterized by insufficient and incomplete information. After over thirty years of progress, it has become a well-established mechanism for uncertainty management in a wide variety of applications related to artificial intelligence (see [3, 4]).

Pawlak’s rough set theory is defined on the basis of an approximation space , where is a nonempty set, also called the universe of discourse, and is an equivalence relation on , representing the indiscernibility at the object level due to the lack of knowledge or information. Owing to the indiscernibility of objects, some subsets of the universe cannot be completely characterized with the available knowledge, thus forming a region of uncertainty. Pawlak’s idea was to approximate those sets with two precise sets from below and above based on certainty and possibility, respectively. They are called lower and upper approximations and are defined, for any , as

Since in Pawlak’s rough set theory, the concept is depicted by known knowledge induced from a single equivalence relation on the universe, in view of granular computing (see [5, 6]), Pawlak’s rough set theory was established through a single granulation, and therefore is also called a single-granulation approximation space. However, as illustrated in [7], in some cases it is more reasonable to describe the target concept through multiple relations on the universe according to user requirements or targets of problem solving. To more widely apply the rough set theory in practical applications, Qian et al. extended Pawlak’s single-granulation rough set model to a multigranulation rough set model (see [7]). To date, the theory of multigranulation rough set progressed rapidly. Many interesting results have been reported in the literature ([8–15]).

Superficially, the notion of multigranulation rough set differs significantly from that of Pawlak’s single-granulation rough set, because the former is defined by using multiple equivalence relations on the universe whereas the latter is defined by employing a single one. However, in some situations (see Example 5), the collection of multigranulation rough sets generated by a multigranulation approximation space may coincide with that produced by a single-granulation approximation space, such a phenomenon will be referred to as equivalence between these two kinds of approximation spaces. Since the lattice-theoretic properties of Pawlak’s single-granulation rough sets have been extensively studied, then the equivalence between these two kinds of approximation spaces will help us gain more insights into the mathematical structure of multigranulation rough sets and hence deserves further study. Motivated by the above considerations, we attempt to investigate the conditions under which the multigranulation approximation space is equivalent to a single-granulation approximation space from the lattice-theoretic viewpoint.

The rest of the paper proceeds as follows: we briefly review in Section 2 multigranulation rough set theory and some of its basic properties. In Section 3, we present the main results and give their detailed proof. In Section 4, we complete this paper with some concluding remarks.

#### 2. Preliminary

A multigranulation approximation space [7] is a pair , where is a nonempty set, also called the universe of discourse, and each is an equivalence relation on , representing a particular kind of indiscernibility at the level of objects. For , define Then we call , the multigranulation lower approximation and the multigranulation upper approximation of , respectively. Note that, in [7], two kinds of multigranulation rough approximations were defined, they are optimistic multigranulation rough approximation and pessimistic rough multigranulation approximation. The above defined , are actually the optimistic rough approximation operators. However, since we are not concerned with the pessimistic one in the present paper, the term multigranulation approximation always means the optimistic multigranulation approximation. If , then we call a multigranulation lower definable set, if , then we call a multigranulation upper definable set and if , then we call a multigranulation definable set. Let , if there exists an equivalence relation such that ; that is, is the smallest equivalence class containing ; then we say that has the SEC property.

Proposition 1 (see [1]). *Let be a single-granulation approximation space. Then the collection of definable sets in forms a Boolean algebra under the usual set-theoretic operations.*

*Definition 2 (see [15]). *The multigranulation approximation space is said to be equivalent to a single-granulation approximation space , if , and .

Proposition 3 (see [15]). *Let be a multigranulation approximation space. Then is equivalent to a single-granular approximation space if and only if each element of has the SEC property.*

Proposition 4 (see [15]). *Let be a multigranulation approximation space, , and . Then resp., forms a bounded lattice with the operations , defined by , , (resp., , , ).*

#### 3. Main Results

We begin with an example, which shows that in some situations, the multigranulation approximation space is equivalent to a single-granulation approximation space.

*Example 5. *Let , , . Then an easy verification shows that the multigranulation approximation space is actually equivalent to a single-granulation approximation space , where .

Then one natural question arises: under what conditions the notion of multigranulation approximation space reduce to single-granulation space. Such a consideration leads us to investigate several necessary and sufficient conditions under which multigranulation approximation spaces and single-granulation approximation spaces are equivalent to each other.

Some preliminary results of Galois connections are briefly recalled below.

Let , be two ordered sets and , two mappings. The pair is said to be an order-preserving Galois connection between and if , , . It can be easily checked that both and are order-preserving, and hence we also call an order-preserving Galois connection.

Proposition 6 (see [16]). *Let , be two mappings defined on ordered sets , , respectively. Then forms an order-preserving Galois connection if and only if*(i)*, , , ,*(ii)*both and are order-preserving.*

It was shown in [16] that the pair of Pawlak’s single-granulation rough approximation operators forms an order-preserving Galois connection.

Proposition 7. *Let , be a multigranulation approximation space and a single-granulation approximation space, respectively. Then is equivalent to if and only if forms an order-preserving Galois connection.*

*Proof. *“” According to the definition of equivalence between and , we have and ; then, the desired result follows immediately from the fact that forms an order-preserving Galois connection.

“” We suppose, on the contrary, that multigranulation approximation is not equivalent to any single-granulation approximation space. Then by Proposition 3, there exits one element such that does not have the SEC property. Take , we will show that below. To this end, we will firstly prove that . Considering the fact that , it suffices to show that , implies .

There are two cases to be considered below.*Case **1*. such that .

In this case, we have that , , consequently, , whence the result follows immediately.*Case **2*. Consider such that . Since , we conclude that there exists at least one equivalence class such that . This shows that , consequently, , then the desired result follows immediately from (3).

Then, we will further show that . Suppose, on the contrary, that , that is, there exists such that . According to (2), there exists such that , which means that is contained in each equivalence class containing , consequently, . We can thus conclude from that is the smallest equivalence class containing , a contradiction.

Since contains at least one point and hence is a nonempty set. Combining the result proved above, we conclude that , which, however, contradicts with the precondition that forms an order-preserving Galois connection, as desired.

Let ; that is, is the collection of lower approximations of subsets in . The following example shows that does not form an intersection structure (see [17]) in the general case. For instance, let , , and . Observe that ; however, .

The following proposition provides another necessary and sufficient condition for the equivalence between multigranulation approximation spaces and single-granulation approximation spaces.

Proposition 8. *Let be a multigranulation approximation space. Then is equivalent to a single-granular approximation space if and only if forms an intersection structure.*

*Proof . *“” It follows immediately from Proposition 1.

“” Suppose, on the contrary, that the multigranulation approximation space is not equivalent to any single-granulation approximation space; then, there exists an element of (say as ) such that does not have the SEC property. Since , , we then have from the fact that forms an intersection structure that . Clearly, , and then according to (2), there exists some such that , implying that , which, however, is a contradiction with the fact that does not have the SEC property.

Similarly, we can prove the following result.

Proposition 9. *Let be a multigranulation approximation space. Then is equivalent to a single-granular approximation space if and only if forms an union structure.*

Proposition 10. *Let be a multigranulation approximation space with . Then is equivalent to a single-granular approximation space if and only if is a distributive lattice.*

*Proof . *“” It follows immediately from Proposition 1.

“” Suppose, on the contrary, that the multigranulation approximation space is not equivalent to any single-granulation approximation space, then according to Proposition 3, there exists an element of , say as , such that and . Therefore, there exist two elements , satisfying , , , and . We assume, without any loss of generality, that
where .

There are two cases to be considered below.*Case **1.* Consider . Let , , . Clearly, . An easy verification shows that
Since definitely does not belong to , we obtain , showing that is not distributive.*Case **2.* Consider . In this case, take , , . Clearly, . An easy verification shows that
Since definitely does not belong to , we obtain , showing that is not distributive.

The following proposition can be shown in a similar way.

Proposition 11. *Let be a multigranulation approximation space. Then is equivalent to a single-granular approximation space if and only if is a distributive lattice.*

In [7], some sufficient and necessary conditions for the equivalence between a multigranulation approximation space and a single-granulation approximation space are provided mainly from the viewpoint of topology, that is, as follows.

Proposition 12. *Let be a multigranulation approximation space. Then is equivalent to a single-granular approximation space if and only if forms a topology on .*

Proposition 13. *Let be a multigranulation approximation space. Then is equivalent to a single-granular approximation space if and only if forms a topology on .*

Proposition 14. *Let be a multigranulation approximation space. Then is equivalent to a single-granular approximation space if and only if , .*

*Proof. *“” If is equivalent to a single-granular approximation space , then according to Definition 2, we have , . Let , by taking , one can calculate that , which shows that is a definable set in the single-granulation approximation space . Since the collection of definable sets in forms a Boolean algebra and thus is closed under set-theoretic intersection, we conclude that is also a definable set in . Moreover, since the collection of is the set of equivalence classes produced by , we further have that is coarser than .

Then, choose arbitrarily , and then we have , since , we further obtain , implying , which together with shows that . And hence, . Conversely, choose arbitrarily , and by definition, there exists some equivalence relation such that ; since , we further have , and thus . Then holds owing to the arbitrariness of . And hence, , .

“” It follows immediately by taking .

Proposition 15. *Let be a multigranulation approximation space. Then is equivalent to a single-granular approximation space if and only if , .*

*Proof. *It can be proved in a similar way as that in Proposition 14.

Main results in the present paper are summarized as follows.

Proposition 16. *Let be a multigranulation approximation space. Then the following statements are equivalent:*(i)* is equivalent to a single-granular approximation space ,*(ii)* forms a topology on ,*(iii)* forms a topology on ,*(iv)* forms an order-preserving Galois connection,*(v)* forms an union structure,*(vi)* forms an union structure,*(vii)*, ,*(viii)*, .*

#### 4. Concluding Remarks

In this paper, we consider the equivalence between multigranulation rough sets and single-granulation rough sets from the lattice-theoretic viewpoint. The obtained results will help us gain more insights into the mathematical structure of multigranulation rough sets. Along this research line, some interesting topics are worthy of further research; for instance, what is the structure of multigranulation rough sets induced by general binary relations or fuzzy relations on the universe and what is the connection between multigranulation rough sets and knowledge reasoning for multiple agents? We will report them in forthcoming papers.

#### Conflict of Interests

The authors declare that there is no conflict of interests regarding the publication of this paper.

#### Acknowledgments

This project is supported by the National Nature Science Fund of China under Grant 61103133 and 61472471, the Natural Science Program for Basic Research of Shaanxi Province, China (no. 2014JQ1032), and the Innovation Foundation of Science and Technology for Young Scholars in Xi’an Shiyou University (no. 2012QN011).

#### References

- Z. Pawlak, “Rough sets,”
*International Journal of Computer and Information Sciences*, vol. 11, no. 5, pp. 341–356, 1982. View at: Publisher Site | Google Scholar | MathSciNet - Z. Pawlak,
*Rough Sets, Theoretical Aspects of Reasoning about Data*, Kluwer Academic Publiser, London, UK, 1991. - Y. Qian, J. Liang, W. Pedrycz, and C. Dang, “Positive approximation: an accelerator for attribute reduction in rough set theory,”
*Artificial Intelligence*, vol. 174, no. 9-10, pp. 597–618, 2010. View at: Publisher Site | Google Scholar | MathSciNet - I. Düntsch and G. Gediga, “Uncertainty measures of rough set prediction,”
*Artificial Intelligence*, vol. 106, no. 1, pp. 109–137, 1998. View at: Publisher Site | Google Scholar | MathSciNet - L. A. Zadeh, “Toward a theory of fuzzy information granulation and its centrality in human reasoning and fuzzy logic,”
*Fuzzy Sets and Systems*, vol. 90, no. 2, pp. 111–127, 1997. View at: Publisher Site | Google Scholar | MathSciNet - W. Pedrycz,
*Granular Computing: An Emerging Paradigm*, Springer, New York, NY, USA, 2001. View at: Publisher Site | MathSciNet - Y. Qian, J. Liang, Y. Yao, and C. Dang, “MGRS: a multi-granulation rough set,”
*Information Sciences*, vol. 180, no. 6, pp. 949–970, 2010. View at: Publisher Site | Google Scholar | MathSciNet - Y. H. Qian, J. Y. Liang, and C. Y. Dang, “Incomplete multigranulation rough set,”
*IEEE Transactions on Systems, Man, and Cybernetics A*, vol. 40, no. 2, pp. 420–431, 2010. View at: Publisher Site | Google Scholar - J. Y. Liang, F. Wang, C. Y. Dang, and Y. Qian, “An efficient rough feature selection algorithm with a multi-granulation view,”
*International Journal of Approximate Reasoning*, vol. 53, no. 6, pp. 912–926, 2012. View at: Publisher Site | Google Scholar | MathSciNet - W. Xu, W. Sun, X. Zhang, and W. Zhang, “Multiple granulation rough set approach to ordered information systems,”
*International Journal of General Systems*, vol. 41, no. 5, pp. 475–501, 2012. View at: Publisher Site | Google Scholar | MathSciNet - X. B. Yang, Y. S. Qi, X. N. Song, and J. Yang, “Test cost sensitive multigranulation rough set: model and minimal cost selection,”
*Information Sciences*, vol. 250, pp. 184–199, 2013. View at: Publisher Site | Google Scholar | MathSciNet - G. P. Lin, J. Y. Liang, and Y. H. Qian, “Multigranulation rough sets: from partition to covering,”
*Information Sciences*, vol. 241, pp. 101–118, 2013. View at: Publisher Site | Google Scholar | MathSciNet - C. H. Liu, D. Q. Miao, and J. Qian, “On multi-granulation covering rough sets,”
*International Journal of Approximate Reasoning*, vol. 55, no. 6, pp. 1404–1418, 2014. View at: Publisher Site | Google Scholar | MathSciNet - B. Huang, C. X. Guo, Y. L. Zhuang, H. Li, and X. Zhou, “Intuitionistic fuzzy multigranulation rough sets,”
*Information Sciences*, vol. 277, pp. 299–320, 2014. View at: Publisher Site | Google Scholar | MathSciNet - Y. H. She and X. L. He, “On the structure of the multigranulation rough set model,”
*Knowledge-Based Systems*, vol. 36, pp. 81–92, 2012. View at: Publisher Site | Google Scholar - J. Jouni, M. Kondo, and J. Kortelainen, “Logics from Galois connections,”
*International Journal of Approximate Reasoning*, vol. 49, no. 3, pp. 595–606, 2008. View at: Publisher Site | Google Scholar | MathSciNet - B. A. Davey and H. A. Priestley,
*Introduction to Lattices and Order*, Cambridge University Press, New York, NY, USA, 2nd edition, 2002. View at: Publisher Site | MathSciNet

#### Copyright

Copyright © 2014 Xiaoli He and Yanhong She. 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.