×

The properties of residuated connections and Alexandrov topologies. (English) Zbl 1450.54005

Given partially ordered sets (posets for short) \(S\) and \(T\), a pair \((g,f)\) of maps \(g:S\rightarrow T\) and \(f:T\rightarrow S\) is called a Galois connection or an adjunction between \(S\) and \(T\) provided that \(f(t)\leqslant s\) if and only if \(t\leqslant g(s)\) for every \(t\in T\) and every \(s\in S\) (see, e.g., [G. Gierz et al., Continuous lattices and domains. Cambridge: Cambridge University Press (2003; Zbl 1088.06001)] for more detail). Moreover, given a set \(X\), a map \(a:X\times X\rightarrow[0,+\infty]\) is called a metric provided that the following two properties hold: (1) \(a(x,z)\leqslant a(x,y)+a(y,z)\) for every \(x,y,z\in X\); (2) \(a(x,x)=0\) for every \(x\in X\) (see, e.g., [D. Hofmann (ed.) et al., Monoidal topology. A categorical approach to order, metric, and topology. Cambridge: Cambridge University Press (2014; Zbl 1297.18001)] for more detail and notice that the definition skips some properties of the classical metrics of, e.g., [R. Engelking, General topology. Rev. and compl. ed. Berlin: Heldermann Verlag (1989; Zbl 0684.54001)]). The pair \((X,a)\) is then called a metric space. Lastly, there exists the concept of Alexandroff topology, i.e., a topology, in which arbitrary (and not just finite) intersections of open sets are open. In particular, given a poset \((S,\leqslant)\), the classical Alexandroff topology on the set \(S\) is generated by the down-sets \(\downarrow s=\{s^{\prime}\in S\,|\,s^{\prime}\leqslant s\}\) for \(s\in S\) (see, e.g., the above-mentioned “Monoidal Topology” of Hofmann et al. for more detail).
The present paper replaces posets \(S\) and \(T\) in the above with metric spaces \((X,a)\) and \((Y,b)\) respectively, introducing thus the concept of residuated connection in the following way. Given metric spaces \((X,a)\) and \((Y,b)\), and maps \(f:X\rightarrow Y\) and \(g:Y\rightarrow X\), the quadruple \((a,f,g,b)\) is called a residuated connection provided that \(b(f(x),y)=a(x,g(y))\) for every \(x\in X\) and every \(y\in Y\). The paper then considers a suitable lattice-valued analogue of Alexandroff topology, and studies relationships between lattice-valued Alexandroff topologies and metrics (in the above sense). More precisely, the authors construct a lattice-valued Alexandroff topology from a metric and vice versa.
The paper is well written, contains most of its required preliminaries, is quite easy to read, and will be of interest to all those researchers, who study lattice-valued topology or partial orders. Its main deficiency is total lack of discussions of the obtained results and somewhat obscured motivation of the authors in general (for example, almost the whole introductory section deals with the concept of rough set of [Z. Pawlak, Int. J. Comput. Inform. Sci. 11, 341–356 (1982; Zbl 0501.68053)], which is then never used in the rest of the paper). Additionally, the condition defining Alexandroff topology at the very beginning of Theorem 3.7 on page 315 is not clear.

MSC:

54A40 Fuzzy topology
06A15 Galois correspondences, closure operators (in relation to ordered sets)
06A75 Generalizations of ordered sets
54E35 Metric spaces, metrizability
54F05 Linearly ordered topological spaces, generalized ordered spaces, and partially ordered spaces
PDF BibTeX XML Cite
Full Text: DOI

References:

[1] R. Bˇelohl ́avek, Fuzzy Relational Systems, Kluwer Academic Publishers, New York, 2002.
[2] T.S. Blyth, M.F. Janovitz, Residuation Theory, Pergamon Press, New York, 1972.
[3] Y.C. Kim, Join-meet preserving maps and fuzzy preorders, Journal of Intelligent & Fuzzy Systems 28(2015), 1089-1097. · Zbl 1351.06001
[4] Y.C. Kim, Categories of fuzzy preorders, approximation operators and Alexandrov topologies, Journal of Intelligent & Fuzzy Systems 31 (2016), 1787-1793. · Zbl 1366.18004
[5] H. Lai, D. Zhang, Fuzzy preorder and fuzzy topology, Fuzzy Sets and Systems 157 (2006), 1865-1885. · Zbl 1118.54008
[6] Z.M. Ma, B.Q. Hu, Topological and lattice structures of L-fuzzy rough set determined by lower and upper sets, Inf. Sci. 218 (2013), 194-204. · Zbl 1293.03025
[7] E. Orlowska,I. Rewitzky, Context algebras, context frames and their discrete duality, Transactions on Rough Sets IX, Springer, Berlin, 2008, 212-229. · Zbl 1194.68214
[8] E. Orlowska, I. Rewitzky Algebras for Galois-style connections and their discrete duality, Fuzzy Sets and Systems, 161 (2010), 1325-1342. · Zbl 1195.03059
[9] Z. Pawlak, Rough sets, Internat. J. Comput. Inform. Sci. 11 (1982), 341-356. · Zbl 0501.68053
[10] Z. Pawlak, Rough sets: Theoretical Aspects of Reasoning about Data, System Theory, Knowledge Engineering and Problem Solving, Kluwer Academic Publishers, Dordrecht, The Netherlands (1991).
[11] A. M. Radzikowska, E.E. Kerre, A comparative study of fuzy rough sets, Fuzzy Sets and Systems, 126 (2002), 137-155. · Zbl 1004.03043
[12] Y.H. She, G.J. Wang, An axiomatic approach of fuzzy rough sets based on residuated lattices, Computers and Mathematics with Applications, 58 (2009), 189-201. · Zbl 1189.03059
[13] M. Ward, R.P. Dilworth, Residuated lattices, Trans. Amer. Math. Soc. 45 (1939), 335-354,
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.