jacy Classes CRP Eines 'fabeG, then b Is sald to be a conjugate of a in G if there exists an slemient g eG such that b=g'ag. Symbolically, we write @ ~ b and refer to this relation as conjugacy. Note Ay can also define the conjugate of an element as follows: If a,b eG, then b Is sald to be a conjugate of a In G If there exists an element g eG such that b= gag. Saree Conjugacy between elements of a group is an ®quivalence relation on G. i im Let abceG. 1. Reflexive Since a= eae, so als conjugate of ain G, le. a~ a. This shows that ~ Is reflexive.Let las, [bj then a then threla x.€@ such hat bax “ex = xx" = x(x“ax)x" = (x1)100") = 080 =y"by=a >b~a This shows that ~ symmetric. Transitive Let a~b,b~c, then there are x,y €G such that b=xax and cay "by Using the value of b from (1) in (2), we have cay (xaxy =x "alxy) = (xy)"alxy) . anc aye This shows that ~ is transitive, } Hence ~ is an equivalence relation, GEXLAMIET I » is © conjugate of a, then we say that @ and b are conjugate elements, yexteG (1) (2) 15.5.4 Detintion i ee el conjugate of @ In G is (a) or c,, Thus, Cla)={xeG:a~x) Or ments of @ group G which are od conjugate cless of a in G. It'ls denoted by Cla) ={9"ag: 9 eG} ram Rte stoment bea group an ‘tame ordor, ij to conjungate laments, <6 bee Since a and b the conuagete lomenta, to there Is some g eg 8=9"'bg 28 =(g"boy ‘such that=a=g'h'g =g"eg =9"9 =0 =msn ()le]=m =nsm Q) v|q=n From (1) and (2), we have m=n ‘Tis shows that conjugate elements have same order. GEELEMIIETE An element a of a group G is said to be self conjugate if there exists an element g eG such that a=g“ag. > Identity element ¢ is self conjugate. Every el abel iuaat Pn |! G is a group and xyeG, x“y'xy is called the commutator of x and y or, more briefly, a commutator. We often write [iy] for the commutator x“"y“*xy. Prove that the inverse of a commutator is a commutator. Let G be a group and-x,y eG. If zis the commutator of x and za[xylax ty yy ‘Teking inverse, we have sory ty)" aretytyty For V, = {e,,b,ab}, find the conjugate classes 0 ce) Cay) CB) CladyGSI ¥. = (6.2.0,20) () To find C(e), we have to find those elements of V, which apy conjugate ofe. For this we check all the elements of Vs tum by tn as follows: - This shows that only @ is conjugate of 6, so C(e) = {6}. (i) To find C(a), we have to find those elements of V, which are Conjugate of a, For this we check all the elements of V, tum by tum as follows: t= ab-b=a ab-a-(ab)"" = a-ab-ab =a? .ba-b=a?-ab.b=a This shows that only a is conjugate of a, so C(a) = {a}. {ill To find C(b), we have to find those elements of V, which are Conjugate of b. For this we check all the elements of V, turn by tum «as follows: =ab-a=a-ab=a’b=b b-b-b*=b?-beb ab:b-(ab)' = ab? -ab=a-6-ab = ab =b This shows that only bis conjugate of b, 80 (0) =(b} (W)To find (ab), we have to find those elements of V4 which are Conjugate of ab, For this we check all the elements of V, turn by tum as follows: aba ab = ab-b-b=ab® = ab @b-ab-(ab)* =a. ‘ab-b-ab = a -b? .ab =6-0.ab— ab ‘This shows that only ab is conjugate of ab, so (ab) = fab). GERDIEEIIE "5, ~(0.00%,t00,0%), tra tne conjugate classesCie") (wy) , ae) Cla) ‘ lab) (wi) (2b) Sy ={0,,8,b,ab,a"b} Betwe write Cayley table of Ss which we have discussed in chapter 4 Fe table will be very useful in performing operations among the Tements of Sa. ET Saat enna aanienen = etal@# {ob | ab | ab e [a | a |b | ab [ab I ala le |ablabl b I @{[e | a |#b| b | ab ; b le@blable [ala ab |b [ebl a |e | & eb bte#@ ls le Cayley Table of S; |) To find C(e), we have to find those elements of S, which are conjugate of @. For this we check all the elements of Sy tum by tum as follows: (@?)-@-(a?)* =(a)-(a?) =e . bee. bt =e ab-@-(ab)' = ab-(ab)" =e (a°b)-e-(a?b)"* = (a*b) (ab) This shows that only ¢ is conjugate of e, so C(e)={e}. (i) To find C(a), we have to find those elements of S, which are conjugate of a. For this we check all the elements of S turn by tum. ota-o aaa” @)-a- b ab-b=a? ab-a-(ab)* =ab-a-ab=b-ab (6%): a-(a%b)" =2%b-@-a’b=ab-a*b=a ‘This shows that only a and a? are conjugate of a, 50 (a) = {a,a7)(ii) To find C{a?), we have to firid those elements of Sy which ary conjugate of a. For this we check all the elements of Sp turn by tyr, e-a? et =a? ana (@?)-2?(a?)" = b-a?-b" =ba®-b=ab- ab-a? «(ab)" = ab-2?-al (a?b)-2®.(a*b)" =0%b-2?-a%b=b This shows that only a and a” are conjugate of a?, 80 . oe?) =(a.0"} (W)To find C(b), we have to find those elemer conjugate of b, For this we check all the elements of Ss nts of S, which are turn by tur, ba? =a" a*b-b-a*b =a? -a*b=ab This ghobs that only bab and a*b are conjugate of b, 50 ef O(b) = {0,ab, 276) (W) To find Clab), we have to find those elements of S which are ‘conjugate of ab. For this we check all the elements of S, turn by tu. e-ab-e' =ab a-ab-a*=a%b-a? =b (a?)-ab-(a?)* =a" -ab-a=ba=a*b b-ab-b* = bae=a*b ab -ab-(ab)"' = ab-ab-ab = @-ab = ab (2%b)-ab-(a%6)" = a*b-ab-a*b=a-a*b=b This shows that only b, ab and a®b are conjugate of ab, so Cab) = {b,ab,ab) (W)To find C{a*b), we have to find those elements of Sy\which are conjugate of ab.forthis we check al the elements of s, tun o-a*b-0" =a byt, ab-a=ba=atb b-a’b-b = ba?e=ab . ab-2b-(ab)" =ab-0b. ab =a? ap

C, by NS tn HNg)=g"ag, Vg eG (i) Well defined First we show that ¢ is well defined, for this let Noy = Noe = Naga! =N = agz' eN VO =e saeN aN =Nas.n™ This shows that ¢ is well defined. (ii) Onto Next we show that ¢ is onto. Since for every g”'ag €C,, there is some Ng «@ such that This shows that ¢ is onto. (lil) One-One ‘Next we show that ¢ is one-one, for this let Ng) = KNa2) = 95'89,=97'892 = onloi'au,)a3' =@ = (9,97')"'alg,92')=8 =ayg;' ¢N = Naga’ =" = Ng, = Noe This shows that ¢ is one-one, ‘This shows that ¢:92-G, Is a bijective mapping, 80 [ea|=|6:No(@l-eee kee RM Let G be a finite group and ae, then the number of ar; conjugacy class C, of an element ain G dlvides the order pment 7 4,18 [Cal ovides |G). . meee since No(a) is a subgroup of G, so by Lagrange's theorem, index z (@) in Gdvides the order of G, ie. |G: Ng(a) divides |. a theorem, we have proved that ay previous IG: N(a=Ic,] jis shows that |C,| divides [a]. (GRERIEAINME The number of elements in a conjugacy class of an ‘gement in @ group is finite if and only ifthe index of the normalizar of that ‘ements fnite. (IEEE Let G be a group and eG, then ©, = {beG:b= gag" forsome g «G) No(a)= {9 €G: ga = ag} Sin |G: No(@=[C,|, 80 | [G:Ng(e <0 a =[Ci K by ah)=ghg" eK () Woll defined First we show that ¢ is well defined, for this let h=h, = 9h = gh, =ghg = Hh, ‘This shows that ¢ is well defined. (il) Onto 4 Next we show that ¢ is onto. q ‘Since for every ghg~' < K, there is some he H such that ah) =ghg™ This shows that ¢ is onto. (iii) One-One ‘Next we show that ¢ is one-one, for this let (h,) = #2) = ghg" = gh." Shah This shows that ¢ is one-one. This shows that 4: HK is a bijective mapping, so lHI=IK) ‘Any two conjugate subgroups of a group G a isomorphic to each other. Let G be a group and H and K be two conjugate, then K=gHg™ for some g «G Noxt define'a mapping ¢:H —>K by ah) =ghg"' eKjefined now that ¢ Is well defined, for this let hy=hy = gh, =gh, = ghg" =gh,g" = o(hy)= oh.) This shows that ¢ Is well defined. qonto Next we show that ¢ Is onto, since for every ghg eK, there Is some heH such that . h) = ghg™ This shows that ¢ is onto. . (i) One-One 7 Next we show that ¢ is one-one, for this let oh, = Hh) = ghg"' = gh," . Shah, ) This shows that ¢ Is one-one. (lv) Homomorphism Next we show that ¢ Is homomorphism, for this let byte) = ahuheg™ =ohehg” = ghg"gh.g" = (ahg")(gho™) = o(h,)o(he) This shows that ¢ [Is @ homomorphism. Hence, ¢: being bijective homomorphism, Is an lsomorphis. Consequently H and K are isomorphic, aK.