Orders of Cyclic Subgroups

|H|=|x| when Cyclic Group

If H=x then |H|=|x|. For the finite cases where |x|=n then H={1,x,x2,,xn1} and for the infinite case then xn1 for all n0 and xaxb for all abZ.

Proof

Let |x|=n. The elements 1,x,x2,,xn1 are distinct since if xa=xb with 0a<b<n then xba=x0=1, contradicting that n be the smallest positive power of x giving the identity. Thus H has at least n elements.

To show this is all of them, let xt be any power of x. Using the Division Algorithm write t=nq+k where 0k<n. Then:

xt=xnq+k=(xn)qxk=1qxk=xk{1,,xn1}

Now for |x|=, no positive power of x is the identity. If xa=xb by assumption then (for clarity say a<b) we have xba=1. Thus we found a positive power that makes the identity, which is a contradiction.

Since distinct powers of x are distinct elements of H then |H|=.