Movatterモバイル変換


[0]ホーム

URL:


Jump to content
WikibooksThe Free Textbook Project
Search

Abstract Algebra/Splitting Fields and Algebraic Closures

From Wikibooks, open books for an open world
<Abstract Algebra

Splitting Fields

[edit |edit source]

Let F be a field and p(x) be a nonconstant polynomial in F(x). We already know that we can find a field extension of F that contains a root of p(x). However, we would like to know whether an extension E of F containing all of the roots of p(x) exists. In other words, can we find a field extension of F such that p(x) factors into a product of linear polynomials? What is the "smallest" extension containing all the roots of p(x)?

Let F be a field andp(x)=α0+α1x++αnxn{\displaystyle p(x)=\alpha _{0}+\alpha _{1}x+\cdots +\alpha _{n}x^{n}} be a nonconstant polynomial in F[x]. An extension field E of F is asplitting field of p(x) if there exist elementsα1,,αn{\displaystyle \alpha _{1},\cdots ,\alpha _{n}} in E such thatE=F(α1,,αn){\displaystyle E=F(\alpha _{1},\cdots ,\alpha _{n})} and

p(x)=(xα1)(xα2)(xαn){\displaystyle p(x)=(x-\alpha _{1})(x-\alpha _{2})\cdots (x-\alpha _{n})} in E[x].

A polynomialp(x)F[x]{\displaystyle p(x)\in F[x]}splits in E if it is the product of linear factors in E[x].

Example 1: Letp(x)=x4+2x28{\displaystyle p(x)=x^{4}+2x^{2}-8} be inQ[x]{\displaystyle \mathbb {Q} [x]}. Then p(x) has irreducible factorsx22{\displaystyle x^{2}-2} andx2+4{\displaystyle x^{2}+4}. Therefore, the fieldQ(2,i){\displaystyle \mathbb {Q} ({\sqrt {2}},i)} is a splitting field for p(x).

Example 2: Letp(x)=x33{\displaystyle p(x)=x^{3}-3} be inQ[x]{\displaystyle \mathbb {Q} [x]}. Then p(x) has a root in the fieldQ(33){\displaystyle \mathbb {Q} ({\sqrt[{3}]{3}})}. However, this field is not a splitting field for p(x) since the complex cube roots of 3,33±(36)5i2{\displaystyle {\frac {-{\sqrt[{3}]{3}}\pm ({\sqrt[{6}]{3}})^{5}i}{2}}} are not inQ(33){\displaystyle \mathbb {Q} ({\sqrt[{3}]{3}})}.

TheoremLet p(x){\displaystyle \in } F(x) be a nonconstant polynomial. Then there exists a splitting field E for p(x).

Proof. We will use mathematical induction on the degree of p(x). Ifdeg(p(x))=1{\displaystyle deg(p(x))=1}, then p(x) is a linear polynomial andE=F{\displaystyle E=F}. Assume that the theorem is true for all polynomials of degree k with1k<n{\displaystyle 1\leq k<n} and letdeg(p(x))=n{\displaystyle deg(p(x))=n}. We can assume that p(x) is irreducible; otherwise, by our induction hypothesis, we are done. There exists a field K such that p(x) has a zeroα1{\displaystyle \alpha _{1}} in K. Hence,p(x)=(xα1)q(x){\displaystyle p(x)=(x-\alpha _{1})q(x)}, whereq(x)K(x){\displaystyle q(x)\in K(x)}. Sincedeg(q(x))=n1{\displaystyle deg(q(x))=n-1}, there exists a splitting fieldEK{\displaystyle E\supset K} of q(x) that contains the zerosα2,,αn{\displaystyle \alpha _{2},\cdots ,\alpha _{n}} of p(x) by our induction hypothesis. Consequently,

E=K(α2,,αn)=F(α1,,αn){\displaystyle E=K(\alpha _{2},\cdots ,\alpha _{n})=F(\alpha _{1},\cdots ,\alpha _{n})}

is a splitting field of p(x).

The question of uniqueness now arises for splitting fields. This question is answered in the affirmative. Given two splitting fields K and L of a polynomialp(x)F(x){\displaystyle p(x)\in F(x)}, there exists a field isomorphismϕ:KL{\displaystyle \phi :K\to L} that preserves F. In order to prove this result, we must first prove a lemma.

Lemma TheoremLetϕ:EF{\displaystyle \phi :E\to F} be an isomorphism of fields. Let K be an extension field of E andαK{\displaystyle \alpha \in K} be algebraic over E with minimal polynomial p(x). Suppose that L is an extension field of F such thatβ{\displaystyle \beta } is root of the polynomial in F[x] obtained from p(x) under the image ofϕ{\displaystyle \phi }. Thenϕ{\displaystyle \phi } extends to a unique isomorphismψ:E(α)F(β){\displaystyle \psi :E(\alpha )\to F(\beta )} such thatψ(α)=β{\displaystyle \psi (\alpha )=\beta } andψ{\displaystyle \psi } agrees withϕ{\displaystyle \phi } on E.

Lemma Proof. If p(x) has degree n, then we can write any element inE(α){\displaystyle E(\alpha )} as a linear combination of1,α,,αn1{\displaystyle 1,\alpha ,\cdots ,\alpha ^{n-1}}. Therefore, the isomorphism that we are seeking must be

ϕ(a0+a1α++an1αn1)=ψ(a0)+ψ(a1)β++ψ(an1)βn1{\displaystyle \phi (a_{0}+a_{1}\alpha +\cdots +a_{n-1}\alpha ^{n-1})=\psi (a_{0})+\psi (a_{1})\beta +\cdots +\psi (a_{n-1})\beta ^{n-1}},

where

a0+a1α++an1αn1{\displaystyle a_{0}+a_{1}\alpha +\cdots +a_{n-1}\alpha ^{n-1}}

is an element inE(α){\displaystyle E(\alpha )}. The fact thatϕ{\displaystyle \phi } is an isomorphism could be checked by direct computation; however, it is easier to observe thatϕ{\displaystyle \phi } is a composition of maps that we already know to be isomorphisms.

We can extendψ{\displaystyle \psi } to be an isomorphism from E[x] to F[x], which we will also denote byψ{\displaystyle \psi }, by letting

ψ(a0+a1x++anxn)=ψ(a1)x++ψ(an)xn{\displaystyle \psi (a_{0}+a_{1}x+\cdots +a_{n}x^{n})=\psi (a_{1})x+\cdots +\psi (a_{n})x^{n}}.

This extension agrees with the original isomorphismψ:EF{\displaystyle \psi :E\to F}, since constant polynomials get mapped to constant polynomials. By assumption,ψ(p(x))=q(x){\displaystyle \psi (p(x))=q(x)}; hence,ψ{\displaystyle \psi } mapsp(x){\displaystyle \left\langle p(x)\right\rangle } ontoq(x){\displaystyle \left\langle q(x)\right\rangle }. Consequently, we have an isomorphismψ¯:E[x]/p(x)F[x]/q(x){\displaystyle {\overline {\psi }}:E[x]/\left\langle p(x)\right\rangle \to F[x]/\left\langle q(x)\right\rangle }. We have isomorphismsσ:E[x]/p(x)F(α){\displaystyle \sigma :E[x]/\left\langle p(x)\right\rangle \to F(\alpha )} andτ:F[x]/q(x)F(β){\displaystyle \tau :F[x]/\left\langle q(x)\right\rangle \to F(\beta )}, defined by evaluation atα{\displaystyle \alpha } andβ{\displaystyle \beta }, respectively. Therefore,ψ=τ1ϕ¯σ{\displaystyle \psi =\tau ^{-1}{\overline {\phi }}\sigma } is the required isomorphism.

Now writep(x)=(xα)f(x){\displaystyle p(x)=(x-\alpha )f(x)} andq(x)=(xβ)g(x){\displaystyle q(x)=(x-\beta )g(x)}, where the degrees of f(x) and g(x) are less than the degrees of p(x) and q(x), respectively. The field extension K is a splitting field for f(x) over E(α), and L is a splitting field for g(x) over F(β). By our induction hypotheses there exists an isomorphismψ:KL{\displaystyle \psi :K\to L} such thatψ{\displaystyle \psi } agrees withϕ¯{\displaystyle {\bar {\phi }}} on E(α). Hence, there exists an isomorphismψ:KL{\displaystyle \psi :K\to L} such thatψ{\displaystyle \psi } agrees withψ{\displaystyle \psi } on E.

CorollaryLet p(x) be a polynomial in F[x]. Then there exists a splitting field K of p(x) that is unique up to isomorphism.

Algebraic Closures

[edit |edit source]

Given a fieldF, the question arises as to whether or not we can find a fieldE such that every polynomialp(x) has a root inE. This leads us to the following theorem.

Theorem 21.11Let E be an extension field of F. The set of elements in E that are algebraic over F form a field.

Proof. Letα,βE{\displaystyle \alpha ,\beta \in E} be algebraic overF. ThenF(α,β){\displaystyle F(\alpha ,\beta )} is a finite extension ofF. Since every element ofF(α,β){\displaystyle F(\alpha ,\beta )} is algebraic overF,α±β,αβ{\displaystyle F,\alpha \pm \beta ,\alpha \beta }, andα/β (β0){\displaystyle \alpha /\beta {\text{ }}(\beta \neq 0)} are all algebraic overF. Consequently, the set of elements inE that are algebraic overF forms a field.


Corollary 21.12The set of all algebraic numbers forms a field; that is, the set of all complex numbers that are algebraic overQ{\displaystyle \mathbb {Q} }makes up a field.

LetE be a field extension of a fieldF. We define thealgebraic closure of a fieldF inE to be the field consisting of all elements inE that are algebraic overF. A fieldF isalgebraically closed if every nonconstant polynomial inF[x] has a root inF.

Theorem 21.13A field F is algebraically closed if and only if every nonconstant polynomial in F[x] factors into linear factors over F[x].

Proof. LetF be an algebraically closed field. Ifp(x)F[x]{\displaystyle p(x)\in F[x]} is a nonconstant polynomial, thenp(x) has a zero inF, say α. Therefore,xα{\displaystyle x-\alpha } must be a factor ofp(x) and sop(x)=(xα)q1(x){\displaystyle p(x)=(x-\alpha )q_{1}(x)}, wheredeg(q1(x))=deg(p(x))1{\displaystyle deg(q_{1}(x))=deg(p(x))-1}. Continue this process withq1(x){\displaystyle q_{1}(x)} to find a factorization


p(x)=(xα)(xβ)q2(x){\displaystyle p(x)=(x-\alpha )(x-\beta )q_{2}(x)},

wheredeg(q2(x))=deg(p(x))2{\displaystyle deg(q_{2}(x))=deg(p(x))-2}. The process must eventually stop since the degree ofp(x) is finite.

Conversely, suppose that every nonconstant polynomialp(x) inF[x] factors into linear factors. Letaxb{\displaystyle ax-b} be such a factor. Thenp(b/a)=0{\displaystyle p(b/a)=0}. Consequently,F is algebraically closed.


Corollary 21.14An algebraically closed field F has no proper algebraic extension E.

Proof. LetE be an algebraic extension ofF; thenFE{\displaystyle F\subset E}. ForαE{\displaystyle \alpha \in E}, the minimal polynomial of α isxα{\displaystyle x-\alpha }. Therefore,αF{\displaystyle \alpha \in F} andF=E{\displaystyle F=E}.


Theorem 21.15Every field F has a unique algebraic closure.

It is a nontrivial fact that every field has a unique algebraic closure. The proof is not extremely difficult, but requires some rather sophisticated set theory. We refer the reader to [3], [4], or [8] for a proof of this result.

We now state the Fundamental Theorem of Algebra, first proven by Gauss at the age of 22 in his doctoral thesis. This theorem states that every polynomial with coefficients in the complex numbers has a root in the complex numbers. The proof of this theorem will be given inAbstract Algebra/Galois Theory.

Theorem 21.16 (Fundamental Theorem of Algebra)The field of complex numbers is algebraically closed.

Retrieved from "https://en.wikibooks.org/w/index.php?title=Abstract_Algebra/Splitting_Fields_and_Algebraic_Closures&oldid=4410936"
Category:

[8]ページ先頭

©2009-2025 Movatter.jp