Splitting field

Last updated

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.

Contents

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

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 (if we assume it is separable).

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

Properties

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 closureL 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 fields

Motivation

Finding roots of polynomials has been an important problem since the time of the ancient Greeks. Some polynomials, however, such as x2 + 1 over R, 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(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 such that Ki is an extension of Ki−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 Ki are given as follows:

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 Ki[X] and Ki[X] / (f(X)) is, in fact, a field. Moreover, if we let 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 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 Ki[X]/(f(X))

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

where the cj are in Ki and α = π(X). (If one considers Ki+1 as a vector space over Ki then the powers αj for 0 ≤ jn−1 form a basis.)

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(X). That is, for g(α) and h(α) in Ki+1 their product is g(α)h(α) = r(α) where r(X) is the remainder of g(X)h(X) when divided by f(X) in Ki[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

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 g(α)h(α) has a term αm with mn it can be reduced as follows:

.

As an example of the reduction rule, take Ki = Q[X], the ring of polynomials with rational coefficients, and take f(X) = X7 − 2. Let and h(α) = α3 +1 be two elements of Q[X]/(X7 − 2). The reduction rule given by f(X) is α7 = 2 so

Examples

The complex numbers

Consider the polynomial ring R[x], and the irreducible polynomial x2 + 1. The quotient ring R[x]/(x2 + 1) is given by the congruence x2 ≡ −1. As a result, the elements (or equivalence classes) of R[x]/(x2 + 1) are of the form a + bx where a and b belong to R. To see this, note that since x2 ≡ −1 it follows that x3 ≡ −x, x4 ≡ 1, x5x, etc.; and so, for example p + qx + rx2 + sx3p + qx + r(−1) + s(−x) = (pr) + (qs)x.

The addition and multiplication operations are given by firstly using ordinary polynomial addition and multiplication, but then reducing modulo x2 + 1, i.e. using the fact that x2 ≡ −1, x3 ≡ −x, x4 ≡ 1, x5x, etc. Thus:

If we identify a + bx with (a,b) then we see that addition and multiplication are given by

We claim that, as a field, the quotient ring R[x] / (x2 + 1) is isomorphic to the complex numbers, C. A general complex number is of the form a + bi, where a and b are real numbers and i2 = −1. Addition and multiplication are given by

If we identify a + bi 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 R[x]/(x2 + 1) and C. In fact, we see that the map between R[x]/(x2 + 1) and C given by a + bxa + bi is a homomorphism with respect to addition and multiplication. It is also obvious that the map a + bxa + bi is both injective and surjective; meaning that a + bxa + bi is a bijective homomorphism, i.e., an isomorphism. It follows that, as claimed: R[x]/(x2 + 1) ≅ C.

In 1847, Cauchy used this approach to define the complex numbers. [1]

Cubic example

Let K be the rational number field Q and p(x) = x3 − 2. Each root of p equals 32 times a cube root of unity. Therefore, if we denote the cube roots of unity by

any field containing two distinct roots of p will contain the quotient between two distinct cube roots of unity. Such a quotient is a primitive cube root of unity—either or . It follows that a splitting field L of p will contain ω2, as well as the real cube root of 2; conversely, any extension of Q containing these elements contains all the roots of p. 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 (any) 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

Notes

  1. Cauchy, Augustin-Louis (1847), "Mémoire sur la théorie des équivalences algébriques, substituée à la théorie des imaginaires", Comptes Rendus Hebdomadaires des Séances de l'Académie des Sciences (in French), 24: 1120–1130
  2. Serre, Jean-Pierre. A Course in Arithmetic.
  3. 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 F7 is the set of classes of 0, 1, 4, and 2, which does not include the class of −1 6.

Related Research Articles

<span class="mw-page-title-main">Complex number</span> Number with a real and an imaginary part

In mathematics, a complex number is an element of a number system that extends the real numbers with a specific element denoted i, called the imaginary unit and satisfying the equation ; every complex number can be expressed in the form , where a and b are real numbers. Because no real number satisfies the above equation, i was called an imaginary number by René Descartes. For the complex number ,a is called the real part, and b is called the imaginary part. The set of complex numbers is denoted by either of the symbols or C. Despite the historical nomenclature "imaginary", complex numbers are regarded in the mathematical sciences as just as "real" as the real numbers and are fundamental in many aspects of the scientific description of the natural world.

In mathematics, a finite field or Galois field is a field that contains a finite number of elements. As with any field, a finite field is a set on which the operations of multiplication, addition, subtraction and division are defined and satisfy certain basic rules. The most common examples of finite fields are given by the integers mod p when p is a prime number.

In mathematics, in the area of abstract algebra known as Galois theory, the Galois group of a certain type of field extension is a specific group associated with the field extension. The study of field extensions and their relationship to the polynomials that give rise to them via Galois groups is called Galois theory, so named in honor of Évariste Galois who first discovered them.

Reed–Solomon codes are a group of error-correcting codes that were introduced by Irving S. Reed and Gustave Solomon in 1960. They have many applications, the most prominent of which include consumer technologies such as MiniDiscs, CDs, DVDs, Blu-ray discs, QR codes, data transmission technologies such as DSL and WiMAX, broadcast systems such as satellite communications, DVB and ATSC, and storage systems such as RAID 6.

<span class="mw-page-title-main">Quantum harmonic oscillator</span> Important, well-understood quantum mechanical model

The quantum harmonic oscillator is the quantum-mechanical analog of the classical harmonic oscillator. Because an arbitrary smooth potential can usually be approximated as a harmonic potential at the vicinity of a stable equilibrium point, it is one of the most important model systems in quantum mechanics. Furthermore, it is one of the few quantum-mechanical systems for which an exact, analytical solution is known.

<span class="mw-page-title-main">Factorization</span> (Mathematical) decomposition into a product

In mathematics, factorization (or factorisation, see English spelling differences) or factoring consists of writing a number or another mathematical object as a product of several factors, usually smaller or simpler objects of the same kind. For example, 3 × 5 is an integer factorization of 15, and (x – 2)(x + 2) is a polynomial factorization of x2 – 4.

In algebraic number theory, an algebraic integer is a complex number that is integral over the integers. That is, an algebraic integer is a complex root of some monic polynomial whose coefficients are integers. The set of all algebraic integers A is closed under addition, subtraction and multiplication and therefore is a commutative subring of the complex numbers.

<span class="mw-page-title-main">Root of unity</span> Number that has an integer power equal to 1

In mathematics, a root of unity, occasionally called a de Moivre number, is any complex number that yields 1 when raised to some positive integer power n. Roots of unity are used in many branches of mathematics, and are especially important in number theory, the theory of group characters, and the discrete Fourier transform.

In mathematics, especially in the field of algebra, a polynomial ring or polynomial algebra is a ring formed from the set of polynomials in one or more indeterminates with coefficients in another ring, often a field.

In mathematics, and especially in algebraic geometry, the intersection number generalizes the intuitive notion of counting the number of times two curves intersect to higher dimensions, multiple curves, and accounting properly for tangency. One needs a definition of intersection number in order to state results like Bézout's theorem.

In mathematics, the fundamental theorem of Galois theory is a result that describes the structure of certain types of field extensions in relation to groups. It was proved by Évariste Galois in his development of Galois theory.

In the mathematical field of set theory, ordinal arithmetic describes the three usual operations on ordinal numbers: addition, multiplication, and exponentiation. Each can be defined in essentially two different ways: either by constructing an explicit well-ordered set that represents the result of the operation or by using transfinite recursion. Cantor normal form provides a standardized way of writing ordinals. In addition to these usual ordinal operations, there are also the "natural" arithmetic of ordinals and the nimber operations.

In mathematics, the resultant of two polynomials is a polynomial expression of their coefficients that is equal to zero if and only if the polynomials have a common root, or, equivalently, a common factor. In some older texts, the resultant is also called the eliminant.

In cryptography, XTR is an algorithm for public-key encryption. XTR stands for 'ECSTR', which is an abbreviation for Efficient and Compact Subgroup Trace Representation. It is a method to represent elements of a subgroup of a multiplicative group of a finite field. To do so, it uses the trace over to represent elements of a subgroup of .

In field theory, a branch of mathematics, the minimal polynomial of an element α of an extension field of a field is, roughly speaking, the polynomial of lowest degree having coefficients in the smaller field, such that α is a root of the polynomial. If the minimal polynomial of α exists, it is unique. The coefficient of the highest-degree term in the polynomial is required to be 1.

In algebra, casus irreducibilis is one of the cases that may arise in solving polynomials of degree 3 or higher with integer coefficients algebraically, i.e., by obtaining roots that are expressed with radicals. It shows that many algebraic numbers are real-valued but cannot be expressed in radicals without introducing complex numbers. The most notable occurrence of casus irreducibilis is in the case of cubic polynomials that have three real roots, which was proven by Pierre Wantzel in 1843. One can see whether a given cubic polynomial is in so-called casus irreducibilis by looking at the discriminant, via Cardano's formula.

In computational number theory, Cipolla's algorithm is a technique for solving a congruence of the form

In mathematics and computer algebra the factorization of a polynomial consists of decomposing it into a product of irreducible factors. This decomposition is theoretically possible and is unique for polynomials with coefficients in any field, but rather strong restrictions on the field of the coefficients are needed to allow the computation of the factorization by means of an algorithm. In practice, algorithms have been designed only for polynomials with coefficients in a finite field, in the field of rationals or in a finitely generated field extension of one of them.

In discrete mathematics, ideal lattices are a special class of lattices and a generalization of cyclic lattices. Ideal lattices naturally occur in many parts of number theory, but also in other areas. In particular, they have a significant place in cryptography. Micciancio defined a generalization of cyclic lattices as ideal lattices. They can be used in cryptosystems to decrease by a square root the number of parameters necessary to describe a lattice, making them more efficient. Ideal lattices are a new concept, but similar lattice classes have been used for a long time. For example, cyclic lattices, a special case of ideal lattices, are used in NTRUEncrypt and NTRUSign.

In mathematics and more specifically in field theory, a radical extension of a field K is an extension of K that is obtained by adjoining a sequence of nth roots of elements.

References