Next Article in Journal
Numerical Computation of Lightly Multi-Objective Robust Optimal Solutions by Means of Generalized Cell Mapping
Next Article in Special Issue
Aggregation of L-Probabilistic Quasi-Uniformities
Previous Article in Journal
Perspectives on Adversarial Classification
Previous Article in Special Issue
w-Distances on Fuzzy Metric Spaces and Fixed Points
 
 
Font Type:
Arial Georgia Verdana
Font Size:
Aa Aa Aa
Line Spacing:
Column Width:
Background:
Article

A Notion of Convergence in Fuzzy Partially Ordered Sets

by
Dimitrios Georgiou
1,*,
Athanasios Megaritis
2 and
Georgios Prinos
1
1
Department of Mathematics, University of Patras, 265 00 Patras, Greece
2
Department of Physics, University of Thessaly, 35 100 Lamia, Greece
*
Author to whom correspondence should be addressed.
Mathematics 2020, 8(11), 1958; https://doi.org/10.3390/math8111958
Submission received: 29 September 2020 / Revised: 21 October 2020 / Accepted: 30 October 2020 / Published: 5 November 2020

Abstract

:
The notion of sequential convergence in fuzzy partially ordered sets, under the name o F -convergence, is well known. Our aim in this paper is to introduce and study a notion of net convergence, with respect to the fuzzy order relation, named o-convergence, which generalizes the former notion and is also closer to our sense of the classic concept of "convergence". The main result of this article is that the two notions of convergence are identical in the area of complete F-lattices.
MSC:
54A20; 06D72

1. Introduction

Zadeh, in his seminal paper [1] in 1971, introduced and studied the concept of fuzzy relation. In particular, the notion of fuzzy order relation was initiated by generalizing the notions of reflexivity, antisymmetry and transitivity. Since then, many authors have studied fuzzy orders and relations by adopting different approaches [2,3,4,5,6,7,8]. Fuzzy orders have a wider range of utility when compared to the classic orders by allowing the expression not only the preference for one alternative over another, in a set of alternatives, but also the “power” of that preference. Generally, fuzzy relations are important because of their applications in fuzzy modeling, fuzzy diagnosis, and fuzzy control (see for example [9]).
Using a notion of fuzzy order, the authors in [3] defined and studied a notion of convergence for sequences, in the sense of Birkhoff [10] which was further investigated in the context of fuzzy Riesz spaces in [11,12], where is considered as net convergence. Moreover, this notion was redefined to unbounded fuzzy order convergence in [13]. Motivated by the previous works, we provide, in the general context of fuzzy posets, a notion of convergence for nets, in the sense of McShane [14]. Particularly, Section 2 contains preliminaries. In Section 3 we introduce and study o-convergence which is a generalization of o F -convergence, considered in [3]. In Section 4, we prove that, in the setting of complete F-lattices, both notions of convergence are equivalent with the equality of limit inferior and limit superior, with respect to the fuzzy order relation and, therefore, coincide. Finally, in Section 5, we add some concluding remarks for possible future study in this field.

2. Preliminaries

This section contains preliminary material that will be needed in the sequel.
Let X be a nonempty set. A fuzzy set α on X (due to Zadeh [15]) is a membership function μ α : X [ 0 , 1 ] with the value of μ α ( x ) at x representing the “grade of membership” of x in α . When α is an ordinary set its membership function μ α reduces to its characteristic function and α is called a crisp set on X.
In what follows, we recall the basic notions and results from [3,7,16].
Definition 1
([3]). Let X be a nonempty set. A fuzzy order on X is a fuzzy set on X × X whose membership function μ satisfies the following properties:
(1) 
(reflexivity) for all x X , μ ( x , x ) = 1 ;
(2) 
(antisymmetry) for all x , y X , μ ( x , y ) + μ ( y , x ) > 1 implies x = y ; and,
(3) 
(transitivity) for all x , z X , μ ( x , z ) y X [ μ ( x , y ) μ ( y , z ) ] , where ∨ and ∧ denote the supremum and the infimum, with respect to the usual order on the unit interval, respectively.
A set with a fuzzy order defined on it is called a fuzzy ordered set (or foset for short.)
Notation 1
([7]). Let X be a foset and x X . With x we will denote the fuzzy set on X defined by x ( y ) = μ ( x , y ) , for all y X . Dually, with x we will denote the fuzzy set on X defined by x ( y ) = μ ( y , x ) , for all y X . If M is a subset of X, M = x M x and M = x M x .
Definition 2
([7]). Let M be a subset of a foset X. The upper bound U ( M ) of M is the fuzzy set on X, defined as follows:
U ( M ) ( y ) = 0 , i f x ( y ) 1 / 2 f o r s o m e x M x M x ( y ) , o t h e r w i s e .
Dually, the lower bound L ( M ) of M is the fuzzy set on X, defined as follows:
L ( M ) ( y ) = 0 , i f x ( y ) 1 / 2 f o r s o m e x M x M x ( y ) , o t h e r w i s e .
If U ( M ) ( x ) > 0 , for some x X , we write x U ( M ) ; in such case, we say that M is bounded from above and we call x an upper bound of M. Similarly, if L ( M ) ( x ) > 0 , then we write x L ( M ) ; in such case we say that M is bounded from below and we call x a lower bound of M. If M is both bounded from above and bounded from below, then M is said to be bounded.An element z X is said to be the supremum of M (written z = sup M ) if
(1) 
z U ( M ) and
(2) 
y U ( M ) implies y U ( z ) .
Similarly, z X is said to be the infimum of M (written z = inf M ) if
(3) 
z L ( M ) and
(4) 
y L ( M ) implies y L ( z ) .
Theorem 1
([7]). Let M be a subset of a foset X. Subsequently,
(1) 
inf M , if it exists, is unique;
(2) 
sup M , if it exists, is unique.
If M is a subset of a foset X, then we will adopt from [3] the notations M and M for sup M and inf M , respectively. In the case that M is an indexed set i.e., M = { m i : i I } we will use alternatively, when it is more convenient, the abbreviated symbols i I m i and i I m i for { m i : i I } and { m i : i I } , respectively.
Notation 2.
x y = sup { x , y } and x y = inf { x , y } .
Theorem 2
([7]). Let X be a foset. Then the following identities hold, whenever the expressions referred exist.
(1) 
x x = x and x x = x .
(2) 
x y = y x and x y = y x .
(3) 
x ( x y ) = x ( x y ) = x .
(4) 
μ ( x , y ) > 1 / 2 if and only if x y = x .
(5) 
μ ( x , y ) > 1 / 2 if and only if x y = y .
Definition 3
([7]). A foset X is called a fuzzy lattice (or F-lattice for short) if all finite subsets of X have suprema and infima. A fuzzy lattice is said to be complete if every subset of X has a supremum and an infimum.
Definition 4
([16]). Let D be a subset of a foset X.
(1) 
D is said to be directed to the right if for every finite subset E of D, D U ( E ) Ø .
(2) 
D is said to be directed to the left if for every finite subset E of D, D L ( E ) Ø .
(3) 
D is said to be directed if it is both directed to the right and directed to the left.
In our terminology for nets, we follow Kelley [17] i.e., a net in a set X is an arbitrary function s : A X , where A is a nonempty directed set. If s ( a ) = s a , for all a A , then the net s will be denoted by the symbol ( s a ) a A .
Definition 5
([12]). Suppose that ( X , μ ) is a foset. A net ( s a ) a A , of elements in X, is said to be increasing if a b implies μ ( s a , s b ) > 1 / 2 , in which case we shall write ( s a ) a A . Moreover, if x = { s a : a A } , then we write ( s a ) a A x . The definition of a decreasing net and the symbols ( s a ) a A , ( s a ) a A x are dual.
The following notion of convergence in X, for the case of sequences, was introduced by I. Beg and M. Islam [3] (the primary version for posets is due, in essence, to Birkhoff [10]). Below, we summarize some basic notions and results from [3], where we refer the reader for more details.
Definition 6
([3]). Let X be a foset. We say that a net ( s a ) a A in X is order-converging or ( o F )-converging to a point x X and we write ( s a ) a A o F x if there exists a pair of nets ( u a ) a A and ( v a ) a A , in X, such that
(1) 
( u a ) a A x , ( v a ) a A x and
(2) 
μ ( u a , s a ) > 1 / 2 and μ ( s a , v a ) > 1 / 2 , for all a A .
Proposition 1
([3]). Let X be a foset. The o F -convergence of sequences in X has the following properties:
(1) 
If ( s n ) n N , then ( s n ) n N o F x if and only if ( s n ) n N x .
(2) 
If ( s n ) n N , then ( s n ) n N o F x if and only if ( s n ) n N x .
(3) 
Any o F -convergent sequence is bounded.
(4) 
If μ ( s n , t n ) > 1 / 2 , for all n N , and ( s n ) n N o F x , ( t n ) n N o F y , then μ ( x , y ) > 1 / 2 .
(5) 
If ( s n ) n N o F x and ( s n ) n N o F y , then x = y .
(6) 
If ( s n ) n N o F x , then any subsequence of ( s n ) n N o F -converges to the same limit.
(7) 
If μ ( t n , s n ) > 1 / 2 and μ ( s n , r n ) > 1 / 2 , for all n N and ( t n ) n N o F x , ( r n ) n N o F x , then ( s n ) n N o F x .
Definition 7 ([3]) A (real) linear space X is said to be a fuzzy ordered linear space if X is a foset and the following conditions both hold:
(1) 
If x 1 , x 2 X such that μ ( x 1 , x 2 ) > 1 / 2 , then μ ( x 1 , x 2 ) μ ( x 1 + x , x 2 + x ) , for all x X .
(2) 
If x 1 , x 2 X , such that μ ( x 1 , x 2 ) > 1 / 2 , then μ ( x 1 , x 2 ) μ ( r x 1 , r x 2 ) , for all r 0 .
Proposition 2 
([3]) Let X be a fuzzy ordered linear space. The o F -convergence of sequences in X has the following properties:
(1) 
If ( s n ) n N o F x and ( t n ) n N o F y , then ( s n + t n ) n N o F x + y .
(2) 
If ( s n ) n N o F x and r R , then ( r s n ) n N o F r x .

3. o -Convergence with Respect to the Fuzzy Order Relation

In this section we will introduce and study a notion of convergence in fosets, named o-convergence (the primary version for posets is due, in essence, to McShane [14]). The importance of o-convergence lies in the fact that, in addition to successfully generalizing o F -convergence, is closer to our understanding of the concept of “convergence”, as we will see below.
Definition 8.
Let X be a foset. We say that a net ( s a ) a A in X is o-converging to a point x X and we write ( s a ) a A o x if there exist a directed to the right subset D of X and a directed to the left subset F of X, such that
(1) 
D = F = x and
(2) 
for every d D and every f F , μ ( d , s a ) > 1 / 2 and μ ( s a , f ) > 1 / 2 , eventually.
Proposition 3.
Let X be a foset, ( s a ) a A be a net in X and x X . If ( s a ) a A o F x , then ( s a ) a A o x .
Proof. 
By hypothesis there exists a pair of nets ( u a ) a A and ( v a ) a A , in X, such that
(a)
( u a ) a A x , ( v a ) a A x and
(b)
μ ( u a , s a ) > 1 / 2 and μ ( s a , v a ) > 1 / 2 , for all a A .
Consider the ranges of those nets i.e., the subsets
D = { u a : a A } and F = { v a : a A }
of X. We will show that D is directed to the right (similarly, it can be proved that F is directed to the left). Let E = { u a 1 , , u a m } be a finite subset of D. We will show that D U ( E ) Ø . Indeed, since A is an ordinary directed set, there exists a 0 A such that a 0 a i , for all i = 1 , , m . Therefore, μ ( u a i , u a 0 ) > 1 / 2 , for all i = 1 , , m . The last implies that u a 0 U ( E ) . Evidently, u a 0 D . Furthermore, by hypothesis D = F = x , with respect to the fuzzy order on X. Let now d D and f F be arbitrary. Then, there exist a j , a k A such that d = u a j and f = v a k . Let a l A such that a l a j and a l a k . Subsequently, μ ( u a l , u a ) > 1 / 2 , for all a a l . Because μ ( u a , s a ) > 1 / 2 , for all a A and μ ( u a j , u a l ) > 1 / 2 , transitivity yields μ ( u a j , s a ) > 1 / 2 , for all a a l . That is μ ( d , s a ) > 1 / 2 , for all a a l . Analogously, we have μ ( s a , f ) > 1 / 2 , for all a a l . □
The following examples shows that the converse implication of Proposition 3 does not hold.
Example 1.
Let the set X = { a , b , c } . Define μ : X × X [ 0 , 1 ] by
μ ( x , y ) = 1 , if x = y 2 / 3 , if x = a and y = c 3 / 4 , if x = b and y = c 0 , otherwise .
One can easily check that μ is a fuzzy order relation on X. Let now the sequence ( s n ) n N , in X, defined by
s n = a , if n = 1 b , if n = 2 c , otherwise .
The subsets D = { c } and F = { c } of X satisfy all the conditions of the Definition 8 that determines the convergence ( s n ) n N o c . However, ( s n ) n N is not bounded, since it is not bounded below and, therefore, by Proposition 1 (3) ( s n ) n N does not o F -converge.
Example 2.
Let the (real) linear space X = R 2 . Define μ : X × X [ 0 , 1 ] by
μ ( x , y ) = 1 , if x 1 = y 1 and x 2 = y 2 2 / 3 , if x 1 = y 1 and x 2 < y 2 4 / 5 , if x 1 < y 1 and x 2 y 2 0 , otherwise ,
where x = ( x 1 , x 2 ) and y = ( y 1 , y 2 ) . It is straightforward to verify that μ is a fuzzy order relation on X which satisfies the properties of Definition 7. Therefore, X is a fuzzy ordered linear space. Let Z + be the set of positive integers ordered as follows
1 < 3 < 5 < 7 < < 2 < 4 < 6 < 8 < .
Clearly, Z + is a directed set. Let now ( s n ) n Z + be the net, in X, defined by
s n = ( 1 / n , 1 / n ) , if n is even ( n , n ) , if n is odd .
By Definition 8, ( s n ) n Z + o ( 0 , 0 ) . However, ( s n ) n Z + does not o F -converge to ( 0 , 0 ) . Indeed, suppose that ( s n ) n Z + o F ( 0 , 0 ) . Subsequently, by Definition 6, there exists a pair of nets ( u n ) n Z + and ( v n ) n Z + , in X, such that
(a) 
( u n ) n Z + ( 0 , 0 ) , ( v n ) n Z + ( 0 , 0 ) and
(b) 
μ ( u n , s n ) > 1 / 2 and μ ( s n , v n ) > 1 / 2 , for all n Z + .
By condition (b), μ ( s 1 , v 1 ) > 1 / 2 . Let v 1 = ( v 1 , 1 , v 1 , 2 ) and let n 0 > 1 be a positive odd integer such that v 1 , 1 < n 0 and v 1 , 2 < n 0 . Subsequently, again, by condition (b) μ ( s n 0 , v n 0 ) > 1 / 2 , where s n 0 = ( n 0 , n 0 ) . Let v n 0 = ( v n 0 , 1 , v n 0 , 2 ) . It follows that v n 0 , 1 n 0 and v n 0 , 2 n 0 , i.e., μ ( v 1 , v n 0 ) > 1 / 2 , which contradicts the fact that by condition (a) ( v n ) n Z + is a decreasing net since v 1 v n 0 . Thus, the net ( s n ) n Z + does not o F -converge to ( 0 , 0 ) . Note that the subnet ( s 2 n ) n Z + of ( s n ) n Z + o F -converges to ( 0 , 0 ) . This fact demostrates that, in contrast to our common belief, the existense of additional terms in the "tail" of the net affects its o F -convergence. Obviously, o-convergence overcomes this pathology.
Remark 1.
From the previous examples, we observe that boundness is a property that is not retained in the case of o-convergence, not even for sequences.
The o-convergence has, as we will see next, similar properties to o F -convergence.
Proposition 4.
Let ( s a ) a A be a net in a foset X. Subsequently,
(1) 
( s a ) a A x if and only if ( s a ) a A is increasing and ( s a ) a A o x ;
(2) 
( s a ) a A x if and only if ( s a ) a A is decreasing and ( s a ) a A o x .
Proof. 
(1) Let ( s a ) a A be an increasing net and ( s a ) a A o x . We will prove that x = { s a : a A } i.e.,
(a)
x U ( { s a : a A } ) and
(b)
y U ( { s a : a A } ) implies y U ( x ) .
Fix b A . By hypothesis there exist a directed to the right subset D of X and a directed to the left subset F of X such that
(c)
D = F = x and
(d)
for every d D and every f F , μ ( d , s a ) > 1 / 2 and μ ( s a , f ) > 1 / 2 , eventually.
Let f F be arbitrary. There exists a 0 A such that μ ( s a , f ) > 1 / 2 , for every a a 0 . Take any a 1 A , such that a 1 b and a 1 a 0 . It follows that, μ ( s b , s a 1 ) > 1 / 2 and μ ( s a 1 , f ) > 1 / 2 . By transitivity we have μ ( s b , f ) > 1 / 2 . Since f F was arbitrarily chosen, μ ( s b , f ) > 1 / 2 , for all f F . Thus, s b L ( F ) . Since F = x , s b L ( x ) i.e., μ ( s b , x ) > 1 / 2 . The last conclusion does not depend on the choice of b A , so μ ( s b , x ) > 1 / 2 , for all b A . Thus, x U ( { s a : a A } ) . Let now y U ( { s a : a A } ) . Subsequently, μ ( s a , y ) > 1 / 2 , for all a A . Let d D be arbitrary. There exists a 0 A such that μ ( d , s a ) > 1 / 2 , for all a a 0 . Thus, by transitivity μ ( d , y ) > 1 / 2 . Since d D was arbitrarily chosen, μ ( d , y ) > 1 / 2 , for all d D , which further implies that y U ( D ) . On account of D = x , y U ( x ) . Therefore, conditions (a) and (b) are fulfilled, so x = { s a : a A } . Hence, ( s a ) a A x .
Conversely, let ( s a ) a A x . Afterwards, ( s a ) a A is increasing and therefore, by Proposition 1 (1) ( s a ) a A o F x . Hence, by Proposition 3 ( s a ) a A o x .
The proof of (2) is similar to the proof of (1). □
Proposition 5.
Let ( s a ) a A and ( t a ) a A be nets in a foset X and x , y X . If μ ( s a , t a ) > 1 / 2 , for all a A and ( s a ) a A o x , ( t a ) a A o y , then μ ( x , y ) > 1 / 2 .
Proof. 
By hypothesis there exist directed to the right subsets D s , D t of X and directed to the left subsets F s , F t of X such that
(a)
D s = F s = x and D t = F t = y ;
(b)
for every d s D s and every f s F s , μ ( d s , s a ) > 1 / 2 and μ ( s a , f s ) > 1 / 2 , eventually;
(c)
for every d t D t and every f t F t , μ ( d t , t a ) > 1 / 2 and μ ( t a , f t ) > 1 / 2 , eventually.
Fix d s D s and let f t F t be arbitrary. There exists a 0 A such that, for all a a 0 , μ ( d s , s a ) > 1 / 2 , μ ( s a , t a ) > 1 / 2 and μ ( t a , f t ) > 1 / 2 . Transitivity yields that μ ( d s , f t ) > 1 / 2 . Since f t F t was arbitrarily chosen, μ ( d s , f t ) > 1 / 2 , for all f t F t . Thus, d s L ( F t ) . Furthermore, F t = y yields d s L ( y ) i.e., μ ( d s , y ) > 1 / 2 . The last conclusion does not depend on the choice of d s D s , so μ ( d s , y ) > 1 / 2 , for all d s D s . Thus, y U ( D s ) . Because D s = x , y U ( x ) i.e., μ ( x , y ) > 1 / 2 . □
Corollary 1.
Let ( s a ) a A be a net in a foset X and x , y X . If ( s a ) a A o x and ( s a ) a A o y , then x = y .
Proof. 
Applying Proposition 5 by considering s a = t a , for all a A , we get μ ( x , y ) > 1 / 2 and μ ( y , x ) > 1 / 2 . Thus, μ ( x , y ) + μ ( y , x ) > 1 . Antisymmetry property yields x = y . □
Proposition 6.
Let X be a foset. If ( s a ) a A o x and ( t λ ) λ Λ is any subnet of ( s a ) a A , then ( t λ ) λ Λ o x .
Proof. 
By hypothesis, there exists a directed to the right subset D of X and a directed to the left subset F of X, such that
(a)
D = F = x ;
(b)
for every d D and every f F , μ ( d , s a ) > 1 / 2 and μ ( s a , f ) > 1 / 2 , eventually.
Let now ( t λ ) λ Λ be a subnet of ( s a ) a A . There exists a function φ : Λ A with the following properties:
(c)
t = s φ , or equivalently, t λ = s φ ( λ ) , for all λ Λ .
(d)
For every a A there exists λ 0 Λ such that φ ( λ ) a , for all λ λ 0 .
Let d D and f F be arbitrary. By condition (b) there exists a 0 A , such that μ ( d , s a ) > 1 / 2 and μ ( s a , f ) > 1 / 2 , for all a a 0 . By condition (d), there exists λ 0 Λ such that φ ( λ ) a 0 , for all λ λ 0 . Thus, μ ( d , s φ ( λ ) ) > 1 / 2 and μ ( s φ ( λ ) , f ) > 1 / 2 , for all λ λ 0 . Because, t λ = s φ ( λ ) , μ ( d , t λ ) > 1 / 2 and μ ( t λ , f ) > 1 / 2 , for all λ λ 0 . Therefore, the directed to the right subset D of X and the directed to the left subset F of X satisfy all the conditions of the Definition 8 that determines the convergence ( t λ ) λ Λ o x . □
Proposition 7.
Let ( s a ) a A , ( t a ) a A and ( r a ) a A be nets in a foset X and x X . If μ ( s a , r a ) > 1 / 2 and μ ( r a , t a ) > 1 / 2 , for all a A and ( s a ) a A o x , ( t a ) a A o x , then ( r a ) a A o x .
Proof. 
By hypothesis, there exist directed to the right subsets D s , D t of X and directed to the left subsets F s , F t of X such that
(a)
D s = D t = F s = F t = x ;
(b)
for every d s D s and every f s F s , μ ( d s , s a ) > 1 / 2 and μ ( s a , f s ) > 1 / 2 , eventually; and,
(c)
for every d t D t and every f t F t , μ ( d t , t a ) > 1 / 2 and μ ( t a , f t ) > 1 / 2 , eventually.
Let d s D s and f t F t be arbitrary. There exists a 0 A such that, for all a a 0 we have μ ( d s , s a ) > 1 / 2 , μ ( s a , r a ) > 1 / 2 , μ ( r a , t a ) > 1 / 2 and μ ( t a , f t ) > 1 / 2 . Transitivity yields that μ ( d s , r a ) > 1 / 2 and μ ( r a , f t ) > 1 / 2 , for all a a 0 . Therefore, the directed to the right subset D s of X and the directed to the left subset F t of X satisfy all the conditions of the Definition 8 that determines the convergence ( r a ) a A o x . □
Proposition 8.
Let X be a fuzzy ordered linear space, ( s a ) a A , ( t a ) a A be nets in X, x , y X and r R . Subsequently, the following implications hold.
(1) 
If ( s a ) a A o x and ( t a ) a A o y , then ( s a + t a ) a A o x + y .
(2) 
If ( s a ) a A o x , then ( r s a ) a A o r x .
Proof. 
(1) By hypothesis there exist directed to the right subsets D s , D t of X and directed to the left subsets F s , F t of X such that
(a)
D s = F s = x and D t = F t = y ;
(b)
for every d s D s and every f s F s , μ ( d s , s a ) > 1 / 2 and μ ( s a , f s ) > 1 / 2 , eventually; and,
(c)
for every d t D t and every f t F t , μ ( d t , t a ) > 1 / 2 and μ ( t a , f t ) > 1 / 2 , eventually.
We consider the following subsets of X:
D = { d s + d t : d s D s and d t D t } and F = { f s + f t : f s F s and f t F t } .
We will prove that D is directed to the right (similarly, it can be proved that F is directed to the left). Let E = { d s 1 + d t 1 , , d s k + d t k } be a finite subset of D. We will show that D U ( E ) Ø . Let the finite subsets E s = { d s 1 , , d s k } and E t = { d t 1 , , d t k } of D s and D t , respectively. Since D s and D t are directed to the right subsets of X, we have that D s U ( E s ) Ø and D t U ( E t ) Ø . The last yields that there exist d s D s and d t D t such that d s U ( E s ) and d t U ( E t ) i.e., for all i = 1 , , k ,
μ ( d s i , d s ) > 1 / 2 and μ ( d t i , d t ) > 1 / 2 .
Therefore, by [3] (Remark 4.4), for all i = 1 , , k ,
μ ( d s i + d t i , d s + d t ) > 1 / 2 .
Thus, d s + d t U ( E ) and so D U ( E ) Ø .
We will prove that D = x + y . (Similarly, it can be proved that F = x + y .) Indeed, by [3] (Proposition 4.8),
D = d s D s d t D t ( d s + d t ) = d s D s d s + d t D t d t = D s + D t = x + y .
Let now d s + d t D and f s + f t F be arbitrary. By condition (b) there exists a 1 A such that, for all a a 1 ,
μ ( d s , s a ) > 1 / 2 and μ ( s a , f s ) > 1 / 2 .
By condition (c), there exists a 2 A such that, for all a a 2 ,
μ ( d t , t a ) > 1 / 2 and μ ( t a , f t ) > 1 / 2 .
Let a 0 A , such that a 0 a 1 and a 0 a 2 . By [3] (Remark 4.4), for all a a 0 ,
μ ( d s + d t , s a + t a ) > 1 / 2 and μ ( s a + t a , f s + f t ) > 1 / 2 .
Hence, the directed to the right subset D of X and the directed to the left subset F of X satisfy all of the conditions of the Definition 8 determines the convergence ( s a + t a ) a A o x + y .
(2) By hypothesis, there exist a directed to the right subset D of X and a directed to the left subset F of X, such that
(d)
D = F = x and
(e)
for every d D and every f F , μ ( d , s a ) > 1 / 2 and μ ( s a , f ) > 1 / 2 , eventually.
We consider the following subsets of X:
r D = { r d : d D } and r F = { r f : f F } .
Let r > 0 . We will prove that r D is directed to the right (similarly, it can be proved that r F is directed to the left). Let r E = { r d 1 , , r d k } be a finite subset of r D , where E = { d 1 , , d k } is a finite subset of D. We will show that r D U ( r E ) Ø . Because D is directed to the right subset of X, we have that D U ( E ) Ø . The last yields that there exists d D such that d U ( E ) i.e.,
μ ( d i , d ) > 1 / 2 , for all i = 1 , , k .
Therefore, by Definition 7 (2),
μ ( r d i , r d ) > 1 / 2 , for all i = 1 , , k .
Thus, r d U ( r E ) and so r D U ( r E ) Ø .
We will prove that r D = r x (similarly, it can be proved that r F = r x ). Indeed, by [3] [Proposition 4.10],
r D = d D ( r d ) = r d D d = r ( D ) = r x .
Let now r d r D and r f r F be arbitrary. By condition (e) there exists a 1 A , such that, for all a a 1 ,
μ ( d , s a ) > 1 / 2 and μ ( s a , f ) > 1 / 2 .
Thus, for all a a 1 ,
μ ( r d , r s a ) > 1 / 2 and μ ( r s a , r f ) > 1 / 2 .
Hence, the directed to the right subset r D of X and the directed to the left subset r F of X satisfy all of the conditions of the Definition 8 that determine the convergence ( r s a ) a A o r x .
Let r < 0 . We will prove that r D is directed to the left (similarly, it can be proved that r F is directed to the right). Let r E = { r d 1 , , r d k } be a finite subset of r D , where E = { d 1 , , d k } is a finite subset of D. We will show that r D L ( r E ) Ø . Because D is directed to the right subset of X, we have that D U ( E ) Ø . The last yields that there exists d D such that d U ( E ) i.e.,
μ ( d i , d ) > 1 / 2 , for all i = 1 , , k .
Therefore, by [3] (Proposition 4.5 (4)),
μ ( r d , r d i , ) > 1 / 2 , for all i = 1 , , k .
Thus, r d L ( r E ) and so r D L ( r E ) Ø .
We will prove that r D = r x (similarly, it can be proved that r F = r x ). Indeed, by [3] (Corollary 4.11),
r D = d D ( r d ) = r d D d = r ( D ) = r x .
Let now r d r D and r f r F be arbitrary. By condition (e), there exists a 1 A , such that, for all a a 1 ,
μ ( d , s a ) > 1 / 2 and μ ( s a , f ) > 1 / 2 .
Thus, by [3] (Proposition 4.5 (4)), for all a a 1 ,
μ ( r f , r s a ) > 1 / 2 and μ ( r s a , r d ) > 1 / 2 .
Hence, the directed to the left subset r D of X and the directed to the right subset r F of X satisfy all of the conditions of the Definition 8 that determines the convergence ( r s a ) a A o r x .
The case r = 0 is trivial. □

4. Coincidence of the Two Notions of Convergence

In this section, we will show that in the special context of complete F-lattices the notion of o-convergence can be restated in terms of the notions of limit inferior and limit superior, with respect to the fuzzy order relation, which will be introduced in the sequel. Apart from the fact that o-convergence is characterized by another form that may be sometimes more useful and convenient, in this way it can also be shown that it reduces to o F -convergence.
Definition 9.
Let ( s a ) a A be a net in a complete F-lattice X. Subsequently, we may define the related nets ( u a ) a A and ( v a ) a A such that
u a = b a s b and v a = b a s b .
The limit inferior and the limit superior (or lower limit and upper limit) of the net ( s a ) a A , denoted by lim inf s a and lim sup s a , respectively, are defined by
lim inf s a = a A u a = a A b a s b
and
lim sup s a = a A v a = a A b a s b .
Proposition 9.
Let ( s a ) a A be a net in a complete F-lattice X. If u a and v a are the nets mentioned in Definition 9, then
(1) 
μ ( u a , s a ) > 1 / 2 and μ ( s a , v a ) > 1 / 2 , for all a A ;
(2) 
( u a ) a A is increasing and ( v a ) a A is decreasing; and,
(3) 
μ ( lim inf s a , lim sup s a ) > 1 / 2 .
Proof. 
(1) Let a A be arbitrary. Because u a = b a s b , u a L ( { s b : b a } ) . Therefore, μ ( u a , s a ) > 1 / 2 . Similarly, we can prove that μ ( s a , v a ) > 1 / 2 , for all a A .
(2) Let a 1 , a 2 A be arbitrary and suppose that a 1 a 2 . Since u a 1 = b a 1 s b , u a 1 L ( { s b : b a 1 } ) . Hence, μ ( u a 1 , s b ) > 1 / 2 , for all b a 1 . Therefore, μ ( u a 1 , s b ) > 1 / 2 , for all b a 2 , which further implies u a 1 L ( { s b : b a 2 } ) . Because u a 2 = b a 2 s b , u a 1 L ( u a 2 ) i.e., μ ( u a 1 , u a 2 ) > 1 / 2 . Similarly, we can prove that μ ( v a 2 , v a 1 ) > 1 / 2 .
(3) By (2) ( u a ) a A is increasing. By Definition 9, lim inf s a = a A u a , thus ( u a ) a A lim inf s a . By Proposition 4 (1), ( u a ) a A o lim inf s a . Similarly, we can prove that ( v a ) a A o lim sup s a . Taking into account (1), transitivity yields μ ( u a , v a ) > 1 / 2 , for all a A . Therefore, Proposition 5 applies and so, μ ( lim inf s a , lim sup s a ) > 1 / 2 . □
Lemma 1.
Let ( u a ) a A be a net in a foset X and a 0 A . Then ( u a ) a A x (resp. ( u a ) a A x ) implies a a 0 u a = x (resp. a a 0 u a = x ).
Proof. 
Let a 0 A . Because x U ( { u a : a A } ) , μ ( u a , x ) > 1 / 2 , for all a A and thus μ ( u a , x ) > 1 / 2 , for all a a 0 . Hence, x U ( { u a : a a 0 } ) . Let y U ( { u a : a a 0 } ) . Fix any a A . There exists a 1 A such that a 1 a 0 and a 1 a . Then, μ ( u a , u a 1 ) > 1 / 2 and μ ( u a 1 , y ) > 1 / 2 . By transitivity, μ ( u a , y ) > 1 / 2 . However, a A was arbitrarily chosen, thus μ ( u a , y ) > 1 / 2 , for all a A i.e., y U ( { u a : a A } ) . Because, a A u a = x , y U ( x ) . Therefore, a a 0 u a = x . The proof of the other implication is analogous. □
Theorem 3.
Let ( s a ) a A be a net in a complete F-lattice X and x X . Subsequently, the following conditions are equivalent:
(1) 
( s a ) a A o x .
(2) 
lim inf s a = lim sup s a = x .
(3) 
( s a ) a A o F x .
Proof. 
( 1 ) ( 2 ) Let ( u a ) a A and ( v a ) a A be the nets mentioned in Definition 9 with u = a A u a and v = a A v a . Subsequently, By Proposition 9 (2)
( u a ) a A u and ( v a ) a A v .
It will suffice to prove that u = v = x . We will prove that u = x (analogously, it can be proved that v = x ). By hypothesis there exist a directed to the right subset D of X and a directed to the left subset F of X such that
(a)
D = F = x and
(b)
for every d D and every f F , μ ( d , s a ) > 1 / 2 and μ ( s a , f ) > 1 / 2 , eventually.
Let d D be arbitrary. By condition (b), there exists a 1 A , such that μ ( d , s a ) > 1 / 2 , for all a a 1 i.e., d L ( { s a : a a 1 } ) . Taking into account that a a 1 s a = u a 1 , d L ( u a 1 ) . Thus, μ ( d , u a 1 ) > 1 / 2 . Because u = a A u a , μ ( u a , u ) > 1 / 2 , for all a A and so μ ( u a 1 , u ) > 1 / 2 . Consequently, transitivity yields, μ ( d , u ) > 1 / 2 . The last conclusion does not depend on the choice of d D , so μ ( d , u ) > 1 / 2 , for all d D . Thus, u U ( D ) , which further implies u U ( x ) . Therefore, μ ( x , u ) > 1 / 2 .
Now, let f F be arbitrary. By condition (b), there exists a 2 A , such that, μ ( s a , f ) > 1 / 2 , for all a a 2 . Because μ ( u a , s a ) > 1 / 2 , for all a A , transitivity yields μ ( u a , f ) > 1 / 2 , for all a a 2 . Thus, f U ( { u a : a a 2 } ) . By Lemma 1, u = a a 2 u a which in turn implies that f U ( u ) . Hence, μ ( u , f ) > 1 / 2 . The last conclusion does not depend on the choice of f F , so μ ( u , f ) > 1 / 2 , for all f F . Thus, u L ( F ) , which further implies u L ( x ) . Therefore, μ ( u , x ) > 1 / 2 .
Consequently, μ ( x , u ) + μ ( u , x ) > 1 and, thus, by antisymmetry, u = x .
( 2 ) ( 3 ) Let ( u a ) a A and ( v a ) a A be the nets that are mentioned in Definition 9. By hypothesis,
a A u a = a A v a = x .
Therefore, ( u a ) a A and ( v a ) a A satisfy all of the conditions in the Definition 6, which determines the convergence ( s a ) a A o F x .
( 3 ) ( 1 ) See Proposition 3. □

5. Conclusions

In the present paper, o-convergence is inserted as a generalization of o F -convergence. Many of the properties of o-convergence are proved to be much alike the properties of o F -convergence with the advantage that the notion of o-convergence is, in our opinion, closer to our initiation to the concept of "convergence". In addition, the coincidence of the two notions is established in the area of complete F-lattices. Future research options may investigate the notion of o-convergence and its applications in the context of fuzzy Riesz spaces (see [18]) and, in a more theoretical perspective, exploring the topological nature of the two notions of convergence and their correlation, while taking into account the relevant induced topologies, in different types of fosets.

Author Contributions

Conceptualization, D.G., A.M. and G.P.; methodology, D.G., A.M. and G.P.; investigation, D.G., A.M. and G.P.; writing–original draft preparation, D.G., A.M. and G.P.; writing–review and editing, D.G., A.M. and G.P. All authors have read and agreed to the published version of the manuscript.

Funding

This research received no external funding.

Acknowledgments

The authors would like to thank the reviewers for their valuable comments.

Conflicts of Interest

The authors declare no conflict of interest.

References

  1. Zadeh, L.A. Similarity relations and fuzzy ordering. Inf. Sci. 1971, 3, 177–200. [Google Scholar] [CrossRef]
  2. Ajmal, N.; Thomas, K.V. Fuzzy lattices. Inf. Sci. 1994, 79, 271–291. [Google Scholar] [CrossRef]
  3. Beg, I.; Islam, M. Fuzzy ordered linear spaces. J. Fuzzy Math. 1995, 3, 659–670. [Google Scholar]
  4. Bodenhofer, U. Representations and constructions of similarity-based fuzzy orderings. Fuzzy Sets Syst. 2003, 137, 113–136. [Google Scholar] [CrossRef]
  5. Chon, I. Fuzzy partial order relations and fuzzy lattices. Korean J. Math. 2009, 17, 361–374. [Google Scholar]
  6. Sanchez, E. Resolution of composite fuzzy relation equations. Inf. Control 1976, 30, 38–48. [Google Scholar] [CrossRef] [Green Version]
  7. Venugopalan, P. Fuzzy ordered sets. Fuzzy Sets Syst. 1992, 46, 221–226. [Google Scholar] [CrossRef]
  8. Yuan, B.; Wu, W. Fuzzy ideals on a distributive lattice. Fuzzy Sets Syst. 1990, 35, 231–240. [Google Scholar]
  9. Syropoulos, A.; Grammenos, T. A Modern Introduction to Fuzzy Mathematics; John Wiley & Sons, Inc.: New York, NY, USA, 2020. [Google Scholar]
  10. Birkhoff, G. Lattice Theory; American Mathematical Society: Providence, RI, USA, 1973. [Google Scholar]
  11. Beg, I. σ-complete fuzzy Riesz spaces. Res. Math. 1997, 31, 292–299. [Google Scholar] [CrossRef]
  12. Hong, L. Fuzzy Riesz subspaces, fuzzy ideals, fuzzy bands and fuzzy band projections. An. Univ. Vest Timiş. Ser. Mat. Inf. 2015, 53, 77–108. [Google Scholar] [CrossRef] [Green Version]
  13. Iqbal, M.; Malik, M.G.A.; Bashir, Y.; Bashir, Z. The unbounded fuzzy order convergence in fuzzy Riesz spaces. Symmetry 2019, 11, 971. [Google Scholar] [CrossRef] [Green Version]
  14. McShane, E.J. Order-Preserving Maps and Integration Processes; Princeton University Press: Princeton, NJ, USA, 1953. [Google Scholar]
  15. Zadeh, L.A. Fuzzy sets. Inf. Control 1965, 8, 338–353. [Google Scholar] [CrossRef] [Green Version]
  16. Beg, I.; Islam, M. Fuzzy Archimedean spaces. J. Fuzzy Math. 1997, 5, 413–423. [Google Scholar]
  17. Kelley, J.L. General Topology; Springer: New York, NY, USA; Berlin, Germany, 1975. [Google Scholar]
  18. Beg, I.; Islam, M. Fuzzy Riesz spaces. J. Fuzzy Math. 1994, 2, 211–229. [Google Scholar]
Publisher’s Note: MDPI stays neutral with regard to jurisdictional claims in published maps and institutional affiliations.

Share and Cite

MDPI and ACS Style

Georgiou, D.; Megaritis, A.; Prinos, G. A Notion of Convergence in Fuzzy Partially Ordered Sets. Mathematics 2020, 8, 1958. https://doi.org/10.3390/math8111958

AMA Style

Georgiou D, Megaritis A, Prinos G. A Notion of Convergence in Fuzzy Partially Ordered Sets. Mathematics. 2020; 8(11):1958. https://doi.org/10.3390/math8111958

Chicago/Turabian Style

Georgiou, Dimitrios, Athanasios Megaritis, and Georgios Prinos. 2020. "A Notion of Convergence in Fuzzy Partially Ordered Sets" Mathematics 8, no. 11: 1958. https://doi.org/10.3390/math8111958

Note that from the first issue of 2016, this journal uses article numbers instead of page numbers. See further details here.

Article Metrics

Back to TopTop