Understanding Permutations and the Symmetric Group S3

Introduction

Have you ever rearranged the letters in a word, shuffled a deck of cards, or mixed up your schedule? If so, you’ve worked with permutations — rearrangements of a set of objects. In this post, we'll explore permutations in a mathematical way using functions, and learn how to combine them using composition. Then, we’ll look at the symmetric group S3S_3 — the set of all possible ways to rearrange 3 things — and build its Cayley table, which shows how these rearrangements interact.

No worries if you’ve never heard of abstract algebra — we’ll break it all down!

📦 What Is a Permutation?

A permutation is a way of rearranging a set of objects. Suppose we have the set {1,2,3}\{1, 2, 3\}. One permutation might send:

  • 1 to 2,
  • 2 to 3,
  • 3 to 1.

We write that as:

(123231)\left(\begin{matrix} 1 & 2 & 3 \\ 2 & 3 & 1 \end{matrix}\right)

This is just a fancy way to show where each number goes — a kind of function that scrambles the set.

🔁 Composing Functions

Function composition means applying one function, then another. For example, if:

  • Function ff sends 1 to 2,
  • and function gg sends 2 to 3,

then the composition g∘fg \circ f sends 1 to 3 (because 1 goes to 2 via ff, then 2 goes to 3 via gg).

We'll use this idea to combine permutations.

🔢 The Elements of S3S_3

The group S3S_3 has all the permutations of 3 elements. There are 6 in total:

Label Two-Line Notation Cycle Notation
σ1\sigma_1 (123123)\left(\begin{smallmatrix}1 & 2 & 3\\ 1 & 2 & 3\end{smallmatrix}\right) identity
σ2\sigma_2 (123213)\left(\begin{smallmatrix}1 & 2 & 3\\ 2 & 1 & 3\end{smallmatrix}\right) (12)
σ3\sigma_3 (123321)\left(\begin{smallmatrix}1 & 2 & 3\\ 3 & 2 & 1\end{smallmatrix}\right) (13)
σ4\sigma_4 (123132)\left(\begin{smallmatrix}1 & 2 & 3\\ 1 & 3 & 2\end{smallmatrix}\right) (23)
σ5\sigma_5 (123231)\left(\begin{smallmatrix}1 & 2 & 3\\ 2 & 3 & 1\end{smallmatrix}\right) (123)
σ6\sigma_6 (123312)\left(\begin{smallmatrix}1 & 2 & 3\\ 3 & 1 & 2\end{smallmatrix}\right) (132)

Each one is a unique way to reorder the numbers 1, 2, and 3.

🧠 How to Compose Two Permutations

Let’s say we want to compute σ4∘σ6\sigma_4 \circ \sigma_6. This means: first apply σ6\sigma_6, then apply σ4\sigma_4 to the result.

Here are the steps:

  • σ6(1)=3\sigma_6(1) = 3, then σ4(3)=2\sigma_4(3) = 2, so σ4∘σ6(1)=2\sigma_4 \circ \sigma_6(1) = 2
  • σ6(2)=1\sigma_6(2) = 1, then σ4(1)=1\sigma_4(1) = 1, so σ4∘σ6(2)=1\sigma_4 \circ \sigma_6(2) = 1
  • σ6(3)=2\sigma_6(3) = 2, then σ4(2)=3\sigma_4(2) = 3, so σ4∘σ6(3)=3\sigma_4 \circ \sigma_6(3) = 3

Putting it together:

σ4∘σ6=(123213)=σ2\sigma_4 \circ \sigma_6 = \left(\begin{matrix} 1 & 2 & 3 \\ 2 & 1 & 3 \end{matrix}\right) = \sigma_2

Nice!

🧮 Full Cayley Table of S3S_3

This table shows the result of composing any two permutations from S3S_3. Rows are the first function, columns are the second. You apply the one from the row, then the one from the column.

∘\circ σ1\sigma_1 σ2\sigma_2 σ3\sigma_3 σ4\sigma_4 σ5\sigma_5 σ6\sigma_6
σ1\sigma_1 σ1\sigma_1 σ2\sigma_2 σ3\sigma_3 σ4\sigma_4 σ5\sigma_5 σ6\sigma_6
σ2\sigma_2 σ2\sigma_2 σ1\sigma_1 σ6\sigma_6 σ5\sigma_5 σ4\sigma_4 σ3\sigma_3
σ3\sigma_3 σ3\sigma_3 σ5\sigma_5 σ1\sigma_1 σ6\sigma_6 σ2\sigma_2 σ4\sigma_4
σ4\sigma_4 σ4\sigma_4 σ6\sigma_6 σ5\sigma_5 σ1\sigma_1 σ3\sigma_3 σ2\sigma_2
σ5\sigma_5 σ5\sigma_5 σ3\sigma_3 σ2\sigma_2 σ4\sigma_4 σ6\sigma_6 σ1\sigma_1
σ6\sigma_6 σ6\sigma_6 σ4\sigma_4 σ3\sigma_3 σ2\sigma_2 σ1\sigma_1 σ5\sigma_5

This shows every combination — all 36 possible compositions.

🔄 Comparing Notation

Let’s compare one element in both notations:

σ5=(123231)=(123)\sigma_5 = \left(\begin{matrix} 1 & 2 & 3 \\ 2 & 3 & 1 \end{matrix}\right) = (123)

This tells us:

  • 1 → 2
  • 2 → 3
  • 3 → 1

Cycle notation shows the movement in one loop: 1 to 2 to 3 to 1. It's shorter and more intuitive once you get used to it.

🎉 Conclusion

You just learned:

  • What permutations are
  • How to write and compose them
  • The structure of the symmetric group S3S_3
  • How to compute every element of its Cayley table
  • How to compare full notation and cycle notation

This is a first peek into group theory, a branch of abstract algebra with deep applications in math, science, and even art and cryptography.

💬 Want to Try It?

Try computing some entries from the table yourself. For example:

  • What is σ5∘σ3\sigma_5 \circ \sigma_3?
  • Can you find an element that, when composed with σ4\sigma_4, gives the identity?

Drop your answers or questions in the comments!

Comments

Post a Comment

Popular posts from this blog

What is Mathematical Fluency?

What does it really mean for students to be mathematically fluent? If you’ve been in any math PD over the past few years, you’ve likely heard the phrase everywhere. We talk about fluency as something students should develop, strengthen, and demonstrate, but it can still feel abstract when we try to describe it in observable, classroom-ready terms. This post breaks down mathematical fluency into the two simplest frames we can use as teachers: what it looks like and what it sounds like . These descriptions can guide instruction, assessment, student goal-setting, and even walkthrough conversations with colleagues or administrators. What Mathematical Fluency Looks Like In a classroom where students are developing mathematical fluency, you see students making choices about strategies rather than following steps robotically. They use representations—number lines, diagrams, tables, graphs, manipulatives, symbolic expressions—and switch between them to make sense of a problem. They move ...
Read more

Unlocking the Group: Cosets, Cayley’s Theorem, and Lagrange’s Theorem

Mathematics is full of elegant ideas that take simple definitions and build deep, powerful structures. In group theory, three such concepts—cosets, Cayley's Theorem, and Lagrange’s Theorem—form a foundational trio that unveils the internal symmetry of algebraic systems. Let’s explore what they mean and why they matter. What’s a Coset, Really? Imagine you have a group and a smaller subgroup inside it. Now, pick any element from the big group and use it to shift every element in the subgroup by multiplying on the left. The resulting set is called a left coset . You can also do this multiplication on the right, forming a right coset . These cosets aren’t usually groups themselves—but they do break the original group into equal-sized, non-overlapping pieces. Intuitively , cosets act like “shifts” of the subgroup across the whole group. Think of tiling a floor: each tile is a copy of the same shape (the subgroup) placed in different locations (cosets). Lagrange’s Theorem: Size Matt...
Read more

Verifying the Binomial Formula with Mathematical Induction

The binomial formula states: ( z 1 + z 2 ) n = ∑ k = 0 n ( n k ) z 1 n − k z 2 k (z_1 + z_2)^n = \sum_{k=0}^n \binom{n}{k} z_1^{n-k} z_2^k where ( n k ) = n ! k ! ( n − k ) ! \binom{n}{k} = \frac{n!}{k!(n-k)!} and n = 1 , 2 , … n = 1, 2, \ldots . This is a powerful formula in algebra, expressing the expansion of ( z 1 + z 2 ) n (z_1 + z_2)^n as a sum of terms involving powers of z 1 z_1 and z 2 z_2 . We’ll verify this formula using mathematical induction . Mathematical induction is a logical method to prove that a statement holds for all positive integers n n . The process involves two steps: Base Case : Verify the formula for the smallest value of n n , typically n = 1 n = 1 . Inductive Step : Assume the formula holds for some n = k n = k , and then prove it holds for n = k + 1 n = k+1 . Step 1: Base Case ( n = 1 n = 1 ) For n = 1 n = 1 , the formula becomes: ( z 1 + z 2 ) 1 = ∑ k = 0 1 ( 1 k ) z 1 1 − k z 2 k (z_1 + z_2)^1 = \sum_{k=0}^1 \binom{1}{k} z_1^{1-k} z_2^k L...
Read more