3.2 Binary Operation on Sets of Ini unting numbe; Piece numbers 12,3... ... the number zero ‘0° and the negatives o coers The set of poe ~2, = when taken together, form the set of ote aemally useful, once wen USUally denoted by Z. ‘The set Z becomes practically ce We can combine or operate on two (hi = two) integers ) in some or other way; and then form 4 precisely defined binary operation tegers a) Binary Operation _— Any rule a assigns to each ordered pair of elements in the set Z of integers a unique element of Z, called a binary (bi = two) operation on Z. In symbols, we may consider it as a function f defined by f:ZxZ3z In practice, a variety of symbols such as *, 8,8, ox, 4 are being used to denote a binary operation. Written in terms of elements, the definition of a binary operation looks like: “A binary operation * on the set of. integers Z associates each ordered pair of integers (m,n) Zx Za unique element c€ Z.” In such a case, the set is said to be closed under the operations or the operation has a closure property. Two of the most common binary operations on Z are the addition operation, denoted by ‘+”, and the multiplication operation denoted by ‘x’ Addition: The operation of addition denoted by ‘+’ says ‘to each pair of integers m and n, there is an integer x such that m+ n = Here, the number x is called the sum of m and n. For instances, 1 + 2= 3, 5+4=9, 2+ (-2)=Oete. Multiplication: The second operation multiplication denoted by ‘x” or “” says ‘to each pair of integers m and n, there is an integer y such that mx n y For instances, 1 x 2=2,5x 4=20,2x (-2)=—tetc. Here, the number y is called the product of m and n, The product of m and nis also denoted by mn, m(n), (m)n, (m)(n) or simply mn. Scanned with CamScanneroo rations: mand the number zero ‘0’, the bin, b) Properties of binary OP@ Addition: Given an intege! +4? of addition yields eon en ntorornean GB nor" Here, the number «9 is called the additive identily. Given ar n and the number ication yields operation ir “7, the bi Multiplication: n integer / he bin, ‘operation So of multip! nxl=ixnen jax 1213-3) ve identity. called the multiplicatl eger 1, there is a unique Here, the number ‘Vis ative): For each int Additive Inverse (or ne} integer, denoted by 1, such that nt(cn)=(tn=0 Here, the number (-7) is called the perties of Addition an [G+ 3)=03)43= 0) additive inverse (OF negative of n). d Multiplication: Given The associative pro} three integers m, n, and p if mt+(ntp)=(m+n)+p and mx (nx p)=(mx n)X P . [1+@+3)=(+2)+3=6 and 1x (2x 3) =(1x 2)x 3=6] en the addition and multiplicati i ‘ati ae multiplication operation have the associative property Commutative properties of additi ; ion and multiplication: Gi integers m,ne 2 ifm + n= n+ mand mn = nm then ea a ultiplication operation have the commutative property resp a aditon eth ee, in Distributive properties: Given three integers m,n and mee mx (n+p) xntmxp and : , (m+n)x p= [4x (2+3)=4x2+4x3=20 and (4+2)x er 2x 3=18] c) Composition table or Operation table Consider a fnite set G with a bit ee se G with a binary operation denoted b ox malian (6) Thea the binary operation 2 the eee Sere sreration ble Such a Bas table known as the eomeritioal aoe — operation tab 8 table was first preps ae table is also known as Cayley’s table by eames 7 ne Coven so ts We can visualize this si ; i s situation by st constructed with th ine ee eee aa ‘castro yy when the set has only a small finite nex ihe 1m r Scanned with CamScannerElementary Group Theory 51 1. Binary Arithmetic: Let G = {0, 1}. Computation under binary arithmetic is carried out in the following way: 0+0=0; 0+1=0 1+0=1; 1+1=0 Its tabular or Cayley’s form is 2. Set Relation: Let G denote the set of subsets of the set {0, 1}. Here G = {6, {0}, {1}, {0, 1}}. Consider the union relation as our binary operation. Then, it can be represented in the following form: a | 1 Scanned with CamScannerLen s divided by a positivs teger ai itive in! i 4, Congruent Mod ae ey mm) as the quotient and the inteset © ene the positive ie congruent b modulo m’ and is WTittey remainder respectively then we ©! a ener Bed de his divisible by as a=b (mod. 1). Also, if a and oS two y ositive integer 777, then a= 5 (moe. m ir aan ror example: 120 is divided By 3, the quotient Dee * ape is 2, so we say that 20 congruent 2 modulo 3 ie. 20 = me ; ‘b " = 10 =16=22=1 (mod. 3) because when each of the num , 10, 16 and 22 is divided by 3, the remainder in each case 1S le Also, 8 + 5= 1324x3412 1 (mod. 3) the quotient and I, the 3 gives 4 as um 8 + 5 divided by : ulo 3 and is represented Here, the s remainder. The operation is called the addition modi by +3. Further, we have 8 x 4=32=10x3+2=2 (mod. 3) s the quotient and 2, the ded by 3 gives 10 a: led the multiplication modulo 3 and is Here, the product 8x 4 divi remainder. The operation is cal represented by x3- Similarly, 4 + 8=0 (mod. 3) and 4 x 9 = 0 (mod. 6) e the following composition table of the a odulo 3 for the set G = {0, 1, 2} Let us havi iplicati id lo 3 and the multiplication m dition modulo Scanned with CamScanner53 Elementary Group Theory Scanned with CamScannerExample 7 t {0, 1}. Show that Let G be the set of subsets of the set { } the sq closed under the operation of union. Solution: The subsets of G are }, {0}, {1} and {0, 1} G= {, {0}, (1, (0, 1} The union of any two elements of G is again an element of 6 {0} = {0} €G, {0} U {1} = (0, 1} € Gete. G is closed under the operation of union. Example § {the binary operation * on Q the set of rational numbers is defined a*b=at+b-—ab for everya,b ¢ Q Show that * is commutative and associative. Solution: be) At (bte_ pg, dab + 4+ b~ aby 7. (a* b)« (at b~ ab) Scanned with CamScanner1. A binary operation * is defined on the set of integers by a)man=mtn b) m= n=m—n o)m*n=mn+m+n Find m * nif i) m= 3 and n= 5 ii) m= 2and n= 5. Solution: a) i) m*n=m4n=345=8 -3 ii) m*n=mt+n=2-5 b) i) m*n=m-n=3-5=-2 ii) m*n=m-n=2-(5)=7 co) i) m*n=mnt+m+n=(3)(5)+3+5=23 ii) m*n=mn+mtn=2¢5)+2+(5)=-13 2. Sis given set and a, b S. An operation *is defined on S. Prove the statement given in each of the following for ~ a) = {-1,0, l};a*b=arbisnot a binary operation. b) = {1,2, 4}; a b= ab is nota binary operation. c) eae 6, 8, 10, ...}; a * b= a+b isa binary operation d) S=set of integers; a * b=a-bisa binary operation Solution: a) a*b=atb=1+1=2¢S8 Hence * defined bya * b=a + is not a binary operation. by atb=ab=2x4=8¢8 Hence * defined by a * b= ab is not a binary operation. Scanned with CamScanner3. S= t S operation of multiplication. [ 1} and x denotes the usual operation | F pu a "Re c fi ; hat the multiplication is a binary Represent it by operation on S. Cayley’s table. Show d Solution: Cayley’s table is given below | 1 From the above table, -CD=1l=1¢eS8 -Li=1(-1)=-leS *. multiplication is a binary operation. Let G be the set of subsets of the set {0, 1}. Show that the set G is 4, closed under the operation of intersection. Solution: The subsets of {0, 1} are 9, {0}, {1}, {0, 1} Then, G = {@, {0}, {1}, (0, 1}} 20}=0EG, {0} {0,1}={0} eG {0} N{l}=aeES, {1} 7 {0,1} = {1} €G etc. The intersection of any two elements of G is also an element of G. .. Gis closed under the operation of intersection. Scanned with CamScanner6. Test the closure, associative and commutative properties for each of the following cases a) _ the operation defined by m * 1 =Som -n)yon Z, m,n € Z. o b) the operation defined by m * 1 =n on Z, m,n € Z. c) the operation defined by m* n= m+n Lm Solution: a) Form=1, ae neZ) m sn=t mn) 1 > it2=ta-2=-4ez -. Zisnot closed under *. Associativity: m =—1,n = 1, p =2 (m,n, p € Z) areal *2) =-1*3d -na-1*(- ale NIP q+4y €Z Scanned with CamScanner"2 Again, (m #9) * P= 1ey-1y*2 =7C1 !) 1 ept2=7C1-9) 3 =-7eZ * emt(ntpyz(m*n)*P property is not satisfied. Herem = 1,0= 2 (™? 7) ©. associativity Commutative property? 1 1 . mén=b#2=5(1-2)=-9 ©% 1 o n*m=2*1=7(2-1)=7 #2 m*n#n*m <. commutative property is not satisfied. b) Closure property: Form,neéz,m*n=neZ + closure property is satisfied. - Associativity: For m,n, p'€ Z, m*(n*p)=m*p=p Again, (m*n)*p=n*p=p /m*(n*p)=(m*n)*p «’. associativity is satisfied. Commutative property: For m,n éz,m*n=n Again, on*m=m om*nén*m i.e. commutative property is not satisfied, ) Closure property: For m,n € Z m*n=m+nt+leZ ° -. closure property i satisfied, Scanned with CamScannerAssociativity For m,n, p € Z m*(n*p)=m*(nt+p+ 1) =mtnt+ptiltl =mtn+pt2 n(m*n)*p=(m+n+1)*p =mt+ntl+ptl =mtntp+2 m*(n* p)=(m*n)*p i.e. * satisfies associativity property. Commutative property For m,n € Zz m*n=mtnt+l =nt+m+l=n*m -. * satisfies commutative property. Scanned with CamScannerAlgebraic Structure A set together with the binary operation is known as the algebraic structure. Thus, (Z, +) and (Z, x) are the algebraic structures where Z is the set of integers. Ifa, b,c € G then the algebraic structure (G, *) is i) closed ifa,beGaa*beG ii) commutative ifa *b=b*a for alla, be G iii) associative ifa * (b * c)=(a*b)*c for alla,b,c eG iv) _ said to exist identity element e ¢ Gifa*e=e*a=a fora eG. v) _ said to exist inverse element a’ ifa* a’ =a’ *a=e fora,a’ eG. ~~ Scanned with CamScannerjs defined bY the eration +: ration *4 inary OP“ = 40,1.2.3) and a bi I. Given a set Z Solution: vs From the table, 0+2=2+0=2, 33407 So, 0 is the identity element of2 and 3. = an identity element Again from the table, 2+ 2=0 =. 2is the additive inverse of 2. o 1 is the additive inverse of 3- G under multiplication s of 1 and Also, 3+1=1+3=0,s ible for rm a composition tal the inverse element 2. Let G= (0, 1,2}. Fo s and modulo 3. Find the identity element: 2. Solution: Composition table is given below x] 9 2 0 0 0 0 1 0 1 2 L2 0 2 1 Since 1 x 1=1 eGand2x1l=1x2=2eEG :, Lis identity element of I and 2. Again from the table, 1x 121 (mod.3) 2x2=1 (mod. 3) +, Lis the inverse of | and 2 is the inverse of 2. Scanned with CamScanner5. Determine the identity element and inyerse elements of 3 and —2 in each case given below. a) Given an algebraic structure (Z, *) with binary operation * defined bymen=mtn+41 forall m,n € La b) — Given an algebraic structure (G, *) with G= R-— {I}, the set of real numbers without the unit number and * stands for the binary operation defined by a* b = a + b—ab for all a, beG. Solution: a) Ife € Z bean identity clement of 3, then 0.3 =3.e=3 also,e.3 =e+3+1 => 3=e+3+1 =-l fm’ be an inverse element of 3, then m’.3 =3.m’=-l Also, m’.3=m'+3+1 ed Scanned with CamScannerb) +4 > -)=m' a m’=-5 ea,then Ife ¢ Zbean identity element of -4, e(-2) = 8 =~ Also, e(-2) +(-2)* 1 = -pee-2* 1 om 2, then Again ifm’ be an inverse clement of (2) = (2) = -l ano, meayem rat = -lem'-1 m > “=, the inverse element of -2=0 Let e ¢ Z bean identity eleinent of 3 under *, then 3e=03=3 Also, 3t+e-3e => 3 =3-2e > 2e=0 . e=0 | “= Qis the identity element of 3. Let m’ be an inverse element of 3. Then, 3.m'=0 Also, =m +3-m'3 => 0=-2m'+3 > 3 =2m’ are8 2) 33 . is the inverse element of 3. Ife be an identity element of -2 under « then ue Also, -2¢ aie (-2)=-2 2t+e+2e Scanned with CamScanner= 3e =0 e =0 =. Ois the identity clement of ~2. Again ifm’ be an inverse element of —2. Then, m’(-2) = (2).n’ = 0 Also, m’(-2) =m + (-2)+m’.2. > 0 =3m’-2 => -3m'=2 2 m’ =z 3 23 is the inverse element of —2. Scanned with CamScannerGroup If G be a non-empty set and * be an operation defined cu it, then the algebraic structure (G, *) is said to be a group if the operation satisfies the following properties. G1: Closure axiom: a * he G for all a,b € G. G2: Associative axiom: a * ( *c)=(a* b)* c for alla, bceG G3: Identity clement: There exists e ¢ G such that ate=e*a=aforallacG. G4: Inverse clement: There exists an element b € G such that a*h=b*a=e, foralla,b € G. Finite Group: A group containing a finite number of elements is known as a finite group. Infinite group: A group containing infinite number of elements is known as infinite group. Abelian group: A group G is said to be an abelian group if it sa the commutative property as well ie.a * b=b* a for a,b 0 =atbtab => 0 =atb(at+!)- a ae => b =-7e7e G(s att) = the inverse of @ i837 + G forms a’grouP under the operation of *. Scanned with CamScannerpermutation group : Let S be a finite set having 7 different elements. Then a one-one mapping of S onto itself is called a permutation of degree n. If the ss Pe of all permutations of n symbols satisfies all the four axioms of a group, then it is known as the permutation group. A binary operation 0 known as the product of permutation is defined as follows: abe ub P, OP, = bea ¢. a:b oc Scanned with CamScannerPamedCeL EDansis!s 1. Given the permutation pronp (8, *) with § = {e, 61, 0), G3, Ga, G5} where 12 3 12 3 123 hol) 1 2 3 ene ae 312 12 3 12 3 | 2 3 13 2) 3921 213 Show that a) 93 is the inverse clement of itself under product permutation. b) o3° GO) = oy c) 9 and op are the inverse of each other. d)_— (S,*) is not commutative. Solution: (ee eee 2 a) 63;0603;= ° = =s Cea 132 123 “. 3 is the inverse of itself. Scanned with CamScannerfi 23) T.2°3 d) 62 0.03 =| 8 of = \3 1a) 132 ft 2 3 Also 63 CG» = ] (from (b)) 1 3 “1 G2 06370300) .. (S, ©) is not commutative. ( 1 4 Scanned with CamScannergroup. 2. Prove that the system ({&, 63}, isa Solution: D = s0q, = ; aa Nv WY aa & oN we VY Il we oN Yb uu SL Scanned with CamScannerNv 123) 123 | wa son-( Jel | | yew 3 1 3 fas 1 2 3 The operation © is closed as 03 and € S. ii) €0(E00;)=EO0;= and (£ 0 €) 0.03 =& 003 = 93 1. £0 (6 0 03) =(£ 0 £) 953 . associativity is satisfied. iii) ¢oe=eandé 003-03 .. € is the identity element. and o3 are the invese of & and 3 respectively. iv) So, all conditions of a group are satisfied, so the system ({e, 3}, ©) forms a group. 3. Aset of matrices of the form cos@ -sin®@ «(2 oo) sin@ cos @ where 0 is areal number, is given. a) Show that the operation of matrix multiplication is closed. b) Show that Ag is the identity element of Ag. c) Show that A. is the inverse element of Ag. Solution: Let S = {Ag : 0 is areal number} Let o and i be any two real numbers, then cosa —sina cosB —sinB AaAp=| : sina cosa sinB cosB Cease —cos a sin B—sin a cos B a) sin a cos B + cos a sin B sin a sin B + cos a cos B Scanned with CamScanner" cos (a+ BY -sin(a + B) € Sasa + Bisa Teal number, sin (a4 B) cos (a +B) > Matrix Multiplication is closed. cos 0 ~sin Q cos® ~sino b) Ag.Ap = sind cos sin® cos 6 i ile cat 0 4 sin® cos@” cos® -sin 9 *. =Ao sin® cos Q -. Ao is the identity element. cos® sing cos@ ~sing ) Ag.Ag= —sin@ cos@ sin® cos cos70 + sin29 — sin 8 cos @ + sin Q ) | ~ sin 8 cos 6 + cos @ sin @ sin? + cos?9 1 0 = = Ao Oj 1 *. A.g is the inverse element of Ag. Scanned with CamScanner5. Show that the set of all positive rational numbers forms an abelian . ah group under the composition defined by a o bey Solution: ab a) Let Q* be the set of positive rational numbers. Then ao b="4" € Q! for alla,be Q. «QP is closed under ©. b) Letabce Q be) 1 te _ abe Then,ao(boc)=a0\'y j=qa = 16 1 bi and @owoe=(P)oc- 4 ) =Te ao(boc)=(aobjoc c) Let e bean identity element. Then, eca=a Also eoa= : a . a=4 => 4a=ea => (4-e)a=0 Since a #0, soe=4. > Scanned with CamScannerLet b be an inve + thena ob=4 rse element of a. IrfbeQs ab aou = g 4 tb > 4=4 16 b=— a - ab ba ac OF ae a 0 ~. the set of all positive rational numbers form an abelian group. Scanned with CamScannerTheorem I. In a group there is one and only one identity clement. (or in a group the identity element is unique). Proof. Let e be an identity clement in a group (G, ©). If possible, let e” be another identity clement. Then we have considering ¢ as the identity clement eoe’=e'0e considering e’ as the identity element. Also e oe’ =e Oe Hence e = e’, i.e. there is one and only one identity element. Theorem II. Every element in a group (G, ©) has unique inverse. Proof. We know that an element a in a group has an inverse a”! such that a'oa=e=aod! Suppose a’ is another inverse of a. So we have a’ oa=e=a0d Now, a’=eoa’, as e is the identity element =(a'oag)oa' ase=aloa =a!o(aoa’) by associativity law Scanned with CamScanner(=@ asa° 7 ice seis the identity element. * a ea! ment is unidue inverse ele! This shows that the invers G, ©) a Theorem IIL. ement of 2 groups ( , 0) mda 9, Cancellation law. I fa, b,c are the el = acc, then b=c. Also, i oa, then b= 6 fhoa= Proof. Asae 0), a has vi 1oq=a0oq!= i 1 thata’ Oa (G, 0), a has the in erse a7! such We have aob=aoc Multiply both sides of (i) by a~" on the left. Then, a!0(a0b)=a! 0(a0c) or, (a!oa)ob=(r!oa)oc _ byassociativity law or, eob=e0c because a! 0 a=e or, bec as e is the identity element. Similarly, we can show that if bo a=co a, then b=c, Theorem IV. Ifa, be (G, ©), then i) (@oayt (i) (obo oq “(obo PY) og =(ao(bo PY) 0 gt by associativity law =oeogi =aogl 88 bo FAL =e e Similarly, we can show tg os “. a0 bis the invese Of b-1 A oMo@oy. ie. (aobpla=gt ' oa ogi Scanned with CamScannerii) We have a'oa=e Multiplying both sides on the left by (a"'! we get (ay! o(¢! oa)=(a'y' 00 or, (eyo) oa(a'y! by associativity law or, eoa=(a'y! or, a=(a')'! Theorem V. Ifa and b are the elements ofa group (G, ©), then aox=b and xoa=b have unique solutions in (G, ©). Proof. Let a be an element of the group (G, a, is also in (G, o)anda!oa=aoc a'=e. Now, aOx= b aio(aox=ato b Multiplying or, (atoajox= ac! o b Associativity law 0). So a}, the inverse element of both sides by a7! on the left. or, @Ox= aiob or, x=a'ob This is the required solution. To show the uniqueness of the solution, we suppose that x; the solutions, then aox=b and aox=b each being equal to b and x2 are ox =a0x or, qio(aox) =a! 0 (40%) or, (cioajox=(4'04)0% or, 20x =eO%2 or, x =X2 So the solution is unique. that x o a= bhas a unique solution in (G; °)- Similarly, we can show Scanned with CamScanner-t = gq! o &!, for 2. Ifthe group (G, ©) is commutative show that (a © bY alla,beG. Solution: For alla, b, e Gaob=boa Again, (boa)!=al ob! => C@oby't=alob! . faa inverse, then G is 2. Prove that if every element of a group G is its own in > abelian. Scanned with CamScannerSolution: Ifa, b € G, then ab € G . (aby! = ab itis given that every element is its own inverse. (aby! = ab => blal=ab => ba=ab Coa '=aandb!=b) Thus for a,b € G, ab = ba -. Gis an abelian group. 3. If (G, ©) is a group, then the group equation x 0x = * has a unic solution x = e. Solution: Ifx e G, then x"! an inverse element xoxl=xlox=e ofx also € G such that xOXx =X > xlo(xox)=x!0x > (ctox)ox=xtox > eox =e > x=e Scanned with CamScanner10. Soln: or, A=E acre es Show that {2": n€ Z} is an Abelian g = (2™: me Z) isana roup with respect (0 multiplication. 2074 We have to prove G belian group with respect to the operation of multiplcas ; ; io (.) so we should verify the following axioms. n Let 2", 2"€ G, then m,n Z Now, 2™.2"=2*" Since, m ne Z=> m4neé Z, therefore ge Thus, 2.2" G for all 2", 2" G So, the multiplication, i.e.‘ is closed on G. If 2™, 2", 2° € G, then (2™, 2%), P= 2™*", gh = gmener and 2™, (2, 2") =2™ 2P*PagmensP Thus, (2.2") 2? = 2™, (2.2°) Hence, associative law of multiplication is satisfied. (iii) There exists the number 2° or 1 in G such that 2°.2" = 2°*" = 2” for all 2" € G. Thus, 2°= Lis multiplicative identity. For every 2" € G there exists 2°" G such thal Hence, there exists multiplicative inverse 2G ee te 2.2" for all 2", 2"€ G. Thus, the multiplication i.e. ‘.' is commutative. Hence (G,.). i.e. {2"n € Z,.} forms an abelian group. -- [2074'B', 2069 Set A] ~ Pon Meade (i) G (ii) 2.2% 29 = 29 = 1 "in G for every 2” in G. (iv) (vy) Scanned with CamScannerHICHCE, V TUrtS a BrUUp UUEE Une YER UE terre 18. Definea group. Let a, b, cand x be elements of a group G. Solve the following for x: x’ =a’ and x’ =e [2072'p, Soln: Ist Part: An algebraic structure (G, *), where G is a non-empty set with an operation '*' defined on i, is called a group, if the operation * satisfies the following four properties: (i) Gis closed under the op onof*iea x*ye GVxye G. (ii) The operation * is associative ie. (x *y) *2=x *(y *z), VX VV ZE G. (iii) Dan elemente € G such thatx *e=x =e *x, VXE G. Here, ¢ is called identity clement of x € G. For each x € G, Ty € Gsuch thatx *y=e=y *X ‘alled inverse of x with respect to *. (iv) Here, y is 2nd Part: Let ".' be the binary operation on G, Then, +: By using x? = a” Yuuy Scanned with CamScannerMutilying a sides of ( aa on the left by a‘ > => => x)= (a ey ns e.x=a"‘ x=a“ Ans, a Scanned with CamScannerSoln: Here, a * b=c. As ae G, a has inverse a” Multiplying both sides of (i) by a or, or, or, Ifa and bare the elements of a group (G,*) and if a *b =e, prove that h =a". eves (i) "such that a"! *a=a*a’!=e. ~' on the left, we get lee a'*(a*b)=a (a7! * a) * b = a"! *e by associative law. ‘teea! e*b=a! because aX! * a =e and a b=a'! ase is the identity element. Hence proved. Solve 3x +6 =S5in Z> Given, 3x+ 6=5 => ueoy U u Ueou (3x4#6)+1=541 3x+(64+1)=6 [Addition modulo 7 is associative] 3x+0=6 3x =6 5x (3x)=5x6 (5x3)xx=5x6 [Multiplication module 7 is associative] 1xx=2 [-5, 3 € Z;, 5x73 =1,5,6€ Z,,5 x76 =2] x=2 Ans. [2075 'A' (2075 "By Scanned with CamScannersoln: oune eT 7USL 7 | In a Caley's table for a finite group, why does each element occur exactly once in each row and exactly once in each column? [2072'D'] Let ay, Az «dy be the elements of the group. Let the two entries aja, and aja, in a ith row of the Caley's table be same, then aay k > a) = a which is a contradiction since aj and ay are different elements of the group. Hence, the Caley's table for a finite group contains each element once in each of its rows and columns. Important (Short Questions-Answers) [2 Marks Each] (a) Ifa, b € Gand Gis abelian group, show that (ab)? = ah? Proof: If (ab 2 = (ab) (ab) = [(ab)a]b = [a(ba)]b =a(ab) b, since G is abelian and ab = ba, = (aa) (bb) = a2ph2 Proved. (b) If (ab)? = a*b? for all a, b €G, Gis a group show that G is abelian. Proof: If (ab)? = ab? > (ab) (ab) = a2b? > a'(abab)b7! = a'(a’b*)b > ba = ab. Hence, G is abelian. Scanned with CamScanner