Jump to content

Subgroups of Z/One generator/Fact/Proof

From Wikiversity
Proof

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

Because of and , also holds. Because of the choice of and , we must have . This means . Therefore , thus .