The relationship between \(L\)-fuzzy rough set and \(L\)-topology (Q409743): Difference between revisions
From MaRDI portal
Created a new Item |
Changed an Item |
||
Property / review text | |||
There exists a well-known one-to-one correspondence between preordered sets (i.e., sets equipped with a binary relation which is both reflexive and transitive) and Alexandroff topological spaces (i.e., topological spaces whose topologies are closed under arbitrary intersections). More precisely, given a preordered set \((X,\leq)\), the collection of all its upward closed subsets \(A\) (\(x\in A\) and \(x\leq y\) together imply \(y\in A\)) is an Alexandroff topology; conversely, given an Alexandroff topological space \((X,\mathcal{T})\), define \(x\leq y\) if and only if \(x\) lies in the closure of \(y\) (see, e.g., [\textit{M.~Aiello, J.~van Benthem} and \textit{G.~Bezhanishvili}, J. Log. Comput. 13, No. 6, 889--920 (2003; Zbl 1054.03015)] and notice that in case of arbitrary topological spaces, one gets just \(\leq=\leq_{\mathcal{T}_{\leq}}\) and \(\mathcal{T}\subseteq\mathcal{T}_{\leq_{\mathcal{T}}}\)). On the other hand, every Alexandroff topology is completely determined by its corresponding Alexandroff closure (resp. interior) operator (i.e., a closure (resp. interior) operator, which additionally preserves arbitrary unions (resp. intersections)), cf. [\textit{J.~Järvinen}, Lecture Notes in Computer Science 4374. Journal Subline, 400--498 (2007; Zbl 1186.03069)]. These operators stand in one-to-one correspondence to upper (resp. lower) approximations induced on powersets by reflexive and transitive binary relations (preorders). The above approximations in their turn generalize those, which are used in the definition of rough sets of [\textit{Z.~Pawlak}, Int. J. Comput. Inform. Sci. 11, No. 5, 341--356 (1982; Zbl 0501.68053)], and which rely on equivalence relations (add symmetry). The authors of the present manuscript extend the above-mentioned one-to-one correspondence to lattice-valued preorders [\textit{L.~Fan}, ``A new approach to quantitative domain theory'', Electron. Notes Theor. Comput. Sci. 45, 77--87 (2001)] and lattice-valued topological spaces [\textit{J.~A.~Goguen}, J. Math. Anal. Appl. 43, 734--742 (1973; Zbl 0278.54003)], employing generalized lattice-valued rough sets based in residuated lattices of [\textit{A.~M.~Radzikowska} and \textit{E.~E.~Kerre}, Lecture Notes in Computer Science 3135. Journal Subline, 278--296 (2004; Zbl 1109.68118)]. The new framework, however, puts an additional requirement on the involved topologies, i.e., the condition of stratification, which is a modified version of the concept of [\textit{R.~Lowen}, J. Math. Anal. Appl. 56, 621--633 (1976; Zbl 0342.54003)] (topologies include all constant maps). | |||
Property / review text: There exists a well-known one-to-one correspondence between preordered sets (i.e., sets equipped with a binary relation which is both reflexive and transitive) and Alexandroff topological spaces (i.e., topological spaces whose topologies are closed under arbitrary intersections). More precisely, given a preordered set \((X,\leq)\), the collection of all its upward closed subsets \(A\) (\(x\in A\) and \(x\leq y\) together imply \(y\in A\)) is an Alexandroff topology; conversely, given an Alexandroff topological space \((X,\mathcal{T})\), define \(x\leq y\) if and only if \(x\) lies in the closure of \(y\) (see, e.g., [\textit{M.~Aiello, J.~van Benthem} and \textit{G.~Bezhanishvili}, J. Log. Comput. 13, No. 6, 889--920 (2003; Zbl 1054.03015)] and notice that in case of arbitrary topological spaces, one gets just \(\leq=\leq_{\mathcal{T}_{\leq}}\) and \(\mathcal{T}\subseteq\mathcal{T}_{\leq_{\mathcal{T}}}\)). On the other hand, every Alexandroff topology is completely determined by its corresponding Alexandroff closure (resp. interior) operator (i.e., a closure (resp. interior) operator, which additionally preserves arbitrary unions (resp. intersections)), cf. [\textit{J.~Järvinen}, Lecture Notes in Computer Science 4374. Journal Subline, 400--498 (2007; Zbl 1186.03069)]. These operators stand in one-to-one correspondence to upper (resp. lower) approximations induced on powersets by reflexive and transitive binary relations (preorders). The above approximations in their turn generalize those, which are used in the definition of rough sets of [\textit{Z.~Pawlak}, Int. J. Comput. Inform. Sci. 11, No. 5, 341--356 (1982; Zbl 0501.68053)], and which rely on equivalence relations (add symmetry). The authors of the present manuscript extend the above-mentioned one-to-one correspondence to lattice-valued preorders [\textit{L.~Fan}, ``A new approach to quantitative domain theory'', Electron. Notes Theor. Comput. Sci. 45, 77--87 (2001)] and lattice-valued topological spaces [\textit{J.~A.~Goguen}, J. Math. Anal. Appl. 43, 734--742 (1973; Zbl 0278.54003)], employing generalized lattice-valued rough sets based in residuated lattices of [\textit{A.~M.~Radzikowska} and \textit{E.~E.~Kerre}, Lecture Notes in Computer Science 3135. Journal Subline, 278--296 (2004; Zbl 1109.68118)]. The new framework, however, puts an additional requirement on the involved topologies, i.e., the condition of stratification, which is a modified version of the concept of [\textit{R.~Lowen}, J. Math. Anal. Appl. 56, 621--633 (1976; Zbl 0342.54003)] (topologies include all constant maps). / rank | |||
Normal rank | |||
Property / reviewed by | |||
Property / reviewed by: Sergey A. Solovyov / rank | |||
Normal rank | |||
Property / Mathematics Subject Classification ID | |||
Property / Mathematics Subject Classification ID: 54A40 / rank | |||
Normal rank | |||
Property / Mathematics Subject Classification ID | |||
Property / Mathematics Subject Classification ID: 03E72 / rank | |||
Normal rank | |||
Property / Mathematics Subject Classification ID | |||
Property / Mathematics Subject Classification ID: 06F05 / rank | |||
Normal rank | |||
Property / Mathematics Subject Classification ID | |||
Property / Mathematics Subject Classification ID: 06A75 / rank | |||
Normal rank | |||
Property / Mathematics Subject Classification ID | |||
Property / Mathematics Subject Classification ID: 08A72 / rank | |||
Normal rank | |||
Property / zbMATH DE Number | |||
Property / zbMATH DE Number: 6024194 / rank | |||
Normal rank | |||
Property / zbMATH Keywords | |||
Alexandrov (\(L\)-)topology | |||
Property / zbMATH Keywords: Alexandrov (\(L\)-)topology / rank | |||
Normal rank | |||
Property / zbMATH Keywords | |||
(complete) \(L\)-lattice | |||
Property / zbMATH Keywords: (complete) \(L\)-lattice / rank | |||
Normal rank | |||
Property / zbMATH Keywords | |||
fuzzy Galois connection | |||
Property / zbMATH Keywords: fuzzy Galois connection / rank | |||
Normal rank | |||
Property / zbMATH Keywords | |||
\(L\)-fuzzy approximation space | |||
Property / zbMATH Keywords: \(L\)-fuzzy approximation space / rank | |||
Normal rank | |||
Property / zbMATH Keywords | |||
\(L\)-(pre)ordered set | |||
Property / zbMATH Keywords: \(L\)-(pre)ordered set / rank | |||
Normal rank | |||
Property / zbMATH Keywords | |||
\(L\)-relation | |||
Property / zbMATH Keywords: \(L\)-relation / rank | |||
Normal rank | |||
Property / zbMATH Keywords | |||
(\(L\)-)rough set | |||
Property / zbMATH Keywords: (\(L\)-)rough set / rank | |||
Normal rank | |||
Property / zbMATH Keywords | |||
\(L\)-set | |||
Property / zbMATH Keywords: \(L\)-set / rank | |||
Normal rank | |||
Property / zbMATH Keywords | |||
residuated lattice | |||
Property / zbMATH Keywords: residuated lattice / rank | |||
Normal rank | |||
Property / zbMATH Keywords | |||
(stratified) \(L\)-topological space | |||
Property / zbMATH Keywords: (stratified) \(L\)-topological space / rank | |||
Normal rank |
Revision as of 19:18, 29 June 2023
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | The relationship between \(L\)-fuzzy rough set and \(L\)-topology |
scientific article |
Statements
The relationship between \(L\)-fuzzy rough set and \(L\)-topology (English)
0 references
13 April 2012
0 references
There exists a well-known one-to-one correspondence between preordered sets (i.e., sets equipped with a binary relation which is both reflexive and transitive) and Alexandroff topological spaces (i.e., topological spaces whose topologies are closed under arbitrary intersections). More precisely, given a preordered set \((X,\leq)\), the collection of all its upward closed subsets \(A\) (\(x\in A\) and \(x\leq y\) together imply \(y\in A\)) is an Alexandroff topology; conversely, given an Alexandroff topological space \((X,\mathcal{T})\), define \(x\leq y\) if and only if \(x\) lies in the closure of \(y\) (see, e.g., [\textit{M.~Aiello, J.~van Benthem} and \textit{G.~Bezhanishvili}, J. Log. Comput. 13, No. 6, 889--920 (2003; Zbl 1054.03015)] and notice that in case of arbitrary topological spaces, one gets just \(\leq=\leq_{\mathcal{T}_{\leq}}\) and \(\mathcal{T}\subseteq\mathcal{T}_{\leq_{\mathcal{T}}}\)). On the other hand, every Alexandroff topology is completely determined by its corresponding Alexandroff closure (resp. interior) operator (i.e., a closure (resp. interior) operator, which additionally preserves arbitrary unions (resp. intersections)), cf. [\textit{J.~Järvinen}, Lecture Notes in Computer Science 4374. Journal Subline, 400--498 (2007; Zbl 1186.03069)]. These operators stand in one-to-one correspondence to upper (resp. lower) approximations induced on powersets by reflexive and transitive binary relations (preorders). The above approximations in their turn generalize those, which are used in the definition of rough sets of [\textit{Z.~Pawlak}, Int. J. Comput. Inform. Sci. 11, No. 5, 341--356 (1982; Zbl 0501.68053)], and which rely on equivalence relations (add symmetry). The authors of the present manuscript extend the above-mentioned one-to-one correspondence to lattice-valued preorders [\textit{L.~Fan}, ``A new approach to quantitative domain theory'', Electron. Notes Theor. Comput. Sci. 45, 77--87 (2001)] and lattice-valued topological spaces [\textit{J.~A.~Goguen}, J. Math. Anal. Appl. 43, 734--742 (1973; Zbl 0278.54003)], employing generalized lattice-valued rough sets based in residuated lattices of [\textit{A.~M.~Radzikowska} and \textit{E.~E.~Kerre}, Lecture Notes in Computer Science 3135. Journal Subline, 278--296 (2004; Zbl 1109.68118)]. The new framework, however, puts an additional requirement on the involved topologies, i.e., the condition of stratification, which is a modified version of the concept of [\textit{R.~Lowen}, J. Math. Anal. Appl. 56, 621--633 (1976; Zbl 0342.54003)] (topologies include all constant maps).
0 references
Alexandrov (\(L\)-)topology
0 references
(complete) \(L\)-lattice
0 references
fuzzy Galois connection
0 references
\(L\)-fuzzy approximation space
0 references
\(L\)-(pre)ordered set
0 references
\(L\)-relation
0 references
(\(L\)-)rough set
0 references
\(L\)-set
0 references
residuated lattice
0 references
(stratified) \(L\)-topological space
0 references