Professional Documents
Culture Documents
Abstract: In this paper we introduce the notion of interval valued hesitant fuzzy soft topological space. Also the concepts of
interval valued hesitant fuzzy soft closure; interior and neighbourhood are introduced here and established some important results.
Keywords: Fuzzy soft sets; Interval-valued hesitant fuzzy sets; Interval-valued hesitant fuzzy soft sets; Interval-valued hesitant
fuzzy soft topological space.
AMS subject classification no: 03E72.
__________________________________________________*****_________________________________________________
1. Introduction
The concept of interval arithmetic was first suggested by Dwyer [10] in 1951. Chiao.[9] introduced sequence of interval numbers
and defined usual convergence of sequences of interval number. A set is called an interval number if it consisting of a closed
interval of real numbers x such that a x b . A real interval can also be considered as a set. Thus we can investigate some
properties of interval numbers, for instance arithmetic properties or analysis properties. We denote the set of all real valued closed
intervals by IR. Any elements of IR is called closed interval and denoted by x. That is x {x : a x b }. An interval
number x is a closed subset of real numbers (see [9]). Let x1 and xr be first and last points of x interval number, respectively.
For x1 , x2 IR, we have x1 x2 x1l x2l , x1r x2r . x1 x2 {x : x1l x2l x x1r x2r }, and if 0,
then x {x : x1l x x1r } and if 0, then x {x : x1r x x1l } ,
x1.x2 {x : min{ x1l .x2l , x1l .x2r , x1r .x2l , x1r .x2r } x max{ x1l .x2l , x1l .x2r , x1r .x2l , x1r .x2r }}.
The most appropriate theory for dealing with uncertainties is the theory of fuzzy sets, introduced by L.A. Zadeh [31] in 1965. This
theory brought a paradigmatic change in mathematics. But there arise difficulty that how to set the membership function in each
particular case. The Hesitant fuzzy set, as one of the extensions of Zadeh [31] fuzzy set, allows the membership degree that an
element to a set presented by several possible values, and itcan express the hesitant information more comprehensively than other
extensions of fuzzyset. Torra and Narukawa [24] introduced the concept of hesitant fuzzy set. Xu and Xia [30] defined the
concept of hesitant fuzzy element, which can be considered as the basic unit ofa hesitant fuzzy set, and is a simple and effective
tool used to express the decision makers hesitant preferences in the process of decision making. So many researchers has done
lots of research work on aggregation, distance, similarity and correlation measures, clustering analysis, and decision making with
hesitant fuzzy information. Babitha and John [3] defined another important soft set i.e. Hesitant fuzzy soft sets. They introduced
basic operations such as intersection, union, compliment and De Morgan's law was proved. Chen et al. [8]extended hesitant fuzzy
sets into interval-valued hesitant fuzzy environment and introduced the concept of interval-valued hesitant fuzzy sets. Zhang et al.
[32] introduced some operations such as complement, "AND","OR", ring sum and ring product on interval-valuedhesitant fuzzy
soft sets.
There are many theories like theory of probability, theory of fuzzy sets, and theory of intuitionistic fuzzy sets, theory of rough sets
etc. which can be considered as mathematical tools for dealing with uncertain data, obtained in various fields of engineering,
physics, computer science, economics, social science, medical science, and of many other diverse fields. But all these theories
have their own difficulties. The theory of intuitionistic fuzzy sets (see[1, 2]) is a more generalized concept than the theory of fuzzy
sets, but this theory has the some difficulties. All the above mentioned theories are successful to some extent in dealing with
988
IJRITCC | May 2017, Available @ http://www.ijritcc.org
_______________________________________________________________________________________
International Journal on Recent and Innovation Trends in Computing and Communication ISSN: 2321-8169
Volume: 5 Issue: 5 988 1000
_______________________________________________________________________________________________
problems arising due to vagueness present in the real world. But there are also cases where these theories failed to give
satisfactory results, possibly due to inadequacy of the parameterization tool in them. As a necessary supplement to the existing
mathematical tools for handling uncertainty, Molodtsov [16] introduced the theory of soft sets as a new mathematical tool to deal
with uncertainties while modelling the problems in engineering, physics, computer science, economics, social sciences, and
medical sciences. Molodtsov et.al [17] successfully applied soft sets in directions such as smoothness of functions, game theory,
operations research, Riemann integration, Perron integration, probability, and theory of measurement. Maji et al [13] gave the first
practical application of soft sets in decision-making problems. Maji et al [14] defined and studied several basic notions of the soft
set theory. Also Cagman et al [6] studied several basic notions of the soft set theory. V. Torra[23, 24] and Verma and Sharma [25]
discussed the relationship between hesitant fuzzy setand showed that the envelope of hesitant fuzzy set is an intuitionistic fuzzy
set. Zhang et.al [32] introduced weighted interval-valued hesitant fuzzy soft sets and finally applied it indecision making problem.
The notion of topological space is defined on crisp sets and hence it is affected by differentgeneralizations of crisp sets like fuzzy
sets and soft sets. In 1968, C. L. Chang [7] introduced fuzzy topological space and in 2011, subsequently Cagman et al. [6] and
Shabir et al. [21]introduced fuzzy soft topological spaces and studied neighborhood. Mahanta et al. [12],Neog et al. [18] and Ray
et al. [20] introduced fuzzy soft topological spaces in different direction.
In this paper, in section 3, first we give a counter example of equality of IVHFSSs proposed by Zhang et al. [32]. Secondly we
point out that proposition 3.11 in a previous paper by Borah and Hazarika [4] true in general by counter example. Thirdly we
introduce about notion of topological space.
(ii) 1 2 , max{ 1 , 2 };
1 1 2 2
(iii) 1 2 , min{ 1 , 2 };
1 1 2 2
Definition2.6. [8] Let X be a reference set, and D[0, 1] be the set of all closed subintervalsof [0, 1]. An IVHFS on X is
F { hi , F (hi ) : hi X , i 1,2,..., n}, where F (hi ) : X D[0,1] denotes all possible interval-valued membership
989
IJRITCC | May 2017, Available @ http://www.ijritcc.org
_______________________________________________________________________________________
International Journal on Recent and Innovation Trends in Computing and Communication ISSN: 2321-8169
Volume: 5 Issue: 5 988 1000
_______________________________________________________________________________________________
degrees of the element hi X to theset F. For convenience, we call F (hi ) an interval-valued hesitant fuzzy element
(IVHFE),which reads F (hi ) { : F (hi )}.
Here [ , ] is an interval number. L inf and U sup
L U
represent the lower and upper limits of respectively.
An IVHFE is the basic unit of an IVHFS and it can be considered as a special case of the IVHFS. The relationship between
IVHFE and IVHFS is similar to that between interval-valued fuzzy number and interval-valued fuzzy set.
Example2.7. Let U {h1 , h2 } be a reference set and let F (h1 ) {[0.6,0.8], [0.2,0.7]} F (h2 ) {[0.1,0.4]} be the
IVHFEs of hi (i 1,2) to a set F, respectively. Then IVHFS F can be written as
F { h1 ,{[0.6,0.8],[0.2,0.7]} , h2 ,{[0.1,0.4]} }.
~ ~ ~
Definition2.8. [29] Let a~ [a~ L , a~U ] and b [b L , b U ] be two interval numbers and 0, then
(i) a~ b~ a~ L b~ L anda~U b~U ;
~ b~ [a~ L b~ L , a~U b~U ] ;
(ii) a
~ [a~ L , a~U ] ,especially a~ 0, if 0.
(iii) a
~ ~ ~ ~ ~
Definition2.9. [29] Let a~ [a~ L , a~U ] and b [b L , b U ] and let la a~U a~ L and lb b U b L ; then the degree of
~
a~ b is formulated by
possibility of
~
~ ~ b U a~ L
p(a b ) max{1 max( ,0),0}
la~ lb~
Above equation is proposed in order to compare two interval numbers and to rank all theinput arguments.
1
Definition2.10. [8] For an IVHFE ~, s( ~)
l ~
~~ ~ is called the score function of with l ~ being the number of the
interval values in ~ , and s( ~) is an interval value belongingto [0, 1]. For two IVHFEs 1 and 2 , if s(~1 ) s(~2 ) ,then
1 2 .We can judge the magnitude of two IVHFEs using above equation.
(iv) ~1 ~2 {[ 1L 2 L 1L . 2 L , 1U 2U 1U . 2U ] : ~1 ~1 , ~2 ~2 };
(v) ~ ~ {[ L . L , U . U ] : ~ ~ , ~ ~ };
1 2 1 2 1 2 1 1 2 2
Example2.14. Suppose U {h1 , h2 } be an initial universe and E {e1 , e2 , e3 , e4 } be aset of parameters. Let A {e1 , e2 }
.Then the hesitant fuzzy soft set FA is given as
FA {F (e1 ) { h1 ,{0.6,0.8} , h2 ,{0.8,0.4,0.9} }
F (e2 ) { h1 ,{0.9,0.1,0.5} , h2 ,{0.2} }}.
Definition2.15. [32] Let (U,E) be a soft universe and A E. Then FA is called an intervalvalued hesitant fuzzy soft set over U,
where F is a mapping given by F : A IVHF (U ). An interval-valued hesitant fuzzy soft set is a parameterized family of
interval-valued hesitantfuzzy subset of U. That is to say, F(e) is an interval-valued hesitant fuzzy subset in U, e A. Following
the standard notations, F(e) can be written as
~
F (e) { h, F (e)( x ) : h U }.
Example2.16. Suppose U {h1 , h2 } be an initial universe and E {e1 , e2 , e3 , e4 } be aset of parameters. Let A {e1 , e2 }
.Then the interval valued hesitant fuzzy soft set FA is given as
FA {e1 { h1 ,[0.6,0.8] , h2 ,[0.1,0.4] }
e2 { h1 ,[0.2,0.6],[0.3,0.9] , h2 ,[0.2,0.5],[0.2,0.8],[0.2,0.8] }}.
Definition2.17. [32] Let U be an initial universe and let E be a set of parameters. Supposing that ~ E, F and F are two
A, B A B
interval-valued hesitant fuzzy soft sets, one says that FA is an interval-valued hesitant fuzzy soft subset of GB if and only if
(i) A ~ B,
(k ) ~ (k )
(ii) 1 2
(k ) (k )
Where for all e ~ A,
1 and 2 stand for the kth largest interval number in theIVHFEs F ( e)( x ) and G ( e)( x ) respectively.
In this case, we write ~G .
FA A
991
IJRITCC | May 2017, Available @ http://www.ijritcc.org
_______________________________________________________________________________________
International Journal on Recent and Innovation Trends in Computing and Communication ISSN: 2321-8169
Volume: 5 Issue: 5 988 1000
_______________________________________________________________________________________________
Definition2.21. [4] The union of two interval-valued hesitant fuzzy soft sets FA and GB over (U,E), is the interval-valued
~ C,
hesitant fuzzy soft set H C , where C A B and, e
F ( e ) , ife
~ A B;
H ( e ) G ( e ) , ife ~ B A;
, ife ~ A B.
F (e) G(e)
~
We write FA GB H C .
Definition2.22. [4] The intersection of two interval-valued hesitant fuzzy soft sets FA and
GB with A B over (U,E), is the interval-valued hesitant fuzzy soft set H C , where
~ C,
C A B, and, e . We write F ~G H .
H ( e) F (e) G(e) A B C
In this section, first we give a counter example of equality of IVHFSSs proposed by Zhang et al. [32]. Secondly we point out that
proposition 3.11 in a previous paper by Borahand Hazarika [4] true in general by counter example. Thirdly we introduce about
notion oftopological space.
Definition3.1. [32] Let FA and GB be two interval-valued hesitant fuzzy soft sets. Now
FA and GB are said to be interval-valued hesitant fuzzy soft equal if and only if
~ G , (ii) G
(i) FA ~F ,
B B A
Hence
FA GA .
Proposition3.3. Let FA ,
GB and H C be three interval-valued hesitant fuzzy soft sets. Then the following are satisfied:
~ ~ ~ ~ ~
(i) FA (GB H C ) ( FA GB ) ( FA H C ),
~ ~ ~ ~ ~
(ii) FA (GB H C ) ( FA GB ) ( FA H C ).
Proof. We consider IVHFSSs.
FA {e1 { h1 ,[0.3,0.8] , h2 ,[0.3,0.8],[0.5,0.6],[0.3,0.6] },
e2 { h1 ,[0.2,0.9],[0.7,1.0] , h2 ,[0.8,1.0],[0.2,0.6] }}.
GB {e1 { h1 ,[0.7,0.9],[0.0,0.6] , h2 ,[0.4,0.7],[0.4,0.5] },
e2 { h1 ,[0.6,0.8] , h2 ,[0.3,0.8],[0.3,0.6] }
e3 { h1 ,[0.5,0.6],[0.3,0.6] , h2 ,[0.1,0.6],[0.3,0.9],[0.3,0.6] }}.
And
992
IJRITCC | May 2017, Available @ http://www.ijritcc.org
_______________________________________________________________________________________
International Journal on Recent and Innovation Trends in Computing and Communication ISSN: 2321-8169
Volume: 5 Issue: 5 988 1000
_______________________________________________________________________________________________
H C {e2 { h1 ,[0.4,0.6],[0.2,0.6],[0.7,1.0] , h2 ,[0.3,0.8] },
e3 { h1 ,[0.2,0.5],[0.3,0.5] , h2 ,[0.6,0.8],[0.2,0.5] }}.
(i) We have
~ G {e { h ,[0.3,0.8],[0.7,0.9] , h ,[0.4,0.6],[0.4,0.8],[0.5,0.7] },
FA B 1 1 2
e2 { h1 ,[0.6,0.9],[0.7,1.0] , h2 ,[0.3,0.6],[0.8,1.0] }
e3 { h1 ,[0.3,0.6],[0.5,0.6] , h2 ,[0.1,0.6],[0.3,0.9],[0.3,0.6] }}.
F ~ H {e { h ,[0.3,0.8] , h ,[0.3,0.6],[0.3,0.8],[0.5,0.6] },
A C 1 1 2
e2 { h1 ,[0.2,0.9],[0.7,1.0],[0.7,1.0] , h2 ,[0.3,0.8],[0.8,1.0] }
e3 { h1 ,[0.2,0.5],[0.3,0.5] , h2 ,[0.2,0.5],[0.6,0.8] }}.
~ G )
( FA ~ (F ~ H ) {e { h , [0.3,0.8], [0.3,0.8] , h , [0.3,0.6], [0.3,0.8], [0.5,0.6] },
B A C 1 1 2
~ H {e { h ,[0.2,0.6],[0.4,0.6],[0.6,0.8] , h ,[0.3,0.6],[0.3,0.8] },
GB C 2 1 2
Therefore,
~ (G
FA ~ H ) {e { h ,[0.3,0.8] , h ,[0.3,0.6],[0.3,0.8],[0.5,0.6] },
B C 1 1 2
e2 { h1 ,[0.2,0.9],[0.7,1.0],[0.7,1.0] , h2 ,[0.3,0.6],[0.8,1.0] }
e3 { h1 ,[0.2,0.5],[0.3,0.5] , h2 ,[0.1,0.5],[0.3,0.8],[0.3,0.6] }}
Hence
~ (G
FA ~ H ) (F ~ G )
~ (F ~ H ).
B C A B A C
~ G {e { h ,[0.0,0.6],[0.3,0.8] , h ,[0.3,0.5],[0.3,0.7],[0.4,0.6] },
FA B 1 1 2
(ii) We have,
e2 { h1 ,[0.2,0.8],[0.6,0.8] , h2 ,[0.2,0.6],[0.3,0.8] }}.
~
GB H C {e1 { h1 ,[0.0,0.6],[0.7,0.9] , h2 ,[0.4,0.5],[0.4,0.7],[0.4,0.7] },
e2 { h1 ,[0.6,0.8],[0.6,0.8],[0.7,1.0] , h2 ,[0.3,0.8],[0.3,0.8] }
e3 { h1 ,[0.3,0.6],[0.5,0.6] , h2 ,[0.2,0.6],[0.6,0.9],[0.6,0.8] }}.
Therefore,
~ (G
FA ~ H ) {e { h ,[0.0,0.6],[0.3,0.8] , h ,[0.3,0.5],[0.3,0.7],[0.4,0.6] },
B C 1 1 2
Again,
e2 { h1 ,[0.2,0.8],[0.6,0.8],[0.7,1.0] , h2 ,[0.2,0.6],[0.3,0.8] }}.
F ~ H {e { h ,[0.2,0.6],[0.4,0.6],[0.7,1.0] , h ,[0.2,0.6],[0.3,0.8] }}.
A C 2 1 2
Therefore,
~ G )
( FA ~ (F ~ H ) {e { h ,[0.0,0.6],[0.3,0.8] , h ,[0.3,0.5],[0.3,0.7],[0.4,0.6] },
B A C 1 1 2
Hence
~ (G
FA ~ H ) (F ~ G )
~ (F ~ H ).
B C A B A C
993
IJRITCC | May 2017, Available @ http://www.ijritcc.org
_______________________________________________________________________________________
International Journal on Recent and Innovation Trends in Computing and Communication ISSN: 2321-8169
Volume: 5 Issue: 5 988 1000
_______________________________________________________________________________________________
Definition3.4. A interval-valued hesitant fuzzy soft topology on (U, E) is a family ofinterval-valued hesitant fuzzy soft sets over
(U, E) satisfying the following properties:
~ ~
~
(i) ,E
(ii) ~ then F
FA , GB ~G ~ .
A B
Example3.5. Let ~ E.
U {h1 , h2 } and E {e1 , e2 , e3 } and consider A {e1 , e2 , e3 }, B {e1 , e2 }
Let
FA {e1 { h1 ,[0.7,0.9],[0.3,0.8] , h2 ,[0.4,0.6],[0.5,0.7],[0.4,0.8] }
e2 { h1 ,[0.6,0.9],[0.7,1.0] , h2 ,[0.3,0.6],[0.8,1.0] }
e3 { h1 ,[0.3,0.6],[0.5,0.6] , h2 ,[0.3,0.9],[0.1,0.6] }}.
GB {e1 { h1 ,[0.3,0.8] , h2 ,[0.3,0.8],[0.3,0.6] },
e2 { h1 ,[0.2,0.9],[0.7,1.0] , h2 ,[0.8,1.0],[0.2,0.6] }}.
Now rearrange the membership value of FA and GB with the help of Definitions 2.9, 2.10and assumptions given by [8], we have
FA {e1 { h1 ,[0.3,0.8],[0.7,0.9] , h2 ,[0.4,0.6],[0.4,0.8],[0.5,0.7] }
e2 { h1 ,[0.6,0.9],[0.7,1.0] , h2 ,[0.3,0.6],[0.8,1.0] }
e3 { h1 ,[0.3,0.6],[0.5,0.6] , h2 ,[0.1,0.6],[0.3,0.9] }}.
GB {e1 { h1 ,[0.3,0.8] , h2 ,[0.3,0.6],[0.3,0.8] },
e2 { h1 ,[0.2,0.9],[0.7,1.0] , h2 ,[0.2,0.6],[0.8,1.0] }}.
~ ~ ~ ~
Suppose a collection of interval-valued hesitant fuzzy soft sets over (U,E) as { , E , FA , GB }.
Therefore
~ ~ ~
(i) ,E
~~ ~ ~ ~~ ~ ~~ ~ ~E~ ~E~
(ii) E , FA , GB , FA FA , GB GB and
~ G {e { h ,[0.3,0.8],[0.3,0.8] , h ,[0.3,0.6],[0.3,0.8],[0.3,0.8] },
FA B 1 1 2
e2 { h1 ,[0.6,0.9],[0.7,1.0] , h2 ,[0.3,0.6],[0.8,1.0] }
e3 { h1 ,[0.3,0.6],[0.5,0.6] , h2 ,[0.1,0.6],[0.3,0.9] }} FA ,
~~ ~~ ~ ~~ ~~ ~ ~~ ~G E ~ ~~ ~G ~ ~
~E
E FA E , E GB E , E FA B , FA B E. Therefore
is a IVHFS topology on (U , E ).
Definition3.6. If (U , E ), the triple (U , E, ) is said to be ainterval-valued hesitant fuzzy soft
is a IVHFS topology on
topological space (IVHFSTS). Also each member of is called a interval-valued hesitant fuzzy soft open set in (U , E, ).
Example3.7. From example 3.5, The triple (U , E, ) is a IVHFS topological space and theinterval-valued hesitant fuzzy soft
~ ~ ~ ~
open sets in (U , E, ) are , E , FA , GB .
994
IJRITCC | May 2017, Available @ http://www.ijritcc.org
_______________________________________________________________________________________
International Journal on Recent and Innovation Trends in Computing and Communication ISSN: 2321-8169
Volume: 5 Issue: 5 988 1000
_______________________________________________________________________________________________
Example3.8. A IVHFSS FA over (U , E ) is called an interval-valued hesitant fuzzy softclosed set in (U , E, ) if and only if its
C
complement FA is a interval-valued hesitant fuzzysoft open set in (U , E, ).
Definition3.9. Let (U , E, ) be a IVHFSTS. Let FA be a IVHFSS over (U , E ). The interval-valued hesitant fuzzy soft closure
of FA is defined as the intersection of all interval-valuedhesitant fuzzy soft closed sets(IVHFSCSs) which contained FA and is
denoted by cl ( FA ) or FA . We write
~{G : G is IVHFSCS and F
cl ( FA ) ~ G }.
B B A B
Example3.10. From example 3.5, we have
FA {e1 { h1 , [0.3,0.8], [0.7,0.9] , h2 , [0.4,0.6], [0.4,0.8], [0.5,0.7] }
e2 { h1 , [0.6,0.9], [0.7,1.0] , h2 , [0.3,0.6], [0.8,1.0] }
e3 { h1 , [0.3,0.6], [0.5,0.6] , h2 , [0.1,0.6], [0.3,0.9] }}.
GB {e1 { h1 , [0.3,0.8] , h2 , [0.3,0.6], [0.3,0.8] },
e2 { h1 , [0.2,0.9], [0.7,1.0] , h2 , [0.2,0.6], [0.8,1.0] },
e3 { h1 , [0.0,0.0], [0.0,0.0] , h2 , [0.0,0.0], [0.0,0.0] }}.
Then
~~ C
cl ( I C ) E GB GB {e1 { h1 , [0.2,0.7] , h2 , [0.2,0.7], [0.4,0.7] },
C
995
IJRITCC | May 2017, Available @ http://www.ijritcc.org
_______________________________________________________________________________________
International Journal on Recent and Innovation Trends in Computing and Communication ISSN: 2321-8169
Volume: 5 Issue: 5 988 1000
_______________________________________________________________________________________________
(v)
~ G ) cl ( F )
cl ( FA ~ cl (G ).
B A B
~ ~ ~
(vi) cl ( F G ) cl ( F ) cl (G ).
A B A B
(vii) cl (cl ( FA )) cl ( FA ).
Again cl ( FA ) is the smallest interval-valued hesitant fuzzy soft closed set containing FA .
Hence cl ( F ) ~ cl (G ).
A B
(v) From definition of union of IVHFSSs
FA ~F ~ G ,G ~F ~G .
A B B A B
~ ~ ~ cl ( F
Therefore cl ( FA ) cl ( FA GB ), cl (GB )
~ G ).
A B
~ ~ ~
cl ( F ) cl (G ) cl ( F G ). .......................................(A1)
A B A B
~ ~ cl (G ). .................................(A2)
~ cl ( F )
Again cl ( FA GB ) A B
~
Since cl ( F G ) is the smallest interval-valued hesitant fuzzy soft closed set containing
A B
Example3.13. From example 3.5, we consider a interval-valued hesitant fuzzy soft set I C over (U , E ) as
996
IJRITCC | May 2017, Available @ http://www.ijritcc.org
_______________________________________________________________________________________
International Journal on Recent and Innovation Trends in Computing and Communication ISSN: 2321-8169
Volume: 5 Issue: 5 988 1000
_______________________________________________________________________________________________
I C {e1 { h1 , [0.3,0.8] , h2 , [0.3,0.7], [0.3,0.8] },
e2 { h1 , [0.2,1.0], [0.7,1.0] , h2 , [0.2,0.7], [0.8,1.0] },
e3 { h1 , [0.0,0.0], [0.0,0.0] , h2 , [0.0,0.0], [0.0,0.0] }}.
Therefore
~ ~ G
int( I C ) GB B
FA int(FA ).
Hence it follows that
~ G Since int(F )
(iv). Let FA ~F ~ G , therefore int(F ) be a interval valued hesitant fuzzysoft open subset of G .
B A A B A B
Hence from definition of interval valued hesitant fuzzy softinterior, we have
~ G int(F )
FA ~ int(G ).
B A B
(v) Since
FA ~F ~ G ,G ~F ~G .
A B B A B
~ ~ ~ int(F
Therefore we have int(FA ) int(FA GB ), int(GB )
~ G ).
A B
Hence
~ int(G )
int(FA ) ~ int(F ~ G ).
B A B
(vi) Since
~G
FA ~ F ,F ~G ~G .
B A A B B
These implies that
~G )
int(FA ~ int(F ), int(F ~G )
~ int(G ).
B A A B B
Therefore
~G )
int(FA ~ int(G )............................( B1)
~ int(F )
B A B
997
IJRITCC | May 2017, Available @ http://www.ijritcc.org
_______________________________________________________________________________________
International Journal on Recent and Innovation Trends in Computing and Communication ISSN: 2321-8169
Volume: 5 Issue: 5 988 1000
_______________________________________________________________________________________________
Again we know that
~ F and int(G )
int(FA ) ~ G . Therefore
A B B
~ ~ ~
int(F ) int(G ) F G ............................( B2)
A B A B
Hence from (B1) and (B2) we get
~ G ) int(F )
int(FA ~ int(G ).
B A B
(vii). From (iii), if FA is an interval-valued hesitant fuzzy soft open set then int(FA ) FA. Therefore
int(int(FA )) int(FA ).
{ :
Proposition3.15. If ~ I } is a family of IVHFSTS on (U , E ), then { :
~ I } isalso a IVHFST on (U , E ).
Let {F } ~ J ~ I { }.
~
~ F ~ ~ { }.
J I
Definition3.16. Let 1 and 2 be IVHFSTS on (U , E ). We say that 1 is coarser (orweaker) than 2 or 2 is finer (or stronger)
~
than 1 if and only if 1 2 i.e. every 1 intervalvalued hesitant fuzzy soft open set (IVHFSOS) is 2 IVHFSOS. Again
IVHFST 1 and 2 are said to be comparable if either 1 ~ or ~ . If ~ and ~ , then we say the IVHFST
2 2 1 1 2 2 1 1
denoted as ~G .
e( FA ) B
998
IJRITCC | May 2017, Available @ http://www.ijritcc.org
_______________________________________________________________________________________
International Journal on Recent and Innovation Trends in Computing and Communication ISSN: 2321-8169
Volume: 5 Issue: 5 988 1000
_______________________________________________________________________________________________
Definition3.22. A IVHFSS I C in a IVHFSTS (U , E, ) is called a interval valued hesitantfuzzy soft neighbourhood
(IVHFSNBD) of the IVHFSP e( FA ) ~ (U , E ) if there is a IVHFSOS G such that e( F )
~G ~I .
B A B C
~ ~ ~
Example3.23. From examples 3.19, 3.21, we consider the IVHFST { , E , GB }. and
IVHFSS I C as
I C {e1 { h1 , [0.2,1.0], [0.2,0.3] , h2 , [0.6,0.9], [0.6,1.0] },
e2 { h1 , [0.3,0.6], [0.5,0.8] , h2 , [0.3,0.9] },
e3 { h1 , [0.5,0.8], [0.5,0.9] , h2 , [0.3,0.9], [0.3,1.0] },
e4 { h1 , [0.1,0.6], [0.7,0.9] , h2 , [0.2,0.6] }}.
Where E {e , e , e , e }, C {e , e , e , e } ~ E.
1 2 3 4 1 2 3 4
~G
Therefore e( FA ) ~I .
B C
(iv) If GB ~ N (e( F )) then there is a H ~ N (e( F )) such that G ~ N (e' ( M )) foreach e' ( M )
~H .
A C A B D D C
~ ~
Proof. (i) If G N (e( F )), then there is a IVHFSOS H such that e( F ) H G . ~
B A C A C B
~G .
Therefore we have e( FA ) B
~ ~L
~ H . Then there is a L such that e( F )
(ii) Let GB N (e( FA )) and GB ~G
C D A D B
~ ~ ~ ~
and e( F ) L G H . Therefore H N (e( F )).
A D B C C A
~L
~ N (e( F )) then there exist IVHFSOSs L , M such that e( F )
(iii) If GB , H C ~G
A D E A D B
and ~M
e( FA ) ~ H . Thus ~
~ L M
e( FA ) ~
~ G H . Since ~ ~ . Hence
LD M E wehave
E C D E B C
G ~H ~ N (e( F )).
B C A
GB
(iv) If ~ N (e( F )), then there is an IVHFSOS L ~ such that e( F )
~L ~G .
A P A P B
~ ~ ~
Now put H L . Then for each e ( M ) H , e ( M ) H G . This implies
' '
C P D C D C B
999
IJRITCC | May 2017, Available @ http://www.ijritcc.org
_______________________________________________________________________________________
International Journal on Recent and Innovation Trends in Computing and Communication ISSN: 2321-8169
Volume: 5 Issue: 5 988 1000
_______________________________________________________________________________________________
~ N (e' ( M )).
GB D
References
1000
IJRITCC | May 2017, Available @ http://www.ijritcc.org
_______________________________________________________________________________________