Picture Fuzzy Relations over Picture Fuzzy Sets

Abstract

Nowadays, picture fuzzy set theory is a flourishing field in mathematics with uncertainty by incorporating the concept of positive, negative and neutral membership degrees of an object. A traditional crisp relation represents the satisfaction or the dissatisfaction of relationship, connection or correspondence between the objects of two or more sets. However, there are some problems that can’t be solved through classical relationships, such as the relationship between two objects being vague. In those situations, picture fuzzy relation over picture fuzzy sets is an important and powerful concept which is suitable for describing correspondences between two vague objects. It represents the strength of association of the elements of picture fuzzy sets. It plays an important role in picture fuzzy modeling, inference and control system and also has important applications in relational databases, approximate reasoning, preference modeling, medical diagnosis, etc. In this article, we define picture fuzzy relations over picture fuzzy sets, including some other fundamental definitions with illustrations. The max-min and min-max compositions of picture fuzzy relations are defined in the light of picture fuzzy sets and discussed some properties related to them. The reflexivity, symmetry and transitivity of a picture fuzzy relation are described over a picture fuzzy set. Finally, various properties are explored related to the picture fuzzy relations over a picture fuzzy set.

Share and Cite:

Hasan, M. , Sultana, A. and Mitra, N. (2023) Picture Fuzzy Relations over Picture Fuzzy Sets. American Journal of Computational Mathematics, 13, 161-184. doi: 10.4236/ajcm.2023.131008.

1. Introduction

In our daily life, we face some problems where uncertainty arises that cannot be solved by classical set theory. To deal with those problems, L. A. Zadeh [1] introduced the concept of fuzzy set theory and then Atanassov [2] developed the intuitionistic fuzzy set (IFS) which was the extension of fuzzy set. However, recently many researchers keep their concentration on picture fuzzy set [3] by incorporating the concept of positive, negative and neutral membership degrees of an element which is the extension of an intuitionistic fuzzy set. After the development of picture fuzzy set, it has been considered a strong mathematical tool which is adequate in situations when human opinions involved more answers of the types yes, abstain, no and refusal.

Fuzzy relation was initially introduced by Zadeh [4] and then by Kaufmann [5]. Also, it has been studied by a number of authors, such as Klir and Yaun [6] and Zimmerman [7]. Then some scholars have used it widely in many fields, such as decision making, fuzzy reasoning, fuzzy control, medical diagnosis, clustering analysis [8] [9] [10] [11], fuzzy comprehensive evaluation [12] [13] [14]. Burillo and Bustince gave the definition of intuitionistic fuzzy relations [15] [16] and discussed some properties of them. In 2005, Lei et al. [17] further researched intuitionistic fuzzy relations and composition operation of intuitionistic fuzzy relations. Yang proposed the definition of kernels and closures of intuitionistic fuzzy relations and proved fourteen theorems of intuitionistic fuzzy relations [18]. B. C. Cuong [3] [19] proposed the notion of picture fuzzy relations and studied some related properties.

In this article, picture fuzzy relation over picture fuzzy set is defined. Some operations on this picture fuzzy relation are also discussed with examples. Numerous properties are explored related to picture fuzzy relation over picture fuzzy set.

This article is organized as follows: In section 2, some basic definitions and properties are described which are essential to the rest of the paper. In section 3, some structural properties of picture fuzzy relation over picture fuzzy sets are illustrated. In section 4, the compositional relations of picture fuzzy sets over picture fuzzy sets are defined and describe some related properties of them. In section 5, some properties of picture fuzzy relations in picture fuzzy sets are explained. Finally, concluding remarks are given.

2. Preliminaries

In this section, we recall some basic definitions which are used in later sections.

Definition 2.1. [1]. Let X be non-empty set. A fuzzy set A in X is given by

A = { ( x , μ A ( x ) ) : x X } ,

where μ A : X [ 0 , 1 ] .

Definition 2.2. [2]. An intuitionistic fuzzy set A in X is given by

A = { ( x , μ A ( x ) , ν A ( x ) ) : x X } ,

where μ A : X [ 0 , 1 ] and ν A : X [ 0 , 1 ] , with the condition

0 μ A ( x ) + ν A ( x ) 1 ; x X .

The values μ A ( x ) and ν A ( x ) represent the membership degree and non-membership degree respectively of the element x to the set A.

For any intuitionistic fuzzy set A on the universal set X, for x X

π A ( x ) = 1 ( μ A ( x ) + ν A ( x ) )

is called the hesitancy degree (or intuitionistic fuzzy index) of an element x in A. It is the degree of indeterminacy membership of the element x whether belonging to A or not.

Obviously, 0 π A ( x ) 1 for any x X .

Particularly, π A ( x ) = 1 μ A ( x ) ν A ( x ) is always valid for any fuzzy set A on the universal set X.

The set of all intuitionistic fuzzy sets in X will be denoted by I F S ( X ) .

Definition 2.3. [3] [19]. A picture fuzzy set A on a universe of discourse X is of the form

A = { ( x , μ A ( x ) , η A ( x ) , ν A ( x ) ) : x X } ,

where μ A ( x ) [ 0 , 1 ] is called the degree of positive membership of x in A, η A ( x ) [ 0 , 1 ] is called the degree of neutral membership of x in A and ν A ( x ) [ 0 , 1 ] is called the degree of negative membership of x in A, and where μ A ( x ) , η A ( x ) and ν A ( x ) satisfy the following condition:

0 μ A ( x ) + η A ( x ) + ν A ( x ) 1 ; x X .

Here 1 ( μ A ( x ) + η A ( x ) + ν A ( x ) ) ; x X is called the degree of refusal membership of x in A.

The set of all picture fuzzy sets in X will be denoted by P F S ( X ) .

Definition 2.4. [3] [19]. Let A , B P F S ( X ) , then the subset, equality, the union, intersection and complement are defined as follows:

1) A B iff x X , μ A ( x ) μ B ( x ) , η A ( x ) η B ( x ) and ν A ( x ) ν B ( x )

2) A = B iff x X , μ A ( x ) = μ B ( x ) , η A ( x ) = η B ( x ) and ν A ( x ) = ν B ( x )

3) A B = { ( x , max ( μ A ( x ) , μ B ( x ) ) , min ( η A ( x ) , η B ( x ) ) , min ( ν A ( x ) , ν B ( x ) ) ) : x X }

4) A B = { ( x , min ( μ A ( x ) , μ B ( x ) ) , min ( η A ( x ) , η B ( x ) ) , max ( ν A ( x ) , ν B ( x ) ) ) : x X }

5) A c = { ( x , ν A ( x ) , η A ( x ) , μ A ( x ) ) : x X }

Definition 2.5. [19]. Let X, Y and Z be ordinary non-empty sets. A picture fuzzy relation R is a picture fuzzy subset of X × Y i.e. R given by

R = { ( ( x , y ) , μ R ( x , y ) , η R ( x , y ) , ν R ( x , y ) ) : x X , y Y }

where μ R : X × Y [ 0 , 1 ] , η R : X × Y [ 0 , 1 ] , ν R : X × Y [ 0 , 1 ] satisfying the condition

0 μ R ( x , y ) + η R ( x , y ) + ν R ( x , y ) 1 for every ( x , y ) ( X × Y ) .

The set of all picture fuzzy relations in X × Y will be denoted by P F R ( X × Y ) .

Definition 2.6. [20]. Let R P F R ( X × Y ) . We define the inverse relation R 1 between Y and X:

μ R 1 ( y , x ) = μ R ( x , y ) , η R 1 ( y , x ) = η R ( x , y ) , ν R 1 ( y , x ) = ν R ( x , y ) , ( x , y ) X × Y .

Definition 2.7. [20]. Let R and P be two picture fuzzy relations between X and Y, for every ( x , y ) X × Y we define:

1) R P ( μ R ( x , y ) μ P ( x , y ) ) and ( η R ( x , y ) η P ( x , y ) ) and ( ν R ( x , y ) ν P ( x , y ) )

2) R P = { ( x , y ) , μ R ( x , y ) μ P ( x , y ) , η R ( x , y ) η P ( x , y ) , ν R ( x , y ) ν P ( x , y ) : x X , y Y }

3) R P = { ( x , y ) , μ R ( x , y ) μ P ( x , y ) , η R ( x , y ) η P ( x , y ) , ν R ( x , y ) ν P ( x , y ) : x X , y Y }

4) R c = { ( ( x , y ) , ν R ( x , y ) , η R ( x , y ) , μ R ( x , y ) ) : x X , y Y }

Here, and denote the maximum and minimum operators respectively.

Definition 2.8. [19]. Let R P F R ( X × Y ) and S P F R ( Y × Z ) . Then the composition of R and S is the PFR from X to Z defined as

R S = { ( ( x , z ) , μ R S ( x , z ) , η R S ( x , z ) , ν R S ( x , z ) ) : x X , z Z }

where

μ R S ( x , z ) = y Y { μ S ( x , y ) μ R ( y , z ) } ,

η R S ( x , z ) = y Y { η S ( x , y ) η R ( y , z ) }

and ν R S ( x , z ) = y Y { ν S ( x , y ) ν R ( y , z ) } .

Definition 2.9. [20]. The relation R P F R ( X × X ) is called:

1) Reflexive if μ R ( x , x ) = 1 , η R ( x , x ) = 0 and ν R ( x , x ) = 0 ; x X .

2) Anti-reflexive if μ R ( x , x ) = 0 , η R ( x , x ) = 0 and ν R ( x , x ) = 1 ; x X .

Definition 2.10. [20]. A PFR, R ( X × X ) is reflexive of order ( α , γ , β ) if μ R ( x , x ) = α , η R ( x , x ) = γ and ν R ( x , x ) = β ; x X and α + γ + β 1 .

Definition 2.11. [20]. A picture fuzzy relation R ( X × X ) is symmetric if μ R ( x , y ) = μ R ( y , x ) , η R ( x , y ) = η R ( y , x ) and ν R ( x , y ) = ν R ( y , x ) ; x , y X .

Definition 2.12. [20]. Let R ( X × X ) be a picture fuzzy relation. Then R is transitive if R R R .

3. Some Structures of Picture Fuzzy Relations

Definition 3.1. Let X be the universal set and A = ( μ A , η A , ν A ) and B = ( μ B , η B , ν B ) be two PFSs of X. Define the Cartesian product A × B as the PFS of X × X by A × B = ( μ A × B , η A × B , ν A × B ) where for all x , y X , μ A × B ( x , y ) = min { μ A ( x ) , μ B ( y ) } , η A × B ( x , y ) = min { η A ( x ) , η B ( y ) } and ν A × B ( x , y ) = max { ν A ( x ) , ν B ( y ) } .

Definition 3.2. Let R be a PFS of X × X with R A × B i.e. ( x , y ) X × X ;

1) μ R ( x , y ) μ A × B ( x , y ) ;

2) η R ( x , y ) η A × B ( x , y ) ;

3) ν R ( x , y ) ν A × B ( x , y ) ;

4) μ R ( x , y ) + η R ( x , y ) + ν R ( x , y ) 1 .

Then we say that R is a picture fuzzy relation from A to B. In particular, if A = B then R is said to be a picture fuzzy relation on A.

We denote the set of all picture fuzzy relations from A to B by P F R ( A × B ) .

From now on, we assume that, the set X is finite; say X = { x 1 , x 2 , , x n } . The picture fuzzy relation R from A to B, R ( A × B ) can be represented as a matrix [ R ] = [ μ i j , η i j , ν i j ] , where μ i j = μ R ( x i , x j ) , η i j = η R ( x i , x j ) and ν i j = ν R ( x i , x j ) , i , j = 1 , 2 , , n . We write [ R μ ] = [ μ i j ] , [ R η ] = [ η i j ] and [ R ν ] = [ ν i j ] .

Example 3.2. Let X = { x 1 , x 2 , x 3 } be a non-empty set.

Let A = { ( x 1 , 0.7 , 0.1 , 0.2 ) , ( x 2 , 0.5 , 0.2 , 0.2 ) , ( x 3 , 0.4 , 0.3 , 0.1 ) } and B = { ( x 1 , 0.5 , 0.2 , 0.3 ) , ( x 2 , 0.8 , 0.1 , 0.1 ) , ( x 3 , 0.4 , 0.5 , 0.1 ) } be two picture fuzzy sets on X. Then

A × B = { ( x 1 , x 1 ) , 0.5 , 0.1 , 0.3 , ( x 1 , x 2 ) , 0.7 , 0.1 , 0.2 , ( x 1 , x 3 ) , 0.4 , 0.1 , 0.2 , ( x 2 , x 1 ) , 0.5 , 0.2 , 0.3 , ( x 2 , x 2 ) , 0.5 , 0.1 , 0.2 , ( x 2 , x 3 ) , 0.4 , 0.2 , 0.2 , ( x 3 , x 1 ) , 0.4 , 0.2 , 0.3 , ( x 3 , x 2 ) , 0.4 , 0.1 , 0.1 , ( x 3 , x 3 ) , 0.4 , 0.3 , 0.1 }

[ A × B ] = x 1 x 2 x 3 x 1 x 2 x 3 [ ( 0.5 , 0.1 , 0.3 ) ( 0.7 , 0.1 , 0.2 ) ( 0.4 , 0.1 , 0.2 ) ( 0.5 , 0.2 , 0.3 ) ( 0.5 , 0.1 , 0.2 ) ( 0.4 , 0.2 , 0.2 ) ( 0.4 , 0.2 , 0.3 ) ( 0.4 , 0.1 , 0.1 ) ( 0.4 , 0.3 , 0.1 ) ] .

Let [ R ] = [ ( 0.4 , 0.1 , 0.5 ) ( 0.5 , 0.0 , 0.4 ) ( 0.4 , 0.1 , 0.4 ) ( 0.3 , 0.2 , 0.5 ) ( 0.5 , 0.1 , 0.4 ) ( 0.2 , 0.1 , 0.6 ) ( 0.3 , 0.2 , 0.4 ) ( 0.2 , 0.1 , 0.6 ) ( 0.3 , 0.3 , 0.4 ) ] , while [ R μ ] = [ 0.4 0.3 0.3 0.5 0.5 0.2 0.4 0.2 0.3 ] , [ R η ] = [ 0.1 0.2 0.2 0.0 0.1 0.1 0.1 0.1 0.3 ] and [ R ν ] = [ 0.5 0.5 0.4 0.4 0.4 0.6 0.4 0.6 0.4 ] .

Definition 3.3. Let R be a picture fuzzy relation on A. The complement of the relation R is a picture fuzzy relation R c , where μ R c = ν R , η R c = η R and ν R c = μ R .

We can write

R c = { ( ( x , y ) , ν R ( x , y ) , η R ( x , y ) , μ R ( x , y ) ) : ( x , y ) X × X } .

Example 3.3. Consider the relation R from example 3.2

[ R ] = [ ( 0.4 , 0.1 , 0.5 ) ( 0.5 , 0.0 , 0.4 ) ( 0.4 , 0.1 , 0.4 ) ( 0.3 , 0.2 , 0.5 ) ( 0.5 , 0.1 , 0.4 ) ( 0.2 , 0.1 , 0.6 ) ( 0.3 , 0.2 , 0.4 ) ( 0.2 , 0.1 , 0.6 ) ( 0.3 , 0.3 , 0.4 ) ] , then

[ R c ] = [ ( 0.5 , 0.1 , 0.4 ) ( 0.4 , 0.0 , 0.5 ) ( 0.4 , 0.1 , 0.4 ) ( 0.5 , 0.2 , 0.3 ) ( 0.4 , 0.1 , 0.5 ) ( 0.6 , 0.1 , 0.2 ) ( 0.4 , 0.2 , 0.3 ) ( 0.6 , 0.1 , 0.2 ) ( 0.4 , 0.3 , 0.3 ) ] .

Definition 3.4. Let R be picture fuzzy relation from A to B. Then we define the inverse relation R 1 as μ R 1 ( y , x ) = μ R ( x , y ) , η R 1 ( y , x ) = η R ( x , y ) , ν R 1 ( y , x ) = ν R ( x , y ) .

Example 3.4. Consider the relation R from example 3.2

[ R ] = [ ( 0.4 , 0.1 , 0.5 ) ( 0.5 , 0.0 , 0.4 ) ( 0.4 , 0.1 , 0.4 ) ( 0.3 , 0.2 , 0.5 ) ( 0.5 , 0.1 , 0.4 ) ( 0.2 , 0.1 , 0.6 ) ( 0.3 , 0.2 , 0.4 ) ( 0.2 , 0.1 , 0.6 ) ( 0.3 , 0.3 , 0.4 ) ] , then

[ R 1 ] = [ ( 0.4 , 0.1 , 0.5 ) ( 0.3 , 0.2 , 0.5 ) ( 0.3 , 0.2 , 0.4 ) ( 0.5 , 0.0 , 0.4 ) ( 0.5 , 0.1 , 0.4 ) ( 0.2 , 0.1 , 0.6 ) ( 0.4 , 0.1 , 0.4 ) ( 0.2 , 0.1 , 0.6 ) ( 0.3 , 0.3 , 0.4 ) ] .

Definition 3.5. Let R 1 , R 2 P F R ( A , B ) . Then we say R 1 R 2 if for all x , y X ;

1) μ R 1 ( x , y ) μ R 2 ( x , y ) ;

2) η R 1 ( x , y ) η R 2 ( x , y ) ;

3) ν R 1 ( x , y ) ν R 2 ( x , y ) .

If R 1 R 2 and R 2 R 1 then R 1 = R 2 .

Example 3.5. Consider the example 3.2

Let R 1 = [ ( 0.4 , 0.1 , 0.5 ) ( 0.3 , 0.0 , 0.6 ) ( 0.3 , 0.1 , 0.5 ) ( 0.3 , 0.2 , 0.5 ) ( 0.4 , 0.1 , 0.4 ) ( 0.2 , 0.1 , 0.6 ) ( 0.3 , 0.1 , 0.4 ) ( 0.2 , 0.1 , 0.6 ) ( 0.3 , 0.3 , 0.4 ) ] and R 2 = [ ( 0.5 , 0.1 , 0.3 ) ( 0.5 , 0.1 , 0.4 ) ( 0.3 , 0.1 , 0.5 ) ( 0.5 , 0.2 , 0.3 ) ( 0.5 , 0.1 , 0.3 ) ( 0.3 , 0.1 , 0.5 ) ( 0.4 , 0.1 , 0.4 ) ( 0.3 , 0.1 , 0.5 ) ( 0.4 , 0.3 , 0.3 ) ] be two picture fuzzy relations from A to B.

Clearly, R 1 R 2 .

Definition 3.6. Let R1, R2 be picture fuzzy relations from A to B. Then the union of R1 and R2, R 1 R 2 is a picture fuzzy relation whose positive membership, neutral membership and negative membership are

μ R 1 R 2 ( x , y ) = max { μ R 1 ( x , y ) , μ R 2 ( x , y ) } ,

η R 1 R 2 ( x , y ) = min { η R 1 ( x , y ) , η R 2 ( x , y ) }

and ν R 1 R 2 ( x , y ) = min { ν R 1 ( x , y ) , ν R 2 ( x , y ) } .

Definition 3.7. Let R1, R2 be picture fuzzy relations from A to B. Then the intersection of R1 and R2, R 1 R 2 is a picture fuzzy relation whose positive membership, neutral membership and negative membership are

μ R 1 R 2 ( x , y ) = min { μ R 1 ( x , y ) , μ R 2 ( x , y ) } ,

η R 1 R 2 ( x , y ) = min { η R 1 ( x , y ) , η R 2 ( x , y ) }

and ν R 1 R 2 ( x , y ) = max { ν R 1 ( x , y ) , ν R 2 ( x , y ) } .

Definition 3.8. Let R1, R2 be picture fuzzy relations from A to B. Then we define the arithmetic mean operator between R1 and R2 as follows

μ R 1 @ R 2 ( x , y ) = μ R 1 ( x , y ) + μ R 2 ( x , y ) 2 ,

η R 1 @ R 2 ( x , y ) = η R 1 ( x , y ) + η R 2 ( x , y ) 2

and ν R 1 @ R 2 ( x , y ) = ν R 1 ( x , y ) + ν R 2 ( x , y ) 2

Definition 3.9. Let R1, R2 be picture fuzzy relations from A to B. Then we define the geometric mean operator between R1 and R2 as follows

μ R 1 $ R 2 ( x , y ) = μ R 1 ( x , y ) μ R 2 ( x , y ) ,

η R 1 $ R 2 ( x , y ) = η R 1 ( x , y ) η R 2 ( x , y )

and ν R 1 $ R 2 ( x , y ) = ν R 1 ( x , y ) ν R 2 ( x , y ) .

Definition 3.10. Let R1, R2 be picture fuzzy relations from A to B. Then we define the harmonic mean operator between R1 and R2 as follows

μ R 1 © R 2 ( x , y ) = 2 μ R 1 ( x , y ) μ R 2 ( x , y ) μ R 1 ( x , y ) + μ R 2 ( x , y ) ,

η R 1 © R 2 ( x , y ) = 2 η R 1 ( x , y ) η R 2 ( x , y ) η R 1 ( x , y ) + η R 2 ( x , y )

and ν R 1 © R 2 ( x , y ) = 2 ν R 1 ( x , y ) ν R 2 ( x , y ) ν R 1 ( x , y ) + ν R 2 ( x , y ) .

Definition 3.11. Let R1, R2 be picture fuzzy relations from A to B. Then we define the operator “ ” between R1 and R2 as follows

μ R 1 R 2 ( x , y ) = μ R 1 ( x , y ) μ R 2 ( x , y ) 2 ( μ R 1 ( x , y ) μ R 2 ( x , y ) + 1 ) ,

η R 1 R 2 ( x , y ) = η R 1 ( x , y ) η R 2 ( x , y ) 2 ( η R 1 ( x , y ) η R 2 ( x , y ) + 1 )

and ν R 1 R 2 ( x , y ) = ν R 1 ( x , y ) ν R 2 ( x , y ) 2 ( ν R 1 ( x , y ) ν R 2 ( x , y ) + 1 ) .

Example 3.11. Consider the example 3.2

Let R 1 = [ ( 0.4 , 0.1 , 0.5 ) ( 0.5 , 0.0 , 0.4 ) ( 0.4 , 0.1 , 0.4 ) ( 0.3 , 0.2 , 0.5 ) ( 0.5 , 0.1 , 0.4 ) ( 0.2 , 0.1 , 0.6 ) ( 0.3 , 0.2 , 0.4 ) ( 0.2 , 0.1 , 0.6 ) ( 0.3 , 0.3 , 0.4 ) ] and R 2 = [ ( 0.5 , 0.0 , 0.4 ) ( 0.4 , 0.1 , 0.5 ) ( 0.2 , 0.1 , 0.6 ) ( 0.2 , 0.1 , 0.7 ) ( 0.3 , 0.0 , 0.6 ) ( 0.3 , 0.1 , 0.7 ) ( 0.1 , 0.1 , 0.6 ) ( 0.3 , 0.1 , 0.5 ) ( 0.4 , 0.2 , 0.4 ) ] be two picture fuzzy relations from A to B. Then,

R 1 R 2 = [ ( 0.5 , 0.0 , 0.4 ) ( 0.5 , 0.0 , 0.4 ) ( 0.4 , 0.1 , 0.4 ) ( 0.3 , 0.1 , 0.5 ) ( 0.5 , 0.0 , 0.4 ) ( 0.3 , 0.1 , 0.6 ) ( 0.3 , 0.1 , 0.4 ) ( 0.3 , 0.1 , 0.5 ) ( 0.4 , 0.2 , 0.4 ) ]

R 1 R 2 = [ ( 0.4 , 0.0 , 0.5 ) ( 0.4 , 0.0 , 0.5 ) ( 0.2 , 0.1 , 0.6 ) ( 0.2 , 0.1 , 0.7 ) ( 0.3 , 0.0 , 0.6 ) ( 0.2 , 0.1 , 0.7 ) ( 0.1 , 0.1 , 0.6 ) ( 0.2 , 0.1 , 0.6 ) ( 0.3 , 0.2 , 0.4 ) ]

R 1 c = [ ( 0.5 , 0.1 , 0.4 ) ( 0.4 , 0.0 , 0.5 ) ( 0.4 , 0.1 , 0.4 ) ( 0.5 , 0.2 , 0.3 ) ( 0.4 , 0.1 , 0.5 ) ( 0.6 , 0.1 , 0.2 ) ( 0.4 , 0.2 , 0.3 ) ( 0.6 , 0.1 , 0.2 ) ( 0.4 , 0.3 , 0.3 ) ]

R 1 @ R 2 = [ ( 0.45 , 0.05 , 0.45 ) ( 0.45 , 0.05 , 0.45 ) ( 0.30 , 0.10 , 0.50 ) ( 0.25 , 0.15 , 0.60 ) ( 0.40 , 0.05 , 0.50 ) ( 0.25 , 0.10 , 0.65 ) ( 0.20 , 0.15 , 0.50 ) ( 0.25 , 0.10 , 0.55 ) ( 0.35 , 0.25 , 0.40 ) ]

R 1 $ R 2 = [ ( 0.45 , 0.00 , 0.45 ) ( 0.45 , 0.00 , 0.45 ) ( 0.28 , 0.10 , 0.49 ) ( 0.24 , 0.14 , 0.59 ) ( 0.38 , 0.00 , 0.49 ) ( 0.24 , 0.10 , 0.65 ) ( 0.17 , 0.14 , 0.48 ) ( 0.24 , 0.10 , 0.55 ) ( 0.35 , 0.24 , 0.40 ) ]

R 1 © R 2 = [ ( 0.44 , 0.00 , 0.44 ) ( 0.44 , 0.00 , 0.44 ) ( 0.27 , 0.10 , 0.48 ) ( 0.24 , 0.13 , 0.58 ) ( 0.38 , 0.00 , 0.48 ) ( 0.24 , 0.10 , 0.65 ) ( 0.15 , 0.13 , 0.48 ) ( 0.24 , 0.10 , 0.55 ) ( 0.34 , 0.24 , 0.40 ) ]

R 1 R 2 = [ ( 0.12 , 0.00 , 0.12 ) ( 0.12 , 0.00 , 0.12 ) ( 0.04 , 0.005 , 0.15 ) ( 0.03 , 0.01 , 0.24 ) ( 0.09 , 0.00 , 0.15 ) ( 0.03 , 0.005 , 0.30 ) ( 0.02 , 0.01 , 0.15 ) ( 0.03 , 0.005 , 0.20 ) ( 0.07 , 0.03 , 0.09 ) ]

Theorem 3.12. Let R P F R ( A × B ) be a picture fuzzy relation. Then ( R 1 ) 1 = R .

Proof. By the definition of inverse relation, we have

μ R 1 ( y , x ) = μ R ( x , y ) , η R 1 ( y , x ) = η R ( x , y ) , ν R 1 ( y , x ) = ν R ( x , y ) .

Now,

μ ( R 1 ) 1 ( y , x ) = μ R 1 ( x , y ) = μ R ( y , x )

η ( R 1 ) 1 ( y , x ) = η R 1 ( x , y ) = η R ( y , x )

and

ν ( R 1 ) 1 ( y , x ) = ν R 1 ( x , y ) = ν R ( y , x ) .

Hence, ( R 1 ) 1 = R .

Theorem 3.13. Let R 1 , R 2 P F R ( A × B ) be two picture fuzzy relations. Then

1) ( R 1 R 2 ) 1 = R 1 1 R 2 1 .

2) ( R 1 R 2 ) 1 = R 1 1 R 2 1 .

Proof. 1) By the definition of inverse relation, we have μ R 1 1 ( y , x ) = μ R 1 ( x , y ) , η R 1 1 ( y , x ) = η R 1 ( x , y ) , ν R 1 1 ( y , x ) = ν R 1 ( x , y ) and μ R 2 1 ( y , x ) = μ R 2 ( x , y ) , η R 2 1 ( y , x ) = η R 2 ( x , y ) , ν R 2 1 ( y , x ) = ν R 2 ( x , y ) .

Therefore,

μ ( R 1 R 2 ) 1 ( y , x ) = μ R 1 R 2 ( x , y ) = max { μ R 1 ( x , y ) , μ R 2 ( x , y ) } = max { μ R 1 1 ( y , x ) , μ R 2 1 ( y , x ) } = μ R 1 1 R 2 1 ( y , x )

η ( R 1 R 2 ) 1 ( y , x ) = η R 1 R 2 ( x , y ) = min { η R 1 ( x , y ) , η R 2 ( x , y ) } = min { η R 1 1 ( y , x ) , η R 2 1 ( y , x ) } = η R 1 1 R 2 1 ( y , x )

and

ν ( R 1 R 2 ) 1 ( y , x ) = ν R 1 R 2 ( x , y ) = min { ν R 1 ( x , y ) , ν R 2 ( x , y ) } = min { ν R 1 1 ( y , x ) , ν R 2 1 ( y , x ) } = ν R 1 1 R 2 1 ( y , x )

Hence, ( R 1 R 2 ) 1 = R 1 1 R 2 1 .

2) We have, μ R 1 1 ( y , x ) = μ R 1 ( x , y ) , η R 1 1 ( y , x ) = η R 1 ( x , y ) , ν R 1 1 ( y , x ) = ν R 1 ( x , y ) and μ R 2 1 ( y , x ) = μ R 2 ( x , y ) , η R 2 1 ( y , x ) = η R 2 ( x , y ) , ν R 2 1 ( y , x ) = ν R 2 ( x , y ) .

Therefore,

μ ( R 1 R 2 ) 1 ( y , x ) = μ R 1 R 2 ( x , y ) = min { μ R 1 ( x , y ) , μ R 2 ( x , y ) } = min { μ R 1 1 ( y , x ) , μ R 2 1 ( y , x ) } = μ R 1 1 R 2 1 ( y , x ) .

η ( R 1 R 2 ) 1 ( y , x ) = η R 1 R 2 ( x , y ) = min { η R 1 ( x , y ) , η R 2 ( x , y ) } = min { η R 1 1 ( y , x ) , η R 2 1 ( y , x ) } = η R 1 1 R 2 1 ( y , x ) .

and

ν ( R 1 R 2 ) 1 ( y , x ) = ν R 1 R 2 ( x , y ) = max { ν R 1 ( x , y ) , ν R 2 ( x , y ) } = max { ν R 1 1 ( y , x ) , ν R 2 1 ( y , x ) } = ν R 1 1 R 2 1 ( y , x ) .

Hence, ( R 1 R 2 ) 1 = R 1 1 R 2 1 .

Theorem 3.14. Let R 1 , R 2 be picture fuzzy relations from A to B. Then R 1 @ R 2 , R 1 $ R 2 , R 1 © R 2 are also picture fuzzy relations from A to B. But the relation R 1 R 2 may not be closed i.e., R 1 R 2 may not be picture fuzzy relation from A to B.

Proof. It is easy to check that for Let R 1 , R 2 P F R ( A × B ) , R 1 @ R 2 , R 1 $ R 2 , R 1 © R 2 are picture fuzzy relations from A to B.

Now we will show that by an example that the operation is not closed.

Let X = { x 1 , x 2 , x 3 } be a non-empty set.

Let A = { ( x 1 , 0.7 , 0.1 , 0.2 ) , ( x 2 , 0.5 , 0.2 , 0.2 ) , ( x 3 , 0.4 , 0.3 , 0.1 ) } and

B = { ( x 1 , 0.5 , 0.2 , 0.3 ) , ( x 2 , 0.8 , 0.1 , 0.1 ) , ( x 3 , 0.4 , 0.5 , 0.1 ) } be two picture fuzzy sets on X. Then

[ A × B ] = x 1 x 2 x 3 x 1 x 2 x 3 [ ( 0.5 , 0.1 , 0.3 ) ( 0.7 , 0.1 , 0.2 ) ( 0.4 , 0.1 , 0.2 ) ( 0.5 , 0.2 , 0.3 ) ( 0.5 , 0.1 , 0.2 ) ( 0.4 , 0.2 , 0.2 ) ( 0.4 , 0.2 , 0.3 ) ( 0.4 , 0.1 , 0.1 ) ( 0.4 , 0.3 , 0.1 ) ] .

Let R 1 = [ ( 0.4 , 0.1 , 0.5 ) ( 0.5 , 0.0 , 0.4 ) ( 0.4 , 0.1 , 0.4 ) ( 0.3 , 0.2 , 0.5 ) ( 0.5 , 0.1 , 0.4 ) ( 0.2 , 0.1 , 0.6 ) ( 0.3 , 0.2 , 0.4 ) ( 0.2 , 0.1 , 0.6 ) ( 0.3 , 0.3 , 0.4 ) ] and R 2 = [ ( 0.5 , 0.0 , 0.4 ) ( 0.4 , 0.1 , 0.5 ) ( 0.2 , 0.1 , 0.6 ) ( 0.2 , 0.1 , 0.7 ) ( 0.3 , 0.0 , 0.6 ) ( 0.3 , 0.1 , 0.7 ) ( 0.1 , 0.1 , 0.6 ) ( 0.3 , 0.1 , 0.5 ) ( 0.4 , 0.2 , 0.4 ) ] be two picture fuzzy relations from A to B. Then

R 1 R 2 = [ ( 0.12 , 0.00 , 0.12 ) ( 0.12 , 0.00 , 0.12 ) ( 0.04 , 0.005 , 0.15 ) ( 0.03 , 0.01 , 0.24 ) ( 0.09 , 0.00 , 0.15 ) ( 0.03 , 0.005 , 0.30 ) ( 0.02 , 0.01 , 0.15 ) ( 0.03 , 0.005 , 0.20 ) ( 0.07 , 0.03 , 0.09 ) ]

According to the definition of picture fuzzy relation over picture fuzzy sets, we have μ R 1 R 2 ( x 1 , x 1 ) = 0.12 μ A × B ( x 1 , x 1 ) = 0.5 , η R 1 R 2 ( x 1 , x 1 ) = 0.0 η A × B ( x 1 , x 1 ) = 0.1 but ν R 1 R 2 ( x 1 , x 1 ) = 0.12 ν A × B ( x 1 , x 1 ) = 0.3 .

Hence R 1 R 2 is not picture fuzzy relation from A to B.

4. Composition of Picture Fuzzy Relations

Definition 4.1. Let R P F R ( A × B ) and S P F R ( B × C ) , then the max-min composition of R and S is the picture fuzzy relation from A to C defined as

R S = { ( ( x , y ) , μ R S ( x , y ) , η R S ( x , y ) , ν R S ( x , y ) ) : x , y X } ,

where

μ R S ( x , y ) = z X { μ S ( x , z ) μ R ( z , y ) } ,

η R S ( x , y ) = z X { η S ( x , z ) η R ( z , y ) } ,

and

ν R S ( x , y ) = z X { ν S ( x , z ) ν R ( z , y ) } .

when ever 0 μ R S ( x , y ) + η R S ( x , y ) + ν R S ( x , y ) 1 .

Proposition 4.2. Let R 1 P F R ( A × B ) and R 2 P F R ( B × C ) , then R 1 R 2 P F R ( A × C ) .

Proof. For all ( x , z ) X × X , let proof

μ R 1 R 2 ( x , z ) + η R 1 R 2 ( x , z ) + ν R 1 R 2 ( x , z ) 1 .

For all ϵ > 0 , there exists y * X :

μ R 1 R 2 ( x , z ) < μ R 2 ( x , y * ) μ R 1 ( y * , z ) + ϵ .

It is easily seen that

η R 1 R 2 ( x , z ) η R 2 ( x , y * ) η R 1 ( y * , z )

and ν R 1 R 2 ( x , z ) ν R 2 ( x , y * ) ν R 1 ( y * , z ) .

Now,

μ R 1 R 2 ( x , z ) + η R 1 R 2 ( x , z ) + ν R 1 R 2 ( x , z ) < μ R 2 ( x , y * ) μ R 1 ( y * , z ) + η R 2 ( x , y * ) η R 1 ( y * , z ) + ν R 2 ( x , y * ) ν R 2 ( y * , z ) + ϵ

Case 1: ν R 2 ( x , y * ) ν R 1 ( y * , z ) = ν R 2 ( x , y * ) . Then

μ R 2 ( x , y * ) μ R 1 ( y * , z ) + η R 2 ( x , y * ) η R 1 ( y * , z ) + ν R 2 ( x , y * ) ν R 1 ( y * , z ) + ϵ = μ R 2 ( x , y * ) μ R 1 ( y * , z ) + η R 2 ( x , y * ) η R 1 ( y * , z ) + ν R 2 ( x , y * ) + ϵ μ R 2 ( x , y * ) + η R 2 ( x , y * ) + ν R 2 ( x , y * ) + ϵ 1 + ϵ .

Case 2: ν R 2 ( x , y * ) ν R 1 ( y * , z ) = ν R 1 ( y * , z ) . Then

μ R 2 ( x , y * ) μ R 1 ( y * , z ) + η R 2 ( x , y * ) η R 1 ( y * , z ) + ν R 2 ( x , y * ) ν R 1 ( y * , z ) + ϵ = μ R 2 ( x , y * ) μ R 1 ( y * , z ) + η R 2 ( x , y * ) η R 1 ( y * , z ) + ν R 1 ( y * , z ) + ϵ μ R 1 ( y * , z ) + η R 1 ( y * , z ) + ν R 1 ( y * , z ) + ϵ 1 + ϵ .

Then μ R 1 R 2 ( x , z ) + η R 1 R 2 ( x , z ) + ν R 1 R 2 ( x , z ) 1 + ϵ for all ϵ > 0 .

Hence μ R 1 R 2 ( x , z ) + η R 1 R 2 ( x , z ) + ν R 1 R 2 ( x , z ) 1 .

Theorem 4.3. For each R P F R ( A × B ) and S P F R ( B × C ) , ( S R ) 1 = R 1 S 1 is fulfilled.

Proof.

μ ( S R ) 1 ( z , x ) = μ ( S R ) ( x , z ) = y X { μ R ( x , y ) μ S ( y , z ) } = y X { μ R 1 ( y , x ) μ S 1 ( z , y ) } = y X { μ S 1 ( z , y ) μ R 1 ( y , x ) } = μ R 1 S 1 ( z , x )

η ( S R ) 1 ( z , x ) = η ( S R ) ( x , z ) = y X { η R ( x , y ) η S ( y , z ) } = y X { η R 1 ( y , x ) η S 1 ( z , y ) } = y X { η S 1 ( z , y ) η R 1 ( y , x ) } = η R 1 S 1 ( z , x )

and

ν ( S R ) 1 ( z , x ) = η ( S R ) ( x , z ) = y X { ν R ( x , y ) ν S ( y , z ) } = y X { ν R 1 ( y , x ) ν S 1 ( z , y ) } = y X { ν S 1 ( z , y ) ν R 1 ( y , x ) } = ν R 1 S 1 ( z , x ) . .

Theorem 4.4. Let P , Q , R P F R ( A × B ) . Then

1) P Q P R Q R .

2) P Q R P R Q .

Proof. 1) P Q , then

μ P ( y , z ) μ Q ( y , z ) , η P ( y , z ) η Q ( y , z ) and ν P ( y , z ) ν Q ( y , z ) .

Now,

μ P R ( x , z ) = y X { μ R ( x , y ) μ P ( y , z ) } y X { μ R ( x , y ) μ Q ( y , z ) } as μ P ( y , z ) μ Q ( y , z ) = μ Q R ( x , z )

Similarly, we can prove that,

η P R ( x , z ) η Q R ( x , z ) .

Again,

ν P R ( x , z ) = y X { ν R ( x , y ) ν P ( y , z ) } y X { ν R ( x , y ) ν Q ( y , z ) } as ν P ( y , z ) ν Q ( y , z ) ν Q R ( x , z )

The property 2) can be proved in similar manner.

Theorem 4.5. Let P , R P F R ( B × C ) , Q P F R ( A × B ) , then

1) ( R P ) Q = ( R Q ) ( P Q ) .

2) ( R P ) Q = ( R Q ) ( P Q ) .

Proof. 1) In order to proof 1), we have to show that

a) μ ( R P ) Q ( x , z ) = μ R Q ( x , z ) μ P Q ( x , z ) .

b) η ( R P ) Q ( x , z ) = η R Q ( x , z ) η P Q ( x , z ) .

c) ν ( R P ) Q ( x , z ) = ν R Q ( x , z ) ν P Q ( x , z ) .

Now,

a) μ ( R P ) Q ( x , z ) = y X { μ Q ( x , y ) ( μ R ( y , z ) μ P ( y , z ) ) } = y X { ( μ Q ( x , y ) μ R ( y , z ) ) ( μ Q ( x , y ) μ P ( y , z ) ) } = y X { ( μ Q ( x , y ) μ R ( y , z ) ) } y X { ( μ Q ( x , y ) μ P ( y , z ) ) } = μ R Q ( x , z ) μ P Q ( x , z )

b) η ( R P ) Q ( x , z ) = y X { η Q ( x , y ) ( η R ( y , z ) η P ( y , z ) ) } = y X { ( η Q ( x , y ) η R ( y , z ) ) ( η Q ( x , y ) η P ( y , z ) ) } = y X { ( η Q ( x , y ) η R ( y , z ) ) } y X { ( η Q ( x , y ) η P ( y , z ) ) } = η R Q ( x , z ) η P Q ( x , z )

c) ν ( R P ) Q ( x , z ) = y X { ν Q ( x , y ) ( ν R ( y , z ) ν P ( y , z ) ) } = y X { ( ν Q ( x , y ) ν R ( y , z ) ) ( ν Q ( x , y ) ν P ( y , z ) ) } = y X { ( ν Q ( x , y ) ν R ( y , z ) ) } y X { ( ν Q ( x , y ) ν P ( y , z ) ) } = ν R Q ( x , z ) ν P Q ( x , z ) ; ( x , y ) A × B

The property 2) can be proved in similar manner.

Theorem 4.6. Let Q P F R ( A × B ) , P P F R ( B × C ) , R P F R ( C × D ) then ( R P ) Q = R ( P Q ) .

Proof. It is sufficient to prove that

a) μ ( R P ) Q ( x , z ) = μ R ( P Q ) ( x , z ) .

b) η ( R P ) Q ( x , z ) = η R ( P Q ) ( x , z ) .

c) ν ( R P ) Q ( x , z ) = ν R ( P Q ) ( x , z ) .

We have,

μ ( R P ) Q ( x , z ) = y X { μ Q ( x , y ) μ R P ( y , z ) } = y { μ Q ( x , y ) { t { μ P ( y , t ) μ R ( t , z ) } } } = y { t { μ Q ( x , y ) { μ P ( y , t ) μ R ( t , z ) } } } = t { y { [ μ Q ( x , y ) μ P ( y , t ) ] μ R ( t , z ) } } = t { { μ P Q ( x , t ) μ R ( t , z ) } } = μ R ( P Q ) ( x , z ) ; ( x , z ) A × C

η ( R P ) Q ( x , z ) = y X { η Q ( x , y ) η R P ( y , z ) } = y { η Q ( x , y ) { t { η P ( y , t ) η R ( t , z ) } } } = y { t { η Q ( x , y ) { η P ( y , t ) η R ( t , z ) } } } = t { y { [ η Q ( x , y ) η P ( y , t ) ] η R ( t , z ) } } = t { η P Q ( x , t ) η R ( t , z ) } = η R ( P Q ) ( x , z ) ; ( x , z ) A × C

and

ν ( R P ) Q ( x , z ) = y X { ν Q ( x , y ) ν R P ( y , z ) } = y { ν Q ( x , y ) { t { ν P ( y , t ) ν R ( t , z ) } } } = y { t { ν Q ( x , y ) { ν P ( y , t ) ν R ( t , z ) } } } = t { y { [ ν Q ( x , y ) ν P ( y , t ) ] ν R ( t , z ) } } = t { ν P Q ( x , t ) ν R ( t , z ) } = ν R ( P Q ) ( x , z ) ; ( x , z ) A × C .

Definition 4.7. Let R P F R ( A × B ) and S P F R ( B × C ) , then the min-max composition of R and S is the picture fuzzy relation from A to C defined as

R S = { ( ( x , y ) , μ R S ( x , y ) , η R S ( x , y ) , ν R S ( x , y ) ) : x , y X } ,

where

μ R S ( x , y ) = z X { μ S ( x , z ) μ R ( z , y ) } ,

η R S ( x , y ) = z X { η S ( x , z ) η R ( z , y ) } ,

and ν R S ( x , y ) = z X { ν S ( x , z ) ν R ( z , y ) } ,

when ever 0 μ R S ( x , y ) + η R S ( x , y ) + ν R S ( x , y ) 1 .

Theorem 4.8. Let R, P be two elements of P F R ( A × A ) , then ( R P ) c = R c P c .

Proof. As μ R c ( x , z ) = ν R ( x , z ) , η R c ( x , z ) = η R ( x , z ) and ν R c ( x , z ) = μ R ( x , z ) ; for every ( x , z ) A × A .

We have,

R P = { ( x , z ) , y { μ P ( x , y ) μ R ( y , z ) } , y { η P ( x , y ) η R ( y , z ) } , y { ν P ( x , y ) ν R ( y , z ) } } .

Therefore,

( R P ) c = { ( x , z ) , y { ν P ( x , y ) ν R ( y , z ) } , y { η P ( x , y ) η R ( y , z ) } , y { μ P ( x , y ) μ R ( y , z ) } } = R c P c .

Theorem 4.9. For each R P F R ( A × B ) and S P F R ( B × C ) , ( S R ) 1 = R 1 S 1 is fulfilled.

Proof.

μ ( S R ) 1 ( z , x ) = μ ( S R ) ( x , z ) = y X { μ R ( x , y ) μ S ( y , z ) } = y X { μ R 1 ( y , x ) μ S 1 ( z , y ) } = y X { μ S 1 ( z , y ) μ R 1 ( y , x ) } = μ R 1 S 1 ( z , x )

η ( S R ) 1 ( z , x ) = η ( S R ) ( x , z ) = y X { η R ( x , y ) η S ( y , z ) } = y X { η R 1 ( y , x ) η S 1 ( z , y ) } = y X { η S 1 ( z , y ) η R 1 ( y , x ) } = η R 1 S 1 ( z , x )

and

ν ( S R ) 1 ( z , x ) = ν ( S R ) ( x , z ) = y X { ν R ( x , y ) ν S ( y , z ) } = y X { ν R 1 ( y , x ) ν S 1 ( z , y ) } = y X { ν S 1 ( z , y ) ν R 1 ( y , x ) } = ν R 1 S 1 ( z , x ) .

Therefore, ( S R ) 1 = R 1 S 1 .

Theorem 4.10. Let P , Q , R P F R ( A × B ) . Then

1) P Q P R Q R .

2) P Q R P R Q .

Proof. 1) P Q , then

μ P ( y , z ) μ Q ( y , z ) , η P ( y , z ) η Q ( y , z ) and ν P ( y , z ) ν Q ( y , z )

Now,

μ P R ( x , z ) = y X { μ R ( x , y ) μ P ( y , z ) } y X { μ R ( x , y ) μ Q ( y , z ) } as μ P ( y , z ) μ Q ( y , z ) = μ Q R ( x , z )

Similarly, we can prove that,

η P R ( x , z ) η Q R ( x , z ) .

Again,

ν P R ( x , z ) = y X { ν R ( x , y ) ν P ( y , z ) } y X { ν R ( x , y ) ν Q ( y , z ) } as ν P ( y , z ) ν Q ( y , z ) ν Q R ( x , z )

The property 2) can be proved in similar manner.

Theorem 4.11. Let P , R P F R ( B × C ) , Q P F R ( A × B ) , then

1) ( R P ) Q = ( R Q ) ( P Q ) .

2) ( R P ) Q = ( R Q ) ( P Q ) .

Proof. 1) In order to proof 1), we have to show that

a) μ ( R P ) Q ( x , z ) = μ R Q ( x , z ) μ P Q ( x , z ) .

b) η ( R P ) Q ( x , z ) = η R Q ( x , z ) η P Q ( x , z ) .

c) ν ( R P ) Q ( x , z ) = ν R Q ( x , z ) ν P Q ( x , z ) .

a) μ ( R P ) Q ( x , z ) = y X { μ Q ( x , y ) ( μ R ( y , z ) μ P ( y , z ) ) } = y X { ( μ Q ( x , y ) μ R ( y , z ) ) ( μ Q ( x , y ) μ P ( y , z ) ) } = y X { ( μ Q ( x , y ) μ R ( y , z ) ) } y X { ( μ Q ( x , y ) μ P ( y , z ) ) } = μ R Q ( x , z ) μ P Q ( x , z )

b) η ( R P ) Q ( x , z ) = y X { η Q ( x , y ) ( η R ( y , z ) η P ( y , z ) ) } = y X { ( η Q ( x , y ) η R ( y , z ) ) ( η Q ( x , y ) η P ( y , z ) ) } = y X { ( η Q ( x , y ) η R ( y , z ) ) } y X { ( η Q ( x , y ) η P ( y , z ) ) } = η R Q ( x , z ) η P Q ( x , z )

c) ν ( R P ) Q ( x , z ) = y X { ν Q ( x , y ) ( ν R ( y , z ) ν P ( y , z ) ) } = y X { ( ν Q ( x , y ) ν R ( y , z ) ) ( ν Q ( x , y ) ν P ( y , z ) ) } = y X { ( ν Q ( x , y ) ν R ( y , z ) ) } y X { ( ν Q ( x , y ) ν P ( y , z ) ) } = ν R Q ( x , z ) ν P Q ( x , z ) ; ( x , y ) A × B .

The property 2) can be proved in similar manner.

Theorem 4.12. Let Q P F R ( A × B ) , P P F R ( B × C ) , R P F R ( C × D ) then

( R P ) Q = R ( P Q ) .

Proof. It is sufficient to prove that

a) μ ( R P ) Q ( x , z ) = μ R ( P Q ) ( x , z ) .

b) η ( R P ) Q ( x , z ) = η R ( P Q ) ( x , z ) .

c) ν ( R P ) Q ( x , z ) = ν R ( P Q ) ( x , z ) .

We have,

μ ( R P ) Q ( x , z ) = y X { μ Q ( x , y ) μ ( R P ) ( y , z ) } = y X { μ Q ( x , y ) { t { μ P ( y , t ) μ R ( t , z ) } } } = y X { t { μ Q ( x , y ) { μ P ( y , t ) μ R ( t , z ) } } } = t { y { [ μ Q ( x , y ) μ P ( y , t ) ] μ R ( t , z ) } } = t { { μ P Q ( x , t ) μ R ( t , z ) } } = μ R ( P Q ) ( x , z ) ; ( x , z ) A × C

η ( R P ) Q ( x , z ) = y X { η Q ( x , y ) η R P ( y , z ) } = y { η Q ( x , y ) { t { η P ( y , t ) η R ( t , z ) } } } = y { t { η Q ( x , y ) { η P ( y , t ) η R ( t , z ) } } } = t { y { [ η Q ( x , y ) η P ( y , t ) ] η R ( t , z ) } } = t { η P Q ( x , t ) η R ( t , z ) } = η R ( P Q ) ( x , z ) ; ( x , z ) A × C

and

ν ( R P ) Q ( x , z ) = y X { ν Q ( x , y ) ν R P ( y , z ) } = y X { ν Q ( x , y ) { t { ν P ( y , t ) ν R ( t , z ) } } } = y { t { ν Q ( x , y ) { ν P ( y , t ) ν R ( t , z ) } } } = t { y { [ ν Q ( x , y ) ν P ( y , t ) ] ν R ( t , z ) } } = t { ν P Q ( x , t ) ν R ( t , z ) } = ν R ( P Q ) ( x , z ) , ( x , z ) A × C .

5. Picture Fuzzy Relations in a Picture Fuzzy Set

Definition 5.1. The relation R P F R ( A × A ) is called:

1) Reflexive if for every x X , μ R ( x , x ) = 1 , η R ( x , x ) = 0 and ν R ( x , x ) = 0 .

2) Anti-reflexive if for every x X , μ R ( x , x ) = 0 , η R ( x , x ) = 0 and ν R ( x , x ) = 1 .

Definition 5.2. A PFR R on A P F S ( X ) is reflexive of order ( α , γ , β ) if μ R ( x , x ) = α , η R ( x , x ) = γ and ν R ( x , x ) = β ; x X and α + γ + β 1 .

Theorem 5.3. Let R P F R ( A × A ) , then R is reflexive iff R c is anti-reflexive,

Proof. Let R is reflexive. Then we have,

μ R ( x , x ) = 1 , η R ( x , x ) = 0 and ν R ( x , x ) = 0 .

From the definition of complement relation, we have

μ R c ( x , x ) = ν R ( x , x ) , η R c ( x , x ) = η R ( x , x ) and ν R c ( x , x ) = μ R ( x , x )

which implies,

μ R c ( x , x ) = 0 , η R c ( x , x ) = 0 and ν R c ( x , x ) = 1 .

Thus, R c is anti-reflexive.

Conversely, let R c is anti-reflexive. Then

μ R c ( x , x ) = 0 , η R c ( x , x ) = 0 and ν R c ( x , x ) = 1 .

From the definition of complement relation, we have

μ R c ( x , x ) = ν R ( x , x ) , η R c ( x , x ) = η R ( x , x ) and ν R c ( x , x ) = μ R ( x , x )

which implies,

ν R ( x , x ) = 0 , η R ( x , x ) = 0 and μ R ( x , x ) = 1 .

Theorem 5.4. Let R 1 P F R ( A × A ) is reflexive. Then

1) R 1 1 is reflexive.

2) R 1 R 2 is reflexive for every R 2 P F R ( A × A ) .

3) R 1 R 2 is reflexive if and only if R 2 P F R ( A × A ) is reflexive.

Proof. 1) Since R 1 is reflexive, so for every x X ;

μ R 1 ( x , x ) = 1 , η R 1 ( x , x ) = 0 and ν R 1 ( x , x ) = 0 .

From the definition of inverse relation, we have

μ R 1 1 ( y , x ) = μ R 1 ( x , y ) , η R 1 1 ( y , x ) = η R 1 ( x , y ) , ν R 1 1 ( y , x ) = ν R 1 ( x , y ) .

Therefore,

μ R 1 1 ( x , x ) = μ R 1 ( x , x ) = 1 ; as R 1 is reflexive.

η R 1 1 ( x , x ) = η R 1 ( x , x ) = 0 ; as R 1 is reflexive.

ν R 1 1 ( x , x ) = ν R 1 ( x , x ) = 0 ; as R 1 is reflexive.

Thus, R 1 1 is reflexive.

2)

μ R 1 R 2 ( x , x ) = μ R 1 ( x , x ) μ R 2 ( x , x ) = 1 μ R 2 ( x , x ) = 1

η R 1 R 2 ( x , x ) = η R 1 ( x , x ) η R 2 ( x , x ) = 0 η R 2 ( x , x ) = 0

ν R 1 R 2 ( x , x ) = ν R 1 ( x , x ) ν R 2 ( x , x ) = 0 ν R 2 ( x , x ) = 0

Thus, R 1 R 2 is reflexive.

3)

μ R 1 R 2 ( x , x ) = μ R 1 ( x , x ) μ R 2 ( x , x ) = 1 μ R 2 ( x , x ) = μ R 2 ( x , x ) = 1

η R 1 R 2 ( x , x ) = η R 1 ( x , x ) η R 2 ( x , x ) = 1 η R 2 ( x , x ) = η R 2 ( x , x ) = 0

ν R 1 R 2 ( x , x ) = ν R 1 ( x , x ) ν R 2 ( x , x ) = 0 ν R 2 ( x , x ) = ν R 2 ( x , x ) = 0

Thus, R 1 R 2 is reflexive.

Theorem 5.5. Let R 1 , R 2 P F R ( A × A ) are reflexive. Then

1) R 1 R 2 is reflexive,

2) R 1 R 2 is reflexive.

Proof. 1) Since R 1 and R 2 are reflexive, so for every x X ;

μ R 1 ( x , x ) = 1 , η R 1 ( x , x ) = 0 and ν R 1 ( x , x ) = 0 and

μ R 2 ( x , x ) = 1 , η R 2 ( x , x ) = 0 and ν R 2 ( x , x ) = 0 .

Now,

μ R 1 R 2 ( x , x ) = max { μ R 1 ( x , x ) , μ R 2 ( x , x ) } = max { 1 , 1 } as R 1 and R 2 arereflexive = 1

η R 1 R 2 ( x , y ) = min { η R 1 ( x , y ) , η R 2 ( x , y ) } = min { 0 , 0 } as R 1 and R 2 arereflexive = 0

ν R 1 R 2 ( x , y ) = min { ν R 1 ( x , y ) , ν R 2 ( x , y ) } = min { 0 , 0 } as R 1 and R 2 arereflexive = 0

Therefore, R 1 R 2 is reflexive.

2)

Since R 1 and R 2 are reflexive, so for every x X ;

μ R 1 ( x , x ) = 1 , η R 1 ( x , x ) = 0 and ν R 1 ( x , x ) = 0 and

μ R 2 ( x , x ) = 1 , η R 2 ( x , x ) = 0 and ν R 2 ( x , x ) = 0 .

Now,

μ R 1 R 2 ( x , y ) = min { μ R 1 ( x , y ) , μ R 2 ( x , y ) } = min { 1 , 1 } as R 1 and R 2 arereflexive = 1

η R 1 R 2 ( x , y ) = min { η R 1 ( x , y ) , η R 2 ( x , y ) } = min { 0 , 0 } as R 1 and R 2 arereflexive = 0

ν R 1 R 2 ( x , y ) = max { ν R 1 ( x , y ) , ν R 2 ( x , y ) } = max { 0 , 0 } as R 1 and R 2 arereflexive = 0

Therefore, R 1 R 2 is reflexive.

Theorem 5.6. If R is reflexive of order ( α , γ , β ) ,then then so is R 1 .

Proof. Since R is reflexive of order ( α , γ , β ) , so for every x X ;

μ R ( x , x ) = α , η R ( x , x ) = γ and ν R ( x , x ) = β .

From the definition of inverse relation, we have

μ R 1 ( y , x ) = μ R ( x , y ) , η R 1 ( y , x ) = η R ( x , y ) , ν R 1 ( y , x ) = ν R ( x , y ) .

Therefore,

μ R 1 ( x , x ) = μ R ( x , x ) = α ; as R is reflexive of order α .

η R 1 ( x , x ) = η R ( x , x ) = γ ; as R is reflexive of order γ .

ν R 1 ( x , x ) = ν R ( x , x ) = β ; as R is reflexive of order β .

Thus, R 1 is reflexive of order ( α , γ , β ) .

Theorem 5.7. Let R 1 , R 2 P F R ( A × A ) are reflexive of order ( α , γ , β ) . Then

1) R 1 R 2 is reflexive of order ( α , γ , β ) .

2) R 1 R 2 is reflexive of order ( α , γ , β ) .

Proof. 1) Since R 1 and R 2 are reflexive of order ( α , γ , β ) , so for every x X ;

μ R 1 ( x , x ) = α , η R 1 ( x , x ) = γ and ν R 1 ( x , x ) = β and

μ R 2 ( x , x ) = α , η R 2 ( x , x ) = γ and ν R 2 ( x , x ) = β .

Now,

μ R 1 R 2 ( x , x ) = max { μ R 1 ( x , x ) , μ R 2 ( x , x ) } = max { α , α } as R 1 and R 2 arereflexiveoforder α = α

η R 1 R 2 ( x , y ) = min { η R 1 ( x , y ) , η R 2 ( x , y ) } = min { γ , γ } as R 1 and R 2 arereflexiveoforder γ = γ

ν R 1 R 2 ( x , y ) = min { ν R 1 ( x , y ) , ν R 2 ( x , y ) } = min { β , β } as R 1 and R 2 arereflexiveoforder β = β

Therefore, R 1 R 2 is reflexive of order ( α , γ , β ) .

2) Since R 1 and R 2 are reflexive of order ( α , γ , β ) , so for every x X ;

μ R 1 ( x , x ) = α , η R 1 ( x , x ) = γ and ν R 1 ( x , x ) = β and

μ R 2 ( x , x ) = α , η R 2 ( x , x ) = γ and ν R 2 ( x , x ) = β .

Now,

μ R 1 R 2 ( x , y ) = min { μ R 1 ( x , y ) , μ R 2 ( x , y ) } = min { α , α } as R 1 and R 2 arereflexiveoforder α = α

η R 1 R 2 ( x , y ) = min { η R 1 ( x , y ) , η R 2 ( x , y ) } = min { γ , γ } as R 1 and R 2 arereflexiveoforder γ = γ

ν R 1 R 2 ( x , y ) = max { ν R 1 ( x , y ) , ν R 2 ( x , y ) } = max { β , β } as R 1 and R 2 arereflexiveoforder β = β

Therefore, R 1 R 2 is reflexive of order ( α , γ , β ) .

Definition 5.8. A PFR, R P F R ( A × A ) is symmetric if and only if

μ R ( x , y ) = μ R ( y , x ) , η R ( x , y ) = η R ( y , x ) and ν R ( x , y ) = ν R ( y , x ) ; x , y X .

Theorem 5.9. If R is symmetric, then so is R 1 .

Proof. We know,

μ R 1 ( x , y ) = μ R ( y , x ) = μ R ( x , y ) since R is symmetric = μ R 1 ( y , x ) bydefinitionof R 1

η R 1 ( x , y ) = η R ( y , x ) = η R ( x , y ) since R is symmetric = η R 1 ( y , x ) bydefinitionof R 1

and

ν R 1 ( x , y ) = ν R ( y , x ) = ν R ( x , y ) since R is symmetric = ν R 1 ( y , x ) bydefinitionof R 1 .

Theorem 5.10. R is symmetric if and only if R = R 1 .

Proof. Let R is symmetric, then

μ R 1 ( x , y ) = μ R ( y , x ) = μ R ( x , y ) ; since R is symmetric.

μ R 1 ( x , y ) = η R ( y , x ) = η R ( x , y ) ; since R is symmetric.

ν R 1 ( x , y ) = ν R ( y , x ) = ν R ( x , y ) ; since R is symmetric.

So R 1 = R .

Conversely, let R 1 = R . Then

μ R ( x , y ) = μ R 1 ( x , y ) = μ R ( y , x )

η R ( x , y ) = η R 1 ( x , y ) = η R ( y , x )

ν R ( x , y ) = ν R 1 ( x , y ) = ν R ( y , x )

Hence, R is symmetric.

Theorem 5.11. Let R 1 , R 2 P F R ( A × A ) are symmetric. Then

1) R 1 R 2 is symmetric.

2) R 1 R 2 is symmetric.

Proof. 1) Since R 1 and R 2 are symmetric, so x , y X ;

μ R 1 ( x , y ) = μ R 1 ( y , x ) , η R 1 ( x , y ) = η R 1 ( y , x ) and ν R 1 ( x , y ) = ν R 1 ( y , x ) and

μ R 2 ( x , y ) = μ R 2 ( y , x ) , η R 2 ( x , y ) = η R 2 ( y , x ) and ν R 2 ( x , y ) = ν R 2 ( y , x ) .

Now,

μ R 1 R 2 ( x , y ) = max { μ R 1 ( x , y ) , μ R 2 ( x , y ) } = max { μ R 1 ( y , x ) , μ R 2 ( y , x ) } as R 1 and R 2 aresymmetric = μ R 1 R 2 ( y , x )

η R 1 R 2 ( x , y ) = min { η R 1 ( x , y ) , η R 2 ( x , y ) } = min { η R 1 ( y , x ) , η R 2 ( y , x ) } as R 1 and R 2 aresymmetric = η R 1 R 2 ( x , y )

ν R 1 R 2 ( x , y ) = min { ν R 1 ( x , y ) , ν R 2 ( x , y ) } = min { ν R 1 ( y , x ) , ν R 2 ( y , x ) } as R 1 and R 2 aresymmetric = ν R 1 R 2 ( y , x )

Therefore, R 1 R 2 is symmetric.

2)

Since R 1 and R 2 are symmetric, so x , y X ;

μ R 1 ( x , y ) = μ R 1 ( y , x ) , η R 1 ( x , y ) = η R 1 ( y , x ) and ν R 1 ( x , y ) = ν R 1 ( y , x ) and

μ R 2 ( x , y ) = μ R 2 ( y , x ) , η R 2 ( x , y ) = η R 2 ( y , x ) and ν R 2 ( x , y ) = ν R 2 ( y , x )

μ R 1 R 2 ( x , y ) = min { μ R 1 ( x , y ) , μ R 2 ( x , y ) } = min { μ R 1 ( y , x ) , μ R 2 ( y , x ) } as R 1 and R 2 aresymmetric = μ R 1 R 2 ( y , x )

η R 1 R 2 ( x , y ) = min { η R 1 ( x , y ) , η R 2 ( x , y ) } = min { η R 1 ( y , x ) , η R 2 ( y , x ) } as R 1 and R 2 aresymmetric = η R 1 R 2 ( y , x )

ν R 1 R 2 ( x , y ) = max { ν R 1 ( x , y ) , ν R 2 ( x , y ) } = max { ν R 1 ( y , x ) , ν R 2 ( y , x ) } as R 1 and R 2 aresymmetric = ν R 1 R 2 ( y , x )

Therefore, R 1 R 2 is symmetric.

Definition 5.12. A PFR R on A P F S ( X ) is said to be transitive if R R R .

Theorem 5.13. If R is transitive, then so is R 1 .

Proof. We know,

μ R 1 ( x , y ) = μ R ( y , x ) μ R R ( y , x ) = z X { μ R ( y , z ) μ R ( z , x ) } = z X { μ R 1 ( x , z ) μ R 1 ( z , y ) } = μ R 1 R 1 ( x , y )

η R 1 ( x , y ) = η R ( y , x ) η R R ( y , x ) = z X { η R ( y , z ) η R ( z , x ) } = z X { η R 1 ( x , z ) η R 1 ( z , y ) } = η R 1 R 1 ( x , y )

ν R 1 ( x , y ) = ν R ( y , x ) ν R R ( y , x ) = z X { ν R ( y , z ) ν R ( z , x ) } = z X { ν R 1 ( x , z ) ν R 1 ( z , y ) } = ν R 1 R 1 ( x , y )

So, R 1 R 1 R 1 .

Hence, the theorem is proved.

Theorem 5.14. If R 1 and R 2 are two picture fuzzy transitive relations on a set X, then so is R 1 R 2 .

Proof. Trivial.

6. Conclusions

Picture fuzzy relations play a vital role in real life situations where uncertainty arises with the positive, neutral and negative membership degrees of an element. Nowadays many researchers have become interested in working in this field because of the less complicated and rapid decision making strategies using picture fuzzy relations. In this work, picture fuzzy relations over picture fuzzy sets have been defined with examples. Several properties are described related to the picture fuzzy relations over picture fuzzy sets.

Acknowledgements

I am grateful to my co-authors for their continuous support and also thanks to the reviewers for their valuable comments which help to improve my paper.

Conflicts of Interest

The authors declare no conflicts of interest regarding the publication of this paper.

References

[1] Zadeh, L.A. (1965) Fuzzy Sets. Information and Control, 8, 338-353.
https://doi.org/10.1016/S0019-9958(65)90241-X
[2] Atanassov, K.T. (1986) Intuitionistic Fuzzy Sets. Fuzzy Sets and Systems, 20, 87-96.
https://doi.org/10.1016/S0165-0114(86)80034-3
[3] Cuong, B.C. (2014) Picture Fuzzy Sets. Journal of Computer Science and Cybernetics, 30, 409-420.
[4] Zadeh, L.A. (1971) Similarity Relations and Fuzzy Orderings. Information Sciences, 3, 177-200.
https://doi.org/10.1016/S0020-0255(71)80005-1
[5] Kaufman, A. (1975) Introduction to the Theory of Fuzzy Subsets: Fundamental Theoretical Elements. Academic Press, New York.
[6] Klir, G. and Yaun, B. (1995) Fuzzy Set and Fuzzy Logic: Theory and Application. Prentice Hall, Upper Saddle River.
[7] Zimmerman, H.J. (1996) Fuzzy Set Theory and Its Application. Kluwer Academic Publishers, Netherlands.
[8] Blin, J.M. (1974) Fuzzy Relations in Group Decision Theory. Journal of Cybernetics, 4, 17-22.
https://doi.org/10.1080/01969727408546063
[9] Cock, M.D. and Kerre, E.E. (2003) On (Un)Suitable Fuzzy Relations to Model Approximate Equality. Fuzzy Sets and Systems, 133, 137-153.
https://doi.org/10.1016/S0165-0114(02)00239-7
[10] Yang, M.S. and Shih, H.-M. (2001) Cluster Analysis Based on Fuzzy Relations. Fuzzy Sets and Systems, 120, 197-212.
https://doi.org/10.1016/S0165-0114(99)00146-3
[11] Tamura, S., Higuchi, S. and Tanaka, K. (1971) Pattern Classification Based on Fuzzy Relations. IEEE Transactions on Systems, Man, and Cybernetics, SMC-1, 61-66.
https://doi.org/10.1109/TSMC.1971.5408605
[12] Qi, F., Yang, S.W., Feng, X. and Jiang, X.L. (2013) Research on the Comprehensive Evaluation of Sports Management System with Interval-Valued Intuitionistic Fuzzy Information. Bulletin of Science and Technology, 29, 85-87.
[13] Jin, J.L., Wei, Y.M. and Ding, J. (2004) Fuzzy Comprehensive Evaluation Model Based on Improved Analytic Hierarchy Process. Journal of Hydraulic Engineering, 3, 65-70.
[14] Dai, W.Y., Zhou, C.M. and Lei, Y.J. (2009) Information Security Evaluation Based on Multilevel Intuitionistic Fuzzy Comprehensive Method. Microelectron Computer, 26, 75-179.
[15] Bustince, H. (2000) Construction of Intuitionistic Fuzzy Relations with Predetermined Properties. Fuzzy Sets and Systems, 109, 379-403.
https://doi.org/10.1016/S0165-0114(97)00381-3
[16] Burillo, P. and Bustince, H. (1995) Intuitionistic Fuzzy Relations (Part I). Mathware and Soft Computing, 2, 5-38.
[17] Lei, Y.J., Wang, B.S. and Miao, Q.G. (2005) On the Intuitionistic Fuzzy Relations with Compositional Operations. Systems Engineering-Theory & Practice, 25, 30-34.
[18] Yang, H.-L. and Li, S.-G. (2009) Restudy of Intuitionistic Fuzzy Relations. Systems Engineering-Theory & Practice, 29, 114-120.
https://doi.org/10.1016/S1874-8651(10)60041-5
[19] Cuong, B.C. and Kreinovich, V. (2013) Picture Fuzzy Sets-A New Concept for Computational Intelligence Problems. Proceedings of 2013 Third World Congress on Information and Communication Technologies (WIICT 2013), Hanoi, 15-18 December 2013, 1-6.
https://doi.org/10.1109/WICT.2013.7113099
[20] Dutta, P. and Saikia, K. (2018) Some Aspects of Equivalence Picture Fuzzy Relation. Amse Journals-Amse Iieta Publication-2017-Series: Advances A, 54, 424-434.

Copyright © 2024 by authors and Scientific Research Publishing Inc.

Creative Commons License

This work and the related PDF file are licensed under a Creative Commons Attribution 4.0 International License.