Splitting field

Template:Short description Template:About In abstract algebra, a splitting field of a polynomial with coefficients in a field is the smallest field extension of that field over which the polynomial splits, i.e., decomposes into linear factors.

DefinitionEdit

A splitting field of a polynomial p(X) over a field K is a field extension L of K over which p factors into linear factors

where <math>c \in K</math> and for each <math>i</math> we have <math>X - a_i \in L[X]</math> with a_i not necessarily distinct and such that the roots a_i generate L over K. The extension L is then an extension of minimal degree over K in which p splits. It can be shown that such splitting fields exist and are unique up to isomorphism. The amount of freedom in that isomorphism is known as the Galois group of p (if we assume it is separable).

A splitting field of a set P of polynomials is the smallest field over which each of the polynomials in P splits.

PropertiesEdit

An extension L that is a splitting field for a set of polynomials p(X) over K is called a normal extension of K.

Given an algebraically closed field A containing K, there is a unique splitting field L of p between K and A, generated by the roots of p. If K is a subfield of the complex numbers, the existence is immediate. On the other hand, the existence of algebraic closures in general is often proved by 'passing to the limit' from the splitting field result, which therefore requires an independent proof to avoid circular reasoning.

Given a separable extension K′ of K, a Galois closure L of K′ is a type of splitting field, and also a Galois extension of K containing K′ that is minimal, in an obvious sense. Such a Galois closure should contain a splitting field for all the polynomials p over K that are minimal polynomials over K of elements of K′.

Constructing splitting fieldsEdit

MotivationEdit

Finding roots of polynomials has been an important problem since the time of the ancient Greeks. Some polynomials, however, such as Template:Math over Template:Math, the real numbers, have no roots. By constructing the splitting field for such a polynomial one can find the roots of the polynomial in the new field.

The constructionEdit

Let F be a field and p(X) be a polynomial in the polynomial ring F[X] of degree n. The general process for constructing K, the splitting field of p(X) over F, is to construct a chain of fields <math>F=K_0 \subseteq K_1 \subseteq \cdots \subseteq K_{r-1} \subseteq K_r=K</math> such that K_i is an extension of K_i−1 containing a new root of p(X). Since p(X) has at most n roots the construction will require at most n extensions. The steps for constructing K_i are given as follows:

Factorize p(X) over K_i into irreducible factors <math>f_1(X)f_2(X) \cdots f_k(X)</math>.
Choose any nonlinear irreducible factor f(X).
Construct the field extension K_i+1 of K_i as the quotient ring K_i+1 = K_i[X] / (f(X)) where (f(X)) denotes the ideal in K_i[X] generated by f(X).
Repeat the process for K_i+1 until p(X) completely factors.

The irreducible factor f(X) used in the quotient construction may be chosen arbitrarily. Although different choices of factors may lead to different subfield sequences, the resulting splitting fields will be isomorphic.

Since f(X) is irreducible, (f(X)) is a maximal ideal of K_i[X] and K_i[X] / (f(X)) is, in fact, a field, the residue field for that maximal ideal. Moreover, if we let <math>\pi : K_i[X] \to K_i[X]/(f(X))</math> be the natural projection of the ring onto its quotient then

so π(X) is a root of f(X) and of p(X).

The degree of a single extension <math>[K_{i+1} : K_i]</math> is equal to the degree of the irreducible factor f(X). The degree of the extension [K : F] is given by <math>[K_r : K_{r-1}] \cdots [K_2 : K_1] [K_1 : F]</math> and is at most n!.

The field K_i[X]/(f(X))Edit

As mentioned above, the quotient ring K_i+1 = K_i[X]/(f(X)) is a field when f(X) is irreducible. Its elements are of the form

<math>c_{n-1}\alpha^{n-1} + c_{n-2}\alpha^{n-2} + \cdots + c_1\alpha + c_0</math>

where the c_j are in K_i and α = π(X). (If one considers K_i+1 as a vector space over K_i then the powers α^j for Template:Nowrap form a basis.)

The elements of K_i+1 can be considered as polynomials in α of degree less than n. Addition in K_i+1 is given by the rules for polynomial addition, and multiplication is given by polynomial multiplication modulo f(X). That is, for g(α) and h(α) in K_i+1 their product is g(α)h(α) = r(α) where r(X) is the remainder of g(X)h(X) when divided by f(X) in K_i[X].

The remainder r(X) can be computed through polynomial long division; however there is also a straightforward reduction rule that can be used to compute r(α) = g(α)h(α) directly. First let

<math>f(X) = X^n + b_{n-1} X^{n-1} + \cdots + b_1 X + b_0.</math>

The polynomial is over a field so one can take f(X) to be monic without loss of generality. Now α is a root of f(X), so

<math>\alpha^n = -(b_{n-1} \alpha^{n-1} + \cdots + b_1 \alpha + b_0).</math>

If the product g(α)h(α) has a term α^m with Template:Nowrap it can be reduced as follows:

<math>\alpha^n\alpha^{m-n} = -(b_{n-1} \alpha^{n-1} + \cdots + b_1 \alpha + b_0) \alpha^{m-n} = -(b_{n-1} \alpha^{m-1} + \cdots + b_1 \alpha^{m-n+1} + b_0 \alpha^{m-n})</math>.

As an example of the reduction rule, take K_i = Q[X], the ring of polynomials with rational coefficients, and take f(X) = X⁷ − 2. Let <math>g(\alpha) = \alpha^5 + \alpha^2</math> and h(α) = α³ +1 be two elements of Q[X]/(X⁷ − 2). The reduction rule given by f(X) is α⁷ = 2 so

<math>g(\alpha)h(\alpha) = (\alpha^5 + \alpha^2)(\alpha^3 + 1) = \alpha^8 + 2 \alpha^5 + \alpha^2 = (\alpha^7)\alpha + 2\alpha^5 + \alpha^2 = 2 \alpha^5 + \alpha^2 + 2\alpha.</math>

ExamplesEdit

The complex numbersEdit

Consider the polynomial ring R[x], and the irreducible polynomial Template:Nowrap The quotient ring Template:Nowrap is given by the congruence Template:Nowrap As a result, the elements (or equivalence classes) of Template:Nowrap are of the form Template:Nowrap where a and b belong to R. To see this, note that since Template:Nowrap it follows that Template:Nowrap, Template:Nowrap, Template:Nowrap, etc.; and so, for example Template:Nowrap

The addition and multiplication operations are given by firstly using ordinary polynomial addition and multiplication, but then reducing modulo Template:Nowrap, i.e. using the fact that Template:Nowrap, Template:Nowrap, Template:Nowrap, Template:Nowrap, etc. Thus:

<math>(a_1 + b_1x)(a_2 + b_2x) = a_1a_2 + (a_1b_2 + b_1a_2)x + (b_1b_2)x^2 \equiv (a_1a_2 - b_1b_2) + (a_1b_2 + b_1a_2)x \, . </math>

If we identify Template:Nowrap with (a,b) then we see that addition and multiplication are given by

We claim that, as a field, the quotient ring Template:Nowrap is isomorphic to the complex numbers, C. A general complex number is of the form Template:Nowrap, where a and b are real numbers and Template:Nowrap Addition and multiplication are given by

If we identify Template:Nowrap with (a, b) then we see that addition and multiplication are given by

The previous calculations show that addition and multiplication behave the same way in Template:Nowrap and C. In fact, we see that the map between Template:Nowrap and C given by Template:Nowrap is a homomorphism with respect to addition and multiplication. It is also obvious that the map Template:Nowrap is both injective and surjective; meaning that Template:Nowrap is a bijective homomorphism, i.e., an isomorphism. It follows that, as claimed: Template:Nowrap

In 1847, Cauchy used this approach to define the complex numbers.<ref>Template:Citation</ref>

Cubic exampleEdit

Let Template:Mvar be the rational number field Template:Math and Template:Math. Each root of Template:Mvar equals Template:Math times a cube root of unity. Therefore, if we denote the cube roots of unity by

<math>\omega_1 = 1,\,</math>

<math>\omega_2 = -\frac{1}{2} + \frac{\sqrt{3}}{2} i,</math>

<math>\omega_3 = -\frac{1}{2} - \frac{\sqrt{3}}{2} i.</math>

any field containing two distinct roots of Template:Mvar will contain the quotient between two distinct cube roots of unity. Such a quotient is a primitive cube root of unity—either <math>\omega_2</math> or <math>\omega_3=1/\omega_2</math>. It follows that a splitting field Template:Mvar of Template:Mvar will contain ω₂, as well as the real cube root of 2; conversely, any extension of Template:Math containing these elements contains all the roots of Template:Mvar. Thus

<math>L = \mathbf{Q}(\sqrt[3]{2}, \omega_2) = \{ a + b\sqrt[3]{2} + c{\sqrt[3]{2}}^2 + d\omega_2 + e\sqrt[3]{2}\omega_2 + f{\sqrt[3]{2}}^2 \omega_2 \mid a,b,c,d,e,f \in \mathbf{Q} \}</math>

Note that applying the construction process outlined in the previous section to this example, one begins with <math>K_0 = \mathbf{Q}</math> and constructs the field <math>K_1 = \mathbf{Q}[X] / (X^3 - 2)</math>. This field is not the splitting field, but contains one (any) root. However, the polynomial <math>Y^3 - 2</math> is not irreducible over <math>K_1</math> and in fact:

Note that <math>X</math> is not an indeterminate, and is in fact an element of <math>K_1</math>. Now, continuing the process, we obtain <math>K_2 = K_1[Y] / (Y^2 + XY + X^2)</math>, which is indeed the splitting field and is spanned by the <math>\mathbf{Q}</math>-basis <math>\{1, X, X^2, Y, XY, X^2 Y\}</math>. Notice that if we compare this with <math>L</math> from above we can identify <math>X = \sqrt[3]{2}</math> and <math>Y = \omega_2</math>.

Other examplesEdit

The splitting field of x^q − x over F_p is the unique finite field F_q for q = pⁿ.<ref>Template:Cite book</ref> Sometimes this field is denoted by GF(q).

The splitting field of x² + 1 over F₇ is F₄₉; the polynomial has no roots in F₇, i.e., −1 is not a square there, because 7 is not congruent to 1 modulo 4.<ref>Instead of applying this characterization of odd prime moduli for which −1 is a square, one could just check that the set of squares in F₇ is the set of classes of 0, 1, 4, and 2, which does not include the class of −1 ≡ 6.</ref>

The splitting field of x² − 1 over F₇ is F₇ since x² − 1 = (x + 1)(x − 1) already splits into linear factors.

We calculate the splitting field of f(x) = x³ + x + 1 over F₂. It is easy to verify that f(x) has no roots in F₂; hence f(x) is irreducible in F₂[x]. Put r = x + (f(x)) in F₂[x]/(f(x)) so F₂(r) is a field and x³ + x + 1 = (x + r)(x² + ax + b) in F₂(r)[x]. Note that we can write + for − since the characteristic is two. Comparing coefficients shows that a = r and b = 1 + r². The elements of F₂(r) can be listed as c + dr + er², where c, d, e are in F₂. There are eight elements: 0, 1, r, 1 + r, r², 1 + r², r + r² and 1 + r + r². Substituting these in x² + rx + 1 + r² we reach (r²)² + r(r²) + 1 + r² = r⁴ + r³ + 1 + r² = 0, therefore x³ + x + 1 = (x + r)(x + r²)(x + (r + r²)) for r in F₂[x]/(f(x)); E = F₂(r) is a splitting field of x³ + x + 1 over F₂.

NotesEdit

ReferencesEdit

Dummit, David S., and Foote, Richard M. (1999). Abstract Algebra (2nd ed.). New York: John Wiley & Sons, Inc. Template:Isbn.
Template:Springer
{{#invoke:Template wrapper|{{#if:|list|wrap}}|_template=cite web

|_exclude=urlname, _debug, id |url = https://mathworld.wolfram.com/{{#if:SplittingField%7CSplittingField.html}} |title = Splitting field |author = Weisstein, Eric W. |website = MathWorld |access-date = |ref = Template:SfnRef }}