Completely Compact Elements and Atoms of Rough Sets

Rough set theory established by Pawlak in 1982 plays an important role in dealing with uncertain information and to some extent overlaps fuzzy set theory. The key notions of rough set theory are approximation spaces of pairs (U,R) with R being an equivalence relation on U and approximation operators \(\underline{R}\) and \(\overline{R}\). Let \(\mathcal{R}\) be the family {( \(\underline{R}X,\overline{R}X)|X \subseteq U\)} of approximations endowed with the pointwise order of set-inclusion. It is known that \(\mathcal{R}\) is a complete Stone lattice with atoms and is isomorphic to the family of rough sets in the approximation space (U, R). This paper is devoted to investigate algebraicity and completely distributivity of \(\mathcal{R}\) from the view of domain theory. To this end, completely compact elements, compact elements and atoms of \(\mathcal{R}\) are represented. In terms of the representations established in this paper, it is proved that \(\mathcal{R}\) is isomorphic to a complete ring of sets, consequently \(\mathcal{R}\) is a completely distributive algebraic lattice. An example is given to show that \(\mathcal{R}\) is not atomic nor Boolean in general. Further, a sufficient and necessary condition for \(\mathcal{R}\) being atomic is thus given.

[1]  William Zhu,et al.  The algebraic structures of generalized rough set theory , 2008, Inf. Sci..

[2]  Sadaaki Miyamoto,et al.  Rough Sets and Current Trends in Computing , 2012, Lecture Notes in Computer Science.

[3]  Andrzej Skowron,et al.  Rough-Neural Computing: Techniques for Computing with Words , 2004, Cognitive Technologies.

[4]  Yiyu Yao,et al.  Probabilistic rough set approximations , 2008, Int. J. Approx. Reason..

[5]  Jouni Järvinen,et al.  Lattice Theory for Rough Sets , 2007, Trans. Rough Sets.

[6]  Daowu Pei,et al.  On definable concepts of rough set models , 2007, Inf. Sci..

[7]  Lotfi A. Zadeh,et al.  Toward a generalized theory of uncertainty (GTU)--an outline , 2005, Inf. Sci..

[8]  Z. Pawlak,et al.  Rough membership functions , 1994 .

[9]  Lotfi A. Zadeh,et al.  Fuzzy Sets , 1996, Inf. Control..

[10]  Jouni Järvinen,et al.  The Ordered Set of Rough Sets , 2004, Rough Sets and Current Trends in Computing.

[11]  Yiyu Yao,et al.  A Decision Theoretic Framework for Approximating Concepts , 1992, Int. J. Man Mach. Stud..

[12]  Jerzy W. Grzymala-Busse,et al.  Rough Sets , 1995, Commun. ACM.

[13]  Mohua Banerjee,et al.  Algebras from Rough Sets , 2004, Rough-Neural Computing: Techniques for Computing with Words.

[14]  K. Hofmann,et al.  Continuous Lattices and Domains , 2003 .

[15]  S. K. Wong,et al.  Comparison of the probabilistic approximate classification and the fuzzy set model , 1987 .

[16]  Lingyun Yang,et al.  Algebraic aspects of generalized approximation spaces , 2009, Int. J. Approx. Reason..

[17]  Jerzy W. Grzymala-Busse,et al.  Transactions on Rough Sets VI, Commemorating the Life and Work of Zdzislaw Pawlak, Part I , 2007, Trans. Rough Sets.

[18]  Yiyu Yao,et al.  Two views of the theory of rough sets in finite universes , 1996, Int. J. Approx. Reason..

[19]  Jouni Järvinen On the Structure of Rough Approximations , 2002, Fundam. Informaticae.

[20]  J. A. Pomykala,et al.  The stone algebra of rough sets , 1988 .

[21]  J. Kacprzyk,et al.  Advances in the Dempster-Shafer theory of evidence , 1994 .