Cyclic Groups

Definition

A group $G$ is called a cyclic group if there exists an element $a \in G$ such that every element of $G$ can be written as a power of $a$ (in multiplicative notation) or as a multiple of $a$ (in additive notation).

• If the group operation is written multiplicatively, then $$G = \{a^n \mid n \in \mathbb{Z}\}$$ for some element $a \in G$. In this case, $a$ is called a generator of the group.

• If the group operation is written additively, then $$G = \{na \mid n \in \mathbb{Z}\}$$ for some element $a \in G$.

A cyclic group may be:

Infinite cyclic

• , such as $(\mathbb{Z}, +)$

Finite cyclic

• , such as $(\mathbb{Z}_n, +)$

---

Main Content

1. Generator and Generation of a Cyclic Group

• A generator is an element from which every element of the group can be obtained by repeated application of the group operation.
• If $G = \langle a \rangle$, then $G$ is generated by $a$, and $a$ is called a generator of $G$.

In multiplicative notation, the generated set is: $$\langle a \rangle = \{ \dots, a^{-2}, a^{-1}, e, a, a^2, a^3, \dots \}$$ where $e$ is the identity element.

In additive notation: $$\langle a \rangle = \{ \dots, -2a, -a, 0, a, 2a, 3a, \dots \}$$

Example:

• The group $(\mathbb{Z}, +)$ is cyclic because every integer can be written as $n \cdot 1$ or $n \cdot (-1)$.
• Hence, $1$ and $-1$ are generators of $\mathbb{Z}$.

Important observations:

• A cyclic group can have more than one generator.
• In a finite cyclic group of order $n$, the generators are exactly the elements relatively prime to $n$.

---

2. Finite and Infinite Cyclic Groups

• A finite cyclic group has a limited number of elements. If $G = \langle a \rangle$ and $|G| = n$, then $$G = \{e, a, a^2, \dots, a^{n-1}\}$$ with $a^n = e$.

• An infinite cyclic group has infinitely many elements and is generated by one element whose repeated powers never repeat.

Examples:

• Finite cyclic group:
• $(\mathbb{Z}_6, +)$ = $\{0,1,2,3,4,5\}$
• Generated by $1$, $5$, etc.
• Infinite cyclic group:
• $(\mathbb{Z}, +)$
• Generated by $1$ or $-1$

Key properties:

• Every finite cyclic group of order $n$ is isomorphic to $\mathbb{Z}_n$.
• Every infinite cyclic group is isomorphic to $\mathbb{Z}$.
• Cyclic groups are always abelian, meaning the group operation is commutative.

A simple visual idea for $\mathbb{Z}_6$:

0 → 1 → 2 → 3 → 4 → 5 → back to 0

This shows how repeated addition of 1 cycles through all elements.

---

3. Orders of Elements and Subgroups of Cyclic Groups

• The order of an element $a$ is the smallest positive integer $m$ such that $a^m = e$. If no such integer exists, the order is infinite.
• In a cyclic group, the order of the generator is equal to the order of the group if the group is finite.

Subgroups of cyclic groups are especially important:

• Every subgroup of a cyclic group is also cyclic.
• If $G = \langle a \rangle$ is a cyclic group of order $n$, then for every divisor $d$ of $n$, there is exactly one subgroup of order $d$.

Example:

• In $\mathbb{Z}_{12}$, subgroups correspond to divisors of 12:
• order 1: $\{0\}$
• order 2: $\{0,6\}$
• order 3: $\{0,4,8\}$
• order 4: $\{0,3,6,9\}$
• order 6: $\{0,2,4,6,8,10\}$
• order 12: $\mathbb{Z}_{12}$

This property makes cyclic groups highly structured and easy to classify.

A useful table for $\mathbb{Z}_{8}$:

Element	Order
0	1
1	8
2	4
3	8
4	2
5	8
6	4
7	8

This shows that not all elements are generators, only those with order 8.

---

Working / Process

1. Identify the group and operation

• Determine whether the group is written additively or multiplicatively.
• Check the identity element and the operation rules.

2. Test whether a single element generates the entire group

• Compute repeated powers or multiples of the element.
• If all group elements appear, the group is cyclic.
• If one element fails, try other elements.

3. Find generators, order, and subgroups

• For finite groups, identify elements whose order equals the size of the group.
• Use divisors of the group order to list all subgroups.
• Verify results using the closure and identity conditions.

Example process for $\mathbb{Z}_{6}$ under addition:

• Start with $1$: $$0,1,2,3,4,5$$ This produces all elements, so $\mathbb{Z}_6$ is cyclic.

• Start with $2$: $$0,2,4,0,2,4,\dots$$ Only three elements appear, so $2$ is not a generator.

---

Advantages / Applications

• Cyclic groups are easy to understand and classify, making them a foundational topic in group theory.
• They are used in modular arithmetic, which is important in solving congruences and understanding residue classes.
• They play a major role in cryptography, coding theory, and symmetry analysis because many practical systems rely on cyclic structures.

Examples of applications:

Clock arithmetic

• : The numbers on a clock form a cyclic group under addition modulo 12.

Cryptography

• : Many encryption methods use cyclic groups and their generators.

Symmetry

• : Rotations of a regular polygon often form a cyclic group.

ASCII representation of a clock cycle:

12
|
11   1
10   2
9    3
8    4
7    5
6

This helps visualize how adding 1 repeatedly moves around the clock and returns to the starting point.

---

Summary

Cyclic groups are groups generated by a single element, making them among the most structured and easy-to-study algebraic systems. They may be finite or infinite, and their elements, generators, and subgroups follow very neat rules. Because of their simplicity and wide use in mathematics and applications, cyclic groups are a central topic in algebra.