MathLabs

Worked solution: Abel–Ruffini theorem and the Galois solvability criterion (1824)

Step 6 of 8: The general quintic's Galois group is the full symmetric group S5S_5
In plain words

The word "general" is doing serious work here: treating the coefficients a0,…,a4a_0,\dots,a_4 as free, unconstrained symbols (not specific numbers) means the five roots have no special relationship to each other at all — nothing distinguishes any root from any other, so any way of permuting the five roots is an equally valid symmetry. That maximal freedom is exactly what the group S5S_5, the group of all 120120 permutations of five objects, captures.

f(x)=x5+a4x4+a3x3+a2x2+a1x+a0,a0,…,a4 independent indeterminates  ⟹  Gal(f/Q(a0,…,a4))≅S5f(x) = x^5 + a_4x^4 + a_3x^3 + a_2x^2 + a_1x + a_0, \quad a_0,\dots,a_4 \text{ independent indeterminates} \;\Longrightarrow\; \mathrm{Gal}(f/\mathbb{Q}(a_0,\ldots,a_4)) \cong S_5
Detailed analysis

The "general" (or generic) quintic treats a0,…,a4a_0,\ldots,a_4 not as specific numbers but as independent indeterminates over Q\mathbb{Q}; equivalently, one may start from five independent indeterminates x1,…,x5x_1,\ldots,x_5 meant to be the roots and let the aia_i be (up to sign) the elementary symmetric functions of the xix_i, so F=Q(a0,…,a4)F=\mathbb{Q}(a_0,\ldots,a_4) sits inside Q(x1,…,x5)\mathbb{Q}(x_1,\ldots,x_5). Because every permutation of x1,…,x5x_1,\ldots,x_5 fixes each elementary symmetric function (hence fixes FF), and a classical theorem of Lagrange shows these are exactly all the automorphisms fixing FF, the Galois group of the splitting field Q(x1,…,x5)\mathbb{Q}(x_1,\ldots,x_5) over FF is the full symmetric group S5S_5 on the five roots — not some smaller subgroup, as can happen for special numerical quintics.

Terms in this step
Elementary symmetric functions
The building-block expressions in the roots x1,…,xnx_1,\ldots,x_n, such as x1+⋯+xnx_1+\cdots+x_n and x1x2⋯xnx_1x_2\cdots x_n, that stay the same under any permutation of the roots and that equal (up to sign) the coefficients of the polynomial.
Splitting field
The smallest field containing the base field and every root of a given polynomial.
Knowledge used in this step