Cyclic group

https://arbital.com/p/cyclic_group

by Patrick Stevens Jun 13 2016 updated Jul 10 2016

Cyclic groups form one of the most simple classes of groups.


[summary: The cyclic groups are the simplest kind of group; they are the groups which can be made by simply "repeating a single element many times". For example, the rotations of a polygon.]

[summary(technical): A group G is cyclic if it has a single [generator_mathematics generator]: there is one element g such that every element of the group is a [ power] of g.]

Definition

A cyclic group is a group (G,+) (hereafter abbreviated as simply G) with a single generator, in the sense that there is some gG such that for every hG, there is nZ such that h=gn, where we have written gn for g+g++g (with n terms in the summand). That is, "there is some element such that the group has nothing in it except powers of that element".

We may write G=g if g is a generator of G.

Examples

Properties

Cyclic groups are abelian

Suppose a,bG, and let g be a generator of G. Suppose a=gi,b=gj. Then ab=gigj=gi+j=gj+i=gjgi=ba.

Cyclic groups are countable

The elements of a cyclic group are nothing more nor less than {g0,g1,g1,g2,g2,}, which is an enumeration of the group (possibly with repeats).