Next Article in Journal
Applications of the Network Simulation Method to Differential Equations with Singularities and Chaotic Behaviour
Next Article in Special Issue
New Results on the Aggregation of Norms
Previous Article in Journal
Multiple Novels and Accurate Traveling Wave and Numerical Solutions of the (2+1) Dimensional Fisher-Kolmogorov- Petrovskii-Piskunov Equation
Previous Article in Special Issue
Directional Shift-Stable Functions
 
 
Font Type:
Arial Georgia Verdana
Font Size:
Aa Aa Aa
Line Spacing:
Column Width:
Background:
Article

Aggregation of Indistinguishability Fuzzy Relations Revisited

by
Juan-De-Dios González-Hedström
1,
Juan-José Miñana
1,2 and
Oscar Valero
1,2,*
1
Departament de Ciències Matemàtiques i Informàtica, Universitat de les Illes Balears, 07122 Palma de Mallorca, IB, Spain
2
Institut d’Investigació Sanitària Illes Balears (IdISBa), Hospital Universitari Son Espases, 07120 Palma de Mallorca, IB, Spain
*
Author to whom correspondence should be addressed.
Mathematics 2021, 9(12), 1441; https://doi.org/10.3390/math9121441
Submission received: 20 May 2021 / Revised: 8 June 2021 / Accepted: 15 June 2021 / Published: 21 June 2021

Abstract

:
Indistinguishability fuzzy relations were introduced with the aim of providing a fuzzy notion of equivalence relation. Many works have explored their relation to metrics, since they can be interpreted as a kind of measure of similarity and this is, in fact, a dual notion to dissimilarity. Moreover, the problem of how to construct new indistinguishability fuzzy relations by means of aggregation has been explored in the literature. In this paper, we provide new characterizations of those functions that allow us to merge a collection of indistinguishability fuzzy relations into a new one in terms of triangular triplets and, in addition, we explore the relationship between such functions and those that aggregate extended pseudo-metrics, which are the natural distances associated to indistinguishability fuzzy relations. Our new results extend some already known characterizations which involve only bounded pseudo-metrics. In addition, we provide a completely new description of those indistinguishability fuzzy relations that separate points, and we show that both differ a lot.

1. Introduction

In 1982, the notion of T-equivalence (or indistinguishability fuzzy relation with respect to T), where T is a t-norm, was introduced by E. Trillas in order to provide a fuzzy notion of equivalence relation [1]. Let us recall that a T-equivalence on a non-empty set X is a fuzzy set E : X × X [ 0 , 1 ] , which satisfies for each x , y , z X the following axioms:
(E1)
E ( x , x ) = 1 ;
(E2)
E ( x , y ) = E ( y , x ) ;
(E3)
T ( E ( x , y ) , E ( y , z ) ) E ( x , z ) .
A T-equivalence E is said to be a T-equality (or indistinguishability fuzzy relation with respect to T that separate points) in those cases in which E ( x , y ) = 1 implies x = y ([2]).
Observe that the numerical value E ( x , y ) provides a degree up to which the element x is indistinguishable from the element y. Thus, the greater the E ( x , y ) , the more indistinguishable are x and y. In particular, for T-equalities, E ( x , y ) = 1 when x = y .
Since indistinguishability fuzzy relations were introduced by Trillas, many authors have explored their properties, methods for generating them, and their applications (see, for instance, [2,3,4,5,6,7,8,9,10,11,12,13,14,15,16]).
From now on we will assume that the reader is familiar with the basics of t-norms. For a fuller treatment of the topic, we refer the reader to [17].
The dual relationships between T-equivalences and metrics have been deeply explored in the literature, since T-equivalences can be interpreted as a kind of measure of similarity and this is, in some sense, a dual notion to dissimilarity which is provided by distances. With the aim of introducing one of the aforementioned relationships, let us recall the notion of an extended pseudo-metric. On account of [18], an extended pseudo-metric on a (non-empty) set X is a function d : X × X [ 0 , ] such that for all x , y , z X :
(d1)
d ( x , x ) = 0 ,
(d2)
d ( x , y ) = d ( y , x ) ,
(d3)
d ( x , z ) d ( x , y ) + d ( y , z ) .
An extended metric d on X is an extended pseudo-metric which satisfies the condition ( d 1 ) given for all for all x , y X as follows: ( d 1 )   d ( x , y ) = 0 x = y .
Following [19], an extended pseudo-metric d on X is called a b-bounded pseudo-metric whenever there exists b R + + such that d ( x , y ) b for all x , y X , where R + + = { a R + : a > 0 } .
Regarding the aforementioned duality, a T-equivalence E d , f T can be generated from an extended pseudo-metric d on a non-empty set X and a continuous Archimedean t-norm T as follows (see [20]):
E d , f T ( x , y ) = f T ( 1 ) ( d ( x , y ) ) for all x , y X ,
where f T denotes an additive generator for T. Notice that the continuity of the t-norm cannot be weakened in order to guarantee that E d , f T is a T-equivalence, as proved in [21]. The same construction gives a T-equality when the extended pseudo-metric is in fact an extended metric [22].
Aggregation theory and aggregation functions play a central role in order to generate methods for constructing new indistinguishability fuzzy relations from older ones. The research activity in aggregation methods has been very intense in the last few years due to potential applications to many problems that arise in a natural way in decision-making. For a deeper discussion of the topic, we refer the reader to [23,24,25,26].
Taking this fact into account, a characterization of those functions that allow to aggregate a collection of indistinguishability fuzzy relations into a new one was provided in [27].
With the aim of exposing such a characterization, let us recall, given a collection of t-norms T = { T i } i = 1 n , that a collection of fuzzy binary relations E i i = 1 n ( n N ) is said to be a collection of T -equivalences provided that each E i is a T i -equivalence on a non-empty set X for all i = 1 , , n (see [3,27]). Moreover, given a t-norm T, a function F: [ 0 , 1 ] n [ 0 , 1 ] aggregates T -equivalences into a T-equivalence provided that F ( E 1 , , E n ) is a T-equivalence on a non-empty set X when { E i } i = 1 n is a collection of T -equivalences on X. Furthermore, according to [27], a function G: [ 0 , ] n [ 0 , ] aggregates extended pseudo-metrics into an extended pseudo-metric provided that G ( d 1 , , d n ) is an extended pseudo-metric on a non-empty set Y, whenever { d i } i = 1 n is a collection of extended pseudo-metrics on Y. In those cases in which the extended pseudo-metrics are bounded, a function H: [ 0 , b i ] n [ 0 , c ] is said to aggregate a collection of ( b i ) i = 1 n -bounded pseudo-metrics { d i } i = 1 n on Y if H ( d 1 , , d n ) is a c-bounded pseudo-metric on Y whenever each d i is a b i -bounded pseudo-metric on Y for all i = 1 , , n .
In view of the exposed notions, the aforementioned characterization of indistinguishability fuzzy relations can be stated as follows (see [27]):
Theorem 1.
Let n N and let T = { T i } i = 1 n be a collection of continuous Archimedean t-norms. If T is a continuous Archimedean t-norm and F: [ 0 , 1 ] n [ 0 , 1 ] is a function, then the following assertions are equivalent:
(1) 
F aggregates T -equivalences into a T-equivalence.
(2) 
The function H : i = 1 n [ 0 , f T i ( 0 ) ] n [ 0 , f T ( 0 ) ] aggregates every collection { d i } i = 1 n of ( f T i ( 0 ) ) i = 1 n -bounded pseudo-metrics into a f T ( 0 ) -bounded pseudo-metric, where H = f T F ( f T 1 1 × × f T n 1 ) .
In the light of the preceding result, it must be stressed that F aggregates T -equivalences into a T-equivalence, all of them being defined on an arbitrary set X. Moreover, the function H aggregates every collection of ( f T i ( 0 ) ) i = 1 n -bounded pseudo-metrics into a f T ( 0 ) -bounded pseudo-metric, all of them being defined on arbitrary set Y. Observe that there is no a priori relationship between X and Y. Furthermore, it must be pointed out that the proof of the above result is based on the fact that, given a T-equivalence, one can always induce an extended pseudo-metric d by means of d ( x , y ) = f T ( E ( x , y ) ) (see [21,22]) and vice versa, given an extended pseudo-metric on Y, one can generate a T-Equivalence on Y by means of (1).
Notice that the next result is obtained from the preceding one in the particular case in which all continuous Archimedean t-norms are assumed to be strict (see [27]).
Corollary 1.
Let n N and let T = { T i } i = 1 n be a collection of strict continuous Archimedean t-norms. If T is a strict continuous Archimedean t-norm and F: [ 0 , 1 ] n [ 0 , 1 ] is a function, then the following assertions are equivalent:
(1) 
F aggregates T -equivalences into a T-equivalence.
(2) 
The function H : [ 0 , + ] n [ 0 , ] aggregates every collection { d i } i = 1 n of extended pseudo-metrics into an extended pseudo-metric, where H = f T F ( f T 1 1 × × f T n 1 ) .
It must be stressed that, in the statements of the previous results, the t-norms have been assumed to be continuous and Archimedean in order to warranty that the technique for generating indistinguishability fuzzy relations given by (1) can be applied.
Recently, a new characterization of functions that aggregate indistinguishability fuzzy relations was yielded in terms of triangular triplets with respect to a family of t-norms [28]. The mentioned notion of triangular triplet can be formulated in the following way.
Given a collection of t-norms T = { T i } i = 1 n , a triplet ( a , b , c ) [ 0 , 1 ] n is said to be a n-dimensional T -triangular triplet provided, for all i = 1 , , n , that
T i ( a i , b i ) c i , T i ( a i , c i ) b i and T i ( b i , c i ) a i .
Observe that the preceding concept retrieves that of a triangular triplet with respect to a t-norm T, given in [3], when one considers the collection of t-norms T such that T i = T for all i = 1 , , n .
The promised characterization was stated as follows [28].
Theorem 2.
Let n N and let T = { T i } i = 1 n be a collection of t-norms. If T is a t-norm and F: [ 0 , 1 ] n [ 0 , 1 ] is a function, then the following assertions are equivalent:
(1) 
F aggregates T -equivalences into a T-equivalence.
(2) 
F holds the following conditions:
(2.1) 
F ( 1 n ) = 1 , where 1 n [ 0 , 1 ] n with 1 n = ( 1 , , 1 ) .
(2.2) 
F transforms n-dimensional T -triangular triplets into a one-dimensional T-triangular triplet.
Let us recall that from Theorem 2, one can retrieve the characterization of functions that aggregate T-equivalences into a T-equivalence provided in [3]. With this aim, it is sufficient to take the collection of t-norms T with T i = T for all i = 1 , , n .
In the particular case of T-equalities, the next characterization was also proven in [28].
Theorem 3.
Let n N and let T = { T i } i = 1 n be a collection of t-norms. If T is a t-norm and F: [ 0 , 1 ] n [ 0 , 1 ] is a function, then the following assertions are equivalent:
(1) 
F aggregates T -equalities into a T-equality.
(2) 
F holds the following conditions:
(2.1) 
F ( 1 n ) = 1 , where 1 n [ 0 , 1 ] n with 1 n = ( 1 , , 1 ) .
(2.2) 
Let a [ 0 , 1 ] n . If F ( a ) = 1 , then there exists i { 1 , , n } such that a i = 1 .
(2.3) 
If a , b , c [ 0 , 1 [ n such that ( a , b , c ) is a n-dimensional T -triangular triplet, then, ( F ( a ) , F ( b ) , F ( c ) ) is a one-dimensional T-triangular triplet.
Motivated by the exposed facts, the main objectives of this paper are twofold. On the one hand, we provide new information about the description of functions aggregating T -equivalences and their relationship to those that aggregate extended pseudo-metrics. Concretely, we show an equivalence between assertions provided in the statement of Theorems 1 and 2 and the fact that the function G = f T F ( f T 1 ( 1 ) × × f T n ( 1 ) ) aggregates extended pseudo-metrics into a bounded pseudo-metric. On the other hand, we provide a characterization of those functions that aggregate T -equalities into a new one in the spirit of Theorem 1, but taking advantage of Theorem 3. Although it could be expected that such a characterization should be very similar to that given for the case of T -equivalences, it follows that both differ a lot. Thus, roughly speaking, we show that the fact that F aggregates T -equalities into a T-equality is equivalent to the fact that the function G = f T F ( f T 1 ( 1 ) × × f T n ( 1 ) ) merges extended metrics into a bounded metric and, in addition, to the fact that the function G transforms n-dimensional positive triangular triplets into a one-dimensional positive triangular triplet. Our new results extend the exposed and known characterizations which involve only bounded pseudo-metrics to the extended pseudo-metric framework, which is the most natural when distances associated to indistinguishability fuzzy relations and additive generators are considered. Besides, it must be pointed out that we provide a completely new description of those indistinguishability fuzzy relations that separate points. Notable differences between both characterizations are shown.

2. Aggregation of T -Equivalences

In this section, we focus our efforts on obtaining new equivalences with the statements in Theorems 1, 2 and Corollary 1. With this aim, we recall the notion of a triangular triplet following [3].
A triplet ( a , b , c ) , with s [ 0 , ] and a , b , c [ 0 , s ] n ( n N ), forms a n-dimensional triangular triplet whenever, for all i = 1 , , n ,
a i b i + c i , b i a i + c i and c i b i + a i ,
where x y if y = and x [ 0 , ] or x , y [ 0 , ] following the usual order of the real line.
In view of the preceding notion, we introduce two results which will play a central role in our subsequent discussion.
Lemma 1.
Let n N and a , b , c [ 0 , + ] n . If ( a , b , c ) is a n-dimensional triangular triplet and X = { x , y , z } with different x , y , z , then there exists a collection { d i } i = 1 n of extended pseudo-metrics on X such that d i ( x , y ) = a i , d i ( x , z ) = b i and d i ( z , y ) = c i for all i = 1 , , n .
Proof. 
Define, for each i { 1 , , n } , the function d i : X × X [ 0 , + ] by d i ( x , y ) = d i ( y , x ) = a i , d i ( x , z ) = d i ( z , x ) = b i , d i ( z , y ) = d i ( y , z ) = c i and d i ( x , x ) = d i ( y , y ) = d i ( z , z ) = 0 . It is not hard to check that { d i } i = 1 n is a collection of extended metrics on X because ( a , b , c ) is a n-dimensional triangular triplet. □
The same arguments given in the proof of Lemma 1 remain valid for the next result in which n-dimensional triangular triplets in [ 0 , + ] n are considered.
Lemma 2.
Let n N and a , b , c [ 0 , + ] n . If ( a , b , c ) is a n-dimensional triangular triplet and X = { x , y , z } with different x , y , z , then there exists a collection { d i } i = 1 n of extended metrics on X such that d i ( x , y ) = a i , d i ( x , z ) = b i and d i ( z , y ) = c i for all i = 1 , , n .
The next result gives the new aforesaid equivalences.
Theorem 4.
Let n N and let T = { T i } i = 1 n be a collection of continuous Archimedean t-norms. If T is a continuous Archimedean t-norm and F: [ 0 , 1 ] n [ 0 , 1 ] is a function, then the following assertions are equivalent:
(1) 
F aggregates T -equivalences into a T-equivalence.
(2) 
The function G: [ 0 , + ] n [ 0 , f T ( 0 ) ] transforms n-dimensional triangular triplets in [ 0 , ] n into a one-dimensional triangular triplet in [ 0 , f T ( 0 ) ] and G ( 0 , , 0 ) = 0 , where G = f T F ( f T 1 ( 1 ) × × f T n ( 1 ) ) .
(3) 
The function G: [ 0 , + ] n [ 0 , f T ( 0 ) ] aggregates every collection { d i } i = 1 n of extended pseudo-metrics into a f T ( 0 ) -bounded pseudo-metric, where G = f T F ( f T 1 ( 1 ) × × f T n ( 1 ) ) .
(4) 
The function H: i = 1 n [ 0 , f T i ( 0 ) ] [ 0 , f T ( 0 ) ] transforms n-dimensional triangular triplets in i = 1 n [ 0 , f T i ( 0 ) ] into a one-dimensional triangular triplet in [ 0 , f T ( 0 ) ] and H ( 0 , 0 ) = 0 , where H = f T F ( f T 1 1 × × f T n 1 ) .
Proof. 
(1) ( 2 ) . By Theorem 2 we have that F transforms n-dimensional T -triangular triplets into one-dimensional T-triangular triplets. Now, let ( a , b , c ) [ 0 , + ] n be a n-dimensional triangular triplet. Then, it is not hard to check that ( d , e , f ) [ 0 , 1 ] n forms a n-dimensional T -triangular triplet, where d = ( f T 1 ( 1 ) ( a 1 ) , , f T n ( 1 ) ( a n ) ) , e = ( f T 1 ( 1 ) ( b 1 ) , , f T n ( 1 ) ( b n ) ) and f = ( f T 1 ( 1 ) ( c 1 ) , , f T n ( 1 ) ( c n ) ) . Thus, ( F ( d ) , F ( e ) , F ( f ) ) is a one-dimensional T-triangular triplet. It follows that
f T ( F ( u ) ) + f T ( F ( v ) ) f T f T ( 1 ) f T ( F ( u ) ) + f T ( F ( v ) ) = f T ( T ( F ( u ) , F ( v ) ) ) f T ( F ( w ) )
for all u , v , w { d , e , f } , whence we conclude that ( G ( a ) , G ( b ) , G ( c ) ) is a one-dimensional triangular triplet in [ 0 , f T ( 0 ) ] .
It remains to show that G ( 0 , , 0 ) = 0 . First,
( f T 1 ( 1 ) × × f T n ( 1 ) ) ( 0 , , 0 ) = ( 1 , , 1 ) = 1 n .
Besides, again by Theorem 2, we have that F ( 1 n ) = 1 . Therefore,
G ( 0 , , 0 ) = f T F ( f T 1 ( 1 ) × × f T n ( 1 ) ) ( 0 , , 0 ) = f T ( 1 ) = 0 .
(2) ( 3 ) . Consider a collection { d i } i = 1 n of extended pseudo-metrics on a non-empty set X. Then, for every x , y , z X , we have that ( d , e , f ) [ 0 , ] n is a n-dimensional triangular triplet, where d = ( d 1 ( x , y ) , d 2 ( x , y ) , , d n ( x , y ) ) , e = ( d 1 ( x , z ) , d 2 ( x , z ) , , d n ( x , z ) ) and f = ( d 1 ( z , y ) , d 2 ( z , y ) , , d n ( y , z ) ) . Then, ( G ( d ) , G ( e ) , G ( f ) ) is a one-dimensional triplet in [ 0 , f T ( 0 ) ] , whence we have that
G ( d 1 , , d n ) ( u , v ) G ( d 1 , , d n ) ( u , w ) + G ( d 1 , , d n ) ( w , v )
for all u , v , w { x , y , z } . It is clear that G ( d 1 , , d n ) ( x , y ) = G ( d 1 , , d n ) ( y , x ) . In order to show that G ( d 1 , , d n ) is a f T ( 0 ) -bounded pseudo-metric on X, it remains to check that G ( d 1 , , d n ) ( x , x ) = 0 for all x X . Indeed, let x X . Then,
G ( d 1 , , d n ) ( x , x ) = G ( d 1 ( x , x ) , , d n ( x , x ) ) = G ( 0 , , 0 ) = 0 .
(3) ( 4 ) . First we prove that the function H aggregates a collection of ( f T i ( 0 ) ) i = 1 n -bounded pseudo-metrics on a non-empty set X into a f T ( 0 ) -bounded pseudo-metric on X. Since { d i } i = 1 n is a collection of extended pseudo-metrics on X, the function G aggregates it into a f T ( 0 ) -bounded pseudo-metric G ( d 1 , , d n ) on X. However, H ( d 1 , , d n ) = G ( d 1 , , d n ) . Thus, H ( d 1 , , d n ) is a f T ( 0 ) -bounded pseudo-metric on X.
Next, consider a n-dimensional triangular triplet ( a , b , c ) in i = 1 n [ 0 , t i ( 0 ) ] . Consider X = { x , y , z } with different x , y , z . By Lemma 1, there exists a collection of { d i } i = 1 n of ( f T i ( 0 ) ) i = 1 n -bounded pseudo-metrics on X such that d i ( x , y ) = a i , d i ( x , z ) = b i and d i ( z , y ) = c i for all i = 1 , , n . Then, H ( d 1 , , d n ) is a f T ( 0 ) -bounded pseudo-metric on X. Thus,
H ( d 1 , , d n ) ( u , v ) H ( d 1 , , d n ) ( u , w ) + H ( d 1 , , d n ) ( w , v )
for all u , v , w X . It follows that H ( a ) = H ( d 1 ( x , y ) , , d n ( x , y ) ) , H ( b ) = H ( d 1 ( x , z ) , , d n ( x , z ) ) and H ( c ) = H ( d 1 ( z , y ) , , d n ( z , y ) ) . Hence H ( a ) H ( b ) + H ( c ) . Similarly, we can show that H ( b ) H ( a ) + H ( c ) and that H ( c ) H ( a ) + H ( b ) . Therefore, ( H ( a ) , H ( b ) , H ( c ) ) is a one-dimensional triangular triplet in [ 0 , f T ( 0 ) ] .
It remains to prove that H ( 0 , , 0 ) = 0 . However, this is evident, since the collection { d i } i = 1 n under consideration (given by Lemma 1) is formed by ( f T i ( 0 ) ) i = 1 n -bounded pseudo-metrics on a non-empty set X and, hence, d i ( x , x ) = 0 for all x X . Thus,
H ( 0 , , 0 ) = H ( d 1 ( x , x ) , , d n ( x , x ) ) = H ( d 1 , , d n ) ( x , x ) = 0 .
(4) ( 1 ) . Consider a collection { E i } i = 1 n of T -equivalences on a non-empty set X. We must prove that F ( E 1 , , E n ) is a T-equivalence.
First we show that F ( E 1 , , E n ) ( x , x ) = 1 for all x X . The fact that E i is a T i -equality on X for every i, gives that E i ( x , x ) = 1 for all x X . Assume that F ( E 1 , , E n ) ( x , x ) < 1 . Then, F ( 1 n ) < 1 and
H ( 0 , , 0 ) = f T F ( f T 1 1 ( 0 ) , , f T n 1 ( 0 ) ) = f T F ( 1 n ) > f T ( 1 ) = 0 .
However, this contradicts the fact that H ( 0 , , 0 ) = 0 .
Obviously, F ( E 1 , , E n ) ( x , y ) = F ( E 1 , , E n ) ( y , x ) since E i ( x , y ) = E i ( y , x ) for all x , y X . Thus, it remains to prove that the following inequality is held for each x , y , z X :
T ( F ( E 1 , , E n ) ( x , y ) , F ( E 1 , , E n ) ( x , z ) ) F ( E 1 , , E n ) ( x , z ) .
The next set f T i ( E i ( x , y ) ) = a i , f T i ( E i ( y , z ) ) = b i , and f T i ( E i ( x , z ) ) = c i . Since
T i ( E i ( x , y ) , E i ( y , z ) ) E i ( x , z ) ,
we have that
f T i ( 1 ) a i + b i f T i 1 ( c i )
for all i = 1 , , n . It follows that
f T i f T i ( 1 ) a i + b i c i
for all i = 1 , , n . Since
a i + b i f T i f T i ( 1 ) a i + b i ,
we deduce that a i + b i c i for all i = 1 , , n . Similar arguments allow us to show that a i + c i b i and that c i + b i a i for all i = 1 , , n . Consequently, we have that ( c , a , b ) is a n-dimensional triangular triplet in i = 1 n [ 0 , f T i ( 0 ) ] , where c = ( c i ) i = 1 n , a = ( a i ) i = 1 n and b = ( b i ) i = 1 n . Thus, ( H ( c ) , H ( a ) , H ( b ) ) is a one-dimensional triangular triplet in [ 0 , f T ( 0 ) ] . Thus, H ( c ) H ( a ) + H ( b ) . Then,
f T F ( f T 1 1 ( c 1 ) × × f T n 1 ( c n ) ) f T F ( f T 1 1 ( a 1 ) × × f T n 1 ( a n ) ) + f T F ( f T 1 1 ( b 1 ) × × f T n 1 ( b n ) ) .
Applying f T ( 1 ) to both hands of the preceding inequality immediately gives that
T ( F ( E 1 , , E n ) ( x , y ) , F ( E 1 , , E n ) ( x , z ) ) F ( E 1 , , E n ) ( x , z ) .
Consequently, we conclude that F ( E 1 , , E n ) is a T-equivalence on X. □
It must be pointed out that if the collection of t-norms T is reduced to the single continuous Archimedean t-norm T, then equivalence (1) ( 4 ) in Theorem 4 retrieves the characterization yielded in [3]. Moreover, the combination of Theorem 1 with the aforementioned equivalence improves the characterization provided in [29], where all bounded pseudo-metrics belonging to the collection to be aggregated and the bounded pseudo-metric obtained via the aggregation share the same constant of boundedness.
From Theorem 4, we can derive the following one, which improves Corollary 1, if all continuous Archimedean t-norms are assumed to be strict.
Theorem 5.
Let n N and let T = { T i } i = 1 n be a collection of strict continuous Archimedean t-norms. If T is a strict continuous Archimedean t-norm and F : [ 0 , 1 ] n [ 0 , 1 ] is a function, then the following assertions are equivalent:
(1) 
F aggregates T -equivalences into a T-equivalence.
(2) 
The function G : [ 0 , + ] n [ 0 , + ] transforms n-dimensional triangular triplets into a one-dimensional triangular triplets in [ 0 , + ] and G ( 0 , , 0 ) = 0 , where G = t F ( f T 1 1 × × f T n 1 ) .
(3) 
The function G : [ 0 , + ] n [ 0 , + ] aggregates every collection ( d i ) i = 1 n of extended pseudo-metrics into an extended pseudo-metric, where G = t F ( f T 1 1 × × f T n 1 ) .

3. Aggregation of T -Equalities

This section is devoted to deal with the characterization of the functions that allow us to aggregate T -equalities making use of Theorem 3.
Theorem 6.
Let n N and let T = { T i } i = 1 n be a collection of continuous Archimedean t-norms. If T is a continuous Archimedean t-norm and F: [ 0 , 1 ] n [ 0 , 1 ] is a function, then the following assertions are equivalent:
(1) 
F aggregates T -equalities into a T-equality.
(2) 
The function G : [ 0 , + ] n [ 0 , f T ( 0 ) ] , where G = f T F ( f T 1 ( 1 ) × × f T n ( 1 ) ) , fulfills the following conditions:
(2.1) 
G ( 0 , , 0 ) = 0 ;
(2.2) 
Let a [ 0 , + ] n . If G ( a ) = 0 , then there exists i { 1 , , n } such that a i = 0 ;
(2.3) 
G transforms n-dimensional triangular triplets in [ 0 , + ] n into a one-dimensional triangular triplet in [ 0 , f T ( 0 ) ] .
(3) 
The function G: [ 0 , + ] n [ 0 , f T ( 0 ) ] aggregates every collection { d i } i = 1 n of extended metrics into a f T ( 0 ) -bounded metric, where G = f T F ( f T 1 ( 1 ) × × f T n ( 1 ) ) .
(4) 
The function H: i = 1 n [ 0 , f T i ( 0 ) ] [ 0 , f T ( 0 ) ] aggregates every collection { d i } i = 1 n of ( f T i ( 0 ) ) i = 1 n -bounded metrics into a f T ( 0 ) -metric, where H = f T F ( f T 1 1 × × f T n 1 ) .
(5) 
The function H: i = 1 n [ 0 , f T i ( 0 ) ] [ 0 , f T ( 0 ) ] , where H = f T F ( f T 1 1 × × f T n 1 ) , fulfills the following conditions:
(5.1) 
H ( 0 , , 0 ) = 0 ;
(5.2) 
Let a i = 1 n [ 0 , f T i ( 0 ) ] . If H ( a ) = 0 , then there exists i { 1 , , n } such that a i = 0 ;
(5.3) 
H transforms n-dimensional triangular triplets in i = 1 n [ 0 , f T i ( 0 ) ] into a one-dimensional triangular triplet in [ 0 , f T ( 0 ) ] ;
Proof. 
(1) ( 2 ) . By Theorem 3, we have that F transforms n-dimensional T -triangular triplets in [ 0 , 1 ] n into one-dimensional T-triangular triplets and, in addition, F ( 1 n ) = 1 . The same arguments to those given in Theorem 4 show that G ( 0 , , 0 ) = 0 from the fact that F ( 1 n ) = 1 .
Now, assume that a [ 0 , + ] n with G ( a ) = 0 . Then,
f T F ( f T 1 ( 1 ) ( a 1 ) , , f T n ( 1 ) ( a n ) ) = 0 .
It follows that
F ( f T 1 ( 1 ) ( a 1 ) , , f T n ( 1 ) ( a n ) ) = 1 .
Thus, there exists i { 1 , , n } such that f T i ( 1 ) ( a i ) = 1 , whence we obtain that a i = 0 .
Next, consider a n-dimensional triangular triplet ( a , b , c ) in [ 0 , + ] n . Then, u i v i + w i for all i = 1 , , n and for all u , v , w { a , b , c } . Thus,
f T i ( 1 ) ( u i ) f T i ( 1 ) ( v i + w i ) T i ( f T i ( 1 ) ( v i ) , f T i ( 1 ) ( w i ) )
for all u , v , w { a , b , c } , whence we deduce that ( f T i ( 1 ) ( a i ) , f T i ( 1 ) ( b i ) , f T i ( 1 ) ( c i ) ) is a T i -triangular triplet. Thus, ( d , e , f ) [ 0 , 1 ] n is a n-dimensional T -triangular triplet in [ 0 , 1 ] with d = ( f T 1 ( 1 ) ( a 1 ) , , f T n ( 1 ) ( a n ) ) , e = ( f T 1 ( 1 ) ( b 1 ) , , f T n ( 1 ) ( b n ) ) and f = ( f T 1 ( 1 ) ( c 1 ) , , f T n ( 1 ) ( c n ) ) . Then, ( F ( d ) , F ( e ) , F ( f ) ) is a one-dimensional T-triangular triplet. Hence, we have that
T ( F ( u ) , F ( w ) ) F ( v )
for all u , v , w { d , e , f } , whence we deduce that
f T ( 1 ) f T F ( u ) + f T F ( w ) = T ( F ( u ) , F ( w ) ) F ( v )
for all u , v , w { d , e , f } . Thus, we obtain
G ( u ) + G ( w ) = f T F ( u ) + f T F ( w ) f T f T ( 1 ) f T F ( u ) + f T F ( w ) f T F ( v ) = G ( v )
for all u , v , w { a , b , c } . Therefore, ( G ( a ) , G ( b ) , G ( c ) ) is a one-dimensional triangular triplet in [ 0 , f T ( 0 ) ] . Observe that G ( u ) > 0 for all u { a , b , c } , since otherwise we have that there exists i { 1 , , n } such that u i = 0 , which contradicts the fact that a , b , c [ 0 , + ] n .
(2) ( 3 ) . Consider a collection { d i } i = 1 n of extended metrics on a non-empty set X. We will see that G ( d 1 , , d n ) is a metric on X.
First we show that G ( d 1 , , d n ) ( x , y ) = 0 x = y . On the one hand, if x = y , then d i ( x , x ) = 0 for all i = 1 , , n . Thus,
G ( d 1 , , d n ) ( x , x ) = G ( d 1 ( x , x ) , , d n ( x , x ) ) = G ( 0 , , 0 ) = 0 .
Now assume we have that G ( d 1 , , d n ) ( x , y ) = 0 for any x , y X . Then,
G ( d 1 ( x , y ) , , d n ( x , y ) ) = 0 .
Thus, there exists i { 1 , , n } such that d i ( x , y ) = 0 . Hence, x = y .
Obviously, G ( d 1 , , d n ) ( x , y ) = G ( d 1 , , d n ) ( y , x ) for each x , y X .
Finally, we prove that the triangle inequality
G ( d 1 , , d n ) ( x , z ) G ( d 1 , , d n ) ( x , y ) + G ( d 1 , , d n ) ( y , z )
is held for each x , y , z X . Without loss of generality, we can assume that the cardinality of X is at least three, that is, that there exists x , y , z X with different x , y , z . Otherwise, the triangle inequality is clear.
Define a = ( d 1 ( x , z ) , d 2 ( x , z ) , , d n ( x , z ) ) , b = ( d 1 ( x , y ) , d 2 ( x , y ) , , d n ( x , y ) ) and c = ( d 1 ( y , z ) , d 2 ( y , z ) , , d n ( y , z ) ) . By our assumptions, ( a , b , c ) [ 0 , + ] n is a n-dimensional triangular triplet. This gives that ( G ( a ) , G ( b ) , G ( c ) ) is a one-dimensional triangular triplet in [ 0 , f T ( 0 ) ] , which follows that
G ( d 1 , , d n ) ( x , z ) G ( d 1 , , d n ) ( x , y ) + G ( d 1 , , d n ) ( y , z ) .
( 3 ) ( 4 ) . It is obvious.
( 4 ) ( 5 ) . The same reasoning to that applied in the proof of ( 3 ) ( 4 ) in Theorem 4 remains valid here, to show that H ( 0 , , 0 ) = 0 .
Next, we prove that if there exists a i = 1 n [ 0 , f T i ( 0 ) ] such that H ( a ) = 0 , then there exists i { 1 , , n } such that a i = 0 . For the purposes of contradiction, assume that a i = 1 n [ 0 , f T i ( 0 ) ] with H ( a ) = 0 . Consider a non-empty set X = { x , y } such that x y . Define the function d i : X × X [ 0 , f T i ( 0 ) ] by d i ( x , y ) = d i ( y , x ) = a i and d i ( x , x ) = d i ( y , y ) = 0 for all i = 1 , , n . Then, { d i } i = 1 n is a collection of ( f T i ( 0 ) ) i = 1 n -bounded metrics on X. Thus, H ( d 1 , , d n ) is a f T ( 0 ) -bounded metric on X. Since H ( a ) = 0 , we have that
H ( d 1 , , d n ) ( x , y ) = H ( d 1 ( x , y ) , , d n ( x , y ) ) = H ( a ) = 0
which is impossible because x y . Then, if H ( a ) = 0 , we deduce that there exists i { 1 , , n } such that a i = 0 .
We need only consider a n-dimensional triangular triplet ( a , b , c ) i = 1 n [ 0 , f T i ( 0 ) ] . Set X = { x , y , z } with different x , y , z . By Lemma 2 we have guaranteed the existence of a collection { d i } i = 1 n of ( f T i ( 0 ) ) i = 1 n -bounded metrics on X with d i ( x , y ) = a i , d i ( x , z ) = b i and d i ( z , y ) = c i for all i = 1 , , n . Then, H ( d 1 , , d n ) is a f T ( 0 ) -bounded metric on X, whence we deduce that
H ( d 1 , , d n ) ( u , v ) H ( d 1 , , d n ) ( u , w ) + H ( d 1 , , d n ) ( w , v )
for all u , v , w { x , y , z } . From these inequalities, we obtain that ( H ( a ) , H ( b ) , H ( c ) ) is a one-dimensional triangular triplet in [ 0 , f T ( 0 ) ] .
( 5 ) ( 1 ) . First of all, we show that F ( 1 n ) = 1 . Since
H ( 0 , , 0 ) = f T F ( f T 1 ( 1 ) ( 0 ) , , f T n ( 1 ) ( 0 ) ) = f T F ( 1 , , 1 )
and H ( 0 , , 0 ) = 0 , we immediately deduce that F ( 1 , , 1 ) = 1 .
Now, assume that a [ 0 , 1 ] n with F ( a ) = 1 . Then,
H ( b 1 , , b n ) = f T F ( f T 1 1 ( b 1 ) , , f T n 1 ( b n ) )
with b i = f T ( a i ) for all i = 1 , , n . The fact that
F ( f T 1 1 ( b 1 ) , , f T n 1 ( b n ) ) = F ( a ) = 1
gives that H ( b 1 , , b n ) = 0 . Thus, there exists i { 1 , , n } such that b i = 0 . It follows that a i = f T i 1 ( 0 ) = 1 .
Finally, let a , b , c [ 0 , 1 [ n such that ( a , b , c ) is a n-dimensional T -triangular triplet. Then, ( e , f , g ) is a n-dimensional triangular triplet in i = 1 n [ 0 , f T i ] , where e = ( f T 1 ( a 1 ) , , f T n ( a n ) ) , f = ( f T 1 ( b 1 ) , , f T n ( b n ) ) and g = ( f T 1 ( c 1 ) , , f T n ( c n ) ) . Indeed, we have that T i ( u i , v i ) w i for all i = 1 , , n and for all u , v , w { a , b , c } . Hence, we obtain that
f T i ( 1 ) f T i ( u i ) + f T ( v i ) w i
for all i = 1 , , n and for all u , v , w { a , b , c } , whence we deduce that
f T i f T i ( 1 ) f T i ( u i ) + f T ( v i ) f T i ( w i )
for all i = 1 , , n and for all u , v , w { a , b , c } . Since
f T i ( u i ) + f T ( v i ) f T i f T i ( 1 ) f T i ( u i ) + f T ( v i ) ,
we deduce that
f T i ( u i ) + f T ( v i ) f T i ( w i )
for all i = 1 , , n and for all u , v , w { a , b , c } . Consequently, ( H ( e ) , H ( f ) , H ( g ) ) is a one-dimensional triangular triplet in [ 0 , f T ( 0 ) ] . Thus,
f T F ( u 1 , , u n ) f T F ( v 1 , , v n ) + f T F ( w 1 , , w n )
for all u , v , w { a , b , c } , since H ( e ) = f T F ( a 1 , , a n ) , H ( f ) = f T F ( b 1 , , b n ) and H ( g ) = f T F ( c 1 , , c n ) . Thus, we get that
f T 1 f T F ( u 1 , , u n ) f T 1 f T F ( v 1 , , v n ) + f T F ( w 1 , , w n )
for all u , v , w { a , b , c } . Thus, we have that
F ( u ) = F ( u 1 , , u n ) f T 1 f T F ( v 1 , , v n ) + f T F ( w 1 , , w n ) = T ( F ( v ) , F ( w ) )
for all u , v , w { a , b , c } . Therefore, ( F ( a ) , F ( b ) , F ( c ) ) is a one-dimensional T-triangular triplet. Now, the fact that F aggregates T -equalities into a T-equality follows by Theorem 3. □
In the particular case in which all continuous Archimedean t-norms are assumed to be strict, then, from Theorem 6, we can deduce the next result.
Corollary 2.
Let n N and let T = { T i } i = 1 n be a collection of strict continuous Archimedean t-norms. If T is a strict continuous Archimedean t-norm and F: [ 0 , 1 ] n [ 0 , 1 ] is a function, then the following assertions are equivalent:
(1) 
F aggregates T -equalities into a T-equality.
(2) 
The function G: [ 0 , + ] n [ 0 , + ] , where G = f T F ( f T 1 1 × × f T n 1 ) , fulfills the following conditions:
(2.1) 
G ( 0 , , 0 ) = 0 ;
(2.2) 
Let a [ 0 , + ] n . If G ( a ) = 0 , then there exists i { 1 , , n } such that a i = 0 ;
(2.3) 
G transforms n-dimensional positive triangular triplets in [ 0 , + ] n into a one-dimensional positive triangular triplet in [ 0 , + ] .
(3) 
The function G : [ 0 , + ] n [ 0 , + ] aggregates every collection { d i } i = 1 n of extended metrics into an extended metric, where G = f T F ( f T 1 1 × × f T n 1 ) .

4. Conclusions

In 1982, the notion of indistinguishability fuzzy relations was introduced by E. Trillas in order to provide a fuzzy notion of equivalence relations. In many problems coming from decision-making, new indistinguishability fuzzy relations are induced by means of merging a collection of other indistinguishability fuzzy relations. Motivated by this fact, a characterization of those functions that aggregate indistinguishability fuzzy relations into a new one was given, on the one hand, in terms of functions that aggregate bounded pseudo-metrics in [27] and, on the other hand, in terms of functions that transform triangular triplets with respect to a t-norm in [3].
In this paper, we have again addressed the aggregation problem of indistinguishability fuzzy relations. Concretely, we have provided a new characterization of those functions that merge a collection of such fuzzy relations into a new one based on triangular triplets and a specific function induced by additive generators of the involved t-norms that aggregate extended pseudo-metrics into bounded pseudo-metrics. Finally, a characterization of those functions that aggregate indistinguishability fuzzy relations that separate points have also been given. Notable differences between both characterizations have been shown.
The problem of describing—in terms of aggregation of generalized distances and triangular triplets—those functions that aggregate more general notions of indistinguishability fuzzy relations, like relaxed indistinguishability fuzzy relations or fuzzy preorders, remains open. Thus, we will address it as further work.

Author Contributions

Funding acquisition, O.V.; Investigation, J.-D.-D.G.-H., J.-J.M. and O.V.; Writing—original draft, J.-D.-D.G.-H., J.-J.M. and O.V.; Writing—review and editing, J.-J.M. and O.V. All authors have read and agreed to the published version of the manuscript.

Funding

This research was funded by FEDER/Ministerio de Ciencia, Innovación y Universidades-Agencia Estatal de Investigación/ Proyecto PGC2018-095709-B-C21, Programa Operatiu FEDER 2014–2020 de les Illes Balears, by project PROCOE/4/2017 (Direcció General d’Innovació i Recerca, Govern de les Illes Balears) and from projects ROBINS and BUGWRIGHT2. These two latest projects have received funding from the European Union’s Horizon 2020 research and innovation programme under grant agreements No. 779776 and No. 871260, respectively. This publication reflects only the authors views and the European Union is not liable for any use that may be made of the information contained therein.

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. The funders had no role in the design of the study; in the collection, analyses, or interpretation of data; in the writing of the manuscript, or in the decision to publish the results.

References

  1. Trillas, E. Assaig sobre les relacions d’indistingibilitat. In Proceedings Primer Congrés Català de Lògica Matemàtica; Barcelona Institut d’Estudis Catalans: Barcelona, Spain, 1982; pp. 51–59. [Google Scholar]
  2. Recasens, J. Indistinguishability Operators: Modelling Fuzzy Equalities and Fuzzy Equivalence Relations; Springer: Berlin, Germany, 2010. [Google Scholar]
  3. Mayor, M.; Recasens, J. Preserving T-transitivity. In Artificial Intelligence Research and Development; Nebot, À., Binefa, X., López de Mántaras, R., Eds.; IOS Press: Amsterdam, The Netherlands, 2016; pp. 79–87. [Google Scholar]
  4. Calvo, T.; Fuster-Parra, P. Aggregation of partial T-indistinguishability operators and partial pseudo-metrics. Fuzzy Sets Syst. 2019, 403, 119–138. [Google Scholar] [CrossRef]
  5. Miñana, J.-J.; Valero, O. On indistinguishability operators, fuzzy metrics and modular metrics. Axioms 2017, 6, 34. [Google Scholar] [CrossRef] [Green Version]
  6. Höhle, U. Fuzzy equalities and indistinguishability. In Proceedings of EUFIT’93; Eurogress Aachen: Aachen, Germany, 1993; Volume 1, pp. 358–363. [Google Scholar]
  7. Höhle, U. Many valued equalities and their representation. In Logical, Algebraic, Analytic and Probabilistic Aspects of Triangular Norms; Klement, E.P., Mesiar, R., Eds.; Elsevier: Amsterdam, The Netherlands, 2005; pp. 301–320. [Google Scholar]
  8. Petry, F.E.; Bosc, P. Fuzzy Databases: Principles and Applications; Kluwer Academic Publishers: Boston, MA, USA, 1996. [Google Scholar]
  9. Ovchinnikov, S. Representation of transitive fuzzy relations. In Aspects of Vagueness; Skala, H.J., Termini, S., Trillas, E., Eds.; Springer: Berlin/Heidelberg, Germany, 1984; pp. 105–118. [Google Scholar]
  10. Boixader, D.; Recasens, J. On the relationship between fuzzy subgroups and indistinguishability operators. Fuzzy Sets Syst. 2019, 373, 149–163. [Google Scholar] [CrossRef]
  11. Calvo, T.; Recasens, J. On the representation of local indistinguishability operators. Fuzzy Sets Syst. 2021, 410, 90–108. [Google Scholar] [CrossRef]
  12. Recasens, J. On the Relationship between Positive Definite Matrices and t-norms. Fuzzy Sets Syst. 2021, in press. [Google Scholar] [CrossRef]
  13. Bejines, C.; Chasco, M.J.; Elorza, J.; Recasens, J. Preserving fuzzy subgroups and indistinguishability operators. Fuzzy Sets Syst. 2019, 373, 164–179. [Google Scholar] [CrossRef]
  14. Bejines, C.; Ardanza, S.; Chasco, M.J.; Elorza, J. Aggregation of indistinguishability operators. Fuzzy Sets Syst. 2021, in press. [Google Scholar] [CrossRef]
  15. Pedraza, T.; Rodríguez-López, J.; Valero, O. Aggregation of fuzzy quasi-metrics. Inform. Sci. 2021, in press. [Google Scholar]
  16. Saminger, S.; Mesiar, R.; Bodenhofer, U. Domination of aggregation operators and preservation of transitivity. Int. J. Uncertain. Fuzziness-Knowl.-Based Syst. 2002, 10, 11–35. [Google Scholar] [CrossRef]
  17. Klement, E.P.; Mesiar, R.; Pap, E. Triangular Norms; Kluwer: Dordrecht, The Netherlands, 2000. [Google Scholar]
  18. Deza, M.M.; Deza, E. Encyclopedia of Distances; Springer: Heidelberg, Germany, 2009. [Google Scholar]
  19. Copson, E.T. Metric Spaces; Cambridge University Press: Cambridge, UK, 1968. [Google Scholar]
  20. Valverde, L. On the structure of F-indistinguishability operators. Fuzzy Set. Syst. 1985, 17, 313–328. [Google Scholar] [CrossRef] [Green Version]
  21. De Baets, B.; Mesiar, R. Pseudo-metrics and T-equivalences. Fuzzy. Math. 1997, 5, 471–481. [Google Scholar]
  22. De Baets, B.; Mesiar, R. Metrics and T-equalities. J. Math. Anal. Appl. 1997, 267, 531–547. [Google Scholar] [CrossRef] [Green Version]
  23. Beliakov, G.; Bustince, H.; Calvo, T. A Practical Guide to Averaging Functions, Studies in Fuzziness and Soft Computing; Springer: Berlin/Heidelberg, Germany, 2016. [Google Scholar]
  24. Grabisch, M.; Marichal, J.-L.; Mesiar, R.; Pap, E. Aggregation functions, Encyclopedia of Mathematics and its Applications; Cambridge University Press: Cambridge, UK, 2009; Volume 127. [Google Scholar]
  25. Drewniak, J.; Dudziak, U. Aggregation in classes of fuzzy relations. Stud. Math. 2006, 5, 33–43. [Google Scholar]
  26. Drewniak, J.; Dudziak, U. Preservation of properties of fuzzy relations during aggregation processes. Kybernetik 2007, 43, 115–132. [Google Scholar]
  27. Pradera, P.; Trillas, E.; Castiñeira, E. On the aggregation of some classes of fuzzy relations. In Technologies for Constructing Intelligent Systems 2. Tools; Bouchon-Meunier, B., Gutiérrez-Ríos, J., Magdalena, L., Yager, R.R., Eds.; Springer: Heidelberg, Germany, 2002; pp. 125–147. [Google Scholar]
  28. Calvo Sánchez, T.; Fuster-Parra, P.; Valero, O. The aggregation of transitive fuzzy relations revisited. Fuzzy Sets Syst. 2021, in press. [Google Scholar]
  29. Pradera, P.; Trillas, E. A note on pseudo-metrics aggregation, Int. J. Gen. Syst. 2002, 31, 41–51. [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

González-Hedström, J.-D.-D.; Miñana, J.-J.; Valero, O. Aggregation of Indistinguishability Fuzzy Relations Revisited. Mathematics 2021, 9, 1441. https://doi.org/10.3390/math9121441

AMA Style

González-Hedström J-D-D, Miñana J-J, Valero O. Aggregation of Indistinguishability Fuzzy Relations Revisited. Mathematics. 2021; 9(12):1441. https://doi.org/10.3390/math9121441

Chicago/Turabian Style

González-Hedström, Juan-De-Dios, Juan-José Miñana, and Oscar Valero. 2021. "Aggregation of Indistinguishability Fuzzy Relations Revisited" Mathematics 9, no. 12: 1441. https://doi.org/10.3390/math9121441

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