deepdream of
          a sidewalk
Show Question
Math and science::Algebra::Aluffi

Subgroups of cyclic groups

The following two propositions determine every subgroup of every cyclic group.

Subgroup of Z

Let G be a subgroup of Z. Then G=dZ for some d0.

Subgroup of Z/nZ

Let G be a subgroup of Z/nZ for some n0. Then G=Z/dZ for some d0 with dn.

Can you recall the proofs?


Poof idea

Search for the smallest positive element in G. Start by choosing any element bG. Search for a smaller element by considering ba for every aG. Eventually, you will find an element cG that is both the smallest positive element in G and divides every other element in G.

Proof. Let GZ be a subgroup. If G={0}, then G=0Z. Otherwise, let bG be a nonzero element of G. With bG, we alse have bG, and so we can say that G contains positive integers. With positive integers in G, we can ask for the smallest positive integer in G, thanks to the well-ordering principle of Z. Let d be the smallest positive integer in G. We will show that G=dZ. First, we have dZG, as d is in G and dZ is the smallest subgroup of Z containing d. Second, we have GdZ. To see this, let aG. By the division algorithm, we can write a=qd+r for some integers q and r with 0r<d. Since a and qd are in G, we have r=aqdG. Since r is a positive integer less than d, we must have r=0, as d is the smallest positive integer in G. Thus, a=qddZ. Therefore, GdZ, and we have G=dZ.

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 Z to Z/nZ. The result must be a subgroup of Z, and so it must be of the form dZ, by the above proposition. Then, he shows that dn.

Proof. Let GZ/nZ be a subgroup. Let πn:ZZ/nZ be the quotient map. Then G=πn1(G) is a subgroup of Z, and so it is of the form dZ for some d0. In other words, G is generated by d, denoted as G=d. Going forward through the quotient map, we have G=πn(G)=πn(d)=[d]n. Thus, G is generated by an element [d]n. In addition to this result, notice that nG, as πn(n)=[0]nG, which means that the generator d of G divides n.