Preprint
Article

This version is not peer-reviewed.

Equivalence of Common Metrics on Trapezoidal Fuzzy Numbers

Submitted:

06 September 2025

Posted:

09 September 2025

You are already at the latest version

Abstract
In this paper, we show that the four kinds of common metrics: the supremum metric, the Lp-type dp metrics, the sendograph metric and the endograph metric, are equivalent on the trapezoidal fuzzy numbers. Furthermore, we point out that, on the trapezoidal fuzzy numbers, these four kinds of metric convergences are equivalent to the convergence of the corresponding representation quadruples of the trapezoidal fuzzy numbers in R^4.
Keywords: 
;  ;  ;  ;  

1. Introduction

The trapezoidal fuzzy numbers and its special case triangular fuzzy numbers have been widely used and discussed in theory and applications [1,2,3,4,5]. The supremum distance, the L p -type d p distances, the sendograph distance and the endograph distance on fuzzy sets have been attracted much attention [3,6,7,8,9,10,11,12].
Naturally, these four kinds of metrics can also been used and discussed on the set of trapezoidal fuzzy numbers. So it is important to consider the relationship of these four kinds of metrics on the set of trapezoidal fuzzy numbers.
In this paper, we show all these four kinds of metric convergences on the trapezoidal fuzzy numbers are equivalent to the convergence of the corresponding representation quadruples of the trapezoidal fuzzy numbers in R 4 . So they are equivalent metrics on the trapezoidal fuzzy numbers.
The remainder of this paper is organized as follows. Section 2 reviews some basic concepts and fundamental conclusions of fuzzy sets and the extended metrics on them. In Section 3, we recall some basic concepts and properties related to the triangular fuzzy numbers and the trapezoidal fuzzy numbers. Section 4 recalls and gives some properties of the trapezoidal fuzzy numbers and triangular fuzzy numbers. Section 5 presents the main results of this paper. At last, we draw our conclusions in Section 6.

2. Fuzzy Sets and Extended Metrics on Them

In this section, we review some basic concepts and fundamental conclusions of fuzzy sets and the extended metrics on them. For fuzzy theory and applications, we refer the readers to [1,2,3,4,6,8,9,13,14,15,16,17,18].
Let N be the set of all positive integers and let R m be the m-dimensional Euclidean space. R 1 is also written as R .
Let Y be a nonempty set. The symbol P ( Y ) denotes the power set of Y, which is the set of all subsets of Y. The symbol F ( Y ) denotes the set of all fuzzy sets in Y, i.e., functions from Y to [ 0 , 1 ] . Given u F ( Y ) and α ( 0 , 1 ] , the α -cut [ u ] α of u is defined by [ u ] α : = { x Y : u ( x ) α } .
Let Y be a topological space. The symbol C ( Y ) denotes the set of all nonempty closed subsets of Y. K ( Y ) denotes the set of all nonempty compact subsets of Y. For u F ( Y ) , the 0-cut [ u ] 0 of u is defined by [ u ] 0 : = { x Y : u ( x ) > 0 } ¯ , where S ¯ denotes the topological closure of S in Y. [ u ] 0 is called the support of u, and is also denoted by supp u.
Let Y be a nonempty set. For u F ( Y ) , define
end u : = { ( x , t ) Y × [ 0 , 1 ] : u ( x ) t } , send u : = end u ( [ u ] 0 × [ 0 , 1 ] ) ,
where send u is well-defined if and only if Y is a topological space. end u and send u are called the endograph and the sendograph of u, respectively. Clearly end u = send u ( X × { 0 } ) .
Throughout this paper, we suppose that Xis a nonempty set and it is equipped with a metric d. For simplicity, we also use X to denote the metric space  ( X , d ) .
Let ( X , d ) be a metric space. We use H to denote the Hausdorff extended metric on C ( X ) induced by d, i.e.,
H ( U , V ) = max { H * ( U , V ) , H * ( V , U ) }
for arbitrary U , V C ( X ) , where
H * ( U , V ) = sup u U d ( u , V ) = sup u U inf v V d ( u , v ) .
For simplicity, we often refer to both the Hausdorff extended metric and the Hausdorff metric as the Hausdorff metric. See also Remark 2.5 of [10].
Let [ a , b ] and [ c , d ] be two intervals. Then
H ( [ a , b ] , [ c , d ] ) = max { | a c | , | b d | } .
The metric d ¯ on X × [ 0 , 1 ] is defined as follows: for ( x , α ) , ( y , β ) X × [ 0 , 1 ] , d ¯ ( ( x , α ) , ( y , β ) ) = d ( x , y ) + | α β | . If there is no confusion, we also use H to denote the Hausdorff extended metric on C ( X × [ 0 , 1 ] ) induced by d ¯ .
Let F U S C ( X ) denote the set of all upper semi-continuous fuzzy sets in X; that is,
F U S C ( X ) : = { u F ( X ) : [ u ] α C ( X ) { } f o r a l l α [ 0 , 1 ] } .
Define F U S C 1 ( X ) : = { u F U S C ( X ) : [ u ] 1 } . Clearly F U S C 1 ( X ) F U S C ( X ) .
The supremum distance d , the sendograph distance H send and the endograph distance H end on F U S C 1 ( X ) are defined as follows, respectively. For each u , v F U S C 1 ( X ) ,
d ( u , v ) = sup α [ 0 , 1 ] H ( [ u ] α , [ v ] α ) , H send ( u , v ) = H ( send u , send v ) , H end ( u , v ) = H ( end u , end v ) ,
where H in the definition of d denotes the Hausdorff extended metric on C ( X ) induced by d, and H in the definitions of H send and H end denote the Hausdorff extended metric on C ( X × [ 0 , 1 ] ) induced by d ¯ .
The sendograph metric H send was introduced by Kloeden [19]. Each one of d and H send on F U S C 1 ( X ) is an extended metric but does not need to be a metric. H end on F U S C 1 ( X ) is a metric. See also Remark 2.7 of [10].
The L p -type d p distance, 1 p < + , of each u , v F U S C 1 ( X ) is defined by
d p ( u , v ) = 0 1 H ( [ u ] α , [ v ] α ) p d α 1 / p ,
where d p ( u , v ) is well-defined if and only if H ( [ u ] α , [ v ] α ) is a measurable function of α on [ 0 , 1 ] .
We suppose that, in the sequel, “p” which appears in mathematical expressions such as d p , etc., is an arbitrary number satisfying 1 p < + .
For some metric spaces Y, d p distances could be not well-defined on F U S C 1 ( Y ) (see Example 3.25 of [10]). So the following d p * extended metrics on F U S C 1 ( X ) are introduced in [20]. For each u , v F U S C 1 ( X ) ,
d p * ( u , v ) : = inf { 0 1 f ( α ) p d α 1 / p : f   i s   a   m e a s u r a b l e   f u n c t i o n   f r o m [ 0 , 1 ]   to   R + { + } s a t i s f y i n g   f ( α ) H ( [ u ] α , [ v ] α )   f o r   a l l   α [ 0 , 1 ] } .
Theorem 2.1. 
[10,11,20] Let u , v F U S C 1 ( X ) .
(i) d ( u , v ) H send ( u , v ) H end ( u , v ) .
(ii) d ( u , v ) d p * ( u , v ) .
(iii) d p * ( u , v ) H end ( u , v ) 1 + 1 / p .
(iv) If d p ( u , v ) is well-defined, then d p * ( u , v ) = d p ( u , v ) .
(v) If X = R m , then d p ( u , v ) is well-defined; so d p * ( u , v ) = d p ( u , v ) .
(vi) If X = R m , then d p * in (ii) and (iii) can be replaced by d p .
Proof. 
Clearly (i) holds. (i) may be a known conclusion. ((i) is (1) of [11]. The inequality at the end of Paragraph 2 in Page 2527 of [21] is this kind of conclusions.). (ii) is (13) of [11]. (iii) is Proposition 4.9(i) of [10]. (iv) is given in Remark 3.2 of [20]. (iv) is obvious. A routine proof of (iv) is given below.
Suppose that d p ( u , v ) is well-defined; that is, H ( [ u ] α , [ v ] α ) is a measurable function of α on [ 0 , 1 ] . Put S : = { f : f   i s   a   m e a s u r a b l e   f u n c t i o n   f r o m [ 0 , 1 ] to R + { + } s a t i s f y i n g   f ( α ) H ( [ u ] α , [ v ] α )   for   all   α [ 0 , 1 ] } . Then the function H ( [ u ] α , [ v ] α ) of α on [ 0 , 1 ] belongs to S. Hence we have (a) inf f S 0 1 f ( α ) p d α 1 / p 0 1 H ( [ u ] α , [ v ] α ) p d α 1 / p . On the other hand, for each f S , 0 1 f ( α ) p d α 1 / p 0 1 H ( [ u ] α , [ v ] α p d α 1 / p as f ( α ) H ( [ u ] α , [ v ] α ) for all α [ 0 , 1 ] . Thus we obtain (b) inf f S 0 1 f ( α ) p d α 1 / p 0 1 H ( [ u ] α , [ v ] α ) p d α 1 / p . So d p * ( u , v ) = inf f S 0 1 f ( α ) p d α 1 / p = ( by ( a )   and   ( b ) ) 0 1 H ( [ u ] α , [ v ] α ) p d α 1 / p = d p ( u , v ) .
Theorem 3.8 of [10] says that if X = R m , then d p ( u , v ) is well-defined. Obviously, by this and (iv), we obtain that if X = R m , then d p * ( u , v ) = d p ( u , v ) . So (v) holds. (vi) follows immediately from (v).
Let Y be a nonempty set, Z a subset of Y, and ρ 1 and ρ 2 two extended metrics on Y. We say that ρ 1 is stronger than ρ 2 on Z, denoted by ρ 1 ρ 2 ( Z ) , if for each sequence { y n } in Z and each y Z , lim n ρ 1 ( y n , y ) = 0 implies that lim n ρ 2 ( y n , y ) = 0 .
ρ 1 is stronger than ρ 2 on Z is also known as ρ 2 is weaker than ρ 1 on Z and written as ρ 2 ρ 1 ( Z ) . ρ 1 is said to be equivalent to ρ 2 on Z, denoted by ρ 1 ρ 2 ( Z ) , if ρ 1 ρ 2 ( Z ) and ρ 2 ρ 1 ( Z ) .
The expression ρ 1 S ρ 2 ( Z ) , where S is a set of extended metrics on Y, means that for each ρ S , ρ 1 ρ ρ 2 ( Z ) .
Theorem 2.2. 
[11] d { H send , d p * } H end ( F U S C 1 ( X ) ) .
Proof. 
By Theorem 2.1(i), d H send H end ( F U S C 1 ( X ) ) . By Theorem 2.1(ii), d d p * ( F U S C 1 ( X ) ) . By Theorem 2.1(iii), d p * H end ( F U S C 1 ( X ) ) . Theorem 6.2 of [11] also says that d p * H end ( F U S C 1 ( X ) ) . So this theorem is indeed given in [11].
By Theorems 2.2 and 2.1(v), we have the following conclusion.
Corollary 2.3. 
[10,11,20] d { H send , d p } H end ( F U S C 1 ( R m ) ) .
d , d p , H send and H end are metrics on F U S C B 1 ( X ) .
The corresponding author of this paper independently gave Section 2.

3. Triangular Fuzzy Numbers and Trapezoidal Fuzzy Numbers

In this section, we review some basic concepts and properties related to the triangular fuzzy numbers and the trapezoidal fuzzy numbers.
Usually, the symbols ( a , b , c , d ) with a , b , c , d in R represent the elements in R 4 and the symbols ( a , b , c ) with a , b , c in R represent the elements in R 3 . In this paper, for each a , b , c , d in R , we use [ a , b , c , d ] instead of ( a , b , c , d ) to represent the corresponding element in R 4 , and use [ a , b , c ] instead of ( a , b , c ) to represent the corresponding element in R 3 .
We use T to denote the set { [ a , b , c , d ] R 4 : a b c d } and T 0 to denote the set { [ a , b , c , d ] R 4 : a < b c < d } . Clearly T 0 T .
We use G to denote the set { [ a , b , c ] R 3 : a b c } and G 0 to denote the set { [ a , b , c ] R 3 : a < b < c } . Clearly G 0 G .
Definition 3.1. 
We use Tag to denote the set of all regular triangular fuzzy numbers. T a g : = { ( a , b , c ) : [ a , b , c ]   in   G 0 } , where, for any [ a , b , c ] in G 0 , the regular triangular fuzzy number ( a , b , c ) is defined to be the fuzzy set u in F ( R ) given by
u ( x ) = x a b a , if a x b , c x c b , if b x c , 0 , if x R [ a , c ] .
Definition 3.2. 
We use Tap to denote the set of all regular trapezoidal fuzzy numbers. T a p : = { ( a , b , c , d ) : [ a , b , c , d ]   in   T 0 } , where, for any [ a , b , c , d ] in T 0 , the regular trapezoidal fuzzy number ( a , b , c , d ) is defined to be the fuzzy set u in F ( R ) given by
u ( x ) = x a b a , if a x b , 1 , if b x c , d x d c , if c x d , 0 , if x R [ a , d ] .
Remark 3.3. 
(i) u ∈ Tag means that there is an [a, b, c] ∈ G0 satisfying u = (a, b, c). (ii) u ∈ Tap means that there is an [a, b, c, d] ∈ T0 satisfying u = (a, b, c, d). (iii) Each regular triangular fuzzy number (a, b, c) is the regular trapezoidal fuzzy number (a, b, b, c). So Tag ⊆ Tap.
We say that two fuzzy sets are equal if they have the same membership function.
Definition 3.4. 
We use Trag to denote the set of all triangular fuzzy numbers. T r a g : = { ( a , b , c ) : [ a , b , c ]   i n   G } , where, for any [ a , b , c ] in G, the triangular fuzzy number ( a , b , c ) is defined to be the fuzzy set u in F ( R ) in the following way:
u   i s   t h e   r e g u l a r   t r i a n g u l a r   f u z z y   n u m b e r   ( a , b , c )   w h e n   a   < b < c ; u ( x ) = c x c b , i f b x c , 0 , i f x R [ b , c ] , w h e n   a = b < c ; u ( x ) = x a b a , i f a x b , 0 , i f x R [ a , b ] , w h e n   a < b = c ; u ( x ) = 1 , i f x = b , 0 , i f x R { b } , w h e n   a = b = c .
Clearly each ( a , b , c ) in Tag is the ( a , b , c ) in Trag. This means that the concept of triangular fuzzy numbers is a kind of generalization of the concept of regular triangular fuzzy numbers. Hence Tag ⊆ Trag.
Definition 3.5. 
We use Trap to denote the set of all trapezoidal fuzzy numbers. T r a p : = { ( a , b , c , d ) : [ a , b , c , d ]   i n   T } , where, for any [ a , b , c , d ] in T, the trapezoidal fuzzy number ( a , b , c , d ) is defined to be the fuzzy set u in F ( R ) in the following way:
u   i s   t h e   r e g u l a r   t r a p e z o i d a l   f u z z y   n u m b e r   ( a , b , c , d )   w h e n   a < b c < d ; u ( x ) = 1 , i f b x c , d x d c , i f c x d , 0 , i f x R [ b , d ] , w h e n   a = b c < d ; u ( x ) = x a b a , i f a x b , 1 , i f b x c , 0 , i f x R [ a , c ] , w h e n   a < b c = d ; u ( x ) = 1 , i f b x c , 0 , i f x R [ b , c ] , w h e n   a = b c = d .
Clearly each ( a , b , c , d ) in Tap is the ( a , b , c , d ) in Trap. This means that the concept of trapezoidal fuzzy numbers is a kind of generalization of the concept of regular trapezoidal fuzzy numbers. Hence Tap ⊆ Trap.
Remark 3.6. 
(i) u Trag means that there is an [ a , b , c ] G satisfying u = ( a , b , c ) . (ii) u Trap means that there is an [ a , b , c , d ] T satisfying u = ( a , b , c , d ) .
Remark 3.7. 
Each triangular fuzzy number ( a , b , c ) is the trapezoidal fuzzy number ( a , b , b , c ) . So Trag ⊆ Trap.
The readers may also refer to the corresponding contents in [22] for details.

4. Some Properties of Trapezoidal Fuzzy Numbers and Triangular Fuzzy numbers

In this section, we recall and give some properties of the trapezoidal fuzzy numbers and triangular fuzzy numbers. These properties are useful to obtain and understand the main results of this paper.
The following Propositions 4.1 and 4.2 should be known. See [5] and related works. Clearly, Proposition 4.2 is a corollary of Proposition 4.1.
Proposition 4.1. 
Let u F ( R ) and ( a , b , c , d ) Trap. Then u = ( a , b , c , d ) if and only if
f o r   e a c h   ξ [ 0 , 1 ] , [ u ] ξ = [ ξ ( b a ) + a , c + ( 1 ξ ) ( d c ) ] .
Proposition 4.2. 
Let u F ( R ) and ( a , b , c ) Trag. Then u = ( a , b , c ) if and only if f o r   e a c h   ξ [ 0 , 1 ] , [ u ] ξ = [ ξ ( b a ) + a , b + ( 1 ξ ) ( c b ) ] .
For any [ a , b , c , d ] and [ a 1 , b 1 , c 1 , d 1 ] in R 4 , [ a , b , c , d ] = [ a 1 , b 1 , c 1 , d 1 ] means that a = a 1 , b = b 1 , c = c 1 and d = d 1 . For any ( a , b , c , d ) and ( a 1 , b 1 , c 1 , d 1 ) in Trap, ( a , b , c , d ) = ( a 1 , b 1 , c 1 , d 1 ) means that ( a , b , c , d ) and ( a 1 , b 1 , c 1 , d 1 ) are the same fuzzy set.
For any [ a , b , c ] and [ a 1 , b 1 , c 1 ] in R 3 , [ a , b , c ] = [ a 1 , b 1 , c 1 ] means that a = a 1 , b = b 1 and c = c 1 . For any ( a , b , c ) and ( a 1 , b 1 , c 1 ) in Trag, ( a , b , c ) = ( a 1 , b 1 , c 1 ) means that ( a , b , c ) and ( a 1 , b 1 , c 1 ) are the same fuzzy set.
The following Theorem 4.3(ii) states the representation uniqueness of the trapezoidal fuzzy numbers.
Theorem 4.3. 
(i) Let u = ( a , b , c , d ) be in Trap. Then [ u ] 0 = [ a , d ] and [ u ] 1 = [ b , c ] . (ii) Let ( a , b , c , d ) and ( a 1 , b 1 , c 1 , d 1 ) be in Trap. Then ( a , b , c , d ) = ( a 1 , b 1 , c 1 , d 1 ) if and only if [ a , b , c , d ] = [ a 1 , b 1 , c 1 , d 1 ] . (iii) Let u = ( a , b , c , d ) be in Tap. Then [ u ] 0 = [ a , d ] and [ u ] 1 = [ b , c ] . (iv) Let ( a , b , c , d ) and ( a 1 , b 1 , c 1 , d 1 ) be in Tap. Then ( a , b , c , d ) = ( a 1 , b 1 , c 1 , d 1 ) if and only if [ a , b , c , d ] = [ a 1 , b 1 , c 1 , d 1 ] .
Proof. 
By Definition 3.5 and easy calculations, we obtain (i). (One way to perform these calculations are to do it based on watching the graphs of the membership functions of ( a , b , c , d ) in the four cases a < b c < d , a = b c < d , a < b c = d and a = b c = d .) (i) follows immediately from Proposition Proposition 4.1.
Now we show (ii). If [ a , b , c , d ] = [ a 1 , b 1 , c 1 , d 1 ] , i.e. a = a 1 , b = b 1 , c = c 1 and d = d 1 , then, by Definition 3.5, ( a , b , c , d ) = ( a 1 , b 1 , c 1 , d 1 ) .
Suppose that ( a , b , c , d ) = ( a 1 , b 1 , c 1 , d 1 ) . Then [ ( a , b , c , d ) ] 1 = [ ( a 1 , b 1 , c 1 , d 1 ) ] 1 and [ ( a , b , c , d ) ] 0 = [ ( a 1 , b 1 , c 1 , d 1 ) ] 0 . By (i), this means that [ b , c ] = [ b 1 , c 1 ] and [ a , d ] = [ a 1 , d 1 ] . This is equivalent to a = a 1 , b = b 1 , c = c 1 and d = d 1 ; that is, [ a , b , c , d ] = [ a 1 , b 1 , c 1 , d 1 ] . So (ii) is proved.
As Tap is a subset of Trap, (iii) follows immediately from (i), and (iv) follows immediately from (ii). (iii) is easy and should be known.
Proposition 4.4(ii) gives the representation uniqueness of the triangular fuzzy numbers.
Proposition 4.4. 
(i) Let u = ( a , b , c ) be in Trag. Then [ u ] 0 = [ a , c ] and [ u ] 1 = { b } . (ii) Let ( a , b , c ) and ( a 1 , b 1 , c 1 ) be in Trag. Then ( a , b , c ) = ( a 1 , b 1 , c 1 ) if and only if [ a , b , c ] = [ a 1 , b 1 , c 1 ] . (iii) Let u = ( a , b , c ) be in Tag. Then [ u ] 0 = [ a , c ] and [ u ] 1 = { b } . (iv) Let ( a , b , c ) and ( a 1 , b 1 , c 1 ) be in Tag. Then ( a , b , c ) = ( a 1 , b 1 , c 1 ) if and only if [ a , b , c ] = [ a 1 , b 1 , c 1 ] .
Proof. 
By Definition 3.4 and easy calculations, we obtain (i). (One way to perform these calculations are to do it based on watching the graphs of the membership functions of ( a , b , c ) in the four cases a < b < c , a = b < c , a < b = c and a = b = c .) (i) follows immediately from Proposition 4.2.
Now we show (ii). If [ a , b , c ] = [ a 1 , b 1 , c 1 ] , i.e. a = a 1 , b = b 1 and c = c 1 , then, by Definition 3.4, ( a , b , c ) = ( a 1 , b 1 , c 1 ) .
Suppose that ( a , b , c ) = ( a 1 , b 1 , c 1 ) . Then [ ( a , b , c ) ] 1 = [ ( a 1 , b 1 , c 1 ) ] 1 and [ ( a , b , c ) ] 0 = [ ( a 1 , b 1 , c 1 ) ] 0 . By (i), this means that { b } = { b 1 } and [ a , c ] = [ a 1 , c 1 ] . This is equivalent to a = a 1 , b = b 1 and c = c 1 ; that is, [ a , b , c ] = [ a 1 , b 1 , c 1 ] . So (ii) is proved.
As Tag is a subset of Trag, (iii) follows immediately from (i), and (iv) follows immediately from (ii). (iii) is easy and should be known.
The above proofs of Theorem 4.3 and Proposition 4.4 are similar. Clearly for k=i, ii, iii, iv, Proposition 4.4(k) is a corollary of Theorem 4.3(k) (see also Remark 4.3 in [22] for details).
We know that Tag ⊆ Trag, Tap ⊆ Trap, Tag ⊆ Tap, and Trag ⊆ Trap (see Section 3). Based on Theorem 4.3(ii) and Proposition 4.4(ii), it is easy to see that Tag ⫋ Trag, Tap ⫋ Trap, Tag ⫋ Tap, and Trag ⫋ Trap. (see also Remarks 4.7 and 4.8 in [22] for details.)
Define
F U S C B ( X ) : = { u F U S C ( X ) : [ u ] 0 K ( X ) { } } , F U S C B 1 ( X ) : = { u F U S C B ( X ) : [ u ] 1 } .
Clearly F U S C B 1 ( X ) F U S C B ( X ) , F U S C B 1 ( X ) F U S C 1 ( X ) and F U S C B ( X ) F U S C ( X ) .
For u F ( R ) , we call u a 1-dimensional compact fuzzy number if u has the following properties:
(i) [ u ] 1 ; and
(ii) for each α [ 0 , 1 ] , [ u ] α is a compact interval of R .
The set of all 1-dimensional compact fuzzy numbers is denoted by E. For u E and α [ 0 , 1 ] , [ u ] α is denoted by [ u ( α ) , u + ( α ) ] .
Let u Trap. Denote u = ( a , b , c , d ) . By Proposition 4.1, [ u ] 1 = [ b , c ] and for each ξ [ 0 , 1 ] , [ u ] ξ = [ ξ ( b a ) + a , c + ( 1 ξ ) ( d c ) ] is a compact interval of R . Also u F ( R ) . Thus u E . So Trap E . Clearly Trap E (see also [25]), and E F U S C B 1 ( R ) F U S C 1 ( R ) . So Trap F U S C 1 ( R ) , and then, by Corollary 2.3, we have that
Corollary 4.5. 
[10,11,20] d { H send , d p } H end ( T r a p ) .
As Trap F U S C 1 ( R ) is a quite obvious fact and this fact should be known, we think it is reasonable to cite Corollary 2.3 when we use the fact given in Corollary 4.5.

5. Main Results

In this section, we show the equivalence of the four common types of metrics d , d p , H send and H end are equivalent on the trapezoidal fuzzy numbers. We do this by verifying that the convergence induced by these metrics is the convergence of the corresponding representation quadruples of the trapezoidal fuzzy numbers in R 4 .
First we give a characterization of the supremum metric d on Trap.
Lemma 5.1. 
Let u = ( a 1 , b 1 , c 1 , d 1 ) and v = ( a , b , c , d ) be two trapezoidal fuzzy numbers.
(i) sup ξ [ 0 , 1 ] | u ( ξ ) v ( ξ ) | = max { | a 1 a | , | b 1 b | } .
(ii) sup ξ [ 0 , 1 ] | u + ( ξ ) v + ( ξ ) | = max { | c 1 c | , | d 1 d | } .
(iii) d ( u , v ) = max { | a 1 a | , | b 1 b | , | c 1 c | , | d 1 d | } .
Proof. 
Set A : = max { | a 1 a | , | b 1 b | } and B : = max { | c 1 c | , | d 1 d | } . Notice that for each ξ [ 0 , 1 ] ,
| u ( ξ ) v ( ξ ) | = | ξ ( b 1 a 1 ) + a 1 ( ξ ( b a ) + a ) | ( by   ( 2 ) , see   ( I )   below ) = | ξ ( b 1 b ) + ( 1 ξ ) ( a 1 a ) | | ξ A + ( 1 ξ ) A | = | A | = A .
Thus sup ξ [ 0 , 1 ] | u ( ξ ) v ( ξ ) | A . On the other hand, since | u ( 0 ) v ( 0 ) | = | a 1 a | and | u ( 1 ) v ( 1 ) | = | b 1 b | , we have that sup ξ [ 0 , 1 ] | u ( ξ ) v ( ξ ) | A . So sup ξ [ 0 , 1 ] | u ( ξ ) v ( ξ ) | = A . Hence (i) is proved.
The proof of (ii) is similar to that of (i). Notice that for each ξ [ 0 , 1 ] ,
| u + ( ξ ) v + ( ξ ) | = | c 1 + ( 1 ξ ) ( d 1 c 1 ) ( c + ( 1 ξ ) ( d c ) ) | = | ξ ( c 1 c ) + ( 1 ξ ) ( d 1 d ) | | ξ B + ( 1 ξ ) B | = | B | = B .
Thus sup ξ [ 0 , 1 ] | u + ( ξ ) v + ( ξ ) | B . On the other hand, since | u + ( 0 ) v + ( 0 ) | = | d 1 d | and | u + ( 1 ) v + ( 1 ) | = | c 1 c | , we have that sup ξ [ 0 , 1 ] | u + ( ξ ) v + ( ξ ) | B . So sup ξ [ 0 , 1 ] | u + ( ξ ) v + ( ξ ) | = B . Hence (ii) is proved.
Note that
d ( u , v ) = sup ξ [ 0 , 1 ] H ( [ u ] ξ , [ v ] ξ ) = ( by   ( 1 ) ) sup ξ [ 0 , 1 ] ( | u ( ξ ) v ( ξ ) | | u + ( ξ ) v + ( ξ ) | ) = sup ξ [ 0 , 1 ] | u ( ξ ) v ( ξ ) | sup ξ [ 0 , 1 ] | u + ( ξ ) v + ( ξ ) | = ( by   ( i )   and   ( ii ) ) A B = max { | a 1 a | , | b 1 b | , | c 1 c | , | d 1 d | } .
So (iii) is proved.
(I) In this paper, we often use (2) without citing since it is easy to see.
Remark 5.2. 
Let u = ( a , b , c , d ) = ( a 1 , b 1 , c 1 , d 1 ) Trap. Then 0 = d ( u , u ) = ( b y   Lemma   5.1 ( iii ) ) max { | a 1 a | , | b 1 b | , | c 1 c | , | d 1 d | } . Thus a 1 = a , b 1 = b , c 1 = c and d 1 = d . Hence “⇒” of Theorem 4.3(ii) holds. “⇐” of Theorem 4.3(ii) holds obviously. So Lemma 5.1(iii) implies Theorem 4.3(ii). As Proposition 4.4(ii) is a corollary of Theorem 4.3(ii), Lemma 5.1(iii) also implies Proposition 4.4(ii).
By Remark 3.7, Lemma 5.1(iii) implies (a) for each u = ( a , b , c ) and v = ( a 1 , b 1 , c 1 ) in Trag, d ( u , v ) = max { | a 1 a | , | b 1 b | , | c 1 c | } . Clearly, (a) implies Proposition 4.4(ii).
Remark 5.3. 
The conclusions in this remark are easy to see. The symbols in this remark are consistent with those in the proof of Lemma 5.1.
(i) sup ξ [ 0 , 1 ] | u ( ξ ) v ( ξ ) | = max ξ [ 0 , 1 ] | u ( ξ ) v ( ξ ) | .
(ii) sup ξ [ 0 , 1 ] | u + ( ξ ) v + ( ξ ) | = max ξ [ 0 , 1 ] | u + ( ξ ) v + ( ξ ) | .
(iii) (iii-1) (a) If d ( u , v ) = | a 1 a | , then d ( u , v ) = H ( [ u ] 0 , [ v ] 0 ) = max ξ [ 0 , 1 ] H ( [ u ] ξ , [ v ] ξ )
(b) If d ( u , v ) = | a 1 a | , then d ( u , v ) = | u ( 0 ) v ( 0 ) | = max ξ [ 0 , 1 ] | u ( ξ ) v ( ξ ) | .
(iii-2) If d ( u , v ) = | b 1 b | , then d ( u , v ) = H ( [ u ] 1 , [ v ] 1 ) = max ξ [ 0 , 1 ] H ( [ u ] ξ , [ v ] ξ ) and d ( u , v ) = | u ( 1 ) v ( 1 ) | = max ξ [ 0 , 1 ] | u ( ξ ) v ( ξ ) | .
(iii-3) If d ( u , v ) = | c 1 c | , then d ( u , v ) = H ( [ u ] 1 , [ v ] 1 ) = max ξ [ 0 , 1 ] H ( [ u ] ξ , [ v ] ξ ) and d ( u , v ) = | u + ( 1 ) v + ( 1 ) | = max ξ [ 0 , 1 ] | u + ( ξ ) v + ( ξ ) | .
(iii-4) If d ( u , v ) = | d 1 d | , then d ( u , v ) = H ( [ u ] 0 , [ v ] 0 ) = max ξ [ 0 , 1 ] H ( [ u ] ξ , [ v ] ξ ) and d ( u , v ) = | u + ( 0 ) v + ( 0 ) | = max ξ [ 0 , 1 ] | u + ( ξ ) v + ( ξ ) | .
(iv) d ( u , v ) = max ξ [ 0 , 1 ] H ( [ u ] ξ , [ v ] ξ ) .
Note that A = | a 1 a | = | u ( 0 ) v ( 0 ) | or A = | b 1 b | = | u ( 1 ) v ( 1 ) | . Combining this and Lemma 5.1(i) yields that the supremum in (i) is attainable; that is, this supremum can be replaced by maximum. Hence (i) holds.
Note that B = | d 1 d | = | u + ( 0 ) v + ( 0 ) ) | or B = | c 1 c | = | u + ( 1 ) v + ( 1 ) ) | . Combining this and Lemma 5.1(ii) yields that the supremum in (ii) is attainable. Hence (ii) holds.
Note that d ( u , v ) = sup ξ [ 0 , 1 ] H ( [ u ] ξ , [ v ] ξ ) H ( [ u ] 0 , [ v ] 0 ) | u ( 0 ) v ( 0 ) | = | a 1 a | . So if d ( u , v ) = | a 1 a | , then d ( u , v ) = sup ξ [ 0 , 1 ] H ( [ u ] ξ , [ v ] ξ ) = H ( [ u ] 0 , [ v ] 0 ) , and hence this supremum is attainable. Thus (iii-1)(a) holds.
Note that d ( u , v ) = sup ξ [ 0 , 1 ] ( | u ( ξ ) v ( ξ ) | | u + ( ξ ) v + ( ξ ) | ) sup ξ [ 0 , 1 ] | u ( ξ ) v ( ξ ) | | u ( 0 ) v ( 0 ) | = | a 1 a | . So if d ( u , v ) = | a 1 a | , then d ( u , v ) = sup ξ [ 0 , 1 ] | u ( ξ ) v ( ξ ) | = | u ( 0 ) v ( 0 ) | , and hence this supremum is attainable. Thus (iii-1)(b) holds. So (iii-1) is proved. The proof of any of (iii-2), (iii-3) and (iii-4) is similar to that of (iii-1).
By Lemma 5.1(iii), d ( u , v ) is equal to some of | a 1 a | , | b 1 b | , | c 1 c | and | d 1 d | . So, by (iii), (iv) is true.
Lemma 5.4. 
Let { u n = ( a n , b n , c n , d n ) : n N } be a sequence of trapezoidal fuzzy numbers and u = ( a , b , c , d ) a trapezoidal fuzzy number. Then the following three statements are equivalent: (i) lim n d ( u n , u ) = 0 ; (ii) lim n max { | a n a | , | b n b | , | c n c | , | d n d | } = 0 ; (iii) lim n a n = a , lim n b n = b , lim n c n = c and lim n d n = d .
Proof. 
By Lemma 5.1(iii), (i)⇔(ii). Clearly (ii)⇔(iii). So the statements (i), (ii) and (iii) are equivalent.
Theorem 5.5. 
Let { u n = ( a n , b n , c n , d n ) : n N } be a sequence of trapezoidal fuzzy numbers and u = ( a , b , c , d ) a trapezoidal fuzzy number. Then the following statements are equivalent.
(i) lim n a n = a , lim n b n = b , lim n c n = c , and lim n d n = d .
(ii) lim n d ( u n , u ) = 0 .
(iii) There exist ξ 1 and ξ 2 in [ 0 , 1 ] with ξ 1 ξ 2 satisfying
lim n H ( [ u n ] ξ 1 , [ u ] ξ 1 ) = 0 ,
lim n H ( [ u n ] ξ 2 , [ u ] ξ 2 ) = 0 .
(iv) There exist ξ 1 and ξ 2 in [ 0 , 1 ] with ξ 1 ξ 2 satisfying
( i v - 1 ) lim n ( ξ 1 ( b n a n ) + a n ) = ξ 1 ( b a ) + a , ( i v - 2 ) lim n ( ξ 2 ( b n a n ) + a n ) = ξ 2 ( b a ) + a , ( i v - 3 ) lim n ( c n + ( 1 ξ 1 ) ( d n c n ) ) = c + ( 1 ξ 1 ) ( d c ) , a n d ( i v - 4 ) lim n ( c n + ( 1 ξ 2 ) ( d n c n ) ) = c + ( 1 ξ 2 ) ( d c ) .
Proof. 
By Lemma 5.4, (i)⇔(ii). Clearly (ii)⇒(iii), as for each v , w Trap, d ( v , w ) = sup α [ 0 , 1 ] H ( [ v ] α , [ w ] α ) .
By (1) and (2), for each ξ 1 [ 0 , 1 ] , (3) holds means that both (iv-1) and (iv-3) hold. By (1) and (2), for each ξ 2 [ 0 , 1 ] , (4) holds means that both (iv-2) and (iv-4) hold. So (iii)⇔(iv).
Now we show that (iv)⇒(i). (Obviously, (i)⇒(iv).) Assume that (iv) is true. Computing (iv-1)−(iv-2), we obtain (a) lim n ( ξ 1 ξ 2 ) ( b n a n ) = ( ξ 1 ξ 2 ) ( b a ) . As ξ 1 ξ 2 0 , (a) is equivalent to (iv-5) lim n ( b n a n ) = ( b a ) . Computing (iv-1) ξ 1 · (iv-5), we have (iv-6) lim n a n = a . Computing (iv-5)+(iv-6), we obtain lim n b n = b . Similarly, from (iv-3) and (iv-4), we can deduce that lim n c n = c and lim n d n = d (see also (I) below). So (i) is true. Hence (iv)⇒(i) is proved.
Thus (i), (ii), (iii) and (iv) are equivalent. This completes the proof.
(I) Computing (iv-3)−(iv-4), we obtain (b) lim n ( ξ 2 ξ 1 ) ( d n c n ) = ( ξ 2 ξ 1 ) ( d c ) . As ξ 2 ξ 1 0 , (b) is equivalent to (iv-7) lim n ( d n c n ) = ( d c ) . Computing (iv-3) ( 1 ξ 1 ) · (iv-7), we have (iv-8) lim n c n = c . Computing (iv-7)+(iv-8), we obtain lim n d n = d .
Let S be a subset of R , and P ( x ) a statement about real numbers x. If there exists a set S 1 of measure zero such that P ( x ) holds for all x S S 1 , then we say that P ( x ) holds almost everywhere on x S . For simplicity, “almost everywhere” is also written as “a.e.”.
The result of the following Theorem 5.6 was first given in [24]. As E S ˜ n c 1 (E is also written as E 1 . See Page 57 of [23] for the definition of S ˜ n c 1 and the relation of E and S ˜ n c 1 ), the result of Theorem 5.6 is part of the result of Theorem 9.4 in [23].
Theorem 5.6. 
[23,24] Suppose that u, u n , n = 1 , 2 , are fuzzy sets in E. Then the following statements are equivalent. (i) lim n H end ( u n , u ) = 0 . (ii) lim n H ( [ u n ] α , [ u ] α ) = 0 holds a.e. on α ( 0 , 1 ) . (iii) u = lim n ( Γ ) u n .
Theorem 5.7. 
Let { u n = ( a n , b n , c n , d n ) : n N } be a sequence of trapezoidal fuzzy numbers and u = ( a , b , c , d ) a trapezoidal fuzzy number. Then the following statements are equivalent.
(i) lim n d ( u n , u ) = 0 .
(ii) lim n d p ( u n , u ) = 0 .
(iii) lim n H send ( u n , u ) = 0 .
(iv) lim n H end ( u n , u ) = 0 .
(v) lim n a n = a , lim n b n = b , lim n c n = c , and lim n d n = d .
Proof. 
By Theorem 5.5, (v)⇔(i). So to show the desired result, it suffices to show that (i)⇔(ii)⇔(iii)⇔(iv). By Corollary 4.5, to show (i)⇔(ii)⇔(iii)⇔(iv), we only need to show that (iv)⇒(i).
Suppose that (iv) holds. As Trap E , by Theorem 5.6, (iv) means that lim n H ( [ u n ] α , [ u ] α ) = 0 holds a.e. on α ( 0 , 1 ) . Then there exists two distinct ξ 1 and ξ 2 in ( 0 , 1 ) such that lim n H ( [ u n ] ξ 1 , [ u ] ξ 1 ) = 0 and lim n H ( [ u n ] ξ 2 , [ u ] ξ 2 ) = 0 . Hence, by Theorem 5.5, (i) holds. Thus (iv)⇒(i). This completes the proof.
Theorem 5.8. 
d d p H send H end ( Trap ) .
Proof. 
The desired result follows immediately from Theorem 5.7.
Corollary 5.9. 
Let { u n = ( a n , b n , c n , d n ) : n N } be a sequence of trapezoidal fuzzy numbers and u = ( a , b , d ) a triangular fuzzy number. Then the following statements are equivalent.
(i) lim n d ( u n , u ) = 0 .
(ii) lim n d p ( u n , u ) = 0 .
(iii) lim n H send ( u n , u ) = 0 .
(iv) lim n H end ( u n , u ) = 0 .
(v) lim n a n = a , lim n b n = b , lim n c n = b , and lim n d n = d .
Proof. 
Note that, by Remark 3.7, u is the trapezoidal fuzzy number ( a , b , b , d ) . Thus the desired result follows immediately from Theorem 5.7.
Corollary 5.10. 
Let { u n = ( a n , b n , c n ) : n N } be a sequence of triangular fuzzy numbers and u = ( a , b , c ) a triangular fuzzy number. Then the following statements are equivalent.
(i) lim n d ( u n , u ) = 0 .
(ii) lim n d p ( u n , u ) = 0 .
(iii) lim n H send ( u n , u ) = 0 .
(iv) lim n H end ( u n , u ) = 0 .
(v) lim n a n = a , lim n b n = b , and lim n c n = c .
Proof. 
Note that, by Remark 3.7, u is the trapezoidal fuzzy number ( a , b , b , c ) and { u n } is the sequence of trapezoidal fuzzy numbers { ( a n , b n , b n , c n ) : n N } . Thus the desired result follows immediately from Theorem 5.7.
Clearly, the desired result also follows from Corollary 5.9.

6. Conclusions

In this paper we find that d , d p , H send and H end are equivalent metrics on the trapezoidal fuzzy numbers. Furthermore we show that convergence induced by these metrics is the convergence of the corresponding representation quadruples of the trapezoidal fuzzy numbers in R 4 .
As d , d p , H send and H end are commonly used metrics on the trapezoidal fuzzy numbers, the results of this paper have potential effects on the analysis and applications of the triangular fuzzy numbers and the trapezoidal fuzzy numbers.

Author Contributions

Formal analysis, Q.M.; methodology, H.H.; writing-original draft preparation, Q.M. and H.H.; writing-review and editing, H.H.

Institutional Review Board Statement

Not applicable.

Informed Consent Statement

Not applicable.

Data Availability Statement

Not applicable.

Conflicts of Interest

The authors declare no conflict of interest.

References

  1. Wang, L.; Mendel, J. Generating fuzzy rules by learning from examples, IEEE Trans. Syst. Man Cybern. 1992, 22(6), 1414–1427. [CrossRef]
  2. Dubois, D.; Prade, H. Fundamentals of Fuzzy Sets, The Handbooks of Fuzzy Sets Series, London, UK: Kluwer Academic Publishers, 2000.
  3. Diamond, P.; Kloeden, P. Metric Spaces of Fuzzy Sets, Singapore: World Scientific, 1994.
  4. Wang, G.; Shi, P.; Messenger, P. Representation of uncertain multichannel digital signal spaces and study of pattern recognition based on metrics and difference values on fuzzy n-cell number spaces, IEEE Trans. Fuzzy Syst. 2009, 17(2), 421–439. [CrossRef]
  5. Coroianu, L. Trapezoidal approximations of fuzzy numbers using quadratic programs, Fuzzy Sets Syst. 2021, 417, 71-92. [CrossRef]
  6. Rojas-Medar, M.; Román-Flores, H. On the equivalence of convergences of fuzzy sets, Fuzzy Sets Syst. 1996, 80, 217–224.
  7. Fan, T. On the compactness of fuzzy numbers with sendograph, Fuzzy Sets Syst. 2004, 143, 471–477. [CrossRef]
  8. Kloeden, P.E.; Lorenz, T. A Peano theorem for fuzzy differential equations with evolving membership grade, Fuzzy Sets Syst. 2015, 280, 1–26. [CrossRef]
  9. Kupka, J. On approximations of Zadeh’s extension principle, Fuzzy Sets Syst. 2016, 283, 26–39. [CrossRef]
  10. Huang, H. Properties of fuzzy set spaces with Lp metrics, Fuzzy Sets Syst. 2025, 504, 109256. [CrossRef]
  11. Huang, H. Properties of several metric spaces of fuzzy sets, Fuzzy Sets Syst. 2024, 475, 108745. [CrossRef]
  12. Huang, H. Characterizations of compactness of fuzzy set space with endograph metric, Soft Comput 2024, 28, 9115–9136. [CrossRef]
  13. Wu, C.; Ma, M. The Basic of Fuzzy Analysis, Beijing, China: National Defence Industry Press, 1991. (In Chinese).
  14. Wang, L.; Mendel, J. Fuzzy basis functions, universal approximation, and orthogonal least-squares learning, IEEE Trans. Neural Netw. 1992, 3(5), 807–814. [CrossRef]
  15. Gutiérrez García, J.; Prada Vicente, de M.A. Hutton [0,1]-quasi-uniformities induced by fuzzy (quasi-)metric spaces, Fuzzy Sets Syst. 2006, 157, 755–766.
  16. Qiu, D.; Shu, L.; Mo, Z.-W. On starshaped fuzzy sets, Fuzzy Sets Syst. 2009, 160, 1563–1577.
  17. Gong, Z.; Hao, Y. Fuzzy Laplace transform based on the Henstock integral and its applications in discontinuous fuzzy systems, Fuzzy Sets Syst. 2019, 358, 1–28. [CrossRef]
  18. Popa, L.; Sida, L. Fuzzy inner product space: literature review and a new approach, Mathematics 2021, 9, 765. [CrossRef]
  19. Kloeden, P.E. Compact supported endographs and fuzzy sets, Fuzzy Sets Syst. 1980, 4(2), 193-201.
  20. Huang, H. Some properties of Skorokhod metric on fuzzy sets, Fuzzy Sets Syst. 2022, 437, 35-52. [CrossRef]
  21. Huang, H.; Wu, C. Approximation of fuzzy-valued functions by regular fuzzy neural networks and the accuracy analysis, Soft Comput. 2014, 18, 2525-2540.
  22. Mao, Q.s.; Huang, H. Representation uniqueness of triangular fuzzy numbers and trapezoidal fuzzy numbers, submitted to https://www.preprints.org on 07 August 2025.
  23. Huang, H. Characterizations of endograph metric and Γ-convergence on fuzzy sets, Fuzzy Sets Syst. 2018, 350, 55-84. [CrossRef]
  24. Huang, H.; Wu, C. Characterization of Γ-convergence on fuzzy number space, in: 11th Internat. Fuzzy Systems Assoc. World Congr., Beijing, China, July 28-31, 2005; vol.1, pp.66-70.
  25. Mao, Q.s.; Huang, H. Some properties of generalized triangular fuzzy numbers and generalized trapezoidal fuzzy numbers in terms of cut sets, submitted to https://www.preprints.org on 07 August 2025.
Disclaimer/Publisher’s Note: The statements, opinions and data contained in all publications are solely those of the individual author(s) and contributor(s) and not of MDPI and/or the editor(s). MDPI and/or the editor(s) disclaim responsibility for any injury to people or property resulting from any ideas, methods, instructions or products referred to in the content.
Copyright: This open access article is published under a Creative Commons CC BY 4.0 license, which permit the free download, distribution, and reuse, provided that the author and preprint are cited in any reuse.
Prerpints.org logo

Preprints.org is a free preprint server supported by MDPI in Basel, Switzerland.

Subscribe

Disclaimer

Terms of Use

Privacy Policy

Privacy Settings

© 2026 MDPI (Basel, Switzerland) unless otherwise stated