0% found this document useful (0 votes)
9 views10 pages

Intuitionistic Fuzzy Groups Explained

The document discusses the concept of intuitionistic fuzzy groups, focusing on their algebraic properties and the use of (α, β) cut sets. It defines intuitionistic fuzzy sets and subgroups, providing various mathematical definitions and propositions related to their properties. The paper aims to enhance the understanding of intuitionistic fuzzy subgroups and their applications in mathematics.

Uploaded by

Dian Pratama
Copyright
© All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
0% found this document useful (0 votes)
9 views10 pages

Intuitionistic Fuzzy Groups Explained

The document discusses the concept of intuitionistic fuzzy groups, focusing on their algebraic properties and the use of (α, β) cut sets. It defines intuitionistic fuzzy sets and subgroups, providing various mathematical definitions and propositions related to their properties. The paper aims to enhance the understanding of intuitionistic fuzzy subgroups and their applications in mathematics.

Uploaded by

Dian Pratama
Copyright
© All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd

See discussions, stats, and author profiles for this publication at: [Link]

net/publication/225302971

Intuitionistic fuzzy Groups

Article · January 2011

CITATIONS READS
22 2,138

1 author:

Poonam Kumar Sharma


DAV College Jalandhar
129 PUBLICATIONS 633 CITATIONS

SEE PROFILE

All content following this page was uploaded by Poonam Kumar Sharma on 05 June 2014.

The user has requested enhancement of the downloaded file.


IIJDWM
Journal homepage: [Link]

Intuitionistic fuzzy Groups


P.K. Sharma
Department of Mathematics, D.A.V. College , Jalandhar City, India

ABSTRACT Definition (2.3)[Atanassov] Let A = { < x, A(x),


For any intuitionistic fuzzy set A = { < x , A(x) , A(x) > : x X} and B = { < x , B(x) , B(x) > : x
A(x) > : x X} of a set X , we study the set C ,  (A) X} be any two IFS’s of X , then
(i) A  B if and only if A(x)  B(x) and
called the (, ) – cut of A. It is the crisp subset { x
X : A(x)   , A(x)   } of X . In this paper, an A(x)  B(x) for all xX
attempt has been made to study some algebraic
nature of intuitionistic fuzzy subgroups and their (ii) A = B if and only if A(x) = B(x) and A(x)
properties with the help of their (, ) – cut sets. = B(x) for all xX
Keywords: Intuitionistic fuzzy set (IFS) , Intuitionistic
fuzzy subgroup (IFSG), Intuitionistic fuzzy normal (iii) A  B = {< x, (A B )(x) , (A B )(x) >
subgroup (IFNSG ) , (, ) – cut , Homomorphism, . : x X} , where
Mathematics Subject Classification : 03F55 ,
08A72 (A B )(x) = Min{ A(x) , B(x)} = A(x)  B(x)
and
1. INTRODUCTION
(A B )(x) = Max{ A(x) , B(x) } =
After the introduction of the concept of fuzzy set by A(x)  B(x)
Zadeh several researches were conducted on the (iv) A  B = {< x, (A B )(x) , (A B )(x) > : x
generalization of the notion of fuzzy set. The idea of
X}, where
Intuitionistic fuzzy set was given by Krassimiri T.
Atanassov. In this paper we study Intuitionistic fuzzy
(AB )(x) = Max{ A(x) , B(x)} = A(x) B(x)
subgroup with the help of some properties of their
and
(, ) – cut sets.
(A B )(x) = Min{ A(x) , B(x) } =
2. PRELIMINARIES A(x)  B(x)

Definition (2.4)[Palaniappan, Naganathan, and


Definition (2.1)[Atanassov] Let X be a fixed non-
empty set. An Intuitionistic fuzzy set (IFS) A of X Arjunan] An IFS A = { < x, A(x), A(x) >: x G} of
a group G is said to be intuitionistic fuzzy subgroup
is an object of the following form A = {< x , A(x) ,
of G ( In short IFSG) of G if
A(x) > : x X}, where A : X  [0, 1] and A : X
(i) A(xy)  A(x) A(y)
 [0, 1] define the degree of membership and degree
of non-membership of the element x X respectively (ii) A(x-1) = A(x)
and for any x X , we have 0  A(x) + A(x)  1 .
Remark (2.2): When A(x) + A(x) = 1 , i.e. when (iii) A(xy)  A(x)  A(y)
A(x) = 1 - A(x) = Ac(x) . Then A is called fuzzy
set. (iv) A(x-1) = A(x) , for all x , y G

IFRSA International Journal of Data Warehousing & Mining |Vol1|issue 1|Aug 2011 86
P.K. Sharma| Intuitionistic fuzzy Groups

 {  A ( x) : x  f

Definition (2.5)[ Kul Hur and Su Youn Jang ] An 1
(y)}
IFSG A = { < x, A(x), A(x) > : x G} of a group  f  A ( y)  
G said to be intuitionistic fuzzy normal subgroup 
 0 ; otherwise
of G ( In short IFNSG) of G if
(i) A(xy) = A(yx)
 {  A ( x) : x  f 1 (y)}
 f  A ( y)  
(ii) A(xy) = A(yx) , for all x , y G and  1 ; otherwise
i.e.
Remark (2.6): It is easy to verify that an IFSG A of a
group G is normal if
(i) A(g-1 x g) = A(x) and

f  A  ( y)  
{  (x) : x  f
A
1
(y)} , {  A ( x) : x  f 1 (y)} 
 ( 0, 1) ; otherwise
(ii) A(g-1 x g) = A(x) , for all x  A
and g G Also the pre-image of B under f is denoted by f -1
(
B) and is defined as
Proof . Let x  A and g G be any element, then
A(g-1 x g) = A(g-1 (x g)) = A((x g)g-1) = A((x (gg- f 1  B x   (  f 1  B ( x) ,  f 1  B ( x))
1
)) = A((x e) = A(x )
A(g-1 x g) = A(g-1 (x g)) = A((x g) g-1 ) = A((x (g where  f 1  B ( x)  B ( f ( x)) and  f 1  B ( x) =  B ( f ( x))
g-1 )) = A((x e) = A(x)
i.e.
Definition(2.7) [Kul Hur and Su Youn Jang]: Let ( X
, .) be a groupoid and A , B be two IFS’s of X . Then
f 1
 B x   ( B ( f ( x)) ,  B ( f ( x)) )
the Intuitionistic fuzzy product of A and B is
denoted by AB and is defined as follows : 3. (  ,  ) – CUT OF INTUITIONISTIC
For any x  X FUZZY SET (IFS) AND THEIR PROPERTIES
A B( x)    A B (x) , A B ( x) 
Definition (3.1): (  , ) – Cut of Intuitionistic
,
fuzzy set
where
Let A be Intuitionistic fuzzy set of a universe set X .

    A ( y)   B ( z )] Then (  ,  )-cut of A is a crisp subset C , (A) of
 A B (x)   yz  x
the IFS A is given by

0 ; if x is not expressible as x= yz and C , (A) = { x : x X such that A(x)   , A(x) 

   A ( y )  B ( z )]  }, where  ,   [ 0 , 1 ] with  +
 A B (x)   yz  x
1.

1 ; if x is not expressible as x= yz
i.e. Proposition (3.2) If A and B be two IFS’s of a


A B( x)      ( y)   (z)] ,   ( y)  (z)]
yz  x
A B
yz  x
A B
universe set X , then following holds
(i) C , (A)  C  , (A) if    and   
 ( 0,1) ; if x is not expressible as x = yz
(ii) C1- , (A)  C  , (A)  C , 1-(A)
Definition (2.8) [Kul Hur and Su Youn Jang]:Let X
and Y be two non-empty sets and f ; X  Y be a (iii) A  B implies C , (A)  C , (B)
mapping . Let A and B be IFS’s of X and Y
respectively . Then the image of A under the map f is (iv) C , (A  B) = C , (A)  C , (B)
denoted by f (A) and is defined as
(v) C , (A  B)  C , (A)  C , (B) equality hold
f  A  ( y)   f A
( y ) ,  f  A  ( y)  ,
if  +  =1

where (vi) C , ( A i ) =  C , (A i )

(vii) C0 , 1 (A) = X.

IFRSA International Journal of Data Warehousing & Mining |Vol1|issue 1|Aug 2011 87
P.K. Sharma| Intuitionistic fuzzy Groups

Proof. (i) Let x C , (A)  A(x)   and Also , let x  C , (A)  C , (B)
A(x)    x  C , (A) and x  C , (B)
Since    and    implies that A(x)      A(x)   , A(x)   and B(x)   , B(x) 
and A(x)     
 A(x)   and A(x)   and so x C , (A)  A(x)   , B(x)   and A(x)   , B(x) 
Hence C , (A)  C , (A) 
(ii) Since  +   1 implies that 1-    and    A(x)  B(x)   and A(x)  B(x) 
 
Therefore by part (i) we get C1- , (A)  C , (A)  (A B )(x)   and (A  B)(x) 
…………….(1) 
Again  +   1 implies that    and   1 -  x  C , (A  B )
 Thus C , (A)  C , (B)  C , (A  B )
Therefore by part (i) we get C , (A)  C , 1- (A) ……………….(4)
……………..(2) From (3)and(4), we get C , (A B) = C , (A) C ,
From (1)and(2) we get C1- , (A)  C , (A)  C , 1- (B)
 (A) (v) Since A  A  B and B  A  B
(iii) Let x  C , (A)  A(x)   and A(x) Therefore by part (i) C , (A)  C , ( A  B) and
 C , (B)  C , (A  B)
As B  A  B(x)  A(x)   and B(x)  A(x)  C , (A)  C , (B)  C , (A  B)
 Now equality hold if  +  = 1 .
 B(x)   and B(x)   and so x C , (B) We show that C , (A  B)  C , (A)  C , (B)
Hence C , (A)  C , (B) Let x  C , (A  B)  (A  B )(x)   and
(iv) Since A  B  A and A  B  B (A  B)(x)  
Therefore by part (i) C , (A  B)  C , (A) and  A(x)  B (x)   and A (x)  B(x)  
C , (A  B)  C , (B) If A(x)   , then A(x)  1 - A(x)  1 -  = 
 C , (A  B)  C , (A)  C , (B) Implies that x  C , (A)  C , (A)  C , (B)
……………… (3) Similarly if B (x)   , then B(x)  1 - B(x)  1 - 
=
Implies that x  C , (B)  C , (A)  C , (B) Let gC,(AB)  AB(g)   , AB(g) 
Thus if x  C , (A  B)  x  C , (A) C , (B) 
And so C , (A  B)  C , (A)  C , (B) 
    A ( y )   B ( z )]
……………………..(6)  A B (g)   yz  g

From(5)and (6), we get C , (A B) = C , (A) C But 


0 ; if x is not expressible as g = yz
, (B)    A ( y)  B ( z )]
(v) Let x  C , ( A i )  A B (g)   yz  g

 ( Ai)(x)   and ( Ai)(x)   and 1 ; if x is not expressible as g = yz



 Ai(x)   and  Ai(x)    x  C , (Ai) for
   A ( y)  B ( z )]   and   A ( y)  B ( z)]  
all i yz  g yz  g
 x   C , (Ai) and hence C , ( A i )   C ,
(Ai) ’s y1 , z1 and y2 , z2 in X such that g = y1 z1 and g
(vi) Follows from definition = y2 z2 and

Proposition (3.3) : Let ( X , . ) be a groupoid and A


 A ( y1 )  B ( z1 )   and  A ( y2 )  B ( z2 )  
, B be two IFS’s of X. Then
C,(AB) = C,(A) C,(B)
 A ( y1 )   , B ( z1 )   and  A ( y2 )   ,  B ( z2 )  
Proof. Now C,(AB) ={gX: AB(g)   ,
AB(g) } let  A ( y1 )  1- ,  B ( z1)  1-  and A ( y2 )  1- , B ( z2 )  1-

IFRSA International Journal of Data Warehousing & Mining |Vol1|issue 1|Aug 2011 88
P.K. Sharma| Intuitionistic fuzzy Groups

 y1  C ,1 (A) , z1  C ,1 (B) andy2  C1 ,  (A) , z2  C1 ,  (B) Conversely , let A is Intuitionistic fuzzy subset of a
group G such that C , (A) is a subgroup of group G
By Proposition (3.2) , we have for all  ,   [ 0 , 1 ] with  +   1.
To show that A be intuitionistic fuzzy subgroup of
C1 ,  (A)  C , (A)  C ,1 (A) ; for every IFS's A of X group G. For this we show that
(i) A(xy)  A(x) A(y) and A(xy)  A(x) 
 g  y2 z2  C1 ,  (A) C1 ,  (B)  C , (A)C , (B) i.e. g  C , (A)C , (B) A(y) for all x , y G

(ii) A(x-1) = A(x) and A(x -1) = A(x)


Hence C,(AB) = C,(A) C,(B)
For (i) Let x , y  G and let  = A(x) A(y)
Theorem (3.4) : If A is Intuitionistic fuzzy
and  = A(x)  A(y) . Then
subgroup of a group G. Then C , (A) is a subgroup
A(x)   , A(y)   and A(x)   , A(y)
of group G, where A(e)   , A(e)   and e is the

identity element of G.
i.e. A(x)   , A(x)   and A(y)   ,
Proof. Let x , y  C , (A) be any two elements .
A(y)  
Then
i.e. x  C , (A) and y  C , (A) and so xy  C
A(x)   , A(x)   and A(y)   ,
, (A) [ As C , (A) is a group].Therefore
A(y)  
A(xy)   = A(x)  A(y) and A(xy)  = A(x)
A(x) A(y)   and A(x)  A(y)
A(y)

As A is intuitionistic fuzzy subgroup of G i.e. A(xy)  A(x) A(y) and A(xy)  A(x) 
Therefore A(xy-1)  A(x) A(y)   and A(y)
A(xy-1)  A(x)  A(y)   For (ii) Let x  G be any element . Let A(x) = 
Thus xy-1 C , (A). Hence C , (A) is a subgroup and A(x ) =  . Then
of G A(x)   and A(x )   is true i.e. x  C , (A) .
. As x  C , (A) is a subgroup of G. Therefore we
Theorem (3.5): If A be intuitionistic fuzzy normal have x -1  C , (A)  A(x -1)   and A(x -1) 
subgroup of group G. Then C , (A) is normal 
subgroup of group G, where A(e)   , A(e)   Thus A(x -1)   = A(x ) and A(x -1)   = A(x )
and e is the identity element of G. Thus A(x) = A ((x -1)-1)  A(x -1)  A(x) implies
Proof. Let x C , (A) and g  G be any that A(x-1 ) = A(x)
[Link] And A(x) = A((x -1)-1)  A(x -1)  A(x) implies
A(x)   , A(x)   . Also A be Intuitionistic fuzzy that A(x -1) = A(x )
normal subgroup of group G Hence A is intuitionistic fuzzy subgroup of group G.
Therefore , A(g-1 x g) = A(x) and A(g-1 x g) = Theorem (3.7) : If A and B be two IFSG’s of a
A(x) for all x  A and g G group G, then A  B is IFSG of group G .
 A(g-1 x g) = A(x)   and A(g-1 x g) =
A(x)    A(g-1 x g)   and A(g-1 x g) Proof. By Theorem (3.6), A  B is IFSG of group G
  and so g-1 x g  C , (A) . if and only if C , (A  B ) is a subgroup of G. but
Hence C , (A) is normal subgroup of G. as C , (A  B ) = C , (A)  C , (B) and both
C , (A) and C , (B) are subgroups of G and
Theorem (3.6) : If A is Intuitionistic fuzzy subset intersection of two subgroups of a group is a
of a group G . Then A is intuitionistic fuzzy subgroup of G implies that C , (A  B ) is a
subgroup of G if and only if C , (A) is a subgroup subgroup of G and hence A  B is IFSG of group G
of group G for all  ,   [0,1] with +   1 .

Proof. Firstly let A be intuitionistic fuzzy subgroup Remark (3.8): Union of two IFSG’s of a group G
of group G . Then the result follows by Theorem need not be IFSG of group G
(3.4)
Example (3.9): Consider the Klein four group.

IFRSA International Journal of Data Warehousing & Mining |Vol1|issue 1|Aug 2011 89
P.K. Sharma| Intuitionistic fuzzy Groups

G = { e , a , b , ab } , where a2 = e = b2 and ab =  C,(AB) = C,(BA) ; for all  , [0,1]


ba with  +   1 .
For 0  i  5 , let ti , si [0,1] such that 1 = t0 > t1 >..  AB = BA
> t5 and 0 < s0< s1<…< s5
Define Intuitionistic fuzzy subset A and B as Corollary (3.11) Let A be IFSG of group G, then
follows: AA=A
A = { < x, A(x), A(x) > : x G} and B = { < x,
B(x), B(x) > : x G} , where A(e) = t1, A(a) = t3 Proof : Since A is IFSG of group G  C,(A) is
, A(b) = A(ab) = t4 , A(b) = A(ab) = s4, A(a)= s3, subgroup of group G , for all  , [0,1] with  + 
A(e)= s1 1
B(e) = t0, B(a) = t5, B(b) = t2, B(ab) = t5, B(b) =  C,(A) C,(A) = C,(A)
B(ab) = s5, B(a)= s2, B(e)= s0 [ As H is subgroup of group G  HH = H ]
Clearly A and B are IFSG of the group G .  C,( AA) = C,(A), for all  , [0,1] with  +
(i) Now A  B = { < x, (A B )(x) , (A B )(x)  1
> : x G} , where  AA = A

(AB )(x) = Max{ A(x) , B(x)} = A(x) Definition (3.12): Intuitionistic fuzzy left and
B(x) and right cosets
(A B )(x) = Min{ A(x) , B(x) } = A(x) 
B(x) Let G be a group and A be IFSG of group G . Let x
Here (AB )(e) = t0, (AB )(a)= t3 , (AB) G be a fixed element. Then the set xA = {(g ,
(b) = t2 , (AB )(ab) = t4 xA(g), xA(g)) : g G} where xA(g) = A(x -1g)
(A B )(e) = s0 , (A B )(a) = s2 , (A B )(b) = and xA(g) = A(x -1g) for all g G is called
s4 , (A B )(ab) = s4 intuitionistic fuzzy left coset of G determined by A
C t3 , s4(A) = { x : x G such that A(x)  t3 , A(x) and x
 s4 } = {a , e } similarly , the set Ax = { ( g , Ax(g) , Ax(g) ) : g
C t3 , s4(B) = { x : x G such that B(x)  t3 , B(x) G } where Ax(g) = A(gx -1) and Ax(g) = A(gx
 s4 } = { e }
-1
) for all g G is called the intuitionistic fuzzy
C t3 , s4(AB) ={ x : x G such that AB(x)  t3 ,  right coset of G determined by A and x .
AB (x)  s4 }
Remark (3.13) : It is clear that if A is intuitionistic
= { x : x G such that A(x) B(x) t3 ,  A (x)
fuzzy normal subgroup of G, then the intuitionistic
 B (x) s4 }
fuzzy left coset and intuitionistic fuzzy right coset of
={e,a ,b}
A on G coincide and in this case , we call
Since{ e , a , b } is not a subgroup of G i.e. C t3 , s4(A
intuitionistic fuzzy coset instead of intuitionistic
B) is not a subgroup of G and hence A  B is not fuzzy left or intuitionistic fuzzy right coset .
IFSG of group G.
Example(3.14) : Let G be a group . Then
Proposition(3.10) Let A and B be two IFSG’s of
A = { < x , A(x) , A(x) > , x  G : A(x) =A(e)
group G . Then AB is IFSG of group G if and only
and A(x) = A(e)}is intuitionistic fuzzy normal
if AB = BA subgroup of G
Proof. Now AB is IFSG of group G  C,(AB) Proof . It is easy to verify
is subgroup of group G for all  , [0,1] with  + 
1. Theorem (3.15) Let A be intuitionistic fuzzy
As A and B be two IFSG’s of group G  C,(A) subgroup of a group G and x be any fixed element of
and C,(B) are subgroup of group G for all  ,  G . Then
[0,1] with  +   1 . (i) x . C , (A) = C , (xA)
Now C,(A) C,(B) is subgroup of group G 
C,(A) C,(B) = C,(B)C,(A) (ii) C , (A).x = C , (Ax) for all  ,   [0, 1]
[ As for two subgroups H and K of a group G , HK is with  +   1 .
subgroup of G if and only if HK = KH ]

IFRSA International Journal of Data Warehousing & Mining |Vol1|issue 1|Aug 2011 90
P.K. Sharma| Intuitionistic fuzzy Groups

Proof. (i) Now C , (xA) = { g  G : xA(g)   f  C ,  ( A)   C ,  ( f ( A )) ,  A  IFS ( X )


and xA(g)   } with  +  1 (i)
Also x .C , (A) = x .{y G : A(y)   and A(y)
 } f 1  C ,  ( B)  = C ,  ( f 1 ( B )) ,  B  IFS (Y )
(ii)
= { x y  G : A(y)   and A(y)  }
Put xy = g so that y = x -1g Proof . ( i ) Let y  f (C  , (A) ) be any element,
 x .C , (A) ={gG: A(x -1g)   and A(x -1g) then ’s x  C  , (A) such that
} f (x) = y and A(x)   and A(x)  
= { g  G : xA(g)   and xA(g)  
} {  A ( x) : x  f 1 (y)}   and {  A ( x) : x  f 1 (y)}  
Thus x .C , (A) = C , (xA) for all  ,   [ 0 ,
i.e.  f  A ( y)   and  f  A ( y )  
1] with  +   1
(ii) Again C , (Ax) ={g  G: Ax(g)   and Ax(g)
i.e. y  C  , ( f (A) ) ,
 } with  +  1
Hence
Also C , (A).x = { y  G: A(y)   and x(y)  f  C , ( A)   C , ( f ( A )) ,  A  IFS ( X )
 }. x
= { yx  G : A(y)   and x(y)
 }
Put yx = g so that y = gx -1

(ii) C ,   f 1  B   = x  X :  f 1  B ( x)   ,  f 1  B ( x)   
C , (A).x = { g  G : A(gx -1)   and x(gx -1) =  x  X : B ( f (x))   ,  B ( f (x))   
}
=  x  X : f (x)  C ,   B 
= { g  G : Ax(g)   and Ax(g)  }
Hence C , (A).x = C , (Ax) for all  ,   [ 0 
= x  X : x  f 1  C ,   B   
, 1] with  +   1 .
= f 1  C ,   B  
Theorem (3.16) : Let A be intuitionitic fuzzy
subgroup of group G . Let x , y be elements of G Theorem(4.2) : Let f : G1  G2 be surjective
such that A(x)  A(y) =  and A(x)  homomorphism and A be IFSG of group G1. Then
A(y) =  . Then f (A) is IFSG of group G2 .
(i) xA = yA  x -1y  C , (A)
Proof. By Theorem 3.6 , it is enough to show that
(ii) Ax = Ay  xy -1 C , (A) C  , ( f (A)) is subgroup of G2 for all  ,   [ 0 , 1
] with  +   1 .
Proof. (i) Now xA = yA  C , (xA) = C , (yA) Let y1, y2  C  , ( f (A)) be any two elements, then
 x .C , (A) = y. C , (A) [ by Theorem
(3.12)(i)]  f A ( y1 )   ,  f A ( y1 )   and  f A ( y2 )   ,  f A ( y2 )  
 x -1y  C , (A) [ As C , (A) is a subgroup of
G]
(ii) Again Ax = Ay  C , (Ax) = C , (Ay) By Prop. (4.1)(i) we have
 C , (A) .x = C , (A) .y [ by Theorem f  C ,  ( A)   C ,  ( f ( A )) ,  A  IFS (G1 )
(3.12)(ii)]
 xy -1 C , (A) [ As C , (A) is a subgroup of Therefore ’s x1 and x2 in G1 such that
G]
 A ( x1 )   f  A ( y1 )   ,  A ( x1)   f  A ( y1)   and
4. HOMOMORPHISM OF INTUITIONISTIC  f  A ( x2 )   f  A ( y2 )   ,  A ( x2 )   f  A ( y2 )  
FUZZY GROUPS
  A ( x1 )   ,  A ( x1 )   and  A ( x2 )   ,  A ( x2 )  
Proposition (4.1)
Let f ; X  Y be a mapping. Then the following 
holds  A ( x1 )   A ( x2 )   and  A ( x1 )   A ( x2 )  

IFRSA International Journal of Data Warehousing & Mining |Vol1|issue 1|Aug 2011 91
P.K. Sharma| Intuitionistic fuzzy Groups

As A is IFSG of group G1 . Therefore Now f(A)( g2-1y g2) = f(A)( f ( g1-1x g1)) [ As f is
 A ( x1 x21 )   A ( x1 )   A ( x2 )   and  A ( x1 x21 )  A ( x1 )   A ( x2 )  
homomorphism ]
 = f(A)( y ) , where y = f ( g1-1x g1) = g2-1y g2
 A ( x1 x2 1 )   and  A ( x1 x2 1 )   =   A( x ) : f (x) = y for-1 x G1
=   A( x ) : f (x) = f ( g1 x g1) for x G1
=   A(g1-1x g1): f (g1-1x g1) = y = g2-1y g2 for
xA, g1G1
 x1 x2 1  C ,  ( A)  f  x1 x2 1   f  C ,  ( A)   C ,  ( f ( A))
=   A( x ): f ( g1-1x g1) = g2-1y g2 for xA,
1 1
 f ( x1 ) f ( x2 )  C ,  ( f ( A))  y1y 2  C ,  ( f ( A)) g1G1
Hence C ,  ( f ( A)) is a subgroup of G 2 =   A( x ): f ( g1)-1 f (x) f (g1) = g2-1y g2 for
xA, g1G1
Corollary (4.3) : If f : G1  G2 be homomorphism =   A( x ): g2-1 f (x) g2 = g2-1y g2 for xG1
of group G1 onto a group G2 and { Aj : j I } be a =   A( x ): f (x) = y for xG1
family of IFSG’s of group G1 , then f (  Aj) is = f(A)( y )
IFSG of group G2 . Similarly , we can show that f(A)( g2-1y g2) = f(A)(
y)
Theorem (4.4) : Let f : G1  G2 be Hence f (A) is IFNSG of group G2 .
homomorphism of group G1 into a group G2. Let B
be IFSG of group G2. Then f -1(B) is IFSG of Theorem(4.6) : Let G be a group and A be IFNSG
group G1 .. of group G . Then there exists a natural
homomorphism f : G  G/A defined by f
Proof. By Theorem 3.6, it is enough to show that (x) = xA ; for all x G
C  , ( f -1(B)) is subgroup of G1 for all  ,   [ 0 , Proof. Let f : G  G/A be a mapping defined by
1 ] with  +   1 . f (x) = xA ; for all x G
Let x1, x2  C  , ( f (B)) be any two elements,
-1
We show that f is homomorphism
then i.e. f (xy) = f (x) f (y) ; for all x , y G
 f  B ( x1 )   ,  f  B ( x1 )   and  f  B ( x2 )   ,  f  B ( x2 )  
1 1 1 1 i.e. (xy)A = (xA)(yA) ; for all x , y G
i.e. B ( f ( x1 ))   ,  B ( f ( x1 ))   and B ( f ( x2 ))   ,  B ( f ( x2 ))   Since A is IFNSG of group G , therefore we have
A( g-1x g) = A( x ) and A( g-1x g) = A( x ) ;  x
 B ( f ( x1 ))  B ( f ( x2 ))   and  B ( f ( x1 ))  B ( f ( x2 ))  
A and g G
As B is IFSG of group G2 . Therefore
Or equivalently, A(xy) = A(yx) and A( xy ) = A(
 B ( f ( x1 ) f ( x2 ) 1 )   B ( f ( x1 ))   B ( f ( x2 ))  
yx) ;  x , y G
 B ( f ( x1 ) f ( x2 ) 1 )   B ( f ( x1 ))  B ( f ( x2 ))   Also
 B ( f ( x1 ) f ( x2 ) 1 )   and  B ( f ( x1 ) f ( x2 ) 1 )    xA  g    xA ( g ) ,  xA ( g )     A ( x1g ) ,  A ( x1g )  ;  g  G
 f ( x1 ) f ( x2 ) 1  C ,  ( B)  f ( x1 x2 1 )  C ,  ( B)
 x1 x2 1  f 1  C ,  ( B)   C ,  ( f 1 ( B)) [ By Prop. 4.1(ii) ]
1
 x1 x2  C ,  ( f ( B))1
 yA  g     yA ( g ) ,  yA ( g )    A ( y1g ) ,  A ( y 1g)  ;  g G
1
Hence C ,  ( f ( B)) is a subgroup of group G1

 (xy)A g    ( xy) A ( g ) ,  ( xy) A ( g)    A (( xy)1 g) ,  A (( xy)1 g)  ;  g G


Theorem(4.5) : Let f : G1  G2 be surjective
homomorphism and A be IFNSG of group G1.
Then f (A) is IFNSG of group G2 . 
g  rs g  rs

Now  (xA)(yA)  g      xA (r )   yA ( s)  ,   xA (r )   yA ( s)  ;  g  G

Proof : Let g2  G2 and y  f (A) be any elements.


=     ( x r)   ( y s)  ,
g  rs
A
1
A
1
  A ( x 1r )   A ( y 1 s) 
g  rs

We claim that
Then ’s g1 G1 and x A such that f (x) = y and
f (g1) = g2 . As A is IFNSG of group G1
 A( g1-1x g1) = A( x ) and A( g1-1x g1) = A( x
) ;  x A and g1 G1

IFRSA International Journal of Data Warehousing & Mining |Vol1|issue 1|Aug 2011 92
P.K. Sharma| Intuitionistic fuzzy Groups

 A (( xy)1 g )     A ( x 1r )   A ( y 1s)  and


g  rs

 A (( xy) g )    A ( x r )   A ( y s)  ;  g  G
1 1 1


      A ( xy 1 )   B ( y)  ,
z  xy 1A
  A ( xy 1 )  B ( y)  
z  xy 1A 

g  rs  (0,1) otherwise 

Now  A (( xy)1 g )   A ( y 1 x 1 g )
=  A ( y 1 x 1rs) 

   
z  xy 1A
  A ( e)   B ( y )  , 
z  xy 1A

 A (e)  B ( y) 
=  A ( y ( x rsy ) y)
1 1 1

 (0,1) otherwise 

=  A ( x 1rsy 1)
  A ( x 1r )   A ( sy 1 )
=  A ( x r)   A ( y s)
1 1
;  g = rs  G

 
   ( y) ,
  z  xy 1A B

z  xy 1 A
 B ( y )  

(0,1) otherwise 

Thus  A (( xy)1 g )     A ( x1r )   A ( y 1s)  ;  g  G
g rs

Similarly , we can show that



 
   ( y) ,
  y  z 1xB B

y  z 1 xB
 B ( y )  

(0,1) otherwise 

 A (( xy)1 g )    A ( x 1r )   A ( y 1s)  ;  g  G
g  rs

Thus  ( xy) A ( g )   ( xA)( yA)  ( g ) holds ;  g  G  


    ( z 1 x)  ,
  z 1xB  B    B ( z 1 x)  
z 1 xB



 (xy)A = (xA)(yA) 
 (0,1) otherwise  
 f ( xy)  f ( x) f ( y)
Hence f is homomorphism Also

Theorem(4.7) : Let A= { < x , A(x) , A(x) > , x  


f 1  f  B  ( x)   f 1  f  B  ( x) ,  f 1  f  B  ( x) 
G such that. A(x) = A(e) , A(x) = A(e) } be
IFNSG of group G and B be an IFS of group G and
f : G  G/A be natural homomorphism defined by f
=
    ( f ( x)) , 
f B f  B
( f ( x)) 
(x) = xA , for all x G , then
f -1( f (B) ) = A  B

Proof : Let x G be any element , then



     ( y) ,
  f ( x ) f ( y ) B

f ( x ) f ( y )
 B ( y) 
 otherwise 
(AoB)  x 
 
   ( z )   ( y) ,   ( z )  ( y)

  x  zy A B  x zy  A B   (0,1) 


 (0,1) otherwise 
 

  
   B ( y) ,
xy 1A
  B ( y ) 
xy 1A





(0,1) otherwise 


     A ( z )  B ( y) ,  
 A ( z )  B ( y) 
  , where z = xy
  z  xy 1A z  xy 1A

 (0,1) otherwise      ( y) ,   B ( y) 1
  y  z 1xB B y  z 1xB

(0,1) otherwise 

IFRSA International Journal of Data Warehousing & Mining |Vol1|issue 1|Aug 2011 93
P.K. Sharma| Intuitionistic fuzzy Groups


    ( z 1 x)  ,

  z 1xB  B  z 1 xB

  B ( z 1 x)  



 (0,1) otherwise  
Thus f 1  f  B   ( x)  (AoB)  x  , for all x  G
Hence f 1  f  B    AoB

5. CONCLUSION
As in the Theory of Fuzzy sets the Level subsets are
very Important tools for the development of the
subject. Similarly in the Theory of Intuitionistic
Fuzzy sets the (  ,  ) – Cut of Intuitionistic fuzzy
sets are very Important tools for the development of
the subject.
REFERENCES
[1] Atanassov K.T , “ Intuitionistic fuzzy sets”,
Fuzzy Sets and Systems 20(1986) , no.1, 87-
96
[2] Basnet, D.K and Sarma, N.K , “ A note on
Intuitionistic Fuzzy Equivalence Relation”,
International Mathematical Forum, 5 , 2010,
no. 67, 3301-3307
[3] Biswas, R “ Vague Groups”, International
Journal of Computational Cognition , Vol. 4 ,
no. 2, June 2006
[4] Kul Hur and Su Youn Jang, “The lattice of
Intuitionistic fuzzy congruences",
International Mathematical Forum, 1, 2006,
no. 5 , 211-236
[5] Palaniappan, N, Naganathan,S and Arjunan, K
“ A study on Intuitionistic L-Fuzzy
Subgroups”, Applied Mathematical Sciences,
vol. 3 , 2009, no. 53 , 2619-2624
[6] Zadeh,L.A, “ Fuzzy sets”, Information and
Control 8 , (1965), 338-353

IFRSA International Journal of Data Warehousing & Mining |Vol1|issue 1|Aug 2011 94

View publication stats

You might also like