Isomorphism Theorems

Chapter 10

Theorems
Because any isomorphism is an 11 onto mapping, its
always has inverse mapping 1 . We can see that the inverse
mapping 1 also keeps the operations. So
Theorem 1: If group G is isomorphic to group H , then group
H is isomorphic to group G.
Let be an isomorphism from group G to group H.
For any gG , let h=(g). Then order(h) is a divisor order(g).
However, g= 1 (h), 1 isomorphism too. So order(g) is a
divisor order(h) . Therefore order(h) = order(g).
Theorem 2: Group isomorphism keeps order of elements.
2

Theorem 3. Any finite group G is isomorphic to a group of

permutations
Proof: Let xG we define a mapping Px from G to G
Px: G G
such that Px, maps any element gG to xg.
So
Px(g) = xg
We claim that:
i) Px is 11. This is because
if Px(g1) =Px(g2) xg1 =xg2 g1 =g2
ii) Px is onto. This is because
for any gG , Px(x 1 g)=x (x 1 g)= g
So Px is an permutation among elements of G
Let H be the set of all those permutations, i.e.
H={Px: xG }
3

We want to show that H is a permutation group.

i) Let x G, then both Px and Px1 in H . Then for any g G
Px1 Px ( g ) = Px1 ( xg ) = x 1 ( xg ) = g

Therefore Px1 Px is an identity permutation.

That proves Px and Px1 are inverse permutation of each other.
ii) Let x, y G , then for any g G
Py Px ( g ) = Py ( xg ) = y ( xg ) = ( yx ) g = Pyx ( g )
That proves

Py

Px = Pyx

From above we can see that H is closure under permutation

multiplication and inverse operation. Therefore H is a subgroup
of the group consist of all permutations among elements of G.
4

Now we make a mapping from G to H by

x G , ( x) = Px
i) This mapping is onto because H is simply a collection
of all those permutations.
ii) If ( x) = ( y )
Px = Py
Px (e) = Py (e)
xe = ye
x= y
So mapping is 1 1.
iii) Formula Py

Px = Pyx

( y ) ( x) = ( yx)

means this mapping keeps operation from G to H

From above we have proved that is an isomorphism
5

Example: Let G = { 1, i, 1, i}. Then { G, *} is a group.

Find its isomorphic permutatiuion group H
The operation table is

Change the 1, i, 1 , i to numbers 1, 2, 3 , 4 except 1st column

Then we make an permutation group

H=

1 2 3 4
,
1 2 3 4

1 2 3 4
,
2 3 4 1

1 2 3 4
,
3 4 1 2

1 2 3 4
4 1 2 3

H is a permutation group .
The mapping from G to H is the following

(1) =

1 2 3 4
1 2 3 4

(i ) =

1 2 3 4
2 3 4 1

( 1) =

1 2 3 4

( i ) =

1 2 3 4
4 1 2 3

3 4 1 2

From above theorem is an isomorpuism from G to H

7

Example 2: Let group G = 1,

1+ 3i 1 3i
,
2
2

}.

Find its isomorphic permutatiuion group H

The operation table is

Change 1,

1+ 3i 1 3i
,
2
2

the 1st column.

to number 1, 2, 3 except
8

Then we get table

Then we make an permutation group

H=

1 2 3
1 2 3
1 2 3
,
,
1 2 3
2 3 1
3 1 2

H is a permutation group .
The mapping from G to H is the following

(1) =

1 2 3
1 2 3

1+ 3i
2

1 2 3
2 3 1

1 3i
2

1 2 3
3 1 2

From above theorem is an isomorpuism from G to H

Example 3: Verify that there is an isomorphism from the additive

Group Z6 to the multiplicative group of Z7
Proof: Z6 ={0, 1, 2, 3, 4, 5}is an additive group.
Z7 ={0, 1, 2, 3, 4, 5, 6} is also an additive group.
The multiplicative group of Z7 is G ={1, 2, 3, 4, 5, 6}
The operation table of Z6

The operation table of G

10

Because isomorphism keeps order, we look for elements that

have the largest orders in both groups. In Z 6 , 1 has order 6.
1 is a generator of Z 6 . Therefore we need to look for element in G
whose order is also 6 . Now check orders. All possible orders must be
divisors of 6, they are 1, 2, 3, 6.
order(1) = 1 , because that 1 is identity for the multiplication
22 =4, 23 =8(mod 7) =1

order(2) = 3

32 = 9(mod 7) =2, 33 = 27(mod 7) =6

Now we can make isomorphism as

(0)=1,

order(3) = 6.

( this is always true, identity mapping to identity )

(1)=3, (Both have order 6)

Then from operation property

(2)= (1+1)= (1) (1)=3 3(mod 7) = 2

(3)= (1+2)= (1) (2)=3 2 = 6

11

(4)= (1+3)= (1) (3)=3 6(mod 7) = 4

(5)= (1+4)= (1) (4)=3 4(mod 7) = 5
However, the isomorphism is not unique, we can find that
order(5) = 6.
So we can make another isomorphism as

(0)=1,

( this is always true, identity mapping to identity )

(1)=5, (Both has order 6)

Then from operation property
(2)= (1+1)= (1) (1)=5 5(mod 7) = 4
(3)= (1+2)= (1) (2)=5 4(mod 7) = 6
(4)= (1+3)= (1) (3)=5 6(mod 7) = 2

(5)= (1+4)= (1) (4)=5 2(mod 7) = 3

12

Example 4: Prove that there is no isomorohism between Z 6 and S3

Proof: In Z 6 ={0, 1, 2, 3, 4, 5} 1 has order 6.
But in S3 = {e, , , , , }

(
=(

e=

1 2 3
1 2 3

) =( ) =( )
) =( ) =( )

1 2 3
3 1 2

1 2 3

1 2 3

2 3 1

1 3 2

1 2 3
3 2 1

1 2 3
2 1 3

order(e) = 1, order( ) = order( ) = 3,

order( ) = order( ) = order( ) = 2,
No element in S3 has order 6.

Therefore there is no isomorohism between Z 6 and S3

13

Home works
1. In Z8 the multiplication group is G = { 1, 3, 5, 7}
Make its multiplication table and
find its isomorphic permutatiuion group H
2. Let group G = { 1, i, 1, i }
group H =

1 0
1 0
1 0 1 0
,
,
,
0 1
0 1
0 1
0 1

Prove that there is no isomorohism between G and H

14