We can now determine the structure of finite abelian groups. In particular, every such group is isomorphic to a direct product of cyclic groups, each having prime power order. The proof of this result is our main goal in the present chapter.
5.1 Direct Products
We defined the direct product of two groups in Definition 3.3. There is no particular reason that we need to restrict ourselves to two.
Definition 5.1.
Let be any groups. Then the
(external) direct product
is the Cartesian product of
the groups
under the operation
, for all
. (We allow
here, in which case
.)
Theorem 5.1.
If are groups, then
is a group.
Proof.
The proof is essentially identical to
that of Theorem 3.1.
The reason we used the word “external” in
the above definition is that the groups are not subgroups of the direct
product; indeed, they are not even subsets. However,
is, for instance, isomorphic in a
natural way to
, which is a subgroup of the direct
product. What we would like is a way of showing that a group is
isomorphic to the direct product of certain subgroups. To this end,
let us consider the following.
Definition 5.2.


- 1.
each
is normal;
- 2.
; and
- 3.
for each i,
, we have
.


In particular, G is the internal direct product of
normal subgroups and
if and only if
and
.
Example 5.1.
Let ,
and
. As G is abelian, every subgroup is normal.
Also,
and
. Thus,
. For each
, we could find
and
such that
but, in fact, we can avoid this by
noting that
(see Theorem 4.4). Thus,
, and G is the internal direct product of
and
.
Note that if there are more than two
groups, then we need to check more than just that each for the final part of the
definition.
Example 5.2.
Let ,
,
and
. Again, normality is not an issue. It
is easy to see that
. Thus,
. As every element of
is in
, we see immediately that
. But now we observe that
. Then the same argument shows that
, and we know that
. Therefore, G is the internal direct product of
,
and
.
Let us see how internal direct products behave. Here are some highly useful facts.
Lemma 5.1.
Let G be a group with normal subgroups
K and N. If , then
for all
,
.
Proof.
Let . As K is normal,
, so
. As N is normal,
, so
. Since
, we have
, and therefore
, as
required.
Lemma 5.2.
If G
is the internal direct product of , then every element of G can be written in exactly one way as
, with each
.
Proof.













Example 5.3.
As we saw in Example 5.2, is the internal direct product of
,
and
. Note, for instance, that
. By the above lemma, there is no
other way to write 23 as a sum of elements in
,
and
.
And now, the big reason why we are interested in these internal direct products.
Theorem 5.2.
Let G be a group, and suppose that it is the
internal direct product of normal subgroups . Then G is isomorphic to the external direct
product
.
Proof.


















As a result of this theorem, we will
engage in a small abuse of notation and write when G is the internal direct product of
, as well as for the external direct
product.
Example 5.4.
By Example 5.2, .
Example 5.5.
We claim that . As the group is abelian, normality
is not an issue. Also,
, so the intersection of these cyclic
subgroups must be trivial. Furthermore,
,
,
and
, so
(or just use an order argument).
Thus, we have an internal direct product.
Exercises
5.1.
Write U(32) as the internal direct product of two proper subgroups.
5.2.
Let . If
has order m and
has order n, what is the order of (h, k)?
5.3.
How many elements of order 5 are there
in ? How many elements of order 25?
5.4.
How many cyclic subgroups of order 5 are
there in ? How many cyclic subgroups of order
25?
5.5.
Show that is not the internal direct product of
two proper subgroups.
5.6.
Let and
. Write
as the internal direct product of two
proper subgroups in every possible way.
5.7.
Show that in Definition 5.2, it is not sufficient
to replace the third condition with the stipulation that
whenever
. In particular, find a group
G with normal subgroups
,
and
such that
and
whenever
, but
.
5.8.
Let be cyclic of order 84. Show that
.
5.9.
Suppose that is an internal direct product. If
is an onto homomorphism, does it
follow that
? Prove that it does, or give an
explicit counterexample.
5.10.
Let G be a group having finite normal
subgroups , such that the gcd of
and
is 1 whenever
. Show that
.
5.2 The Fundamental Theorem of Finite Abelian Groups
Let us now classify the finite abelian groups. We will break our proof down into stages. For the first stage, we need a definition.
Definition 5.3.
Let p be a prime number. Furthermore, let
G be a group and . We say that a is a p-element if
the order of a is
for some integer
. If every element of G is a p-element, then G is a p -group.
Example 5.6.
The dihedral group is a 2-group, as every element has
order 1, 2 or 4. On the other hand,
is not a p-group. Indeed, 12 and 18 are both
2-elements and 8 is a 3-element, so it cannot be a p-group. In fact, 1 is not a p-element, for any prime p.
Lemma 5.3.
Let p be a prime and G an abelian group. Then the p-elements of G form a subgroup.
Proof.
Let H be the set of all p-elements of G. As e has order , we have
. Let
. Then say that
and
. Let k be the larger of m and n. Then as G is abelian,
, as |a| and |b| both divide
. Thus, |ab| divides
, and therefore
. Finally, if
, then
, so
. Thus, H is indeed a subgroup of G.
Note that the preceding lemma does not
work for nonabelian groups. Indeed, in , we can see that
and
both have order 2, but their product,
, has order 3.
The following result is also very handy.
Lemma 5.4.
Let G be any group and let be such that a has finite order. Then
for some integers
, where each
is a
-element, for some prime
dividing |a|.
Proof.
















We can now simplify our task by breaking a finite abelian group down into a direct product of p-groups.
Lemma 5.5.
Let G be a nontrivial finite abelian group,
and let be the distinct primes dividing
|G|. Then
, where
is the subgroup of G consisting of all of the
-elements of G.
Proof.
Lemma 5.3 tells us that the are subgroups and, as G is abelian, we do not have to worry
about normality. Let us show that
. But taking any
, we see from Lemma 5.4 that a can be written as a product of elements
from various
. (If
, there is obviously nothing to worry
about.) Finally, we must show that for each i,
, we have
. But suppose that
and, simultaneously,
, with
. Then letting
, and
, we have
, and since each
divides m, we conclude that
. Thus, |a| divides m. But also, a is a
-element. As
, the only possible conclusion is that
, and we have an internal direct
product.
We can now focus our attention on finite abelian p-groups. The following lemma does the biggest part of the work. It is the most difficult proof we have encountered so far, and will take some time to absorb.
Lemma 5.6.
Let G be a finite abelian p-group, and let be an element of largest possible
order. Then
, for some subgroup H of G.
Proof.
Our proof is by strong induction on
|G|. If , then
and using
will work. So, assume that
and that the lemma holds for groups
of smaller order.
Let , with n a positive integer. If
, then we can use
, so assume that
. Take
such that
. As b is a p-element, we know that
, for some positive integer k. Let m be the smallest positive integer such
that
, and let
. Then
, but
. In particular, let us say that
, with
.
Now, as G is a p-group, and the largest element order is
, we must have
. Thus,
divides
. Suppose that
. Then by Corollary 3.2,
, which is impossible. Thus,
p divides i; let us say that
. Then let
. Note that
; thus, if
, then
, which is a contradiction. Therefore,
. However,
; thus,
.
Now, let us consider the group
. (As G is abelian, we do not have to worry
about
being normal.) We note that
M is still abelian (by Theorem
4.7), its order is
and it is a p-group with the orders of elements
dividing orders of elements of G (by Theorem 4.7). Also, we claim that
. As its order must divide
, suppose that
. Since
, we must have
, with
. But then
, so by Corollary 2.1, there exist
such that
. Thus,
, giving us a contradiction.
Therefore,
, as claimed.
It now follows that is an element of largest order in
M. As M is an abelian p-group of smaller order than G, our inductive hypothesis tells us that
there is a subgroup K of
M such that
, where N is the subgroup of M generated by
. By Theorem 4.8,
, where H is a subgroup of G containing
.
We claim that . Normality is not an issue. Suppose
that
. Then
, and as the product
is direct, this means that
. But we demonstrated above that the
order of
is
, which means that
divides i, and therefore
. Thus,
.
Now, take any . Then as
, we have
, for some
,
. Let us write
and
, with
and
. Then
, for some
. As
and
, we now see that
. Thus, we have the required direct
product, and our proof is complete.
And now, the payoff for our hard work!
Theorem 5.3
(Fundamental Theorem of Finite Abelian
Groups). Let
G be a finite abelian group.
Then G is the direct product of
subgroups, , with each
cyclic of order
, where the
are (not necessarily distinct)
primes, and the
are nonnegative integers.
Proof.
If G
is the trivial group, there is nothing to do. Otherwise, by Lemma
5.5,
G is the direct product of
p-subgroups. Therefore, we may
as well assume that G is a
finite abelian p-group. Our
proof is by strong induction on |G|. If , again, there is nothing to do, so
let G be nontrivial and suppose
that our theorem holds for groups of smaller order. Let a be an element of largest possible order
in G. Then by Lemma
5.6,
, for some subgroup H. But then
, so H has smaller order, and by our inductive
hypothesis, H is a direct
product of cyclic groups of prime power order. However,
is also a cyclic group of prime power
order, and we are done.
We can express this slightly differently.
Corollary 5.1.
Let G be a nontrivial finite abelian group.
Then G is isomorphic to
, where the
are some (not necessarily distinct)
primes, and the
are positive integers.
Example 5.7.
Up to isomorphism, the abelian groups of
order 16 are ,
,
,
and
.
Example 5.8.
Note that U(32) is an abelian group of order
, so it must be isomorphic to one of
the groups in the preceding example. But which one? Examining the
orders of the elements, we find that there is no element of order
16, so it is not
. However,
. As none of the other groups in the
preceding example have an element of order 8, U(32) is isomorphic to
.
Example 5.9.
As , the finite abelian groups of order
200 are all isomorphic to one of the following, namely
,
,
,
,
and
.
We might be momentarily concerned about
the absence of in the preceding example. However, it
is isomorphic to
, as the following theorem shows
us.
Theorem 5.4.
Let , where each
is cyclic of order
. Then G is cyclic if and only if
whenever
.
Proof.
Let . If the
are all relatively prime, then we
claim that
has order
, and therefore G is cyclic. Suppose that
. Then each
, so
. As the
are relatively prime,
, by Corollary 2.3. Since
, the largest possible order of an
element is
, and the claim is proved.
On the other hand, suppose that the
are not relatively prime. Without
loss of generality, say that some prime p divides both
and
. Then for any
, we have
, since each
divides
. (For
, we have
, and for
, we have
.) Thus, every element of G has order dividing
, and therefore there is no element of
order |G|, so G is not
cyclic.
As a result of our classification, we can prove a special case of a famous result due to Augustin-Louis Cauchy.
Theorem 5.5
(Cauchy’s Theorem for Abelian Groups). Let G be a finite abelian group, and suppose that p is a prime dividing |G|. Then G has an element of order p.
Proof.
If |G| is divisible by a prime, then
G is not the trivial group.
Letting G be as in Corollary
5.1, we see
that . If p divides |G|, then
, for some i. But then G has a subgroup isomorphic to
, for some
. However, in
, the element
has order p. The proof is
complete.
Corollary 5.2.
A finite abelian p-group has order , for some
.
Proof.
Let G be a finite abelian p-group. If the corollary is false, then
the order of G is divisible by
q, for some prime . But then G has an element of order q, which is
impossible.
Exercises
5.11.
Give a list of abelian groups of each of the following orders, such that every abelian group of that order is isomorphic to one of the groups in the list.
- 1.
21
- 2.
81
- 3.
9800
5.12.
Give a list of abelian groups of each of the following orders, such that every abelian group of that order is isomorphic to one of the groups in the list.
- 1.
144
- 2.
243
- 3.
55125
5.13.
Write U(56) as an external direct product of cyclic groups of prime power order, as in Corollary 5.1.
5.14.
Write as an external direct product of
cyclic groups of prime power order, as in Corollary 5.1.
5.15.
Let p be a prime. Suppose that G is a nontrivial finite abelian group in
which every element has order 1 or p. Show that G is isomorphic to a group of the form
.
5.16.
Suppose that n is an integer that is a product of distinct primes. If G is a finite abelian group, and |G| is divisible by n, show that G has a cyclic subgroup of order n.
5.17.
If is a cyclic group of order 35, write
a as the product of a 5-element
and a 7-element.
5.18.
If is a cyclic group of order 90, write
a as the product of p-elements, for various primes p.
5.19.
Prove Theorem 5.5 in a different way,
as follows. Let p be a prime
dividing |G|. Show that
G has an element a of some prime order, say q. If , we are done. Otherwise, what can be
said about
? Complete the proof.
5.20.
Let G be a finite abelian group and let n be a positive integer dividing |G|. Show that G has a subgroup of order n.
5.3 Elementary Divisors and Invariant Factors
For any positive integer n, we now know all possible abelian groups of order n, up to isomorphism. Indeed, we determine the prime factorization of n, and then proceed as in Examples 5.7 and 5.9. But we have not yet made certain that the groups we found are not isomorphic to each other. Let us work on that.
Definition 5.4.
Let G be a nontrivial finite abelian group,
and say that , where each
is cyclic of order
, for some prime
and positive integer
. Then the elementary divisors of G are the
numbers
, where the order in this list is
irrelevant, but each number must be listed as many times as it
occurs. The trivial group has no elementary divisors.
Example 5.10.
The elementary divisors of are 9, 9, 3, 125.
Example 5.11.
To find the elementary divisors of
, we use Theorem 5.4 to see that the
group is isomorphic to
, so the elementary divisors are
4, 3, 3, 25.
Definition 5.5.
Let G be an abelian group and n a positive integer. Then we write
.
Lemma 5.7.
- 1.
is a subgroup of G; and.
- 2.
if
is an onto homomorphism, then
.
Proof.
(1) See Exercise 3.40.
(2) If , then
. Also, if
, then as
is onto, write
, with
. Then
, completing the
proof.
The elementary divisors are very important, as they uniquely determine a finite abelian group, up to isomorphism.
Theorem 5.6.
Let G and H be finite abelian groups. Then G and H are isomorphic if and only if they have the same elementary divisors.
Proof.
If G and H have the same elementary divisors, then
each is isomorphic to a direct product of cyclic groups, and the
groups appearing in the direct product in G have the same order as those appearing
in H, so they are isomorphic.
(We must be a bit careful, as the cyclic groups may appear in a
different order in the direct product, but is always isomorphic to
, so this is not a problem. See
Exercise 4.36.) Note that if neither
G nor H has any elementary divisors, then each
is the trivial group, so they are isomorphic.
On the other hand, let be an isomorphism. Take any prime
p. Now, by Lemma 5.3, the p-elements of G form a subgroup, as do those of
H. Furthermore, as isomorphisms
preserve the orders of group elements,
provides an isomorphism from one of
these p-subgroups to the other.
As the elementary divisors come from these p-subgroups, we may as well assume to
begin with that G and
H are both p-groups. We proceed by strong induction
on |G|. If
, then G and H are both the trivial group, so neither
has elementary divisors. Therefore, assume that
and the result holds for groups of
smaller order.
In particular, say and
, where
is cyclic of order
, and
is cyclic of order
. Rearranging the terms if necessary,
we may assume that
and
. By the above lemma,
. Thus,
. But
, and since
, we have
, by Corollary 3.2. Similarly,
. Thus,
is a p-group of strictly smaller order than
G, and by our inductive
hypothesis, the elementary divisors of
and
are the same. But the elementary
divisors of
are
, where
but
whenever
. (When
, we have
, which does not count as an
elementary divisor. If
, then
has no elementary divisors.)
Similarly, the elementary divisors of
are
, where
but
whenever
. Therefore,
and
whenever
. But then
, for all
. Also,
for all
and
for all
. In order to prove that G and H have the same elementary divisors, it
remains only to show that
. But
and
. As isomorphic groups have the same
order,
, and therefore
. If
has no elementary divisors, then
neither does
, and we simply get
, hence
.
Example 5.12.
The five abelian groups of order 16 listed in Example 5.7 are all nonisomorphic, as they have different elementary divisors. Similarly for the six abelian groups of order 200 given in Example 5.9.
Example 5.13.
Let ,
and
. These are all abelian groups of
order 9600. However, using Theorem 5.4, we see that
G is isomorphic to
, so its elementary divisors are
8, 8, 2, 3, 25. Similarly, H is isomorphic to
, so its elementary divisors are
8, 4, 2, 2, 3, 5, 5 and K is isomorphic to
, so its elementary divisors are
8, 8, 2, 3, 25. Therefore, G and K are isomorphic, but H is not isomorphic to either of
them.
There is another interesting way to express a finite abelian group as a direct product of cyclic groups.
Theorem 5.7
(Invariant Factor
Decomposition).
Suppose that G is a nontrivial
finite abelian group. Then , where each
is a cyclic subgroup of G of order
, with
and
, for
.
Proof.
We will explain how to construct the
, assuming that G has been expressed as a direct product
of cyclic groups of prime power order, as in Corollary 5.1. Let
be the primes dividing |G|. For each j, find the largest power
such that
appears in Corollary 5.1. Letting
, Theorem 5.4 says that
is isomorphic to
. Now, delete all of the terms from
the direct product in Corollary 5.1 that we have used (deleting only one copy,
if multiple copies of the same group appear). For each j, let
be the largest power appearing in the
remaining terms (where
is entirely possible). Let
. By construction, each
, so
. Again,
is isomorphic to
. Delete all of these terms that we
have just used, and repeat until we exhaust the entire direct
product in Corollary 5.1.
Definition 5.6.
If G is isomorphic to , where
and
, for
, then the numbers
are called the invariant factors of
G.
Example 5.14.
Let us use our work in Example
5.9 to find
the invariant factors of the abelian groups of order 200. We apply
the method from Theorem 5.7. Considering , we see that the highest power of 2
that appears is 4, and the highest power of 5 is 25. Therefore,
. Deleting
and
, we are left with
, so
, and we are finished. Thus, our group
is isomorphic to
, so the invariant factors are
2, 100. When we examine
, we see that
. Deleting
and
, we are left with
. Thus,
. Deleting
and
, we are left only with
. Thus,
, and we are finished. Therefore, our
group is isomorphic to
, which gives invariant factors of
2, 10, 10. Considering
, we simply get
, so 200 is the only invariant factor.
Looking at
, we have
, so the invariant factors are
2, 2, 50. When we examine
, we obtain
, so the invariant factors are
5, 40. Finally, if we take
, then we get
, so the invariant factors are
10, 20.
In the above example, the nonisomorphic groups produced different lists of invariant factors. As it turns out, this always happens.
Theorem 5.8.
Let G and H be nontrivial finite abelian groups. Then G and H are isomorphic if and only if they have the same invariant factors.
Proof.
Let G be isomorphic to with
and
,
. Similarly, write H as
, with
and
,
. If G and H have the same invariant factors, then
they are both isomorphic to the same direct product, and therefore
to each other.
On the other hand, suppose that
G and H are isomorphic. We will show that they
have the same invariant factors. Our proof is by strong induction
on |G|. If , then the only possible invariant
factor list is 2 for both G and
H, so there is nothing to do.
Assume that
and that the result is true for
groups of smaller order. If we take
, then each
has order dividing
, and therefore all
have order dividing
. On the other hand
has order
. Thus,
is the largest possible order of an
element of G. Similarly,
is the largest possible order of any
element of H. Therefore, as
isomorphisms preserve orders of group elements,
. Now, expressing each
as a product of prime powers, we note
that the elementary divisors of G are those that come from
together with those from
. Similarly, the elementary divisors
of H are those coming from
together with those from
. As G and H are isomorphic, Theorem 5.6 tells us that they
have the same elementary divisors. Deleting those from
, the groups
and
have the same elementary divisors.
Thus, by Theorem 5.6, these groups are isomorphic. As they have
smaller order than G, our
inductive hypothesis tells us that
and each
. Therefore, the invariant factors are
identical.
(We have to be a bit careful if either
or
, as then we have nothing left when we
remove the term
or
. But in this case, comparing orders,
we must have
, and the only invariant factor is
for both
groups.)
Exercises
5.21.
Find the elementary divisors for each of the following groups.
- 1.
- 2.
5.22.
Find the invariant factors for each of the following groups.
- 1.
- 2.
5.23.
Let p, q
and r be distinct primes. Give
the list of elementary divisors for every possible abelian group of
order .
5.24.
Let p, q
and r be distinct primes. Give
the list of invariant factors for every possible abelian group of
order .
5.25.
For which positive integers n are all abelian groups of order n isomorphic?
5.26.
Find the smallest positive integer n such that there are exactly four nonisomorphic abelian groups of order n.
5.27.
Let ,
and
be finite abelian groups, and suppose
that
is isomorphic to
. Show that
and
are isomorphic.
5.28.
Let a finite abelian group G have invariant factors . What are the invariant factors of
?
5.29.
Let G be a nontrivial finite abelian 2-group.
Show that the number of elements of order 2 in G is , for some positive integer k.
5.30.
Let G be a finite abelian group. Suppose
that, for every , there are at most n elements
satisfying
. Show that G is cyclic.
5.4 A Word About Infinite Abelian Groups
Unfortunately, that word is “messy”. We
have seen that finite abelian groups behave very nicely. To be
sure, we cannot possibly expect every infinite abelian group to be
a direct product of cyclic groups of prime power order. But even if
we allow direct products of infinite cyclic groups such as
, that does not come close to covering
all of the possibilities. While a deep discussion of infinite
abelian groups is beyond the scope of an introductory abstract
algebra course, we can make a few remarks.
Definition 5.7.
Let G be a nontrivial group. We say that G is decomposable if it is the direct product of two proper subgroups. If not, then it is indecomposable .
We can easily classify the indecomposable finite abelian groups.
Theorem 5.9.
Let G be a finite abelian group. Then
G is indecomposable if and only
if G is a cyclic group of order
, for some prime p and positive integer n.
Proof.
In view of Theorem 5.3, an indecomposable
finite abelian group must indeed be cyclic of prime power order. If
G is cyclic of order
, then suppose that
, for some subgroups H and K. Then by Lagrange’s theorem, H and K are both p-groups. Furthermore, by Theorem
3.16, they are both cyclic. But
since
is cyclic, it follows from Theorem
5.4 that
. As the orders are both powers of
p, this means that either
H or K is trivial, so either K or H is all of G. Thus, H and K are not both proper and G is indecomposable.
What about infinite abelian groups?
Example 5.15.
The additive group is indecomposable. Indeed, suppose
that
, where H and K are proper subgroups. Then neither
H nor K is
, so take
,
, where a, b,
c and d are nonzero integers. Note that
and
. Then
is not trivial, so we do not have a
direct product. Also,
is not cyclic. Indeed, if
and
, it is clear that
. Thus,
.
Now, every element of other than the identity has infinite
order. What about infinite abelian groups where every element has
finite order?
Example 5.16.
Consider the group . Exercise 5.31 asks us to examine
some properties of this group. In particular, the distinct elements
of the group are precisely of the form
, where
and
. Also, every element has finite
order. But this group is decomposable. Indeed, fix any prime
p. Then let
and
. In Exercise 5.32, we also
demonstrate that
.
The group H from the preceding example is named for E.P. Heinz Prüfer.
Definition 5.8.
Let p be a prime. Then the Prüfer p -group
is the subgroup of the additive group
.
Example 5.17.
Let H be the Prüfer p-group. We note that H is an abelian p-group; indeed, ; thus, the order of
divides
. But H is not cyclic; indeed,
has order
, so H has elements of arbitrarily large
order. So if it were cyclic, what order could its generator
possibly have? However, Exercise 5.36 asks us to show that every nontrivial
subgroup of H contains
. Thus, H is surely indecomposable.
In fact, and the Prüfer p-group share another interesting
property.
Definition 5.9.
Let G be an abelian group written additively.
We say that G is divisible
if, for every element a of G and every positive integer n, there exists a such that
.
Note that if G is a nontrivial finite abelian group,
then it cannot be divisible. Indeed, if G has order n, then for every
. Thus, if
, then
has no solution. So, we must look to
infinite abelian groups.
Example 5.18.
The group is divisible. Indeed, if
and n is a positive integer, then
.
Example 5.19.
For any prime p, the Prüfer p-group is divisible. Indeed, to see
this, we note that if G is
divisible, so is any factor group of G. (See Exercise 5.35.) Thus,
is divisible. As in Example
5.16, write
, where H is the Prüfer p-group. If
, then by the divisibility of
, for any positive integer n, there exist
,
such that
. But then
.
Exercises
5.31.
Let .
- 1.
Show that the elements of G can be uniquely written in the form
, where
and
.
- 2.
If
,
and
, what is the order of
in G?
5.32.
Show that for any prime p, , where H is the Prüfer p-group and
.
5.33.
Let G be a divisible group, written
additively. Show that for every positive integer n, the function given by
is an onto homomorphism. Is it
necessarily an automorphism?
5.34.
Let G and H be abelian groups, written additively.
Show that is divisible if and only if
G and H are both divisible.
5.35.
Show that if G is a divisible group, then every factor group of G is divisible, but subgroups need not be.
5.36.
Let G be the Prüfer p-group, for some prime p. Show that every nontrivial subgroup of
G contains .
5.37.
Let G be an abelian group having a subgroup
N such that G / N is infinite cyclic. Show that
G has a subgroup H such that H is infinite cyclic and .
5.38.
For any prime p, show that every proper subgroup of the Prüfer p-group is finite.