Progress in Nonlinear Dynamics and Chaos

Vol. 4, No. 2, 2016, 85-102

ISSN: 2321 9238 (online) Progress in
Published on 30 November 2016
www.researchmathsci.org
DOI: http://dx.doi.org/10.22457/pindac.v4n2a5

Determinant Theory for Fuzzy Neutrosophic Soft

Matrices
R.Uma1, P. Murugadas2 and S. Sriram3
1,2
Department of Mathematics, Annamalai University, Annamalainagar-608002, India
3
Department of Mathematics, Mathematics wing, D.D.E, Annamalai University,
Annamalainagar-608002, India
Emil: 1uma83bala@gmail.com; 3ssm_3096@yahoo.co.in
*Corresponding author. E-mail address: 2bodi_muruga@yahoo.com
Received 23 September 2016; accepted 17 October 2016
Abstract. We study determinant theory for fuzzy neutrosophic soft square matrices, its
properties and also we prove that det ( Aadj ( A)) = det ( A) = det ( adj ( A) A).
Keywords: Adjoint, determinant, fuzzy neutrosophic soft square matrix, determinant of
fuzzy neutrosophic soft square matrix.
AMS Mathematics Subject Classification (2010): 10M20
1. Introduction
The complexity of problems in economics, engineering, environmental sciences and
social sciences which cannot be solved by the well known methods of classical
Mathematics pose a great difficulty in todays practical world (as various types of
uncertainties are presented in these problems) . To handle situation like these, many tools
have been suggested. Some of them are probability theory, fuzzy set theory [18], rough
set theory [11], etc.
The traditional fuzzy set is characterized by the membership value or the grade
of membership value. Sometimes it may be very difficult to assign the membership value
for fuzzy sets. Interval-valued fuzzy sets were proposed as a natural extension of fuzzy
sets and the interval valued fuzzy sets were proposed independently by Zadeh [19] to
ascertain the uncertainty of grade of membership value. In current scenario of practical
problems in expert systems, belief system, information fusion and so on, we must
consider the truth membership as well as the falsity-membership for proper description of
an object in imprecise and doubtful environment. Neither the fuzzy sets nor the interval
valued fuzzy sets is appropriate for such a situation.
Intuitionistic fuzzy set initiated by Atanassov [3] is appropriate for such a
situation. The intuitionistic fuzzy sets can only handle the incomplete information
considering both the truth membership (or simply membership) and falsity-membership
(or non membership) values. It does not handle the indeterminate and inconsistent
information which exist in belief system. The soft set theory, an utterly new theory for
modeling ambiguity and uncertainties was first coined by Molodstov [9] in the year 1999.

85
 R.Uma, P. Murugadas and S. Sriram
Soft set theory research is carried out as a new trend and it shows much appreciable
development well received by the users of the field.
Fuzzy matrices play crucial role in Science and Technology. Sometimes the
issues cannot be solved by classical matrix theory when they occur in an uncertain
environment and this failure is inevitable. Thomason [14] initiated the fuzzy matrices to
represent fuzzy relation in a system based on fuzzy set theory and discussed about the
convergence of power of fuzzy matrix. In 1995, Smarandache introduced the concept of
neutrosophy. In neutrosophic logic, each proposition is approximated to have the
percentage of truth in a subset T, the percentage of indeterminancy in a subset I and the
percentage of falsity in a subset F, so that this neutrosophic logic is called an extension
of fuzzy logic. In fact this mathematical tool is used to handle problems like imprecision,
indeterminancy and inconsistency of data etc.
Maji et al. [5], initiated the concept of fuzzy soft set with some properties
regarding fuzzy soft union, intersection, complement of fuzzy soft set. Moreover Maji et
al. [6,10] extended soft sets to intuitionistic fuzzy soft sets and neutrosophic soft sets and
the concept of neutrosophic set was introduced by Smarandache [12] which is a
generalization of fuzzy logic and several related systems.
Yang and Ji [17], introduced a matrix representation of fuzzy soft set and applied
it in decision making problems. Bora et al. [8] introduced the intuitionistic fuzzy soft
matrices and applied in the application of a Medical diagnosis.
Sumathi and Arokiarani [13] introduced new operation on fuzzy neutrosophic soft
matrices. Dhar et al. [7] have also defined neutrosophic fuzzy matrices and studied
square neutrosophic fuzzy matrices. Uma et al. [15,16], introduced two types of fuzzy
neutrosophic soft matrices and have discussed determinant and adjoint of fuzzy
neutrosophic soft matrices. Kim et al. [4], introduced the concept of determinant theory
for fuzzy matrices.
In this paper, some elementary properties of determinant theory for fuzzy
neutrosophic soft square matrices have been established and some theorems including
det ( A( adjA)) = det ( A) = det ( adj ( A) A). where det ( A) denotes the determinant of A
and adj ( A) denotes the adjoint matrix of A.

2. Preliminaries
Definition 2.1. [12] A neutrosophic set A on the universe of discourse X is defined as
A = { x, TA ( x), I A ( x), FA ( x), x X } ,
where T , I , F : X ] 0,1+ [ and 0 TA ( x ) + I A ( x ) + FA ( x ) 3+ (1)
From philosophical point of view the neutrosophic set takes the value from real standard
or non-standard subsets of ] 0,1+ [ . But in real life application especially in scientific
and Engineering problems it is difficult to use neutrosophic set with value from real
standard or non-standard subset of ] 0,1+ [ . Hence we consider the neutrosophic set
which takes the value from the subset of [0,1] .Therefore we can rewrite the equation (1)
as 0 TA ( x ) + I A ( x ) + FA ( x ) 3.

86
 Determinant Theory for Fuzzy Neutrosophic Soft Matrices
In short an element a in the neutrosophic set A, can be written as
a = a , a I , a F , where aT denotes degree of truth, a I denotes degree of indeterminacy,
T

a F denotes degree of falsity such that 0 a T + a I + a F 3.

Example 2.2. Assume that the universe of discourse X = {x1 , x2 , x3} , where x1 , x2 , and
x3 characterizes the quality, reliability, and the price of the objects. It may be further
assumed that the values of {x1 , x2 , x3} are in [0,1] and they are obtained from some
investigations of some experts. The experts may impose their opinion in three
components viz; the degree of goodness, the degree of indeterminacy and the degree of
poorness to explain the characteristics of the objects. Suppose A is a Neutrosophic Set
(NS) of X , such that A = { x1 , 0.4, 0.5, 0.3 , x2 , 0.7, 0.2, 0.4 , x3 , 0.8, 0.3, 0.4},
where for x1 the degree of goodness of quality is 0.4 , degree of indeterminacy of quality
is 0.5 and degree of falsity of quality is 0.3, etc.

Definition 2.3. [9] Let U be an initial universe set and E be a set of parameters. Let P(U)
denotes the power set of U. Consider a nonempty set A, A E . A pair (F,A) is called a
soft set over U, where F is a mapping given by F : A P (U ).

Definition 2.4. [1] Let U be an initial universe set and E be a set of parameters.
Consider a non empty set A, A E . Let P (U ) denotes the set of all fuzzy neutrosophic
sets of U . The collection ( F , A) is termed to be the Fuzzy Neutrosophic Soft Set
(FNSS) over U, Where F is a mapping given by F : A P (U ) . Hereafter we simply
consider A as FNSS over U instead of ( F , A).

Definition 2.5. [2] Let U = {c1 , c2 ,...cm } be the universal set and E be the set of
{ }
parameters given by E = e1 , e2 ,...en . Let A E . A pair ( F , A) be a FNSS over U .
Then the subset of U E is defined by RA = {(u , e); e A, u FA (e)} which is called
a relation form of ( FA , E ) . The membership function, indeterminacy membership
function and non membership function are written by TRA : U E [0,1] ,
I RA : U E [0,1] and FRA : U E [0,1] where TRA (u , e) [0,1], I RA (u , e) [0,1]
and FRA (u , e ) [0,1] are the membership value, indeterminacy value and non
membership value respectively of u U for each e E .
If [(Tij , I ij , Fij )] = [(Tij (ui , e j ), I ij (ui , e j ), Fij (ui , e j )] we define a matrix

87
 R.Uma, P. Murugadas and S. Sriram

T11 , I11 , F11 T12 , I12 , F12 T1n , I1n , F1n

T , I , F T , I , F T , I , F
Tij , I ij , Fij = 21 21 21 22 22 22 2n 2n 2n
mn

Tm1 , I m1 , Fm1 Tm 2 , I m 2 , Fm 2 Tmn , I mn , Fmn
This is called an m n FNSM of the FNSS (FA, E) over U.

Definition 2.6. [15] Let U = {c1 , c2 ...cm } be the universal set and E be the set of
parameters given by E = {e1 , e2 ,...en } . Let A E . A pair ( F , A) be a fuzzy
neutrosophic soft set. Then fuzzy neutrosophic soft set ( F , A) in a matrix form as
Amn = ( aij ) mn or A = ( aij ), i = 1, 2,...m, j = 1, 2,...n where
(T (ci , e j ), I (ci , e j ), F (ci , e j )) if e j A
(aij ) =
0, 0,1 if e j A
where T j (ci ) represent the membership of ci , I j (ci ) represent the indeterminacy of ci
and F j (ci ) represent the non-membership of ci in the FNSS ( F , A) . If we replace the
identity element 0, 0,1 by 0,1,1 in the above form we get FNSM of type-II.
Let Fmn denotes FNSM of order m n and Fn denotes FNSM of order n n .

Definition 2.7. [15] [Type-I]

Let A = ( aijT , aijI , aijF ), B = ( bijT , bijI , bijF ) Fmn the component wise addition and
component wise multiplication is defined as
{ } { }
1. A B = ( sup aijT , bijT , sup aijI , bijI , inf aijF , bijF ). { }
2. A B = (inf {aijT , bijT }, inf {aijI , bijI }, sup{aijF , bijF }).

Definition 2.8. [15] Let A Fmn , B Fn p , the composition of A and B is defined as

n n n

A  B = (aikT bkjT ),
k =1
(aikI bkjI ),
k =1
(a
k =1
F
ik bkjF )

equivalently we can write the same as

( (a b ), (a b ), (a b ) )
n n n

= k =1
T
ik
T
kj k =1
I
ik
I
kj k =1
F
ik
F
kj

The product A  B is defined if and only if the number of columns of A is same as

the number of rows of B . A and B are said to be conformable for multiplication. We
shall use AB instead of A  B.

Definition 2.9.[15][Type-II] Let A = ( aijT , aijI , aijF ), B = (bijT , bijI , bijF ) Fmn , the
component wise addition and component wise multiplication is defined as

88
 Determinant Theory for Fuzzy Neutrosophic Soft Matrices

{ } { }
A B = ( sup aijT , bijT , inf aijI , bijI , inf aijF , bijF ). { }
A B = (inf {a , b }, sup{a , b }, sup{a , b } ).
T
ij
T
ij
I
ij
I
ij
F
ij
F
ij
Analogous to FNSM of type-I, we can define FNSM of type -II in the following way

Definition 2.10. [15] Let A = ( aij , aij , aij ) = (aij ) Fmn and
T I F

B = (bijT , bijI , bijF ) = (bij ) Fn p the product of A and B is defined as

n n n

A B = aikT bkjT ,
k =1
k =1
aikI bkjI ,
k =1
aikF bkjF

equivalently we can write the same as
n n n

= aikT bkjT , aikI bkjI , aikF bkjF .
k =1 k = 1 k = 1
The product A B is defined if and only if the number of columns of A is same as the
number of rows of B. A and B are said to be conformable for multiplication.

Definition 2.11. [16] The determinant A of n n FNSM A = ( aijT , aijI .aijF ) is defined
as follows
A = a1T (1) ... anT ( n ) , a1I (1) ... anI ( n ) , a1F (1) ... anF ( n )
Sn Sn Sn

where Sn denotes the symmetric group of all permutations of the indices (1, 2,...n).

Definition 2.12. [16] The adjoint of an n n FNSM A denoted by adj A, is defined as

follows bij = A ji is the determinant of the ( n 1) ( n 1) FNSM formed by deleting
row j and column i from A and B = adjA .

Remark 2.13. We can write the element bij of adjA = B = (bij ) as follows:
bij =


Sn j ni tn j
atT (t ) , atI (t ) , atF (t ) Where n j = {1, 2,3.....n} \{ j} and Sn j ni is the set of

all permutation of set n j over the set ni .

3. Properties of the fuzzy neutrosophic soft square matrices (FNSSM)

1. The value of the determinant remains unchanged when any two rows or columns are
interchanged.
2. The values of the determinant of FNSSM remain unchanged when rows and columns
are interchanged.
3. If A and B be two FNSSMs then the following property will hold
det ( AB ) detA detB.
4. If the elements of any row (or column) of a determinant are added to the corresponding
elements of another row (or column), the value of the determinant thus obtained is equal
to the value of the original determinant.

89
 R.Uma, P. Murugadas and S. Sriram
Theorem 3.1. Let A = (aij , aij , aij ) FNSSMn.
T I F

Let Ak = ( akT1 , akI1 , akF1 , akT2 , akI 2 , akF2 ,..., akn

T
, aknI , aknF ) be the k -th row of A. We
assume that a1 = akiT , akiI , akiF for all i 1, 2,..., n and a pq a1 for all p, q 1, 2,..., n.
Then det ( A) = a1.

Theorem 3.2. Let A FNSSM n then

n
(i) det ( A) = A = a
t =1
T
it , aitI , aitF Ait , i {1, 2,..., n}.

a1Te , a1Ie , a1Fe

1 a1Tf , a1I f , a1Ff 2
(ii) det ( A) =
e< f
a
, a , a a , a , a e
T I
A F T I F , where the summation is
f
2e 2e 2e 2f 2f 2f

taken over all e and f in {1,2,...,n} such that e < f .

Definition 3.3. Let A = (aij , aij , aij ) n FNSSM n , and let B be a matrix from A by
T I F

striking out e1 , row e2 ,..., row ek and column g1 , column g 2 , ..., column g k . we define
e1 e2 ...ek
A = det ( H ).
g1 g2 ...g k

Theorem 3.4.
a1T g1 , a1I g1 , a1F g1 ... a1T g k , a1T g k , a1T g k
T
a2 g1 , a2 g 2 , a2 g 2 ... a2T g k , a2I g k , a2F g k
I F

det ( A) = det
g1 < g 2 <...< g k

a g , a I g , a k g
T
... ak g k , ak g k , ak g k
T I F
k 1 k 1 1 1
1 2 ...k
A where the summation is taken over all g1 , g 2 ,..., g k {1, 2,...n},
g1 g2 ...g k
such that g1 < g 2 < ... < g k .
Proof: Let S ( g1 , g 2 ,..., g k ) = { :{1, 2,..., k } {g1 , g 2 ,..., g k } is a bijection}. Then
det ( A) =

a
Sn
T
1 (1) , a1I (1) , a1F (1) ... anT ( n ) , anI ( n ) , anF ( n )

= ( {1,2,...,k }S ( g1 , g2 ,..., gk ) a1T (1) , a1I (1) , a1F (1) ... anT ( n ) , anI ( n ) , anF ( n ) )
g1 < g 2 <...< g k

90
 Determinant Theory for Fuzzy Neutrosophic Soft Matrices

= ( ' {1,2,...,k }S ( g , g )( a1T ' (1) , a1I ' (1) , a1F ' (1) ... anT ' ( n ) , anI ' ( n ) , anF , ( n ) )
1 2 ,..., g k )
g1 < g 2 <...< g k

1 2 ... k
A = det
g1 g2 ... gk g1 < g 2 <...< g k

a1T g1, a1I g1, a1F g1 a1T g2, a1I g2, a1F g2 ... a1T gk , a1I gk , a1F gk
T I F
a2 g1, a2 g1, a2 g1 a2 g2, a2 g2, a2 g2 ... a2T gk , a2I gk , a2F gk
T I F
1 2 ... k
A
... ... ... ... g1 g2 ... gk
T I F
ak g1, ak g1, ak g1 ak g2, ak g2, ak g2
T I F
... akT gk , akI gk , akF gk
Hence the pooof.

Lemma 3.5.
aT , a I , a F
bT , b I , b F
Let A = F
be a FNSSM.
c , c , c d , d , d
T I F T I

a T , a I , a F bT , b I , b F cT , c I , c F d T , d I , d F
Then det T I F F
det T I F F
a , a , a b , b , b c , c , c d , d , d
T I T I

aT , a I , a F bT , b I , b F cT , c I , c F d T , d I , d F
= det ( A)
aT , a I , a F bT , b I , b F cT , c I , c F d T , d I , d F
Proof:
aT , a I , a F bT , b I , b F cT , c I , c F d T , d I , d F
We see det T I F
that F
det T I F F
a , a , a b , b , b c , c , c d , d , d
T I T I

= aT , a I , a F bT , b I , b F cT , c I , c F d T , d I , d F
aT , a I , a F d T , d I , d F + bT , b I , b F cT , c I , c F
= det ( A).

Notation: Let A FNSSM n .Let A(e f ) be the matrix obtained from A by replacing
row f of A by row e of A.

Theorem 3.6. Let A FNSSM n . Then

(i )det ( A(2 1))det ( A(1 2)) det ( A).
(ii )det ( A(2 1))det ( A(3 2)) det ( A).
(iii )det ( A(q p )))det ( A( p k )) det ( A).
Proof: To prove

91
 R.Uma, P. Murugadas and S. Sriram
(i )det ( A(2 1))det ( A(1 2))
1 2 a1Te , a1Ie , a1Fe a1Tf , a1I f , a1Ff
a , a , a a , a , a + ... + T I F
T I F T I F
A
= 11 11 11 12 12 12
1 2 a1e , a1e , a1e a1Tf , a1I f , a1Ff
a , a , a a , a , a
T
11
I
11
F
11
T
12
I
12
F
12
e< f

1 2
A + ... +
e f
a1Tn 1 , a1In 1 , a1Fn 1 a1Tn , a1In , a1Fn 1 2 a21
T I
, a21 F
, a21 a22
T I
, a22 F
, a22
A . A
a1Tn 1 , a1In 1 , a1Fn 1 a1Tn , a1In , a1Fn n 1 n a21 a22
T I F T I F
, a21 , a21 , a22 , a22
1 2
+ ... +
1 2
a2Te , a2I e , a2Fe a2T f , a2I f , a2Ff 1 2
a1Te , a1Ie , a1Fe a1Tf , a1I f , a1Ff
A + ... +
e< f e f
a T
2 n 1 ,a I
2 n 1 ,a a , a , a 1
F
2 n 1
T
2n
I
2n
F
2
2n
A
a T
2 n 1 ,a I
2 n 1 ,a a , a , a n 1 n
F
2 n 1
T
2n
I
2n
F
2n

a1Te , a1Ie , a1Fe a1Tf , a1I f , a1Ff 1 2 a2Tg , a2I g , a2Fg a2Th , a2I h , a2Fh
= T I F A A
e < f a1e , a1e , a1e a1Tf , a1I f , a1Ff e f g < h a2Tg , a2I g , a2Fg a2Th , a2I h , a2Fh
1 2

g h
a1Te , a1Ie , a1Fe a1Tf , a1I f , a1Ff 1 2 1 2
A A (by Lemma 3.5)
e< f a , a , a a , a , a
T
2g
I
2g
F
2g
T
2h
I
2h
F
2h e f g h
g <h

e f
We now introduce symbols J 1 , J 2 , A and J . Define
g h
e f a1Te , a1Ie , a1Fe a1Tf , a1I f , a1Ff 1 2 1 2
J = T I F A A
g h a2 g , a2 g , a2 g a2 h , a2 h , a2 h
T I F
e f g h
e f e f
J1 = J = J ,
( e , f ) =( g , h ) g h e< f e f
e f
J2 = J and J = J1 + J 2 . Then we see that
(e, f ) ( g ,h ) g h
1 2 a11T , a11I , a11F a12T , a12I , a12F 1 2
J = T I F A ,
1 2 a21 , a21 , a21 a22 , a22 , a22 1 2
T I F

J 1 = det ( A) by Theorem 3.2(ii) and

det ( A(2 ))det ( A(1 2)) J = J 1 + J 2 = det ( A) + J 2 .

92
 Determinant Theory for Fuzzy Neutrosophic Soft Matrices
We show that J 2 det ( A).
There are two cases to be considered.
1 2
Case 1. We consider a = J , a term of J 2 .
1 3
1 2 1 2
Let a1 = a11 T
, a11I , a11F a23
T I
, a23 F
, a23 A A and
1 2 1 3
1 2 1 2
a2 = ( a12T , a12I , a12F a21
T I
, a21 F
, a21 A A
1 2 1 3
Then a = a1 + a2 ,
a11T , a11I , a11F a13T , a13I , a13F
1 3
a1 det ( A),
A
a , a , a a , a , a 1 3
T
21
I
21
F
21
T
23
I
23
F
23

aT , a I , a F a12T , a12I , a12F 1 2

a2 T11 11I 11F A det ( A),
a21 , a21 , a21 a22
T I
, a22 F
, a22 1 2
1 2
and J det ( A),
1 3
1 2
Case 2. We take J
n 1 n
1 2 1 2
Let b1 = a11
T
, a11I , a11F a2Tn , a2I n , a2Fn A A and
1 2 n 1 n
1 2 1 2
b2 = a12T , a12I , a12F a2Tn 1 , a2I n 1 , a2Fn 1 A A .
1 2 n 1 n
1 2
Then J = b1 + b2 . To show that b1 det ( A) and b2 = det ( A) , we
n 1 n
1 2 1 2
observe all coordinates of the elements aij involved in A and A .
1 2 n 1 n
The coordinates of the elements aij involved in these determinants are all coordinates of
the elements of the k th row Ak of A, for k 3. Therefore, if we let
b = a3n 1a4 n 2 ...ak + 2 n k ...ann 2 , then we see that
b1 ( a11
T
, a11I , a11F a2Tn , a2I n , a2Fn )c det ( A). For b2 , let c = a3n a4 n 2 a5 n3 ...an 13a2 n 1 ,
then we see that b2 ( a12
T
, a12I , a12F a2Tn 1 , a2I n 1 , a2Fn 1 )c det ( A). For any
e f
J ,we apply either the case 1 or the case 2 and we can deduce that
g h ( e , f ) ( g , h )

93
 R.Uma, P. Murugadas and S. Sriram
e f
J det ( A).
g h ( e , f ) ( g , h )
Thus (i) holds.
(ii). First we consider
b11T , b11I , b11F b12T , b12I , b12F b21
T
, b21I , b21F b22
T
, b22I , b22F
a31
T
, a31I , a31F a32
T
, a32I , a32F b21
T
, b21I , b21F b22
T
, b22I , b22F
b21
T
, b21I , b21F b32
T
, b32I , b32F
.
a31
T
, a31I , a31F a32
T
, a32I , a32F
We introduce a symbol
g h a2Tg , a2I g , a2Fg a2Th , a2I h , a2Fh 2 3 2 3
K = A A .
e f a3Te , a3Ie , a3Fe a3T f , a3I f , a3Ff g h e f
Then we can see that
det ( A(2 1))det ( A(3 2))
a1Te , a1Ie , a1Fe a1Tf , a1I f , a1Ff
2 3 a2Tg , a2I g , a2Fg a2Th , a2I h , a2Fh
=
e< f
T I F T I F
A
a3e , a3e , a3e a3 f , a3 f , a3 f e

f a2Tg , a2I g , a2Fg a2Th , a2I h , a2Fh
A
g <h

2 3

g h
a2Tg , a2I g , a2Fg a2Th , a2I h , a2Fh 2 3 2 3
T I F A A
g < h a3 e , a3e , a3 e a3 f , a3 f , a3 f g h
T I F
e f
e< f

g h
= A e
f
g <h
e< f

h g g h
= + K
K .
e
f ( g ,h) ( e, f ) e f
( g ,h)=(e, f )

g h
Next we prove that K det ( A).
e f ( g ,h ) ( e , f )
For this we consider two cases.
1 2
Case 1. We take K . We see that
1 3
1 2 2 3
=( a21 , a21 , a21 a33 , a33 , a33 + a22 , a22 , a22 a31 , a31 , a31 ) A
T I F T I F T I F T I F
K A
1 3 1 2
2 3

1 3

94
 Determinant Theory for Fuzzy Neutrosophic Soft Matrices
2 3 2 3
= ( a21
T I
, a21 F
, a21 a33
T
, a33I , a33F ) A A +( a22 , a22 , a22 a31 , a31 , a31 ) A
T I F T I F

1 2 1 3
2 3 2 3
A
1 2 1 3
aT , a21
I F
, a21 a23
T I
, a23 F
, a23 2 3 a21
T I
, a21 F
, a21 a22
T I
, a22 F
, a22 2 3
21 A + A
a31 , a31 , a31 a33 , a33 , a33 1 3 a31 , a31 , a31 a32 , a32 , a32 1 2
T I F T I F T I F T I F

det ( A) + det ( A)
= det ( A).
Case 2. We consider
n 1 n 3 2 2
3
= a2 n 1 , a2 n 1 , a2 n 1 a32 , a32 , a32 A
T I F T I F
K A +
1 2 2 n 1 n 1
3 2 32
a2Tn , a2I n , a2Fn a31
T
, a31I , a31F A
A .
2 n 1 n 1
2 3 2 3
Considering the coordinates of the elements aij involved in A A , we
1 2 n 1 n
claim that
2 3 2 3
( a2Tn 1 , a2I n 1 , a2Fn 1 a32 , a32I , a32F ) A det ( A)
T
A
1 2 n 1 n
and
2 3 2 3
( a2Tn , a2I n , a2Fn a31 , a31I , a31F A det ( A).
T
A
1 2 n 1 n
Similarly we can prove (iii).

Theorem 3.7. Let A = (aijT , aijI , aijF ) n , B = (bijT , bijI ,ijF ) n , (cijT , cijI , cijF ) n FNSSM n . Then
1. If aiiT , aiiI , aiiF aikT , aikI , aikF ( k = 1, 2,..., n) for all 1 i n, then
det ( A) = a , a , a a , a , a ... a , a , a .
T
11
T
11
T
11
T
22
T
22
T
22
T
nn
T
nn
T
nn

A C
2. det det ( A) det ( B ) where O = ( 0, 0,1 ) n FNSSM n
O B
3. det ( AAT ) det ( A).
4. If aij , aij , aij bij , bij , bij for all i, j, then det ( A) = det ( B ).
T I F T I F

Proof:
1. We have
a11T , a11I , a11F a22
T I
, a22 F
, a22 ... ann
T I
, ann F
, ann a1T (1) , a2I (2) , anF ( n ) for every S n ,
since aiiT , aiiI , aiiF aikT , aikI , aikF ( k = 1, 2,..., n) for all 1 i n.

95
 R.Uma, P. Murugadas and S. Sriram
Hence det ( A) =

a
Sn
T
1 (1) , a1I (1) , a1F (1) a2T (2) , a2I (2) , a2F (2) ... anT ( n ) , anI ( n ) , anF ( n )

= a , a , a a , a22
T
11
I
11
I F F
, a22
11 ... ann
TT
22
I
, ann F
, ann
A C
= ( dij , dij , dij )2 n .
T I F
2. Let
O B
Then
A C
= d1 (1) , d1 (1) , d1 (1) ... d 2 n (2 n ) , d 2 n (2 n ) , d 2 n (2 n )
T I F T I F
det
O B S2 n
= d1T (1) , d1I (1) , d1F (1) ... d 2Tn (2 n ) , d 2I n (2 n ) , d 2Fn (2 n ) +
S2 n , ( i ) n (if i n )

S2 n ,k > n ,if ( k ) n
d1T (1) , d1I (1) , d1F (1) ... d 2Tn (2 n ) , d 2I n (2 n ) , d 2Fn (2 n )

=
S2 n , ( i ) n ( ifi n )

d1T (1) , d1I (1) , d1F (1) ... d 2Tn (2 n ) , d 2I n (2 n ) , d 2Fn (2 n ) + 0

=

d
'Sn
T
1 '(1) , d1I '(1) , d1F '(1) ... d nT '( n ) , d nI '( n ) , d nF '( n ) det ( B)

=(

d
Sn
T
1 (1) , d1I (1) , d1F (1) ... d nT ( n ) , d nI ( n ) , d nF ( n ) )det ( B )

= det ( A) det ( B ).
n
3. Let AA = ( gij , g ij , gij )n , where g ijT , g ijI , g ijF =
T T I F
a
k =1
T
ik , aikI , aikF akjT , akjI , akjF .

We have, for every Sn

g11T , g11I , g11F g 22
T I
, g 22 F
, g 22 ... g nn
T I
, g nn F
, g nn
n n
= ( a1Tk , a1Ik , a1Fk )...( ankT , ankI , ankF )
k =1 k =1

a T
1 (1) ,a I
1 (1) ,a F
1 (1) ... a T
n ( n ) , anI ( n ) , anF ( n )
Hence det ( AAT ) g11
T
, g11I , g11F g 22
T
, f 22I , f 22F ... g nn
T I
, g nn F
, g nn

a
Sn
T
1 (1) , a1I (1) , a1F (1) ... anT ( n ) , anI ( n ) , anF ( n )

= det ( A).

Theorem 3.8. Let A = ( aij ) be a FNSSM. Then we have the following

det ( Aadj ( A)) = det ( A) = det ( adj ( A) A).
Proof: We prove that det ( Aadj ( A)) = det ( A) .
We first consider n=2.

96
 Determinant Theory for Fuzzy Neutrosophic Soft Matrices
a11T , a11I , a11F a12T , a12I , a12F
Let A = T I F F
.
a21 , a21 , a21 a22 , a22 , a22
T I

Then we see that

aT , a I , a F a12T , a12I , a12F
adj ( A) = 22T 22I 22 F
.
a21 , a21 , a21 a11 , a11 , a11
F T I

det ( A) a11T , a11I , a11F a12T , a12I , a12F

det ( Aadj ( A)) = T I F T I F
a21 , a21 , a21 a22 , a22 , a22 det ( A)
= det ( A) + ( a11
T
, a11I , a11F a12T , a12I , a12F a21
T I
, a21 F
, a21 a22
T I
, a22 F
, a22 )
det ( A).
Next consider n > 2. We can see that
a1Tt , a1It , a1Ft A1t a T
1t , a1It , a1Ft A2t ... a , a1It , a1Ft Ant
T
1t

a2t , a2t , a2t A1t a , a2I t , a2Ft A2t a , a2I t , a2Ft Ant
T I F T T
...
Aadj ( A) =
2t 2t
... ... ... ...

a , aI , a F A
T
a , antI , antF A2t
T
... ant , ant , ant Ant
T I F
nt nt 3t 1t nt

=( a , a , a A ) ,
T
it
I
it
F
it jt

det ( Aadj( A)) = ( a , a , a T

1t
I
1t
F
1t A (1)t )( a2Tt , a2I t , a2Ft A (2)t )...( antT , antI , antF A ( n)t ).
Sn

Clearly any diagonal entry of the matrix Aadj ( A) is equal to det ( A).
We prove the result in the following way.
(1) Let us define
T = ( a1Tt , a1It , a1Ft A (1)t )( a2Tt , a2I t , a2Ft A (2)t )...( antT , antI , antF A ( n )t ),
for S n . Let e be the identity of the group S n . If = e, then T = det ( A). Suppose
that there exists k {1, 2,..., n} such that (k ) = k . Then we see that
a a a A ( k )t = aktT aktI aktF Akt
T I F
kt kt kt

= det ( A) and
J = ( a1Tt , a1It , a1Ft A (1)t )( a2Tt , a2I t , a2Ft A (2)t )...det ( A)...( antT , antI , antF A ( n )t )
det ( A).
(2) Let be a permutation in S n . Assume that ( k ) k for all k {1, 2,...n}.
We know that every permutation can be written as a product of disjoint cycles i and
let = 1 2 ... k . We further assume that 1 = (1 2), a transposition.
Then J has two factors, ( a T
1t , a1It , a1Ft A (1)t ) and
( a2Tt , a2I t , a2Ft A (2)t ), and from these we see that

97
 R.Uma, P. Murugadas and S. Sriram

( a1Tt , a1It , a1Ft A (1) t )( a2Tt , a2I t , a2Ft A (2)t ) = ( a1Tt , a1It , a1Ft A2t )( a2Tt , a2I t , a2Ft A1t )

= det ( A(2 1)) det ( A(1 2))

det ( A) (by theorem3. 2(i))
(3) If = 1 2 ... k and 1 ( s, t ), then we can prove that J det ( A) by an argument
used in(2). Consider J for = 1 2 ... k . If
1 = (k , e, f ,...), then we see that
J = ( aktT , aktI , aktF A ( k ) t ) )( aetT , aetI , aetF A ( e ) t ) )...
= ( aktT , aktI , aktF Aet )( aetT , aetI , aetF Aft )... = det ( A(e k ))det ( A( f e))...
From Theorem 3.6(iii), we obtain that det ( A(e k )) det ( A( f e)) det ( A) and
consequently that J det ( A). This proves that det ( Aadj ( A)) = det ( A). Similarly,
we can prove that det ( adj ( A) A) = det ( A). Hence the proof.

Theorem 3.9. Let A, B FNSSM n . Then

(1) det ( AB ) det ( A)det ( B ).
(2) det ( AB ) det ( A + B ),
where A + B = ( sup{aijT , bijT }, sup{aijI , bijI }, inf {aijF , bijF })
Proof.
n n n
det ( AB ) = det (( aikT bkjT , aikI bkjI , aikF bkjF ))
k =1 k =1 k =1
n n n
= {[ a T
1k bkT (1) , a1Ik bkI (1) , aikF bkF (1) )], ,
S n k =1 k =1 k =1
n n n
[ a T
nk bkT ( n ) , ankI bkI ( n ) , (ankF bkF ( n ) ]}
k =1 k =1 k =1

=

(
Sn k1 , k 2 ...k n
(a a ... a
T
1k1
T
2 k2
T
nkn bkT1 (1) bkT2 (2) ... bkTn ( n ) )

(
k1 , k2 ... kn
(a1Ik1 a2I k2 ... ankI n bkI1 (1) bkI2 ( 2 ) ... bkIn ( n ) )

k1 ,k2 ...kn
(a1Fk1 a2Fk2 ...ankF n bkF1 (1) bkF2 ( 2 ) ...bkFn ( n ) )

{k1 ,k2 ...kn }Sn
a1Tk1 , a1Ik1 , a1Fk1 ... ank
T
n
, ankI n , ankF n

98
 Determinant Theory for Fuzzy Neutrosophic Soft Matrices

bkT1 (1) , bkI1 (1) , bkF1 (1) ...bkTn (n) , bkIn (n) , bkFn (n) ) =
Sn
(
( k1 , k2 ...kn )Sn
a1Tk1 , a1Ik1 , a1Fk1 ... ank
T
n
, ankI n , ankF n ) det ( B))

= det ( A) det ( B )
n n n
(2) We know that det ( AB ) = det (( aikT bkjT , aikI bkjI , aikF + bkjF ))
k =1 k =1 k =1
n n n
= [ a T
1k bkT (1) , a1Ik bkI (1) , a1Fk bkT (1) ...
Sn k =1 k =1 k =1
n n n

(a T
nk bkT ( n ) ), ( ankI bkI ( n ) ), ( ankF bkT ( n ) )]
k =1 k =1 k =1

=

(Sn t s ,t n
(a b
T
1s
T
t (1) ), ( (a btI (1) ),
I
1s (a1Fs bsF (1) )...
t s ,t n t s ,t n

( (a b T
ns
T
t ( n ) ), ( (a b
I
ns
I
t ( n ) ), (ansF bsF ( n ) )
t s ,t n t s ,t n t s ,t n

(a
Sn
T
1 (1) b T
1 (1) ) (a I
1 (1) b I
1 (1) ) (a1F (1) b1F (1) )

... (anT ( n ) bnT ( n ) ) (anI ( n ) bnI ( n ) ) (anF ( n ) bnF ( n ) )

t s ,t n

= det (( aijT , aijI , aijF + bijT , bijT , bijT ) n )

= det ( A + B )

Corollary 3.10. Let A be a FNSSM, Ar = (aij ) FNSSM n (r=1, 2, 3,...,m}. Then

r

m m m
(1) det ( A1 ) det ( A2 )...det ( Am ) det ( Ar ) where
r =1
Ar = ( aijr )n FNSSM n .
r =1 r =1

(2) det ( A( r ) ) = det ( A), where A = ( aij ) n FNSSM n and r N .

Example 3.11. Consider the 4 4 matrix

a11T , a11I , a11F a12T , a12I , a12F a14T , a14I , a14F
a13T , a13I , a13F
T I F F
a21 , a21 , a21 a22 , a22 , a22 a23 a24
T I F T I F T I
, a23 , a23 , a24 , a24
a31
T
, a3I1 , a31F a32
T
, a32I , a32F T I F T I F
a33 , a33 , a33 a34 , a34 , a34
T I F
a41 , a41 , a41 a42 , a42 , a42
T I F
a43
T I
, a43 F
, a43 a44
T I
, a44 , a4F4
We find the determinant of the above matrix in the following method
a11T , a11I , a11F a12T , a12I , a12F a33
T
, a33I , a33F a34
T
, a34I , a34F
=
a21
T I
, a21 F
, a21 a22
T I
, a22 F
, a22 1< 2 a43
T I
, a43 F
, a43 a44
T I
, a44 F
, a44

99
 R.Uma, P. Murugadas and S. Sriram

a11T , a11I , a11F a13T , a13I , a13F a32

T
, a32I , a32F a34
T
, a34I , a34F
+ T I F
a21 , a21 , a21 a23 T I
, a23 F
, a23 1<3 a42
T I
, a42 F
, a42 a44
T I
, a44 F
, a44
a11T , a11I , a11F a14T , a14I , a14F a32
T
, a32I , a32F a33
T
, a33I , a33F
+
a21
T I
, a21 F
, a21 a24
T I
, a24 F
, a24 1<4 a42
T I
, a42 F
, a42 a43
T I
, a43 F
, a43
a12T , a12I , a12F a13T , a13I , a13F a31
T
, a31I , a31F a34
T
, a34I , a34F
+ T I F
a22 , a22 , a22 a23 T I
, a23 F
, a23 2<3 a41
T I
, a41 F
, a41 a44
T I
, a44 F
, a44
a12T , a12I , a12F a14T , a14I , a14F a31
T
, a31I , a31F a33
T
, a33I , a33F
+
a22
T I
, a22 F
, a22 a24
T I
, a24 F
, a24 2< 4 a41
T I
, a41 F
, a41 a43
T I
, a43 F
, a43
a13T , a13I , a13F a14T , a14I , a14F a31
T
, a31I , a31F a32
T
, a32I , a32F
+
a23
T I
, a23 F
, a23 a24
T I
, a24 F
, a24 3< 4 a41
T I
, a41 F
, a41 a42
T I
, a42 F
, a42
using this method we can find the determinant of the given matrix
0.4, 0.2, 0.1 0.6, 0.7, 0.8 0.7, 0.3, 0.4 0.6, 0.7, 0.8

0.4,0.6, 0.7 0.3, 0.2,0.1 0.5, 0.6, 0.7 0.4, 0.3,0.2
0.6, 0.7, 0.8 0.8, 0.9, 0.3 0.5, 0.6, 0.7 0.6, 0.7, 0.8

0.9,0.5, 0.3 0.5, 0.3, 0.2 0.5, 0.6, 0.7 0.8, 0.3, 0.9
Solution.
0.4, 0.2, 0.1 0.6, 0.7,0.8 0.5, 0.6, 0.7 0.6, 0.7, 0.8
= +
0.4, 0.6, 0.7 0.3, 0.2, 0.1 0.5, 0.6, 0.7 0.8, 0.3, 0.9
0.4, 0.2, 0.1 0.7, 0.3, 0.4 0.8, 0.9, 0.3 0.6, 0.7, 0.8
+
0.4, 0.6, 0.7 0.5, 0.6, 0.7 0.5,0.3, 0.2 0.8, 0.3,0.9
0.4, 0.2, 0.1 0.6, 0.7, 0.8 0.8, 0.9, 0.3 0.5, 0.6, 0.7
0.4, 0.6, 0.7 0.4, 0.3, 0.2 0.5, 0.3, 0.2 0.5, 0.6, 0.7
0.6, 0.7, 0.8 0.7, 0.3, 0.4 0.6, 0.7, 0.8 0.6, 0.7, 0.8
+ +
0.3, 0.2, 0.1 0.5, 0.6, 0.7 0.9, 0.5, 0.3 0.8, 0.3, 0.9
0.6, 0.7, 0.8 0.6, 0.7, 0.8 0.6, 0.7, 0.8 0.5, 0.6, 0.7
+
0.3, 0.2, 0.1 0.4, 0.3, 0.2 0.9, 0.5, 0.3 0.5, 0.6, 0.7
0.7, 0.3, 0.4 0.6, 0.7, 0.8 0.6, 0.7, 0.8 0.8, 0.9, 0.3
0.5, 0.6, 0.7 0.4, 0.3, 0.2 0.9, 0.5, 0.3 0.5, 0.3,0.2
= [ 0.3, 0.2, 0.1 0.4, 0.6, 0.8 ][ 0.5, 0.3, 0.9 0.5, 0.6, 0.8 ] +
[ 0.4, 0.2, 0.7 0.4, 0.3, 0.7 ][ 0.8, 0.3, 0.9 0.5, 0.3, 0.8 ] +
[0.4, 0.2, 0.2 0.4, 0.6, 0.8 ][ 0.5, 0.6, 0.7 0.5, 0.3, 0.7 ] +
[ 0.5, 0.6, 0.8 0.3, 0.2, 0.4 ][ 0.6, 0.3, 0.9 0.6, 0.5.0.8 ] +

100
 Determinant Theory for Fuzzy Neutrosophic Soft Matrices
[ 0.4, 0.3, 0.8 0.3, 0.2, 0.8 ][ 0.5, 0.6, 0.8 0.5, 0.5, 0.7 ] +
[ 0.4, 0.3, 0.4 0.5, 0.6, 0.8 ][ 0.5, 0.3, 0.8 0.8, 0.5, 0.3 ]
= [ 0.4, 0.6, 0.1 0.5, 0.6, 0.8 ][ 0.4, 0.3, 0.7 0.8, 0.3, 0.8 ] +
[0.4, 0.6, 0.2 0.5, 0.6, 0.7 ] + [ 0.5, 0.6, 0.4 0.6, 0.5, 0.8 ] +
[0.4, 0.3, 0.8 0.5, 0.6, 0.7 ] + [ 0.5, 0.6, 0.4 0.8, 0.5, 0.3 ]
= 0.4, 0.6, 0.8 + 0.4, 0.3, 0.8 + 0.4, 0.6, 0.7 +
0.5, 0.5, 0.8 + 0.4, 0.3, 0.8 + 0.5, 0.5, 0.4 .
det ( A) = 0.5, 0.6, 0.4

4. Conclusion
In this paper, we have studied properties of determinant and adjoint of fuzzy neutrosophic
soft square matrices.
REFERENCES
1. I.Arockiarani, I.R.Sumathi and M.Jency, Fuzzy Neutrosophic soft topological
spaces, IJMA, 10 (2013) 225-238.
2. I.Arockiarani and I.R.Sumathi, A fuzzy neutrosophic soft Matrix approach in
decision making, JGRMA, 2 (2) (2014) 14-23.
3. K.Atanassov, Intuitionistic fuzzy sets, Fuzzy Sets and Systems, 20 (1986) 87-96.
4. J.B.Kim, A.Baartmas and N.Sahadin, Determinant theory for fuzzy matrix, Fuzzy
Sets and Systems, 29 (1989) 346-356.
5. P.K.Maji, R.Biswas and A.R.Roy, Fuzzy Soft set, The Journal of Fuzzy
Mathematics, 9 (3) (2001) 589-602.
6. P.K.Maji, R.Biswas and A.R.Roy, Intuitionistic fuzzy soft sets, Journal of Fuzzy
Mathematics, 12 (2004) 669-683.
7. M.Dhar, S.Broumi and F.Smarandache, A note on square neutrosophic fuzzy
matrices, Neutrosophic Sets and Systems, 3 (2014) 37-41.
8. M.Bora, B.Bora and T.J.Neog and D.K.Sut, Intuitionistic fuzzy soft matrix theory
and its application in medical diagnosis, Annals of Fuzzy Mathematics and
Informatics, 7(1) (2013) 157-168.
9. D.Molodtsov, Soft set theory first results, Computer and mathematics with
applications, 37 (1999) 19-31.
10. P.K.Maji, Neutrosophic soft set, Annals of fuzzy mathematics and informatics, 5
(2013) 157-168.
11. Z.Pawlak, Rough sets, International journal of computing and information sciences,
11 (1982) 341-356.
12. F.Smarandache, Neutrosophic set, a generalisation of the intuitionistic fuzzy set,
Inter. J. Pure Appl. Math., 24 (2005) 287-297.
13. I.R.Sumathi and I.Arockiarani, New operations on fuzzy neutrosophic soft matrices,
International Journal of Innovative Research and Studies, 3 (3) (2014) 110-124.
14. M.G.Thomas, Convergence of powers of a fuzzy matrix, Journal. Math. Annal.
Appl., 57 (1977) 476-480.
15. R.Uma, P.Murugadas and S.Sriram, Fuzzy neutrosophic soft matrices of type-I and
type-II, Communicated.

101
 R.Uma, P. Murugadas and S. Sriram
16. R.Uma, P.Murugadas and S.Sriram, Determinant and adjoint of fuzzy neutrosophic
soft matrices, Communicated.
17. Y.Yang and C.Ji, Fuzzy soft matrices and their application, Part I, LNAI 7002;
(2011) 618-627.
18. L.A.Zadeh, Fuzzy sets, Information and control, 8 (1965) 338-353.
19. L.A.Zadeh, The concept of a linguistic variable and its application to approximate
reasoning-I, Information Science, 8 (1975) 199-249.
20. M.Bhowmik and M.Pal, Intuitionistic neutrosophic set, Journal of Information and
Computing Science, 4(2) (2009) 142-152.
21. M.Bhowmik and M.Pal, Intuitionistic neutrosophic set relations and some of its
properties, Journal of Information and Computing Science, 5(3) (2010) 183-192.

102