Next Article in Journal
Resource Allocation and Minmax Scheduling Under Group Technology and Different Due-Window Assignments
Previous Article in Journal
On Distance Laplacian Energy of Unicyclic and Bicyclic Graphs
Previous Article in Special Issue
Developments of Semi-Type-2 Interval Approach with Mathematics and Order Relation: A New Uncertainty Tackling Technique
 
 
Font Type:
Arial Georgia Verdana
Font Size:
Aa Aa Aa
Line Spacing:
Column Width:
Background:
Article

Equivalence of Common Metrics on Trapezoidal Fuzzy Numbers

1
Teachers College, Jimei University, Xiamen 361021, China
2
Department of Mathematics, Jimei University, Xiamen 361021, China
*
Author to whom correspondence should be addressed.
Axioms 2025, 14(11), 826; https://doi.org/10.3390/axioms14110826
Submission received: 13 September 2025 / Revised: 27 October 2025 / Accepted: 5 November 2025 / Published: 7 November 2025
(This article belongs to the Special Issue Recent Advances in Fuzzy Sets and Related Topics, 2nd Edition)

Abstract

From both theoretical and applied perspectives, the trapezoidal fuzzy numbers are widely relevant fuzzy sets. In this paper, we show that the four kinds of common metrics—the supremum metric, the L p -type d p metrics, the sendograph metric, and the endograph metric—are equivalent on the trapezoidal fuzzy numbers. In fact, we obtain a stronger result: the convergence induced by these four kinds of metrics on the trapezoidal fuzzy numbers is equivalent to the convergence of the corresponding representation quadruples of the trapezoidal fuzzy numbers in R 4 . The latter convergence is very easy to verify. Our results give a fundamental understanding of these four kinds of common metrics on the trapezoidal fuzzy numbers and provide a quick judgment condition for the convergence induced by them.

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,6,7,8,9,10]. 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,11,12,13,14,15,16,17,18,19]. These four kinds of distances are metrics on the set of trapezoidal fuzzy numbers.
It is natural and important to consider the relationship of these four kinds of metrics on the set of trapezoidal fuzzy numbers. From the already available results, what is known is that, among them, the supremum metric is the strongest and the endograph metric is the weakest on the trapezoidal fuzzy numbers.
In this paper, we show that each one of the convergences induced by these four kinds of common metrics on the trapezoidal fuzzy numbers is 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.
In the theory of metric spaces, convergences induced by the metrics play a key role. Our results give a fundamental understanding of the four kinds of common metrics on the trapezoidal fuzzy numbers. As the convergence in R 4 is very easy to verify, we provide a quick judgment condition for the convergence induced by them.
The remainder part 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. Finally, in Section 6, we give our conclusions.

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,8,11,16,17,20,21,22,23,24,25].
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 . We use R + to denote the set { r R : r 0 } .
Let Y be a nonempty set. The symbol P ( Y ) denotes the power set of Y, i.e., the set of all subsets of Y. The symbol F ( Y ) denotes the set of all fuzzy sets in Y. We see a fuzzy set in Y as a function 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 is called the endograph of u, and send u is called the sendograph of u. Clearly end u = send u ( X × { 0 } ) .
In this paper, we suppose that X is a nonempty set, and it is equipped with a metric d. For convenience, X is also used to denote the metric space  ( X , d ) .
The symbol H is used 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 any U , V C ( X ) , where
H * ( U , V ) = sup u U d ( u , V ) = sup u U inf v V d ( u , v ) .
For convenience, we often refer to the Hausdorff extended metric as the Hausdorff metric. See also Remark 2.5 of [19].
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 ] induced by d is defined as follows: for any ( x , α ) , ( y , β ) X × [ 0 , 1 ] , d ¯ ( ( x , α ) , ( y , β ) ) = d ( x , y ) + | α β | . When there is no risk of confusion, H is also used to denote the Hausdorff extended metric on C ( X × [ 0 , 1 ] ) induced by d ¯ .
The symbol F U S C ( X ) denotes 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 distance H send was introduced by Kloeden [26]. Both d and H send on F U S C 1 ( X ) are extended metrics, but each one of them is not necessarily a metric. H end on F U S C 1 ( X ) is a metric. See also Remark 2.7 of [19].
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 assume that, in the sequel, “p” appearing 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 [19]). So, the following d p * extended metrics on F U S C 1 ( X ) are introduced in [27] (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 ] t o   R + { + } , s a t i s f y i n g   f ( α ) H ( [ u ] α , [ v ] α )   f o r   a l l   α [ 0 , 1 ] } .
Theorem 1
( [18,19,27]). 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 ) p + 1 p + 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) is (1) of [18]. (i) may have been a known conclusion before the appearance of [18]. (ii) is (13) of [18]. (iii) is Theorem 4.1(i) of [19]. (iv) is given in Remark 3.2 of [27]. (iv) is obvious. A routine proof of (iv) is given below.
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 ] t o   R + { + } , s a t i s f y i n g   f ( α ) H ( [ u ] α , [ v ] α ) f o r   a l l   α [ 0 , 1 ] } . Suppose that d p ( u , v ) is well-defined; that is, H ( [ u ] α , [ v ] α ) is a measurable function of α on [ 0 , 1 ] . Then, the function H ( [ u ] α , [ v ] α ) of α on [ 0 , 1 ] belongs to S. (The converse is also true.) 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 = ( b y   ( a )   a n d   ( b ) ) 0 1 H ( [ u ] α , [ v ] α ) p d α 1 / p = d p ( u , v ) .
Theorem 3.8 of [19] 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
([18]). d { H send , d p * } H end ( F U S C 1 ( X ) ) .
Proof. 
By Theorem 1(i), d H send H end ( F U S C 1 ( X ) ) . By Theorem 1(ii), d d p * ( F U S C 1 ( X ) ) . By Theorem 1(iii), d p * H end ( F U S C 1 ( X ) ) . Theorem 6.2 of [18] also says that d p * H end ( F U S C 1 ( X ) ) . So, this theorem is indeed given in [18]. □
By Theorems 1(v) and 2, we make the following conclusion:
Corollary 1
([18,19,27]). d { H send , d p } H end ( F U S C 1 ( R m ) ) .
d , d p , H send , and H end are metrics of F U S C B 1 ( X ) .
The corresponding author of this paper independently provided 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. The readers may also refer to [8,14,28,29,30] for several types of fuzzy sets.
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 1.
We use Tag to denote the set of all regular triangular fuzzy numbers. T a g : = { ( a , b , c ) : [ a , b , c ] i n 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 , i f   a x b , c x c b , i f   b x c , 0 , i f   x R [ a , c ] .
Definition 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 ] i n 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 , i f   a x b , 1 , i f   b x c , d x d c , i f c x d , 0 , i f   x R [ a , d ] .
Remark 1.
(i) u Tag means that there is an [ a , b , c ] G 0 satisfying u = ( a , b , c ) . (ii) u Tap means that there is an [ a , b , c , d ] T 0 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.
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 4.
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 2.
(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.
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 [31] 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 1 and 2 should be known. See [9] and related works. Clearly, Proposition 2 is a corollary of Proposition 1.
Proposition 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 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 3(ii) states the representation uniqueness of the trapezoidal fuzzy numbers.
Theorem 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 4 and easy calculations, we obtain (i). (One way to perform these calculations is by 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 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 4, ( 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 proven.
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 3(ii) gives the representation uniqueness of the triangular fuzzy numbers.
Proposition 3.
(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 and easy calculations, we obtain (i). (One way to perform these calculations is by 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 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, ( 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 proven.
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 3 and Proposition 3 are similar. Clearly, for k = i, ii, iii, and iv, Proposition 3(k) is a corollary of Theorem 3(k) (see also Remark 4.3 in [31] for details).
We know that Tag ⊆ Trag, Tap ⊆ Trap, Tag ⊆ Tap, and Trag ⊆ Trap (see Section 3). Based on Theorem 3(ii) and Proposition 3(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 [31] 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 one-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 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 the corresponding contents in [32]), 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 1, we find that
Corollary 2
([18,19,27]). 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 1 when we use the fact given in Corollary 2.

5. Main Results

In this section, we prove that each one of the convergences induced by the four kinds of common metrics d , d p , H send , and H end on the trapezoidal fuzzy numbers is equivalent to the convergence of the corresponding representation quadruples of the trapezoidal fuzzy numbers in R 4 . So, we obtain that these four kinds of common metrics are equivalent on the trapezoidal fuzzy numbers.
The following Proposition 4(iii) gives a calculation formula of the supremum metric d between two trapezoidal fuzzy numbers, which is expressed in terms of these two trapezoidal fuzzy numbers’ representation quadruples in R 4 . This conclusion is useful in this paper.
Proposition 4.
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 ) | ( b y ( ) , s e e ( I ) b e l o w ) = | ξ ( b 1 b ) + ( 1 ξ ) ( a 1 a ) | | ξ A + ( 1 ξ ) A | = | A | = A .
Thus, sup ξ [ 0 , 1 ] | u ( ξ ) v ( ξ ) | A . On the other hand, since, by Theorem 3(i), | 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 proven.
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 ) ) | ( b y ( ) ) = | ξ ( c 1 c ) + ( 1 ξ ) ( d 1 d ) | | ξ B + ( 1 ξ ) B | = | B | = B .
Thus, sup ξ [ 0 , 1 ] | u + ( ξ ) v + ( ξ ) | B . On the other hand, since, by Theorem 3(i), | 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 proven.
Note that
d ( u , v ) = sup ξ [ 0 , 1 ] H ( [ u ] ξ , [ v ] ξ ) = ( b y ( ) ) sup ξ [ 0 , 1 ] ( | u ( ξ ) v ( ξ ) | | u + ( ξ ) v + ( ξ ) | ) = sup ξ [ 0 , 1 ] | u ( ξ ) v ( ξ ) | sup ξ [ 0 , 1 ] | u + ( ξ ) v + ( ξ ) | = ( b y   ( i )   a n d   ( i i ) )   A B = max { | a 1 a | , | b 1 b | , | c 1 c | , | d 1 d | } .
So, (iii) is proven.
(I) We think (2) can also be used without citing since it is easy to see. □
Remark 4.
In the proof of Lemma 5.1 of [33] ( R 4 should be replaced by A in the proof), the conclusion is proven that for all u = ( a , b , c , d ) , v = ( a 1 , b 1 , c 1 , d 1 ) in Trap, d ( u , v ) max { | a a 1 | , | b b 1 | , | c c 1 | , | d d 1 | } . Clearly, Proposition 4(iii) improves this conclusion.
Remark 5.
Let u = ( a , b , c , d ) = ( a 1 , b 1 , c 1 , d 1 ) Trap. Then, 0 = d ( u , u ) = ( b y P r o p o s i t i o n ( i i i ) ) 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 3(ii) holds. “⇐” of Theorem 3(ii) holds obviously. So, Proposition 4(iii) implies Theorem 3(ii). As Proposition 3(ii) is a corollary of Theorem 3(ii), Proposition 4(iii) also implies Proposition 3(ii).
By Remark 3, Proposition 4(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 3(ii).
Remark 6.
The conclusions in this remark are easy to see. The symbols in this remark are consistent with those in the proof of Proposition 4.
(i) 
sup ξ [ 0 , 1 ] | u ( ξ ) v ( ξ ) | = max ξ [ 0 , 1 ] | u ( ξ ) v ( ξ ) | .
(ii) 
sup ξ [ 0 , 1 ] | u + ( ξ ) v + ( ξ ) | = max ξ [ 0 , 1 ] | u + ( ξ ) v + ( ξ ) | .
(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 Proposition 4(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 Proposition 4(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 proven. The proof of any of (iii-2), (iii-3), and (iii-4) is similar to that of (iii-1).
By Proposition 4(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.
Corollary 3.
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 Proposition 4(iii), (i)⇔(ii). Clearly (ii)⇔(iii). So the statements (i), (ii) and (iii) are equivalent. □
The following Theorem 4 is useful in this paper:
Theorem 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 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 Corollary 3, (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) means that both (iv-1) and (iv-3) hold. By (1) and (2), for each ξ 2 [ 0 , 1 ] , () 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 proven.
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 was first given in [34]. As E S ˜ n c 1 , E is also written as E 1 . See Page 57 of [35] for the definition of S ˜ n c 1 and the relation of E and S ˜ n c 1 ). The result of Theorem 5 is part of the result of Theorem 9.4 in [35]. Theorem 5 is useful in this paper.
Theorem 5
([34,35]). 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 .
Putting together Corollary 2 and Theorems 4 and 5, we arrive at the following conclusion:
Theorem 6.
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 4, (v)⇔(i). So, to show the desired result, it suffices to show that (i)⇔(ii)⇔(iii)⇔(iv). By Corollary 2, to show (i)⇔(ii)⇔(iii)⇔(iv), we only need to show that (iv)⇒(i).
Suppose that (iv) holds. As Trap E , by Theorem 5, (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 4, (i) holds. Thus, (iv)⇒(i). This completes the proof. □
Theorem 7.
d d p H send H end ( Trap ) .
Proof. 
The desired result follows immediately from Theorem 6. □
Corollary 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 , 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, u is the trapezoidal fuzzy number ( a , b , b , d ) . Thus, the desired result follows immediately from Theorem 6. □
Corollary 5.
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, 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 6.
Clearly, the desired result also follows from Corollary 4. □

6. Conclusions

In this paper, we find that each one of the convergences induced by d , d p , H send , and H end on the trapezoidal fuzzy numbers is equivalent to the convergence of the corresponding representation quadruples of the trapezoidal fuzzy numbers in R 4 . Therefore, these four kinds of metrics are equivalent on the trapezoidal fuzzy numbers.
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.
In the future, we will consider the applications of the results in this paper to fuzzy neural networks or fuzzy control systems.

Author Contributions

Formal analysis, Q.M.; methodology, H.H.; writing—original draft preparation, Q.M. and H.H.; writing—review and editing, H.H. All authors have read and agreed to the published version of the manuscript.

Funding

This research received no external funding.

Data Availability Statement

The original contributions presented in this study are included in the article. Further inquiries can be directed to the corresponding author(s).

Acknowledgments

The authors would like to thank the Academic Editor, and the referees for their comments and suggestions, which were very helpful in improving the readability of this paper.

Conflicts of Interest

The authors declare no conflicts of interest.

References

  1. Wang, L.; Mendel, J. Generating fuzzy rules by learning from examples. IEEE Trans. Syst. Man Cybern. 1992, 22, 1414–1427. [Google Scholar] [CrossRef]
  2. Dubois, D.; Prade, H. Fundamentals of Fuzzy Sets; The Handbooks of Fuzzy Sets Series; Kluwer Academic Publishers: London, UK, 2000. [Google Scholar]
  3. Diamond, P.; Kloeden, P. Metric Spaces of Fuzzy Sets; World Scientific: Singapore, 1994. [Google Scholar]
  4. Abbasbandy, S.; Asady, B. The nearest trapezoidal fuzzy number to a fuzzy quantity. Appl. Math. Comput. 2004, 156, 381–386. [Google Scholar] [CrossRef]
  5. Grzegorzewski, P.; Mrówka, E. Trapezoidal approximations of fuzzy numbers. Fuzzy Sets Syst. 2005, 153, 115–135. [Google Scholar] [CrossRef]
  6. Grzegorzewski, P.; Mrówka, E. Trapezoidal approximations of fuzzy numbers-revisited. Fuzzy Sets Syst. 2007, 158, 757–768. [Google Scholar] [CrossRef]
  7. Zeng, W.; Li, H. Weighted triangular approximation of fuzzy numbers. Int. J. Approx. Reason. 2007, 46, 137–150. [Google Scholar] [CrossRef]
  8. 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, 421–439. [Google Scholar] [CrossRef]
  9. Coroianu, L. Trapezoidal approximations of fuzzy numbers using quadratic programs. Fuzzy Sets Syst. 2021, 417, 71–92. [Google Scholar] [CrossRef]
  10. Bhalla, K.; Koundal, D.; Sharma, B.; Hu, Y.-C.; Zaguia, A. A fuzzy convolutional neural network for enhancing multi-focus image fusion. J. Vis. Commun. Image R. 2022, 84, 103485. [Google Scholar] [CrossRef]
  11. Rojas-Medar, M.; Román-Flores, H. On the equivalence of convergences of fuzzy sets. Fuzzy Sets Syst. 1996, 80, 217–224. [Google Scholar] [CrossRef]
  12. Fan, T. On the compactness of fuzzy numbers with sendograph. Fuzzy Sets Syst. 2004, 143, 471–477. [Google Scholar] [CrossRef]
  13. Greco, G.H. Sendograph metric and relatively compact sets of fuzzy sets. Fuzzy Sets Syst. 2006, 157, 286–291. [Google Scholar] [CrossRef]
  14. Greco, G.H.; Moschen, M.P. Supremum metric and relatively compact sets of fuzzy sets. Nonlinear Anal. 2006, 64, 1325–1335. [Google Scholar] [CrossRef]
  15. Trutschnig, W. Characterization of the sendograph-convergence of fuzzy sets by means of their Lp-and lelewise convergence. Fuzzy Sets Syst. 2010, 161, 1064–1077. [Google Scholar] [CrossRef]
  16. Kloeden, P.E.; Lorenz, T. A Peano theorem for fuzzy differential equations with evolving membership grade. Fuzzy Sets Syst. 2015, 280, 1–26. [Google Scholar] [CrossRef]
  17. Kupka, J. On approximations of Zadeh’s extension principle. Fuzzy Sets Syst. 2016, 283, 26–39. [Google Scholar] [CrossRef]
  18. Huang, H. Properties of several metric spaces of fuzzy sets. Fuzzy Sets Syst. 2024, 475, 108745. [Google Scholar] [CrossRef]
  19. Huang, H. Properties of fuzzy set spaces with Lp metrics. Fuzzy Sets Syst. 2025, 504, 109256. [Google Scholar] [CrossRef]
  20. Wu, C.; Ma, M. The Basic of Fuzzy Analysis; National Defense Industry Press: Beijing, China, 1991. (In Chinese) [Google Scholar]
  21. Wang, L.; Mendel, J. Fuzzy basis functions, universal approximation, and orthogonal least-squares learning. IEEE Trans. Neural Netw. 1992, 3, 807–814. [Google Scholar] [CrossRef] [PubMed]
  22. Gutiérrez García, J.; Prada Vicente, d.M.A. Hutton [0,1]-quasi-uniformities induced by fuzzy (quasi-)metric spaces. Fuzzy Sets Syst. 2006, 157, 755–766. [Google Scholar] [CrossRef]
  23. Qiu, D.; Shu, L.; Mo, Z.-W. On starshaped fuzzy sets. Fuzzy Sets Syst. 2009, 160, 1563–1577. [Google Scholar] [CrossRef]
  24. 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. [Google Scholar] [CrossRef]
  25. Popa, L.; Sida, L. Fuzzy inner product space: Literature review and a new approach. Mathematics 2021, 9, 765. [Google Scholar] [CrossRef]
  26. Kloeden, P.E. Compact supported endographs and fuzzy sets. Fuzzy Sets Syst. 1980, 4, 193–201. [Google Scholar] [CrossRef]
  27. Huang, H. Some properties of Skorokhod metric on fuzzy sets. Fuzzy Sets Syst. 2022, 437, 35–52. [Google Scholar] [CrossRef]
  28. Yeh, C.-T. Weighted semi-trapezoidal approximations of fuzzy numbers. Fuzzy Sets Syst. 2011, 165, 61–80. [Google Scholar] [CrossRef]
  29. Wang, G.; Shi, P.; Wang, B.; Zhang, J. Fuzzy n-ellipsoid numbers and representations of uncertain multichannel digital information. IEEE Trans. Fuzzy Syst. 2014, 22, 1113–1126. [Google Scholar] [CrossRef]
  30. Yeh, C.-T.; Chu, H.-M. Approximations by LR-type fuzzy numbers. Fuzzy Sets Syst. 2014, 257, 23–40. [Google Scholar] [CrossRef]
  31. Mao, Q.S.; Huang, H. Representation Uniqueness of Triangular Fuzzy Numbers and Trapezoidal Fuzzy Numbers. Available online: https://www.preprints.org (accessed on 7 August 2025).
  32. Mao, Q.S.; Huang, H. Some Properties of Generalized Triangular Fuzzy Numbers and Generalized Trapezoidal Fuzzy Numbers in Terms of Cut Sets. Available online: https://www.preprints.org (accessed on 7 August 2025).
  33. Alonso de la Fuente, M. New results on convergence in distribution of fuzzy random variables. Int. J. Approx. Reason. 2024, 166, 109125. [Google Scholar] [CrossRef]
  34. Huang, H.; Wu, C. Characterization of Γ-convergence on fuzzy number space. In Proceedings of the 11th International Fuzzy Systems Association (IFSA) World Congress, Beijing, China, 28–31 July 2005; Volume 1, pp. 66–70. [Google Scholar]
  35. Huang, H. Characterizations of endograph metric and Γ-convergence on fuzzy sets. Fuzzy Sets Syst. 2018, 350, 55–84. [Google Scholar] [CrossRef]
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.

Share and Cite

MDPI and ACS Style

Mao, Q.; Huang, H. Equivalence of Common Metrics on Trapezoidal Fuzzy Numbers. Axioms 2025, 14, 826. https://doi.org/10.3390/axioms14110826

AMA Style

Mao Q, Huang H. Equivalence of Common Metrics on Trapezoidal Fuzzy Numbers. Axioms. 2025; 14(11):826. https://doi.org/10.3390/axioms14110826

Chicago/Turabian Style

Mao, Qingsong, and Huan Huang. 2025. "Equivalence of Common Metrics on Trapezoidal Fuzzy Numbers" Axioms 14, no. 11: 826. https://doi.org/10.3390/axioms14110826

APA Style

Mao, Q., & Huang, H. (2025). Equivalence of Common Metrics on Trapezoidal Fuzzy Numbers. Axioms, 14(11), 826. https://doi.org/10.3390/axioms14110826

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