Splitting field


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 or decomposes into linear factors.

Definition

A splitting field of a polynomial p over a field K is a field extension L of K over which p factors into linear factors
where and for each we have with ai not necessarily distinct and such that the roots ai 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.

Properties

An extension L which is a splitting field for a set of polynomials p 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 a of K′.

Constructing splitting fields

Motivation

Finding roots of polynomials has been an important problem since the time of the ancient Greeks. Some polynomials, however, such as over, 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 construction

Let F be a field and p be a polynomial in the polynomial ring F of degree n. The general process for constructing K, the splitting field of p over F, is to construct a sequence of fields such that Ki is an extension of Ki−1 containing a new root of p. Since p has at most n roots the construction will require at most n extensions. The steps for constructing Ki are given as follows:
The irreducible factor fi 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 is irreducible, is a maximal ideal and hence Ki/ is, in fact, a field. Moreover, if we let be the natural projection of the ring onto its quotient then
so π is a root of f and of p.
The degree of a single extension is equal to the degree of the irreducible factor f. The degree of the extension is given by and is at most n!.

The field ''K''''i''''X''/(''f''(''X''))

As mentioned above, the quotient ring Ki+1 = Ki/ is a field when f is irreducible. Its elements are of the form
where the cj are in Ki and α = π.
The elements of Ki+1 can be considered as polynomials in α of degree less than n. Addition in Ki+1 is given by the rules for polynomial addition and multiplication is given by polynomial multiplication modulo f. That is, for g and h in Ki+1 the product g'h = r where r is the remainder of g'h divided by f in Ki.
The remainder r can be computed through long division of polynomials, however there is also a straightforward reduction rule that can be used to compute r = g'h directly. First let
The polynomial is over a field so one can take f to be monic without loss of generality. Now α is a root of f, so
If the product g'h has a term αm with it can be reduced as follows:
As an example of the reduction rule, take Ki = Q, the ring of polynomials with rational coefficients, and take f = X7 − 2. Let and h = α3 +1 be two elements of Q/. The reduction rule given by f is α7 = 2 so

Examples

The complex numbers

Consider the polynomial ring R, and the irreducible polynomial The quotient ring is given by the congruence As a result, the elements of are of the form where a and b belong to R. To see this, note that since it follows that,,, etc.; and so, for example
The addition and multiplication operations are given by firstly using ordinary polynomial addition and multiplication, but then reducing modulo, i.e. using the fact that,,,, etc. Thus:
If we identify with then we see that addition and multiplication are given by
We claim that, as a field, the quotient is isomorphic to the complex numbers, C. A general complex number is of the form, where a and b are real numbers and Addition and multiplication are given by
If we identify with then we see that addition and multiplication are given by
The previous calculations show that addition and multiplication behave the same way in and C. In fact, we see that the map between and C given by is a homomorphism with respect to addition and multiplication. It is also obvious that the map is both injective and surjective; meaning that is a bijective homomorphism, i.e. an isomorphism. It follows that, as claimed:
In 1847, Cauchy used this approach to define the complex numbers.

Cubic example

Let be the rational number field and. Each root of equals times a cube root of unity. Therefore, if we denote the cube roots of unity by
any field containing two distinct roots of will contain the quotient between two distinct cube roots of unity. Such a quotient is a primitive cube root of unity—either ω2 or. It follows that a splitting field of will contain ω2, as well as the real cube root of 2; conversely, any extension of containing these elements contains all the roots of. Thus
Note that applying the construction process outlined in the previous section to this example, one begins with and constructs the field. This field is not the splitting field, but contains one root. However, the polynomial is not irreducible over and in fact:
Note that is not an indeterminate, and is in fact an element of. Now, continuing the process, we obtain which is indeed the splitting field and is spanned by the -basis. Notice that if we compare this with from above we can identify and.

Other examples