International Journal on Recent and Innovation Trends in Computing and Communication ISSN: 2321-8169

Volume: 5 Issue: 6 739 745

_______________________________________________________________________________________________
Intuitionistic Hesitant Fuzzy Filters in BE-Algebras

Hamid Shojaei Neda shojaei

Department of Mathematics, Payame Noor University, Department of Mathematics, Afzale Kermani, Institute of
P.O.Box. 19395-3697, Tehran, Iran Higher Education
Email: hshojaei2000@gmail.com Email: n.shojaei64@yahoo.com

Abstract:- The notions of hesitant fuzzy filters and hesitant implicative filter was introduced. In this paper, we introduce the notion of
intuitionistic hesitant fuzzy filters (IHFF) and intuitionistic hesitant implicative filters (IHIFB) and several properties are investigated. Also, we
defined -level sets, and we show the relation between IHFF, IHIFF and -Level.

AMS Mathematics Subject Classification (2010): 06F35, 03G25.

Keywords and phrases: (distributive) BE-algebra, (implicative, fantastic) intuitionistic hesitant fuzzy filter.

__________________________________________________*****_________________________________________________
1 Introduction and Preliminaries From now on X is a BE-algebra, unless otherwise is stated.
We introduce a relation on by if and only if
Zadeh [10] proposed fuzzy set theory in 1965. The
= 1.
applications of fuzzy set theory appear in various fields. The
intuitionistic fuzzy sets [1,2] was an extensions of fuzzy Definitions 1.2. A BE-algebra is said to be a self
sets. Atanassov [1,2] proposed the Concept of intuitionistic distributive if ( ) = ( ) ( ), for all
fuzzy sets (IFS). It is useful in various application of science , , . A BE-algebra X is said to be commutative if
and engineering. IFS are associated for define in functions ( ) = ( ) , for all , .
like non- membership function, membership function and
hesitancy function. Liu and Wang [5] shows the basic Lemma 1.3. (Walendziak [10]) If is a commutative BE-
concepts of intuitionistic fuzzy set theory and its practical algebra, then for all , , we have
applications. Recently Torra [8] and Torra, Narukawa [9]
= 1 and = 1 imply = .
proposed the hesitant fuzzy sets (HFS). In 2011 Xia and Xu
[11] introduced hesitant fuzzy information aggregation We note that
techniques and their applications for decision making. Also
is reflexive by (BE1). If X is self distributive then
they defined some new operations on hesitant fuzzy sets and
intuitionistic fuzzy sets. The hesitant fuzzy sets are an relation is a transitive ordered set on , because if
emerging and useful tool for dealing with uncertainty a and , then
vagueness. Interestingly, in motivates us to define new = 1 ( ) = ( ) ( ) = ( ) =
operators and properties of these sets, which must make 1 = 1. Hence .
them more important and applicable. A. Rezaei and A.
Broumand [6] introduce the nation of hesitant fuzzy If X is commutative then by Lemma 2.3, relation is
(implicative) filter and some properties. In this paper we antisymmetric. Hence if X is a commutative self distributive
introduce the notion of intuitionistic hesitant fuzzy BE-algebra, then relation is a partial ordered set on X.
(implicative, fantastic) filters and get some properties.
Theorem 1.4. (Kim and Kim [4]) In a BE-algebra X, the
In this section, we cite the fundamental definitions that will following holds:
be used in this paper:
(i) ( ) = 1,
Definitions 1.1. (Kim and Kim [4]) By a BE-algebra we
(ii) (( ) ) = 1, for all , .
shall mean an algebra (, ,1) of type (2,0) satisfying the
following axioms: Definition 1.5. A subset of is called a filter of if it
satisfies:
(BE1) = 1,
(F1) 1 .
(BE2) 1 = 1,
(F2) if and imply .
(BE3) 1 = ,

(BE4) ( ) = ( ), for all , , .

739
IJRITCC | June 2017, Available @ http://www.ijritcc.org
_______________________________________________________________________________________
International Journal on Recent and Innovation Trends in Computing and Communication ISSN: 2321-8169
Volume: 5 Issue: 6 739 745
_______________________________________________________________________________________________
We define (, ) = { : ( ) = 1}, which is If we replace x of the condition (FIF2) by the element 1,
called an upper set of and . It is easy to see that1, , then it can be easily observed that every fuzzy implicative
(, ), for every , . filter is a fuzzy filter. However, every fuzzy filter is not a
fuzzy implicative filter as shown the following example.
Definition 1.6. (Borumand and Rezaei [6]) A nonempty
subset of is called an implicative filter if satisfies the Example 1.11. (Rao [7]) Let = {1, , , , } be a BE-
following conditions: algebra with the following table.

(IF1) 1 ,

(IF2) ( ) and imply , for all * 1 a b c d

, , . 1 1 a b c d
If we replace x of the condition (IF2) by the element 1, then a 1 1 b c b
it can be easily observed that every implicative filter is a b 1 a 1 b a
filter. However, every filter is not an implicative filter as
c 1 a 1 1 a
shown the following example.
d 1 1 1 b 1

Example 1.7. Let X = {1, a, b} be a BE-algebra with the Then it can be easily verified that (, ,1) is a BE-algebra.
following table: Definition a fuzzy set on as follows:

0.9 = 1,
=
* 1 a b 0.2
Then clearly is a fuzzy filter of , but it is not a fuzzy
1 1 a b
implicative filter of , since
a 1 1 a
( ) min
{ , }.
b 1 a 1 Definition 1.12. (Torra [8]) Let be a reference set. Then a
hesitant fuzzy set HFSA of is represented mathematical
as:
Then = {1, } is a filter of , but it is not an implicative
filter, since 1 ( ) = 1 = and 1 = = , : 0,1 , , where ([0,1])
but 1 = . is the power set of [0,1].

Definition 1.8. Let ( , ,1) and (, , 1) be two BE- So, we can define a set of fuzzy sets an HFS by union of
algebras. Then a mapping is called a their membership functions.
homomorphism if (1 2 ) = (1 ) (2 ) , for all
Definition 1.13. (Torra [8]) Let = {1 , 2 , . . . , } be a set
1 , 2 . It is clear that if is a
of membership functions. The HFS that is associated with
homomorphism, then (1) = 1.
, , is define as:
Definition 1.9. [2] A fuzzy set of is called a fuzzy filter
: [0,1] , = { }.
if satisfies the following conditions:

(FF1) (1) (), It is remarkable that this Definition is quite suitable to

decision making, when experts have to assess a set of
(FF2) () {( ), ()}, for all , . alternatives. In such a case, A represents the assessments of
the experts for each alternative and the assessments of
Definition 1.10. (Rao [7]) A fuzzy set of is called a
the set of experts. However, note that it only allows to
fuzzy implicative filter of if satisfies the following
recover those HFSs whose memberships are given by sets of
conditions:
cardinality less than or equal to n.
(FF1) (1) (),
For convenience, Xia and Xu in [11] named the set =
(FF2) (x*z) min{(x*(y*z)), (x*y)}, for all , , () as a hesitant fuzzy element HFE. The family of all
. hesitant fuzzy elements Definition on show by HFE(X).

740
IJRITCC | June 2017, Available @ http://www.ijritcc.org
_______________________________________________________________________________________
International Journal on Recent and Innovation Trends in Computing and Communication ISSN: 2321-8169
Volume: 5 Issue: 6 739 745
_______________________________________________________________________________________________
2 Main Result (v)
= , , () , { , () :
2.1 Intuitionistic Hesitant Fuzzy Filters

Definition 2.1.1. Let be a reference set. An Intuitionistic
Proposition 2.1.6. Let A IHFF(X) and , , . Then
hesitant fuzzy set () in is,
(i) ( ) and ,
= {< , (), () > } such that;
, : X [0,1] are maps. (ii) and () ()
( ),
Definition 2.1.2. An Intuitionistic hesitant fuzzy set of is
called an Intuitionistic hesitant fuzzy filter (IHFF), if (iii) and (
satisfies the following conditions: ),
(IHFF1) 1 and 1 , (iv) ( ( )) and ()
() ( ( )) .
(IHFF2) and
, for all , . Proof. (i). Since x y x, by Lemma 1, (i) holds.
Lemma 2.1.3. Let I be an IHFF, than for all , , if (ii). Since .By (i),
then; and () (). , so .
Proof. Let . Then = 1 and so = And, , by (i) , ,
1 1 and ( ) (1) 1 (1). By so .
(IHFF2), we have = 1 = ()
( ) () and = = () (iii). We have = 1 =
( ) (). =

Example 2.1.4. Let X={1,a,b} with the following table. .

And, = 1 =
* 1 A b
= .
1 1 A b

a 1 1 b (iv). From (iii) we have

b 1 1 1 ( ( )) ()
( ).

( ( )) ()
Then (X,*,1) is a BE-algebra. Let = 0.4,0.5 , ( ).
= 0.2,0.3 , (1) = 0.6,0.8 and
Lemma 2.1.7. Let () and x,y,z, for
() = 0.7,0.9 , () = 0.2,0.25 , (1) = {0.1,0.14}.
i=1,2,,n. Then;
Then I is an intuitionistic hesitant fuzzy filter.
(i) If , , then and
Definition 2.1.5. let and be two IHFF(X) and
() .
. Then we defined
(ii) If =1 = 1, then
=1 ( ) and
(i) ,
( ) (), where
(ii) = = = ,

= ( 1 . 1 ).
(iii) Ac = x, k A (x), hA (x) : x X ,
=1

(iv)
Proof. (i) Let , . Then = 1. Hence
= , , , sup
{ , } :
= () 1 =
,
() () ( ) ().

741
IJRITCC | June 2017, Available @ http://www.ijritcc.org
_______________________________________________________________________________________
International Journal on Recent and Innovation Trends in Computing and Communication ISSN: 2321-8169
Volume: 5 Issue: 6 739 745
_______________________________________________________________________________________________
And, = () 1 = = 1 and = 1 . Now, for
() () ( ) (). any , , let = 1 , = 1 and
= 2 , = 2 . Assume that = 1 2 , ( =
(ii). By (i) it is true for = 1,2. We proof it by induction on 1 2 ) . We see that , , , , so,
. Assume that it satisfies for = . , , . Hence and . We
Suppose that +1 = 1, for , , , . By
have = 1 2 = and
=1 1 +1
= 1 2 = . Therefore
induction hypothesis, +1 =2 ( ) (1 ). Since
().
is a hesitant fuzzy filter, we have;
+1 +1 Theorem 2.1.13. Let , 0,1 and
=1 ( ) = =2 ( ) (1 ) (1 )
, . If , , , , then , , , .
(1 ) ().
+1
Proof. Since , , , , we have ,
And also by induction hypothesis =2 and (), () .
1. Since is a hesitant fuzzy filter, we have;
Let , . Then = 1 and so we have,
+1 +1
=1 = =1 (1 ) (1 ) = 1 =
(1 ) (). and =
Theorem 2.1.8. Let (). Then the set = 1 = .
: () = 1 , () = (1) is a filter of X. We obtain, , , . Therefore , , ,
Proof. Obviously, 1 . Let x, . Then = .
= 1 , = = 1 . Thus Corollary 2.1.14. Let () and 0,1 . If
1 = () ( ) () (1). Hence , , , then , , =
= (1) , and 1 = () ( ) ()
, , , (, ).
(1). Hence = (1) ,So , .
Proof. It is obviously , , , (, ) , , .
Definition 2.1.9. Let [0,1] and ().
Now, assume that , , . Since
set of I, is defined by
1 = 1, we have (, 1). Therefore,
, , = { : , () }.
, , (, 1) , , (, )
Lemma 2.1.10. Let , 0,1 . If , , ,,(,).
then ( , , ) ( , , ).
2.2 Intuitionistic Hesitant Fuzzy Implicative Filters
Proof. Let , , . Then . Since ,
we have, . Also, since () and , Definition 2.2.1. Let (). A is called an
Intuitionistic hesitant fuzzy implicative filter if satisfies the
we have . Therefore, ( , , ).
following condition holds for every x,y,z .
Theorem 2.1.11. Let and 0,1 . If
(IHFIF1) 1 , () (1),
, , , then , , is a filter of .
(IHFIF2) ( ) ( ) , (
Proof. Let , , , for any 0,1 .
( )) ( ) ( ).
Therefore , and
, . Hence () ( ) Theorem 2.2.2. Let X be a self distributive BE-algebra.
() and () ( ) () therefore Then every is a IHFIF of X.
() and () hence , , .
Obviously 1 , , . Proof. Let ()X. Obvious for every , we
have () (1), () (1). Now, let , , .
Theorem 2.1.12. Let () and 0,1 . If Since X is self distributive, we have, ( ) = (
, , be a filter of , then (). ) ( ), by (IHFIF2), we have,
Proof. Let , , be a filter for all 0,1 . If for ( ( )) ( ) = (( ) ( ))
any we consider = and = then ( ) ( ),
, , . Since , , is a filter of X, we have
1 , , . Therefore And, ( ( )) ( ) = (( ) (
)) ( ) ( ).
742
IJRITCC | June 2017, Available @ http://www.ijritcc.org
_______________________________________________________________________________________
International Journal on Recent and Innovation Trends in Computing and Communication ISSN: 2321-8169
Volume: 5 Issue: 6 739 745
_______________________________________________________________________________________________
Therefore, . Case 2. If ( ) , , then = .
Therefore ( ( )) ( ) = ( ), and
Note. The converse of the above theorem may be not true.
(1) holds.
The following example show this.
Also = , we have ( )
( ), and (2) holds.
Example 2.2.3. Let = {1, , , , } with the following
Case 3. If ( ) , , is similary to cases (2).
table.
Case 4. If ( ) , , then =
* 1 a b c d
( ) = ( ), obvious, (1) holds,
1 1 a b c d
a 1 1 b c b Also, = = ( ) and (2)
holds.
b 1 a 1 b a
c 1 a 1 1 a Clearly ( , , ) = { : (), () } =
d 1 1 1 b 1 .

Then (,, 1) is a BE-algebra. But, = = 1 In the same manner we can show that if F be a filter of X.
and = = . This shows that is not Then there exists a intuitionistic hesitant fuzzy filter
self distributive. Let 1 = = {0.8 , 0.7} and =< , , > , such that, ( , , ) = .
= = = {0.4} and, 1 = () =
Proposition 2.2.5. Let X be a self distributive BE-algebra
{0.2 , 0.3}, = = = {0.6}.
and (). Then the following conditions are
Then . But, we have, = = equivalent for all , , .
{0.4}, this shows that ( ) ( ) (
(i) ,
). So, .

Theorem 2.2.4. Let F be a implicative filter of X. Then there (ii) ( ( )) ( ) and

exists a Intuitionistic hesitant implicative fuzzy filter ,
=< , , > of X such that , , = , For
(iii) ( ) () ( ) and
some ( 0,1 ).
( ) () ( ).
Proof. Define and as follows

, Proof. (i)(ii). Since (). By (BE1) we have:

= ,

( ( )) =) ( ( )) hI 1 =) ( (

= )) hI y y hI y x and k I y y x =
kI y y x k I (1) = k I y y x kI y y
Where = [0, 1], and is a fixed subset of [0, 1]. Since kI y x
1 , we have (x) = (1) and () =
(ii)(iii). Let (), that satisfying (ii). We have
(1).
hI z (y y x ) hI z hI y y x hI y
We will showed I=< , (x), (x)> (), first now
we show that x and kIzyyxhIzkIyyxkIyx.

(1) ( ( )) ( ) ( ),

(2) ( ( )) ( ) ( ). (iii)(i). Since x y z = y x z xy

x x z , we haveTherefore, hI x x z
We consider the following cases:
hI xy x xz . Thus hI x y z
Case 1. If , , then . hI x y (((x y) (x (x z))) (x y)
Hence ( ( )) = , = . Then ( (x z) and (( ( ) ( ) ((( )
) = , and (1) holds. ( ( ))) ( ) ( )

Also, = , = . Therefore Therefore, .

= and (2) holds.
743
IJRITCC | June 2017, Available @ http://www.ijritcc.org
_______________________________________________________________________________________
International Journal on Recent and Innovation Trends in Computing and Communication ISSN: 2321-8169
Volume: 5 Issue: 6 739 745
_______________________________________________________________________________________________
Let : be a homomorphism of BE-algebra onto Example 2.3.2. Let = {1, , , , }. Define binary
BE-algebra and (). Define mapping operation on X as follows:
and () : ([0,1]), by () () = (())
* 1 a b c d
and () () = . his mapping are composition of
1 1 a b c d
two mapping, thus are well define and ( ) = {
() }. a 1 1 b c b
b 1 a 1 b a
Proposition 2.2.6. Let : be onto homomorphism of
BE-algebras. c 1 a 1 1 a
() d 1 1 1 b 1
Then it can easily verified that (,, 1) is BE-algebra. Now
(resp., ()) if and only if I(F) IHFF(X) (resp.,
let;
()).
1 = = = {0.8, 0.9}, = =
Proof. Assume that (). For any , we
{0.6, 0.7} and 1 = = = {0.2, 0.3},
have;
= = {0.4, 0.5}.
(()) () = (()) ( 1 ) = (( 1 )) =
Obviously, we can check < , , () > is an
(()) (1 ).
(IFHFF) in .
And
Theorem 2.3.3. Every IFHFF in a BE-Algebra is an IHFF
(()) () = (()) ( 1 ) = (( 1 )) = in .
(()) (1 ). Proof. Let , , . We have, = (
Therefore, () (). (1 1)) ( 11 1 1 = 1 .

Conversely, assume that () and . Since

Also, = ( (1 1)) ( 11
is onto, there exists such that () = . Therefore,
() = (()) = () () () ( ) = 11=1.
(( )) = ( ).
Put : = 1 in IFHFF2, we obtain;
And () = (()) = () () () ( ) =
(( )) = ( ). ( ) () ( (1 )) ()
Now let , . Then there exists , such that ( 1 1 = 1 = (),
() = , () = , and we have;
And, ( (1 )) ()
( ) () = ( ()) (()) =
( 1 1 = 1 = ().
(( )) (()) = ( ) () ()
() () = (()) = (). Therefore, ().
And, ( ) () = ( ()) (()) = Since every IFHFF is IHFF, by Theorem 5.3, we have the
(( )) (()) = ( ) () () following corollary.
() () = (()) = ()). Hence ().
Corollary 2.3.4. Let (). Then for all ,
2.3 Fantastic Hesitant Intuitionistic Fuzzy Filters the following holds:
( ) If , then () (), () ().
Definition 2.3.1. Hesitant fuzzy set is called a fantastic
() () ( ), () ( ).
hesitant intuitionistic fuzzy filters of if and only if satisfies
The converse of the Theorem 2.3.3 atmospheric is not true.
the following conditions:
It can be seen the following example.
(FHIFF2) ( ( )) () (( Example 2.3.5. Let = {1, , } be a BE-algebra with the
), following table:
(FHIFF2) ( ( )) () (( ).

744
IJRITCC | June 2017, Available @ http://www.ijritcc.org
_______________________________________________________________________________________
International Journal on Recent and Innovation Trends in Computing and Communication ISSN: 2321-8169
Volume: 5 Issue: 6 739 745
_______________________________________________________________________________________________
Let = 0.4,0.5 , = 0.2,0.3 , (1) = : () =
0.6,0.8 and () = 0.4,0.5 , () = 0.6,0.8 , * 1 a b 1 , () =
(1) = {0.2,0.3}. Then (). But 1 (
(1) . By define -Level
)= = 1 and set of a 1 1 a b IHFF we show
(( ) ) = = 1 = the relation between
a 1 1 b IHIFF and -
=0.4,0.5. If we put :=1, :=, := in (IFHFF2) we IHFF,
have, 1 ( ) 1 = 1 = 0.6,0.8 Level.
b 1 1 1
Finally we
0.4,0.5 = (( ) ) . defined fantastic hesitant
intuitionistic
Therefore, (). fuzzy filters and study it's properties. In other paper we are
study about Intuitionistic Hesitant Fuzzy Filters on
Theorem 2.3.6. Let (). if and only
residuted algebra.
if the following condition holds for all , :
References:
( ) ( ), ( )
( ) (1) [1] K. T. Atanassov, Intuitionistic fuzzy sets, Fuzzy
Sets and Systems 20(1) (1986) 87-96.
Proof: Assume that (). Let , , since [2] K. T. Atanassov, Intuitionistic fuzzy sets, Springer
1 = and (), by (IFHFF2), we Physica-verlag, Hedielberg 1999.
have [3] A. Boromand Saeid, A. Rezaei, R. A. Borzoei,
Some type of filters in BE-algebra, Math, Comput,
= 1 = 1 sci, 7(3) (2013), 341-352
(1) , [4] H. S. Kim, Y. H, Kim, On BE-algebra, Sci, Math,
Jpn, 66(1) (2007), 113-116.
= 1 = 1 (1) [5] H. W. Liu, G. J. Wang, Multi-criteria decision-
. making methods based on Intuitionistic fuzzy sets,
European Journal of Operation Research 179(1)
Conversely, assume (1) holds. Since (), we (2007) 220-223
have; [6] A. Rezaei, A. Boromand Saeid, Hesitant fuzzy
filters in BE-algebras, International Journal of
, ( ) Computatational Intelligence systems, 9(2016),
(). (2) 110-119.
And by (1) we obtain; [7] S. M. Roa, Fuzzy implicative filters of BE-algebra,
Annals of Fuzzy mathematics and informatics, 6(3)
( ) ( ), ( ) (2013), 129-146.
( ). (3) [8] V. Torra, Hesitant fuzzy sets, International Journal
of Intelligent Systems 25(6) (2010) 529-539.
From (2) and (3) we have: [9] V. Torra, Y. Narukwa, On hesitant fuzzy sets and
decision, The 18th International Conference of
( ) ((
Systems Island, Korea, Jeju (2009) 1378-1382.
) ),
[10] A. Walendziak, On normal filters and congruence
and relations in BE-algebra, Commentationes
mathematicae, 52 (2) (2012), 199-205.
( ) (( ) [11] M. M. Xia, Z, S, Xu, Hesitant fuzzy information
). aggregation in decision making, International
Therefore, (). Journal of Approximate Reasoning, 52(3) (2011)
395-407.
Conclusions and further [12] L. A. Zadeh, Fuzzy sets, Information and Control, 8
(3) (1965) 338-353.
In this paper, we introduce the notion of Intuitionistic
Hesitant Fuzzy Filters on a BE-algebra . I give some results
and examples about Intuitionistic Hesitant Fuzzy Filters
(IHFF), and the relationship between an IHFF of a BE-
algebra X and filters of X is showed by define =
745
IJRITCC | June 2017, Available @ http://www.ijritcc.org
_______________________________________________________________________________________