# On Complex Intuitionistic Fuzzy Soft Sets with Distance Measures and Entropies

Authors: Tanuj Kumar; Rakesh Kumar Bajaj
Journal: Journal of Mathematics
 (2014)

---

## Abstract

We introduce the concept of complex
intuitionistic fuzzy soft sets which is parametric in nature. However, the theory
of complex fuzzy sets and complex intuitionistic fuzzy sets are independent of the
parametrization tools. Some real life problems, for example, multicriteria decision making
problems, involve the parametrization tools. In order to get their new entropies,
some important properties and operations on the complex intuitionistic fuzzy soft
sets have also been discussed. On the basis of some well-known distance measures,
some new distance measures for the complex intuitionistic fuzzy soft sets have
also been obtained. Further, we have established correspondence between the
proposed entropies and the distance measures of complex intuitionistic fuzzy soft
sets.


---

## Body

## 1. Introduction

Ramot et al. [1, 2] introduced a new innovative concept of complex fuzzy set (CFS), where the membership function μ instead of being a real valued function with the range of [
0
,
1
] is replaced by a complex-valued function of the form r
A
(
x
)
·
e
i
Ω
A
(
x
) (i
=
-
1), where r
A
(
x
) is a real valued function such that r
A
(
x
)
∈
[
0
,
1
] and Ω
A
(
x
) is a periodic function. The key feature of complex fuzzy sets is the presence of phase and its membership. This gives those complex fuzzy sets wavelike properties which could result in constructive and destructive interference depending on the phase value. Several examples are given in [2], which demonstrate the utility of these complex fuzzy sets. They also defined several important operations such as complement, union, and intersection and discussed fuzzy relations for such complex fuzzy sets. On the other hand, Ma et al. [3] used the complex fuzzy set to represent the information with uncertainty and periodicity, where they introduced a product-sum aggregation operator based prediction (PSAOP) method to find the solution of the multiple periodic factor prediction (MPFP) problems. Further, Chen et al. [4] proposed a neurofuzzy system architecture to implement the complex fuzzy rule as a practical application of the concept of complex fuzzy logic.Intuitionistic fuzzy set (IFS), introduced by Atanassov [5], is a controlling tool to deal with vagueness and uncertainty. A prominent characteristic of IFS is that it assigns to each element a membership degree and a nonmembership degree with certain amount of hesitation degree. Atanassov [6, 7] and many other researchers [8, 9] studied different properties of IFSs in decision making problems, particularly in the case of medical diagnosis, sales analysis, new product marketing, financial services, and so forth. Alkouri and Salleh [10] introduced the concept of complex intuitionistic fuzzy set (CIFS) to represent the information which is happening repeatedly over a period of time. Further, as an application, Alkouri and Salleh [11] presented an example of suppler selection model which is based on the distance measure of complex intuitionistic fuzzy sets.Molodtsov [12] pointed out that the important existing theories, namely, probability theory, fuzzy set theory, intuitionistic fuzzy set theory, rough set theory, and so forth, which can be considered as mathematical tools for dealing with uncertainties, have their own difficulties. The inadequacy of the parametrization tools of these theories makes them very limited and difficult. In order to overcome the above-stated difficulties, Molodtsov [12] introduced the concept of soft sets for dealing with uncertainties in parameterized form. Later on Maji et al. [13–17] extended soft sets to fuzzy soft sets and intuitionistic fuzzy soft sets. In 2005, Pei and Miao [18] and Chen et al. [19] have studied and extended the work of Maji et al. [13, 14]. Also, Majumdar and Samanta [20] have further generalized the concept of fuzzy soft sets.In the present paper, we studied some fundamentals of soft set theory, fuzzy soft set theory, intuitionistic fuzzy soft sets, complex fuzzy sets, complex intuitionistic fuzzy sets, and some of their operations in Section2. In Section 3, we introduced the concept of complex intuitionistic fuzzy soft sets (CIFSSs) along with their basic operations. New distance measures for CIFSSs have been obtained on the basis of some well-known distance measures and a general way to find the entropies of complex intuitionistic fuzzy soft sets has also been proposed in Section 4. An application in the area of multicriteria decision making problem on the basis of the proposed CIFSSs has also been suggested in Section 5. Finally, the paper has been concluded in Section 6.


## 2. Preliminaries

In this section, we present some basic definitions of the soft set, fuzzy soft set, intuitionistic fuzzy soft set, complex fuzzy soft set, and some operations on them which are well known in literature [1, 2, 12, 15, 16, 21].Definition 1 (see [12]).
LetX be the universal set and let E be the set of parameters under consideration. Let P
(
X
) denote the power set of X. A soft set may be represented by the set of ordered pairs as
(1)
〈
F
,
E
〉
=
ε
,
F
ε
∣
ε
∈
E
,
F
ε
∈
P
X
,
where F is a mapping given by
(2)
F
:
E
⟶
P
(
X
)
.
In other words, the soft set is a parameterized family of subsets of the universeX. For each ε
∈
E, F
(
ε
) may be considered as a set of ε-elements or as a set of ε-approximate elements of the soft set 〈
F
,
E
〉.Definition 2 (see [16]).
LetX be the universal set and let E be the set of parameters under consideration. Let I
F
S
(
X
) denote the set of all intuitionistic fuzzy subset of X. An intuitionistic fuzzy soft set F
~ may be represented by the set of ordered pairs as
(3)
F
~
,
E
=
ε
,
F
~
ε
∣
ε
∈
E
,
F
~
ε
∈
I
F
S
X
,
where F
~ is a mapping given by F
~
:
E
→
I
F
S
(
X
) such that F
~
(
ε
)
=
ϕ; that is, μ
F
~
(
ε
)
(
x
)
=
0 and ν
F
~
(
ε
)
(
x
)
=
1, for all x
∈
X, if ε
∉
E.Definition 3 (see [16, 21]).
Suppose that〈
F
~
,
E
〉 and 〈
G
~
,
E
〉 are two intuitionistic fuzzy soft sets over a universal set X. Then in view of the above definition, the following operations have been defined as follows.(
P
1
)
〈
F
~
,
E
〉
∪
〈
G
~
,
E
〉
=
〈
H
~
,
E
〉, where ∀
ε
∈
E, x
∈
X. Consider
(4)
H
~
(
ε
)
=
x
,
μ
F
~
ε
x
⋄
μ
G
~
ε
x
,
ν
F
~
ε
x
*
ν
G
~
ε
x
∣
x
∈
X
.
(
P
2
)
〈
F
~
,
E
〉
∩
〈
G
~
,
E
〉
=
〈
H
~
,
E
〉, where ∀
ε
∈
E, x
∈
X. Consider
(5)
H
~
(
ε
)
=
x
,
μ
F
~
ε
x
*
μ
G
~
ε
x
,
ν
F
~
ε
x
⋄
ν
G
~
ε
x
∣
x
∈
X
.
(
P
3
)
(
F
~
,
E
)
c
=
(
F
~
c
,
¬
E
), where mapping F
~
c
:
¬
E
→
I
F
S
(
X
) is given by
(6)
F
~
c
¬
ε
=
x
,
ν
F
~
¬
¬
ε
x
,
μ
F
~
¬
¬
ε
x
∣
x
∈
X
=
x
,
ν
F
~
ε
x
,
μ
F
~
ε
x
∣
x
∈
X
,
∀
¬
ε
∈
¬
E
.
(
P
4
)
〈
F
~
,
E
〉
⊆
〈
G
~
,
E
〉, if and only if μ
F
~
(
ε
)
(
x
)
≤
μ
G
~
(
ε
)
(
x
) and ν
F
~
(
ε
)
(
x
)
≥
ν
G
~
(
ε
)
(
x
), ∀
x
∈
X, and ε
∈
E.
(
P
5
)
〈
F
~
,
E
〉
=
〈
G
~
,
E
〉, if and only if μ
F
~
(
ε
)
(
x
)
=
μ
G
~
(
ε
)
(
x
) and ν
F
~
(
ε
)
(
x
)
=
ν
G
~
(
ε
)
(
x
), ∀
x
∈
X, and ε
∈
E,where ⋄ and * are s-norm and t-norm operators, respectively.Definition 4 (see [1]).
A complex fuzzy setA, defined on universal set X, is characterized by the membership function μ
A
(
x
), which assign to each element x
∈
X a complex-valued grade of membership in A.
LetC
F
S
(
X
) be the set of all complex fuzzy sets on X. The complex fuzzy set A may be represented as the set of ordered pairs:
(7)
A
=
x
,
μ
A
x
:
x
∈
X
,
where μ
A
(
x
)
:
X
→
{
a
∣
a
∈
C
,
|
a
|
≤
1
}.
By definition, the values ofμ
A
(
x
) may receive all the values lying within the unit circle in the complex plane and are of the form
(8)
μ
A
x
=
r
A
x
·
e
i
Ω
A
(
x
)
,
(
i
=
-
1
)
,
where r
A is a real valued function such that r
A
(
x
)
∈
[
0
,
1
] and Ω
A is a periodic function whose periodic law and principal period are, respectively, 2
π and 0
≤
ω
A
x
≤
2
π; that is,
(9)
Ω
A
(
x
)
=
ω
A
(
x
)
+
2
k
π
,
k
=
0
,
±
1
,
±
2
,
…
,
where ω
A
(
x
) is the principal argument.Definition 5 (see [2]).
LetA and B be two complex fuzzy sets on X, and μ
A
(
x
)
=
r
A
(
x
)
·
e
i
ω
A
(
x
) and μ
B
(
x
)
=
r
B
(
x
)
·
e
i
ω
B
(
x
) are their membership functions, respectively. Then the following operations have been defined as follows:(a)
union:A
⋃
‍
B
=
〈
x
,
r
A
(
x
)
⋄
r
B
(
x
)
·
e
ω
A
∪
B
(
x
)
〉
∣
x
∈
X,
(b)
intersection:A
⋂
‍
B
=
〈
x
,
r
A
(
x
)
*
r
B
(
x
)
·
e
ω
A
∪
B
(
x
)
〉
∣
x
∈
X,
where the⋄ and * are s-norm and t-norm operators, respectively. It remains to define ω
A
∪
B
(
x
) and ω
A
∩
B
(
x
) for which the following axioms have to be followed.Definition 6 (see [2]).
LetA and B be two complex fuzzy sets in X. Then complex fuzzy union and intersection are specified by the functions u and v as follows:
(10)
u
:
a
∣
a
∈
C
,
a
≤
1
×
b
∣
b
∈
C
,
b
≤
1
⟶
c
∣
c
∈
C
,
c
≤
1
,
v
:
a
∣
a
∈
C
,
a
≤
1
×
b
∣
b
∈
C
,
b
≤
1
⟶
c
∣
c
∈
C
,
c
≤
1
;
u must satisfy at least the following axioms requirements: (i)
(boundary conditions):u
(
a
,
0
)
=
a;
(ii)
(monotonicity):|
b
|
≤
|
d
|
⇒
|
u
(
a
,
b
)
|
≤
|
u
(
a
,
d
)
|;
(iii)
(commutativity):u
(
a
,
b
)
=
u
(
b
,
a
);
(iv)
(associativity):u
a
,
u
b
,
d
=
u
u
a
,
b
,
d.In some cases, it may be desirable that u also satisfies the following requirements: (i)
(continuity):u is a continuous function;
(ii)
(superidempotency):|
u
(
a
,
a
)
|
>
|
a
|;
(iii)
(strict monotonicity):|
a
|
≤
|
c
| and |
b
|
≤
|
d
|
⇒
|
u
(
a
,
b
)
|
≤
|
u
(
c
,
d
)
|.And v must satisfy the following axiomatic requirements: (i)
(boundary conditions): if|
b
|
=
1, then v
(
a
,
b
)
=
|
a
|;
(ii)
(monotonicity):|
b
|
≤
|
d
|
⇒
|
v
(
a
,
b
)
|
≤
|
v
(
a
,
d
)
|;
(iii)
(commutativity):v
a
,
b
=
v
(
b
,
a
);
(iv)
(associativity):v
a
,
v
b
,
d
=
v
v
a
,
b
,
d.In some cases, it may be required that v also satisfies the following axioms: (i)
(continuity):v is a continuous function;
(ii)
(superidempotency):|
v
(
a
,
a
)
|
<
|
a
|;
(iii)
(strict monotonicity):|
a
|
≤
|
c
| and |
b
|
≤
|
d
|
⇒
|
v
(
a
,
b
)
|
≤
|
v
(
c
,
d
)
|.The following are several possibilities for calculation ofω
A
∪
B
(
x
) and ω
A
∩
B
(
x
), which, if combined with an appropriate function for determining r
A
∪
B
(
x
) and r
A
∩
B
(
x
), satisfies the axiomatic requirements given in the above definitions.(1)
Sum:ω
A
x
+
ω
B
x.
(2)
Max:max
⁡
⁡
(
ω
A
(
x
)
,
ω
B
(
x
)
).
(3)
Min:min
⁡
⁡
ω
A
x
,
ω
B
x
.
(4)
“Winner Take All”:ω
A
(
x
)
,
if
r
A
(
x
)
>
r
B
(
x
)
ω
B
(
x
)
,
if
r
A
x
≤
r
B
x
.LetC be a complex fuzzy set on X with the membership function μ
C
(
x
)
=
r
C
(
x
)
·
e
i
ω
C
(
x
). The complex fuzzy complement of C, denoted by C
-, is specified by a function
(11)
μ
C
-
(
x
)
=
(
1
-
r
C
(
x
)
)
·
e
i
ω
C
-
(
x
)
.Ramot et al. [1] obtained several possible methods for calculating the membership phase of complex fuzzy complement, ω
C
-
(
x
). For example, ω
C
-
(
x
) is defined as ω
C
-
(
x
)
=
ω
C
(
x
); also ω
C
-
(
x
) may be defined by the relation ω
C
-
(
x
)
=
2
π
-
ω
C
(
x
), where Zhang et al. [22] used this relation to define the complement for the phase component; also the rotation of ω
C
(
x
) by π radians may be a good method to calculate the complement for a phase term as ω
C
-
(
x
)
=
π
+
ω
C
(
x
).Alkouri and Salleh [10, 11] gave the generalization of complex fuzzy set to the complex intuitionistic fuzzy set by adding the nonmembership term to the definition of CFS. The ranges of values are extended to the unit circle in complex plane for both membership and nonmembership functions instead of [
0
,
1
] as in the conventional intuitionistic fuzzy sets.Definition 7 (see [10, 11]).
A complex intuitionistic fuzzy setA
~, defined on a universal set X, is characterized by the membership and nonmembership functions μ
A
~
(
x
) and ν
A
~
(
x
), respectively, which assign to each element x
∈
X a complex-valued grade of membership and nonmembership in A
~.
LetC
I
F
S
(
X
) be the set of all complex intuitionistic fuzzy sets on X. The complex intuitionistic fuzzy set A
~ may be represented as the set of triplets
(12)
A
~
=
x
,
μ
A
~
x
,
ν
A
~
x
:
x
∈
X
,
where μ
A
~
(
x
)
:
X
→
{
a
∣
a
∈
C
,
|
a
|
≤
1
} and ν
A
~
(
x
)
:
X
→
{
a
′
∣
a
′
∈
C
,
|
a
′
|
≤
1
}.By definition, the values ofμ
A
~
(
x
), ν
A
~
(
x
) and their sum all are lying within the unit circle in the complex plane and are of the form μ
A
~
(
x
)
=
r
A
~
(
x
)
·
e
i
ω
A
~
r
(
x
) and ν
A
~
(
x
)
=
k
A
~
(
x
)
·
e
i
ω
A
~
k
(
x
)
(
i
=
-
1
); r
A
~
(
x
), k
A
~
(
x
) are real valued functions such that r
A
~
(
x
)
,
k
A
~
(
x
)
∈
[
0
,
1
] and satisfies the condition 0
≤
r
A
~
(
x
)
+
k
A
~
(
x
)
≤
1. The phase terms ω
A
~
r
(
x
) and ω
A
~
s
(
x
) belong to (
0
,
2
π
].


## 3. Complex Intuitionistic Fuzzy Soft Sets

The concept of soft set theory [12] has been used as a generic mathematical tool for dealing with uncertainty. However, in literature, it has been pointed out that the classical soft sets are not appropriate to deal with imprecise and fuzzy parameters. In order to handle such information, the concept of fuzzy soft sets, intuitionistic fuzzy soft sets, and interval valued fuzzy soft sets have been laid down. In this section, we extend and introduce the concept of complex intuitionistic fuzzy soft set (CIFSS) with some important operations and properties.Definition 8.
LetX be universal set and let E be the set of parameters under consideration. Let C
I
F
S
(
X
) denote the set of all complex intuitionistic fuzzy subset of X. A complex intuitionistic fuzzy soft set (CIFSS) may be represented by the set of ordered pairs as
(13)
F
~
,
E
=
ε
,
F
~
ε
∣
ε
∈
E
,
F
~
ε
∈
C
I
F
S
X
,
where F
~
:
E
→
C
I
F
S
(
X
) such that F
~
(
ε
)
=
ϕ (i
.
e
.
,
μ
F
~
(
ε
)
(
x
)
=
0 and ν
F
~
(
ε
)
(
x
)
=
1 for all x
∈
X), if ε
∉
E.Definition 9.
Suppose that〈
F
~
,
E
〉 and 〈
G
~
,
E
〉 are two CIFSSs over the universal set X. Then in view of the above definition, one defines the following operations as follows. (
P
1
)
〈
F
~
,
E
〉
∪
〈
G
~
,
E
〉
=
〈
H
~
,
E
〉, where ∀
x
∈
X, ε
∈
E,
(14)
H
~
(
ε
)
=

x
,
μ
F
~
ε
x
⋄
μ
G
~
ε
x
,
ν
F
~
ε
x
*
ν
G
~
ε
x
∣
x
∈
X
.
(
P
2
)
〈
F
~
,
E
〉
∩
〈
G
~
,
E
〉
=
〈
H
~
,
E
〉, where ∀
x
∈
X
,
ε
∈
E,
(15)
H
~
(
ε
)
=
x
,
μ
F
~
ε
x
*
μ
G
~
ε
x
,
ν
F
~
ε
x
⋄
ν
G
~
ε
x
∣
x
∈
X
.
(
P
3
)
(
F
~
,
E
)
c
=
(
F
~
c
,
¬
E
), where F
~
c
:
¬
E
→
I
F
S
(
X
) is mapping given by
(16)
F
~
c
¬
ε
=
x
,
ν
F
~
¬
¬
ε
x
,
μ
F
~
¬
¬
ε
x
∣
x
∈
X
=
x
,
ν
F
~
ε
x
,
μ
F
~
ε
x
∣
x
∈
X
,
∀
¬
ε
∈
¬
E
.
(
P
4
)
〈
F
~
,
E
〉
⊆
〈
G
~
,
E
〉, if and only if μ
F
~
(
ε
)
(
x
)
≤
μ
G
~
(
ε
)
(
x
) and ν
F
~
(
ε
)
(
x
)
≥
ν
G
~
(
ε
)
(
x
), ∀
x
∈
X and ε
∈
E.
(
P
5
)
〈
F
~
,
E
〉
=
〈
G
~
,
E
〉, if and only if μ
F
~
(
ε
)
(
x
)
=
μ
G
~
(
ε
)
(
x
) and ν
F
~
(
ε
)
(
x
)
=
ν
G
~
(
ε
)
(
x
), ∀
x
∈
X and ε
∈
E.In order to propose the intuitionistic entropy of complex intuitionistic fuzzy soft sets, we need to introduce some important properties of complex intuitionistic fuzzy soft sets.Definition 10.
LetE be the set of parameters and suppose that 〈
F
~
,
E
〉 and 〈
G
~
,
E
〉 are two complex intuitionistic fuzzy soft sets over the universal set X, and then one says that 〈
G
~
,
E
〉 is a sharpened version of 〈
F
~
,
E
〉; that is, 〈
F
~
,
E
〉
⪯
〈
G
~
,
E
〉 if and only if μ
F
~
(
ε
)
(
x
)
≤
μ
G
~
(
ε
)
(
x
) and ν
F
~
(
ε
)
(
x
)
≤
ν
G
~
(
ε
)
(
x
) (i.e., r
F
~
(
ε
)
(
x
)
≤
r
G
~
(
ε
)
(
x
) and k
F
~
(
ε
)
(
x
)
≤
k
G
~
(
ε
)
(
x
), for the amplitude terms and for the phase terms ω
F
~
(
ε
)
r
(
x
)
≤
ω
G
~
(
ε
)
r
(
x
) and ω
F
~
(
ε
)
k
(
x
)
≤
ω
G
~
(
ε
)
k
(
x
)), ∀
x
∈
X and ∀
ε
∈
E.Definition 11.
To every elementf
∈
{
c
∣
c
∈
C
,
|
c
|
≤
1
}
{
a
∣
a
∈
C
,
|
a
|
≤
1
}
×
{
b
∣
b
∈
C
,
|
b
|
≤
1
} one can associate a mapping f
α of C
I
F
S
S
(
X
), in C
F
S
S
(
X
), with α
∈
[
0
,
1
], given by f
α
:
〈
F
~
,
E
〉
→
〈
F
α
,
E
〉, where F
α is defined as follows.
LetF
~
(
ε
)
=
{
〈
x
,
μ
F
~
(
ε
)
,
ν
F
~
(
ε
)
〉
∣
x
∈
X
}, and
(17)
F
α
ε
=
f
α
(
F
~
(
ε
)
)
=
f
α
{
〈
x
,
μ
F
~
(
ε
)
(
x
)
,
ν
F
~
(
ε
)
(
x
)
〉
∣
x
∈
X
}
=
x
,
μ
F
ε
(
x
)
e
i
2
π
ω
F
(
ε
)
r
(
x
)
=
r
F
(
ε
)
(
x
)
·
e
i
2
π
ω
F
(
ε
)
r
(
x
)
∣
x
∈
X
,
∀
ε
∈
E
,
where
(18)
r
F
(
ε
)
(
x
)
=
r
F
~
(
ε
)
(
x
)
+
α
·
1
-
r
F
~
(
ε
)
(
x
)
-
k
F
~
(
ε
)
(
x
)
ω
F
(
ε
)
r
(
x
)
=
ω
F
~
(
ε
)
r
(
x
)
2
π
+
α
·
1
-
ω
F
~
(
ε
)
r
(
x
)
+
ω
F
~
(
ε
)
k
(
x
)
2
π
.The proposed operatorf
α defined in Definition 11 is to assign a complex intuitionistic fuzzy soft set to a complex fuzzy soft set. The following theorem provides the properties of the operator f
α.Theorem 12.
For allα
,
β
∈
[
0
,
1
], ξ
,
ξ
~
∈
C
I
F
S
S
(
X
), one has the following properties: (1)
ifα
≤
β, then f
α
(
ξ
)
⊆
f
β
(
ξ
);
(2)
ifξ
⊆
ξ
~, then f
α
(
ξ
)
⊆
f
α
(
ξ
~
);
(3)
f
α
f
β
(
ξ
)
=
f
β
(
ξ
);
(4)
(
f
α
(
ξ
c
)
)
c
=
f
1
-
α
(
ξ
).Proof.
Letξ
=
〈
F
~
,
E
〉
=
[
a
i
j
]
m
×
n and ξ
~
=
〈
G
~
,
E
〉
=
[
b
i
j
]
m
×
n be two complex intuitionistic fuzzy soft sets. Let f
α
〈
F
~
,
E
〉
=
〈
F
α
,
E
〉, where F
~
(
ε
)
=
{
〈
x
,
μ
F
~
(
ε
)
,
ν
F
~
(
ε
)
〉
∣
x
∈
X
}, and
(19)
F
α
ε
=
f
α
(
F
~
(
ε
)
)
=
f
α
x
,
μ
F
~
ε
x
,
ν
F
~
ε
x
∣
x
∈
X
=
x
,
r
F
α
ε
x
·
e
i
2
π
ω
F
α
ε
r
x
∣
x
∈
X
,
∀
ε
∈
E
.
Here
(20)
r
F
α
(
ε
)
(
x
)
=
r
F
~
(
ε
)
(
x
)
+
α
·
1
-
r
F
~
(
ε
)
(
x
)
-
k
F
~
(
ε
)
(
x
)
;
ω
F
α
(
ε
)
r
(
x
)
=
ω
F
~
(
ε
)
r
(
x
)
2
π
+
α
·
1
-
ω
F
~
(
ε
)
r
(
x
)
+
ω
F
~
(
ε
)
k
(
x
)
2
π
.
Let f
β
〈
F
~
,
E
〉
=
〈
F
β
,
E
〉, where F
~
(
ε
)
=
{
〈
x
,
μ
F
~
(
ε
)
,
ν
F
~
(
ε
)
〉
∣
x
∈
X
}, and
(21)
F
β
(
ε
)
=
f
β
(
F
~
(
ε
)
)
=
f
β
x
,
μ
F
~
ε
x
,
ν
F
~
ε
x
∣
x
∈
X
=
x
,
r
F
β
ε
x
·
e
i
2
π
ω
F
β
ε
r
x
∣
x
∈
X
,
∀
ε
∈
E
.
Here
(22)
r
F
β
(
ε
)
(
x
)
=
r
F
~
(
ε
)
(
x
)
+
β
·
1
-
r
F
~
(
ε
)
(
x
)
-
k
F
~
(
ε
)
(
x
)
;
ω
F
β
(
ε
)
r
(
x
)
=
ω
F
~
(
ε
)
r
(
x
)
2
π
+
β
·
1
-
ω
F
~
(
ε
)
r
(
x
)
+
ω
F
~
(
ε
)
k
(
x
)
2
π
.
(1)
In the following, we have to prove thatμ
F
α
(
ε
)
(
x
)
≤
μ
F
β
(
ε
)
(
x
); that is, r
F
α
(
ε
)
(
x
)
≤
r
F
β
(
ε
)
(
x
) and ω
F
α
(
ε
)
r
(
x
)
≤
ω
F
β
(
ε
)
r
(
x
), ∀
x
∈
X and ε
∈
E. Since α
≤
β, therefore, we have r
F
α
(
ε
)
(
x
)
≤
r
F
β
(
ε
)
(
x
) and ω
F
α
(
ε
)
r
(
x
)
≤
ω
F
β
(
ε
)
r
(
x
), ⇒
μ
F
α
(
ε
)
(
x
)
≤
μ
F
β
(
ε
)
(
x
), ∀
x
∈
X and ε
∈
E.
Hence,f
α
(
ξ
)
⊆
f
β
(
ξ
).
(2)
Letf
α
(
ξ
~
)
=
f
α
〈
G
~
,
E
〉
=
〈
G
α
,
E
〉, where G
~
(
ε
)
=
{
〈
x
,
μ
G
~
(
ε
)
,
ν
G
~
(
ε
)
〉
∣
x
∈
X
}
,
(23)
G
α
ε
=
f
α
(
G
~
(
ε
)
)
=
f
α
x
,
μ
G
~
ε
x
,
ν
G
~
ε
x
∣
x
∈
X
=
x
,
μ
G
α
ε
x
e
i
2
π
ω
G
α
ε
r
x
=
r
G
α
ε
x
·
e
i
2
π
ω
G
α
ε
r
x
∣
x
∈
X
,
∀
ε
∈
E
.
Here(24)
r
G
α
(
ε
)
(
x
)
=
r
G
~
(
ε
)
(
x
)
+
α
·
1
-
r
G
~
(
ε
)
(
x
)
-
k
G
~
(
ε
)
(
x
)
ω
G
α
(
ε
)
r
(
x
)
=
ω
G
~
(
ε
)
r
(
x
)
2
π
+
α
·
1
-
ω
G
~
(
ε
)
r
(
x
)
+
ω
G
~
(
ε
)
k
(
x
)
2
π
.
In the following, we have to prove thatμ
F
α
(
ε
)
(
x
)
≤
μ
G
α
(
ε
)
(
x
); that is, r
F
α
(
ε
)
(
x
)
≤
r
G
α
(
ε
)
(
x
) and ω
F
α
(
ε
)
r
(
x
)
≤
ω
G
α
(
ε
)
r
(
x
), ∀
x
∈
X and ε
∈
E. Since ξ
⊆
ξ
~, therefore μ
F
~
(
ε
)
(
x
)
≤
μ
G
~
(
ε
)
(
x
) and ν
F
~
(
ε
)
(
x
)
≥
ν
G
~
(
ε
)
(
x
); that is, r
F
~
(
ε
)
(
x
)
≤
r
G
~
(
ε
)
(
x
) and k
F
~
(
ε
)
(
x
)
≥
k
G
~
(
ε
)
(
x
), for the amplitude terms and for the phase terms ω
F
~
(
ε
)
r
(
x
)
≤
ω
G
~
(
ε
)
r
(
x
) and ω
F
~
(
ε
)
k
(
x
)
≥
ω
G
~
(
ε
)
k
(
x
), ∀
x
∈
X and ε
∈
E. Thus, (
1
-
α
)
·
r
F
~
(
ε
)
(
x
)
≤
(
1
-
α
)
·
r
G
~
(
ε
)
(
x
), α
·
k
F
~
(
ε
)
(
x
)
≥
α
·
k
G
~
(
ε
)
(
x
), and (
1
-
α
)
/
2
π
·
ω
F
~
ε
r
x
≤
1
-
α
/
2
π
·
ω
G
~
ε
r
x, α
/
2
π
·
ω
F
~
ε
k
x
≥
α
/
2
π
·
ω
G
~
ε
k
x,
which impliesα
+
(
1
-
α
)
·
r
F
~
(
ε
)
(
x
)
-
α
·
k
G
~
(
ε
)
(
x
)
≤
α
+
(
1
-
α
)
·
r
G
~
(
ε
)
(
x
)
-
α
·
k
F
~
(
ε
)
(
x
) and
(25)
α
+
(
1
-
α
)
2
π
·
ω
F
~
(
ε
)
r
(
x
)
-
α
2
π
·
ω
G
~
(
ε
)
k
(
x
)
≤
α
+
(
1
-
α
)
2
π
·
ω
G
~
(
ε
)
r
(
x
)
-
α
2
π
·
ω
F
~
(
ε
)
k
(
x
)
,
⇒
r
F
α
(
ε
)
(
x
)
≤
r
G
α
(
ε
)
(
x
) and ω
F
α
(
ε
)
r
(
x
)
≤
ω
G
α
(
ε
)
r
(
x
). Thus, we have μ
F
α
(
ε
)
(
x
)
≤
μ
G
α
(
ε
)
(
x
).
Hence,f
α
(
ξ
)
⊆
f
α
(
ξ
~
).
(3)
f
α
f
β
(
ξ
)
=
f
α
(
〈
F
β
,
E
〉
)
=
〈
(
F
β
)
α
,
E
〉, where (
F
β
)
α
(
ε
)
=
f
α
(
F
β
(
ε
)
)
=
f
α
(
f
β
(
F
~
(
ε
)
)
), ∀
ε
∈
E.
Next, we have to prove thatf
α
(
f
β
(
F
~
(
ε
)
)
)
=
(
f
β
(
F
~
(
ε
)
). We have
(26)
f
β
F
~
ε
=
f
β
x
,
μ
F
~
ε
x
,
ν
F
~
ε
x
∣
x
∈
X
=
x
,
r
F
β
ε
x
·
e
i
2
π
ω
F
β
ε
r
x
∣
x
∈
X
,
∀
ε
∈
E
.
Here(27)
r
F
β
(
ε
)
(
x
)
=
r
F
~
(
ε
)
(
x
)
+
β
·
1
-
r
F
~
(
ε
)
(
x
)
-
k
F
~
(
ε
)
(
x
)
ω
F
β
(
ε
)
r
(
x
)
=
ω
F
~
(
ε
)
r
(
x
)
2
π
+
β
·
1
-
ω
F
~
(
ε
)
r
(
x
)
+
ω
F
~
(
ε
)
k
(
x
)
2
π
.
Thus(28)
f
α
f
β
F
~
ε
=
f
α
x
,
r
F
β
ε
x
·
e
i
2
π
ω
F
β
ε
r
x
∣
x
∈
X
=
x
,
r
F
β
ε
x
·
e
i
2
π
ω
F
β
ε
r
x
∣
x
∈
X
,
∀
ε
∈
E
.
From (26) and (28), we have f
α
f
β
(
ξ
)
=
f
β
(
ξ
).
(4)
Letξ
c
=
〈
F
~
,
E
〉
c
=
〈
F
~
c
,
¬
E
〉, where F
~
c
(
ε
)
=
{
〈
x
,
ν
F
~
(
¬
ε
)
(
x
)
,
μ
F
~
(
¬
ε
)
(
x
)
〉
∣
x
∈
X
}, ∀
ε
∈
E.
Then we havef
α
(
ξ
c
)
=
f
α
(
〈
F
~
c
,
¬
E
〉
)
=
〈
(
F
c
)
α
,
¬
E
〉, where
(29)
F
c
α
ε
=
f
α
(
F
~
c
(
ε
)
)
=
f
α
x
,
ν
F
~
¬
ε
x
,
μ
F
~
¬
ε
x
∣
x
∈
X
=
x
,
1
-
r
F
α
¬
ε
x
e
i
2
π
ω
-
F
α
¬
ε
r
x
·
e
i
2
π
ω
-
F
α
¬
ε
r
x
∣
x
∈
X
,
∀
ε
∈
¬
E
.
Here(30)
1
-
r
F
α
(
¬
ε
)
(
x
)
=
k
F
~
(
¬
ε
)
(
x
)
+
α
·
1
-
r
F
~
(
¬
ε
)
(
x
)
-
k
F
~
(
¬
ε
)
(
x
)
ω
-
F
α
(
¬
ε
)
r
(
x
)
=
ω
F
~
(
¬
ε
)
k
(
x
)
2
π
+
α
·
1
-
ω
F
~
(
¬
ε
)
r
(
x
)
+
ω
F
~
(
¬
ε
)
k
(
x
)
2
π
.
Thus, we have(
f
α
(
ξ
c
)
)
c
=
〈
(
F
c
)
α
,
¬
E
〉
c
=
〈
(
(
F
c
)
α
)
c
,
¬
¬
E
〉
=
〈
(
(
F
c
)
α
)
c
,
E
〉, ∀
ε
∈
E. Consider
(31)
F
c
α
c
(
ε
)
=
x
,
1
-
r
F
α
¬
ε
x
·
e
i
2
π
ω
-
F
α
¬
ε
r
x
∣
x
∈
X
c
=
x
,
r
F
α
¬
¬
ε
x
·
e
i
2
π
ω
F
α
¬
¬
ε
r
x
∣
x
∈
X
,
∀
ε
∈
¬
¬
E
,
=
x
,
r
F
α
ε
x
·
e
i
2
π
ω
F
α
ε
r
x
∣
x
∈
X
,
∀
ε
∈
E
.
Here(32)
r
F
α
(
ε
)
(
x
)
=
1
-
k
F
~
(
ε
)
(
x
)
-
α
·
1
-
r
F
~
(
ε
)
(
x
)
-
k
F
~
(
ε
)
(
x
)
;
ω
F
α
(
ε
)
r
(
x
)
=

1
-
ω
F
~
(
ε
)
k
(
x
)
2
π
+
α
·
1
-
ω
F
~
(
ε
)
r
(
x
)
+
ω
F
~
(
ε
)
k
(
x
)
2
π
.
Sincef
1
-
α
(
ξ
)
=
f
1
-
α
(
〈
F
~
,
E
〉
)
=
〈
F
1
-
α
,
E
〉, where
(33)
F
1
-
α
ε
=
f
1
-
α
(
F
~
(
ε
)
)
=
f
1
-
α
x
,
μ
F
~
ε
x
,
ν
F
~
ε
x
∣
x
∈
X
=
x
,
r
F
1
-
α
ε
x
·
e
i
ω
F
1
-
α
ε
r
x
∣
x
∈
X
,
∀
ε
∈
E
,
Here(34)
r
F
1
-
α
(
ε
)
(
x
)
=
1
-
k
F
~
(
ε
)
(
x
)
-
α
·
1
-
r
F
~
(
ε
)
(
x
)
-
k
F
~
(
ε
)
(
x
)
ω
F
1
-
α
(
ε
)
r
(
x
)
=
ω
F
~
(
ε
)
r
(
x
)
2
π
+
ω
F
~
(
ε
)
k
(
x
)
2
π
+
(
1
-
α
)
·
1
-
ω
F
~
(
ε
)
r
(
x
)
+
ω
F
~
(
ε
)
k
(
x
)
2
π
=
1
-
ω
F
~
(
ε
)
k
(
x
)
2
π
+
α
·
1
-
ω
F
~
(
ε
)
r
(
x
)
+
ω
F
~
(
ε
)
k
(
x
)
2
π
.
Thus,(
(
F
c
)
α
)
c
(
ε
)
=
F
1
-
α
(
ε
). Consequently, (
f
α
(
ξ
c
)
)
c
=
f
1
-
α
(
ξ
).


## 4. Distance Measures and Entropies of Complex Intuitionistic Fuzzy Soft Set

Based on various well-known distance functions, we introduce some distance measures between complex intuitionistic fuzzy soft sets and propose a general way to find the entropies of complex intuitionistic fuzzy soft set. We also give the structure of intuitionistic entropy of complex intuitionistic fuzzy soft sets by extending the structure of intuitionistic entropy on intuitionistic fuzzy soft sets [21].


### 4.1. Distance Measures between Complex Intuitionistic Fuzzy Soft Sets

The axiomatic definition of the distance measure between complex intuitionistic fuzzy soft sets has been reframed and proposed as follows.Definition 13.
Suppose thatξ
=
〈
F
~
,
E
〉 and ξ
~
=
〈
G
~
,
E
〉 are two complex intuitionistic fuzzy soft sets over the universal set X. A real valued nonnegative function
(35)
d
:
C
I
F
S
S
(
X
)
×
C
I
F
S
S
(
X
)
⟶
0
,
1
is called distance measure C
I
F
S
S
(
X
), if d satisfies the following properties: (P1)
0
≤
d
(
ξ
,
ξ
~
)
≤
1;
(P2)
d
(
ξ
,
ξ
~
)
=
d
(
ξ
~
,
ξ
);
(P3)
d
(
ξ
,
ξ
~
)
=
0 if and only if ξ
=
ξ
~;
(P4)
for anyη
=
〈
H
~
,
E
〉
=
[
c
i
j
]
m
×
n
∈
C
I
F
S
S
(
X
), d
(
ξ
,
ξ
~
)
+
d
(
ξ
~
,
η
)
≥
d
(
ξ
,
η
).We extend and propose various distance measures for two CIFSSs as follows.(i)
Hamming distance:(36)
d
h
ξ
,
ξ
~
=
1
4
∑
j
=
1
n
‍
∑
i
=
1
m
‍
r
F
~
ε
j
x
i
-
r
G
~
ε
j
x
i
+
k
F
~
ε
j
x
i
-
k
G
~
ε
j
x
i
+
1
2
π
ω
F
~
ε
j
r
x
i
-
ω
G
~
ε
j
r
x
i
+
ω
F
~
ε
j
k
x
i
-
ω
G
~
ε
j
k
x
i
.
(ii)
Normalized Hamming distance:(37)
d
h
n
ξ
,
ξ
~
=
1
4
m
n
∑
j
=
1
n
‍
∑
i
=
1
m
r
F
~
ε
j
x
i
-
r
G
~
ε
j
x
i
ω
F
~
k
ω
G
~
k
‍
+
k
F
~
ε
j
x
i
-
k
G
~
ε
j
x
i
+
1
2
π
ω
F
~
ε
j
r
x
i
-
ω
G
~
ε
j
r
x
i
+
ω
F
~
ε
j
k
x
i

-

ω
G
~
ε
j
k
x
i
.
(iii)
Euclidean distance:(38)
d
e
n
ξ
,
ξ
~
2
=
1
4
∑
j
=
1
n
‍
∑
i
=
1
m
‍
r
F
~
e
j
x
i
-
r
G
~
ε
j
x
i
2
+
k
F
~
ε
j
x
i
-
k
G
~
ε
j
x
i
2
+
1
4
π
2
ω
F
~
ε
j
r
x
i
-
ω
G
~
ε
j
r
x
i
2
+
ω
F
~
ε
j
k
x
i
-
ω
G
~
ε
j
k
x
i
2
.
(iv)
Normalized Euclidean distance:(39)
d
e
n
ξ
,
ξ
~
2
=
1
4
m
n
∑
j
=
1
n
‍
∑
i
=
1
m
‍
r
F
~
e
j
x
i
-
r
G
~
ε
j
x
i
2
+
k
F
~
ε
j
x
i
-
k
G
~
ε
j
x
i
2
+
1
4
π
2
ω
F
~
ε
j
r
x
i
-
ω
G
~
ε
j
r
x
i
2
+
ω
F
~
ε
j
k
x
i
-
ω
G
~
ε
j
k
x
i
2
.


### 4.2. Entropies on Complex Intuitionistic Fuzzy Soft Sets

Here, we present the axiomatic definition for the entropy of complex intuitionistic fuzzy soft sets. The following conditions give the intuitive idea for the degree of fuzziness of a complex intuitionistic fuzzy soft set, that is, for the entropy of a complex intuitionistic fuzzy soft set.(i)
It will be null when the complex intuitionistic fuzzy soft set is a complex fuzzy soft set.
(ii)
It will be maximum if the complex intuitionistic fuzzy soft set is completely intuitionistic.
(iii)
An intuitionistic entropy of a complex intuitionistic fuzzy soft set will be equal to its complement.
(iv)
If the degree of membership and the degree of nonmembership of each element increase, the sum will do so as well, and therefore this complex intuitionistic fuzzy soft set becomes less fuzzy, and therefore the entropy should decrease.In view of the above-stated points and the definition of entropy for an intuitionistic fuzzy soft set given in [21], we propose the following definition for the entropy of a complex intuitionistic fuzzy soft set.Definition 14.
A real valued functionH
:
C
I
F
S
S
→
R
+ is called an intuitionistic entropy on C
I
F
S
S
(
X
), if H has the following properties: (i)
P1 (sharpness): H
(
ξ
)
=
0 if and only if ξ is a complex fuzzy soft set;
(ii)
P2 (maximality): let ξ
=
〈
F
~
,
E
〉
=
[
a
i
j
]
m
×
n, H
(
ξ
)
=
m
n if and only if μ
F
~
(
ε
)
(
x
)
=
ν
F
~
(
ε
)
(
x
)
=
0, ∀
x
∈
X and ε
∈
E;
(iii)
P3 (symmetry): H
(
ξ
)
=
H
(
ξ
c
), for all ξ
∈
C
I
F
S
S
(
X
);
(iv)
P4 (resolution): if ξ
* is sharpened version of ξ, that is, if ξ
⪯
ξ
*, then H
(
ξ
)
≥
H
(
ξ
*
).Similar to the entropy of an intuitionistic fuzzy soft set [21], we deduce the following property from the property P2 of Definition 14.Theorem 15.
H
(
ξ
) is maximum if and only if ξ
=
〈
F
~
,
E
〉
=
[
a
i
j
]
m
×
n
=
[
0
]
m
×
n; that is, a
i
j
=
μ
F
~
(
ε
j
)
(
x
i
)
=
ν
F
~
(
ε
j
)
(
x
i
)
=
0, ∀
ε
j
∈
E, x
i
∈
X, where 0
≤
i
≤
m and 0
≤
j
≤
n.Proof.
Consider the following.
Necessary Part. Let ξ
=
〈
F
~
,
E
〉
=
[
a
i
j
]
m
×
n
=
[
0
]
m
×
n. Let ξ
~
=
〈
G
~
,
E
〉 be any complex intuitionistic fuzzy soft set. Since μ
G
~
(
ε
j
)
(
x
i
)
≥
0 and ν
G
~
(
ε
j
)
(
x
i
)
≥
0, ∀
ε
j
∈
E, x
i
∈
X, where 0
≤
i
≤
m and 0
≤
j
≤
n, therefore, by Definition 10, we have ξ
⪯
ξ
~. Thus, H
(
ξ
)
≥
H
(
ξ
~
) by property P4 of Definition 14 for all ξ
~, and then H
(
ξ
) is maximum.
Sufficient Part. Let H
(
ξ
) is maximum. We assume that ξ
=
〈
F
~
,
E
〉
=
[
a
i
j
]
m
×
n
≠
[
0
]
m
×
n, and then there is a ε
j
∈
E and x
i
∈
X such that μ
F
~
(
ε
j
)
(
x
i
)
≠
0 and ν
F
~
(
ε
j
)
(
x
i
)
≠
0, where 0
≤
i
≤
m and 0
≤
j
≤
n. We construct the following complex intuitionistic fuzzy soft set: ξ
~
=
〈
G
~
,
E
〉 with μ
G
~
(
ε
j
)
(
x
i
)
=
1
/
2
μ
F
~
(
ε
j
)
(
x
i
) and ν
G
~
(
ε
j
)
(
x
i
)
=
1
/
3
ν
F
~
(
ε
j
)
(
x
i
) for all ε
j
∈
E and x
i
∈
X, and then by Definition 10 we have H
(
ξ
~
)
≥
H
(
ξ
) which contradicts the fact that hypothesis H
(
ξ
) is maximum. Therefore, ξ
=
[
0
]
m
×
n.Let us take the following setD
=
{
(
x
,
y
)
∈
[
0
,
1
]
×
[
0
,
1
]
∣
x
+
y
≤
1
} and with it let us construct ψ
D
:
D
→
[
0
,
1
], which satisfies the following conditions:(1)
ψ
D
(
x
,
y
)
=
1 if and only if x
+
y
=
1;
(2)
ψ
D
(
x
,
y
)
=
0 if and only if x
=
0
=
y;
(3)
ψ
D
(
x
,
y
)
=
ψ
D
(
y
,
x
);
(4)
ifx
≤
x
′ and y
≤
y
′, then ψ
D
(
x
,
y
)
≤
ψ
D
(
x
′
,
y
′
).Theorem 16.
Letξ
=
〈
F
~
,
E
〉
=
[
a
i
j
]
m
×
n
∈
C
I
F
S
S
(
X
) and H
:
C
I
F
S
S
(
X
)
→
R
+ such that
(40)
H
ξ
=
1
2
∑
j
=
1
n
‍
∑
i
=
1
m
‍
1
-
ψ
r
F
~
ε
j
x
i
,
k
F
~
ε
j
x
i
,
ω
F
~
ε
j
k
x
i
2
π
+
1
-
ψ
ω
F
~
ε
j
r
x
i
2
π
,
ω
F
~
ε
j
k
x
i
2
π
,
where ψ satisfies conditions (1)–(4); then H is an intuitionistic entropy on C
I
F
S
S
(
X
).Proof.
(1)H
(
ξ
)
=
0 if and only if, for all ε
j
∈
E, x
i
∈
X,
(41)
1
2
∑
j
=
1
n
‍
∑
i
=
1
m
‍
1
-
ψ
(
r
F
~
(
ε
j
)
(
x
i
)
,
k
F
~
(
ε
j
)
(
x
i
)
)
ω
F
~
ε
j
k
x
i
2
π
+
1
-
ψ
ω
F
~
ε
j
r
x
i
2
π
,
ω
F
~
ε
j
k
x
i
2
π
=
0
,
⟺
ψ
r
F
~
ε
j
x
i
,
k
F
~
ε
j
x
i
=
1
,
ψ
ω
F
~
ε
j
r
x
i
2
π
,
ω
F
~
ε
j
k
x
i
2
π
=
1
,
⟺
r
F
~
ε
j
(
x
i
)
+
k
F
~
ε
j
(
x
i
)
=
1
,
ω
F
~
ε
j
r
(
x
i
)
+
ω
F
~
ε
j
k
(
x
i
)
=
2
π
,
⟺
ξ
∈
C
F
S
S
(
X
)
.
Thus,H satisfies property P1 of Definition 14.
(2)H
(
ξ
)
=
m
n if and only if, for all ε
j
∈
E, x
i
∈
X,
(42)
1
2
∑
j
=
1
n
‍
∑
i
=
1
m
‍
1
-
ψ
(
r
F
~
(
ε
j
)
(
x
i
)
,
k
F
~
(
ε
j
)
(
x
i
)
)
ω
F
~
ε
j
k
x
i
2
π
+
1
-
ψ
ω
F
~
ε
j
r
x
i
2
π
,
ω
F
~
ε
j
k
x
i
2
π
=
m
n
,
⟺
r
F
~
ε
j
x
i
+
k
F
~
ε
j
x
i
=
0
,
ω
F
~
(
ε
j
)
r
(
x
i
)
+
ω
F
~
(
ε
j
)
k
(
x
i
)
=
0
,
⟺
r
F
~
ε
j
x
i
,
k
F
~
ε
j
x
i
=
0
,
ω
F
~
(
ε
j
)
r
(
x
i
)
,
ω
F
~
(
ε
j
)
k
(
x
i
)
=
0
,
which implies ξ is completely intuitionistic. Thus, H satisfies property P2 of Definition 14.
(3) Sinceξ
c
=
〈
F
~
,
E
〉
c
=
〈
F
~
c
,
¬
E
〉, where F
~
c
=
{
〈
x
i
,
ν
F
~
(
ε
)
(
x
i
)
,
μ
F
~
(
ε
)
(
x
i
)
〉
∣
x
i
∈
X
}, ∀
¬
ε
∈
¬
E, then
(43)
H
ξ
=
1
2
∑
j
=
1
n
‍
∑
i
=
1
m
‍
1
-
ψ
(
r
F
~
(
ε
j
)
(
x
i
)
,
k
F
~
(
ε
j
)
(
x
i
)
)
ω
F
~
ε
j
k
x
i
2
π
+
1
-
ψ
ω
F
~
ε
j
r
x
i
2
π
,
ω
F
~
ε
j
k
x
i
2
π
=
1
2
∑
j
=
1
n
‍
∑
i
=
1
m
‍
1
-
ψ
k
F
~
ε
j
x
i
,
r
F
~
ε
j
x
i
ω
F
~
ε
j
r
x
i
2
π
+
1
-
ψ
ω
F
~
ε
j
k
x
i
2
π
,
ω
F
~
ε
j
r
x
i
2
π
=
H
(
ξ
c
)
.
Thus,H satisfies property P3 of Definition 14.
(4) Letξ
~
=
〈
F
~
,
E
〉
=
[
b
i
j
]
m
×
n, and if ξ
≤
ξ
~, then we have r
F
~
(
ε
j
)
(
x
i
)
≤
r
G
~
(
ε
j
)
(
x
i
) and k
F
~
(
ε
j
)
(
x
i
)
≤
k
G
~
(
ε
j
)
(
x
i
), for the amplitude terms and for the phase terms ω
F
~
(
ε
j
)
r
(
x
i
)
≤
ω
G
~
(
ε
j
)
r
(
x
i
) and ω
F
~
(
ε
j
)
k
(
x
i
)
≤
ω
G
~
(
ε
j
)
k
(
x
i
), ∀
x
i
∈
X and ∀
ε
j
∈
E.
Thus, we have(44)
ψ
r
F
~
ε
j
x
i
,
k
F
~
ε
j
x
i
≤
ψ
r
G
~
ε
j
x
i
,
k
G
~
ε
j
x
i
ψ
ω
F
~
ε
j
r
x
i
2
π
,
ω
F
~
ε
j
k
x
i
2
π
≤
ψ
ω
G
~
ε
j
r
x
i
2
π
,
ω
G
~
ε
j
k
x
i
2
π
⟹
1
-
ψ
(
r
F
~
(
ε
j
)
(
x
i
)
,
k
F
~
(
ε
j
)
(
x
i
)
)
≥
1
-
ψ
r
G
~
ε
j
x
i
,
k
G
~
ε
j
x
i
,
1
-
ψ
ω
F
~
ε
j
r
x
i
2
π
,
ω
F
~
ε
j
k
x
i
2
π
≥
1
-
ψ
ω
G
~
ε
j
r
x
i
2
π
,
ω
G
~
ε
j
k
x
i
2
π
⟹
H
ξ
~
≤
H
ξ
.
Thus,H satisfies property P4 of Definition 14.
Therefore,H is an intuitionistic entropy of complex intuitionistic fuzzy soft set.Burillo and Bustince [23] gave some expressions for intuitionistic entropy of intuitionistic fuzzy soft sets. Jiang et al. [21] extended these expressions for intuitionistic entropy of intuitionistic fuzzy soft sets. On similar pattern, we are extending these expressions for intuitionistic entropy of complex intuitionistic fuzzy soft sets.Letξ
=
〈
F
~
,
E
〉
=
[
a
i
j
]
m
×
n
∈
C
I
F
S
S
(
X
). It is easy to verify that the following expressions are the intuitionistic entropies of ξ:
(45)
H
1
ξ
=
1
2
∑
j
=
1
n
‍
∑
i
=
1
m
‍
1
-
(
r
F
~
(
ε
j
)
(
x
i
)
+
k
F
~
(
ε
j
)
(
x
i
)
)
+
ω
F
~
ε
j
k
x
i
2
π
+
1
-
ω
F
~
ε
j
r
x
i
+
ω
F
~
ε
j
k
x
i
2
π
;
H
2
ξ
=
1
2
∑
j
=
1
n
‍
∑
i
=
1
m
‍
1
-
r
F
~
ε
j
x
i
+
k
F
~
ε
j
x
i
n
ω
F
~
ε
j
r
x
i
2
π
n
+
1
-
ω
F
~
ε
j
r
x
i
+
ω
F
~
ε
j
k
x
i
2
π
n
,
n
=
2
,
3
,
…
;
H
3
ξ
=
1
2
∑
j
=
1
n
‍
∑
i
=
1
m
‍
1
-
(
r
F
~
(
ε
j
)
(
x
i
)
+
k
F
~
(
ε
j
)
(
x
i
)
)
e
1
-
(
r
F
~
(
ε
j
)
(
x
i
)
+
k
F
~
(
ε
j
)
(
x
i
)
)
ω
F
~
ε
j
r
x
i
+
ω
F
~
ε
j
k
x
i
2
π
·
e
1
-
(
r
F
~
(
ε
j
)
(
x
i
)
+
k
F
~
(
ε
j
)
(
x
i
)
)
,
+
1
-
ω
F
~
ε
j
r
x
i
+
ω
F
~
ε
j
k
x
i
2
π
ω
F
~
ε
j
r
x
i
+
ω
F
~
ε
j
k
x
i
2
π
·
e
1
-
(
ω
F
~
ε
j
r
x
i
+
ω
F
~
ε
j
k
x
i
)
/
2
π
;
H
4
ξ
=
1
2
∑
j
=
1
n
‍
∑
i
=
1
m
‍
1
-
(
r
F
~
ε
j
(
x
i
)
+
k
F
~
ε
j
(
x
i
)
)
π
2
r
F
~
ε
j
+
ω
F
~
ε
j
k
x
i
4
·
sin
⁡
π
2
r
F
~
ε
j
x
i
+
k
F
~
ε
j
x
i
+
1
-
ω
F
~
ε
j
r
x
i
+
ω
F
~
ε
j
k
x
i
2
π
·
sin
⁡
ω
F
~
ε
j
r
x
i
+
ω
F
~
ε
j
k
x
i
4
.In the following definition, we introduce a function fromC
I
F
S
S
(
X
) to R
+, which is an extension of the H
ϕ
,
ϕ
′-function from I
F
S
S
(
X
) to R
+ given in [21], which is also an extension of the H
ϕ
,
ϕ
′-function from F
S
S
(
X
) to R
+ given in [23].Definition 17.
Letϕ
,
ϕ
′
:
[
0
,
1
]
→
[
0
,
1
] be such that if x
+
y
≤
1, then ϕ
(
x
)
+
ϕ
′
(
y
)
≤
1, with x
,
y
∈
[
0
,
1
]. One defines function H
ϕ
,
ϕ
′
(
·
) of the complex intuitionistic fuzzy soft set ξ
=
〈
F
~
,
E
〉
=
[
a
i
j
]
m
×
n
∈
C
I
F
S
S
(
X
) to R
+ as follows:
(46)
H
ϕ
,
ϕ
′
ξ
=
m
n
-
1
2
∑
j
=
1
n
‍
∑
i
=
1
m
‍
ϕ
(
r
F
~
ε
j
(
x
i
)
)
+
ϕ
′
(
k
F
~
(
ε
j
)
(
x
i
)
)
ϕ
′
ω
F
~
ε
j
k
x
i
2
π
+
ϕ
ω
F
~
ε
j
r
x
i
2
π
ϕ
′
ω
F
~
ε
j
k
x
i
2
π
+
ϕ
′
ω
F
~
ε
j
k
x
i
2
π
.
Obviously, 0
≤
H
ϕ
,
ϕ
′
(
ξ
)
≤
m
n for all ξ
=
[
a
i
j
]
m
×
n belonging to C
I
F
S
S
(
X
).Theorem 18.
Letξ
=
〈
F
~
,
F
〉
=
[
a
i
j
]
m
×
n, ξ
~
=
〈
G
~
,
E
〉
=
[
b
i
j
]
m
×
n
∈
C
I
F
S
S
(
X
); then function H
ϕ
,
ϕ
′ satisfies the following property:
(47)
H
ϕ
,
ϕ
′
(
ξ
∪
ξ
~
)
+
H
ϕ
,
ϕ
′
(
ξ
∩
ξ
~
)
=
H
ϕ
,
ϕ
′
(
ξ
)
+
H
ϕ
,
ϕ
′
(
ξ
~
)
.Proof.
By Definition17, we have the following:
(48)
H
ϕ
,
ϕ
′
(
ξ
∪
ξ
~
)
=
m
n
-
1
2
∑
j
=
1
n
‍
∑
i
=
1
m
‍
ϕ
(
r
F
~
(
ε
j
)
(
x
i
)
⋄
r
G
~
(
ε
j
)
(
x
i
)
)
ω
F
~
ε
j
k
x
i
2
π
∩
ω
G
~
ε
j
k
x
i
2
π
+
ϕ
′
k
F
~
ε
j
x
i
*
k
F
~
ε
j
x
i
+
ϕ
ω
F
~
ε
j
r
x
i
2
π
∪
ω
G
~
ε
j
r
x
i
2
π
+
ϕ
′
ω
F
~
ε
j
k
x
i
2
π
∩
ω
G
~
ε
j
k
x
i
2
π
,
H
ϕ
,
ϕ
′
(
ξ
∩
ξ
~
)
=
m
n
-
1
2
∑
j
=
1
n
‍
∑
i
=
1
m
‍
ϕ
(
r
F
~
ε
j
(
x
i
)
*
r
G
~
ε
j
(
x
i
)
)
ω
F
~
ε
j
k
x
i
2
π
∩
ω
G
~
ε
j
k
x
i
2
π
+
ϕ
′
(
k
F
~
(
ε
j
)
(
x
i
)
⋄
k
F
~
(
ε
j
)
(
x
i
)
)
+
ϕ
ω
F
~
ε
j
r
x
i
2
π
∪
ω
G
~
ε
j
r
x
i
2
π
+
ϕ
′
ω
F
~
ε
j
k
x
i
2
π
∩
ω
G
~
ε
j
k
x
i
2
π
.
Thus, we have
(49)
H
ϕ
,
ϕ
′
(
ξ
∪
ξ
~
)
+
H
ϕ
,
ϕ
′
(
ξ
∩
ξ
~
)
=
H
ϕ
,
ϕ
′
(
ξ
)
+
H
ϕ
,
ϕ
′
(
ξ
~
)
.It may be noted that there areH
ϕ
,
ϕ
′-functions which are not intuitionistic entropies; for example,
(50)
H
ϕ
,
ϕ
′
(
ξ
)
=
m
n
-
1
2
∑
j
=
1
n
‍
∑
i
=
1
m
‍
r
F
~
ε
j
x
i
+
k
F
~
ε
j
x
i
1
2
π
+
1
2
π
ω
F
~
ε
j
r
x
i
+
ω
F
~
ε
j
k
x
i
.
On the other hand, it may also be easily verified that there are entropies which are not H
ϕ
,
ϕ
′-functions; for example,
(51)
H
ϕ
,
ϕ
′
(
ξ
)
=
m
n
-
1
2
∑
j
=
1
n
‍
∑
i
=
1
m
r
F
~
ε
j
x
i
+
k
F
~
ε
j
x
i
2
1
2
π
2
‍
+
1
2
π
ω
F
~
ε
j
r
x
i
+
ω
F
~
ε
j
k
x
i
2
.
Also, there are entropies which are also H
ϕ
,
ϕ
′-functions; for example,
(52)
H
ϕ
,
ϕ
′
(
ξ
)
=
m
n
-
1
2
∑
j
=
1
n
‍
∑
i
=
1
m
‍
1
-
r
F
~
(
ε
j
)
(
x
i
)
+
k
F
~
(
ε
j
)
(
x
i
)
1
2
π
ω
F
~
(
ε
j
)
k
(
x
i
)
+
1
-
1
2
π
ω
F
~
ε
j
r
x
i
+
ω
F
~
ε
j
k
x
i
.
Next, we introduce a property which defines entropies in a general way as follows.Theorem 19.
Ifϕ
:
[
0
,
1
]
→
[
0
,
1
] satisfies the following conditions: (1)
ϕ is increasing,
(2)
ϕ
(
x
)
=
0 if and only if x
=
0,
(3)
ϕ
(
x
)
+
ϕ
(
y
)
=
1 if and only if x
+
y
=
1, then ϕ
(
x
)
+
ϕ
(
y
) satisfies conditions (1)–(4) of ψ function defined previously.We denoteH
ϕ
,
ϕ
′-function as H
ϕ
,
ϕ-function if ϕ
=
ϕ
′. The following theorem characterizes the intuitionistic entropy of complex intuitionistic fuzzy soft sets in a general way.Theorem 20.
LetH
:
C
I
F
S
S
→
R
+, ϕ
:
[
0
,
1
]
→
[
0
,
1
], and ξ
=
〈
F
~
,
E
〉
=
[
a
i
j
]
m
×
n
∈
C
I
F
S
S
(
X
). H is an intuitionistic entropy and H
ϕ
,
ϕ-function if and only if
(53)
H
(
ξ
)
=
1
2
∑
j
=
1
n
‍
∑
i
=
1
m
‍
1
-
ϕ
r
F
~
ε
j
x
i
+
ϕ
k
F
~
ε
j
x
i
1
-
ϕ
ω
F
~
ε
j
r
x
i
2
π
+
1
-
ϕ
ω
F
~
ε
j
r
x
i
2
π
ω
F
~
ε
j
k
x
i
2
π
+
ϕ
ω
F
~
ε
j
k
x
i
2
π
,
where ϕ satisfies conditions (1)–(3) of Theorem 19.Based on the definitions and properties stated above, it may be easily verified that there is a kind of correspondence between the proposed entropies and the distance measures of complex intuitionistic fuzzy soft sets, which is as follows.Theorem 21.
Letξ
=
〈
F
~
,
E
〉
=
[
a
i
j
]
m
×
n
∈
C
I
F
S
S
(
X
) and f
α
(
ξ
)
=
{
ξ
α
}
α
∈
[
0
,
1
] be the family of complex fuzzy soft sets associated with ξ by operator f
α defined in Definition 11. Then (1)
H
1
(
ξ
)
=
2
·
d
h
(
ξ
,
ξ
α
);
(2)
H
1
(
ξ
)
=
2
·
d
h
(
ξ
0
,
ξ
1
);
(3)
d
h
(
ξ
α
,
ξ
β
)
=
(
α
-
β
)
·
H
1
(
ξ
).


## 4.1. Distance Measures between Complex Intuitionistic Fuzzy Soft Sets

The axiomatic definition of the distance measure between complex intuitionistic fuzzy soft sets has been reframed and proposed as follows.Definition 13.
Suppose thatξ
=
〈
F
~
,
E
〉 and ξ
~
=
〈
G
~
,
E
〉 are two complex intuitionistic fuzzy soft sets over the universal set X. A real valued nonnegative function
(35)
d
:
C
I
F
S
S
(
X
)
×
C
I
F
S
S
(
X
)
⟶
0
,
1
is called distance measure C
I
F
S
S
(
X
), if d satisfies the following properties: (P1)
0
≤
d
(
ξ
,
ξ
~
)
≤
1;
(P2)
d
(
ξ
,
ξ
~
)
=
d
(
ξ
~
,
ξ
);
(P3)
d
(
ξ
,
ξ
~
)
=
0 if and only if ξ
=
ξ
~;
(P4)
for anyη
=
〈
H
~
,
E
〉
=
[
c
i
j
]
m
×
n
∈
C
I
F
S
S
(
X
), d
(
ξ
,
ξ
~
)
+
d
(
ξ
~
,
η
)
≥
d
(
ξ
,
η
).We extend and propose various distance measures for two CIFSSs as follows.(i)
Hamming distance:(36)
d
h
ξ
,
ξ
~
=
1
4
∑
j
=
1
n
‍
∑
i
=
1
m
‍
r
F
~
ε
j
x
i
-
r
G
~
ε
j
x
i
+
k
F
~
ε
j
x
i
-
k
G
~
ε
j
x
i
+
1
2
π
ω
F
~
ε
j
r
x
i
-
ω
G
~
ε
j
r
x
i
+
ω
F
~
ε
j
k
x
i
-
ω
G
~
ε
j
k
x
i
.
(ii)
Normalized Hamming distance:(37)
d
h
n
ξ
,
ξ
~
=
1
4
m
n
∑
j
=
1
n
‍
∑
i
=
1
m
r
F
~
ε
j
x
i
-
r
G
~
ε
j
x
i
ω
F
~
k
ω
G
~
k
‍
+
k
F
~
ε
j
x
i
-
k
G
~
ε
j
x
i
+
1
2
π
ω
F
~
ε
j
r
x
i
-
ω
G
~
ε
j
r
x
i
+
ω
F
~
ε
j
k
x
i

-

ω
G
~
ε
j
k
x
i
.
(iii)
Euclidean distance:(38)
d
e
n
ξ
,
ξ
~
2
=
1
4
∑
j
=
1
n
‍
∑
i
=
1
m
‍
r
F
~
e
j
x
i
-
r
G
~
ε
j
x
i
2
+
k
F
~
ε
j
x
i
-
k
G
~
ε
j
x
i
2
+
1
4
π
2
ω
F
~
ε
j
r
x
i
-
ω
G
~
ε
j
r
x
i
2
+
ω
F
~
ε
j
k
x
i
-
ω
G
~
ε
j
k
x
i
2
.
(iv)
Normalized Euclidean distance:(39)
d
e
n
ξ
,
ξ
~
2
=
1
4
m
n
∑
j
=
1
n
‍
∑
i
=
1
m
‍
r
F
~
e
j
x
i
-
r
G
~
ε
j
x
i
2
+
k
F
~
ε
j
x
i
-
k
G
~
ε
j
x
i
2
+
1
4
π
2
ω
F
~
ε
j
r
x
i
-
ω
G
~
ε
j
r
x
i
2
+
ω
F
~
ε
j
k
x
i
-
ω
G
~
ε
j
k
x
i
2
.


## 4.2. Entropies on Complex Intuitionistic Fuzzy Soft Sets

Here, we present the axiomatic definition for the entropy of complex intuitionistic fuzzy soft sets. The following conditions give the intuitive idea for the degree of fuzziness of a complex intuitionistic fuzzy soft set, that is, for the entropy of a complex intuitionistic fuzzy soft set.(i)
It will be null when the complex intuitionistic fuzzy soft set is a complex fuzzy soft set.
(ii)
It will be maximum if the complex intuitionistic fuzzy soft set is completely intuitionistic.
(iii)
An intuitionistic entropy of a complex intuitionistic fuzzy soft set will be equal to its complement.
(iv)
If the degree of membership and the degree of nonmembership of each element increase, the sum will do so as well, and therefore this complex intuitionistic fuzzy soft set becomes less fuzzy, and therefore the entropy should decrease.In view of the above-stated points and the definition of entropy for an intuitionistic fuzzy soft set given in [21], we propose the following definition for the entropy of a complex intuitionistic fuzzy soft set.Definition 14.
A real valued functionH
:
C
I
F
S
S
→
R
+ is called an intuitionistic entropy on C
I
F
S
S
(
X
), if H has the following properties: (i)
P1 (sharpness): H
(
ξ
)
=
0 if and only if ξ is a complex fuzzy soft set;
(ii)
P2 (maximality): let ξ
=
〈
F
~
,
E
〉
=
[
a
i
j
]
m
×
n, H
(
ξ
)
=
m
n if and only if μ
F
~
(
ε
)
(
x
)
=
ν
F
~
(
ε
)
(
x
)
=
0, ∀
x
∈
X and ε
∈
E;
(iii)
P3 (symmetry): H
(
ξ
)
=
H
(
ξ
c
), for all ξ
∈
C
I
F
S
S
(
X
);
(iv)
P4 (resolution): if ξ
* is sharpened version of ξ, that is, if ξ
⪯
ξ
*, then H
(
ξ
)
≥
H
(
ξ
*
).Similar to the entropy of an intuitionistic fuzzy soft set [21], we deduce the following property from the property P2 of Definition 14.Theorem 15.
H
(
ξ
) is maximum if and only if ξ
=
〈
F
~
,
E
〉
=
[
a
i
j
]
m
×
n
=
[
0
]
m
×
n; that is, a
i
j
=
μ
F
~
(
ε
j
)
(
x
i
)
=
ν
F
~
(
ε
j
)
(
x
i
)
=
0, ∀
ε
j
∈
E, x
i
∈
X, where 0
≤
i
≤
m and 0
≤
j
≤
n.Proof.
Consider the following.
Necessary Part. Let ξ
=
〈
F
~
,
E
〉
=
[
a
i
j
]
m
×
n
=
[
0
]
m
×
n. Let ξ
~
=
〈
G
~
,
E
〉 be any complex intuitionistic fuzzy soft set. Since μ
G
~
(
ε
j
)
(
x
i
)
≥
0 and ν
G
~
(
ε
j
)
(
x
i
)
≥
0, ∀
ε
j
∈
E, x
i
∈
X, where 0
≤
i
≤
m and 0
≤
j
≤
n, therefore, by Definition 10, we have ξ
⪯
ξ
~. Thus, H
(
ξ
)
≥
H
(
ξ
~
) by property P4 of Definition 14 for all ξ
~, and then H
(
ξ
) is maximum.
Sufficient Part. Let H
(
ξ
) is maximum. We assume that ξ
=
〈
F
~
,
E
〉
=
[
a
i
j
]
m
×
n
≠
[
0
]
m
×
n, and then there is a ε
j
∈
E and x
i
∈
X such that μ
F
~
(
ε
j
)
(
x
i
)
≠
0 and ν
F
~
(
ε
j
)
(
x
i
)
≠
0, where 0
≤
i
≤
m and 0
≤
j
≤
n. We construct the following complex intuitionistic fuzzy soft set: ξ
~
=
〈
G
~
,
E
〉 with μ
G
~
(
ε
j
)
(
x
i
)
=
1
/
2
μ
F
~
(
ε
j
)
(
x
i
) and ν
G
~
(
ε
j
)
(
x
i
)
=
1
/
3
ν
F
~
(
ε
j
)
(
x
i
) for all ε
j
∈
E and x
i
∈
X, and then by Definition 10 we have H
(
ξ
~
)
≥
H
(
ξ
) which contradicts the fact that hypothesis H
(
ξ
) is maximum. Therefore, ξ
=
[
0
]
m
×
n.Let us take the following setD
=
{
(
x
,
y
)
∈
[
0
,
1
]
×
[
0
,
1
]
∣
x
+
y
≤
1
} and with it let us construct ψ
D
:
D
→
[
0
,
1
], which satisfies the following conditions:(1)
ψ
D
(
x
,
y
)
=
1 if and only if x
+
y
=
1;
(2)
ψ
D
(
x
,
y
)
=
0 if and only if x
=
0
=
y;
(3)
ψ
D
(
x
,
y
)
=
ψ
D
(
y
,
x
);
(4)
ifx
≤
x
′ and y
≤
y
′, then ψ
D
(
x
,
y
)
≤
ψ
D
(
x
′
,
y
′
).Theorem 16.
Letξ
=
〈
F
~
,
E
〉
=
[
a
i
j
]
m
×
n
∈
C
I
F
S
S
(
X
) and H
:
C
I
F
S
S
(
X
)
→
R
+ such that
(40)
H
ξ
=
1
2
∑
j
=
1
n
‍
∑
i
=
1
m
‍
1
-
ψ
r
F
~
ε
j
x
i
,
k
F
~
ε
j
x
i
,
ω
F
~
ε
j
k
x
i
2
π
+
1
-
ψ
ω
F
~
ε
j
r
x
i
2
π
,
ω
F
~
ε
j
k
x
i
2
π
,
where ψ satisfies conditions (1)–(4); then H is an intuitionistic entropy on C
I
F
S
S
(
X
).Proof.
(1)H
(
ξ
)
=
0 if and only if, for all ε
j
∈
E, x
i
∈
X,
(41)
1
2
∑
j
=
1
n
‍
∑
i
=
1
m
‍
1
-
ψ
(
r
F
~
(
ε
j
)
(
x
i
)
,
k
F
~
(
ε
j
)
(
x
i
)
)
ω
F
~
ε
j
k
x
i
2
π
+
1
-
ψ
ω
F
~
ε
j
r
x
i
2
π
,
ω
F
~
ε
j
k
x
i
2
π
=
0
,
⟺
ψ
r
F
~
ε
j
x
i
,
k
F
~
ε
j
x
i
=
1
,
ψ
ω
F
~
ε
j
r
x
i
2
π
,
ω
F
~
ε
j
k
x
i
2
π
=
1
,
⟺
r
F
~
ε
j
(
x
i
)
+
k
F
~
ε
j
(
x
i
)
=
1
,
ω
F
~
ε
j
r
(
x
i
)
+
ω
F
~
ε
j
k
(
x
i
)
=
2
π
,
⟺
ξ
∈
C
F
S
S
(
X
)
.
Thus,H satisfies property P1 of Definition 14.
(2)H
(
ξ
)
=
m
n if and only if, for all ε
j
∈
E, x
i
∈
X,
(42)
1
2
∑
j
=
1
n
‍
∑
i
=
1
m
‍
1
-
ψ
(
r
F
~
(
ε
j
)
(
x
i
)
,
k
F
~
(
ε
j
)
(
x
i
)
)
ω
F
~
ε
j
k
x
i
2
π
+
1
-
ψ
ω
F
~
ε
j
r
x
i
2
π
,
ω
F
~
ε
j
k
x
i
2
π
=
m
n
,
⟺
r
F
~
ε
j
x
i
+
k
F
~
ε
j
x
i
=
0
,
ω
F
~
(
ε
j
)
r
(
x
i
)
+
ω
F
~
(
ε
j
)
k
(
x
i
)
=
0
,
⟺
r
F
~
ε
j
x
i
,
k
F
~
ε
j
x
i
=
0
,
ω
F
~
(
ε
j
)
r
(
x
i
)
,
ω
F
~
(
ε
j
)
k
(
x
i
)
=
0
,
which implies ξ is completely intuitionistic. Thus, H satisfies property P2 of Definition 14.
(3) Sinceξ
c
=
〈
F
~
,
E
〉
c
=
〈
F
~
c
,
¬
E
〉, where F
~
c
=
{
〈
x
i
,
ν
F
~
(
ε
)
(
x
i
)
,
μ
F
~
(
ε
)
(
x
i
)
〉
∣
x
i
∈
X
}, ∀
¬
ε
∈
¬
E, then
(43)
H
ξ
=
1
2
∑
j
=
1
n
‍
∑
i
=
1
m
‍
1
-
ψ
(
r
F
~
(
ε
j
)
(
x
i
)
,
k
F
~
(
ε
j
)
(
x
i
)
)
ω
F
~
ε
j
k
x
i
2
π
+
1
-
ψ
ω
F
~
ε
j
r
x
i
2
π
,
ω
F
~
ε
j
k
x
i
2
π
=
1
2
∑
j
=
1
n
‍
∑
i
=
1
m
‍
1
-
ψ
k
F
~
ε
j
x
i
,
r
F
~
ε
j
x
i
ω
F
~
ε
j
r
x
i
2
π
+
1
-
ψ
ω
F
~
ε
j
k
x
i
2
π
,
ω
F
~
ε
j
r
x
i
2
π
=
H
(
ξ
c
)
.
Thus,H satisfies property P3 of Definition 14.
(4) Letξ
~
=
〈
F
~
,
E
〉
=
[
b
i
j
]
m
×
n, and if ξ
≤
ξ
~, then we have r
F
~
(
ε
j
)
(
x
i
)
≤
r
G
~
(
ε
j
)
(
x
i
) and k
F
~
(
ε
j
)
(
x
i
)
≤
k
G
~
(
ε
j
)
(
x
i
), for the amplitude terms and for the phase terms ω
F
~
(
ε
j
)
r
(
x
i
)
≤
ω
G
~
(
ε
j
)
r
(
x
i
) and ω
F
~
(
ε
j
)
k
(
x
i
)
≤
ω
G
~
(
ε
j
)
k
(
x
i
), ∀
x
i
∈
X and ∀
ε
j
∈
E.
Thus, we have(44)
ψ
r
F
~
ε
j
x
i
,
k
F
~
ε
j
x
i
≤
ψ
r
G
~
ε
j
x
i
,
k
G
~
ε
j
x
i
ψ
ω
F
~
ε
j
r
x
i
2
π
,
ω
F
~
ε
j
k
x
i
2
π
≤
ψ
ω
G
~
ε
j
r
x
i
2
π
,
ω
G
~
ε
j
k
x
i
2
π
⟹
1
-
ψ
(
r
F
~
(
ε
j
)
(
x
i
)
,
k
F
~
(
ε
j
)
(
x
i
)
)
≥
1
-
ψ
r
G
~
ε
j
x
i
,
k
G
~
ε
j
x
i
,
1
-
ψ
ω
F
~
ε
j
r
x
i
2
π
,
ω
F
~
ε
j
k
x
i
2
π
≥
1
-
ψ
ω
G
~
ε
j
r
x
i
2
π
,
ω
G
~
ε
j
k
x
i
2
π
⟹
H
ξ
~
≤
H
ξ
.
Thus,H satisfies property P4 of Definition 14.
Therefore,H is an intuitionistic entropy of complex intuitionistic fuzzy soft set.Burillo and Bustince [23] gave some expressions for intuitionistic entropy of intuitionistic fuzzy soft sets. Jiang et al. [21] extended these expressions for intuitionistic entropy of intuitionistic fuzzy soft sets. On similar pattern, we are extending these expressions for intuitionistic entropy of complex intuitionistic fuzzy soft sets.Letξ
=
〈
F
~
,
E
〉
=
[
a
i
j
]
m
×
n
∈
C
I
F
S
S
(
X
). It is easy to verify that the following expressions are the intuitionistic entropies of ξ:
(45)
H
1
ξ
=
1
2
∑
j
=
1
n
‍
∑
i
=
1
m
‍
1
-
(
r
F
~
(
ε
j
)
(
x
i
)
+
k
F
~
(
ε
j
)
(
x
i
)
)
+
ω
F
~
ε
j
k
x
i
2
π
+
1
-
ω
F
~
ε
j
r
x
i
+
ω
F
~
ε
j
k
x
i
2
π
;
H
2
ξ
=
1
2
∑
j
=
1
n
‍
∑
i
=
1
m
‍
1
-
r
F
~
ε
j
x
i
+
k
F
~
ε
j
x
i
n
ω
F
~
ε
j
r
x
i
2
π
n
+
1
-
ω
F
~
ε
j
r
x
i
+
ω
F
~
ε
j
k
x
i
2
π
n
,
n
=
2
,
3
,
…
;
H
3
ξ
=
1
2
∑
j
=
1
n
‍
∑
i
=
1
m
‍
1
-
(
r
F
~
(
ε
j
)
(
x
i
)
+
k
F
~
(
ε
j
)
(
x
i
)
)
e
1
-
(
r
F
~
(
ε
j
)
(
x
i
)
+
k
F
~
(
ε
j
)
(
x
i
)
)
ω
F
~
ε
j
r
x
i
+
ω
F
~
ε
j
k
x
i
2
π
·
e
1
-
(
r
F
~
(
ε
j
)
(
x
i
)
+
k
F
~
(
ε
j
)
(
x
i
)
)
,
+
1
-
ω
F
~
ε
j
r
x
i
+
ω
F
~
ε
j
k
x
i
2
π
ω
F
~
ε
j
r
x
i
+
ω
F
~
ε
j
k
x
i
2
π
·
e
1
-
(
ω
F
~
ε
j
r
x
i
+
ω
F
~
ε
j
k
x
i
)
/
2
π
;
H
4
ξ
=
1
2
∑
j
=
1
n
‍
∑
i
=
1
m
‍
1
-
(
r
F
~
ε
j
(
x
i
)
+
k
F
~
ε
j
(
x
i
)
)
π
2
r
F
~
ε
j
+
ω
F
~
ε
j
k
x
i
4
·
sin
⁡
π
2
r
F
~
ε
j
x
i
+
k
F
~
ε
j
x
i
+
1
-
ω
F
~
ε
j
r
x
i
+
ω
F
~
ε
j
k
x
i
2
π
·
sin
⁡
ω
F
~
ε
j
r
x
i
+
ω
F
~
ε
j
k
x
i
4
.In the following definition, we introduce a function fromC
I
F
S
S
(
X
) to R
+, which is an extension of the H
ϕ
,
ϕ
′-function from I
F
S
S
(
X
) to R
+ given in [21], which is also an extension of the H
ϕ
,
ϕ
′-function from F
S
S
(
X
) to R
+ given in [23].Definition 17.
Letϕ
,
ϕ
′
:
[
0
,
1
]
→
[
0
,
1
] be such that if x
+
y
≤
1, then ϕ
(
x
)
+
ϕ
′
(
y
)
≤
1, with x
,
y
∈
[
0
,
1
]. One defines function H
ϕ
,
ϕ
′
(
·
) of the complex intuitionistic fuzzy soft set ξ
=
〈
F
~
,
E
〉
=
[
a
i
j
]
m
×
n
∈
C
I
F
S
S
(
X
) to R
+ as follows:
(46)
H
ϕ
,
ϕ
′
ξ
=
m
n
-
1
2
∑
j
=
1
n
‍
∑
i
=
1
m
‍
ϕ
(
r
F
~
ε
j
(
x
i
)
)
+
ϕ
′
(
k
F
~
(
ε
j
)
(
x
i
)
)
ϕ
′
ω
F
~
ε
j
k
x
i
2
π
+
ϕ
ω
F
~
ε
j
r
x
i
2
π
ϕ
′
ω
F
~
ε
j
k
x
i
2
π
+
ϕ
′
ω
F
~
ε
j
k
x
i
2
π
.
Obviously, 0
≤
H
ϕ
,
ϕ
′
(
ξ
)
≤
m
n for all ξ
=
[
a
i
j
]
m
×
n belonging to C
I
F
S
S
(
X
).Theorem 18.
Letξ
=
〈
F
~
,
F
〉
=
[
a
i
j
]
m
×
n, ξ
~
=
〈
G
~
,
E
〉
=
[
b
i
j
]
m
×
n
∈
C
I
F
S
S
(
X
); then function H
ϕ
,
ϕ
′ satisfies the following property:
(47)
H
ϕ
,
ϕ
′
(
ξ
∪
ξ
~
)
+
H
ϕ
,
ϕ
′
(
ξ
∩
ξ
~
)
=
H
ϕ
,
ϕ
′
(
ξ
)
+
H
ϕ
,
ϕ
′
(
ξ
~
)
.Proof.
By Definition17, we have the following:
(48)
H
ϕ
,
ϕ
′
(
ξ
∪
ξ
~
)
=
m
n
-
1
2
∑
j
=
1
n
‍
∑
i
=
1
m
‍
ϕ
(
r
F
~
(
ε
j
)
(
x
i
)
⋄
r
G
~
(
ε
j
)
(
x
i
)
)
ω
F
~
ε
j
k
x
i
2
π
∩
ω
G
~
ε
j
k
x
i
2
π
+
ϕ
′
k
F
~
ε
j
x
i
*
k
F
~
ε
j
x
i
+
ϕ
ω
F
~
ε
j
r
x
i
2
π
∪
ω
G
~
ε
j
r
x
i
2
π
+
ϕ
′
ω
F
~
ε
j
k
x
i
2
π
∩
ω
G
~
ε
j
k
x
i
2
π
,
H
ϕ
,
ϕ
′
(
ξ
∩
ξ
~
)
=
m
n
-
1
2
∑
j
=
1
n
‍
∑
i
=
1
m
‍
ϕ
(
r
F
~
ε
j
(
x
i
)
*
r
G
~
ε
j
(
x
i
)
)
ω
F
~
ε
j
k
x
i
2
π
∩
ω
G
~
ε
j
k
x
i
2
π
+
ϕ
′
(
k
F
~
(
ε
j
)
(
x
i
)
⋄
k
F
~
(
ε
j
)
(
x
i
)
)
+
ϕ
ω
F
~
ε
j
r
x
i
2
π
∪
ω
G
~
ε
j
r
x
i
2
π
+
ϕ
′
ω
F
~
ε
j
k
x
i
2
π
∩
ω
G
~
ε
j
k
x
i
2
π
.
Thus, we have
(49)
H
ϕ
,
ϕ
′
(
ξ
∪
ξ
~
)
+
H
ϕ
,
ϕ
′
(
ξ
∩
ξ
~
)
=
H
ϕ
,
ϕ
′
(
ξ
)
+
H
ϕ
,
ϕ
′
(
ξ
~
)
.It may be noted that there areH
ϕ
,
ϕ
′-functions which are not intuitionistic entropies; for example,
(50)
H
ϕ
,
ϕ
′
(
ξ
)
=
m
n
-
1
2
∑
j
=
1
n
‍
∑
i
=
1
m
‍
r
F
~
ε
j
x
i
+
k
F
~
ε
j
x
i
1
2
π
+
1
2
π
ω
F
~
ε
j
r
x
i
+
ω
F
~
ε
j
k
x
i
.
On the other hand, it may also be easily verified that there are entropies which are not H
ϕ
,
ϕ
′-functions; for example,
(51)
H
ϕ
,
ϕ
′
(
ξ
)
=
m
n
-
1
2
∑
j
=
1
n
‍
∑
i
=
1
m
r
F
~
ε
j
x
i
+
k
F
~
ε
j
x
i
2
1
2
π
2
‍
+
1
2
π
ω
F
~
ε
j
r
x
i
+
ω
F
~
ε
j
k
x
i
2
.
Also, there are entropies which are also H
ϕ
,
ϕ
′-functions; for example,
(52)
H
ϕ
,
ϕ
′
(
ξ
)
=
m
n
-
1
2
∑
j
=
1
n
‍
∑
i
=
1
m
‍
1
-
r
F
~
(
ε
j
)
(
x
i
)
+
k
F
~
(
ε
j
)
(
x
i
)
1
2
π
ω
F
~
(
ε
j
)
k
(
x
i
)
+
1
-
1
2
π
ω
F
~
ε
j
r
x
i
+
ω
F
~
ε
j
k
x
i
.
Next, we introduce a property which defines entropies in a general way as follows.Theorem 19.
Ifϕ
:
[
0
,
1
]
→
[
0
,
1
] satisfies the following conditions: (1)
ϕ is increasing,
(2)
ϕ
(
x
)
=
0 if and only if x
=
0,
(3)
ϕ
(
x
)
+
ϕ
(
y
)
=
1 if and only if x
+
y
=
1, then ϕ
(
x
)
+
ϕ
(
y
) satisfies conditions (1)–(4) of ψ function defined previously.We denoteH
ϕ
,
ϕ
′-function as H
ϕ
,
ϕ-function if ϕ
=
ϕ
′. The following theorem characterizes the intuitionistic entropy of complex intuitionistic fuzzy soft sets in a general way.Theorem 20.
LetH
:
C
I
F
S
S
→
R
+, ϕ
:
[
0
,
1
]
→
[
0
,
1
], and ξ
=
〈
F
~
,
E
〉
=
[
a
i
j
]
m
×
n
∈
C
I
F
S
S
(
X
). H is an intuitionistic entropy and H
ϕ
,
ϕ-function if and only if
(53)
H
(
ξ
)
=
1
2
∑
j
=
1
n
‍
∑
i
=
1
m
‍
1
-
ϕ
r
F
~
ε
j
x
i
+
ϕ
k
F
~
ε
j
x
i
1
-
ϕ
ω
F
~
ε
j
r
x
i
2
π
+
1
-
ϕ
ω
F
~
ε
j
r
x
i
2
π
ω
F
~
ε
j
k
x
i
2
π
+
ϕ
ω
F
~
ε
j
k
x
i
2
π
,
where ϕ satisfies conditions (1)–(3) of Theorem 19.Based on the definitions and properties stated above, it may be easily verified that there is a kind of correspondence between the proposed entropies and the distance measures of complex intuitionistic fuzzy soft sets, which is as follows.Theorem 21.
Letξ
=
〈
F
~
,
E
〉
=
[
a
i
j
]
m
×
n
∈
C
I
F
S
S
(
X
) and f
α
(
ξ
)
=
{
ξ
α
}
α
∈
[
0
,
1
] be the family of complex fuzzy soft sets associated with ξ by operator f
α defined in Definition 11. Then (1)
H
1
(
ξ
)
=
2
·
d
h
(
ξ
,
ξ
α
);
(2)
H
1
(
ξ
)
=
2
·
d
h
(
ξ
0
,
ξ
1
);
(3)
d
h
(
ξ
α
,
ξ
β
)
=
(
α
-
β
)
·
H
1
(
ξ
).


## 5. Application in Multicriteria Decision Making problems

Suppose that a car dealerX decides to purchase cars from a car company Y. The car company provides some information to the car dealer on four different models of cars with different manufacturing dates for each model. So, the car dealer X wants to select four models, say, Car1, Car2, Car3, and Car4, with its manufacturing date simultaneously. Suppose that a team of experts (decision makers) agreed that five parameters should be considered in the selection process and they can be reliability, maximum payload, purchasing cost, maximum speed, and durability. It may be noted that the parameters may get affected and altered if the manufacturing date is different for a particular model of car. The decision made by the expert team will also depend on the knowledge and experience of its members. The best way to represent this kind of information may be by using CIFSS, in which, for each car model, the experts have different opinions and mentalities. For instance, suppose that at least 60% of experts believe that Car1 is suitable on the first parameter and not more than 15% of the experts believe that Car1 is poor on the first parameter. In this way, we can calculate the amplitude terms for both membership and nonmembership functions of CIFSS. The phase terms that represent the manufacturing date for the first parameter of Car1 can be calculated as follows: whether at least 70% of experts believe that the production date of Car1 is suitable at the first parameter and not more than 20% of them believe that the production date of Car1 is poor. Therefore, the information based on experts about Car1 on the first parameter can be represented in the form of CIFSS as 〈
0.6
·
e
2
π
0.70
,
0.15
·
e
2
π
0.20
〉. In this way, all data can be obtained in the form of CIFSS, where both amplitude and phase terms can represent the information on experts’s decision which happens periodically. Assume that the expert team had suggested an ideal car (i.e., a car that is in demand) before getting the characteristic information from car maker Y. The aim of the expert team is to select a suitable car listed by car maker Y that is most likely to be the ideal car. Using this information, car dealer X can take the decision to purchase cars from car company Y which are in demand in the market to gain maximum profit.


## 6. Conclusions

The new introduced concept of complex intuitionistic fuzzy soft sets (CIFSSs) which is a parametric tool has been well proposed and studied in detail along with its important properties and fundamental operations. Based on various well-known distance measures, some new distance measures for CIFSSs have been obtained and extended to find the entropies of complex intuitionistic fuzzy soft sets. A correspondence between the proposed entropies and the distance measures of complex intuitionistic fuzzy soft sets has been well established. An application in the area of multicriteria decision making problem on the basis of the proposed CIFSSs, distance measures, and information measures has also been suggested.



---

*Source: 972198-2014-12-14.xml*