Mathologer

Parity of permutations, impossible puzzles and the magical determinant

This video explores the concept of permutation parity, a fundamental idea in mathematics with applications in puzzles like the 15 puzzle and the Rubik's Cube, as well as in the explicit formula for the determinant in linear algebra. A permutation involves shuffling a set of items, such as numbered tiles. The parity of a permutation is either odd or even, determined by the number of "inversions." An inversion occurs when a pair of tiles is in descending order. For example, if tile 7 is followed by tile 5, that's an inversion. These inversions can be visualized as crossings in a permutation diagram, where arrows connect initial positions to final tile positions. If arrows cross, it indicates an inversion. The identity permutation, where tiles are in their original order, has zero inversions and is thus an even permutation.