Note.
If two finite groups are
isomorphic, then they have the
same order. Whence comes the
simplest of all tests for showing
that two groups are not isomorphic:
Theorem.
If G and H are groups and
|G|≠|H|, then
G and H are not isomorphic.
Other properties that can
be used to determine that
two groups are not isomorphic
are given next.
Theorem 19.1.
Assume that G and H are groups
and that G≈H.
-
|G|=|H|.
-
If G is Abelian,
then H is Abelian.
-
If G is cyclic, then H is cyclic.
-
If G has a subgroup of order n
(for some positive integer n),
then H has a subgroup of
order n.
-
If G has an element of order n,
then H has an element of order n.
-
If every element of G is its own
inverse, then every element of H
is its own inverse.
-
If every element of G has finite
order, then every element of H
has finite order.
Theorem 19.2.
Isomorphism is an equivalence relation
on the class of all groups.
Theorem 19.3.
If p is prime and |G|=p
then group G≈Zp.
Theorem.
There is just one group of order n
iff
n is a prime or a product of
distinct primes p1,…,pk
such that pj∤(pi−1)
for 1≤i≤k
and 1≤j≤k.
Theorem.
There are two isomorphism classes
of groups of order n=p2:
the group Zp2 is in one
class and Zp×Zp
is in the other.
Theorem.
There are five isomorphism classes
of groups of order n=p3:
three of these classes consist of
Abelian groups (Example N 19.1):
Zp3,
Zp2×Zp,
and
Zp×Zp×Zp;
the other two classes consist of
non-Abelian groups.
See Problem 19.24 for the
definition of direct products of
more than two groups.
Fundamental Theorem of Finite Abelian Groups.
If G is a finite Abelian group,
then G is the direct product of
cyclic groups of prime power order.
Moreover, if
G≈A1×⋯×As
and
G≈B1×⋯×Bt,
where each Ai and Bj is
cyclic of prime power order, then
s=t and, after suitable relabeling
of subscripts, |Ai|=|Bi|
for 1≤i≤s.
Example 19.1.
Let n=125=53.
To apply the theorem, first determine
all possible ways of factoring 125
as a product of (not necessarily distinct)
prime powers.
Each factorization gives a different
isomorphism class, so there are
three isomorphism classes of Abelian
groups of order 125. One represenative
from each class is displayed.
Factorizations (n=125)
|
Isomorphism Class Representative
|
53
|
Z53
|
52⋅5
|
Z52×Z5
|
5⋅5⋅5
|
Z5×Z5×Z5
|
More generally,
Factorizations (n=p3)
|
Isomorphism Class Representative
|
p3
|
Zp3
|
p2⋅p
|
Zp2×Zp
|
p⋅p⋅p
|
Zp×Zp×Zp
|
Example 19.2.
Let n=200=23×52.
There are six isomorphism classes of
Abelian groups of this order.
One representative from each class
is displayed.
Factorizations (n=200)
|
Isomorphism Class Representative
|
23⋅52
|
Z23×Z52
|
23⋅5⋅5
|
Z23×Z5×Z5
|
22⋅2⋅52
|
Z22×Z2×Z52
|
22⋅2⋅5⋅5
|
Z22×Z2×Z5×Z5
|
2⋅2⋅2⋅52
|
Z2×Z2×Z2×Z52
|
2⋅2⋅2⋅5⋅5
|
Z2×Z2×Z2×Z5×Z5
|
Table 19.1.
Number of isomorphism classes
of groups of order n for each
n from 1 to 32.
Order
|
Number of Groups
|
1 | 1 |
2 | 1 |
3 | 1 |
4 | 2 |
5 | 1 |
6 | 2 |
7 | 1 |
8 | 5 |
9 | 2 |
10 | 2 |
11 | 1 |
12 | 5 |
13 | 1 |
14 | 2 |
15 | 1 |
16 | 14 |
17 | 1 |
18 | 5 |
19 | 1 |
20 | 5 |
21 | 2 |
22 | 2 |
23 | 1 |
24 | 15 |
25 | 2 |
26 | 2 |
27 | 5 |
28 | 4 |
29 | 1 |
30 | 4 |
31 | 1 |
32 | 51 |
Problem 19.24.
If {A1,…,An}
is any collection of groups,
each with juxtaposition as
operation, then the
direct product
of these groups is the group
A1×⋯×An
={(a1,…,an)∣ai∈Ai}
with operation
(a1,…,an)(b1,…,bn)
=(a1b1,…,anbn).
Problem 19.25.
An isomorphism of a group onto itself is
called an
automorphism.
The set of all
automorphisms of a group is itself a group
with respect to composition. This group of
automorphisms of a group is called
the automorphism group of G,
and will be denoted Aut(G).
Note that the elements of Aut(G) are mappings
from G onto G.