Lecture 12: Abel–Ruffini and Solvability by Radicals
Purpose, Context, and Learning Outcomes
This reading is a guided, textbook-style introduction to the Abel–Ruffini theorem and its Galois-theoretic meaning. The main point is not that degree-five equations have no roots. They do have roots over \(\mathbb{C}\). The point is also not that computers cannot approximate those roots. They can. The theorem says something more structural: there is no general formula by radicals for solving every quintic equation.
A radical formula builds roots by a tower of field extensions. Galois theory translates such a tower into a chain of groups whose successive quotients are abelian. Thus:
\boxed{\text{non-solvable Galois group} \Longrightarrow \text{no radical formula}.}
\]
- Distinguish between having roots, approximating roots numerically, and solving by radicals.
- Explain what a radical tower is with examples such as \(\mathbb{Q}\subset \mathbb{Q}(\sqrt{2})\).
- Describe a Galois group as a symmetry group of roots that preserves algebraic relations.
- Explain the meaning of a solvable group using normal chains and abelian quotients.
- Explain why \(S_5\) creates the first obstruction to a general radical formula.
- Use a CAS example to compare a solvable quintic such as \(x^5-2\) with a non-solvable quintic such as \(x^5-x+2\).
- Frame Abel–Ruffini as high-school enrichment: “no formula exists” is a meaningful structural conclusion, not a failure.
- False: “Quintics have no solutions.” Correct: every nonconstant complex polynomial has complex roots.
- False: “No quintic can be solved by radicals.” Correct: some quintics, such as \(x^5-2\), are solvable by radicals.
- False: “A numerical approximation is a radical formula.” Correct: numerical approximation and radical solvability are different mathematical notions.
- False: “The missing formula is merely too long.” Correct: the obstruction is structural; it comes from the Galois group.
Reading Structure and Navigation
The reading moves from the familiar quadratic formula to the structural language of fields and groups. The goal is to make the statement of Abel–Ruffini feel natural rather than mysterious.
Chapter map.
Instructor board plan.
- Board 1: quadratic formula, cubic/quartic history, and the quintic question.
- Board 2: radical towers as field-building machines.
- Board 3: examples of Galois groups: \(C_2\), \(S_3\), \(D_4\).
- Board 4: definition of solvable group; chains for \(S_3\), \(S_4\), and obstruction in \(S_5\).
- Board 5: Abel–Ruffini theorem and CAS comparison.
1. The Formula Question: What Does It Mean to “Solve”?
In secondary algebra, students learn the quadratic formula:
ax^2+bx+c=0,
\qquad
x=\frac{-b\pm\sqrt{b^2-4ac}}{2a}.
\]
This formula is powerful because it solves every quadratic equation, provided \(a\ne 0\). It gives the roots directly from the coefficients using only arithmetic operations and one square root.
Example 1.1: A quadratic solved by radicals.
Consider:
x^2-5x+6=0.
\]
The formula gives:
x=\frac{5\pm\sqrt{25-24}}{2}=\frac{5\pm 1}{2}.
\]
Thus \(x=2\) or \(x=3\). In this case the radical disappears because the discriminant is a perfect square.
Example 1.2: A quadratic that genuinely needs a radical.
Consider:
x^2-2=0.
\]
The roots are:
x=\pm\sqrt{2}.
\]
These roots do not lie in \(\mathbb{Q}\), but they lie in the enlarged field \(\mathbb{Q}(\sqrt{2})\).
The natural historical question was: if degree two has a formula, what about higher degrees?
| Degree | General radical formula? | Comment |
|---|---|---|
| 1 | Yes | Linear equations are solved by one division. |
| 2 | Yes | The quadratic formula uses square roots. |
| 3 | Yes | Cubic formulas use cube roots and sometimes complex intermediate quantities. |
| 4 | Yes | Quartic formulas exist, but they are long and rarely useful pedagogically. |
| 5 | No, not in general | The obstruction is structural: the generic Galois group is \(S_5\), which is not solvable. |
Three different meanings of “solve.”
- Existence: Does the equation have roots? Over \(\mathbb{C}\), yes for every nonconstant polynomial.
- Numerical solution: Can we approximate the roots? Usually yes, very effectively.
- Radical solution: Can we express the roots by a universal formula using arithmetic operations and radicals? For the general quintic, no.
2. What “Solvable by Radicals” Means
A radical formula is built using the coefficients of a polynomial and the operations:
+,\quad -,\quad \times,\quad \div,\quad \sqrt[n]{\phantom{x}}.
\]
The phrase “solvable by radicals” does not mean “solvable by guessing,” “solvable numerically,” or “solvable using a special function.” It means the roots can be obtained by repeatedly performing arithmetic operations and extracting roots.
Definition 2.1: Radical extension.
Let \(F\) be a field. A field extension \(E/F\) is called a radical extension if there is a chain of fields
F=F_0\subset F_1\subset F_2\subset\cdots\subset F_r=E
\]
such that each \(F_{i+1}\) is obtained from \(F_i\) by adjoining an element \(\alpha_i\) whose some positive power lies in \(F_i\):
F_{i+1}=F_i(\alpha_i),
\qquad
\alpha_i^{n_i}\in F_i.
\]
Informally, each step allows one new radical.
Example 2.2: Building \(\sqrt{2}\).
Start with \(\mathbb{Q}\). The equation \(x^2-2=0\) asks for an element \(\alpha\) satisfying \(\alpha^2=2\). We create a larger field:
\mathbb{Q}\subset \mathbb{Q}(\sqrt{2}).
\]
Every element of \(\mathbb{Q}(\sqrt{2})\) has the form
a+b\sqrt{2},\qquad a,b\in\mathbb{Q}.
\]
This is a one-step radical tower.
Example 2.3: A nested radical tower.
The number
\beta=\sqrt{1+\sqrt{2}}
\]
is built in two radical steps:
\mathbb{Q}
\subset
\mathbb{Q}(\sqrt{2})
\subset
\mathbb{Q}(\sqrt{2},\sqrt{1+\sqrt{2}}).
\]
First we adjoin \(\sqrt{2}\). Then, inside that larger field, the number \(1+\sqrt{2}\) is available, so we can adjoin its square root.
Example 2.4: A quintic that is solvable by radicals.
The equation
x^5-2=0
\]
has one real root \(\sqrt[5]{2}\). The five complex roots are
\sqrt[5]{2},\quad
\zeta_5\sqrt[5]{2},\quad
\zeta_5^2\sqrt[5]{2},\quad
\zeta_5^3\sqrt[5]{2},\quad
\zeta_5^4\sqrt[5]{2},
\]
where
\zeta_5=e^{2\pi i/5}
\]
is a primitive fifth root of unity. This example is important because it proves that Abel–Ruffini does not say “quintics are never solvable by radicals.” Some are.
A CAS may return an exact object such as
Root[x^5 - x + 2, k]. That is an exact algebraic description, but it is not automatically a radical formula. The Abel–Ruffini theorem concerns radical formulas, not all possible exact descriptions.
3. Fields and Adjoining Elements: Concrete Pictures
A field is a number system in which addition, subtraction, multiplication, and division by nonzero elements are possible. The rational numbers \(\mathbb{Q}\), real numbers \(\mathbb{R}\), and complex numbers \(\mathbb{C}\) are familiar fields.
Definition 3.1: Field generated by an element.
If \(F\) is a field and \(\alpha\) is a number algebraic over \(F\), then \(F(\alpha)\) is the smallest field containing both \(F\) and \(\alpha\). It is obtained by allowing rational expressions in \(\alpha\) with coefficients in \(F\).
Example 3.2: The field \(\mathbb{Q}(\sqrt{2})\).
Since \((\sqrt{2})^2=2\), powers of \(\sqrt{2}\) simplify:
(\sqrt{2})^0=1,
\qquad
(\sqrt{2})^1=\sqrt{2},
\qquad
(\sqrt{2})^2=2,
\qquad
(\sqrt{2})^3=2\sqrt{2}.
\]
Thus every element of \(\mathbb{Q}(\sqrt{2})\) can be written as:
a+b\sqrt{2},\qquad a,b\in\mathbb{Q}.
\]
For example,
\frac{1}{3+\sqrt{2}}
=\frac{3-\sqrt{2}}{(3+\sqrt{2})(3-\sqrt{2})}
=\frac{3-\sqrt{2}}{7}
=\frac{3}{7}-\frac{1}{7}\sqrt{2}.
\]
Notice that the field is closed under division by nonzero elements.
Example 3.3: A field automorphism of \(\mathbb{Q}(\sqrt{2})\).
Define a map \(\sigma\) by
\sigma(a+b\sqrt{2})=a-b\sqrt{2}.
\]
This map fixes every rational number and sends \(\sqrt{2}\) to \(-\sqrt{2}\). It preserves addition and multiplication. For instance,
\sigma\big((1+\sqrt{2})(3-\sqrt{2})\big)
=\sigma(1+\sqrt{2})\,\sigma(3-\sqrt{2}).
\]
The idea is simple: any expression built from rationals and \(\sqrt{2}\) remains valid if \(\sqrt{2}\) is replaced by \(-\sqrt{2}\). This is the first example of a Galois symmetry.
Example 3.4: Why splitting fields matter.
Let \(\alpha=\sqrt[3]{2}\). The field \(\mathbb{Q}(\alpha)\) contains the real root of \(x^3-2\), but it does not contain all the roots. The full list of roots is:
\alpha,
\qquad
\zeta_3\alpha,
\qquad
\zeta_3^2\alpha,
\]
where \(\zeta_3=e^{2\pi i/3}\). To contain all roots, we need the splitting field:
\mathbb{Q}(\alpha,\zeta_3).
\]
The Galois group is the group of automorphisms of this splitting field that fix \(\mathbb{Q}\).
4. Galois Groups as Symmetries of Roots
If a polynomial has roots \(r_1,r_2,\ldots,r_n\), a Galois automorphism may permute these roots. But it cannot permute them arbitrarily: it must preserve every algebraic relation among them that follows from the base field.
Definition 4.1: Galois group of a polynomial.
Let \(f(x)\in F[x]\), and let \(K\) be the splitting field of \(f\) over \(F\). The Galois group of \(f\) over \(F\) is
\operatorname{Gal}(K/F)=\{\sigma:K\to K\mid \sigma \text{ is a field automorphism and } \sigma(a)=a \text{ for all } a\in F\}.
\]
When the roots are labeled, this group can be viewed as a subgroup of a symmetric group.
Example 4.2: \(x^2-2\).
The roots are \(\sqrt{2}\) and \(-\sqrt{2}\). The splitting field is \(\mathbb{Q}(\sqrt{2})\). There are two automorphisms fixing \(\mathbb{Q}\):
| Automorphism | Action on \(\sqrt{2}\) | Permutation of roots |
|---|---|---|
| identity | \(\sqrt{2}\mapsto \sqrt{2}\) | does nothing |
| conjugation | \(\sqrt{2}\mapsto -\sqrt{2}\) | swaps the two roots |
Thus the Galois group is isomorphic to \(C_2\), the cyclic group of order \(2\).
Example 4.3: \(x^3-2\).
Let \(\alpha=\sqrt[3]{2}\) and \(\zeta=e^{2\pi i/3}\). The roots are:
\alpha,
\qquad
\zeta\alpha,
\qquad
\zeta^2\alpha.
\]
The splitting field is \(\mathbb{Q}(\alpha,\zeta)\). The Galois group has six elements and is isomorphic to \(S_3\). It is useful to think of it as the symmetries of the three roots.
Although \(S_3\) is nonabelian, it is solvable. This is why noncommutativity alone is not the obstruction. The obstruction is non-solvability, which first appears for the general quintic.
Example 4.4: \(x^4-2\).
Let \(\beta=\sqrt[4]{2}\). The four roots are:
\beta,
\quad
i\beta,
\quad
-\beta,
\quad
-i\beta.
\]
These roots form the vertices of a square in the complex plane. The splitting field is \(\mathbb{Q}(\beta,i)\). Its Galois group is isomorphic to the dihedral group \(D_4\), the symmetry group of a square. This group is also solvable.
Low-degree polynomial formulas are not just computational miracles. They reflect the fact that the relevant symmetry groups can be dismantled in manageable layers.
5. Solvable Groups: Peeling Symmetry into Abelian Layers
A group is solvable if its structure can be decomposed into layers that are abelian. The name “solvable” comes from the connection with solving polynomial equations by radicals.
Definition 5.1: Solvable group.
A group \(G\) is solvable if there exists a chain of subgroups
G=G_0\triangleright G_1\triangleright G_2\triangleright\cdots\triangleright G_r=\{e\}
\]
such that each \(G_{i+1}\) is normal in \(G_i\), and each quotient group \(G_i/G_{i+1}\) is abelian.
A solvable group is a symmetry group that can be peeled apart one abelian layer at a time. An abelian layer is one in which order no longer matters: \(ab=ba\).
Example 5.2: Every abelian group is solvable.
If \(G\) is abelian, use the chain
G\triangleright \{e\}.
\]
The quotient \(G/\{e\}\cong G\) is abelian, so \(G\) is solvable.
Example 5.3: \(S_3\) is solvable.
The group \(S_3\) has a normal subgroup \(A_3\), consisting of the even permutations. We have the chain:
S_3\triangleright A_3\triangleright \{e\}.
\]
The quotients are:
S_3/A_3\cong C_2,
\qquad
A_3/\{e\}\cong C_3.
\]
Both quotients are abelian. Therefore \(S_3\) is solvable.
Example 5.4: \(S_4\) is solvable.
A useful chain is:
S_4\triangleright A_4\triangleright V_4\triangleright \{e\},
\]
where \(V_4\) is the Klein four-group:
V_4=\{e,(12)(34),(13)(24),(14)(23)\}.
\]
The quotients are abelian:
S_4/A_4\cong C_2,
\qquad
A_4/V_4\cong C_3,
\qquad
V_4/\{e\}\cong V_4.
\]
This matches the fact that quartic equations have radical formulas.
Example 5.5: Why \(S_5\) is different.
The first step looks similar:
S_5\triangleright A_5,
\qquad
S_5/A_5\cong C_2.
\]
But \(A_5\) is simple and nonabelian. “Simple” means that it has no nontrivial proper normal subgroups. “Nonabelian” means that it still contains noncommutative structure. Therefore \(A_5\) cannot be peeled apart into smaller normal layers with abelian quotients.
So the chain gets stuck. This is the group-theoretic obstruction behind the general quintic.
Optional proof sketch: why \(A_5\) creates an obstruction.
The group \(A_5\) has order \(60\). Its conjugacy class sizes are:
1,
\quad
12,
\quad
12,
\quad
15,
\quad
20.
\]
A normal subgroup must be a union of conjugacy classes and must contain the identity. No nontrivial proper union of these class sizes gives a divisor of \(60\). Thus \(A_5\) has no nontrivial proper normal subgroups. Since \(A_5\) is also nonabelian, it is not solvable.
6. The Bridge: Radical Towers Correspond to Solvable Galois Groups
We now connect the field side and the group side. This is the central idea of the lesson.
Conceptual Galois criterion for solvability by radicals.
Over a field of characteristic zero, a polynomial is solvable by radicals if and only if the Galois group of its splitting field is a solvable group.
A radical tower builds roots one radical at a time. Each radical step contributes a relatively simple symmetry layer. After adjoining the necessary roots of unity, these layers are cyclic or abelian. Therefore, a radical formula can only produce a Galois group that can be decomposed into abelian layers.
\begin{array}{ccl}
\text{radical formula}
&\Longleftrightarrow&
\text{tower of radical field extensions}\\[4pt]
&\Longrightarrow&
\text{normal subgroup chain with abelian quotients}\\[4pt]
&\Longleftrightarrow&
\text{solvable Galois group}.
\end{array}
\]
Example 6.1: Quadratics.
For \(x^2-2\), the radical tower is:
\mathbb{Q}\subset \mathbb{Q}(\sqrt{2}).
\]
The Galois group is \(C_2\), which is abelian and therefore solvable. This matches the existence of the quadratic formula.
Example 6.2: Cubics.
Cubic equations may have Galois group \(S_3\). This group is nonabelian, but it is still solvable:
S_3\triangleright A_3\triangleright \{e\}.
\]
This explains why cubic formulas exist even though the relevant symmetry can already be noncommutative.
Example 6.3: Quartics.
The generic quartic has Galois group \(S_4\), and \(S_4\) is solvable:
S_4\triangleright A_4\triangleright V_4\triangleright \{e\}.
\]
This explains why quartic formulas exist, despite their complexity.
The key shift.
The existence of a formula is no longer understood as a matter of clever algebraic manipulation. It is understood as a consequence of the structure of a group.
7. The Abel–Ruffini Theorem
We can now state the theorem in the language of the course.
Theorem 7.1: Abel–Ruffini, conceptual form.
There is no formula by radicals that solves the general polynomial equation of degree five:
ax^5+bx^4+cx^3+dx^2+ex+f=0,
\qquad a\ne 0.
\]
More generally, there is no general radical formula for polynomial equations of degree \(n\ge 5\).
The general degree-five polynomial has Galois group \(S_5\). The group \(S_5\) is not solvable because it contains the simple nonabelian group \(A_5\) as an obstruction. Therefore the general quintic cannot be solved by radicals.
\text{general quintic}
\quad\leadsto\quad
\operatorname{Gal}\cong S_5
\quad\leadsto\quad
S_5\text{ not solvable}
\quad\leadsto\quad
\text{no general radical formula}.
\]
What the theorem says.
- It says there is no universal formula using arithmetic operations and radicals for all quintics.
- It says this failure is caused by the non-solvability of the generic Galois group.
- It says the obstacle is structural, not merely computational.
What the theorem does not say.
- It does not say quintics have no roots.
- It does not say quintics cannot be approximated numerically.
- It does not say every individual quintic is unsolvable by radicals.
- It does not say there are no formulas using more advanced functions, such as elliptic or hypergeometric functions.
8. Worked Examples and Concrete Polynomial Cases
Example 8.1: A solvable quintic, \(x^5-2=0\).
The equation
x^5-2=0
\]
has roots
\alpha,\quad \zeta_5\alpha,\quad \zeta_5^2\alpha,\quad \zeta_5^3\alpha,\quad \zeta_5^4\alpha,
\qquad
\alpha=\sqrt[5]{2}.
\]
These are plainly expressed using radicals and roots of unity. Thus this quintic is solvable by radicals.
Abel–Ruffini is a theorem about the general quintic, not a ban on all degree-five radical solutions.
Example 8.2: A non-solvable quintic, \(x^5-x+2=0\).
Consider:
f(x)=x^5-x+2.
\]
This polynomial has roots in \(\mathbb{C}\), and numerical methods can approximate them. However, its Galois group over \(\mathbb{Q}\) is \(S_5\), so the equation is not solvable by radicals.
This example is pedagogically valuable because it contrasts directly with \(x^5-2\). Both are quintics. One is solvable by radicals; the other is not. The difference is not degree alone. The difference is the Galois group.
The next section gives a concrete certificate for this claim. The argument is:
\(f(x)=x^5-x+2\) has Galois group \(S_5\); \(S_5\) is not solvable; and the Galois criterion says that a polynomial can be solved by radicals only when its Galois group is solvable.
Example 8.3: Approximation does not contradict Abel–Ruffini.
A numerical method might return approximations such as:
r_1\approx -1.2671683045,
\qquad
r_{2,3}\approx -0.2609638804\pm 1.1772261534i,
\qquad
r_{4,5}\approx 0.8945480327\pm 0.5341485462i.
\]
Even if a CAS gives five decimal or hundred-decimal approximations, this is not a radical formula. Numerical approximation answers the question “Where are the roots?” Abel–Ruffini answers the question “Can all roots of the general quintic be expressed by arithmetic operations and radicals?”
Optional enrichment: how modular factorization hints at the Galois group.
If a polynomial with integer coefficients factors modulo a prime \(p\) into irreducible pieces of degrees \(d_1,d_2,\ldots,d_k\), this often gives evidence for a permutation in the Galois group with cycle lengths \(d_1,d_2,\ldots,d_k\). For \(f(x)=x^5-x+2\), one finds examples such as:
| Prime | Factorization pattern modulo \(p\) | Cycle-type clue |
|---|---|---|
| \(p=3\) | irreducible degree \(5\) | a \(5\)-cycle |
| \(p=11\) | degree \(1\) times degree \(4\) | a \(4\)-cycle with a fixed point |
| \(p=13\) | degree \(2\) times degree \(3\) | a product of a \(2\)-cycle and a \(3\)-cycle |
These cycle-type clues are consistent with the Galois group being \(S_5\). In a first course, the CAS result is enough; the modular evidence gives a glimpse of how such computations are certified.
9. Why \(x^5-x+2\) Cannot Be Solved by Radicals: A Concrete Certificate
The previous section stated that
f(x)=x^5-x+2
\]
is not solvable by radicals. This section explains why, in a way that is concrete enough for students to follow as a guided reading. The full proof uses standard facts from Galois theory, but the structure of the argument is very visible.
Attach a Galois group \(G\subseteq S_5\) to the five roots.
Use modular factorizations to see which cycle types occur in \(G\).
Conclude that \(G=S_5\).
Use that \(S_5\) is not solvable.
Apply the Galois criterion: non-solvable group means no radical solution.
Claim. The equation
x^5-x+2=0
\]
has roots in \(\mathbb{C}\), and those roots can be approximated numerically, but they cannot all be expressed using a formula built from rational numbers, arithmetic operations, and radicals.
Step 1: The Galois group acts on five roots.
Let \(r_1,r_2,r_3,r_4,r_5\) be the five complex roots of \(f(x)\), and let \(K\) be the splitting field of \(f\) over \(\mathbb{Q}\). Every automorphism in
G=\operatorname{Gal}(K/\mathbb{Q})
\]
permutes the five roots. Therefore \(G\) may be viewed as a subgroup of \(S_5\):
G\subseteq S_5.
\]
The question is: which subgroup of \(S_5\) is it?
Key computational principle.
For a polynomial with integer coefficients, factoring the polynomial modulo a good prime \(p\) gives information about cycle types inside the Galois group. If the factorization modulo \(p\) has irreducible factors of degrees
d_1,d_2,\ldots,d_k,
\]
then the Galois group contains a permutation whose cycle lengths are
d_1,d_2,\ldots,d_k.
\]
This is a standard consequence of Dedekind’s theorem/Frobenius cycle types. In this course, it is enough to use it as a certified computational bridge between modular arithmetic and permutations of roots.
Step 2: Modular factorization data for \(f(x)=x^5-x+2\).
A discriminant computation gives
\operatorname{disc}(x^5-x+2)=49744=2^4\cdot 3109.
\]
Thus the primes \(3\), \(11\), and \(13\) are good primes for the modular test below.
| Prime | Factorization pattern of \(x^5-x+2\) modulo \(p\) | Cycle type forced in \(G\) | Meaning |
|---|---|---|---|
| \(p=3\) | irreducible of degree \(5\) | \((5)\) | \(G\) contains a \(5\)-cycle. Also, \(f\) is irreducible over \(\mathbb{Q}\), so \(G\) acts transitively on the five roots. |
| \(p=11\) |
\[ (x-3)(x^4+3x^3+9x^2+5x+3) \] with the quartic factor irreducible |
\((1)(4)\) | \(G\) contains a \(4\)-cycle. |
| \(p=13\) |
\[ (x^2+x+3)(x^3+12x^2+11x+5) \] with both factors irreducible |
\((2)(3)\) | \(G\) contains a permutation with a \(2\)-cycle and a \(3\)-cycle, hence an element of order \(6\). |
The first row is especially important. Since \(f\) is irreducible modulo \(3\), it is irreducible over \(\mathbb{Q}\). An irreducible degree-five polynomial has a transitive Galois group: the group action does not split the five roots into smaller independent clusters.
How to verify the modular data in Mathematica / Wolfram Language.
Clear[x]
f = x^5 - x + 2;
Table[
{p, Factor[f, Modulus -> p]},
{p, {3, 11, 13}}
] // TableForm
Discriminant[f, x]
FactorInteger[Discriminant[f, x]]This computation does not solve the polynomial. It supplies exact modular factorization data about the permutations that must live inside the Galois group. The discriminant computation identifies the bad primes; \(3\), \(11\), and \(13\) do not divide \(49744\), so they are good primes for the cycle-type test used here.
How to check the same modular data in Excel.
Excel is not being used to compute a Galois group. Instead, the companion spreadsheet lets students verify the arithmetic behind the modular certificate. In the Modular Residues sheet, students enter \(p=3,11,13\) and compute
f(a) \equiv a^5-a+2 \pmod p
\]
for \(a=0,1,\ldots,p-1\). In the Factor Checks sheet, students verify by coefficient convolution that
(x-3)(x^4+3x^3+9x^2+5x+3)
\equiv x^5-x+2 \pmod {11},
\]
and
(x^2+x+3)(x^3+12x^2+11x+5)
\equiv x^5-x+2 \pmod {13}.
\]
This gives a spreadsheet-level verification of the factorization statements that feed the Galois-group argument.
Step 3: The cycle-type data force \(G=S_5\).
The transitive subgroups of \(S_5\) are limited. Up to isomorphism, the main possibilities are:
| Candidate group | Order | Can it contain the required cycle types? |
|---|---|---|
| \(C_5\) | \(5\) | No. It contains only powers of a \(5\)-cycle. |
| \(D_5\) | \(10\) | No. It has no element of order \(4\) or \(6\). |
| Frobenius group \(F_{20}\cong C_5\rtimes C_4\) | \(20\) | It can contain \(5\)-cycles and \(4\)-cycles, but it has no element of order \(6\). |
| \(A_5\) | \(60\) | No. A \(4\)-cycle is odd, and a \((2)(3)\)-cycle is also odd, so these are not in \(A_5\). |
| \(S_5\) | \(120\) | Yes. \(S_5\) contains all of these cycle types. |
Since \(G\) is transitive and contains the cycle types \((5)\), \((1)(4)\), and \((2)(3)\), the only remaining possibility is:
G=\operatorname{Gal}(f/\mathbb{Q})\cong S_5.
\]
Step 4: \(S_5\) is not solvable.
Recall that a group is solvable if its derived series eventually reaches the identity:
G\supseteq G’\supseteq G”\supseteq \cdots \supseteq \{e\}.
\]
Here \(G’\) is the commutator subgroup, measuring the failure of \(G\) to be abelian. For \(S_5\), the first commutator subgroup is
S_5’=A_5.
\]
The group \(A_5\) is simple and nonabelian. Because it is nonabelian, its commutator subgroup is nontrivial; because it is simple, any nontrivial normal subgroup must be all of \(A_5\). Therefore
A_5’=A_5.
\]
Hence the derived series stalls:
S_5\supset A_5\supset A_5\supset A_5\supset\cdots
\]
It never reaches \(\{e\}\). Therefore \(S_5\) is not solvable.
Step 5: Apply the Galois criterion.
The Galois criterion says:
\text{polynomial solvable by radicals}
\quad\Longleftrightarrow\quad
\text{Galois group solvable}.
\]
For \(f(x)=x^5-x+2\), we have just seen:
\operatorname{Gal}(f/\mathbb{Q})\cong S_5,
\qquad
S_5 \text{ is not solvable}.
\]
Therefore:
\boxed{x^5-x+2=0 \text{ is not solvable by radicals over } \mathbb{Q}.}
\]
Student-facing summary.
The equation \(x^5-x+2=0\) has five complex roots. We can approximate them. A computer can represent them exactly as algebraic numbers. But the symmetries among those roots form the full group \(S_5\). Since \(S_5\) cannot be decomposed into abelian layers, no sequence of radical extractions can produce a general radical expression for those roots.
We have not proved all background theorems in this reading. The modular factorization argument relies on a standard Galois-theoretic bridge between factorization modulo primes and cycle types. The goal here is to show students a transparent certificate rather than to hide the obstruction behind the sentence “the Galois group is \(S_5\).”
10. CAS Laboratory: Quartic Radicals vs Quintic Numerical Methods
This laboratory is designed to separate three outputs that students often confuse:
- a radical expression,
- an exact algebraic object,
- a numerical approximation.
CAS Task 1: Compare a quartic and two quintics.
Use Wolfram Language / Mathematica:
Clear[x]
p4 = x^4 - x + 1 == 0;
p5a = x^5 - 2 == 0;
p5b = x^5 - x + 2 == 0;
Solve[p4, x, Quartics -> True] // TraditionalForm
N[NSolve[p4, x], 20]
Solve[p5a, x] // TraditionalForm
N[NSolve[p5a, x], 20]
Solve[p5b, x]
N[NSolve[p5b, x], 20]Questions to answer.
- Which output is a radical expression?
- Which output is numerical?
- Which output is exact but not obviously a radical expression?
- Why does a numerical answer not contradict Abel–Ruffini?
CAS Task 2: Mathematica modular factorization certificate.
The Wolfram Language computation replaces the previous CAS check in this version of the notes. Use Factor[..., Modulus -> p] to factor the quintic over finite fields.
Clear[x]
f = x^5 - x + 2;
Table[
{p, Factor[f, Modulus -> p]},
{p, {3, 11, 13}}
] // TableForm
Discriminant[f, x]
FactorInteger[Discriminant[f, x]]Expected conceptual output:
| Prime | Mathematica factorization output | Factor degrees | Cycle-type consequence |
|---|---|---|---|
| \(3\) | irreducible quintic | \(5\) | \(G\) contains a \(5\)-cycle and the polynomial is irreducible over \(\mathbb Q\). |
| \(11\) | linear factor times irreducible quartic | \(1+4\) | \(G\) contains a \(4\)-cycle. |
| \(13\) | irreducible quadratic times irreducible cubic | \(2+3\) | \(G\) contains an element of order \(6\). |
CAS Task 3: Mathematica irreducibility checks for the non-linear factors.
IrreduciblePolynomialQ[f, Modulus -> 3]
IrreduciblePolynomialQ[
x^4 + 3 x^3 + 9 x^2 + 5 x + 3,
Modulus -> 11
]
IrreduciblePolynomialQ[
x^2 + x + 3,
Modulus -> 13
]
IrreduciblePolynomialQ[
x^3 + 12 x^2 + 11 x + 5,
Modulus -> 13
]These checks support the factor-degree patterns \(5\), \(1+4\), and \(2+3\). Those patterns are the computational certificate used in Section 9 to identify the Galois group as \(S_5\).
CAS Task 4: Excel companion spreadsheet.
Use the companion Excel workbook to make the arithmetic visible to students. The workbook contains:
- Modular Residues: change the prime \(p\) and compute \(a^5-a+2\pmod p\) for residues \(a=0,\ldots,p-1\).
- Factor Checks: verify the coefficient multiplication modulo \(11\) and \(13\).
- Cycle Certificate: connect factor degrees to cycle types and eliminate the transitive subgroups of \(S_5\) other than \(S_5\).
- Mathematica Code: copy/paste Wolfram Language commands for the exact factorization and numerical-root comparison.
The pedagogical point is that Mathematica supplies the exact algebraic factorization, while Excel lets students inspect and verify the modular arithmetic in a transparent table.
A CAS can produce many valid kinds of mathematical information. Abel–Ruffini rules out a general expression by radicals; it does not rule out exact root objects, isolating intervals, numerical approximations, graphical approximations, or special-function solutions.
11. Pedagogical Translation: Teaching “No Formula Exists”
For future secondary teachers, the educational value of Abel–Ruffini is not to make high-school students compute Galois groups. The value is to show that algebra is not merely a list of techniques. Algebra has architecture. Some techniques exist because the underlying structure allows them; other techniques are impossible because the structure forbids them.
High-school enrichment explanation.
The quadratic formula works because every quadratic equation has a root expression made from its coefficients using arithmetic and square roots. Cubic and quartic equations also have formulas, but they become very complicated. For degree five, there is no formula of that same radical type that works for every quintic. This is not because mathematicians failed to find the formula; it is because the symmetry of the general quintic is too complicated to be undone by radicals.
Board-friendly version.
\begin{array}{c}
\text{degree }2: \text{ formula exists}\\
\text{degree }3: \text{ formula exists}\\
\text{degree }4: \text{ formula exists}\\
\text{degree }5: \text{ no general radical formula}
\end{array}
\]
The reason is not “too hard.” The reason is:
S_5\text{ is not solvable.}
\]
Classroom analogy.
Imagine solving a puzzle by unlocking boxes in sequence. A radical formula is like a rule that says: “At each step, you may open a box using one root extraction.” For degrees two, three, and four, the boxes can be arranged so that the puzzle opens layer by layer. For the general quintic, the symmetry of the puzzle does not permit such a sequence of boxes. The puzzle has solutions, but not by that type of unlocking procedure.
Abel–Ruffini is excellent as enrichment, historical context, or a capstone discussion. It should not be used as routine high-school assessment unless students have been given a substantial conceptual scaffold.
12. Formative Checks and Student Exercises
FC1: Three meanings of solve.
For the equation \(x^5-x+2=0\), answer each question separately:
- Does the equation have complex roots?
- Can the roots be approximated numerically?
- Can the roots be expressed by a general radical formula?
Hint: Do not collapse existence, approximation, and radical expression into one idea.
FC2: Radical tower recognition.
Explain why
\sqrt{3+\sqrt{5}}
\]
belongs to a radical tower over \(\mathbb{Q}\). Write the tower explicitly.
FC3: Galois symmetry of \(x^2-3\).
Let \(K=\mathbb{Q}(\sqrt{3})\). Describe the two automorphisms of \(K\) that fix \(\mathbb{Q}\). What is the Galois group?
FC4: Solvability of \(S_3\).
Complete the chain:
S_3\triangleright \underline{\hspace{2cm}}\triangleright \{e\}.
\]
Identify the two quotient groups and explain why they are abelian.
FC5: Solvable quintic vs non-solvable quintic.
Compare \(x^5-2\) and \(x^5-x+2\). Why does Abel–Ruffini allow the first to be solvable by radicals but rule out a radical formula for the second?
Complete the sentence: “Abel–Ruffini does not say __________; it says __________.”
13. Reflection Journal Assignment
Journal chapter title: Why No General Quintic Formula?
Write a 900–1200 word reflection that connects the mathematics of Abel–Ruffini to the teaching of algebra.
Your reflection must include:
- A precise explanation of what “solvable by radicals” means.
- A concrete radical tower example, such as \(\mathbb{Q}\subset\mathbb{Q}(\sqrt{2})\subset\mathbb{Q}(\sqrt{2},\sqrt{1+\sqrt{2}})\).
- A conceptual explanation of why radical towers correspond to solvable Galois groups.
- A concrete explanation of why \(x^5-x+2\) has Galois group \(S_5\), using the modular factorization table from Section 9.
- A conceptual explanation of why \(S_5\) is not solvable, including the role of \(A_5\).
- A comparison between the solvable quintic \(x^5-2\) and the non-solvable quintic \(x^5-x+2\).
- A CAS observation comparing radical output, exact algebraic output, and numerical output.
- A paragraph explaining how this topic could be presented as high-school enrichment.
| Criterion | Strong evidence |
|---|---|
| Mathematical accuracy | Correctly distinguishes roots, numerical approximations, exact algebraic objects, and radical formulas. |
| Structural understanding | Explains the connection between radical towers and solvable groups. |
| Galois-theoretic insight | States why \(S_5\) creates the obstruction to the general quintic formula. |
| Computational interpretation | Uses CAS output responsibly and does not confuse numerical approximation with radical solvability. |
| Pedagogical reflection | Frames “no formula exists” as meaningful mathematics rather than failure. |
14. Selected Hints and Solutions
Solution to FC2.
A suitable tower is:
\mathbb{Q}
\subset
\mathbb{Q}(\sqrt{5})
\subset
\mathbb{Q}(\sqrt{5},\sqrt{3+\sqrt{5}}).
\]
The first step adjoins \(\sqrt{5}\). In the second field, the element \(3+\sqrt{5}\) is available, so we may adjoin its square root.
Solution to FC3.
The two automorphisms are:
\sigma_1(a+b\sqrt{3})=a+b\sqrt{3},
\qquad
\sigma_2(a+b\sqrt{3})=a-b\sqrt{3}.
\]
Thus \(\operatorname{Gal}(\mathbb{Q}(\sqrt{3})/\mathbb{Q})\cong C_2\).
Solution to FC4.
Use
S_3\triangleright A_3\triangleright \{e\}.
\]
Then \(S_3/A_3\cong C_2\) and \(A_3/\{e\}\cong C_3\). Both groups are cyclic and hence abelian.
15. References and Further Reading
- Wolfram Language Documentation, Factor. Used with
Modulus -> pto factor polynomials over finite fields. - Wolfram Language Documentation, Modulus. Explains modular arithmetic as an option in algebraic functions.
- Wolfram Language Documentation, Solve. Useful for distinguishing radical formulas,
Rootobjects, and symbolic solving options. - Wolfram Language Documentation, NSolve. Useful for numerical approximations to polynomial roots.
- Eric W. Weisstein, “Quintic Equation,” MathWorld. Overview of the general quintic and Abel’s impossibility theorem.
- Ian Stewart, Galois Theory. Standard textbook reference for the connection between radical solvability and Galois groups.
- David S. Dummit and Richard M. Foote, Abstract Algebra. Standard graduate algebra reference for groups, fields, and Galois theory.