Splitting field

From Wikipedia, the free encyclopedia

This is an old revision of this page, as edited by Bender2k14 (talk | contribs) at 21:48, 17 May 2011 (merge content from Construction of splitting fields). The present address (URL) is a permanent link to this revision, which may differ significantly from the current revision.

In abstract algebra, a splitting field of a polynomial with coefficients in a field is a smallest field extension of that field over which the polynomial factors (or "splits", hence the name) into linear factors.

Definition

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

and such that the coefficients 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 to be the Galois group of p (if we assume it is separable).

Facts

An extension L which is a splitting field for multiple polynomials p(X) over K is called a normal extension.

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 automatic. On the other hand, the existence of algebraic closures in general is usually proved by 'passing to the limit' from the splitting field result; which is therefore proved directly 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, have no roots such as over , the real numbers. 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(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 sequence of fields such that is an extension of 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 are given as follows:

  • Factorize p(X) over into irreducible factors .
  • Choose any nonlinear irreducible factor .
  • Construct the field extension of as the quotient ring where (f(X)) denotes the ideal in generated by f(X)
  • Repeat the process for until p(X) completely factors.

The irreducible factor 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 and hence 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(X) and of p(X).

The degree of a single extension is equal to the degree of the irreducible factor f(X). The degree of the extension [K : F] is given by and is at most n!.

The Field

As mentioned above, the quotient ring is a field when f(X) is irreducible. Its elements are of the form where the are in and . (If one considers as a vector space over then the powers for 1 ≤ jn−1 form a basis.)

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

The remainder r(X) can be computed through long division of polynomials, however there is also a straightforward reduction rule that can be used to compute directly. First let . (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 . If the product has a term with mn it can be reduced as follows:

.

As an example of the reduction rule, take , the ring of polynomials with rational coefficients, and take . Let and be two elements of . The reduction rule given by f(X) is so

Examples

If K is the rational number field Q and

p(X) = X3 − 2,

then a splitting field L will contain a primitive cube root of unity, as well as a cube root of 2. Thus

where

,
, and

are the cubic roots of unity.

Constructing a field isomorphic to the complexes

Let . Then , where X is the equivalence class of X modulo f, has:

  • elements: ;
  • addition: ;
  • multiplication: .

Exchanging i for X recovers the field of complex numbers, which shows that is isomorphic to .

Other examples

  • A splitting field of over is ; as 7 is not equivalent to 1 (mod 4), −1 has no square root over .[1]
  • The splitting field of over is since already factors into linear factors.

See also

References

  • Dummit, David S., and Foote, Richard M. (1999). Abstract Algebra (2nd ed.). New York: John Wiley & Sons, Inc. ISBN 0-471-36857-1.
  • Weisstein, Eric W. "Splitting field". MathWorld.