Field theory and polynomials Galois theory Theorem
Abel–Ruffini theorem
Builds on Solvable by radicalsSymmetric groupSolvable groupThe symmetric group on five or more letters is not solvableGalois' theorem on solvability
Statement
Let be an integer.
- Let be indeterminates and . The general polynomial is not solvable by radicals over .
- There is a polynomial of degree with rational coefficients that is not solvable by radicals over .
Remarks
By Galois' theorem on solvability, it suffices to find a Galois group that is not solvable. The Galois group of the general polynomial of degree is the full symmetric group , and is not solvable for . For clause 2, the polynomial has Galois group over ; see the quintic equation. Multiplying it by gives a polynomial of degree with the same nonsolvable roots. The bound is necessary: every polynomial of degree at most is solvable by radicals, by the cubic formula and the quartic formula.
Going deeper
For a student
The theorem does not say that quintic equations have no solutions: by the fundamental theorem of algebra, each has five complex roots. It says only that these roots are not always radical expressions in the coefficients. Many quintics, such as , are still solvable by radicals; Galois theory decides which ones. The roots can be expressed with other functions, for instance with the Bring radical or with elliptic modular functions.
Reading path
To understand this page from the ground up, read these 60 pages in order. The foundations come first.
- Binary operation definition
- Characteristic of a field concept
- Cycle notation concept
- Group concept
- Radical extension concept
- Solvable by radicals concept
- Commutativity definition
- Commutator of two elements definition
- Conjugate elements definition
- Group homomorphism definition
- Ring definition
- Subgroup definition
- Symmetric group definition
- Abelian group definition
- Kernel of a homomorphism definition
- Conjugate subgroup definition
- Commutative ring definition
- Disjoint cycles commute statement
- Polynomial ring definition
- Ring homomorphism definition
- Subring definition
- Transposition definition
- Unit of a ring definition
- Left coset definition
- Right coset definition
- Subgroup criterion statement
- Normal subgroup definition
- Decomposition of a permutation into disjoint cycles statement
- Polynomial evaluation definition
- Field definition
- Ring isomorphism definition
- Intersection of subgroups is a subgroup statement
- Root of a polynomial definition
- Decomposition of a permutation into transpositions statement
- Subfield definition
- Subgroup generated by a subset definition
- Normality via left and right cosets statement
- Sign of a permutation definition
- Commutator subgroup definition
- Field extension definition
- Split polynomial definition
- Quotient group definition
- Even and odd permutations definition
- Sign of a cycle statement
- Derived series definition
- Sign is a homomorphism statement
- Intermediate field definition
- Subnormal series definition
- Galois group definition
- Alternating group definition
- Solvable group definition
- Field generated by adjoining elements definition
- The alternating group is generated by three-cycles statement
- Splitting field definition
- Subgroups of solvable groups are solvable statement
- Simplicity of the alternating group statement
- Galois group of a polynomial definition
- The symmetric group on five or more letters is not solvable statement
- Galois' theorem on solvability statement
- Abel–Ruffini theorem statement
Further reading
About this page
| Tag | 163A2WQQJX |
|---|---|
| URI | m2://163A2WQQJX |
| Kind | statement, theorem |
| Writing | W0 stub |
| MSC | 12F10, 12E12 |
| Status | This copy of the site has no build data. Run m2 status 163A2WQQJX. |
| About | Solvable by radicals |
| Uses | Solvable by radicals, Symmetric group, Solvable group, The symmetric group on five or more letters is not solvable, Galois' theorem on solvability |
| Same as | |
| Changed | 2 November 2026 |
Markdown · JSON · Edit on GitHub
What this page needs for W1
- a source with a locator (0 of 1)
The writing levels say how complete the text of a page is. They do not measure its truth.