The Art of Rearrangement

Abstract Algebra · Axiom Academy

INTRO The Art of Rearrangement Discover the mathematics of permutations through card shuffling. Every rearrangement tells a story! We'll work with 5 cards. Each card has a position (shown at the top). Try different shuffles and watch how the cards rearrange! Every shuffle, no matter how complex, can be broken down into simple swaps (exchanging two cards). Can you recreate the "Rotate Right" shuffle using only swaps? What happens when you do one shuffle, then another? This is called composition — combining permutations! Every shuffle has an inverse — another shuffle that undoes it, returning cards to their original positions! Rearrangements of objects. The set of all permutations of n objects forms the symmetric group S_n, with n! elements. Applying one permutation after another forms a group operation. Order matters: σ ∘ τ ≠ τ ∘ σ in general. Every permutation has a unique inverse that "undoes" it. This guarantees every element has an inverse in the group. Simple swaps are the building blocks. Any permutation decomposes into transpositions. Parity (even/odd) is invariant. Permutations can be written in cycle notation: (1 5 4) means 1→5, 5→4, 4→1. Disjoint cycles commute! Cryptography (DES algorithm), Rubik's cube solving, sorting algorithms, and symmetry analysis in chemistry and physics.

This is the written version of the interactive lesson above. See the full Abstract Algebra course.