groups
Cyclic Groups
You should know: subgroups
Overview
A cyclic group is a group that can be generated by repeatedly applying a single element and its inverse. Cyclic groups are the simplest possible groups structurally, and every subgroup of a cyclic group is itself cyclic, making them a natural base case for classification theorems.
Formal Definition
A group G is cyclic if there exists an element g ∈ G, called a generator, such that every element of G is an integer power of g:
Properties
Abelian
Subgroups of cyclic groups are cyclic
Classification
Generators of ℤₙ
Condition: φ = Euler's totient function
Applications
Worked Examples
An element k generates ℤ₆ iff gcd(k, 6) = 1.
Check k = 1: gcd(1,6)=1 — generator. k=2: gcd(2,6)=2 — not. k=3: gcd(3,6)=3 — not. k=4: gcd(4,6)=2 — not. k=5: gcd(5,6)=1 — generator.
Answer: The generators of ℤ₆ are 1 and 5, matching φ(6) = 2.
Practice Problems
Show that every subgroup of (ℤ, +) has the form nℤ for some non-negative integer n.
Summary
- A cyclic group ⟨g⟩ consists of all integer powers of a single generator g.
- Every cyclic group is abelian, and every subgroup of a cyclic group is itself cyclic.
- Finite cyclic groups of order n are all isomorphic to (ℤₙ, +); infinite ones to (ℤ, +).
- ℤₙ has exactly φ(n) generators, precisely the residues coprime to n.
References
- WebsiteWikipedia — Cyclic group
Mathematics