Mathwords logoMathwords

Cyclic Group — Definition, Formula & Examples

A cyclic group is a group where every element can be produced by repeatedly applying the group operation to one particular element, called a generator. For example, the integers modulo nn under addition form a cyclic group generated by 11.

A group GG is cyclic if there exists an element g∈Gg \in G such that every element of GG can be written as gkg^k for some integer kk. We write G=⟨g⟩G = \langle g \rangle, and gg is called a generator of GG. A cyclic group is either isomorphic to (Z,+)(\mathbb{Z}, +) if it is infinite, or to (Z/nZ,+)(\mathbb{Z}/n\mathbb{Z}, +) if it has finite order nn.

Key Formula

G=⟨g⟩={gk∣k∈Z}G = \langle g \rangle = \{ g^k \mid k \in \mathbb{Z} \}
Where:
  • GG = The cyclic group
  • gg = A generator of the group
  • kk = An integer exponent (or number of times the operation is applied)

How It Works

To check whether a group is cyclic, you look for a single element whose powers (or repeated applications of the group operation) produce every element in the group. In a finite group of order nn, the element gg is a generator if and only if ord(g)=n\text{ord}(g) = n. Every cyclic group is abelian, meaning the group operation commutes: ga⋅gb=gb⋅gag^a \cdot g^b = g^b \cdot g^a for all integers a,ba, b. By Lagrange's theorem, the order of any subgroup of a cyclic group divides the order of the group. In fact, for each divisor dd of nn, a cyclic group of order nn has exactly one subgroup of order dd, and that subgroup is itself cyclic.

Worked Example

Problem: List all elements and find all generators of the cyclic group Z/6Z\mathbb{Z}/6\mathbb{Z} (integers modulo 6 under addition).
Step 1: The elements are the residues modulo 6.
Z/6Z={0,1,2,3,4,5}\mathbb{Z}/6\mathbb{Z} = \{0, 1, 2, 3, 4, 5\}
Step 2: An element aa is a generator if and only if gcd⁡(a,6)=1\gcd(a, 6) = 1. Compute the gcd for each nonzero element.
gcd⁡(1,6)=1,  gcd⁡(2,6)=2,  gcd⁡(3,6)=3,  gcd⁡(4,6)=2,  gcd⁡(5,6)=1\gcd(1,6)=1,\; \gcd(2,6)=2,\; \gcd(3,6)=3,\; \gcd(4,6)=2,\; \gcd(5,6)=1
Step 3: The generators are the elements with gcd equal to 1. Verify for g=5g=5: the multiples of 5 mod 6 are 5,4,3,2,1,05, 4, 3, 2, 1, 0, which is all of Z/6Z\mathbb{Z}/6\mathbb{Z}.
⟨5⟩={5,10≡4,15≡3,20≡2,25≡1,30≡0}\langle 5 \rangle = \{5, 10\equiv 4, 15\equiv 3, 20\equiv 2, 25\equiv 1, 30\equiv 0\}
Answer: The generators of Z/6Z\mathbb{Z}/6\mathbb{Z} are 11 and 55. There are ϕ(6)=2\phi(6) = 2 generators, where ϕ\phi is Euler's totient function.

Why It Matters

Cyclic groups are the building blocks of all finitely generated abelian groups via the Fundamental Theorem of Finitely Generated Abelian Groups. They appear directly in number theory (modular arithmetic), cryptography (Diffie-Hellman key exchange relies on cyclic subgroups), and signal processing (the discrete Fourier transform uses roots of unity, which form cyclic groups).

Common Mistakes

Mistake: Assuming every abelian group is cyclic.
Correction: While every cyclic group is abelian, the converse is false. For example, the Klein four-group Z/2Z×Z/2Z\mathbb{Z}/2\mathbb{Z} \times \mathbb{Z}/2\mathbb{Z} is abelian but not cyclic, since no single element has order 4.