Primitive element theorem

Last updated

In field theory, the primitive element theorem states that every finite separable field extension is simple, i.e. generated by a single element. This theorem implies in particular that all algebraic number fields over the rational numbers, and all extensions in which both fields are finite, are simple.

Contents

Terminology

Let be a field extension . An element is a primitive element for if i.e. if every element of can be written as a rational function in with coefficients in . If there exists such a primitive element, then is referred to as a simple extension .

If the field extension has primitive element and is of finite degree , then every element can be written in the form

for unique coefficients . That is, the set

is a basis for E as a vector space over F. The degree n is equal to the degree of the irreducible polynomial of α over F, the unique monic of minimal degree with α as a root (a linear dependency of ).

If L is a splitting field of containing its n distinct roots , then there are n field embeddings defined by and for , and these extend to automorphisms of L in the Galois group, . Indeed, for an extension field with , an element is a primitive element if and only if has n distinct conjugates in some splitting field .

Example

If one adjoins to the rational numbers the two irrational numbers and to get the extension field of degree 4, one can show this extension is simple, meaning for a single . Taking , the powers 1, α, α2, α3 can be expanded as linear combinations of 1, , , with integer coefficients. One can solve this system of linear equations for and over , to obtain and . This shows that α is indeed a primitive element:

One may also use the following more general argument. [1] The field clearly has four field automorphisms defined by and for each choice of signs. The minimal polynomial of must have , so must have at least four distinct roots . Thus has degree at least four, and , but this is the degree of the entire field, , so .

Theorem statement

The primitive element theorem states:

Every separable field extension of finite degree is simple.

This theorem applies to algebraic number fields, i.e. finite extensions of the rational numbers Q, since Q has characteristic 0 and therefore every finite extension over Q is separable.

Using the fundamental theorem of Galois theory, the former theorem immediately follows from Steinitz's theorem.

Characteristic p

For a non-separable extension of characteristic p, there is nevertheless a primitive element provided the degree [E : F] is p: indeed, there can be no non-trivial intermediate subfields since their degrees would be factors of the prime p.

When [E : F] = p2, there may not be a primitive element (in which case there are infinitely many intermediate fields by Steinitz's theorem). The simplest example is , the field of rational functions in two indeterminates T and U over the finite field with p elements, and . In fact, for any in , the Frobenius endomorphism shows that the element lies in F , so α is a root of , and α cannot be a primitive element (of degree p2 over F), but instead F(α) is a non-trivial intermediate field.

Proof

Suppose first that is infinite. By induction, it suffices to prove that any finite extension is simple. For , suppose fails to be a primitive element, . Then , since otherwise . Consider the minimal polynomials of over , respectively , and take a splitting field containing all roots of and of . Since , there is another root , and a field automorphism which fixes and takes . We then have , and:

, and therefore .

Since there are only finitely many possibilities for and , only finitely many fail to give a primitive element . All other values give .

For the case where is finite, we simply take to be a primitive root of the finite extension field .

History

In his First Memoir of 1831, published in 1846, [2] Évariste Galois sketched a proof of the classical primitive element theorem in the case of a splitting field of a polynomial over the rational numbers. The gaps in his sketch could easily be filled [3] (as remarked by the referee Poisson) by exploiting a theorem [4] [5] of Lagrange from 1771, which Galois certainly knew. It is likely that Lagrange had already been aware of the primitive element theorem for splitting fields. [5] Galois then used this theorem heavily in his development of the Galois group. Since then it has been used in the development of Galois theory and the fundamental theorem of Galois theory.

The primitive element theorem was proved in its modern form by Ernst Steinitz, in an influential article on field theory in 1910, which also contains Steinitz's theorem; [6] Steinitz called the "classical" result Theorem of the primitive elements and his modern version Theorem of the intermediate fields.

Emil Artin reformulated Galois theory in the 1930s without relying on primitive elements. [7] [8]

Related Research Articles

In mathematics, particularly in algebra, a field extension is a pair of fields such that the operations of K are those of L restricted to K. In this case, L is an extension field of K and K is a subfield of L. For example, under the usual notions of addition and multiplication, the complex numbers are an extension field of the real numbers; the real numbers are a subfield of the complex numbers.

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.

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.

In abstract algebra, a subset of a field is algebraically independent over a subfield if the elements of do not satisfy any non-trivial polynomial equation with coefficients in .

In mathematics, a Lie algebroid is a vector bundle together with a Lie bracket on its space of sections and a vector bundle morphism , satisfying a Leibniz rule. A Lie algebroid can thus be thought of as a "many-object generalisation" of a Lie algebra.

<span class="mw-page-title-main">Lindemann–Weierstrass theorem</span> On algebraic independence of exponentials of linearly independent algebraic numbers over Q

In transcendental number theory, the Lindemann–Weierstrass theorem is a result that is very useful in establishing the transcendence of numbers. It states the following:

In mathematics, the (field) norm is a particular mapping defined in field theory, which maps elements of a larger field into a subfield.

In mathematics, the field trace is a particular function defined with respect to a finite field extension L/K, which is a K-linear map from L onto K.

In abstract algebra and number theory, Kummer theory provides a description of certain types of field extensions involving the adjunction of nth roots of elements of the base field. The theory was originally developed by Ernst Eduard Kummer around the 1840s in his pioneering work on Fermat's Last Theorem. The main statements do not depend on the nature of the field – apart from its characteristic, which should not divide the integer n – and therefore belong to abstract algebra. The theory of cyclic extensions of the field K when the characteristic of K does divide n is called Artin–Schreier theory.

In abstract algebra, a normal extension is an algebraic field extension L/K for which every irreducible polynomial over K that has a root in L splits into linear factors in L. These are one of the conditions for algebraic extensions to be a Galois extension. Bourbaki calls such an extension a quasi-Galois extension.

In mathematics, specifically the algebraic theory of fields, a normal basis is a special kind of basis for Galois extensions of finite degree, characterised as forming a single orbit for the Galois group. The normal basis theorem states that any finite Galois extension of fields has a normal basis. In algebraic number theory, the study of the more refined question of the existence of a normal integral basis is part of Galois module theory.

In abstract algebra, Hilbert's Theorem 90 (or Satz 90) is an important result on cyclic extensions of fields (or to one of its generalizations) that leads to Kummer theory. In its most basic form, it states that if L/K is an extension of fields with cyclic Galois group G = Gal(L/K) generated by an element and if is an element of L of relative norm 1, that is

In the field of mathematics, norms are defined for elements within a vector space. Specifically, when the vector space comprises matrices, such norms are referred to as matrix norms. Matrix norms differ from vector norms in that they must also interact with matrix multiplication.

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 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.

The term generalized logistic distribution is used as the name for several different families of probability distributions. For example, Johnson et al. list four forms, which are listed below.

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.

<span class="mw-page-title-main">Suffix automaton</span> Deterministic finite automaton accepting set of all suffixes of particular string

In computer science, a suffix automaton is an efficient data structure for representing the substring index of a given string which allows the storage, processing, and retrieval of compressed information about all its substrings. The suffix automaton of a string is the smallest directed acyclic graph with a dedicated initial vertex and a set of "final" vertices, such that paths from the initial vertex to final vertices represent the suffixes of the string.

This article summarizes several identities in exterior calculus.

References

  1. Lang, Serge (2002). Algebra. Graduate Texts in Mathematics. Vol. 211. New York, NY: Springer New York. p. 243. doi:10.1007/978-1-4613-0041-0. ISBN   978-1-4612-6551-1.
  2. Neumann, Peter M. (2011). The mathematical writings of Évariste Galois. Zürich: European Mathematical Society. ISBN   978-3-03719-104-0. OCLC   757486602.
  3. Tignol, Jean-Pierre (February 2016). Galois' Theory of Algebraic Equations (2 ed.). WORLD SCIENTIFIC. p. 231. doi:10.1142/9719. ISBN   978-981-4704-69-4. OCLC   1020698655.
  4. Tignol, Jean-Pierre (February 2016). Galois' Theory of Algebraic Equations (2 ed.). WORLD SCIENTIFIC. p. 135. doi:10.1142/9719. ISBN   978-981-4704-69-4. OCLC   1020698655.
  5. 1 2 Cox, David A. (2012). Galois theory (2nd ed.). Hoboken, NJ: John Wiley & Sons. p. 322. ISBN   978-1-118-21845-7. OCLC   784952441.
  6. Steinitz, Ernst (1910). "Algebraische Theorie der Körper". Journal für die reine und angewandte Mathematik (in German). 1910 (137): 167–309. doi:10.1515/crll.1910.137.167. ISSN   1435-5345. S2CID   120807300.
  7. Kleiner, Israel (2007). "§4.1 Galois theory". A History of Abstract Algebra. Springer. p. 64. ISBN   978-0-8176-4685-1.
  8. Artin, Emil (1998). Galois theory. Arthur N. Milgram (Republication of the 1944 revised edition of the 1942 first publication by The University Notre Dame Press ed.). Mineola, N.Y.: Dover Publications. ISBN   0-486-62342-4. OCLC   38144376.