CYCLIC GROUPS

Dr. Anil Kumar Shukla

Cyclic Group
A group 𝐺 is said to be cyclic group if and only if it coincides with one of its cyclic
subgroups i.e. 𝑡ℎ𝑒𝑟𝑒 𝑒𝑥𝑖𝑠𝑡𝑠 𝑎 ∈ 𝐺 𝑠𝑢𝑐ℎ 𝑡ℎ𝑎𝑡 [𝑎] = 𝐺.

Proposition A subgroup of a cyclic group is also cyclic.

Proof
Let 𝐺 be a cyclic group generated by 𝑎 i.e. 𝐺 = [𝑎] and 𝐻 be a subgroup of 𝐺.
We have to prove that 𝐻 is cyclic. Let 𝑥 ∈ 𝐻. As 𝐻 ≤ 𝐺 = [𝑎] so 𝑥 = 𝑎𝑛 for some 𝑛 ∈ ℤ.
Let 𝑚 be the least +𝑣𝑒 integer such that 𝑎𝑚 ∈ 𝐻. Then by division algorithm, there
exists unique integers q and r such that
𝑛 = 𝑚𝑞 + 𝑟; 𝑤ℎ𝑒𝑟𝑒 0 ≤ 𝑟 < 𝑚.
If 𝑟 ≠ 0, then 𝑎𝑟 = 𝑎𝑛−𝑚𝑞 = 𝑎𝑛 𝑎−𝑚𝑞 = 𝑎𝑛 (𝑎𝑚 )−𝑞 ∈ 𝐻 (as 𝐻 ≤ 𝐺), which contradicts the
choice of 𝑚 and therefore 𝑟 = 0.
Thus 𝑥 = 𝑎𝑛 = 𝑎𝑚𝑞 = (𝑎𝑚 )𝑞
Hence 𝐻 = [𝑎𝑚 ] and hence 𝐻 is cyclic.
#
Note
If 𝐺 is a group whose all proper subgroups are cyclic then 𝐺 need not be cyclic.
e.g. Klien’s four group 𝑉4 and Hamiltonian eight group 𝑄8 .

Proposition An infinite cyclic group has only two generators.

Proof
Let 𝐺 be an infinite cyclic group generated by 𝑎 i.e. 𝐺 = [𝑎] = {𝑎𝑛 : 𝑛 ∈ ℤ}.
As 𝐺 is infinite therefore 𝑎𝑚 = 𝑒 ⟺ 𝑚 = 0 (𝑖. 𝑒. 𝑛𝑜 𝑡𝑤𝑜 𝑑𝑖𝑠𝑡𝑖𝑛𝑐𝑡 𝑝𝑜𝑤𝑒𝑟𝑠 𝑜𝑓 𝑎 𝑎𝑟𝑒 𝑒𝑞𝑢𝑎𝑙).
Let 𝑏 ∈ 𝐺 be a generator of 𝐺 = [𝑎], then 𝑏 = 𝑎𝑛 ; for some 𝑛 ∈ ℤ.
Since 𝐺 = [𝑏] and 𝑎 ∈ 𝐺 therefore 𝑎 = 𝑏𝑡 = (𝑎𝑛 )𝑡 = 𝑎𝑛𝑡 ; for some 𝑡 ∈ ℤ.
⟹ 𝑎𝑛𝑡−1 = 𝑒
⟹ 𝑛𝑡 − 1 = 0
⟹ 𝑛 = 𝑡 = 1 𝑜𝑟 𝑛 = 𝑡 = −1
⟹ 𝑏 = 𝑎 𝑜𝑟 𝑏 = 𝑎−1 .
Thus 𝑎 and 𝑎 are the only generators of 𝐺.
−1

#
Proposition The order of a cyclic group is equal to the order of its generating
element. Conversely, if a finite group of order 𝑛 contains an element of order 𝑛
then the group is cyclic.
Proof
Let 𝐺 be a cyclic group generated by 𝑎 i.e. 𝐺 = [𝑎] and 𝑜(𝑎) = 𝑛
1. If 𝑛 = 0 then no two powers of 𝑎 are equal for if 𝑎𝑟 = 𝑎 𝑠 ; 𝑟 < 𝑠 then 𝑎 𝑠−𝑟 = 𝑒
which contradicts that 𝑜(𝑎) = 0. Therefore 𝐺 = {𝑎, 𝑎2 , … … … , 𝑎𝑟 , … . . } is an
infinite group.
2. If 𝑛 > 0 then 𝑛 is the least positive integer such that 𝑎𝑛 = 𝑒.
Let 𝐺 ′ = {𝑎, 𝑎2 , … … … , 𝑎𝑛 = 𝑒} then 𝐺′ contains exactly 𝑛 elements for if 1 < 𝑟 < 𝑠 < 𝑛
and 𝑎𝑟 = 𝑎 𝑠 then 0 < (𝑠 − 𝑟) < 𝑛 𝑎𝑛𝑑 𝑎 𝑠−𝑟 = 𝑒 which contradicts that 𝑜(𝑎) = 𝑛.
Claim 𝐺 = 𝐺′, for
Clearly 𝐺 ′ = {𝑎, 𝑎2 , … … … , 𝑎𝑛 = 𝑒} ⊆ 𝐺…………(i)
Also let 𝑏 ∈ 𝐺 = [𝑎] then 𝑏 = 𝑎 𝑠 for some 𝑠 ∈ ℤ. Therefore by division algorithm,
there exist unique integers 𝑞 𝑎𝑛𝑑 𝑟 such that
𝑠 = 𝑛𝑞 + 𝑟 ; 0 ≤ 𝑟 < 𝑛
Therefore 𝑏 = 𝑎 = 𝑎
𝑠 𝑛𝑞+𝑟
= (𝑎 ) . 𝑎𝑟 = 𝑎𝑟 ∈ 𝐺′.
𝑛 𝑞

Therefore 𝐺 ⊆ 𝐺′ …………….(ii)
Thus from (i) and (ii) 𝐺 = 𝐺′ and therefore 𝑜(𝐺 ) = 𝑛.
Conversely, let 𝐺 be a finite group of order 𝑛 and 𝑎 ∈ 𝐺 such that 𝑜(𝑎) = 𝑛 then 𝑛 is
the least positive integer such that 𝑎𝑛 = 𝑒. Let H= {𝑎, 𝑎2 , … … … , 𝑎𝑛 = 𝑒} then 𝐻 is a
subgroup of 𝐺 which contains exactly 𝑛 elements for if 1 < 𝑟 < 𝑠 < 𝑛 and 𝑎𝑟 = 𝑎 𝑠
then 0 < (𝑠 − 𝑟) < 𝑛 𝑎𝑛𝑑 𝑎 𝑠−𝑟 = 𝑒 which contradicts that 𝑜 (𝑎) = 𝑛.
Therefore 𝐻 = 𝐺 and hence 𝐺 is a cyclic group.
#
Proposition Let 𝐺 be a finite cyclic group of order 𝑛 generated by 𝑎 then 𝑎𝑝 is also
a generator of 𝐺 𝑖. 𝑒. 𝐺 = [𝑎𝑝 ]; where 0 < 𝑝 < 𝑛 if and only if (𝑝, 𝑛) = 1 i.e. 𝑝 and 𝑛 are
co-prime.
Proof
Let 0 < 𝑝 < 𝑛 and (𝑝, 𝑛) = 1 i. e. 𝑝 and 𝑛 are co − prime. We have to prove that 𝐺 = [𝑎𝑝 ].
Clearly [𝑎𝑝 ] ⊆ [𝑎] = 𝐺 ……………(i)
Since (𝑝, 𝑛) = 1 therefore by Euclidean Algorithm, there exist integers 𝑢 and 𝑣 such
that
𝑝𝑢 + 𝑛𝑣 = 1
Therefore 𝑎 = 𝑎 𝑝𝑢+𝑛𝑣
= (𝑎 ) . (𝑎 ) = (𝑎𝑝 )𝑢 (as 𝑎𝑛 = 𝑒, for 𝑜(𝐺 ) = 𝑛 𝑎𝑛𝑑 𝐺 = [𝑎])
𝑝 𝑢 𝑛 𝑣

So [𝑎] ⊆ [𝑎𝑝 ] 𝑖. 𝑒. 𝐺 ⊆ [𝑎𝑝 ] ………………(ii)

Therefore from (i) and (ii) we have
𝐺 = [𝑎 𝑝 ] .
Conversely, let [𝑎𝑝 ] = [𝑎] = 𝐺 then there exists 𝑚 ∈ ℤ such that (𝑎𝑝 )𝑚 = 𝑎
⟹ 𝑎𝑝𝑚−1 = 𝑒
⟹ 𝑛|(𝑝𝑚 − 1)
⟹ 𝑝𝑚 − 1 = 𝑛𝑞; 𝑓𝑜𝑟 𝑠𝑜𝑚𝑒 𝑞 ∈ ℤ
⟹ 𝑝𝑚 + 𝑛𝑞′ = 1
⟹ (𝑝, 𝑛) = 1
#
Remark
If 𝐺 is a finite cyclic group of order 𝑛 then the number of generators of 𝐺 is 𝜙(𝑛),
where 𝜙 is Euler’s 𝜙 − 𝑓𝑢𝑛𝑐𝑡𝑖𝑜𝑛.

Theorem Every cyclic group is abelian. But the converse need not be true.
Proof
Let 𝐺 be a cyclic group generated by 𝑎 i.e. 𝐺 = [𝑎] and 𝑥, 𝑦 ∈ 𝐺 then 𝑥 = 𝑎𝑚 , 𝑦 = 𝑎𝑛 ;
for some 𝑚, 𝑛 ∈ ℤ.
Therefore 𝑥. 𝑦 = 𝑎𝑚 . 𝑎𝑛 = 𝑎𝑚+𝑛 = 𝑎𝑛+𝑚 = 𝑎𝑛 . 𝑎𝑚 = 𝑦. 𝑥
Thus 𝐺 is abelian.
Converse Part
The Klien’s four group is abelian but not cyclic.
 Exercise
1. Let 𝐺 be a cyclic group generated by 𝑎 i.e. 𝐺 = [𝑎].
(i) If order of 𝑎 is zero (infinite) then prove that 𝐺 is isomorphic to the
additive group of integers (ℤ, +).
(ii) If order of 𝑎 is 𝑛 (finite) then prove that 𝐺 is isomorphic to the additive
group of residue classes modulo 𝑛 i.e. (ℤ𝑛 , +).
2. Prove that homomorphic image of a cyclic group is cyclic.
3. Prove that any two infinite cyclic groups are isomorphic.
4. Prove that any two finite cyclic groups of same order are cyclic.
5. Show that 𝑈9 is cyclic. What are its all generators?
6. Show that 𝑈17 is cyclic. What are its all generators?
7. Show that 𝑈8 is not cyclic.
8. Let 𝐺 be a cyclic group generated by 𝑎 then prove that [𝑎𝑚 ] = [𝑎𝑛 ]𝑖𝑓𝑓 𝑚 = ±𝑛.
In particular [𝑎𝑚 ] = 𝐺 𝑖𝑓𝑓 𝑚 = ±1.
9. Show that there are infinitely many proper subgroups of an infinite cyclic
group.
10. Show that corresponding to every divisor of the order of a cyclic group there
is a unique subgroup of that order.