Some properties of the indiscernibility relation in rough sets (Q910403)

We study the theory of indiscernibility relations of the concept of rough sets, first introduced by Pawlak in 1981, and build it on the theory of fuzzy equivalence relations. By an information system we understand a 4- tuple \(F=(U,Q,V,f)\), where U is a finite set of objects, Q is a finite set of attributes, \(V=\cup_{q\in Q}V_ q\), where \(V_ q\) is the domain of attribute q, and f: \(U\times Q\to V\) is an information function. Let G be a fuzzy equivalence relation on \(V_ q\). For any \(x,y\in U\), if G(f(x,q),\(f(y,q))\geq \alpha\), \(\alpha\in (0,1]\), then x and y are \(\alpha\)-th order indiscernible with respect to q, for which we reserve the special notation \(xq^*y\). Let P be a subset of Q; \(x,y\in U\); if we always have \(xq^*y\) for any \(q\in P\), then x and y are indiscernible with respect to P. We express this fact by the notation \(xP^*y.\) According to the definition as above, we discuss the independence of the indiscernibility relation of the subset P of Q on a fuzzy equivalence relation. Meanwhile, we obtained other important results. For example, we proved that the algebraic system (E,\(\vee,\wedge)\), in which \(E=\{P^*|\) \(P\subset Q\}\), is a completely distributive lattice, and the algebraic system (E,0,U\(\times U)\) is a BCK algebra, etc.