Cycle Notation in Permutation Groups

Permutation groups show up whenever we study rearrangements. students, imagine $5$ students lining up for a photo 📸. If they switch places, the order changes, but the group of all possible rearrangements still follows exact algebra rules. In this lesson, you will learn how cycle notation gives a compact and powerful way to describe those rearrangements.

What cycle notation does and why it matters

A permutation is a rearrangement of a set. In many Abstract Algebra problems, we work with the symmetric group $S_n$, the group of all permutations of the set $\{1,2,\dots,n\}$. Since writing every input-output pair can get long, mathematicians use cycle notation to show how a permutation moves elements.

The main idea is simple: start with one number, follow where it goes, then follow the next image, and keep going until the pattern returns to the starting point. That closed loop is called a cycle. For example, the cycle

(1\ 3\ 5)

means $1 \mapsto 3$, $3 \mapsto 5$, and $5 \mapsto 1$.

This notation matters because it makes permutations easier to read, combine, and analyze. Instead of a long table, you can see the structure immediately. That structure is important in permutation groups because group operations are about composing permutations, finding inverses, and understanding how elements behave. Cycle notation is one of the most important tools for doing that efficiently 🔁.

Reading cycle notation correctly

A cycle is written by listing the elements in the order they move. If a permutation sends $1$ to $4$, $4$ to $2$, and $2$ back to $1$, we write

(1\ 4\ 2)

This means:

$1 \mapsto 4$,\quad 4 $\mapsto 2$,\quad 2 $\mapsto 1$.

Any elements not written in the cycle are unchanged. For example, in $S_5$, the cycle $(1\ 4\ 2)$ leaves $3$ and $5$ fixed:

$3 \mapsto 3,\quad 5 \mapsto 5.$

That is why cycle notation is compact. It only shows the moved elements.

A $k$-cycle is a cycle involving exactly $k$ elements. A $2$-cycle is also called a transposition. For instance, $(2\ 5)$ swaps $2$ and $5$ and leaves everything else fixed. Transpositions are especially important because every permutation can be written as a product of transpositions.

Here is a real-world style example. Suppose students is organizing seats for a group project. If the student in seat $1$ moves to seat $3$, the student in seat $3$ moves to seat $5$, and the student in seat $5$ moves to seat $1$, then the seating change is the cycle $(1\ 3\ 5)$. It captures the whole rotation in one line.

How to build a cycle from a permutation

Suppose a permutation is given in a mapping form. To write it in cycle notation, start with the smallest number not yet used, follow its image, and keep going until you return to the start. Then choose the next unused number and repeat.

Example: let $\sigma$ be the permutation in $S_6$ defined by

$1 \mapsto 4$,\quad 4 $\mapsto 1$,\quad 2 $\mapsto 6$,\quad 6 $\mapsto 3$,\quad 3 $\mapsto 2$,\quad 5 $\mapsto 5$.

Start with $1$:

$1 \mapsto 4,\quad 4 \mapsto 1,$

so one cycle is $(1\ 4)$.

Next unused number is $2$:

$2 \mapsto 6$,\quad 6 $\mapsto 3$,\quad 3 $\mapsto 2$,

so another cycle is $(2\ 6\ 3)$.

The element $5$ is fixed, so it is usually omitted. Therefore,

$\sigma = (1\ 4)(2\ 6\ 3).$

This example shows an important fact: disjoint cycles can be written next to each other to represent the same permutation. The cycles $(1\ 4)$ and $(2\ 6\ 3)$ are disjoint because they do not share any elements.

Disjoint cycles and why they are useful

Two cycles are disjoint if they move different elements. Disjoint cycles are useful because they commute:

$\alpha\beta = \beta\alpha$

when $\alpha$ and $\beta$ are disjoint cycles. This is not true for arbitrary permutations, so disjoint cycle notation gives a special advantage.

Example in $S_5$:

(1\ 2\ 3)(4\ 5)

means the permutation sends $1 \mapsto 2$, $2 \mapsto 3$, $3 \mapsto 1$, and swaps $4$ and $5$.

Because the cycles are disjoint, you can apply them in either order and get the same result. That makes calculations much simpler.

Cycle notation also helps reveal the order of a permutation. The order of a cycle of length $k$ is $k$, because applying it $k$ times brings every moved element back to where it started. For disjoint cycles, the order is the least common multiple of the cycle lengths. For example,

(1\ 2\ 3)(4\ 5)

has order

$\mathrm{lcm}(3,2)=6.$

That means applying the permutation $6$ times returns every element to its original position.

Products of cycles and how to compose them

In permutation groups, writing a permutation as a product of cycles is very common. A product means composition, and the order of application matters. By convention, the rightmost permutation is applied first.

For example, if

$\alpha$ = (1\ 2\ 3) \quad \text{and} \quad $\beta$ = (2\ 4),

then the product

$\alpha\beta$

means apply $\beta$ first, then $\alpha$.

Let’s compute what happens to $2$:

$2 \xrightarrow{\beta} 4 \xrightarrow{\alpha} 4,$

so $2 \mapsto 4$.

Now compute $4$:

$4 \xrightarrow{\beta} 2 \xrightarrow{\alpha} 3,$

so $4 \mapsto 3$.

Now compute $3$:

$3 \xrightarrow{\beta} 3 \xrightarrow{\alpha} 1,$

so $3 \mapsto 1$.

And compute $1$:

$1 \xrightarrow{\beta} 1 \xrightarrow{\alpha} 2,$

so $1 \mapsto 2$.

Therefore,

$\alpha\beta = (1\ 2\ 4\ 3).$

This shows how products of cycles can combine into a single larger cycle.

A common mistake is reversing the order. Remember: in a product like $\alpha\beta$, the permutation $\beta$ acts first. This is one of the most important conventions in permutation groups.

Finding inverses using cycle notation

Every permutation has an inverse. In cycle notation, the inverse of a cycle is found by reversing the direction of the cycle.

For example,

(1\ 3\ 5)^{-1} = (1\ 5\ 3).

Why? Because $(1\ 3\ 5)$ sends $1 \to 3$, $3 \to 5$, and $5 \to 1$, while the inverse must undo those moves:

$1 \mapsto 5$,\quad 5 $\mapsto 3$,\quad 3 $\mapsto 1$.

For disjoint cycles, the inverse of a product is found by taking each inverse and reversing the order of the factors:

$(\alpha\beta)^{-1} = \beta^{-1}\alpha^{-1}.$

If the cycles are disjoint, reversing the order does not change the result because they commute. For example,

$\big($(1\ 2\ 3)(4\ 5)$\big)^{-1}$ = (1\ 3\ 2)(4\ 5).

The transposition $(4\ 5)$ is its own inverse because swapping twice gives the original arrangement.

Why cycle notation is central in permutation groups

Cycle notation connects directly to the structure of $S_n$. It helps us see three important facts:

Every permutation can be written as a product of disjoint cycles.
Each cycle has a clear length and inverse.
The interaction of cycles explains composition, order, and commutativity.

This is why cycle notation is not just a shortcut for writing permutations. It is a language for understanding them. When students studies more advanced topics like parity, alternating groups, and group actions, cycle notation keeps appearing because it gives a clear way to describe the behavior of elements in a permutation group.

In many algebra problems, cycle notation makes proofs shorter too. For example, if two permutations act on separate sets of elements, writing them as disjoint cycles immediately shows they commute. If a permutation is a single cycle, its repeated action becomes easy to predict. These are strong reasons cycle notation is a foundational skill in Abstract Algebra ✅.

Conclusion

Cycle notation is a compact and powerful way to describe permutations. It tells us how elements move, which elements stay fixed, how to compose permutations, and how to find inverses. In the study of permutation groups, especially the symmetric groups $S_n$, it is one of the main tools for understanding structure and behavior. By learning to read and write cycles, students gains a key method for solving algebra problems involving rearrangements, products, inverses, and order.

Study Notes

A permutation is a rearrangement of a set.
The symmetric group $S_n$ is the group of all permutations of $\{1,2,\dots,n\}$.
Cycle notation writes a permutation by tracing where an element goes until it returns to the start.
In $(1\ 3\ 5)$, we have $1 \mapsto 3$, $3 \mapsto 5$, and $5 \mapsto 1$.
Elements not listed in a cycle are fixed.
A $2$-cycle is called a transposition.
Every permutation can be written as a product of disjoint cycles.
Disjoint cycles commute: $\alpha\beta = \beta\alpha$.
The order of a cycle of length $k$ is $k$.
The order of disjoint cycles is the least common multiple of their lengths.
To find a product like $\alpha\beta$, apply $\beta$ first, then $\alpha$.
The inverse of a cycle is found by reversing the direction of the cycle.
Cycle notation is essential for understanding products, inverses, and structure in permutation groups.