Cyclic Groups: Explained with Examples, Notes and FAQs

A cyclic group is a group generated by a single element: G = ⟨a⟩ = {…, a⁻², a⁻¹, e, a, a², …}, every element a power of a. The integers (ℤ, +) = ⟨1⟩ are the infinite prototype; the rotations of a regular n-gon form the finite cyclic group Cₙ of order n.

Cyclic groups matter because they are completely classified — every cyclic group is ℤ or ℤₙ — and they power number theory and cryptography. The Diffie–Hellman key exchange runs on a cyclic group, and roots of unity (cyclic!) drive the discrete Fourier transform.

Key Concepts

• Generator: an element a with ⟨a⟩ = G; a cyclic group may have many generators.
• Order of an element: the smallest positive k with aᵏ = e; the order of a equals |⟨a⟩|.
• Classification: every infinite cyclic group is isomorphic to ℤ; every finite cyclic group of order n is isomorphic to ℤₙ.
• Subgroups: every subgroup of a cyclic group is cyclic; ℤₙ has exactly one subgroup per divisor d of n.
• Euler's totient: φ(n) counts integers 1 ≤ k ≤ n coprime to n — and counts the generators of ℤₙ.

Formulas

• Order test: |⟨a⟩| = n ⟺ aⁿ = e and aᵏ ≠ e for all 0 < k < n.
• Generators of ℤₙ: ⟨k⟩ = ℤₙ ⟺ gcd(k, n) = 1; there are φ(n) generators.
• Subgroup lattice: the subgroups of ℤₙ are ⟨d⟩ for each divisor d of n, with |⟨d⟩| = n/d.
• Order of k in ℤₙ: |⟨k⟩| = n / gcd(n, k).

Worked Example

In ℤ₁₀, determine whether 3 is a generator, find its order, and describe the subgroup generated by 4.

1. Element 3: gcd(3, 10) = 1, so 3 should generate all of ℤ₁₀. Multiples: 3, 6, 9, 12≡2, 5, 8, 11≡1, 4, 7, 30≡0 — all ten residues appear ✓.
2. Order of 3: the list reaches 0 after 10 steps, so |⟨3⟩| = 10 = 10/gcd(10,3) ✓.
3. Element 4: gcd(4, 10) = 2, so ⟨4⟩ has order 10/2 = 5: multiples are 4, 8, 12≡2, 6, 20≡0, giving ⟨4⟩ = {0, 2, 4, 6, 8}.
4. Check closure: 8+8 = 16 ≡ 6 ∈ ⟨4⟩ ✓; it is the unique subgroup of order 5 in ℤ₁₀.
5. Generator count: φ(10) = 4, and indeed the generators are {1, 3, 7, 9} — the residues coprime to 10.

Common Misconceptions

• "A cyclic group has only one generator." ℤ₁₀ has four generators (1, 3, 7, 9); ⟨a⟩ = ⟨a⁻¹⟩ always, and more generally ⟨aᵏ⟩ = ⟨a⟩ when gcd(k, n) = 1.
• "Every group of order n is cyclic." False — S₃ has order 6 but is not cyclic (no element of order 6); only prime-order groups are forced to be cyclic.
• "Subgroups of cyclic groups might not be cyclic." They always are: this is a theorem, and ℤₙ's subgroup-per-divisor structure shows it concretely.

Real-World Applications

• Cryptography: Diffie–Hellman and ElGamal encrypt using cyclic subgroups of (ℤ/pℤ)*.
• Signal processing: the nth roots of unity form a cyclic group; the DFT is Fourier analysis on it.
• Clock arithmetic: hours mod 12 form ℤ₁₂; scheduling and calendar computations are cyclic-group arithmetic.

Cyclic groups are the one-generator groups, fully classified as ℤ or ℤₙ, with generators counted by φ(n) and subgroups indexed by divisors. The ℤ₁₀ computation shows the whole theory in action: gcd tests pick out generators, n/gcd(n,k) gives element orders, and every subgroup is cyclic.