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 S 3 S_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: ( 1 2 3 2 3 1 ) \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. ...