Definition

An isomorphism   G  G’
is a homomorphism that is
one to one and onto G’.
The usual notation is
G  G’.
Theorem
 Let S be any collection of groups, and
define G  G’ in S if there exists an
isomorphism   G  G’. Then  is
an equivalence relation.
Proof
 Exercise
How to Show That Groups
Are Isomorphic
 Define the function  that gives the
isomorphism of G with G’. Now this means
that we have to describe, in some fashion,
what (x) is to be in G’ for every x  G.
 Show that  is a one to one function.
 Show that  is onto G’.
 Show that  is a homomorphism.
Example 1
Show that (R , +)  (R+ , .)
Solution
1. Define   R  R+ is given by (x) = ex, for
all x  R.
2. Show that  is a one to one function.
3. Show that  is onto R+ .
4. Show that (x + y) = (x) (y).
 Theorem

Any infinite cyclic group

G is isomorphic to the
group Z of integers
under addition.
Proof
 We suppose that G has a generator
a and use multiplicative notation
for the operation in G. Thus
G = { an | n  Z }.
Remember that the elements
an  G are all distinct, that is,
an  am if n  m.
Proof (Cont.)
1. Define   G  Z is given by
(an) = n, for all an  G.
2. Show that  is a one to one function.
3. Show that  is onto Z.
4. Show that (anam) = (an) + (am).
When we say, “There are precisely m
groups of order n, up to isomorphism,” we
mean that there exist m groups G1, G2, ...,
Gm of order n, no two of which are
isomorphic, and that every group of order n
is isomorphic to one of them.
For example, we have seen that any two
groups of order 3 are isomorphic.
We express this by saying that there is only
one group of order 3 up to isomorphism.
 Example 2
 There is only one group of order 1, one of
order 2, and one of order 3 up to
isomorphism.
 There are exactly two different groups of
order 4 up to isomorphism, the group Z4 and
the Klein 4-group V.
 There are at least two different groups of
order 6 up to isomorphism, namely
Z6 and S3.
How to Show That Groups
Are Not Isomorphic
 This would mean that there is no one-to-one
function from G onto G’ with the property
(ab) = (a) (b).
 In general, it is clearly not feasible to try
every possible one-to-one function to find out
whether it has the above property, except in
the case where there are no one-to-one
functions. This is the case, for example, if G
and G’ are of finite order and have different
numbers of elements.
Example 3
Z4 and S6 are not isomorphic.
Since there is no one-to-one
function from Z4 onto S6.
 For two groups of infinite order, it is not
always clear whether there are any one-to-
one onto functions.

 For example, you may think that Q has more

elements than Z, but your instructor can
show you in five minutes that there are lost
of one-to-one functions from Z onto Q.

 However, it is true that R has too

many elements to be put into a one-to-
one correspondence with Z.
Example 4
(Z , +) is not isomorphic with (R , +).
Since there is no one-to-one function
from Z onto R.
In the event that there are one-to-one
mappings of G onto G’, we usually show
that the groups are not isomorphic (if
this is the case) by showing that one
group has some structural property that
the other does not possess.
A structural property of a group is one
that must be shared by any isomorphic
group.
It must not depend on the names or
some other nonstructural characteristics
of the elements.
 The following are examples of some
structural properties and some
nonstructural properties of groups.

 Possible Structural  Possible Nonstructural

Properties Properties
1. The group is cyclic. 1. The group contains 5.
2. The group is abelian. 2. All elements of the group
3. The group has order n. are numbers.
4. The group is finite. 3. The group operation is
called “composition”.
5. The group has exactly 4. The elements of the group
two elements of order 5. are permutations.
6. The equation has a 5. The group operation is
solution for each denoted by juxtaposition.
element a in the group.
6. The group contains no
matrices.