Rough sets in Fuzzy Neutrosophic approximation space

C. Antony Crispin Sweety* & I. Arockiarani*

* Department of Mathematics
Nirmala College for Women, Coimbatore-18.
Email: riosweety@gmail.com
Abstract
A rough set is a formal approximation of a crisp set which gives lower and upper approximation of original set to deal with uncertainties. The concept of neutrosophic set is
a mathematical tool for handling imprecise, indeterministic and inconsistent data. In this
paper, we introduce the concepts of Rough Fuzzy Neutrosophic Sets and Fuzzy Neutrosophic
Rough Sets and investigate some of their properties. Further as the characterisation of fuzzy
neutrosophic rough approximation operators, we introduce various notion of cut sets of neutrosophic fuzzy sets.

Introduction

Rough set theory is a [9], is an extension of set theory for the study of intelligent systems
characterized by inexact, uncertain or insufficient information. Moreover, it is a mathematical
tool for machine learning, information sciences and expert systems and successfully applied
in data analysis and data mining. There are two basic elements in rough set theory, crisp set
and equivalence relation, which constitute the mathematical basis of rough set. The basic
idea of rough set is based upon the approximation of sets by a pair of sets known as the lower
approximation and the upper approximation of a set . In classical rough set theory partition
or equilence relation is the basic concept. Now fuzzy sets are combined with rough sets in
a fruitful way and defined by rough fuzzy sets and fuzzy rough sets [5,6]. Also fuzzy rough
sets, generalize fuzzy rough, intuitionistic fuzzy rough sets, rough intuitionistic fuzzy sets,
rough vague sets are introduced. The theory of rough sets is based upon the classification
mechanism, from which the classification can be viewed as an equivalence relation and knowledge blocks induced by it be a partition on universe. One of the interesting generalizations
of the theory of fuzzy sets and intuitionistic fuzzy sets is the theory of neutrosophic sets
introduced by F. Smarandache. Neutrosophic sets described by three functions: Truth function indeterminacy function and false function that are independently related. The theories
of neutrosophic set have achieved great success in various areas such as medical diagnosis,
database, topology, image processing, and decision making problem. While the neutrosophic

2
set is a powerful tool to deal with indeterminate and inconsistent data, the theory of rough
sets is a powerful mathematical tool to deal with incompleteness. Neutrosophic sets and
rough sets are two different topics, none conflicts the other. Recently many researchers applied the notion of neutrosophic sets to relations, group theory, ring theory, Soft set theory
and so on. In this paper we combine the mathematical tools fuzzy sets, rough sets and neutrosophic sets and introduce a new class of set called fuzzy neutrosophic rough sets. Here
we give rough approximation of a fuzzy neutrosophic set and introduce fuzzy neutrosophic
rough sets

Preliminaries

Definition 2.1[1]
A Neutrosophic set A on the universe of discourse X is defined as
A = { hx, TA (x), IA (x), FA (x)i / x X} where
T, I, F : X ] 0 , 1+ [ and 0 TA (x) + IA (x) + FA (x) 3+ .
Definition 2.2[1]
A neutrosophice set A is contained in another neutrosophic set B (ie)
A B TA (x) TB (x), IA (x) IB (x), FA (x) FB (x).
Definition 2.3[1]
A fuzzy Neutrosophic set A on the universe of discourse X is defined as
A = {h x, TA (x), IA (x), FA (x)i, x X} where T, F, I : X [0, 1] and
0 TA (x) + IA (x) + FA (x) B.
Definition 2.4[1]
If A = {hx, TA (x), IA (x), FA (x)i /x X} and B = {hx, TB (x), IB (x), FB (x)i /x X}
are any two fuzzy neutrosophic sets of X then
(i) A B TA (x) TB (x); IA (x) IB (x) and FA (x) FB (x)
(ii) A = B TA (x) = TB (x); IA (x) = IB (x) and FA (x) = FB (x) x X
(iii) A = {hx, FA (x), 1 IA (x), TA (x)i /x X}
(iv) A B = {hx, T(AB) (x), I(AB) (x), F(AB) (x)i/x X} where
TAB (x) = min{TA (x), TB (x)} IAB (x) = min{IA (x), IB (x)} FAB (x) = max{FA (x), FB (x)}
(v) A B = {hx, T(AB) (x), I(AB) (x), F(AB) (x)i/x X} where
TAB (x) = max{TA (x), TB (x)} IAB (x) = max{IA (x), IB (x)} FAB (x) = min{FA (x), FB (x)}.

3
Definition 2.5[5]
Let R U U be a crisp binary relation on U. R is referred to as reflexive if (x, x) R
for all x U .R is referred to as symmetric if for all (x,y) U, (x,y) R implies (y,x)
R and R is referred to as transitive if for all x,y,z U, (x,y) R and (y,z) R imply (x,z) R.
Definition 2.6[5]
Let U be a non empty universe of discourse and R U U , an arbitrary crisp relation
on U. Denote xR = y U/(x, y) R x U
xR is called the R-after set of x (Bandler and kohout 1980) or successor neighbourhood of
x with respect to R (Yao 1998 b). The pair (U,R) is called a crisp approximation space.
For any A U the upper and lower approximation of A with respect to (U,R) denoted by
and R are respectively defined as follows
R
= {x U/xR A 6= }
R
R = {x U/xR A}

R:
is referred to as crisp rough set of A with respect to (U,R) and R,
The pair (R(A), R(A))
(U ) (U ) are referred to upper and lower crisp approximation operator respectively.
The crisp approximation operator satisfies the following properties for all A, B (U )
0
= R( A)
(L1 ) R(A) = R0 (A )
(U1 )R
=
(U2 )R
(L2 )R(U ) = U
(L3 ) R(A B) = R(A) R(B)
(L4 ) A B R(A) R(B)

B) = R(A)

(U3 )R(A
R(B)

(U4 )A B = R(A)
R(B)

B) R(A)

(U5 )R(A
R(B)
are dual to each other.
Properties (L1 )and(U1 ) show that the approximation operators RandR
(L5 ) R(A B) R(A) R(B)

Properties with the same number may be considered as a dual properties. If R is equivalence

relation in U then the pair (U,R) is called a Pawlak approximation space and (R(A), R(A))
is a Pawlak rough set, in such a case the approximation operators have additional properties.

Fuzzy Neutrosophic rough sets

In this section, we introduce fuzzy neutrosophic approximation operators induced from the
same. Further we define a new type of set called fuzzy neutrosophic rough set and investigate
some of its properties.
Definition 3.1:
A constant fuzzy Neutrosophic set (, , ) = { hx, , , i/ x U }

4
where 0 , , 1 and + + 3.
We introduce a special Fuzzy Neutrosophic set ly for y U as follows
(
T1y (x) =

T1u{y} (x) =
(
I1y =

I1u{y} (x) =

1, if

0, if x 6= y
(
0, if x = y
1, if

1, if

F1u{y} (x) =

x 6= y

x=y

0, if x 6= y
(
0, if x = y
1, if

(
F1y (x) =

x=y

0, if

x 6= y
x=y

1, if x 6= y
(
1, if x = y
0, if

x 6= y.

Definition 3.2:
A Fuzzy Neutrosophic relation on U is a Fuzzy Neutrosophic subset
R = {hx, yi, TR (x, y), IR (x, y), FR (x, y)/x, y U }
TR : U U [0, 1]; IR : U U [0, 1]; FR : U U [0, 1] satisfies
0 TR (x, y) + IR (x, y) + FR (x, y) 3

for all

(x, y) U U . We denote the family of all

Fuzzy Neutrosophic relation on U by FNR(U U).

Definition 3.3:
Let U be a non empty universe of discourse. For an arbitrary fuzzy neutrosophic relation
R over U U the pair (U,R) is called fuzzy neutrosophic approximation space. For any A
FN(U), we define the upper and lower approoximations with respect to (U, R), denoted by

respectively.
R(A) and R(A)

R(A)
= {hx, TR(A)
(x), IR(A)
(x), FR(A)
(x)i/x U }

R(A) = {hx, TR(A) (x), IR(A) (x), FR(A) (x)i/x U }

where,
(x) =
TR(A)

W
yU

[ TR (x, y) TA (y) ]

IR(A)
(x) =

[ IR (x, y) IA (y) ]

yU

FR(A)
(x) =

[ FR (x, y) FA (y) ]

yU

TR(A) (x) =

[ FR (x, y) TA (y) ]

yU

IR(A) (x) =

[ 1 IR (x, y) IA (y) ]

yU

FR(A) (x) =

[ TR (x, y) FA (y) ]

yU

The pair (R(A), R(A))

is called Fuzzy Neutrosophic Rough set of A with respect to (U,R)
: F N (U ) F N (U ) are referred to as upper and lower Fuzzy Neutrosophic rough
and R, R
approximation operators respectively.
Remark 3.4:
If R is an intuitionistic fuzzy relation on U then (U,R) is a intuitionistic Fuzzy approximation space, Fuzzy neutrosophic rough operators are induced from a intuitionistic fuzzy
approximation space that is

R(A)
= {hx, TR(A)
(x), IR(A)
(x), FR(A)
(x)i/x U } A F N (U )

R(A) = {hx, TR(A) (x), IR(A) (x), FR(A) (x)i/x U } A F N (U )

where,
TR(A)
(x) =

IR(A)
(x) =

FR(A)
(x) =

TR(A) (x) =
IR(A) (x) =
FR(A) (x) =

W
yU
W
yU
V
yU
V
yU
V
yU
W

[ R (x, y) TA (y) ]
[ 1 (R (x, y) + R (x, y)) IR (y)]
[ R (x, y) FA (y) ]
[ R (x, y) TA (y) ]
[ (R (x, y) + R (x, y)) IA (y) ]
[ R (x, y) FA (y) ] .

yU

Remark 3.5:
If R is a crisp binary relation on U then (U,R) is a crisp approximation space, the Fuzzy
neutrosophic rough approximation operators are induced from a crisp approximation space,
that A F N (U )

R(A)
= {hx, T (x), I
R(A)

(x)i/x

R(A) (x), FR(A)

U}

6
R(A) = {hx, TR(A) (x), IR(A) (x), FR(A) (x)i/U U }
where,
W

TR(A)
(x) =

TA (y)

IR(A)
(x) =

y[x]R

TR(A) (x) =

IA (y)

FR(A)
(x) =

y[x]R

TA (y)

IR(A) (x) =

y[x]R

FA (y)

y[x]R

IA (y)

FR(A) (x) =

y[x]R

FA (y)

y[x]R

Theorem 3.6:
Let (U,R) be a Fuzzy Neutrosophic approximation space. Then the upper and lower
fuzzy Neutrosophic rough approximation operators induced from (U,R) satisfy the following
properties. A, B F N (U ) , , , [0, 1] with + + 3
0
0
0

(F N L1)R(A) = R0 (A ),
(F N U 1)R(A)
= R (A)
, , ) = R(A)

(F N U 2)R(A
(, , )
B) = R(A)

(F N U 3)R(A
R(B)

(F N L2)R(A , , ) = R(A) (, , ),
(F N L3)R(A B) = R(A) R(B),
(F N L5)R(A B) R(A) R(B)

(F N U 4)A B R(A)
R(B)
B) R(A)

(F N U 5)R(A
R(B)

(F N L6)R1 R2 R1 (A) R2 (A)

(F N U 6)R1 R2 R1 (A) R2 (A)

(F N L4)A B R(A) R(B)

proof:
It follows directly from Definition 3.1.
are
Properties (FNL1) and (FNU1) show that FN rough approximation operators R and R
dual to each other.
0

Remark 3.7: The properties (FNL2) and (FNU2) imply, following properties (F N L2)
0

and (F N U 2)
0

(F N L2) R(U ) = U

(F N U 2) = R()
=

Example 3.8:
Let (U,R) be a FN approximation space where U = {x1 , x2 , x3 } and R F N R(U U )
is defined as
R = {h(x1 , x1 )0.8, 0.7, 0.1i h(x1 , x2 ), 0.2, 0.5, 0.4i h(x1 , x3 )0.6, 0.5, 0.7i h(x2 , x1 )0.4, 0.6, 0.3i
h(x2 , x2 )0.7, 0.8, 0.1i h(x2 , x3 )0.5, 0.3, 0.1i h(x3 , x1 )0.6, 0.2, 0.1i h(x3 , x2 )0.7, 0.8, 0.1i h(x3 , x3 )1, 0.9, 0.1i}
If a Fuzzy Neutrosophic set
A = {hx1 , 0.8, 0.9, 0.1i hx2 , 0.5, 0.4, 0.3i hx3 , 0.5, 0.4, 0.7i}
W
[TR (x1 , y) TA (y)] = 0.8
then TR(A) (x1 ) =
W yY
IR(A) (x1 ) =
[IR (x1 , y) IA (y)] = 0.7
yY

7
FR(A) (x1 ) =

[FR (x1 , y) FA (y)] = 0.1

yY

Similarly we have TR(A) (x2 ) = 0.7 , IR(A) (x2 ) = 0.6 , FR(A)

(x2 ) = 0.3 and

TR(A) (x3 ) = 0.6 , IR(A)

(x3 ) = 0.4 , FR(A) (x3 ) = 0.1 .

Hence R(A) = {hx1 , 0.8, 0.7, 0.1i hx2 , 0.7, 0.6, 0.3i , hx3 , 0.6, 0.4, 0.1i }.
Likewise we can calculate
R(A) = {hx1 , 0.5, 0.5, 0.4i hx2 , 0.5, 0.4, 0.3i , hx3 , 0.5, 0.4, 0.7i }
Definition 3.9:
Let A F N (U ) and , , [0, 1] with + + 3 with (, , ) level set of A denoted
by A() is defined as
A() = {x U/TA (x) , IA (x) , FA (x) }
We define
A = {x U/TA (x) }
A+ = {x U/TA (x) > }
the level cut and strong level cut of truth function generated by A.
A = {x U/IA (x) }
A+ = {x U/IA (x) > }
the level cut and strong level cut of indeterminacy function generated by A.
and
A = {x U/FA (x) }
A+ = {x U/FA (x) < }
the level cut and strong level cut of false value function generated by A.
Similarly, We can define other types level cuts
A(+,+,+) = {x U/TA (x) > , IA (x) > , FA (x) < } which is ( + + +) level cut set
of A.
A(+,,) = {x U/TA (x) > , IA (x) , FA (x) }
A(,+,) = {x U/TA (x) , IA (x) > , FA (x) }
A(,,+) = {x U/TA (x) , IA (x) , FA (x) < }
Like wise other level cuts can be defined.
Theorem 3.10:
The level cut sets of Fuzzy Neutrosophic sets satisfy the following properties A, B
F N (U ),
, , [0, 1] with + + 3
1 , 1 , 1 [0, 1] with 1 + 1 + 1 3

8
2 , 2 , 2 [0, 1] with 2 + 2 + 2 3
1) A(,,) = A
0

2) (A ) = (A )+ : (A ) = (A )(1 +); (A ) = (A )+



T

3)

Ai

iJ

(Ai )

iJ


T

Ai =

(Ai )

iJ

iJ


T

Ai

iJ

(Ai )

iJ


S

5)

Ai

iJ

(Ai )

iJ


S

Ai =

(Ai )

iJ

iJ


S

Ai

(Ai )

iJ

iJ

(,,)


S

6)

Ai
(,,)


T

(Ai )(,,)

iJ

iJ

7)

Ai

iJ

(Ai )(,,)

iJ

8) For 1 2
A1 A2 ;

1 2

A1 A2

1 2
A1 A2

A(1 ,1 ,1 ) A(2 ,2 ,2 )
Proof
1) and 3) follow directly from definition 3.9
2) Since A = {hx, FA (x), 1 IA (x), TA (x)i/x U }
0

(A ) = {x U/FA (x) }
By definition,
A+ = {x U/FA (x) < }
A+ = {x U/FA (x) }

9
( A) = (A+ )
Similarly we can prove,
( A) = (A1+ )
+ )
( A) = (A

T
V
V
W
4)
Ai = hx,
TAi (x),
IAi (x),
FAi (x)i/x U
iJ
iJ
iJ


 iJ

T
V
T
We have
Ai
= x U/
TAi (x) ={x U/TAi (x) } =
(Ai )
iJ

iJ

iJ

Similarly,




T
V
T
IAi (x) = {x U/IAi (x) i J} =
(Ai ) and
Ai = x U/
iJ
iJ
iJ  

T
T
W
Ai
= x U/
FAi (x) = {x U/FAi (x) i J} =
(Ai )
iJ

iJ

iJ

We

 
 

 canconclude
,,
T
T
T
T
T
T
Ai
Ai
Ai = ((Ai ) (Ai ) (Ai ) ) = (Ai )(,,)
Ai
=
iJ

iJ

iJ

iJ

iJ

iJ

5) We know


V
W
W
S
FAi (x)i/x U
IAi (x),
TAi (x),
(Ai ) = hx,
iJ

iJ

iJ


S

Ai

iJ

x U/

TAi (x)

Ai =


=

x U/

TAi (x) , i J


Ai

(Ai )

iJ


W

x U/

IAi (x)

= {x U/IAi (x) , i J} =

iJ

iJ

iJ

W
iJ


S

iJ

(Ai )

iJ



S
V
(Ai )
FAi (x) = {x U/FAi (x) , i J} =
= x U/

iJ

iJ

iJ

6) For any x A , according to definition(*) we have for TA (x) 1 2 , we obtain

A1 A2 .
Similarly for 1 2 and 1 2 we obtain A1 A2 and A1 A2 .
Hence we have,
A(1 ,1 ,1 ) A(2 ,2 ,2 ) .
Corollary 3.11:
Assume that R is a Fuzzy Neutrosophic relation in U,
R = {(x, y) U U/TR (x, y) }
R (x) = {y U/TR (x, y) }
R+ = {(x, y) U U/TR (x, y) > }
R+ (x) = {y U/TR (x, y) > }

10

R = {(x, y) U U/IR (x, y) }

R(x) = {y U/IR (x, y) }
R+ = {(x, y) U U/IR (x, y) > }
R+(x) = {y U/IR (x, y) > }
R = {(x, y) U U/FR (x, y) }
R (x) = {y U/FR (x, y) }
R+ = {(x, y) U U/FR (x, y) < }
R+ (x) = {y U/FR (x, y) < }
R(,,) = {(x, y) U U/TR (x, y) , IR (x, y) , FR (x, y) }
R(,,) (x) = {y U/TR (x, y) , IR (x, y) , FR (x, y) }
Then for all R , R+ , R, R+, R , R+ , R() are crisp relation in U and
1) If R is reflexive then the above level cuts are reflexive.
2) If R is symmetric then the above level cuts are symmetric.
3) If R is transitive then the above level cuts are transitive.
Proof
Since R is a crisp reflexive x U, , , [0, 1]
Take, TR (x, x) = 1

IR (x, x) = 1

FR (x, x) = 0

xU

Now, we have R is a crisp binary relation in U and x U , (x, x) R . R is reflexive.

If R is symmetric then x, y U , we have (x, y) R (y, x) R . R is symmetry.
Similarly we can prove R and R are symmetric.
If R is transitive then x, y, z U and , , [0, 1]
TR (x, z) TR (x, y) TR (y, z)
IR (x, z) IR (x, y) IR (y, z)
FR (x, z) FR (x, y) FR (y, z)
for any (x, y) R
(x, y) R
00

00

(x , y )

(y, z) R

(y , z ) R
00

00

(y , z ) R

(ie) TR (x, y) , TR (y, z) TR (x, z)

0

IR (x , y ) , IR (y , z ) IR (x , z )
00

00

00

00

FR (x , y ) , FR (y , z )

00

00

FR (x , z )

Therefore R , R, R are transitive.

Hence R(,,) is transitive.
Similarly we can prove other level cuts sets are transitive.

11
Theorem 3.12:
Let (U,R) be a fuzzy neutrosophic approximation space and A FN(U), then the upper
FN approximation operator can be represented as follows x U .





W 
(A )(x) = W R
(A+ )(x) = W R
+ (A )(x) =
1) TR(A)
(x) =
R

[0,1]
[0,1]
[0,1]

W 
+ (A+ )(x)
R
[0,1]




W 
W 
W 

2) IR(A)
(x) =
R(A)(x)
=
R(A+)(x)
=
R+(A)(x)
=

[0,1]
[0,1]
[0,1]

W 

R+(A+)(x)
[0,1]






V 
(A )(x) = V R
(A+ )(x) = V R
+ (A )(x) =
3)FR(A)
(x) =
R

[0,1]
[0,1]
[0,1]

V 
+
+

R (A )(x)
[0,1]

and more over for any [0, 1]






+ (A+ ) R
(A ) R(A)

4) R(A)
R
+






5) R(A)
+ R+(A+)
R(A)
R(A)


+



6) R(A)
R+ (A+ ) R (A ) R(A)





+ (A+ ) R
(A ) R(A)

7) R(A)
R
+






8) R(A)
+ R+(A+)
R(A)
R(A)


+



9) R(A)
R+ (A+ ) R (A ) R(A)
Proof
1) For x U, we have



W 
(A )(x) = Sup [0, 1]/x R
(A )
R
[0,1]

= Sup { [0, 1]/R (x) A 6= }

= Sup { [0, 1]/y U (y R (x), y A )}
= Sup { [0, 1]/y U [TR (x, y) , TA (y) ]}
W
=
(x)
[TR (x, y) TA (y)] = TR(A)

yU

2)

W 




R(A)(x)
= Sup [0, 1]/x R(A)

[0,1]

= Sup { [0, 1]/R(x) A 6= }

12
= Sup { [0, 1]/y U (y R(x), y A)}
= Sup { [0, 1]/y U [IR (x, y) , IA (y) ]}
W
=
[IR (x, y) IA (y)] = IR(A)
(x)

yU

3)

W 


(A )(x) = inf { [0, 1]/R (x) A 6= }
R

[0,1]

= inf { [0, 1]/R (x) A 6= }

= inf { [0, 1]/y U (y R (x), y A )}
= inf { [0, 1]/y U [FR (x, y) , FA (y) ]}
V
=
[FR (x, y) FA (y)] = FR(A)
(x)

yU

Like wise we can conclude






W 
(A+ )(x) = W R
+ (A )(x) = W R
+ (A+ )(x)
TR(A)
(x) =
R

[0,1]
 [0,1]
 [0,1]

W 
W 
W 

IR(A)
(x) =
R(A+)(x)
=
R+(A)(x)
=
R+(A+)(x)

[0,1]
[0,1]
[0,1]





V 
+ (A+ )(x)
+ (A )(x) = V R
(A+ )(x) = V R
FR(A)
R
(x) =

[0,1]

[0,1]

[0,1]

+ (A+ ) R
+ (A ) R (A )
4) Since R

We prove only [R(A)]

+ R+ (A+ ) and R (A ) [R(A)]

For any x [R(A)]

+
TR(A)
>

W
0
0
[TR (x, y) TA (y)] > y U 3 TR (x, y ) TR (y ) >

yU
0

y R+ (x) and y A+
R+ (x) A+ 6=
+ (A+ )
From the definition of upper crisp approximation operator we have x R

Hence [R(A)]
+ R+ (A+ )
(A ) [R(A)]
Next, to prove R
(A ), R (A )(x) = 1
For any x R
If , then
TR(A)
(x) =

W 


(A )(x) R
(A )(x) =
R

[0,1]

We obtained x [R(A)]

R (A ) [R(A)]
5) Similar to (4) It is easy to prove

R+(A+)
R+(A)
R(A)
Hence we prove

13

i)[R(A)]+
R+(A+)

ii)R(A)
[R(A)]

i) For x [R(A)]+,
IR(A)
(x) >

[IR (x, y) IA (y)] >

yU
0

y U 3 IR (x, y ) IA (y ) >
0

(ie) IR (x, y ) and IA (y )

0

y R + (x) and y A+
0

y R(x) A+ R + (x) A+ 6=
By the definition of crisp approximation operator we have
x R+(A+)

Therefore [R(A)]+
R+(A+)

Next for any x R(A), R(A)(x)

=1
If then
TR(A)
(x) =


W 
(A )(x) R(A)(x)

R
=
[0,1]

We obtain x [R(A)]
Therefore R(A) [R(A)]
6) The proof of (6) is similar to (4) and (5) we need to prove only

[R(A)]+ R+ (A+ ) and R (A ) [R(A)]

V
+ , F

For any x [R(A)]

(x) < (ie)
[FR (x, y) FA (y)] <

R(A)

yU
0

y U 3 FR (x, Y ) FA (y ) <
0

Hence FR (x, Y ) < , TA (y ) <

0

(ie) y R+ (x) and y A+

R+ (x) A+ 6=
Therefore x R+ (A+ )
+ R+ (A+ )

[R(A)]
Next for any x R (A ) note R (A )(x) = 1 then we have
i
V h
FR(A)
(x) =
R (A )(x) R (A )(x) =

[0,1]
. Hence R (A ) [R(A)]

Thus x [R(A)]

The proof of (7), (8), (9) can be obtained similar to (4), (5), (6).
Theorem 3.13:
Let (U,R) be FN approximation space and A F N (U ) then x U
1)TR(A) (x) =

V
[0,1]

[ (1 R (A+ )(x))] =

V
[0,1]

[ (1 R (A )(x))]

14
[ (1 R+ (A+ )(x))] =

V
[0,1]

[ (1 R+ (A )(x))]

V
[0,1]

2) IR(A) (x) =

i
V h
(1 R(1 )(A+)(x)) =
[0,1]

V h

[ (1 R(1 )(A)(x))]

[0,1]

i
(1 R(1 +)(A+)(x)) =

[0,1]

[ (1 R(1 +)(A)(x))]

[0,1]

3) FR(A) (x) =


W 
(1 R (A+ )(x)) =
[0,1]

W h

i
(1 R+ (A+ )(x)) =

[0,1]

[ (1 R (A )(x))]

[0,1]

[ (1 R+ (A )(x))]

[0,1]

and for [0, 1]

4)[R(A)]+ R (A+ ) R+ (A+ ) R+ (A ) [R(A)]
5)[R(A)] + R1 (A+) R1 +(A+) R1 +(A) [R(A)]
6)[R(A)]+ R (A+ ) R+ (A+ ) R+ (A ) [R(A)]
7)[R(A)]+ R (A+ ) R+ (A ) R+ (A ) [R(A)]
8)[R(A)] + R1 +(A+) R(A+) R(1 +)(A) [R(A)]
9)[R(A)]+ R (A+ ) R (A ) R+ (A ) [R(A)]

References
[1] I.Arockiarani and I.R.Sumathi, (, , )-Cut Fuzzy Neutrosophic Soft Sets, International
Journal of Mathematical Archieve, 4(10) (2013), 225-238.
[2] K.Atanassov, Intuitionistic fuzzy sets, Fuzzy sets and systems, 20 (1986), 87-96.
[3] K. T. Atanassov, Remarks on the intuitionistic fuzzy sets, Fuzzy sets and systems, 75(3)
(1995), 401-402.
[4] W.Bandler and L.Kohout, Semantics of implication operators and fuzzy relational products., International journal of man-machine studies, 12 (1980), 89-116.

15
[5] D. Boixader, J.Jacas and J. Recasens, Upper and lower approximations of fuzzy set,
International journal of general systems, 29 (2000), 555-568.
[6] D. Dubois and H.Parade, Rough fuzzy sets and fuzzy rough sets, International journal of
general systems, 17 (1990), 191-209.
[7] T. Y.Lin and Q. Liu, Rough approximate operators: axiomatic rough set theory. In: W.
Ziarko, ed., Rough sets fuzzy sets and knowledge discovery. Berlin: Springer, (1994),
256-260.
[8] S. Nanda and Majunda, Fuzzy rough sets, Fuzzy sets an systems, 45 (1992), 157-160.
[9] Z. Pawlak, Rough sets, International Journal of Computer & Information Sciences, 11(5)
(1982), 145-172.
[10] Z. Pawlak, Rough Sets-Theoretical Aspects to Reasoning about Data, Kluwer Academic
Publisher, Boston, Mass, USA,(1991).
[11] M. Shabir, M. I. Ali, and T. Shaheen, Another approach to softrough sets, KnowledgeBased Systems,40 (2013), 2-80
[12] F.Smarandache, Neutrosophy and Neutrosophic Logic, First International Conference
on Neutrosophy, Neutrosophic Logic, Set, Probability and Statistics University of New
Mexico, Gallup, NM 87301, USA, (2000).
[13] F.Smarandache, Neutrosophic set, a generialization of the intuituionistics fuzzy sets,
Inter.J.Pure Appl.Math,24 (2005), 287-297.
[14] Sun and W. Ma, Soft fuzzy rough sets and its application indecision making, Artificial
Intelligence Review,41 (2014), 67-80.
[15] Y. Y. Yao, Combination of rough and fuzzy sets based on level sets. In:T.Y.Lin and
N.Cercone,eds., Rough sets and data mining:analysis for imprecise data. Boston: Kluwer
Academic Publishers , (1997), 301-321
[16] Y. Y. Yao, Constructive and algebraic methods of the theory of rough sets, Information
Sciences,109(4) (1998), 4-47.
[17] Y. Y. Yao, Relational interpretations of neighbourhood operators and rough set approximation operators., Information Sciences,111) (1998), 239-259.
[18] L. A. Zadeh, Fuzzy sets, Information and Control,8(3) (1965), 338-353

16
[19] L.Zhou and W.Wu, On generalized intuitionistic fuzzy rough approximation operatos,
Information Sciences,178 (2008), 2448-2465.