Lemma: Let be a subgroup of . Let . Then if and only if . Otherwise have no element in common. Similarly, if and only if , otherwise have no element in common.
Proof: If , then . Multiplying both sides on the right by gives . Conversely, if , then since (because ) we have for some . Multiplying on the right by shows that .
Now suppose have some element in common, that is for some . This implies , thus by above.
Lagrange's Theorem: If is a subgroup of , then for some positive integer . This is called the index of in . Furthermore, there exist such that and similarly with the left-hand cosets relative to .
Proof: Take any . Note . If then take any . By the lemma, are disjoint so we have . By continuing in this fashion, after steps for some positive integer , we will eventually have accounted for all of the elements of . We will have and .
Corollary: Let be a group and . Then the order of divides .
Corollary: Let be a group of prime order. Then has no subgroups and hence is cyclic.