Book a Demo!
CoCalc Logo Icon
StoreFeaturesDocsShareSupportNewsAboutPoliciesSign UpSign In
Download

📚 The CoCalc Library - books, templates and other resources

132928 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.1Field Automorphisms

Our first task is to establish a link between group theory and field theory by examining automorphisms of fields.

Proposition23.1

The set of all automorphisms of a field FF is a group under composition of functions.

Proof

If σ\sigma and τ\tau are automorphisms of F,F\text{,} then so are στ\sigma \tau and σ1.\sigma^{-1}\text{.} The identity is certainly an automorphism; hence, the set of all automorphisms of a field FF is indeed a group.

Proposition23.2

Let EE be a field extension of F.F\text{.} Then the set of all automorphisms of EE that fix FF elementwise is a group; that is, the set of all automorphisms σ:EE\sigma : E \rightarrow E such that σ(α)=α\sigma( \alpha ) = \alpha for all αF\alpha \in F is a group.

Proof

We need only show that the set of automorphisms of EE that fix FF elementwise is a subgroup of the group of all automorphisms of E.E\text{.} Let σ\sigma and τ\tau be two automorphisms of EE such that σ(α)=α\sigma( \alpha ) = \alpha and τ(α)=α\tau( \alpha ) = \alpha for all αF.\alpha \in F\text{.} Then στ(α)=σ(α)=α\sigma \tau( \alpha ) = \sigma( \alpha) = \alpha and σ1(α)=α.\sigma^{-1}( \alpha ) = \alpha\text{.} Since the identity fixes every element of E,E\text{,} the set of automorphisms of EE that leave elements of FF fixed is a subgroup of the entire group of automorphisms of E.E\text{.}

Let EE be a field extension of F.F\text{.} We will denote the full group of automorphisms of EE by Aut(E).\aut(E)\text{.} We define the of EE over FF to be the group of automorphisms of EE that fix FF elementwise; that is,

G(E/F)={σAut(E):σ(α)=α for all αF}.\begin{equation*} G(E/F) = \{ \sigma \in \aut(E) : \sigma(\alpha) = \alpha \text{ for all } \alpha \in F \}. \end{equation*}

If f(x)f(x) is a polynomial in F[x]F[x] and EE is the splitting field of f(x)f(x) over F,F\text{,} then we define the Galois group of f(x)f(x) to be G(E/F).G(E/F)\text{.}

Example23.3

Complex conjugation, defined by σ:a+biabi,\sigma : a + bi \mapsto a - bi\text{,} is an automorphism of the complex numbers. Since

σ(a)=σ(a+0i)=a0i=a,\begin{equation*} \sigma(a) = \sigma(a + 0i) = a - 0i = a, \end{equation*}

the automorphism defined by complex conjugation must be in G(C/R).G( {\mathbb C} / {\mathbb R} )\text{.}

Example23.4

Consider the fields QQ(5)Q(3,5).{\mathbb Q} \subset {\mathbb Q}(\sqrt{5}\, ) \subset {\mathbb Q}( \sqrt{3}, \sqrt{5}\, )\text{.} Then for a,bQ(5),a, b \in {\mathbb Q}( \sqrt{5}\, )\text{,}

σ(a+b3)=ab3\begin{equation*} \sigma( a + b \sqrt{3}\, ) = a - b \sqrt{3} \end{equation*}

is an automorphism of Q(3,5){\mathbb Q}(\sqrt{3}, \sqrt{5}\, ) leaving Q(5){\mathbb Q}( \sqrt{5}\, ) fixed. Similarly,

τ(a+b5)=ab5\begin{equation*} \tau( a + b \sqrt{5}\, ) = a - b \sqrt{5} \end{equation*}

is an automorphism of Q(3,5){\mathbb Q}(\sqrt{3}, \sqrt{5}\, ) leaving Q(3){\mathbb Q}( \sqrt{3}\, ) fixed. The automorphism μ=στ\mu = \sigma \tau moves both 3\sqrt{3} and 5.\sqrt{5}\text{.} It will soon be clear that {id,σ,τ,μ}\{ \identity, \sigma, \tau, \mu \} is the Galois group of Q(3,5){\mathbb Q}(\sqrt{3}, \sqrt{5}\, ) over Q.{\mathbb Q}\text{.} The following table shows that this group is isomorphic to Z2×Z2.{\mathbb Z}_2 \times {\mathbb Z}_2\text{.}

idστμididστμσσidμτττμidσμμτσid\begin{equation*} \begin{array}{c|cccc} & \identity & \sigma & \tau & \mu \\ \hline \identity & \identity & \sigma & \tau & \mu \\ \sigma & \sigma & \identity & \mu & \tau \\ \tau & \tau & \mu & \identity & \sigma \\ \mu & \mu & \tau & \sigma & \identity \end{array} \end{equation*}

We may also regard the field Q(3,5){\mathbb Q}( \sqrt{3}, \sqrt{5}\, ) as a vector space over Q{\mathbb Q} that has basis {1,3,5,15}.\{ 1, \sqrt{3}, \sqrt{5}, \sqrt{15}\, \}\text{.} It is no coincidence that G(Q(3,5)/Q)=[Q(3,5):Q)]=4.|G( {\mathbb Q}( \sqrt{3}, \sqrt{5}\, ) /{\mathbb Q})| = [{\mathbb Q}(\sqrt{3}, \sqrt{5}\, ):{\mathbb Q})] = 4\text{.}

Proposition23.5

Let EE be a field extension of FF and f(x)f(x) be a polynomial in F[x].F[x]\text{.} Then any automorphism in G(E/F)G(E/F) defines a permutation of the roots of f(x)f(x) that lie in E.E\text{.}

Proof

Let

f(x)=a0+a1x+a2x2++anxn\begin{equation*} f(x) = a_0 + a_1 x + a_2 x^2 + \cdots + a_n x^n \end{equation*}

and suppose that αE\alpha \in E is a zero of f(x).f(x)\text{.} Then for σG(E/F),\sigma \in G(E/F)\text{,}

0=σ(0)=σ(f(α))=σ(a0+a1α+a2α2++anαn)=a0+a1σ(α)+a2[σ(α)]2++an[σ(α)]n;\begin{align*} 0 & = \sigma( 0 )\\ & = \sigma( f( \alpha ))\\ & = \sigma(a_0 + a_1\alpha + a_2 \alpha^2 + \cdots + a_n \alpha^n)\\ & = a_0 + a_1 \sigma(\alpha) + a_2 [\sigma(\alpha)]^2 + \cdots + a_n [\sigma(\alpha)]^n; \end{align*}

therefore, σ(α)\sigma( \alpha ) is also a zero of f(x).f(x)\text{.}

Let EE be an algebraic extension of a field F.F\text{.} Two elements α,βE\alpha, \beta \in E are over FF if they have the same minimal polynomial. For example, in the field Q(2){\mathbb Q}( \sqrt{2}\, ) the elements 2\sqrt{2} and 2-\sqrt{2} are conjugate over Q{\mathbb Q} since they are both roots of the irreducible polynomial x22.x^2 - 2\text{.}

A converse of the last proposition exists. The proof follows directly from Lemma 21.32.

Proposition23.6

If α\alpha and β\beta are conjugate over F,F\text{,} there exists an isomorphism σ:F(α)F(β)\sigma : F( \alpha ) \rightarrow F( \beta ) such that σ\sigma is the identity when restricted to F.F\text{.}

Theorem23.7

Let f(x)f(x) be a polynomial in F[x]F[x] and suppose that EE is the splitting field for f(x)f(x) over F.F\text{.} If f(x)f(x) has no repeated roots, then

G(E/F)=[E:F].\begin{equation*} |G(E/F)| = [E:F]. \end{equation*}
Proof

We will use mathematical induction on the degree of f(x).f(x)\text{.} If the degree of f(x)f(x) is 0 or 1, then E=FE = F and there is nothing to show. Assume that the result holds for all polynomials of degree kk with 0k<n.0 \leq k \lt n\text{.} Suppose that the degree of f(x)f(x) is n.n\text{.} Let p(x)p(x) be an irreducible factor of f(x)f(x) of degree r.r\text{.} Since all of the roots of p(x)p(x) are in E,E\text{,} we can choose one of these roots, say α,\alpha\text{,} so that FF(α)E.F \subset F( \alpha ) \subset E\text{.} Then

[E:F(α)]=n/rand[F(α):F]=r.\begin{equation*} [E: F(\alpha)] = n/r \quad \text{and} \quad [F(\alpha): F] = r. \end{equation*}

If β\beta is any other root of p(x),p(x)\text{,} then FF(β)E.F \subset F( \beta ) \subset E\text{.} By Lemma 21.32, there exists a unique isomorphism σ:F(α)F(β)\sigma: F( \alpha ) \rightarrow F( \beta ) for each such β\beta that fixes FF elementwise. Since EE is a splitting field of p(x),p(x)\text{,} there are exactly rr such isomorphisms. For each of these automorphisms, we can use our induction hypothesis on [E:F(α)]=n/r<n[E: F(\alpha)] = n/r \lt n to conclude that

G(E/F(α))=[E:F(α)].\begin{equation*} |G(E/F(\alpha))| = [E:F(\alpha)]. \end{equation*}

Consequently, there are

[E:F]=[E:F(α)][F(α):F]=n\begin{equation*} [E:F] = [E:F(\alpha)] [F( \alpha):F] = n \end{equation*}

possible automorphisms of EE that fix F,F\text{,} or G(E/F)=[E:F].|G(E/F)| = [E:F]\text{.}

Corollary23.8

Let FF be a finite field with a finite extension EE such that [E:F]=k.[E:F]=k\text{.} Then G(E/F)G(E/F) is cyclic of order k.k\text{.}

Proof

Let pp be the characteristic of EE and FF and assume that the orders of EE and FF are pmp^m and pn,p^n\text{,} respectively. Then nk=m.nk = m\text{.} We can also assume that EE is the splitting field of xpmxx^{p^m} - x over a subfield of order p.p\text{.} Therefore, EE must also be the splitting field of xpmxx^{p^m} - x over F.F\text{.} Applying Theorem 23.7, we find that G(E/F)=k.|G(E/F)| = k\text{.}

To prove that G(E/F)G(E/F) is cyclic, we must find a generator for G(E/F).G(E/F)\text{.} Let σ:EE\sigma : E \rightarrow E be defined by σ(α)=αpn.\sigma(\alpha) = \alpha^{p^n}\text{.} We claim that σ\sigma is the element in G(E/F)G(E/F) that we are seeking. We first need to show that σ\sigma is in Aut(E).\aut(E)\text{.} If α\alpha and β\beta are in E,E\text{,}

σ(α+β)=(α+β)pn=αpn+βpn=σ(α)+σ(β)\begin{equation*} \sigma(\alpha + \beta) = (\alpha + \beta)^{p^n} = \alpha^{p^n} + \beta^{p^n} = \sigma(\alpha) + \sigma(\beta) \end{equation*}

by Lemma 22.3 Also, it is easy to show that σ(αβ)=σ(α)σ(β).\sigma(\alpha \beta) = \sigma( \alpha ) \sigma( \beta )\text{.} Since σ\sigma is a nonzero homomorphism of fields, it must be injective. It must also be onto, since EE is a finite field. We know that σ\sigma must be in G(E/F),G(E/F)\text{,} since FF is the splitting field of xpnxx^{p^n} - x over the base field of order p.p\text{.} This means that σ\sigma leaves every element in FF fixed. Finally, we must show that the order of σ\sigma is k.k\text{.} By Theorem 23.7, we know that

σk(α)=αpnk=αpm=α\begin{equation*} \sigma^k( \alpha ) = \alpha^{p^{nk}} = \alpha^{p^m} = \alpha \end{equation*}

is the identity of G(E/F).G( E/F)\text{.} However, σr\sigma^r cannot be the identity for 1r<k;1 \leq r \lt k\text{;} otherwise, xpnrxx^{p^{nr}} - x would have pmp^m roots, which is impossible.

Example23.9

We can now confirm that the Galois group of Q(3,5){\mathbb Q}( \sqrt{3}, \sqrt{5}\, ) over Q{\mathbb Q} in Example 23.4 is indeed isomorphic to Z2×Z2.{\mathbb Z}_2 \times {\mathbb Z}_2\text{.} Certainly the group H={id,σ,τ,μ}H = \{ \identity, \sigma, \tau, \mu \} is a subgroup of G(Q(3,5)/Q);G({\mathbb Q}( \sqrt{3}, \sqrt{5}\, )/{\mathbb Q})\text{;} however, HH must be all of G(Q(3,5)/Q),G({\mathbb Q}( \sqrt{3}, \sqrt{5}\, )/{\mathbb Q})\text{,} since

H=[Q(3,5):Q]=G(Q(3,5)/Q)=4.\begin{equation*} |H| = [{\mathbb Q}( \sqrt{3}, \sqrt{5}\, ):{\mathbb Q}] = |G({\mathbb Q}( \sqrt{3}, \sqrt{5}\, )/{\mathbb Q})| = 4. \end{equation*}
Example23.10

Let us compute the Galois group of

f(x)=x4+x3+x2+x+1\begin{equation*} f(x) = x^4 + x^3 + x^2 + x + 1 \end{equation*}

over Q.{\mathbb Q}\text{.} We know that f(x)f(x) is irreducible by Exercise 17.4.20 in Chapter 17. Furthermore, since (x1)f(x)=x51,(x -1)f(x) = x^5 -1\text{,} we can use DeMoivre's Theorem to determine that the roots of f(x)f(x) are ωi,\omega^i\text{,} where i=1,,4i = 1, \ldots, 4 and

ω=cos(2π/5)+isin(2π/5).\begin{equation*} \omega = \cos(2 \pi / 5 ) + i \sin(2 \pi / 5 ). \end{equation*}

Hence, the splitting field of f(x)f(x) must be Q(ω).{\mathbb Q}(\omega)\text{.} We can define automorphisms σi\sigma_i of Q(ω){\mathbb Q}(\omega ) by σi(ω)=ωi\sigma_i( \omega ) = \omega^i for i=1,,4.i = 1, \ldots, 4\text{.} It is easy to check that these are indeed distinct automorphisms in G(Q(ω)/Q).G( {\mathbb Q}( \omega) / {\mathbb Q} )\text{.} Since

[Q(ω):Q]=G(Q(ω)/Q)=4,\begin{equation*} [{\mathbb Q}( \omega) : {\mathbb Q}] = | G( {\mathbb Q}( \omega) / {\mathbb Q})| = 4, \end{equation*}

the σi\sigma_i's must be all of G(Q(ω)/Q).G( {\mathbb Q}( \omega) / {\mathbb Q} )\text{.} Therefore, G(Q(ω)/Q)Z4G({\mathbb Q}( \omega) / {\mathbb Q})\cong {\mathbb Z}_4 since ω\omega is a generator for the Galois group.

SubsectionSeparable Extensions

Many of the results that we have just proven depend on the fact that a polynomial f(x)f(x) in F[x]F[x] has no repeated roots in its splitting field. It is evident that we need to know exactly when a polynomial factors into distinct linear factors in its splitting field. Let EE be the splitting field of a polynomial f(x)f(x) in F[x].F[x]\text{.} Suppose that f(x)f(x) factors over EE as

f(x)=(xα1)n1(xα2)n2(xαr)nr=i=1r(xαi)ni.\begin{equation*} f(x) = (x - \alpha_1)^{n_1} (x - \alpha_2)^{n_2} \cdots (x - \alpha_r)^{n_r} = \prod_{i = 1}^{r} (x - \alpha_i)^{n_i}. \end{equation*}

We define the of a root αi\alpha_i of f(x)f(x) to be ni.n_i\text{.} A root with multiplicity 1 is called a . Recall that a polynomial f(x)F[x]f(x) \in F[x] of degree nn is if it has nn distinct roots in its splitting field E.E\text{.} Equivalently, f(x)f(x) is separable if it factors into distinct linear factors over E[x].E[x]\text{.} An extension EE of FF is a of FF if every element in EE is the root of a separable polynomial in F[x].F[x]\text{.} Also recall that f(x)f(x) is separable if and only if gcd(f(x),f(x))=1\gcd( f(x), f'(x)) = 1 (Lemma 22.5).

Proposition23.11

Let f(x)f(x) be an irreducible polynomial over F.F\text{.} If the characteristic of FF is 0,0\text{,} then f(x)f(x) is separable. If the characteristic of FF is pp and f(x)g(xp)f(x) \neq g(x^p) for some g(x)g(x) in F[x],F[x]\text{,} then f(x)f(x) is also separable.

Proof

First assume that charF=0.\chr F = 0\text{.} Since degf(x)<degf(x)\deg f'(x) \lt \deg f(x) and f(x)f(x) is irreducible, the only way gcd(f(x),f(x))1\gcd( f(x), f'(x)) \neq 1 is if f(x)f'(x) is the zero polynomial; however, this is impossible in a field of characteristic zero. If charF=p,\chr F = p\text{,} then f(x)f'(x) can be the zero polynomial if every coefficient of f(x)f'(x) is a multiple of p.p\text{.} This can happen only if we have a polynomial of the form f(x)=a0+a1xp+a2x2p++anxnp.f(x) = a_0 + a_1 x^p + a_2 x^{2p} + \cdots + a_n x^{np}\text{.}

Certainly extensions of a field FF of the form F(α)F(\alpha) are some of the easiest to study and understand. Given a field extension EE of F,F\text{,} the obvious question to ask is when it is possible to find an element αE\alpha \in E such that E=F(α).E = F( \alpha )\text{.} In this case, α\alpha is called a . We already know that primitive elements exist for certain extensions. For example,

Q(3,5)=Q(3+5)\begin{equation*} {\mathbb Q}( \sqrt{3}, \sqrt{5}\, ) = {\mathbb Q}( \sqrt{3} + \sqrt{5}\, ) \end{equation*}

and

Q(53,5i)=Q(56i).\begin{equation*} {\mathbb Q}( \sqrt[3]{5}, \sqrt{5}\, i ) = {\mathbb Q}( \sqrt[6]{5}\, i ). \end{equation*}

Corollary 22.12 tells us that there exists a primitive element for any finite extension of a finite field. The next theorem tells us that we can often find a primitive element.

Theorem23.12Primitive Element Theorem

Let EE be a finite separable extension of a field F.F\text{.} Then there exists an αE\alpha \in E such that E=F(α).E=F( \alpha )\text{.}

Proof

We already know that there is no problem if FF is a finite field. Suppose that EE is a finite extension of an infinite field. We will prove the result for F(α,β).F(\alpha, \beta)\text{.} The general case easily follows when we use mathematical induction. Let f(x)f(x) and g(x)g(x) be the minimal polynomials of α\alpha and β,\beta\text{,} respectively. Let KK be the field in which both f(x)f(x) and g(x)g(x) split. Suppose that f(x)f(x) has zeros α=α1,,αn\alpha = \alpha_1, \ldots, \alpha_n in KK and g(x)g(x) has zeros β=β1,,βm\beta = \beta_1, \ldots, \beta_m in K.K\text{.} All of these zeros have multiplicity 1, since EE is separable over F.F\text{.} Since FF is infinite, we can find an aa in FF such that

aαiαββj\begin{equation*} a \neq \frac{\alpha_i - \alpha}{\beta - \beta_j} \end{equation*}

for all ii and jj with j1.j \neq 1\text{.} Therefore, a(ββj)αiα.a( \beta - \beta_j ) \neq \alpha_i - \alpha\text{.} Let γ=α+aβ.\gamma = \alpha + a \beta\text{.} Then

γ=α+aβαi+aβj;\begin{equation*} \gamma = \alpha + a \beta \neq \alpha_i + a \beta_j; \end{equation*}

hence, γaβjαi\gamma - a \beta_j \neq \alpha_i for all i,ji, j with j1.j \neq 1\text{.} Define h(x)F(γ)[x]h(x) \in F( \gamma )[x] by h(x)=f(γax).h(x) = f( \gamma - ax)\text{.} Then h(β)=f(α)=0.h( \beta ) = f( \alpha ) = 0\text{.} However, h(βj)0h( \beta_j ) \neq 0 for j1.j \neq 1\text{.} Hence, h(x)h(x) and g(x)g(x) have a single common factor in F(γ)[x];F( \gamma )[x]\text{;} that is, the minimal polynomial of β\beta over F(γ)F( \gamma ) must be linear, since β\beta is the only zero common to both g(x)g(x) and h(x).h(x)\text{.} So βF(γ)\beta \in F( \gamma ) and α=γaβ\alpha = \gamma - a \beta is in F(γ).F( \gamma )\text{.} Hence, F(α,β)=F(γ).F( \alpha, \beta ) = F( \gamma )\text{.}