Beruflich Dokumente
Kultur Dokumente
2, 2015 283
Los Angeles
Abstract:
A neutrosophic set is a part of neutrosophy that studies the origin, nature and scope of
neutralities as well as their interactions with different ideational spectra. In this paper the
concepts of interval valued neutrosophic sets ( IVNS in short), interval valued
nutrosophic soft sets ( IVNSS in short) are proposed. The basic properties of IVNS ,
IVNSS are also presented and discussed.
Keywords:
Soft set, neutrosophic set, neutrosophic soft set, IVNS , IVNSS .
1. Introduction
Molodstov [7] introduced soft set theory which is a completely new approach for
modeling vagueness and uncertainties. Research works on soft set theory are progressing
rapidly. Maji et al. [5] defined several operations on soft set theory. Based on the
analysis of several operations on soft sets introduced in [5], Ali et al. [1] presented some
new algebraic operations for soft sets and proved that certain De Morgan’s law holds in
soft set theory with respect to these new definitions. Smarandache [10] introduced the
concept of neutrosophic set which is a mathematical tool for handling problems
involving imprecise, indeterminacy and inconsistent data. Maji [6] introduced the
concept of neutrosophic soft set and established some operations on these sets. In this
paper the concept of interval valued neutrosophic sets ( IVNS in short), interval valued
neutrosophic soft sets ( IVNSS in short) are propsed. The basic properties of IVNS
and IVNSS are also presented and discussed.
2. Preliminaries
Definition 2.1 [7]. Let U be an initial universe and E be a set of parameters. Let
P (U ) denotes the power set of U and A Õ E . Then the pair (F , A ) is called a soft set
over U , where F is a mapping given by F : A Æ P (U ) .
Definition 2.4 [6]. Let (H , A ) and (G, B ) be two neutrosophic soft sets over the
common universe U . Then the union of (H , A) and (G, B ) is denoted by
‘ (H , A ) » (G, B ) ’ and is defined by (H , A) » (G, B ) = (K , C ) , where C = A » B and
the truth-membership, indeterminacy-membership and falsy-membership of (K , C ) are
as follows:
Ï
ÔTH (e) (m ) if e Œ A - B
Ô
TK (e) (m ) = ÌTG(e) (m ) if e Œ B - A
Ô
(
Ômax TH (e) (m ) , TG(e) (m )
Ó ) if e Œ A « B
Ï
ÔI H (e) (m ) if e Œ A - B
Ô
I K (e) (m ) = ÌI G(e) (m ) if e Œ B - A
Ô
( )
Ô I H (e) (m ) + I G(e) (m ) 2 if e Œ A « B
Ó
286 Anjan Mukherjee, Mithun Datta and Abhijit Saha
Ï
ÔFH (e) (m ) if e Œ A - B
Ô
FK (e) (m ) = ÌFG(e) (m ) if e Œ B - A
Ô
(
Ômin FH (e) (m ) , FG(e) (m )
Ó ) if e Œ A « B
Definition 2.5 [6]. Let (H , A ) and (G, B ) be two neutrosophic soft sets over the
common universe U . Then the intersection of (H , A ) and (G, B ) is denoted by
‘ (H , A ) « (G, B ) ’ and is defined by (H , A ) « (G, B ) = (K , C ) , where C = A « B and
the truth-membership, indeterminacy-membership and falsity-membership of (K , C ) are
as follows:
(
TK (e) (m ) = min TH (e) (m ) , TG(e) (m ) , )
I H (e ) ( m ) + I G (e ) ( m )
I K (e) (m ) =
2
(
FK (e) (m ) = max FH (e) (m ) , FG(e) (m ) "e Œ C . )
Definition 2.6 [6]. The complement of a neutrosophic soft set (F , A ) is denoted by
( F , A )c and is defined as (F , A ) = F c ,A , where F c :A Æ P (U ) is a mapping
( )
c
given by F (a ) = neutrosophic soft complement with TF (x) = FF (x) , I F (x) = I F (x) and
c
c c
FF (x) = TF (x) .
c
A= { x, m A (x ) , g A (x ) , d A (x ) : x ŒU , }
where mA , g A , d A : U Æ Int ˘˚ - 0,1+ ÈÎ are functions such that the condition: "x Œ U ,
-
0 £ sup mA (x ) + sup g A (x ) + sup d A (x) £ 3+ is satisfied.
In real life applications it is difficult to use interval valued neutrosophic set with
interval-value from real standard or non-standard subsets of Int ˘˚ - 0,1+ ÈÎ . Hence we ( )
consider the interval valued neutrosophic set which takes the interval-valued from the
subset of Int ([0,1]) (where Int [0,1] ) denotes the set of all closed sub intervals of [0,1] ).
The set of all interval valued neutrosophic sets on U is denoted by IVNS U .
In this section we introduce the concept of interval valued neutrosophic soft set and
study their basic properties.
Interval Valued Neutrosophic Soft Sets 287
U e1 e2
h1 ([.2,.4] , [.3,.5] , [.6,.8]) ([.2,.3] , [.5,.6] , [.7,.8])
h2 ([.5,.7] , [.2,.4] , [.3,.6]) ([.7,.9] , [.2,.3] , [.1,.2])
h3 ([.4,.6] , [.1,.3] , [.4,.5]) ([.5,.7] , [.4,.6] , [.2,.3])
h4 ([.6,.8] , [.4,.6] , [.1,.2]) ([4,.5] , [.1,.3] , [.4,.7])
h5 ([.5,.9] , [.5,.6] , [.2,.4]) ([.2,.3] , [.4,.6] , [.2,.5])
e3 e4
([.5,.8] , [.1,.2] , [.3,.4]) ([.1,.3] , [.4,.6] , [.1,.2])
([.2,.3] , [.6,.8] , [.5,.7]) ([.3,.6] , [.2,.4] , [.5,.9])
([.4,.6] , [.3,.5] , [.7,.8]) ([.4,.7] , [.1,.3] , [.3,.6])
([.4,.7] , [.2,.3] , [.4,.5]) ([.2,.3] , [.5,.6] , [.7,.8])
([.1,.4] , [.5,.6] , [.1,.4]) ([.5,.8] , [.1,.2] , [.3,.5])
Analogues to Maji’s [6] definitions, we define the following definitions.
Ï mf e (x ) if e Œ A - B
ÔÔ ( )
mh (e) (x) = Ì mg (e) (x) if e Œ B - A
Ô
ÔÓ mf (e) (x ) ⁄ mg (e) (x) if e Œ A « B
Ïg f e (x ) if e Œ A - B
ÔÔ ( )
g h (e) (x) = Ìg g (e) (x) if e Œ B - A
Ô
ÔÓg f (e) (x )g g (e) (x) if e Œ A « B
Ïd f e (x ) if e Œ A - B
ÔÔ ( )
d h (e) (x) = Ìd g (e) (x) if e Œ B - A
Ô
ÔÓd f (e) (x ) Ÿ d g (e) (x) if e Œ A « B
where for x Œ U
mA (x) ⁄ mB (x) = ÈÎ max (inf mA (x) ,inf mB (x)) , max (sup mA (x) ,sup mB (x))˘˚
d A (x) Ÿ d B (x) = ÈÎ min (inf d A (x) ,inf d B (x)) , min (sup d A (x) ,sup d B (x))˘˚
mh (e) (x) = mf (e) (x) Ÿ mg (e) (x) , g h (e) (x) = g f (e) (x)g g (e) (x) and d h (e) (x) = d f (e) (x) ⁄
d g (e) (x) where for x Œ U
mA (x) Ÿ mB (x) = ÈÎ min (inf mA (x) ,inf mB (x)) , min (sup mA (x) ,sup mB (x))˘˚
d A (x) ⁄ d B (x) = ÈÎ max (inf d A (x) ,inf d B (x)) , max (sup d A (x) ,sup d B (x))˘˚
by f (a ) =
c
{ x,d f (a ) (x) ,g f (a) (x) , mf (a) (x) : x ŒU } for a Œ A .
Interval Valued Neutrosophic Soft Sets 289
U e1 e2 e3
h1 ([.2,.4] , [.3,.5] , [.6,.8]) ([.2,.3] , [.5,.6] , [.7,.8]) ([.5,.8] , [.1,.2] , [.3,.4])
h2 ([.5,.7] , [.2,.4] , [.3,.6]) ([.7,.9] , [.2,.3] , [.1,.2]) ([.2,.3] , [.6,.8] , [.5,.7])
h3 ([.4,.6] , [.1,.3] , [.4,.5]) ([.5,.7] , [.4,.6] , [.2,.3]) ([.4,.6] , [.3,.5] , [.7,.8])
h4 ([.6,.8] , [.4,.6] , [.1,.2]) ([.4,.5] , [.1,.3] , [.4,.7]) ([.4,.7] , [.2,.3] , [.4,.5])
h5 ([.5,.9] , [.5,.6] , [.2,.4]) ([.2,.3] , [.4,.6] , [.2,.5]) ([.1,.4] , [.5,.6] , [.1,.4])
Let B = {e1 (expensive ) , e4 (ingreensurroundings )} .
Then the tabular representation of an IVNSS (G, B ) can be given by:
U e1 e4
h1 ([.3,.7] , [.4,.8] , [.6,.9]) ([.1,.3] , [.4,.6] , [.1,.2])
h2 ([.2,.4] , [.5,.7] , [.6,.8]) ([.3,.6] , [.2,.4] , [.5,.9])
h3 ([.7,.8] , [.2,.3] , [.5,.7]) ([.4,.7] , [.1,.3] , [.3,.6])
h4 ([.2,.9] , [.3,.6] , [.5,.6]) ([.2,.3] , [.5,.6] , [.7,.8])
h5 ([.2,.8] , [.7,.9] , [.6,.8]) ([.5,.8] , [.1,.2] , [.3,.5])
Let (f , A ) » (G, B ) = (h, C ) then C = {e1 , e2 , e3 , e4 } . Then tabular representation of
the IVNSS (h, C ) is:
U e1 e2 e3
h1 ([.3,.7] , [.35,.65] , [.6,.8]) ([.2,.3] , [.5,.6] , [.7,.8]) ([.5,.8] , [.1,.2] , [.3,.4])
h2 ([.5,.7] , [.35,.55] , [.3,.6]) ([.7,.9] , [.2,.3] , [.1,.2]) ([.2,.3] , [.6,.8] , [.5,.7])
h3 ([.7,.8] , [.15,.3] , [.4,.5]) ([.5,.7] , [.4,.6] , [.2,.3]) ([.4,.6] , [.3,.5] , [.7,.8])
h4 ([.6,.9] , [.35,.6] , [.1,.2]) ([.4,.5] , [.1,.3] , [.4,.7]) ([.4,.7] , [.2,.3] , [.4,.5])
h5 ([.5,.9] , [.6,.75] , [.2,.4]) ([.2,.3] , [.4,.6] , [.2,.5]) ([.1,.4] , [.5,.6] , [.1,.4])
e4
([.1,.3] , [.4,.6] , [.1,.2])
([.3,.6] , [.2,.4] , [.5,.9])
290 Anjan Mukherjee, Mithun Datta and Abhijit Saha
U e1
h1 ([.2,.4] , [.35,.65] , [.6,.8])
h2 ([.2,.4] , [.35,.55] , [.6,.8])
h3 ([.4,.6] , [.15,.3] , [.5,.7])
h4 ([.2,.8] , [.35,.6] , [.5,.6])
h5 ([.2,.8] , [.6,.75] , [.6,.8])
The tabular representation of the IVNSS (f , A ) is:
c
U e1 e2 e3
h1 ([.6,.8] , [.3,.5] , [.2,.4]) ([.7,.8] , [.5,.6] , [.2,.3]) ([.3,.4] , [.1,.2] , [.5,.8])
h2 ([.3,.6] , [.2,.4] , [.5,.7]) ([.1,.2] , [.2,.3] , [.7,.9]) ([.5,.7] , [.6,.8] , [.2,.3])
h3 ([.4,.5] , [.1,.3] , [.4,.6]) ([.2,.3] , [.4,.6] , [.5,.7]) ([.7,.8] , [.3,.5] , [.4,.6])
h4 ([.1,.2] , [.4,.6] , [.6,.8]) ([.4,.7] , [.1,.3] , [.4,.5]) ([.4,.5] , [.2,.3] , [.4,.7])
h5 ([.2,.4] , [.5,.6] , [.5,.9]) ([.2,.5] , [.4,.6] , [.2,.3]) ([.1,.4] , [.5,.6] , [.1,.4])
((f , A) « ( g, A)) = (f , A) « ( g, A)
c c c
(3) for B = A
{ x, m f (a ) ( x ) , g f (a ) ( x ) , d f (a ) ( x ) : x ŒU } for a Œ A , g (b ) = { x, m g (b ) ( x ) , g g (b ) ( x ) ,
d g (b ) ( x ) : x Œ U } for b ŒB h (c ) = { x, m (x) , gh (c ) h (c ) ( x ) , d h (c ) ( x ) : x ŒU } for c ŒC
respectively.
(1)-(2) Straight forward.
{ x, m s(e ) (x) ,g s(e) (x) , d s(e) (x) : x ŒU } where ms(e) (x) = mf (e) (x) ⁄ mg (e) (x) g s(e) (x) =
g f (e) (x)g g (e) (x) , d s(e) (x) = d f (e) (x) Ÿ d g (e) (x) Now ((f , A) » ( g, A)) = (s, A) = (s ,A)
c c c
{
where f c (e ) = x, d f (e) (x) , g f (e) (x) , mf (e) (x) : x Œ U } for e ŒA ,and ( g, A)c = ( g c ,A)
where g c (e ) = { x,d g (e ) (x) ,g g(e) (x) , mg (e) (x) : x ŒU } for e ŒA , \ (f , A ) « ( g, A )
c c
= ( t,A ) (Say) where t (e ) = { x,d f (e ) (x) Ÿ d g (e) (x) ,g f (e) (x)g g (e) (x) , mf (e) (x) ⁄
}
mg (e) (x) : x Œ U for e ŒA . Consequently ((f , A) » (g, A)) = (f , A) « (g, A)
c c c
.
(4) Similar to (3).
(5) Let (f , A ) » ( g, B ) = (s, D ) and D = A » B . Then for x Œ U and d Œ D
Ï mf d (x ) if d Œ A - B
ÔÔ ( )
ms(d) (x) = Ì mg (d) (x) if d Œ B - A ,
Ô
ÔÓ mf (d) (x ) ⁄ mg (d) (x) if d Œ A « B
Ïg f d (x ) if d Œ A - B
ÔÔ ( )
g s(d) (x) = Ìg g (d) (x) if d Œ B - A
Ô
ÔÓg f (d) (x )g g (d) (x) if d Œ A « B
Ïd f d (x ) if d Œ A - B
ÔÔ ( )
d s(d) (x) = Ìd g (d) (x) if d Œ B - A
Ô
ÔÓd f (d) (x ) Ÿ d g (d) (x) if d Œ A « B
Ï mf ( e ) ( x ) if e Œ A - B - C
Ô
Ô m g (e ) ( x ) if e Œ B - C - A
Ô
Ô mh ( e ) ( x ) if e Œ C - A - B
Ô
mt(e) (x) = Ì mf (e) (x) ⁄ mg (e) (x) if e Œ (A « B ) - C
Ô
Ô m g ( e ) ( x ) ⁄ mh ( e ) ( x ) if e Œ (B « C ) - A
Ô m (x ) ⁄ m (x ) if e Œ (C « A ) - B
Ô h (e ) f (e )
Ô m (x ) ⁄ m (x ) ⁄ m (x ) if e Œ A « B « C
Ó f (e ) g (e ) h (e )
Ïg f (e) (x) if e Œ A - B - C
Ô
Ôg g (e) (x) if e Œ B - C - A
Ô
Ôg h(e) (x) if e Œ C - A - B
Ô
g t(e) (x) = Ìg f (e) (x)g g (e) (x) if e Œ (A « B ) - C
Ô
Ôg g (e) (x)g h (e) (x) if e Œ (B « C ) - A
Ôg (x)g (x) if e Œ (C « A ) - B
Ô h (e ) f (e )
Ïd f (e) (x) if e Œ A - B - C
Ô
Ôd g (e) (x) if e Œ B - C - A
Ô
Ôd h(e) (x) if e Œ C - A - B
Ô
d t(e) (x) = Ìd f (e) (x) Ÿ d g (e) (x) if e Œ (A « B ) - C
Ô
Ôd g (e) (x) Ÿ d h (e) (x) if e Œ (B « C ) - A
Ôd (x) Ÿ d (x) if e Œ (C « A ) - B
Ô h (e ) f (e )
Ïg g j (x) if j Œ B - C
ÔÔ ( )
g u( j) (x ) = Ìg h ( j) (x) if j Œ C - B
Ô
ÔÓg g ( j) (x)g h( j) (x) if j Œ B « C
Interval Valued Neutrosophic Soft Sets 293
Ïd g j (x) if j Œ B - C
ÔÔ ( )
d u( j) (x) = Ìd h( j) (x) if j Œ C - B
Ô
ÔÓd g ( j) (x) Ÿ d h( j) (x) if j Œ B « C
Ï mf (k) (x) if k Œ A - B - C
Ô
Ô mg (k) (x) if k Œ B - C - A
Ô
Ô mh(k) (x) if k Œ C - A - B
Ô
mv (k) (x) = Ì mf (k) (x) ⁄ mg (k) (x) if k Œ (A « B ) - C
Ô
Ô mg (k) (x) ⁄ mh(k) (x) if k Œ (B « C ) - A
Ô m (x ) ⁄ m (x ) if k Œ (C « A ) - B
Ô h(k) f (k )
Ô m (x ) ⁄ m (x ) ⁄ m ( x ) if k Œ A « B « C
Ó f (k) g (k ) h (k )
Ïg f (k) (x) if k Œ A - B - C
Ô
Ôg g (k) (x) if k Œ B - C - A
Ô
Ôg h (k) (x) if k Œ C - A - B
Ô
g v (k) (x) = Ìg f (k) (x)g g (k) (x) if k Œ (A « B ) - C
Ô
Ôg g (k) (x)g h (k) (x) if k Œ (B « C ) - A
Ôg (x)g f (k) (x) if k Œ (C « A ) - B
Ô h (k)
Ó f (k) ( ) g (k) ( ) h(k) ( )
Ôg xg xg x if k Œ A « B « C
Ïd f (k) (x) if k Œ A - B - C
Ô
Ôd g (k) (x) if k Œ B - C - A
Ô
Ôd h (k) (x) if k Œ C - A - B
Ô
d v (k) (x) = Ìd f (k) (x) Ÿ d g (k) (x) if k Œ (A « B ) - C
Ô
Ôd g (k) (x) Ÿ d h(k) (x) if k Œ (B « C ) - A
Ôd (x) Ÿ d (x) if k Œ (C « A ) - B
Ô h (k) f (k )
References:
[1] M. I. Ali, F. Feng, X. Liu, W. K. Min and M. Shabir, On some new operations in soft set theory,
Computers and Mathematics with Applications, 57 (9), (2009), 1547-1553.
[2] M. I. Ali, A notes on soft sets, Rough sets and fuzzy soft sets, Applied Soft Computing, 11 (2011),
3329-3332.
[3] M. I. Ali, M. Shabir and Munzza Naz, Algebraic structures of soft sets associated with new operations,
Computers and Mathematics with Applications, 61 (2011), 2647-2654.
[4] K. Atanassov, Intuitionistic fuzzy sets, Fuzzy Sets and Systems, 20 (1986), 87-96.
[5] P. K. Maji, R. Biswas and A. R. Roy, Soft set theory, Computers and Mathematics with Applications,
45 (4-5) (2003), 555-562.
[6] P. K. Maji, Neutrosophic soft set, Annals of Fuzzy Mathematics and Informatics, 5 (1) (2013), 157-
168.
[7] D. Molodtsov, Soft set theory-first results, Computers and Mathematics with Applications, 37 (4-5)
(1999), 19-31.
[8] Z. Pawlak, Rough sets, International Journal of Computing and Information Sciences, 11 (1982),
341-356.
[9] D. Pei and D. Miao, From soft sets to information systeme, in: Granular computing, IEEE Inter. Conf.,
Vol 2, (2005), pp.617-621.
[10] F. Smarandache, Neutrosophic set-a generalization of the intuitionistic fuzzy sets, Int. J. Pure Appl.
Math., 24 (2005), 287-297.
[11] I. Turksen, Interval valued fuzzy sets based on normal forms, Fuzzy Sets and Systems, 20 (1986), 191-
210.
[12] H. Wang, F. Smarandache, Y. Q. Zhang and R. Sunderraman, Interval neutrosophic sets and logic:
Theory and applications in computing, Hexis; Neutrosophic Book Series, No: 5, (2005).
[13] L. A. Zadeh, Fuzzy sets, Information and Control, 8 (1965), 338-353.
[14] L. A. Zadeh, The concept of a linguistic variable and its application to approximate reasoning-I,
Inform. Sci., 8 (1975), 199-249.