A cyclic group G is a group that can be generated by a single element a, the so-called group generator, which we denote by ⟨a⟩. To be precise, if a is a generator of the group G, then G consists of all the powers of a, i.e.,
⟨a⟩={…,a−2,a−1,a0=1=eG,a,a2,a3,…}
thus every element in G has the form ai for some integer i∈Z, where
an+1=an∗a
and we say that G is a cyclic group generated by a. Hence, a group G is said to be cyclic if there exists an element in G whose powers generate the whole group.
Cyclic group
Definition:
A group G is said to be cyclic if there exists an element a∈G such that
G=⟨a⟩={an∣n∈Z},
where a is called the generator of G.
Note: A cyclic group may have many different generators.
Corollary 1
Every cyclic group is abelian.
Proof:
Let x, y \in G=\langle a\ranglegle . We denote x=ai and y=aj. Then, clearly
x⋅y=aiaj=ai+j=aj+i=ajai=y⋅x.
Example:
The following examples show cyclic groups:
-
The set Z of integers under addition is an infinite cyclic group, where Z=⟨1⟩=⟨−1⟩.
-
The set Zn={0,1,2,…,n−1} under addition modulo n is a finite cyclic group, where Zn=⟨1⟩=⟨n−1⟩ because n−1≡−1 mod n.
Other generators are possible depending on n. For example, Z10=⟨1⟩= ⟨9⟩=⟨3⟩=⟨7⟩.
Part(2) of the example shows an important fact, explained in the following sections.
Lemma 1
If a is a group generator, then so it’s its inverse a−1, meaning that if G=⟨a⟩, then also G=⟨a−1⟩.
Proof:
Suppose that G=⟨a⟩. Let g be any group element, i.e., g∈G. Since G=⟨a⟩, there exists an n∈Z such that g=an.
Then, g−1=(an)−1=a−n=(a−1)n∈⟨a−1⟩.
Since ⟨a−1⟩ is closed under inverses and g−1∈⟨a−1⟩, it follows that g=(g−1)−1∈⟨a−1⟩, hence G⊆⟨a−1⟩, and so G=⟨a−1⟩.
Lemma 2
Let G=⟨a⟩ be a cyclic group. Then one of the following holds:
-
⟨a⟩≅(Z,+) if G is an infinite cyclic group.
-
⟨a⟩≅(Zn,+), where n is the smallest positive integer such that an=eG.
The following example is of great importance in order to understand the properties of cyclic groups.
Example:
Consider the cyclic group g of order 12 with generator a. Then, the group consists of the following set:
G={1,a1,a2,a3,a4,a5,a6,a7,a8,a9,a10,a11}.
We observe that
⟨a5⟩={a5,a10,a3,a8,a,a6,a11,a4,a9,a2,a7,1}=G
,hence a5 is also a group generator next to a. By using the same argument, a7 and a11 also generate G, as discussed earlier. Any other element of the group is not a generator of G, as
⟨1⟩⟨a6⟩⟨a4⟩=⟨a8⟩⟨a3⟩=⟨a9⟩⟨a2⟩=⟨a10⟩={1},={1,a6},={1,a4,a8},={1,a3,a6,a9},={1,a2,a4,a6,a8,a10}.