##
**Categories of rough sets and textures.**
*(English)*
Zbl 1302.18005

Summary: It is known that the theories of rough sets and fuzzy sets have successful applications in computing. Textures, as a theoretical model, provide a new perspective for both rough sets and fuzzy sets. Indeed, recent papers have shown that there is a natural link between rough sets and textures while a texture is an alternative point-set based setting for fuzzy sets. Relations are representatives of information systems and induce approximation operators. Therefore, the first step for the categorical discussions on rough sets involves the category \(\mathbf{REL}\) of sets and relations. In this context, we observe that power sets and pairs of rough set approximation operators form a category denoted by \(\mathbf{R\text{-}APR}\). In particular, we prove that \(\mathbf{R\text{-}APR}\) is isomorphic to a full subcategory of the category \(\mathbf{cdrTex}\) whose objects are complemented textures and morphisms are complemented direlations. Therefore, \(\mathbf{cdrTex}\) may be regarded as a suitable abstract model of rough set theory. Here, we show that \(\mathbf{R\text{-}APR}\) and \(\mathbf{cdrTex}\) are new examples of dagger symmetric monoidal categories.

### MSC:

18B99 | Special categories |

03E72 | Theory of fuzzy sets, etc. |

18D10 | Monoidal, symmetric monoidal and braided categories (MSC2010) |

### Keywords:

approximation operator; dagger category; direlation; rough set; symmetric monoidal category; texture space
Full Text:
DOI

### References:

[1] | Abramsky, S.; Coecke, B., A categorical semantics of quantum protocols, (Proceedings of the 19th Annual IEEE Symposium on Logic in Computer Science. Proceedings of the 19th Annual IEEE Symposium on Logic in Computer Science, LICS (2004), IEEE Computer Society Press), 415-425 |

[2] | Abramsky, S.; Tzevelekos, N., Introduction to categories and categorical logic, (Coecke, B., New Structures for Physics. New Structures for Physics, Lecture Notes in Physics (2009), Springer-Verlag), 3-89 |

[3] | Banerjee, M.; Chakraborty, M. K., A category for rough sets, Foundations of Computing and Decision Sciences, 18, 3-4, 167-188 (1983) |

[4] | Banerjee, M.; Yao, Y., A categorial basis for granular computing, (Rough Sets, Fuzzy Sets, Data Mining and Granular Computing. Rough Sets, Fuzzy Sets, Data Mining and Granular Computing, Lecture Notes in Computer Science, vol. 4482 (2007)), 427-434 |

[5] | Brown, L. M.; Irkad, A., Binary di-operations and spaces of real difunctions on a texture, Hacettepe Journal of Mathematics and Statistics, 37, 1, 25-39 (2008) · Zbl 1169.54001 |

[6] | Brown, L. M.; Diker, M., Ditopological texture spaces and intuitionistic sets, Fuzzy Sets and Systems, 98, 217-224 (1998) · Zbl 0930.54006 |

[7] | Brown, L. M.; Ertürk, R., Fuzzy sets as texture spaces, I. Representation theorems, Fuzzy Sets and Systems, 110, 2, 227-236 (2000) · Zbl 0953.54010 |

[8] | Brown, L. M.; Ertürk, R.; Dost, Ş., Ditopological texture spaces and fuzzy topology, I. Basic Concepts, Fuzzy Sets and Systems, 147, 171-199 (2000) · Zbl 1070.54002 |

[10] | Daowu, P.; Xu, Z., Rough set models on two universes, International Journal of General Systems, 33, 5, 569-581 (2004) · Zbl 1154.93378 |

[11] | Demirci, M., Textures and C-spaces, Fuzzy Sets and Systems, 158, 1237-1245 (2007) · Zbl 1118.54006 |

[12] | Diker, M.; Altay Uğur, A., Textures and covering based rough sets, Information Sciences, 184, 44-63 (2012) · Zbl 1239.03032 |

[13] | Diker, M., Categories of direlations and rough set approximation operators, (Rough Sets and Current Trends in Computing. Rough Sets and Current Trends in Computing, Warsaw, Poland June-28-30 2010. Rough Sets and Current Trends in Computing. Rough Sets and Current Trends in Computing, Warsaw, Poland June-28-30 2010, Lecture Notes in Artificial Intelligence (2010), Springer Verlag), 288-298 |

[14] | Diker, M., Definability and textures, International Journal of Approximate Reasoning, 53, 4, 558-572 (2012) · Zbl 1258.03081 |

[15] | Diker, M., Textures and fuzzy rough sets, Fundamenta Informaticae, 108, 305-336 (2011) · Zbl 1241.03063 |

[16] | Diker, M., Textural approach to rough sets based on relations, Information Sciences, 180, 8, 1418-1433 (2010) · Zbl 1187.68579 |

[17] | Eklund, P.; Galán, M. A., Monads can be rough, (Rough Sets and Current Trends in Computing. Rough Sets and Current Trends in Computing, Lecture Notes in Computer Science, vol. 4259 (2006), Springer: Springer Berlin), 77-84 · Zbl 1162.18301 |

[18] | Eklund, P.; Galán, M. A., The rough powerset monad, Journal of Multiple-Valued Logic and Soft Computing, 13, 4-6, 321-333 (2007) · Zbl 1133.18003 |

[19] | Eklund, P.; Galán, M. A.; Gähler, W., Partially ordered monads for monadic topologies, rough sets and kleene algebras, Electronic Notes in Theoretical Computer Science, 225, 67-81 (2009) · Zbl 1337.18003 |

[20] | Houston, R., Finite products are biproducts in a compact closed category, Journal of Pure and Applied Algebra, 212, 2, 394-400 (2008) · Zbl 1147.18005 |

[21] | Jaskelioff, M.; Moggi, E., Monad transformers as monoid transformers, Theoretical Computer Science, 411, 4441-4466 (2010) · Zbl 1209.68107 |

[22] | Lambek, J., Diagram chasing in ordered categories with involution, Journal of Pure and Applied Algebra, 143, 13, 293-307 (1999) · Zbl 0954.18001 |

[23] | Li, X.; Yuan, X., The category RSC of I-rough sets, 2008 Fifth International Conference on Fuzzy Systems and Knowledge Discovery. 2008 Fifth International Conference on Fuzzy Systems and Knowledge Discovery, fskd, 1, 448-452 (2008) |

[24] | Lu, J.; Li, S.-G.; Yang, X.-F.; Fu, W.-Q., Categorical properties of \(M\)-indiscernibility spaces, Rough Sets and Fuzzy Sets in Natural Computing, Edited by Andrzej Skowron, Sankar K. Pal and Hung Son Nguyen. Rough Sets and Fuzzy Sets in Natural Computing, Edited by Andrzej Skowron, Sankar K. Pal and Hung Son Nguyen, Theoretical Computer Science, 412, 42, 5902-5908 (2011) · Zbl 1225.03069 |

[25] | Mac Lane, S., (Categories for the Working Matematician. Categories for the Working Matematician, Springer Graduate Text in Mathematics, vol. 5 (1971)) · Zbl 0232.18001 |

[26] | Özçağ, S.; Brown, L. M., A Textural view of the distinction between uniformities and quasi-uniformities, Topology and its Applications, 153, 3294-3307 (2006) · Zbl 1117.54039 |

[27] | Pagliani, P., A pure logic algebraic analysis on rough top and rough bottom equalities, (Ziarko, W. P., Rough Sets, Fuzzy Sets and Knowledge Discovery Proceedings of the International Workshop on Rough Sets and Knowledge Discovery, Banf, October 1993, Vol. 199 (1993), Springer), 225-236 |

[28] | Pawlak, Z., Rough sets, International Journal of Computer and Information Sciences, 341-356 (1982) · Zbl 0501.68053 |

[29] | Pawlak, Z.; Skowron, A., Rudiments of rough sets, Information Sciences, 177, 3-27 (2007) · Zbl 1142.68549 |

[30] | Selinger, P., Dagger compact closed categories and completely positive maps, Electronic Notes in Theoretical Computer Science, 139-163 (2007), 170 Pages · Zbl 1277.18008 |

[31] | Stanculesku, A. E., A quillen model category structure on some categories of comonoids, Journal of Pure and Applied Algebra, 214, 629-633 (2010) · Zbl 1184.55008 |

[32] | Yao, Y., Two views of the theory of rough sets in finite universes, International Journal of Approximation Reasoning, 15, 4, 291-317 (1996) · Zbl 0935.03063 |

[33] | Yao, Y.; Wong, S. K.M.; Lin, T. Y., A review of rough set models, (Lin, T. Y.; Cercone, N., Rough Sets and Data Mining: Analysis for Imprecise Data (1997), Kluwer Academic Publishers: Kluwer Academic Publishers Boston), 47-75 · Zbl 0861.68101 |

[34] | Yao, Y., Constructive and algebraic methods of the theory of rough sets, Information Sciences, 109, 21-47 (1998) · Zbl 0934.03071 |

[35] | Zhu, W., Relationship between generalized rough sets based on binary relation and covering, Information Sciences, 179, 3, 210-225 (2009) · Zbl 1163.68339 |

This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. It attempts to reflect the references listed in the original paper as accurately as possible without claiming the completeness or perfect precision of the matching.