The S₅ Quintic Wall & Solvability Explainer

🧩 Polynomial Roots as Swap Targets

Every polynomial equation of degree $n$ has $n$ roots ($r_1, r_2, \dots, r_n$) in the complex plane. The Symmetric Group $S_n$ consists of all possible ways to shuffle (permute) these roots.

Vieta's Formulas (Coefficient Invariance):

$P(x) = (x - r_1)(x - r_2)\dots(x - r_n) = x^n - (r_1 + \dots + r_n)x^{n-1} + \dots$

Shuffling roots changes the order of solutions, but leaves the equation's coefficients completely unchanged!

Select Polynomial Degree ($n$):

Permutation Actions:

Group Size |S_n| = n! 6 elements

S₃ has 3! = 6 permutations: 3 reflections (swaps) and 3 rotations.

Complex Plane Root Permutation Sandbox

Roots of Unity: xⁿ - 1 = 0

Current Root Order & Cycle:

[ r₁, r₂, r₃ ] e (identity)

🔄 What is an "Abelian Chunk"? (Commutativity vs Scrambling)

An Abelian group is a group where operations are commutative: performing Action A then Action B produces the exact same result as performing Action B then Action A ($A \circ B = B \circ A$).

1. Clock Turns (Abelian / Commutative)

A ∘ B = B ∘ A

Turning a clock hand by +3 hours then +5 hours yields +8 hours (or 8 o'clock). Doing +5 hours then +3 hours gives the exact same 8 o'clock!

A then B +3h → +5h = +8h

B then A +5h → +3h = +8h

Radical signs ($\sqrt[n]{\cdot}$) strictly generate abelian cyclic groups ($\mathbb{Z}_n$). They are "clock turn" operations!

2. Root Swaps (Non-Abelian / Order Matters)

A ∘ B ≠ B ∘ A

Try swapping roots! Action A: Swap (r₁, r₂). Action B: Swap (r₂, r₃). Watch how doing A then B produces a completely different root arrangement than B then A!

When group elements tangle, we need to test their commutator $[A, B] = A B A^{-1} B^{-1}$.

Interactive Commutator Calculator: [A, B] = A · B · A⁻¹ · B⁻¹

Ready

Order 1 (Perform Action A then B): [1, 2, 3, 4, 5]

Order 2 (Perform Action B then A): [1, 2, 3, 4, 5]

Click the button above to execute swap actions A = (1 2) and B = (2 3) on the list [1, 2, 3, 4, 5] and observe the non-commutative difference!

🏰 The Solvable Factorization Tower ($S_2 \to S_5$)

Galois proved that a polynomial equation can be solved by radicals if and only if its symmetry group can be sliced down to $\{1\}$ using only Abelian factor groups ($\mathbb{Z}_p$).

Why A₅ is an Unbreakable Brick Wall:

$A_5$ has size 60 and is a SIMPLE GROUP (it contains no non-trivial normal subgroups). Furthermore, $A_5$ is non-abelian. Therefore, you cannot slice $A_5$ any further into abelian chunks!

🛗 The Commutator Engine Elevator ($[G, G]$ Derived Series)

The derived series $G^{(0)} = G, G^{(1)} = [G, G], G^{(2)} = [[G,G],[G,G]], \dots$ strips away all commutative parts like peeling an onion. If it reaches $\{1\}$, the group is SOLVABLE. If it gets trapped, it is UNSOLVABLE!

Derived Series Elevator Shaft Select Group

Floor 0: G = S_n Initial Group

Floor 1: [G, G] = A_n 1st Commutator

Floor 2: [[G,G],[G,G]] 2nd Commutator

Ground Floor: {e} Identity Element

Elevator Telemetry Log

Click a button above to run the derived series elevator test...

Algebraic Theorem: Every element in $A_5$ is a commutator of elements in $A_5$. Thus $[A_5, A_5] = A_5$. The elevator gets trapped on $A_5$ forever!

⚽ Geometric Intuition: $A_5$ as the 3D Regular Icosahedron

Why is $A_5$ (size 60) so unbreakable? Mathematically, $A_5$ is isomorphic to the rotational symmetry group of a regular 3D Icosahedron (a 20-faced polyhedron). Symmetries in 3D space interact tightly across all axes, preventing any slice into independent 1D clock turns!

Drag canvas to rotate manually

The 60 Rotational Symmetries of $A_5$

• 1 Identity: 0° rotation (1 orientation).
• 12 Vertices (6 axes): 5-fold rotations (72°, 144°, 216°, 288°) → 24 symmetries.
• 20 Faces (10 axes): 3-fold rotations (120°, 240°) → 20 symmetries.
• 30 Edges (15 axes): 2-fold rotations (180°) → 15 symmetries.
Total: 1 + 24 + 20 + 15 = 60 total 3D orientations ($|A_5| = 60$).

Indivisible Geometric Atom:

Any rotation around a face can be combined with an edge rotation to create a vertex rotation. They are completely locked into 3D geometry! No sub-plane stays isolated.

🔑 The Galois Gate: Radical Keys vs Symmetry Locks

Why does group solvability dictate whether a polynomial formula exists? Taking an $n$-th root ($\sqrt[n]{a}$) is algebraically equivalent to creating a Cyclic Extension Field ($\mathbb{Z}_n$). Radical signs are "Abelian Keys".

Polynomial Lock Selector

Select Equation Degree:

The Great Galois Correspondence

Évariste Galois established an exact bridge between polynomial equations and group theory:

Field Extension (Algebra) Radical Extraction ($\sqrt[n]{\cdot}$)

Galois Group (Symmetry) Cyclic Factor ($\mathbb{Z}_n$, Abelian)

Because radical operations strictly produce abelian quotient steps, they can only dissolve symmetry groups that break into abelian chunks. Because general 5th degree equations have Galois group $S_5$, hitting the non-abelian simple subgroup $A_5$ blocks radical key extraction forever!

Abel-Ruffini Theorem (1824) Proven via S₅ unsolvability