Jump to content

Subgroups of Z/One generator/Fact/Proof/Exercise/Solution

A subset of the form ℤd is a subgroup due to the distributive law. Let now H⊆ℤ be a subgroup. In case H=0, we can take d=0. Hence, we may assume that H contains beside 0 another element x. If x id negative, then subgroup H must contain its negative −x, , which is positive. This means that H contains also a positive number. Let d denote the smallest positive number in H. We claim H=ℤd. Here, the inclusion ℤd⊆H is clear, as all (positive and negative) multiples of d must belong to the subgroup. To show the inverse inclusion, let h∈H be arbitrary. Due to the division with remainder, we have

h=qd+r with 0≤r<d.

Because of h∈H and qd∈H, also r=h−qd∈H holds. Because of the choice of d and r<d, we must have r=0. This means h=qd. Therefore h∈ℤd, thus H⊆ℤd.