The following two propositions determine every subgroup of every cyclic
group.
Poof idea
Search for the smallest positive element in . Start by choosing any
element . Search for a smaller element by considering
for every . Eventually, you will find an element that
is both the smallest positive element in and divides every other element
in .
Proof.
Let be a subgroup.
If , then .
Otherwise, let be a nonzero element of .
With , we alse have , and so we can say that
contains positive integers. With positive integers in , we can
ask for the smallest positive integer in , thanks to the well-ordering
principle of . Let be the smallest positive integer in
. We will show that .
First, we have , as is in and
is the smallest subgroup of containing .
Second, we have . To see this, let .
By the division algorithm, we can write for some integers
and with . Since and are in
, we have . Since is a positive integer
less than , we must have , as is the smallest positive
integer in . Thus, .
Therefore, , and we have .
Proof idea
The same idea above can be repeated here. Aluffi, on the other hand, takes a
more interesting approach that uses earlier results. He considers passing a
subgroup back through the quotient map from to
. The result must be a subgroup of ,
and so it must be of the form , by the above proposition.
Then, he shows that .
Proof.
Let be a subgroup.
Let be the quotient map.
Then is a subgroup of , and so it is of
the form for some . In other words,
is generated by , denoted as .
Going forward through the quotient map, we have
Thus, is generated by an element . In addition to this
result, notice that , as , which
means that the generator of divides .