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 GH.

  1. |G|=|H|.
  2. If G is Abelian, then H is Abelian.
  3. If G is cyclic, then H is cyclic.
  4. If G has a subgroup of order n (for some positive integer n), then H has a subgroup of order n.
  5. If G has an element of order n, then H has an element of order n.
  6. If every element of G is its own inverse, then every element of H is its own inverse.
  7. 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 GZp.

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(pi1) for 1ik and 1jk.

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 GA1××As and GB1××Bt, where each Ai and Bj is cyclic of prime power order, then s=t and, after suitable relabeling of subscripts, |Ai|=|Bi| for 1is.

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
525 Z52×Z5
555 Z5×Z5×Z5

More generally,

Factorizations (n=p3) Isomorphism Class Representative
p3 Zp3
p2p Zp2×Zp
ppp 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
2352 Z23×Z52
2355 Z23×Z5×Z5
22252 Z22×Z2×Z52
22255 Z22×Z2×Z5×Z5
22252 Z2×Z2×Z2×Z52
22255 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
11
21
31
42
51
62
71
85
92
102
111
125
131
142
151
1614
171
185
191
205
212
222
231
2415
252
262
275
284
291
304
311
3251

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)aiAi} 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.