[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 is cyclic if it has a single [generator_mathematics generator]: there is one element such that every element of the group is a [ power] of .]
Definition
A cyclic group is a group (hereafter abbreviated as simply ) with a single generator, in the sense that there is some such that for every , there is such that , where we have written for (with 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 if is a generator of .
Examples
- The group with two elements (say with identity with the only possible group operation ) is cyclic: it is generated by the non-identity element. Note that there is no requirement that the powers of be distinct: in this case, .
- The integers modulo form a cyclic group under addition, for any : it is generated by (or, indeed, by ).
- The symmetric groups for are not cyclic. This can be deduced from the fact that they are not abelian (see below).
Properties
Cyclic groups are abelian
Suppose , and let be a generator of . Suppose . Then .
Cyclic groups are countable
The elements of a cyclic group are nothing more nor less than , which is an enumeration of the group (possibly with repeats).