We introduce the concepts of Alexandrov L-fuzzy pre-uniformities in complete residuated lattices. We obtain Alexandrov L-fuzzy topologies, L-lower approximation operators and L-upper approximation operators induced by Alexandrov L-fuzzy pre-uniformities. Conversely, we obtain Alexandrov L-fuzzy pre-uniformities induced by L-lower approximation operators and L-upper approximation operators.
Pawlak [12, 13] introduced the rough set theory as a formal tool to deal with imprecision and uncertainty in the data analysis. This theory was extended and applied in many directions [9, 21].
Ward et al. [19] introduced a complete residuated lattice which is an algebraic structure for many valued logic. It is an important mathematical tool as algebraic structures for many valued logics [1–9, 14–18]. For an extension of classical rough sets, many researchers [5, 17] developed L-lower and L-upper approximation operators in complete residuated lattices. By using this concepts, information systems and decision rules were investigated in complete residuated lattices [1, 9]. Čimoka [2] and Ramadan [15, 16] investigated the relationships between L-fuzzy quasi-uniformities and L-fuzzy topologies in complete residuated lattices.
An interesting and natural research topic in rough set theory is the study of rough set theory and topology. Ma [11] investigated the topological and lattice structures of L-fuzzy rough sets determined by lower and upper sets. Kim [7] studied the relations between L-fuzzy upper and lower approximation spaces and L-fuzzy quasi-uniform spaces in a strictly two-sided, commutative quantale. He [5, 6] investigated the properties of L-lower and L-upper approximate operators and Alexandrov L-fuzzy topologies in complete residuated lattices.
In this paper, we introduce the concepts of Alexandrov L-fuzzy pre-uniformities in complete residuated lattices, which are unified approaches to the following three structures: L-lower approximation operators, L-upper approximation operators and Alexandrov L-fuzzy topologies. We obtain Alexandrov L-fuzzy topologies, L-lower approximation operators and L-upper approximation operators induced by Alexandrov L-fuzzy pre-uniformities (see Theorems 3.7, 3.11 and 3.12). Conversely, we obtain Alexandrov L-fuzzy pre-uniformities induced by L-lower approximation operators and L-upper approximation operators (see Theorems 4.1 and 4.3). Moreover, we investigate their relations and give examples.
Preliminaries
Definition 2.1. [1, 18] An algebra (L, ∧, ∨, ⊙, →, ⊥, ⊤) is called a complete residuated lattice if
(L, ≤, ∨, ∧, ⊥, ⊤) is a complete lattice with the greatest element ⊤ and the least element ⊥,
(L, ⊙, ⊤) is a commutative monoid, and
x ⊙ y ≤ z iff x ≤ y → z for x, y, z ∈ L.
In this paper, we assume that (L, ≤, ⊙, →, ∗) is a complete residuated lattice with an order reversing involution ∗ where x∗ = x→ ⊥.
For α ∈ L, f ∈ LX, we denote (α → f), (α ⊙ f), αX ∈ LX as (α → f) (x) = α → f (x), (α ⊙ f) (x) = α ⊙ f (x), αX (x) = α,
Lemma 2.2.[1, 18] For each x, y, z, xi, yi, w ∈ L, the following hold.
⊤ → x = x, ⊥ ⊙ x = ⊥ .
If y ≤ z, then x ⊙ y ≤ x ⊙ z, x → y ≤ x → z and z → x ≤ y → x.
x ≤ y iff x→ y = ⊤.
x → (⋀ iyi) = ⋀ i (x → yi).
(⋁ ixi) → y = ⋀ i (xi → y).
x ⊙ (⋁ iyi) = ⋁ i (x ⊙ yi).
(x ⊙ y) → z = x → (y → z) = y → (x → z).
x → y ≤ (x ⊙ z) → (y ⊙ z) and (x → y) ⊙ (y → z) ≤ x → z.
x → y = y* → x*.
z → x ≤ (x → y) → (z → y) and y → z ≤ (x → y) → (x → z).
Definition 2.3. [1, 8] Let X be a set. A map R : X × X → L is called an L-fuzzy preorder if
R (x, x) =⊤ for all x ∈ X (reflexive), and
R (x, y) ⊙ R (y, z) ≤ R (x, z) for all x, y, z ∈ X (transitive).
Lemma 2.4.[1, 8] For a given set X, define a map S : LX × LX → L by
Then, for each f, g ∈ LX and for each α ∈ L, the following hold.
S is an L-fuzzy preorder on LX.
f ≤ g iff S (f, g) =⊤.
Definition 2.5. [5] A map is called an L-lower approximation operator on X if
,
for all f ∈ LX,
for all fi ∈ LX, and
.
An L-lower approximation operator is called topological if (T) for all f ∈ LX.
Definition 2.6. [5] A map is called an L-upper approximation operator on X if
,
for all f ∈ LX,
for all fi ∈ LX, and
.
An L-upper approximation operator is called topological if (T) , for all f ∈ LX.
Let and be an L-upper and L-lower approximation on X, respectively. The pair is called a fuzzy rough set for f.
Definition 2.7. [5, 8] A map is called an Alexandrov L-fuzzy topology on X if
,
and for all {fi} i∈Γ ⊆ LX, and
and for all α ∈ L and f ∈ LX.
Alexandrov L-fuzzy pre-uniformities
Lemma 3.1.For each f, g ∈ LX, define two maps by u[f,g] (x, y) = f (x) → g (y) and . Then, the following hold.
⊤X×X = u[⊥X,⊥X] = u[⊤X,⊤X] .
If f2 ≤ f1 and g1 ≤ g2, then u[f1,g1] ≤ u[f2,g2] .
For any u[f,g] ∈ LX×X and h ∈ LX, it holds that u[f,h] ∘ u[h,g] ≤ u[f,g] where u[f,h] (x, y) ∘ u[h,g] (y, z) = ⋁ y∈X ((f (x) → h (y)) ⊙ (h (y) → g (z))) .
u[⋁i∈Γfi,g] = ⋀ i∈Γu[fi,g] and u[f,⋀i∈Γgi] = ⋀ i∈Γu[f,gi].
u[α⊙f,g] = α → u[f,g] and u[f,α→g] = α → u[f,g].
u[α⊙f,α⊙g] ≥ u[f,g] and u[α→f,α→g] ≥ u[f,g].
u[f,g] = ⋀ z∈X (f (z) → u[⊤z,g]) and
.
Proof. (1) and (2) can be easily proved.
(3) By Lemma 2.2(8), we have
(4) It follows from Lemma 2.2 (4) and (5).
(5) By Lemma 2.2 (7), we have u[α⊙f,g] (x, y) = α ⊙ f (x) → g (x) = α → (f (x) → g (y)) = α → u[f,g] (x, y). u[f,α→g] (x, y) = f (x) → (α → g (y)) = α → (f (x) → g (y)) = α → u[f,g] (x, y) .
(6) It follows from Lemma 2.2 (8) and (10).
(7) Since f = ⋁ z∈X (f (z) ⊙ ⊤ z), we have by (4) and (5) that
Since , we have by (4) and (5) that
(8) Since f = ⋁ z∈X (f (z) ⊙ ⊤ z) and , we have by (7) that
(9) By Lemma 2.2(9), we have
Definition 3.2. A map is called an Alexandrov L-fuzzy pre-uniformity on X if
there exists u ∈ LX×X with ,
if v ≤ u, then ,
for every ui ∈ LX×X, ,
for each f, g ∈ LX,
for each α ∈ L,
An Alexandrov L-fuzzy pre-uniformity is called an Alexandrov L-fuzzy quasi-uniformity on X if
(AQ) where v ∘ w (x, z) = ⋁ y∈X (v (x, y) ⊙ w (y, z)).
Remark 3.3. Let be an L-fuzzy pre-uniformity on X. Since u ≤ ⊤ X×X for all u ∈ LX×X, we have by (AU1) and (AU2) that .
Theorem 3.4.Let be an Alexandrov L-fuzzy pre-uniformity on X. Define a map as
Then, the following hold:
is an Alexandrov L-fuzzy pre-uniformity on X.
If is an Alexandrov L-fuzzy quasi-uniformity on X, then is an Alexandrov L-fuzzy quasi-uniformity on X.
There exists a reflexive L-fuzzy relation with
There exists a reflexive L-fuzzy relation such that
There exists a reflexive L-fuzzy relation with
Proof. (1) (AU1), (AU2) and (AU3) can be easily proved.
(AU4) For all f, g ∈ LX, we have
(AU5) For all α ∈ L and u ∈ LX×X,
Hence is an Alexandrov L-fuzzy pre-uniformity on X.
(2) (AQ) For all u ∈ LX×X,
(3) Since f = ⋁ x∈X (f (x) ⊙ ⊤ x) and , we have by Lemma 3.1(8) that . Now, by (AU3) and (AU5), we have
(4) Let . By (AU4),
(5) By (4), Thus,
(6) Since , we have Let Thus,
Example 3.5. Let R ∈ LX×X be a reflexive fuzzy relation. Define a map as
Then (AU1), (AU2), (AU3) and (AU5) can be easily proved. (AU4) For all f, g ∈ LX,
Hence is an Alexandrov L-fuzzy pre-uniformity on X. We obtain as
Theorem 3.6.(1) Let be an L-lower approximation operator. Define as . Then is an L-upper approximation operator.
(2) Let be an L-upper approximation operator. Define as . Then is an L-lower approximation operator.
(3) Let be an Alexandrov L-fuzzy topology. Define as . Then is an Alexandrov L-fuzzy topology.
Proof. (1) For f ∈ LX and α ∈ L, we have and The remaining can be proved by a similar way.
Theorem 3.7.Let be an Alexandrov L-fuzzy pre-uniformity on X. Define a map as
Then is an Alexandrov L-fuzzy topology with .
Proof. (AT1) and .
(AT2) By Lemma 3.1(4), we have and
(AT3) By Lemma 3.1(6), we have and Hence, is an Alexandrov L-fuzzy topology on X. Moreover,
Example 3.8. Consider R and defined in Example 3.5. By Theorem 3.7, we obtain two Alexandrov L-fuzzy topologies where and
Theorem 3.9.[5] Let be an L-upper approximation space. Define a map by:
Then is an Alexandrov L-fuzzy topology on X with where for all f ∈ LX.
Corollary 3.10.[5] Let be an L-lower approximation space. Define a map by:
Then is an Alexandrov L-fuzzy topology on X.
Theorem 3.11.Let be an Alexandrov L-fuzzy preuniformity on X. Define a map as
Then, the following hold:
is an L-lower approximation operator on X.
.
If then is a topological L-lower approximation operator on X.
for all f ∈ LX.
for all f ∈ LX, and .
There exists a reflexive L-fuzzy relation with Moreover, there exists a reflexive L-fuzzy relation such that
for all f, g ∈ LX.
Proof. (1) (J1) Since , we have
(J2) By (AU4), we have
(J3) By Lemma 3.1 (4), we have
(J4) By Lemma 3.1(5) and (AU5), we have
(2) For x ∈ X,
(3) By (2), If , then Since , we have
(4) By Corollary 3.10, we have
(5) For f ∈ LX and x ∈ X, we have
(6) Since , we have by Lemma 3.1(4,5) and (AU3,5) that
Let . Then, we have by (2) that is reflexive and
Moreover, such that
(7) By Lemma 3.1(4,5) and (AU3,5), we have
Theorem 3.12.Let be an Alexandrov L-fuzzy pre-uniformity on X. Define a map as
Then, the following hold:
is an L-upper approximation operator on X.
If then is a topological L-upper approximation operator on X.
for all f ∈ LX.
for all f ∈ LX.
for all f ∈ LX.
There exists a reflexive L-fuzzy relation with Moreover, there exists a reflexive L-fuzzy relation such that
for all f, g ∈ LX.
Proof. {(1) (H1) Since , we have
(H2) By (AU4), we have
(H3) By Lemma 3.1(4), we have
(H4) By Lemma 3.1(5) and (AU5), we have
Hence is an L-upper approximation operator on X.
(2) Since , wehave by the assumption that Since , we have
(3) By Lemma 3.1(9), we have
(4) It can be proved by a similar method as in the proof of (3).
(5) By (AU3) and (AU5), we have
(6) By Lemma 3.1, (AU3) and (AU5), we have
Let . Then
Moreover, such that
(7) By (AU3) and (AU5), we have
Remark 3.13. From Theorems 3.11 and 3.12, a given Alexandrov L-fuzzy pre-uniformity , we can obtain a fuzzy rough set where and for f ∈ LX.
Example 3.14. Consider R and defined in Example 3.5. By Theorem 3.11, we obtain L-lower approximation operators where and Since , we have by Theorem 3.11(3) that if R is transitive, then and are topological.
By Theorem 3.12, we obtain L-upper approximation operators where and Since , we have by Theorem 3.12(2) that if R is transitive, then and are topological.
Alexandrov L-fuzzy pre-uniform spaces induced by approximation operators
Theorem 4.1.Let L be a complete residuated lattice where L is a totally order satisfying x → ⋁ i∈Γyi = ⋁ i∈Γ (x → yi) and x ∧ y = x ⊙ (x → y) for all x, y, yi ∈ L. Let be an L-lower approximation space. Define a map by
Then, the following hold:
is an Alexandrov L-fuzzy pre-uniformity with
Moreover, with =⊥.
. Moreover, the equality holds if is topological.
If is topological, then is an Alexandrov L-fuzzy quasi-uniformity on X.
.
for all f ∈ LX.
If is an Alexandrov L-fuzzy pre-uniformity on X, then for all f, g ∈ LX.
Proof. (1) (AU1) and (AU2) are easily proved.
(AU3) Suppose there exists ui ∈ LX×X such that
For each i ∈ Γ, there exist u[fi,gi] ≤ ui such that
For each i ∈ Γ, there exist ji, ki ∈ Γ with (fji = fi and u[fji,gi] ≤ ui) or (gji = gi and u[fi,gki] ≤ ui) such that J = {ji ∣ i ∈ Γ}, K = {ki ∣ i ∈ Γ}, J ∪ K = Γ and
On the other hand, since u[⋁ji∈Jfji,⋀ki∈Kgki] = ⋀ i∈Γu[fi,gi] ≤ ⋀ i∈Γui, we have
This is a contradiction. Hence we have Now, by (AU2), we have
(AU4) Since , we have
(AU5) For u ∈ LX×X and α ∈ L, we have
Conversely, first we show . For u = ⊤ X×X, since , we have . Hence
If u ≠ ⊤ X×X, then
Since α → u[f,g] ≤ α → α ⊙ u ⇔ α ⊙ (α → u[f,g]) = α ∧ u[f,g] ≤ α ⊙ u and L is a totally order, we have that if u ≠ ⊤ X×X, then α ∧ u[f,g] = u[f,g]. Thus
Since , we have . Thus . Hence is an Alexandrov L-fuzzy pre-uniformity on X.
For ,
(2) Note that for any f, g, h ∈ LX,
Hence .
If is topological, then
(3) Suppose that there exists u ∈ LX×X such that
By the definition of , there exists u[f,g] ≤ u such that Since and u[f,h] ∘ u[h,g] ≤ u[f,g] ≤ u, we have by (2) that
This is a contradiction. Hence
(4) and (5) can be deduced from:
(6) By (AU3) and (AU4), we have
Remark 4.2. [18] If L is a continuous BL-algebra and totally order, then L satisfies the condition of Theorem 4.1.
Theorem 4.3.Let L be a complete residuated lattice where L is a totally order satisfying x → ⋁ i∈Γyi = ⋁ i∈Γ (x → yi) and x ∧ y = x ⊙ (x → y) for all x, y, yi ∈ L. Let be an L-upper approximation space. Define a map by
Then, the following hold:
is an Alexandrov L-fuzzy pre-uniformity such that
Moreover, with
. The equality holds if is topological.
If is topological, then is an Alexandrov L-fuzzy quasi-uniformity on X.
.
for all f ∈ LX.
Define an operator with as
Then is an L-lower approximation space with
Define an operator as Then is an L-lower approximation space with
If is an Alexandrov L-fuzzy pre-uniformity on X, then for all f, g ∈ LX.
Proof. (1) (AU1) and (AU2) are proved from the definition of .
(AU3) Suppose that there exists ui ∈ LX×X such that
For each i ∈ Γ, there exist u[fi,gi] ≤ ui with For each i ∈ Γ, there exist ji, ki ∈ Γ with (fji = fi and u[fji,gi] ≤ ui) or (gji = gi and u[fi,gki] ≤ ui) such that J = {ji ∣ i ∈ Γ}, K = {ki ∣ i ∈ Γ}, J ∪ K = Γ and
On the other hand, since u[⋁ji∈Jfji,⋀ki∈Kgki] = ⋀ i∈Γu[fi,gi] ≤ ⋀ i∈Γui, we have
This is a contradiction. Thus By (AU2),
(AU4) Since , we have by Lemma 2.2(2) that
(AU5) For α ∈ L and u ∈ LX×X, we have
First we show .
Case 1: u = ⊤ X×X. Since , we have . Hence
Case 2: u ≠ ⊤ X×X. Note that
Since α → u[f,g] ≤ α → α ⊙ u ⇔ α ⊙ (α → u[f,g]) = α ∧ u[f,g] ≤ α ⊙ u and L is a totally order, we have that if u ≠ ⊤ X×X, then α ∧ u[f,g] = u[f,g]. Thus,
Since we have . Thus . Hence is an Alexandrov L-fuzzy pre-uniformity on X.
For f = ⋀ x∈X (f (x) ⊙ ⊤ x),
Moreover, and
(2) For f, g, h ∈ LX,
Hence .
If is topological, then
(3) It can be proved in the similar way as in the proof of Theorem 4.1 (3).
(4) For f ∈ LX and x ∈ X, we have
(5)
(6) (J1) .
(J2) For f ∈ LX and z ∈ X, we have
(J3) For fi ∈ LX, i ∈ Γ and z ∈ X, we have
(J4) For α ∈ L, f ∈ LX and z ∈ X, we have
Hence is an L-lower approximation space. Moreover,
(7) For f, g ∈ LX, we have
(8) For f, g ∈ LX, we have
Example 4.4. Let ([0, 1], ⊙, →, *, 0, 1) be a complete residuated lattice (Ref. [1, 18]) where x ⊙ y = max {0, x + y - 1}, x → y = min {1 - x + y, 1} and x* = 1 - x .
Let X = {xi ∣ i = {1, 2, 3}} where xi (i = 1, 2, 3) are houses. Let fe, fb : X → [0, 1] be the two graded functions defined as
We call e and b as expensive and beautiful house. Then (X, AT = {e, b}, {fe, fb}) is an information system where AT is a set of attributes (see [1, 14]). Define a reflexive relation R ∈ [0, 1] X×X as
Then R is a [0, 1]-fuzzy preorder as
(1) By Example 3.5, we obtain an Alexandrov [0, 1]-fuzzy pre-uniformity as
where S is an L-fuzzy preorder on [0, 1] X×X in Lemma 2.4. If R (x, y) ≤ u (x, y) for all x, y ∈ X, then . Define u ∈ [0, 1] X×X as
Then
(2) For f ∈ [0, 1] X with f (x1) =0.6, f (x2) =0.8 and f (x3) =0.3, we have
We can obtain a fuzzy rough set with and an Alexandrov [0, 1]-fuzzy topology for f ∈ [0, 1] X.
(3) By Theorems 3.11(6) and 3.12(6), , and so
Since ([0, 1], ⊙) is a continuous t-norm, we have x → ⋁ i∈Γyi = ⋁ i∈Γ (x → yi). Moreover, x ∧ y = x ⊙ (x → y) by Theorems 4.1 and 4.3, we obtain
Conclusion
In this paper, Alexandrov L-fuzzy pre-uniformities in complete residuated lattices are investigated. From a given Alexandrov L-fuzzy pre-uniformity , we can obtain a fuzzy rough set where and for f ∈ LX (see Theorems 3.11 and 3.12). Moreover, we obtain an Alexandrov fuzzy topology with (see Theorem 3.7). Conversely, for given L-lower approximation operator and L-upper approximation operator , we obtain Alexandrov L-fuzzy pre-uniformities and , respectively (see Theorems 4.1 and 4.3).
It might be interesting to note that the concepts of Alexandrov L-fuzzy pre-uniformities can be applied to formal concept analysis, topological structures and decision-making systems.
References
1.
BělohlávekR., Fuzzy Relational Systems, Kluwer Academic Publishers, New York, 2002.
2.
ČimokaD. and
ŠostakA.P., L-fuzzy syntopogenous structures, Part I: Fundamentals and application to L-fuzzy topologies, L-fuzzy proximities and L-fuzzy uniformities, Fuzzy Sets and Systems232 (2013), 74–97.
3.
HájekP., Metamathematices of Fuzzy Logic, Kluwer Academic Publishers, Dordrecht, 1998.
4.
HöhleU. and RodabaughS.E., Mathematics of Fuzzy Sets, Logic, Topology and Measure Theory, The Handbooks of Fuzzy Sets Series, Kluwer Academic Publishers, Dordrecht, 1999.
5.
KimY.C., Join preserving maps, fuzzy preorders and Alexandrov fuzzy topologies, International Journal of Pure and Applied Mathematics92(5) (2014), 703–718.
6.
KimY.C., Join-meet preserving maps and Alexandrov fuzzy topologies, Journal of Intelligent and Fuzzy Systems28 (2015), 457–467.
7.
KimY.C. and KimY.S., L-approximation spaces and L-fuzzy quasi-uniform spaces, Information Sciences179 (2009), 2028–2048.
8.
LaiH. and ZhangD., Fuzzy preorder and fuzzy topology, Fuzzy Sets and Systems157 (2006), 1865–1885.
9.
LaiH. and ZhangD., Concept lattices of fuzzy contexts: Formal concept analysis vs. rough set theory, Int J Approx Reasoning50 (2009), 695–707.
10.
MaX., LiuQ. and ZhanJ., A survey of decision making methods based on certain hybrid soft set models, Artificial Intelligence Review47 (2017), 507–530.
11.
MaZ.M. and HuB.Q., Topological and lattice structures of Lfuzzy rough set determined by lower and upper sets, Information Sciences218 (2013), 194–204.
PawlakZ., Rough sets: Theoretical Aspects of Reasoning about Data, System Theory, Knowledge Engineering and Problem Solving, Kluwer Academic Publishers, Dordrecht, The Netherlands, 1991.
14.
RadzikowskaA.M. and KerreE.E., A comparative study of fuzy rough sets, Fuzzy Sets and Systems126 (2002), 137–155.
15.
RamadanA.A., ElkordyE.H. and KimY.C., Perfect L-fuzzy topogenous spaces, L-fuzzy quasi-proximities and L-fuzzy quasiuniform spaces, J of Intelligent and Fuzzy Systems28 (2015), 2591–2604.
16.
RamadanA.A., ElkordyE.H. and KimY.C., Relationships between L-fuzzy quasi-uniform structures and L-fuzzy topologies, J of Intelligent and Fuzzy Systems28 (2015), 2319–2327.
17.
SheY.H. and WangG.J., An axiomatic approach of fuzzy rough sets based on residuated lattices, Computers and Mathematics with Applications58 (2009), 189–201.
18.
TurunenE., Mathematics Behind Fuzzy Logic, A Springer-Verlag Co, Heidelberg, 1999.
19.
WardM. and DilworthR.P., Residuated lattices, Trans Amer Math Soc45 (1939), 335–354.
20.
YaoY.Y., Constructive and algebraic methods of theory of rough sets, Information Sciences109 (1998), 21–47.
21.
ZhanJ., LiuQ. and HerawanT., A novel soft rough set; soft rough hermirings and its multicriteria group decision making, Applied Soft Computing54 (2017), 393–402.