23.3: Applications
( \newcommand{\kernel}{\mathrm{null}\,}\)
Solvability by Radicals
Throughout this section we shall assume that all fields have characteristic zero to ensure that irreducible polynomials do not have multiple roots. The immediate goal of this section is to determine when the roots of a polynomial
The only one of these operations that might demand a larger field is the taking of
An extension field
such for
The easiest polynomial to solve by radicals is one of the form
Example
The polynomial
Solution
The splitting field of
We shall prove that a polynomial is solvable by radicals if its Galois group is solvable. Recall that a subnormal series of a group
where
Lemma
Let
- Proof
-
The roots of
are where is a primitive th root of unity. Suppose that contains all of its th roots of unity. If is one of the roots of then distinct roots of are and Since permutes the roots the elements in must be determined by their action on these roots. Let and be in and suppose that and If contains the roots of unity, thenTherefore,
and is abelian, and must be solvable.Now suppose that
does not contain a primitive th root of unity. Let be a generator of the cyclic group of the th roots of unity. Let be a zero of Since and are both in the splitting field of is also in Let Then Since is the splitting field of is a normal extension of Therefore, any automorphism in is determined by It must be the case that for some integer since all of the zeros of are powers of If is in thenTherefore,
is abelian. By the Fundamental Theorem of Galois Theory the seriesis a normal series. By our previous argument,
is abelian. Sinceis also abelian,
is solvable.
Lemma
Let
a radical extension of
such that
- Proof
-
Since
is a radical extension of there exists a chain of subfieldssuch for
we have and for some positive integer We will build a normal radical extension ofsuch that
Define for be the splitting field of The roots of this polynomial are where is a primitive th root of unity. If contains all of its roots of unity, then On the other hand, suppose that does not contain a primitive th root of unity. If is a root of then all of the roots of must be where is a primitive th root of unity. In this case, Thus, is a normal radical extension of containing Continuing in this manner, we obtainsuch that
is a normal extension of and for
We will now prove the main theorem about solvability by radicals.
Theorem
Let
- Proof
-
Since
is solvable by radicals there exists an extension of by radicals By Lemma , we can assume that is a splitting field and is normal over By the Fundamental Theorem of Galois Theory, is a normal subgroup of Therefore, we have a subnormal series of subgroups ofAgain by the Fundamental Theorem of Galois Theory, we know that
By Lemma
, is solvable; hence, is also solvable.
The converse of Theorem
Insolvability of the Quintic
We are now in a position to find a fifth-degree polynomial that is not solvable by radicals. We merely need to find a polynomial whose Galois group is
Lemma
If
- Proof
-
Let
be a subgroup of that contains a transposition and a cycle of length We may assume that The order of is and must be a cycle of length for Therefore, we may assume that for some where (see Exercise in Chapter 5). Noting that and we can obtain all the transpositions of the form for However, these transpositions generate all transpositions in since The transpositions generate
Example
We will show that
Solution
By Eisenstein's Criterion,
Therefore,
The Fundamental Theorem of Algebra
It seems fitting that the last theorem that we will state and prove is the Fundamental Theorem of Algebra. This theorem was first proven by Gauss in his doctoral thesis. Prior to Gauss's proof, mathematicians suspected that there might exist polynomials over the real and complex numbers having no solutions. The Fundamental Theorem of Algebra states that every polynomial over the complex numbers factors into distinct linear factors.
Theorem
The field of complex numbers is algebraically closed; that is, every polynomial in
- Proof
-
Suppose that
is a proper finite field extension of the complex numbers. Since any finite extension of a field of characteristic zero is a simple extension, there exists an such that with the root of an irreducible polynomial in The splitting field of is a finite normal separable extension of that contains We must show that it is impossible for to be a proper extension ofSuppose that
is a proper extension of Since is the splitting field of over is a finite normal separable extension of Let be the fixed field of a Sylow 2-subgroup of Then and Since we know that must be odd. Consequently, with having a minimal polynomial of odd degree. Therefore,We now know that
must be a 2-group. It follows that is a -group. We have assumed that therefore, By the first Sylow Theorem and the Fundamental Theorem of Galois Theory, there exists a subgroup of of index 2 and a field fixed elementwise by Then and there exists an element with minimal polynomial in This polynomial has roots that are in since is in This is impossible; hence,
Although our proof was strictly algebraic, we were forced to rely on results from calculus. It is necessary to assume the completeness axiom from analysis to show that every polynomial of odd degree has a real root and that every positive real number has a square root. It seems that there is no possible way to avoid this difficulty and formulate a purely algebraic argument. It is somewhat amazing that there are several elegant proofs of the Fundamental Theorem of Algebra that use complex analysis. It is also interesting to note that we can obtain a proof of such an important theorem from two very different fields of mathematics.