You are on page 1of 63
Ch: a No. 2 (Mathematical Methods) F GROUPS bene Niaeated winany SS , aie at al ‘A binary na non-empty set A is a function *: Ax A~ A. So, for each (a, b) in Ax A, we associate an element +(a, b) of A. We shall denote +(a,6) by ab. If A is a non-empty set with a binary operation * "then A is said to be closed under" «" Group ‘A pair (G.s), where G is a non-empty set and "+ "is a binary operation on G is called a group if the foliowing conditions, called joms of a group.are satisfied in G. () The binary operation " +" is associative. That is (axb)*c=a+(bec);Vab,ceG (@) There is an element in G such that ate=exa=a;VaeG. (ii) For each a ¢ G, there is an a’e G such that ava’ =a'+a =e; a’iscalled the inverse of a. Examples “The pairs (Z,-+),(2,+4),(R,+), (G+) and (Q = {0},+), (R — {0},+), (C — {0}.*) are groups. Abelian Group ‘A group (G,#) is called an abelian group if aeb=b+a;VabeG. If there is a pair of elements a,b ¢ G such thata +b + b +a, then G is called non-abelian group. Note: (j) If (G,+) is a group then a7? = ar (iii) In practice, the product a. b of two elements in a group G under multiplication ig written simply asab. Also, we shall denote a group (G,*) by G only. Idempotent Element An element of a group G is said to be idempotent if x? Theorem 5 ‘The only idempotent element in a group is the identity element. Proof: Let x € G be an idempotent element. Then 6) is a group then a~ ay ay Hence the proof. Cayley’s Table To verify that a finite set isa group we list the products in the form of a table called Cayley’s Multiplication Table. This is illustrated by the following examples. Example Let G = (1,@, 7}, where is the complex cube root of unity. Show that (6,+) is a group. Solution Te ]7a.o | tlrsed () "+" isclosed over 6. aes » aebeG,Wa,beG. aalgontoulat (tis clear from the table) [w? ja? | 1 | @ "is associative over G. Asccialix. 82 (i) aeb)ec=as(bec)iVabceG. : i wis Leo toe =} we) ‘Associative law w.r.t. “+” holds in the set of complex numbers.) on ay / qm “tis the identity element in G wat." +". S ({tis clear from the table) Seontity 172 (WW) Tt =h @)> (Itis clear from the table.) Hence (G,+) is a group. @)yt =e c wad we ' Qnverse’ jrrverte *} 0730 we (ea - bee w : Example eee, Let G = {1,—1,i,—i) of all the fourth roots of unity. Show that ! (Ge) isa group. Solution ‘Beak = — Assocotins. 6-0 0 is closed over G. 7 ~ y +beG,Va,beG. = eye DE An tnn ee 4 ‘lear from the table.) 7 T .-0 = -I-¢ (i) "+" is associative over G. =i =i i Oe ee ie. (aeb)ec=ae(bec): Vv : eee ab,ceG. Dest 10 rc Aoviatve law wit +* holdin the set of complex numbers) eI d

You might also like