Cyclic Groups

Subjects: Group Theory
Links: Groups, Integers modulo n, Subgroups, Group Homomorphisms and Isomorphisms, Integer Numbers

Def: We define the powers xn of x (for nZ) as follows:

Prop: Let G be a group and let xG. Let m,nZ. Then:

Def: For G a group and xG define the order of x to be the smallest positive integer n such that xn=1, and denote this integer by o(x). In the case x is said to be of order n. If no positive power of x is the identity, the order of x is defined to te o(x)=, or infinite order.

Def: For xG, then we consider the subgroup generated by x x:={xnGnZ}. A group G is called cyclic if there is an element xG such that G=x; then x is then called a generator for G.

Th: If G is cyclic, then G is abelian

Prop: If G is cyclic, then every subgroup of G is cyclic

Prop: Let G be a group and xG.

Cor: If G=x, then G=x1.

Th: Let G=x. If o(x)=, then xjxk, for jk, and as a consequence G is infinite. If o(x)=n, then jk(modn), and as a consequence the distinct elements of G are e,x,x2,,xn1.

Def: The order of a group G, defined by |G| is the cardinality of the set

Cor: If G=x, then |G|=o(x).

Th: If G is an infinite subgroup generated by g, then every power of g is distinct.

Th: If G is a finite group of order n, the following statements are equivalent:

Th: If G is a finite cyclic group of order n, then G is isomorphic to Zn. If G is a cyclic and of infinite order, then G is isomorphic to Z.

Def: Since the cyclic groups are unique up to isomorphism, we can just denoted C(n) or Cn as the cyclic of order n.

Th: Every subgroup of Z are of the form nZ for nZ.