🔢 mathematics

On unsolvable equations of prime degree

This paper presents a concise new proof of Kronecker's theorem regarding the real roots of solvable irreducible equations of prime degree and rectifies inaccuracies found in modern presentations of Weber's original proof.

Original authors: Juliusz Brzeziński, Jan Stevens

Published 2026-06-03

📖 5 min read🧠 Deep dive

CC BY 4.0

Original authors: Juliusz Brzeziński, Jan Stevens

Original paper licensed under CC BY 4.0 (http://creativecommons.org/licenses/by/4.0/). ✨ This is an AI-generated explanation of the paper below. It is not written or endorsed by the authors. For technical accuracy, refer to the original paper. Read full disclaimer

Imagine you are trying to solve a giant, complex puzzle. In the world of mathematics, these puzzles are equations. For centuries, mathematicians had a special set of tools called "radicals" (like square roots, cube roots, etc.) that allowed them to solve puzzles of certain sizes (quadratic, cubic, and quartic equations).

But then, a big question arose: Can we solve every equation using these same tools?

This paper, written by Juliusz Brzeziński and Jan Stevens, tackles a specific type of puzzle: equations of prime degree (like 3, 5, 7, 11...). Specifically, they look at equations that cannot be broken down into smaller pieces (called "irreducible").

Here is the story of what they found, explained simply:

1. The "Real" vs. "Imaginary" Roots

Every equation has solutions, called "roots." Some of these roots are real numbers (like 2, -5, or $\pi$ ), which you can plot on a standard number line. Others are complex numbers (involving the imaginary unit $i$ ), which exist in a different, "invisible" dimension.

A long time ago, a mathematician named Leopold Kronecker made a fascinating observation about these prime-degree equations:

If you have an equation that can be solved with radicals, and it has an odd prime number (like 5 or 7) as its degree, then either ALL of its roots are real, or ONLY ONE is real.

There is no middle ground. You can't have an equation where 3 roots are real and 2 are imaginary. It's all or nothing.

2. The "Elementary" Detective Work

Usually, proving this requires a massive, high-tech toolkit called Galois Theory (which is like a master key to the universe of algebra). However, the authors wanted to prove this using a simpler, more "elementary" set of tools—like solving a mystery with a magnifying glass instead of a supercomputer.

They looked at a proof by Heinrich Weber from over a century ago. Weber tried to show this using simple logic, but his proof had a hidden trap.

The Trap (The "Leaky Bucket"):
Weber's proof assumed that every time you add a new tool (a radical) to your chain of solving, it was a "clean" tool. But sometimes, the tools you add are "leaky" or "broken" (mathematically, these are called reducible radicals).

The Analogy: Imagine you are building a tower of blocks. Weber assumed every block was a perfect, solid cube. But sometimes, you accidentally grab a block that is already cracked or hollow. If you build on top of a cracked block, the whole tower might wobble or collapse in a way Weber didn't expect.
The Consequence: Because Weber didn't account for these "cracked blocks," his proof had a logical gap. Later textbooks copied his proof, spreading the error.

3. The Authors' Solution

Brzeziński and Stevens stepped in to fix the leak. They didn't throw away Weber's idea; they just reinforced the foundation.

They created a new, shorter proof that handles both the "perfect blocks" (irreducible radicals) and the "cracked blocks" (reducible radicals) correctly.

They showed that even if you use a "cracked block" (a reducible radical) to solve the equation, the rule still holds: You either get all real roots, or just one.
They used a clever trick involving complex conjugation (imagine looking at the equation in a mirror). By checking how the equation behaves in the mirror, they could prove that if two roots are real, the "mirror" forces all the other roots to be real too.

4. Why This Matters (The "So What?")

The paper explains that this rule is a powerful way to prove that some equations are impossible to solve with radicals.

The Test: If you find an equation of degree 5 (a quintic) that has three real roots and two imaginary roots, you know immediately that it cannot be solved by radicals.
The Example: The authors point to the equation $X^5 - 4X - 2 = 0$ . If you graph it, you see it crosses the real line three times. Because it has more than one real root but not all real roots, it breaks Kronecker's rule. Therefore, it is mathematically impossible to write down a formula for its roots using standard radicals.

Summary

Think of this paper as a repair crew fixing a famous bridge.

The Bridge: A rule (Kronecker's Theorem) that tells us which math puzzles can be solved and which cannot.
The Crack: A mistake in an old blueprint (Weber's proof) that ignored "broken tools" (reducible radicals).
The Fix: The authors patched the bridge, showing that the rule holds true even when using broken tools.
The Result: We can now confidently say, "This specific puzzle is unsolvable," without needing the most advanced, complex math machinery, just by counting how many of its solutions are "real."

The paper is a historical detective story that cleans up a century-old mathematical error and provides a clear, simple way to identify unsolvable equations.

Technical Summary: On Unsolvable Equations of Prime Degree

Problem Statement
The paper addresses the problem of constructing specific examples of polynomial equations of prime degree that are not solvable by radicals. While the general impossibility of solving quintic and higher-degree equations is a standard result in Galois theory, the authors focus on providing a relatively elementary proof for a specific criterion: Kronecker's Theorem. This theorem states that for an irreducible polynomial of odd prime degree with coefficients in a subfield of the real numbers, if the equation is solvable by radicals, then either all its roots are real or exactly one root is real. Consequently, any such irreducible polynomial with more than one real root and at least one pair of complex conjugate roots serves as a concrete example of an unsolvable equation.

Methodology and Preliminaries
The authors adopt an "elementary" approach, defined as avoiding the full machinery of the Fundamental Theorem of Galois Theory (specifically the Galois correspondence between normal subgroups and normal extensions). Instead, the proof relies on:

Field Theory Basics: Properties of simple extensions, the Tower Law, and the structure of splitting fields.
Galois Groups as Automorphism Groups: Utilizing the definition of the Galois group as the group of automorphisms of a splitting field fixing the base field, without invoking the deep structural theorems of solvability.
Radical Extensions: Analyzing chains of simple radical extensions $K = K_0 \subset K_1 \subset \dots \subset K_n = L$ , where $K_i = K_{i-1}(\alpha_i)$ and $\alpha_i^{q_i} = a_i \in K_{i-1}$ .
Conjugation Invariance: A critical methodological addition is the construction of chains of radical extensions that are invariant under complex conjugation. The authors prove (Lemma 11) that for any radical extension of a conjugation-invariant field, there exists a refined chain where every intermediate field is also conjugation-invariant. This involves handling both irreducible radicals and "reducible radicals" (where $X^q - a$ is reducible over the base field).

Key Contributions and Corrections
The primary contribution of the paper is a corrected and unified proof of Kronecker's Theorem that addresses historical inaccuracies in previous "elementary" proofs, specifically those by Heinrich Weber and Heinrich Dörrie.

Identification of Error: The authors trace a specific error in Weber's and Dörrie's proofs to the assumption that the degree of the radical extension ( $q$ ) must equal the degree of the polynomial ( $p$ ) when the polynomial first becomes reducible. This assumption fails when the radical is reducible (i.e., $X^q - a$ has a root in the base field). In such cases, the extension degree $q$ may differ from $p$ , and the standard argument that $q=p$ collapses.
Handling Reducible Radicals: The paper explicitly addresses the case of reducible radicals. It demonstrates that if a polynomial becomes reducible via a reducible radical, the extension involves adjoining a primitive root of unity and potentially a real root $\rho = \sqrt[q]{a\bar{a}}$ .
Unified Proof Strategy: The authors provide a proof that treats both irreducible and reducible radical cases.
- Case I (Irreducible Radical): If $X^q - a$ is irreducible, Nagell's Lemma implies $q=p$ . The Galois group is cyclic of order $p$ . If two roots are real, the automorphism structure forces all roots to be real.
- Case II (Reducible Radical): If $X^q - a$ is reducible, the extension is normal and cyclic. The authors use the property of the real number $\rho = \alpha\bar{\alpha}$ to show that if one root is real, the conjugation invariance of the field and the transitivity of the Galois group imply all roots are real.

Results
The paper establishes Theorem 14 (Kronecker's Theorem): Let $K$ be a conjugation-invariant subfield of $\mathbb{C}$ . If an irreducible polynomial $f(X) \in K[X]$ of odd prime degree $p$ with real coefficients is solvable by radicals, then exactly one root or all roots of the polynomial are real.

The proof confirms that the existence of an irreducible polynomial of odd prime degree with integer coefficients having both real and non-real roots (e.g., $X^5 - 4X - 2$ ) implies the equation is not solvable by radicals.

Significance and Claims
The authors modestly frame the paper's significance in the context of mathematical pedagogy and historical correction:

Pedagogical Value: The proof offers a route to understanding the unsolvability of the quintic that requires less background than a full Galois theory course, making it suitable for advanced undergraduate algebra courses that cover field extensions but not the full Galois correspondence.
Historical Correction: The paper clarifies that modern textbook presentations of Weber's proof (often derived from Dörrie's Triumph der Mathematik) contain inaccuracies regarding reducible radicals. The authors provide the necessary corrections to salvage the "elementary" nature of the proof without resorting to the full power of Galois theory.
Unification: By distinguishing the cases based on the reducibility of the radical and the properties of $\rho$ , the authors provide a complete argument that avoids the circular reasoning found in earlier versions of the proof.

The paper does not propose new applications or future research directions but aims to solidify the theoretical foundation of a classic result in algebraic solvability.

1. The "Real" vs. "Imaginary" Roots

2. The "Elementary" Detective Work

3. The Authors' Solution

4. Why This Matters (The "So What?")

Summary

More like this