Unit III

GROUP THEORY
OBJECTIVES:

After going through this unit, you will be able to know:

 Binary Operation

 Definition of Group, semi group, Monoid

 Permutation groups

 Cosets and Lagrange's theorem

 Homomorphism, Isomorphism and Automorphism of Groups
 Rings, integral domains and field.

INTRODUCTION:
In this chapter, we will study, binary operation as a function, and two more algebraic
structures, semigroups and groups. They are called an algebraic structure because the
operations on the set define a structure on the elements of that set. We also define
the notion of a hornomorphism and product and quotients of groups and semigroup.

BINARY OPERATION

A binary operation on a set A is an everywhere defined function f : A  A  A , generally

the operation is denoted by * on A, then a  b  A a, b  A.

Properties of binary operation : Let 

be a binary operation on a set A,
Then  satisfies the following
properties, namely
 Closure property
 Associative property
 Identity Property
 Inverse property
 Commutative property etc.
SEMIGROUP

A non-empty set S together with a binary operation  is called as a semigroup if –

i) binary operation  is closed
ii) binary operation  is associative
we denote the semigroup by (S,  )

Commutative Semigroup :- A semigroup (S,  ) is said to be

commutative if  is commutative i.e. a  b  b  aa  S

Examples : 1) (z, +) is a commutative semigroup

2) The set P(S), where S is a set, together with
operation of union is a commutative semigroup.
3) (Z, –) is not a semigroup
The operation subtraction is not associative

IDENTITY ELEMENT :

An element e of a semigroup (S,  ) is called an identity element if e  a  a  e  a a  S

Monoid A non-empty set M together with a binary operation *defined on

it, is called as a monoid if –

i) binary operation  is closed

ii) binary operation  is associative and
iii) (M,  ) has an identity.
i.e. A semi group that has an identity is a monoid.

A a non-empty set G together with a binary operation  defined on it is

called a group if

(i) binary operation  is close,

(ii) binary operation  is associative,
(iii) (G,  ) has an identity,
(iv) every element in G has inverse in G,
We denote the group by (G,  )

Commutative (Abelian Group : A group (G,  ) is said to be

commutative if  is commutative. i.e. a * b  b * a  a, bG .

Cyclic Group : If every element of a group can be expressed as the power

of an element of the group, then that group is called as cyclic group.
 The element is called as generator of the group.
If G is a group and a is its generator then we write G  a 
For example consider

G  {1, 1, i, i} . G is a group under the binary

operation of multiplication. Note that G  i  . Because
 
a  i, i2 , i3 , i 4  i,  1,  i,1 
SUBSEMI GROUP :

Let (S,  ) be a semigroup and let T be a subset of S. If T is closed under operation  ,

then (T,  ) is called a subsemigroup of (S,  ).

Submonoid : Let (S,  ) be a monoid with identity e, and let T be a non- empty subset
of S. If T is closed under the operation  and e  T, then (T,  ) is called a
submonoid of (S,  ).

Subgroup : Let (G,  ) be a group. A subset H of G is called as subgroup of G if (H,  )

itself is a group.

Necessary and Sufficient Condition for subgroup : Let (G;  ) be a group. A

subset H of G is a subgroup of G if and only if a, b  H a  b 1  H
PERMUTATION GROUP

Definition : A permutation on n symbols is a bijective function of the set

A = 1, 2,...n  onto itself. The set of all permutations on n symbols is

denoted by Sn. If  is a permutation on n symbols, then  is completely

determined by its values  1 ,   2  .....  n . We use following notation

 1 2 3  n 
to denote   .
  1  1   3     n  

1 2 3 4 5 
For example    denotes the permutation on the 5 symbols
5 3 1 2 4 
(1,2,3,4,5).  maps 1 to 5, 2 to 3, 3 to 1, 4 to 2 and 5 to 4.

Product of permutation : - Let A = {1,2,3,4}

1 2 3 4  1 2 3 4 
Let    and   .
3 2 4 1  4 3 2  
1 2 3 4  1 2 3 4  1 2 3 4 
Then  O      =  
3 2 4 1   4 3 2   2 3 1 4
Cycle - an element  sn is called a cycle of lingth r if  r symbols
i1, i2 ....in i1   i2,   i2   i3 ...  in   i1 .

Example : Consider following permutation

1 2 3 4 5 6
i)   . It can be expressed as a product of cycles -
2 3 4 1 6 5
1 2 3 4   5 6
    1 2 3 4   5 6 
2 3 4 1  6 5

Transposition :

A cycle of length two is called transposition.

For example following permutation can be expressed as a product
of transpositions.

 18 3 7   2 5   4 6 
 1 8  1 3  1 7   2 5   4 6 

Even (odd) Permutation -

Let A {1, 2, ….n). A permutation  sn is even or odd according

to whether it can be expressed as the product of an even number of
transpositions or the product of an odd number of transpositions
respectively.

For example we can consider following permutation :

  1 4 5   2 3 
  1 4  1 5   2 3 
= odd no. of transpositions so  is odd permutation

Example 1 : Show that  defined as x  y  x is a binary operation on the

set of positive integers. Show that  is not commutative but is associative.

Solution : Consider two positive integers x and y. By definition x  y  x

which is a positive integer. Hence  is a binary operation.
For commutativity : x  y  x and y  x  x . Hence x  y  y  x in general
  is not commutative.

But x  ( y  z)  x  y  x and ( x  y)  z  x  z  x . Hence

x  ( y  z)  ( x  y)  z .   is associative

Example 2 : Let I be the set of integers and Zm be the set of equivalence

classes generated by the equivalence relation “congruent modulo m” for
any positive integer m.
a) Write the sets Z3 and Z6
b) Show that the algebraic systems (Zm, + m) and (Zm,  m) are
monoids.
c) Find the inverses of elements in Z3 and Z4 with respect to +3 and 4
respectively.

Solution : a) Z3 for (Z3,+ 3) ={[0], [1], [2]}

Z6 for (Z6, + 6) = {[0], [1], [2], [3], [4], [5] }
Z3 for (Z3, 3) ={[0], [1], [2]}
Z6 for (Z6, 6) = {[0], [1], [2], [3], [4], [5] }

Example 3 : Determine whether the following set together with the binary
operation is a semigroup, a monoid or neither. If it is a monoid, specify the
identity. If it is a semigroup or a monoid determine whether it is
commutative.

i) A = set of all positive integers.

a  b  max{a, b} i.e. bigger of a and
b
ii) Set S = {1, 2, 3, 6, 12} where a  b  G.C.D.(a, b)

iii) Set S ={1,2,3,6,9,18) where a  b  L.C.M .  a, b 

iv) Z, the set of integers, where a  b  a  b  ab
ab
v) The set of even integers E, where a  b 
2
vi) Set of real numbers with a  b  a  b  2
vii) The set of all mn matrices under the operation
of addition.

Solution :
i) A = set of all positive integers. a  b  max{a, b} i.e. bigger of a and b.

Closure Property: Since Max {a, b} is either a or b  a  b  A . Hence

closure property is verified.

Associative Property :
Since a  (b  c)  max{{a, b}, c}  max {a, b, c}
= Max{a,{b, c} } = (a.b).c
  is associative.
 (A,  ) is a semigroup.

Existence of identity : 1  A is the identity because

1.a = Max{ 1,a}= a  aA
 (A,  ) is a monoid.

Commutative property : Since Max{a, b) = max{b, a) we have

a  b  b  a Hence  is commutative.

Therefore A is commutative monoid.

ii) Set S = { 1,2,3,6,12} where a  b  G.C.D. (a, b)
* 1 2 3 6 12
1 1 1 1 1 1
2 1 2 1 2 2
3 1 1 3 3 3
6 1 2 3 6 6
12 1 2 3 6 12
Closure Property : Since all the elements of the table  S, closure
property is satisfied.

Associative Property :Since

a  (b  c)  a  (b  c)  a  GCD{b, c}  GCD {a, b, c}
And (a  b)  c  GCD{a, b}  c  GCD{a, b, c}
 a  (b  c)  (a  b)  c
  is associative.
 (S,  ) is a semigroup.

Existence of identity: From the table we observe that 12  S is the

identity
 (S,  ) is a monoid.

Commutative property : Since GCD{a,b}= GCD{b,a) we have

a  b  b  a . Hence  is commutative.

Therefore A is commutative monoid

(iii) Set S ={ 1,2,3,6,9, 18} where a  b =L.C.M. (a,b)

* 1 2 3 6 9 18
1 1 2 3 6 9 18
2 2 2 6 6 18 18
3 3 6 3 6 9 18
6 6 6 6 6 18 18
9 9 18 9 18 9 18
18 18 18 18 18 18 18

Closure Property : Since all the elements of the table  S, closure

property is satisfied.

Associative Property : Since a  (b  c)  a  LCM {b, c}  LCM {a, b, c}

And (a  b)  c  LCM {a, b}  c  LCM {a, b, c}
 a  (b  c)  (a  b)  c
  is associative.
 (S,  ) is a semigroup.
 Existence of identity : From the table we observe that 1  S is the
identity.
 (S,  ) is a monoid.

Commutative property : Since LCM{a, b} = LCM{b, a} we have

a  b  b  a . Hence  is commutative.

Therefore A is commutative monoid.

(iv) Z, the set of integers where - a * b = a + b - ab

Closure Property : - a, bz then a  b  ab z a,b

so * is closure.

Associate Property : Consider a, bz

 a * b  * c   a  b  ab  * c
 a  b  ab  c   a  b  ab  c
 a  b  ab  c  ac  bc  abc (1)
 a  b  c  ab  ac  bc  abc

a *  b * c   a *  b  c  bc 
 a  b  c  bc  a  b  c  bc 
 a  b  c  bc  ab  ac  abc
(2)From 1 & 2
a * b  * c  a * b * c  a,b,c  z
* is associative
(z, &) is a semigroup.

Existence of Identity : Let e be the identity element a * e = q

a + e - q.e = a
a + e - a.e = a
e ( 1-a) = 0
e = 0 or a = 1
But a  1
E=0
 OZ is the identity element.
 (Z, *) is monoid.

Commutative property :  a, b z
a * b = a + b - ab
= b + a - ba
=b*a
* is commutative
(Z, *) is commutative monoid.

OZ is the identity

 ab
v) E = set of even integers. a  b 
2
Closure Property : Since
ab
is even for a and b even.  a  b  E . Hence
2
closure property is verified.

 Property : Since a  (b  c)  q   bc
2
 abc ab

4

2
 c  (a  b)  c 
 

  is associative. (E,  ) is a semigroup.

2a
Existence of identity : 2 E is the identity because 2  a  = a a  E
2
(E,  ) is a monoid.

ab ba
Commutative property : Since  , we have a  b  b  a Hence  is
2 2
commutative.

(E,*) is commutative monoid.

(vi) -2A is identity

 0 0
(vii)  0 0  M is the identity
 

Example 4 : State and prove right or left cancellation property for a

group.

Solution : Let (G,  ) be a group.

(i) To prove the right cancellation law i.e. a  b  c  b  a  c
Let a, b, cG. Since G is a group, every element has inverse in G.
 b–1  G
Consider a  b  c  b
Multiply both sides by b–1 from the right.
:. (a  b)  b 1  (c  b)  b 1

 a  (b  b 1 )  c  (b  b 1 ) Associative property
 e a  ec b  b 1  e  G
 a=c eG is the identity

(ii) To prove the left cancellation law i.e. a  b  c  b  a  c

Let a, b, cG: Since G is a group, every element has inverse in G.
a–1 G
Consider a b  a c

Multiply both sides by a–1 from the left

 a 1  (a  b)  a 1  (a  c)

 (a 1  a)  b  (a 1  a)  c Associative property
 eb  ec a 1  a  e  G
 b=c eG is the identity

Example 5 : Prove the following results for a group G.

(i) The identity element is unique.
(ii) Each a in G has unique inverse a–1
(iii) (ab) –1 = b–1a–1

Solution : (i) Let G be a group. Let e1 and e2 be two identity elements

of G.

If e1 is identity element then e1e2 = e2e1 = e2 ……………(1)

If e2 is identity element then e1e2 = e2e1 = e1 ……………(2)
 From (1) and (2) we get e1 = e2 i.e. identity element is unique.
(ii) Let G be a group. Let b and c be two inverses of aG.
lf b is an inverse of a then ab = ba = e……………(1)
If c is an inverse of a then ac = ca = e……………(2)
Where e  G be the identity element.
 From (1) and (2) we get ab = ac and ba = ca.

 b=c by cancellation law : i.e. inverse of aG is unique.

 inverse of a  G is unique.
(iii) Let G be a group. Let a, b  G.
Consider (ab)(b–1a–1)
= a(bb–1)a–1 Associative property
= (ae)a–1 bb–1 = e, eG is identity
= (ae)a–1 Associative property
= aa–1 e = a
= eaa–1 = e
 Similarly we can prove (b–1a–1)(ab) = e.
Hence (ab) –1 = b–1 a–1
Example 6 : Let G be a group with identity e. Show that if a 2  e for all a in G,
then every element is its own inverse

Solution : Let G be a group.

Given a2 = e for all aG. Multiply by a–1
we get a–1a2 = a–1 e
 a = a–1
i.e. every element is its own inverse

Example 7 : Show that if every element in a group is its own inverse, then the group must
be abelian.

OR

Let G be a group with identity e. Show that if a2 = e for all a in G, then G

is abelian.

Solution : Let G be a group.

 For aG, a–1G

 Consider (ab) –1

 (ab) –1=b–1a–1 reversal law of inverse.

 ab=ba every element is its own inverse

 G is abelian.

Example 8 :Let Zn denote the set of integers (0, 1, .. , n-1). Let  be binary operation
on Zn such that ab = the remainder of ab divided by n.
i) Construct the table for the operation  for n=4.
ii) Show that (Zn, ) is a semi-group for any n.
iii) Is (Zn, ) a group for any n? Justify your answer.

Solution : (i) Table for the operation  for n = 4.

 0 1 2 3
0 0 0 0 0
1 0 1 2 3
2 0 2 0 2
3 0 3 2 1

(ii) To show that (Zn, ) is a semi-group for any n.

Closure property : Since all the element in the table

{0, 1, …, n-1}, closure property is satisfied.
Assiciative property : Since multiplication modulo n is associative,
associative property is satisfied.
 (Zn, ) is a semi-group
(iii) (Zn, ) is not a group for any n.

Example 9 : Consider the group G = {1,2,3,4,5,6} under multiplication

modulo 7.
(i) Find the multiplication table of G
(ii) Find 2–1, 3–1, 6–1.
(iii) Find the order of the subgroups generated by 2 and 3.
(iv) Is G cyclic?

Solution : (i) Multiplication table of G

Binary operation  is multiplication modulo 7.
* 1 2 3 4 5 6
1 1 2 3 4 5 6
2 2 4 6 1 3 5
3 3 6 2 5 1 4
4 4 1 5 2 6 3
5 5 3 1 6 4 2
6 6 5 4 3 2 1

From the table we observe that 1G is identity.

(ii) To find 2–1, 3–1, 6–1.

From the table we get 2–1 = 4, 3–1 = 5, 6–1 = 6

iii) To find the order of the subgroups generated by 2.

Consider 2° = 1 = Identity, 21 = 2; 22 = 4, 23 = 1 = Identity
< 2 > = {21, 22, 23}
 Order of the subgroup generated by 2 =3
To find the order of the subgroups generated by 3.
Consider 3° = 1 = identity, 31 = 3, 32 = 2, 33 = 6, 34 = 4, 35 = 5, 36 =
1 = Identity
< 3 > = {31, 32, 33,34, 35, 36}
 Order of the subgroup generated by 3 = 6

(iv) G is cyclic because G = < 3 >.

Example 10 : Let G be an abelian group with identity e and let H = {x/x2
= e). Show that H is a subgroup of G.

Solution : Let x, yH x2 = e and y2 = e  x–1 = x and y–1 = y

Since G is abelian we have xy = yx  xy–1 = yx
Now (xy–1)2 = (xy–1)(xy–1) = (xy–1)(y–1x)
= (xy–1)(yx) = x(y–1y)x
= x(e)x
= x2 = e
 xy–1  H
 H is a subgroup.

Example 16 : Let G be a group and let H = (x/xG and xy = yx for all

yG}. Prove that H is a subgroup of G.

Solution : Let x, z  H  xy = yx for every yG  x = yxy–1.

Similarly zy = yz for every yG z = yzy–1.
Now consider xz–1 = (yxy–1)(yzy–1) –1
= yxy 1 yz 1y 1  yxz 1y 1
 (x.z–1)y = y(xz–1)  H.
 xz–1 H
 H is a subgroup

Example 17 : Find all subgroups of (Z,) where  is the operation

addition modulo 5. Justify your answer.

Solution:
 0 1 2 3 4
0 0 1 2 3 4
1 1 2 3 4 0
2 2 3 4 0 1
3 3 4 0 1 2
4 4 0 1 2 3

Example 18 : Let G be a group of integers under the operation of

addition. Which of the following subsets of G are subgroups of G?
(a) the set of all even integers,

(b) the set of all odd integers. Justify your answer.

Solution:
a) Let H= set of all even integers.
We know, additive inverse of an even number is even and sum of
two even integers is also even. Thus for a,bH we have ab–1H.
Hence H is a subgroup of G.

b) Let K = set of all odd integers.

We know, additive inverse of an odd number is odd and sum of
two odd integers is even.
Thus for a,bK we have ab–1K.
Hence K is not a subgroup of G.

Example 19 : Let (G,  ) be a group and H be a non-empty subset of G.

Show that (H,  ) is a subgroup if for any a and b in H, ab–1 is also in H.

Solution :
(i) Let a, a  H  a a–1  H. i.e. e  H
 The identity element  H.
(ii) Let e, a  H  ea–1  H. i.e. a–1  H
 Every element has inverse  H.
(iii) Let a, b  H.  b–1  H.  a(b–1) –1  H. i.e. ab  H.
Closure property is satisfied.
(iv) Every element in H is also in G. And G is a group. So associative
property is satisfied by the elements of H. Hence associative
property is satisfied by the elements of H.
Hence H is a group. But H is a subset of G. H is a subgroup
of G.

Example 20 : Let H and K be subgroups of a group G. Prove that HK is

a subgroup of G.

Solution : If H is a subgroups of a group G, then for any a, b  H,

ab–1  H.
Similarly, if K is a subgroups of a group G, then for any a, b  K,
ab–1  K.
Now if a, b  HK, a, b  H and a, b  K.  ab–1  H and ab–1  K.
Hence ab–1  HK.
 HK is a subgroup of G.
HOMOMORPHISM, ISOMORPHISM AND
AUTOMORPHISM OF SEMIGROUPS

Homomorphism : Let (S,  ) and (T,  ’) be two semigroups. An

everywhere defined function
f : ST is called a homomorphism from (S,  ) to (T,  ’) if
f(a  b) = f(a)  ’f(b)  a, b  S

Isomorphism : Let (S,  ) and (T,  ’) be two semigoups. A function

f : S  T is called a isomorphism from (S,  ) to (T,  ’) if
(i) it is one-to-one correspondence from S to T (ii) f(a  b) = f (a)
 ’f (b)  a, b  S
(S,  ) and (T,  ’) are isomorphic’ is denoted by S  T .
Automorphism : An isomorphism from a semigroup to itself is called an
automorphism of the semigoup. An isonorptism f : s  s I is called
automorphism.

HOMOMORPHISM, LSOMORPHISM AND AUTOMORNHISM OF MONOIDS :

Homomorphism : Let (M,  ) and (M’,  ’) be two monoids. An

everywhere defined function f : M  M’ is called a homomorphism from
(M,  ) to (M’,  ’) if f (a  b) = f(a)  ’f(b)  a, b  M

Isomorphism : Let (M,  ) and (M’,  ’) be two monoids. A function

f : M  M’ is called a isomorphism from (M,  ) to (M’,  ’) if

(i) it is one-to-one correspondence from M to M’ (ii) f is onto.

(iii) f(a  b = f (a)  ’f (b)  a, bM

‘(M  ) and (M’,  ’) are isomorphic is denoted by M  M’.

Automorphism :An isomorphism from a monoid to itself is called an automorphism

of the monoid. An isomorphism f :M  M is called automorphism
of monoid.
HOMOMORPHISM, ISOMORPHISM AND AUTOMORPHISM O F GROUPS :

Homomorphism : Let (G,  ) and (G’,  ’) be two groups. An everywhere

defined function f : G  G’ is called a homomorphism from (G,  ) to (G’,
 ’) if
f (a  b) = f (a)  ’f (b)  a, b  G

Isomorphism : Let (G,  ) and (G’,  ’) be two groups. A function

f : GG’ is called a isomorphism from (G,  ) to (G’,  ’) if
(i) it is one-to-one correspondence from G to G’ (ii) f is onto.
(iii) f(a  b) = f (a)  ’f (b)  a, bG
‘(G,  ) and (G’,  ’) are isomorphic’ is denoted by G  G’.

Automorahism: An isomorphism from a group to itself is called an

automorphism of the group. An isomorphism f : G  G is called
Automorphism

Theorem : Let (S,  ) and (T,  ’) be monoids with identity e and e’,
respectively. Let f : S  T be an isomorphism. Then f(e) = e’.

Proof : Let b be any element of T. Since f is on to, there is an element a in

S such that f(a) = b
Then a  ae
b  f (a)  f (a  e)  f (a)  f (e)  b  ' f (e) (f is isomorphism)

Similarly, since a  e  a ,
b  f (a)  f (e  a) f (e * a)  f (e)  '  a 

Thus for any ,bT,

b  b  ' f (e)  f (e)  ' b
which means that f(e) is an identity for T.
Thus since the identity is unique, it follows that f(e)=e’

Theorem : Let f be a homomorphism from a semigroup (S,  ) to a semigroup

(T,  ’). If S’ is a subsemigroup of (S,  ), then F(S’) = {t  T | t = f (s) for some s
 S},The image of S’ under f, is subsemigroup of (T,  ’).

Proof : If t1, and t2 are any elements of F(S’), then there exist s1 and s2 in S’ with
t l= f(s1) and t2 = f(s2). Therefore,
t1  t2  f (s1 )  f (s2 )  f (s1  s2 )  f (s2  s1 )  f (s2 )  f (s1 )  t2  t1
Hence (T,  ') is also commutative.
Example 1 : Let G be a group. Show that the function f : G  G defined
by f(a) = a2 is a homomorphism iff G is abelian.
Solution :

Step-1 : Assume G is abelian. Prove that f : G  G defined by f(a) = a2 is

a homomorphism.

Let a,bG.  f(a) = a2 , f(b) = b2 and f(ab) = (ab)2 by definition of f.

 f(ab)=(ab)2
= (ab)(ab).
= a(ba)b associativity
= a(ab)b G is abelian
= (aa)(bb) associativity
2 2
= ab
= f(a)f(b) definition of f
 f is a homomorphism.
Step 2 :
 y  a 2 G  aG s t
f(a)  y  a 2

f is onto.
Step-3 : Assume, f : G  G defined by f(a) = a2 s a homomorphism.
Prove that G is abelian.
2
Let a,bG.  f(a) = a , f(b) = b2 and f(ab) = (ab)2 by definition of f.

 f(ab) = f(a)f(b) f is homomorphism

2
 (ab) = a2 b2 definition of f
 (ab)(ab) = (aa)(bb)
 a(ba)b = a(ab)b associativity
 ba = ab left and right cancellation taws
 G is abelian.

Example 3 : Let G be a group and let a be a fixed element of G. Show

that the function f a : G  G defined by f a ( x)  axa 1 for xG is an
isomorphism.

Solution :
Step-1: Show that f is 1-1.
f a ( x)  axa 1
Consider fa(x) = fa(y) for x, y G
 axa–1 = aya–1 definition of f
 x=y left and right cancellation laws
 f is 1- 1
Step 2 :

 y  axa 1 G  x G s.t.
fa (x)  a xa 1
f is onto.

Step-3 : Show that f is homomorphism.

For x, yG
f ( x)  a  x  a 1 , f ( y)  a  y  a 1 and f ( x  y)  a  ( x  y)  a 1

Consider f ( x  y)  a  ( x  y)  a 1 for x, yG

 f ( x  y)  a  ( x  e  y)  a 1 eG is identity
= a  ( x  a 1  a  y)  a 1 a 1  a  e
 = (a  x  a 1 )  (a  y  a 1) associativity
  f ( x  y)  f ( x)  f ( y)
 f is homomorphism.
Since f is 1-1 and homomorphism, it is isomorphism.

Example 2 : Let G be a group. Show that the function f : G  G defined

by f(a) = a–1 is an isomorphism if and only if G is abelian.

Solution :

Step-1: Assume G is abelian. Prove that f : G  G defined by f(a) = a–1 is

an isomorphism.

i) Let f(a)=f(b)
a–1 = b–1 a = b f is 1- l.
1
ii)  aG  a G
x1 G
 f  x   x 1
f is onto.
iii) Let a,bG. f(a) = a–1, f(b) = b–1 and f(ab) = (ab) –1
by
definition of f.
 f(ab) = (ab) –1
= b–1a–1 reversal law of inverse
= a–1b–1 G is abelian
= f(a)f(b) definition of f.
 f is a homomorphism.
Since f is 1-1 and homomorphism, it is isomorphism.

Step – 2 : Assume f : G  G defined by f(a) = a–1 is an isomorphism.

Prove that G is abelian.
Let a, bG f(a) = a–1, f(b) = b–1 and f(ab) = (ab) –1 by definition of f
 f(ab) = f(a)f(b) f is homomorphism
–1 –1 –1
 (ab) = a b definition of f
–1 –1 –1 –1
 b a =a b reversal law of inverse
G is abelian.

Example 3 : Define (Z, +)  (5Z, +) as f(x) = 5x, where 5Z=(5n : n 

Z). Verify that f is an isomorphism.

Solution:
Step -1 Show that f is 1-l.
Consider f(x) = f(y) for x, yG
 5x = 5y definition of f
 x=y  f is 1-1
 Step 2 :
 5x G, x G
s.t. f(x)  5x

f is onto.

Step-3: Show that f is homomorphism.

For x  y  G
f(x) = 5x, d(y) = 5y and f(x + y) –
5(x+y)
Consider f(x+y) = 5(x+y) for x, y G
= 5x + 5y
 f(x+y) = f(x) + f(y)
 f is homomorphism.
Since f is 1-1 and homomorphism, it is isomorphism.

Example 4 : Let G be a group of real numbers under addition, and let G’

be the group of positive numbers under multiplication. Let f : G  G’ be
defined by f(x) = ex. Show that f is an isomorphism from G to G’

OR
Show that the group G = (R,+) is isomorphic to G’ = (R+, x) where R is
the set of real numbers and R+ is a set of positive real numbers.

Solution :

Step 1:Show that f is 1-1.

Consider f(x) = f(y) for x,yG
 ex = ey definition of f
 x=y  f is 1-1.

Step 2 : If x G1 , then log x  G and f .log x   elog x  x so f is onto.

Step-3 : Show that f is homomnrphism.
For x, yG
f(x) = ex, f(y) = ey and f(x+y) = e(x+y)
Consider f(x + y) = e(x + y) for x, y G
= exey
 f(x + y) = f(x)  f(y) f is homomorphism.
Since f is 1-1 and homomorphasm, it is isomorphism.
Example 5 : Let G = {e, a, a2, a3, a4, a5} be a group under the operation
of aiai  ar , where i + j  r(mod 6). Prove that G and Z6 are isomorphic

Solution :
Step - I : Show that f is l-I.
Let x = ai, and y = aj .
Consider f(x) = f(y) for x, y  G
 f(ai) = f(aj) definition of f
 ai = aj
 x=y f is 1-1.

Step-2 : Show that f is homomorphism.

Let x = a’ and y = a’ x, y  G
f(ai) = i , f(aj) j and f(x + y) = f(ai aj)
Consider f(x+y) = f(aiaj) = f(a’) where i + j = r(mod 6)
= R
= i+j
= f(ai) + f(aj)
 f(x  y) = f(x) + f(y)  f is homomorphism.
Since f is 1-1 and homomorphism, it is isomorphism.

Example 6 : Let T be set of even integers. Show that the semigroups (Z,
+) and (T, +) are isomorphic.

Solution : We show that f is one to one onto .

Define f : (Z, +)  (T, +) as f(x) = 2x
1) Show that f is l-1
Consider f(x) = f(y)
2x = 2y
x = y f is 1-l.

2) Show that f is onto

y = 2x x = y/2 when y is even.
for every yT there exists xZ.
f is onto.
f is isomorphic.
3) F is homorphism
F (x + y) = 2 (x + y)
= 2x + 2y
= f(x) + f(y)
f is honomorphism.

Example 7 : For the set A = {a,b,c} give all the permutations of A. Show
that the set of all permutations of A is a group under the composition
operation.

Solution : A={a,b,c}. S3= Set of all permutations of A.

a b c a b c  a b c
f0   , f1   , f2   
a b c a c b  c b a
a b c a b c a b c 
f3   , f4   , f5   
 b a c b c a  c a b`

Let us prepare the composition table.

0 f0 f1 f 2 f3 f4 f5
f0 f 0 f1 f 2 f3 f4 f5
f1 f1 f0 f 4 f5 f2 f3
f2 f 2 f3 f0 f 4 f3 f1
f3 f3 f 4 f5 f0 f1 f2
f4 f 4 f3 f1 f2 f5 f0
f5 f5 f 2 f3 f1 f0 f4

i) Closure Property: Since all the elements in the composition table

S3, closure property is satisfied.
ii) Associative Property: Since composition of permutations is
associative, associative property is satisfied.
iii) Existance of Identity: From the table we find that fo is the
identity
iv) Existance of Inverse: From the composition table it is clear that
f0–1 = f0, f1–1 = f1, f2–1 = f2, f3–1 = f3, f4–1 = f5, f5–1 = f4
 Every element has inverse in S3. Hence S3 is a group.

COSET AND NORMAL SUBEROUP:

Left Coset : Let (H,  ) be a subgroup of (G,  ). For any a  G, the set of
aH defined by aH  {a  h / h  H } is called the left coset of H in G