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
,
where
.
Definition 2.2. [2]. An intuitionistic fuzzy set A in X is given by
,
where
and
, with the condition
.
The values
and
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
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,
for any
.
Particularly,
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
.
Definition 2.3. [3] [19]. A picture fuzzy set A on a universe of discourse X is of the form
,
where
is called the degree of positive membership of x in A,
is called the degree of neutral membership of x in A and
is called the degree of negative membership of x in A, and where
and
satisfy the following condition:
.
Here
is called the degree of refusal membership of x in A.
The set of all picture fuzzy sets in X will be denoted by
.
Definition 2.4. [3] [19]. Let
, then the subset, equality, the union, intersection and complement are defined as follows:
1)
iff
and
2)
iff
and
3)
4)
5)
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
where
,
,
satisfying the condition
for every
.
The set of all picture fuzzy relations in X × Y will be denoted by
.
Definition 2.6. [20]. Let
. We define the inverse relation
between Y and X:
,
,
,
.
Definition 2.7. [20]. Let R and P be two picture fuzzy relations between X and Y, for every
we define:
1)
and
and
2)
3)
4)
Here,
and
denote the maximum and minimum operators respectively.
Definition 2.8. [19]. Let
and
. Then the composition of R and S is the PFR from X to Z defined as
where
,
and
.
Definition 2.9. [20]. The relation
is called:
1) Reflexive if
,
and
;
.
2) Anti-reflexive if
,
and
;
.
Definition 2.10. [20]. A PFR,
is reflexive of order
if
,
and
;
and
.
Definition 2.11. [20]. A picture fuzzy relation
is symmetric if
,
and
;
.
Definition 2.12. [20]. Let
be a picture fuzzy relation. Then R is transitive if
.
3. Some Structures of Picture Fuzzy Relations
Definition 3.1. Let X be the universal set and
and
be two PFSs of X. Define the Cartesian product
as the PFS of
by
where for all
,
,
and
.
Definition 3.2. Let R be a PFS of
with
i.e.
;
1)
;
2)
;
3)
;
4)
.
Then we say that R is a picture fuzzy relation from A to B. In particular, if
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
.
From now on, we assume that, the set X is finite; say
. The picture fuzzy relation R from A to B,
can be represented as a matrix
, where
,
and
,
. We write
,
and
.
Example 3.2. Let
be a non-empty set.
Let
and
be two picture fuzzy sets on X. Then
.
Let
, while
,
and
.
Definition 3.3. Let R be a picture fuzzy relation on A. The complement of the relation R is a picture fuzzy relation
, where
,
and
.
We can write
.
Example 3.3. Consider the relation R from example 3.2
, then
.
Definition 3.4. Let R be picture fuzzy relation from A to B. Then we define the inverse relation
as
,
,
.
Example 3.4. Consider the relation R from example 3.2
, then
.
Definition 3.5. Let
. Then we say
if for all
;
1)
;
2)
;
3)
.
If
and
then
.
Example 3.5. Consider the example 3.2
Let
and
be two picture fuzzy relations from A to B.
Clearly,
.
Definition 3.6. Let R1, R2 be picture fuzzy relations from A to B. Then the union of R1 and R2,
is a picture fuzzy relation whose positive membership, neutral membership and negative membership are
,
and
.
Definition 3.7. Let R1, R2 be picture fuzzy relations from A to B. Then the intersection of R1 and R2,
is a picture fuzzy relation whose positive membership, neutral membership and negative membership are
,
and
.
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
,
and
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
,
and
.
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
,
and
.
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
,
and
.
Example 3.11. Consider the example 3.2
Let
and
be two picture fuzzy relations from A to B. Then,
Theorem 3.12. Let
be a picture fuzzy relation. Then
.
Proof. By the definition of inverse relation, we have
,
,
.
Now,
and
.
Hence,
.
Theorem 3.13. Let
be two picture fuzzy relations. Then
1)
.
2)
.
Proof. 1) By the definition of inverse relation, we have
,
,
and
,
,
.
Therefore,
and
Hence,
.
2) We have,
,
,
and
,
,
.
Therefore,
.
.
and
.
Hence,
.
Theorem 3.14. Let
be picture fuzzy relations from A to B. Then
,
,
are also picture fuzzy relations from A to B. But the relation
may not be closed i.e.,
may not be picture fuzzy relation from A to B.
Proof. It is easy to check that for Let
,
,
,
are picture fuzzy relations from A to B.
Now we will show that by an example that the operation
is not closed.
Let
be a non-empty set.
Let
and
be two picture fuzzy sets on X. Then
.
Let
and
be two picture fuzzy relations from A to B. Then
According to the definition of picture fuzzy relation over picture fuzzy sets, we have
,
but
.
Hence
is not picture fuzzy relation from A to B.
4. Composition of Picture Fuzzy Relations
Definition 4.1. Let
and
, then the max-min composition of R and S is the picture fuzzy relation from A to C defined as
,
where
,
,
and
.
when ever
.
Proposition 4.2. Let
and
, then
.
Proof. For all
, let proof
.
For all
, there exists
:
.
It is easily seen that
and
.
Now,
Case 1:
. Then
Case 2:
. Then
Then
for all
.
Hence
.
Theorem 4.3. For each
and
,
is fulfilled.
Proof.
and
.
Theorem 4.4. Let
. Then
1)
.
2)
.
Proof. 1)
, then
,
and
.
Now,
Similarly, we can prove that,
.
Again,
The property 2) can be proved in similar manner.
Theorem 4.5. Let
, then
1)
.
2)
.
Proof. 1) In order to proof 1), we have to show that
a)
.
b)
.
c)
.
Now,
a)
b)
c)
The property 2) can be proved in similar manner.
Theorem 4.6. Let
then
.
Proof. It is sufficient to prove that
a)
.
b)
.
c)
.
We have,
and
Definition 4.7. Let
and
, then the min-max composition of R and S is the picture fuzzy relation from A to C defined as
,
where
,
,
and
,
when ever
.
Theorem 4.8. Let R, P be two elements of
, then
.
Proof. As
,
and
; for every
.
We have,
Therefore,
Theorem 4.9. For each
and
,
is fulfilled.
Proof.
and
Therefore,
.
Theorem 4.10. Let
. Then
1)
.
2)
.
Proof. 1)
, then
,
and
Now,
Similarly, we can prove that,
.
Again,
The property 2) can be proved in similar manner.
Theorem 4.11. Let
, then
1)
.
2)
.
Proof. 1) In order to proof 1), we have to show that
a)
.
b)
.
c)
.
a)
b)
c)
The property 2) can be proved in similar manner.
Theorem 4.12. Let
then
.
Proof. It is sufficient to prove that
a)
.
b)
.
c)
.
We have,
and
5. Picture Fuzzy Relations in a Picture Fuzzy Set
Definition 5.1. The relation
is called:
1) Reflexive if for every
,
,
and
.
2) Anti-reflexive if for every
,
,
and
.
Definition 5.2. A PFR R on
is reflexive of order
if
,
and
;
and
.
Theorem 5.3. Let
, then R is reflexive iff
is anti-reflexive,
Proof. Let R is reflexive. Then we have,
,
and
.
From the definition of complement relation, we have
,
and
which implies,
,
and
.
Thus,
is anti-reflexive.
Conversely, let
is anti-reflexive. Then
,
and
.
From the definition of complement relation, we have
,
and
which implies,
,
and
.
Theorem 5.4. Let
is reflexive. Then
1)
is reflexive.
2)
is reflexive for every
.
3)
is reflexive if and only if
is reflexive.
Proof. 1) Since
is reflexive, so for every
;
,
and
.
From the definition of inverse relation, we have
,
,
.
Therefore,
; as
is reflexive.
; as
is reflexive.
; as
is reflexive.
Thus,
is reflexive.
2)
Thus,
is reflexive.
3)
Thus,
is reflexive.
Theorem 5.5. Let
are reflexive. Then
1)
is reflexive,
2)
is reflexive.
Proof. 1) Since
and
are reflexive, so for every
;
,
and
and
,
and
.
Now,
Therefore,
is reflexive.
2)
Since
and
are reflexive, so for every
;
,
and
and
,
and
.
Now,
Therefore,
is reflexive.
Theorem 5.6. If R is reflexive of order
,then then so is
.
Proof. Since R is reflexive of order
, so for every
;
,
and
.
From the definition of inverse relation, we have
,
,
.
Therefore,
; as R is reflexive of order
.
; as R is reflexive of order
.
; as R is reflexive of order
.
Thus,
is reflexive of order
.
Theorem 5.7. Let
are reflexive of order
. Then
1)
is reflexive of order
.
2)
is reflexive of order
.
Proof. 1) Since
and
are reflexive of order
, so for every
;
,
and
and
,
and
.
Now,
Therefore,
is reflexive of order
.
2) Since
and
are reflexive of order
, so for every
;
,
and
and
,
and
.
Now,
Therefore,
is reflexive of order
.
Definition 5.8. A PFR,
is symmetric if and only if
,
and
;
.
Theorem 5.9. If R is symmetric, then so is
.
Proof. We know,
and
Theorem 5.10. R is symmetric if and only if
.
Proof. Let R is symmetric, then
; since R is symmetric.
; since R is symmetric.
; since R is symmetric.
So
.
Conversely, let
. Then
Hence, R is symmetric.
Theorem 5.11. Let
are symmetric. Then
1)
is symmetric.
2)
is symmetric.
Proof. 1) Since
and
are symmetric, so
;
,
and
and
,
and
.
Now,
Therefore,
is symmetric.
2)
Since
and
are symmetric, so
;
,
and
and
,
and
Therefore,
is symmetric.
Definition 5.12. A PFR R on
is said to be transitive if
.
Theorem 5.13. If R is transitive, then so is
.
Proof. We know,
So,
.
Hence, the theorem is proved.
Theorem 5.14. If
and
are two picture fuzzy transitive relations on a set X, then so is
.
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.