Book a Demo!
CoCalc Logo Icon
StoreFeaturesDocsShareSupportNewsAboutPoliciesSign UpSign In
Download

📚 The CoCalc Library - books, templates and other resources

132930 views
License: OTHER
Kernel:
%%html <link href="http://mathbook.pugetsound.edu/beta/mathbook-content.css" rel="stylesheet" type="text/css" /> <link href="https://aimath.org/mathbook/mathbook-add-on.css" rel="stylesheet" type="text/css" /> <style>.subtitle {font-size:medium; display:block}</style> <link href="https://fonts.googleapis.com/css?family=Open+Sans:400,400italic,600,600italic" rel="stylesheet" type="text/css" /> <link href="https://fonts.googleapis.com/css?family=Inconsolata:400,700&subset=latin,latin-ext" rel="stylesheet" type="text/css" /><!-- Hide this cell. --> <script> var cell = $(".container .cell").eq(0), ia = cell.find(".input_area") if (cell.find(".toggle-button").length == 0) { ia.after( $('<button class="toggle-button">Toggle hidden code</button>').click( function (){ ia.toggle() } ) ) ia.hide() } </script>

Important: to view this notebook properly you will need to execute the cell above, which assumes you have an Internet connection. It should already be selected, or place your cursor anywhere above to select. Then press the "Run" button in the menu bar above (the right-pointing arrowhead), or press Shift-Enter on your keyboard.

ParseError: KaTeX parse error: \newcommand{\lt} attempting to redefine \lt; use \renewcommand

Section23.3Applications

SubsectionSolvability 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 f(x)f(x) can be computed with a finite number of operations on the coefficients of f(x).f(x)\text{.} The allowable operations are addition, subtraction, multiplication, division, and the extraction of nnth roots. Certainly the solution to the quadratic equation, ax2+bx+c=0,a x^2 + b x +c = 0\text{,} illustrates this process:

x=b±b24ac2a.\begin{equation*} x = \frac{-b \pm \sqrt{b^2 - 4ac}}{2a}. \end{equation*}

The only one of these operations that might demand a larger field is the taking of nnth roots. We are led to the following definition.

An extension field EE of a field FF is an if there exists a chain of subfields

F=F0F1F2Fr=E\begin{equation*} F = F_0 \subset F_1 \subset F_2 \subset \cdots \subset F_r = E \end{equation*}

such for i=1,2,,r,i = 1, 2, \ldots, r\text{,} we have Fi=Fi1(αi)F_i = F_{i - 1}(\alpha_i) and αiniFi1\alpha_i^{n_i} \in F_{i-1} for some positive integer ni.n_i\text{.} A polynomial f(x)f(x) is over FF if the splitting field KK of f(x)f(x) over FF is contained in an extension of FF by radicals. Our goal is to arrive at criteria that will tell us whether or not a polynomial f(x)f(x) is solvable by radicals by examining the Galois group f(x).f(x)\text{.}

The easiest polynomial to solve by radicals is one of the form xna.x^n - a\text{.} As we discussed in Chapter 4, the roots of xn1x^n - 1 are called the . These roots are a finite subgroup of the splitting field of xn1.x^n -1\text{.} By Corollary 22.11, the nnth roots of unity form a cyclic group. Any generator of this group is called a .

Example23.26

The polynomial xn1x^n - 1 is solvable by radicals over Q.{\mathbb Q}\text{.} The roots of this polynomial are 1,ω,ω2,,ωn1,1, \omega, \omega^2, \ldots, \omega^{n - 1}\text{,} where

ω=cos(2πn)+isin(2πn).\begin{equation*} \omega = \cos\left( \frac{2 \pi}{n} \right) + i \sin\left( \frac{2 \pi}{n} \right). \end{equation*}

The splitting field of xn1x^n - 1 over Q{\mathbb Q} is Q(ω).{\mathbb Q}(\omega)\text{.}

We shall prove that a polynomial is solvable by radicals if its Galois group is solvable. Recall that a subnormal series of a group GG is a finite sequence of subgroups

G=HnHn1H1H0={e},\begin{equation*} G = H_n \supset H_{n-1} \supset \cdots \supset H_1 \supset H_0 = \{ e \}, \end{equation*}

where HiH_i is normal in Hi+1.H_{i+1}\text{.} A group GG is solvable if it has a subnormal series {Hi}\{ H_i \} such that all of the factor groups Hi+1/HiH_{i+1} /H_i are abelian. For example, if we examine the series {id}A3S3,\{ \identity \} \subset A_3 \subset S_3\text{,} we see that S3S_3 is solvable. On the other hand, S5S_5 is not solvable, by Theorem 10.11.

Lemma23.27

Let FF be a field of characteristic zero and EE be the splitting field of xnax^n - a over FF with aF.a \in F\text{.} Then G(E/F)G(E/F) is a solvable group.

Proof

The roots of xnax^n - a are an,ωan,,ωn1an,\sqrt[n]{a}, \omega \sqrt[n]{a}, \ldots, \omega^{n-1} \sqrt[n]{a}\text{,} where ω\omega is a primitive nnth root of unity. Suppose that FF contains all of its nnth roots of unity. If ζ\zeta is one of the roots of xna,x^n - a\text{,} then distinct roots of xnax^n - a are ζ,ωζ,,ωn1ζ,\zeta, \omega \zeta, \ldots, \omega^{n - 1} \zeta\text{,} and E=F(ζ).E = F(\zeta)\text{.} Since G(E/F)G(E/F) permutes the roots xna,x^n - a\text{,} the elements in G(E/F)G(E/F) must be determined by their action on these roots. Let σ\sigma and τ\tau be in G(E/F)G(E/F) and suppose that σ(ζ)=ωiζ\sigma( \zeta ) = \omega^i \zeta and τ(ζ)=ωjζ.\tau( \zeta ) = \omega^j \zeta\text{.} If FF contains the roots of unity, then

στ(ζ)=σ(ωjζ)=ωjσ(ζ)=ωi+jζ=ωiτ(ζ)=τ(ωiζ)=τσ(ζ).\begin{equation*} \sigma \tau( \zeta ) = \sigma( \omega^j \zeta) = \omega^j \sigma( \zeta ) = \omega^{i+j} \zeta = \omega^i \tau( \zeta ) = \tau( \omega^i \zeta ) = \tau \sigma( \zeta ). \end{equation*}

Therefore, στ=τσ\sigma \tau = \tau \sigma and G(E/F)G(E/F) is abelian, and G(E/F)G(E/F) must be solvable.

Now suppose that FF does not contain a primitive nnth root of unity. Let ω\omega be a generator of the cyclic group of the nnth roots of unity. Let α\alpha be a zero of xna.x^n - a\text{.} Since α\alpha and ωα\omega \alpha are both in the splitting field of xna,x^n - a\text{,} ω=(ωα)/α\omega = (\omega \alpha)/ \alpha is also in E.E\text{.} Let K=F(ω).K = F( \omega)\text{.} Then FKE.F \subset K \subset E\text{.} Since KK is the splitting field of xn1,x^n - 1\text{,} KK is a normal extension of F.F\text{.} Therefore, any automorphism σ\sigma in G(F(ω)/F)G(F( \omega)/ F) is determined by σ(ω).\sigma( \omega)\text{.} It must be the case that σ(ω)=ωi\sigma( \omega ) = \omega^i for some integer ii since all of the zeros of xn1x^n - 1 are powers of ω.\omega\text{.} If τ(ω)=ωj\tau( \omega ) = \omega^j is in G(F(ω)/F),G(F(\omega)/F)\text{,} then

στ(ω)=σ(ωj)=[σ(ω)]j=ωij=[τ(ω)]i=τ(ωi)=τσ(ω).\begin{equation*} \sigma \tau( \omega ) = \sigma( \omega^j ) = [ \sigma( \omega )]^j = \omega^{ij} = [\tau( \omega ) ]^i = \tau( \omega^i ) = \tau \sigma( \omega ). \end{equation*}

Therefore, G(F(ω)/F)G(F( \omega ) / F) is abelian. By the Fundamental Theorem of Galois Theory the series

{id}G(E/F(ω))G(E/F)\begin{equation*} \{ \identity \} \subset G(E/ F(\omega)) \subset G(E/F) \end{equation*}

is a normal series. By our previous argument, G(E/F(ω))G(E/F(\omega)) is abelian. Since

G(E/F)/G(E/F(ω))G(F(ω)/F)\begin{equation*} G(E/F) /G(E/F( \omega)) \cong G(F(\omega)/F) \end{equation*}

is also abelian, G(E/F)G(E/F) is solvable.

Lemma23.28

Let FF be a field of characteristic zero and let

F=F0F1F2Fr=E\begin{equation*} F = F_0 \subset F_1 \subset F_2 \subset \cdots \subset F_r = E \end{equation*}

a radical extension of F.F\text{.} Then there exists a normal radical extension

F=K0K1K2Kr=K\begin{equation*} F = K_0 \subset K_1 \subset K_2 \subset \cdots \subset K_r = K \end{equation*}

such that KK that contains EE and KiK_i is a normal extension of Ki1.K_{i-1}\text{.}

Proof

Since EE is a radical extension of F,F\text{,} there exists a chain of subfields

F=F0F1F2Fr=E\begin{equation*} F = F_0 \subset F_1 \subset F_2 \subset \cdots \subset F_r = E \end{equation*}

such for i=1,2,,r,i = 1, 2, \ldots, r\text{,} we have Fi=Fi1(αi)F_i = F_{i - 1}(\alpha_i) and αiniFi1\alpha_i^{n_i} \in F_{i-1} for some positive integer ni.n_i\text{.} We will build a normal radical extension of F,F\text{,}

F=K0K1K2Kr=K\begin{equation*} F = K_0 \subset K_1 \subset K_2 \subset \cdots \subset K_r = K \end{equation*}

such that KE.K \supseteq E\text{.} Define K1K_1 for be the splitting field of xn1α1n1.x^{n_1} - \alpha_1^{n_1}\text{.} The roots of this polynomial are α1,α1ω,α1ω2,,α1ωn11,\alpha_1, \alpha_1 \omega, \alpha_1 \omega^2, \ldots, \alpha_1 \omega^{n_1 - 1}\text{,} where ω\omega is a primitive n1n_1th root of unity. If FF contains all of its n1n_1 roots of unity, then K1=F(α!).K_1 = F(\alpha_!)\text{.} On the other hand, suppose that FF does not contain a primitive n1n_1th root of unity. If β\beta is a root of xn1α1n1,x^{n_1} - \alpha_1^{n_1}\text{,} then all of the roots of xn1α1n1x^{n_1} - \alpha_1^{n_1} must be β,ωβ,,ωn11,\beta, \omega \beta, \ldots, \omega^{n_1-1}\text{,} where ω\omega is a primitive n1n_1th root of unity. In this case, K1=F(ωβ).K_1 = F(\omega \beta)\text{.} Thus, K1K_1 is a normal radical extension of FF containing F1.F_1\text{.} Continuing in this manner, we obtain

F=K0K1K2Kr=K\begin{equation*} F = K_0 \subset K_1 \subset K_2 \subset \cdots \subset K_r = K \end{equation*}

such that KiK_i is a normal extension of Ki1K_{i-1} and KiFiK_i \supseteq F_i for i=1,2,,r.i = 1, 2, \ldots, r\text{.}

We will now prove the main theorem about solvability by radicals.

Theorem23.29

Let f(x)f(x) be in F[x],F[x]\text{,} where charF=0.\chr F = 0\text{.} If f(x)f(x) is solvable by radicals, then the Galois group of f(x)f(x) over FF is solvable.

Proof

Since f(x)f(x) is solvable by radicals there exists an extension EE of FF by radicals F=F0F1Fn=E.F = F_0 \subset F_1 \subset \cdots \subset F_n = E\text{.} By Lemma 23.28, we can assume that EE is a splitting field f(x)f(x) and FiF_i is normal over Fi1.F_{i - 1}\text{.} By the Fundamental Theorem of Galois Theory, G(E/Fi)G(E/F_i) is a normal subgroup of G(E/Fi1).G(E/F_{i - 1})\text{.} Therefore, we have a subnormal series of subgroups of G(E/F):G(E/F)\text{:}

{id}G(E/Fn1)G(E/F1)G(E/F).\begin{equation*} \{ \identity \} \subset G(E/F_{n - 1}) \subset \cdots \subset G(E/F_1) \subset G(E/F). \end{equation*}

Again by the Fundamental Theorem of Galois Theory, we know that

G(E/Fi1)/G(E/Fi)G(Fi/Fi1).\begin{equation*} G(E/F_{i - 1})/G(E/F_i) \cong G(F_i/F_{i - 1}). \end{equation*}

By Lemma 23.27, G(Fi/Fi1)G(F_i/F_{i - 1}) is solvable; hence, G(E/F)G(E/F) is also solvable.

The converse of Theorem 23.29 is also true. For a proof, see any of the references at the end of this chapter.

SubsectionInsolvability 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 S5.S_5\text{.} We begin by proving a lemma.

Lemma23.30

If pp is prime, then any subgroup of SpS_p that contains a transposition and a cycle of length pp must be all of Sp.S_p\text{.}

Proof

Let GG be a subgroup of SpS_p that contains a transposition σ\sigma and τ\tau a cycle of length p.p\text{.} We may assume that σ=(12).\sigma = (1 2)\text{.} The order of τ\tau is pp and τn\tau^n must be a cycle of length pp for 1n<p.1 \leq n \lt p\text{.} Therefore, we may assume that μ=τn=(12i3ip)\mu = \tau^n = (1 2 i_3 \ldots i_p) for some n,n\text{,} where 1n<p1 \leq n \lt p (see Exercise 5.3.13 in Chapter 5). Noting that (12)(12i3ip)=(2i3ip)(1 2)(12 i_3\ldots i_p) = (2 i_3\ldots i_p) and (2i3ip)k(12)(2i3ip)k=(1ik),(2i_3 \ldots i_p)^k(12)(2i_3 \ldots i_p)^{-k} = (1i_k)\text{,} we can obtain all the transpositions of the form (1n)(1n) for 1n<p.1 \leq n \lt p\text{.} However, these transpositions generate all transpositions in Sp,S_p\text{,} since (1j)(1i)(1j)=(ij).(1j)(1 i)(1 j) = (i j)\text{.} The transpositions generate Sp.S_p\text{.}

Figure23.31The graph of f(x)=x56x327x3f(x) = x^5 - 6 x^3 - 27 x - 3
Example23.32

We will show that f(x)=x56x327x3Q[x]f(x) = x^5 - 6 x^3 - 27 x - 3 \in {\mathbb Q}[x] is not solvable. We claim that the Galois group of f(x)f(x) over Q{\mathbb Q} is S5.S_5\text{.} By Eisenstein's Criterion, f(x)f(x) is irreducible and, therefore, must be separable. The derivative of f(x)f(x) is f(x)=5x418x227;f'(x) = 5 x^4 - 18 x^2 - 27\text{;} hence, setting f(x)=0f'(x) = 0 and solving, we find that the only real roots of f(x)f'(x) are

x=±66+95.\begin{equation*} x = \pm \sqrt{ \frac{6 \sqrt{6} + 9 }{5} }. \end{equation*}

Therefore, f(x)f(x) can have at most one maximum and one minimum. It is easy to show that f(x)f(x) changes sign between 3-3 and 2,-2\text{,} between 2-2 and 0,0\text{,} and once again between 00 and 44 (Figure 23.31). Therefore, f(x)f(x) has exactly three distinct real roots. The remaining two roots of f(x)f(x) must be complex conjugates. Let KK be the splitting field of f(x).f(x)\text{.} Since f(x)f(x) has five distinct roots in KK and every automorphism of KK fixing Q{\mathbb Q} is determined by the way it permutes the roots of f(x),f(x)\text{,} we know that G(K/Q)G(K/{\mathbb Q}) is a subgroup of S5.S_5\text{.} Since ff is irreducible, there is an element in σG(K/Q)\sigma \in G(K/{\mathbb Q}) such that σ(a)=b\sigma(a) = b for two roots aa and bb of f(x).f(x)\text{.} The automorphism of C{\mathbb C} that takes a+biabia + bi \mapsto a - bi leaves the real roots fixed and interchanges the complex roots; consequently, G(K/Q)G(K/{\mathbb Q} ) contains a transpostion. If α\alpha is one of the real roots of f(x),f(x)\text{,} then [Q(α):Q]=5[\mathbb Q(\alpha) : \mathbb Q] = 5 by Exercise 21.4.28. Since Q(α)\mathbb Q(\alpha) is a subfield of K,K\text{,} it must be the case the [K:Q][K : \mathbb Q] is divisible by 5. Since [K:Q]=G(K/Q)[K : \mathbb Q] = |G(K/{\mathbb Q})| and G(K/Q)S5,G(K/{\mathbb Q}) \subset S_5\text{,} we know that G(K/Q)G(K/{\mathbb Q}) contains a cycle of length 5. By Lemma 23.30, S5S_5 is generated by a transposition and an element of order 5; therefore, G(K/Q)G(K/{\mathbb Q} ) must be all of S5.S_5\text{.} By Theorem 10.11, S5S_5 is not solvable. Consequently, f(x)f(x) cannot be solved by radicals.

SubsectionThe 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.

Theorem23.33Fundamental Theorem of Algebra

The field of complex numbers is algebraically closed; that is, every polynomial in C[x]{\mathbb C}[x] has a root in C.{\mathbb C}\text{.}

Proof

Suppose that EE 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 αE\alpha \in E such that E=C(α)E = {\mathbb C}( \alpha ) with α\alpha the root of an irreducible polynomial f(x)f(x) in C[x].{\mathbb C}[x]\text{.} The splitting field LL of f(x)f(x) is a finite normal separable extension of C{\mathbb C} that contains E.E\text{.} We must show that it is impossible for LL to be a proper extension of C.{\mathbb C}\text{.}

Suppose that LL is a proper extension of C.{\mathbb C}\text{.} Since LL is the splitting field of f(x)(x2+1)f(x)(x^2 + 1) over R,{\mathbb R}\text{,} LL is a finite normal separable extension of R.{\mathbb R}\text{.} Let KK be the fixed field of a Sylow 2-subgroup GG of G(L/R).G(L/{\mathbb R})\text{.} Then LKRL \supset K \supset {\mathbb R} and G(L/K)=[L:K].|G( L / K )| =[L:K]\text{.} Since [L:R]=[L:K][K:R],[L : {\mathbb R}] = [L:K][K:{\mathbb R}]\text{,} we know that [K:R][K:{\mathbb R}] must be odd. Consequently, K=R(β)K = {\mathbb R}(\beta) with β\beta having a minimal polynomial f(x)f(x) of odd degree. Therefore, K=R.K = {\mathbb R}\text{.}

We now know that G(L/R)G(L/{\mathbb R}) must be a 2-group. It follows that G(L/C)G(L / {\mathbb C}) is a 2-group. We have assumed that LC;L \neq {\mathbb C}\text{;} therefore, G(L/C)2.|G(L / {\mathbb C})| \geq 2\text{.} By the first Sylow Theorem and the Fundamental Theorem of Galois Theory, there exists a subgroup GG of G(L/C)G(L/{\mathbb C}) of index 2 and a field EE fixed elementwise by G.G\text{.} Then [E:C]=2[E:{\mathbb C}] = 2 and there exists an element γE\gamma \in E with minimal polynomial x2+bx+cx^2 + b x + c in C[x].{\mathbb C}[x]\text{.} This polynomial has roots (b±b24c)/2( - b \pm \sqrt{b^2 - 4c}\, ) / 2 that are in C,{\mathbb C}\text{,} since b24cb^2 - 4 c is in C.{\mathbb C}\text{.} This is impossible; hence, L=C.L = {\mathbb C}\text{.}

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.