Pointwise pseudo-metrics in \(L\)-fuzzy set theory (Q5947570)

In 1977, \textit{B. Hutton} [J. Math. Anal. Appl. 58, 559-571 (1977; Zbl 0358.54008)] introduced a theory of uniformity for \(L\)-fuzzy sets, where \(L\) is a completely distributive lattice with an order reversing involution. Based on this theory on uniformity, \textit{M. A. Erceg} [ibid. 69, 205-230 (1979; Zbl 0409.54007)] introduced a theory of metric for fuzzy sets. Both the notion of Hutton uniformity and that of Erceg metric are essentially defined on completely distributive lattices with an order reversing involution, so, unlike their classical counterpart, they are not involved with the concept of `point'. However, regarding the coprimes in a completely distributive lattice as `points', \textit{J. Liang} [Acta Math. Sin. 30, No. 6, 733-741 (1987; Zbl 0687.54008)] and \textit{Y. Peng} [Chin. Ann. Math., Ser. A 13, No. 3, 353-359 (1992; Zbl 0771.54006)] obtained `pointed' characterizations of the Erceg metric. In this paper, inspired by the theory of fuzzy points (= coprimes) and their remote neighbourhoods, the author introduces a theory called `pointwise pseudo-metrics' for \(L\)-fuzzy sets, which was intended to be a different theory to that of Erceg. However, as is showed recently by \textit{J. Liang} [A note on pointwise pseudo-metrics on fuzzy lattices, J. Sichuan Univ., Nat. Sci. Ed. 38, 483-486 (2001)], this theory of pointwise pseudo-metrics is equivalent to the `pointed' characterization of Liang and Peng [loc. cit.] of pseudo-metrics of Erceg. And it must be pointed out that Example 6.6 in this paper, which was intended to show that pointwise pseudo-metrics and Erceg pseudo-metrics are different things, is not correct (indeed, such examples cannot exist by the result of Liang). Precisely, the claim that \(\tau_D\) on \(X\) is not \(C_I\) is false, since the topology \(\tau_D\) is clearly the discrete topology and \(L=2^Y\) is a power set, then every point \(x_a\), \(a=\{y\} \in L\), of \(L^X\) has a remote neighbourhood system consisting of one element \(\lambda\in L^X\), here \(\lambda\) is defined by \(\lambda(z)= 1_L\) if \(z\neq x\) and \(\lambda(z) =A\) if \(z=x\), where \(A=Y \smallsetminus \{y\}\).