Primitive element theorem

Primitive element theorem

In mathematics, more specifically in field theory, the primitive element theorem provides a characterization of the finite field extensions which are simple and thus can be generated by the adjunction of a single primitive element.

Primitive element theorem

:A field extension "L"/"K" is finite and has a primitive element if and only if there are only finitely many intermediate fields "F" with "K" ⊆ "F" ⊆ "L".

In this form, the theorem is somewhat unwieldy and rarely used. An important corollary states:Every finite separable extension "L"/"K" has a primitive element.In more concrete language, every separable extension "L"/"K" of finite degree n is generated by a single element x satisfying a polynomial equation of degree n, xn +c1xn-1+..+cn=0, with coefficients in "K". The primitive element x provides a basis [1,x,x2,...,xn-1] for "L" over "K".

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

For non-separable extensions, one can at least state the following::If the degree ["L":"K"] is a prime number, then "L"/"K" has a primitive element.

If the degree is not a prime number and the extension is not separable, one can give counterexamples. For example if "K" is "Fp"("T","U"), the field of rational functions in two indeterminates "T" and "U" over the finite field with "p" elements, and "L" is obtained from "K" by adjoining a "p"-th root of "T", and of "U", then there is no primitive element for "L" over "K". In fact one can see that for any α in "L", the element α"p" lies in "K". Therefore we have ["L":"K"] = "p"2 but there is no element of "L" with degree "p"2 over "K", as a primitive element must have.

Example

It is not, for example, immediately obvious that if one adjoins to the field Q of rational numbers roots of both polynomials

:"X"2 − 2

and

:"X"2 − 3,

say α and β respectively, to get a field "K" = Q(α, β) of degree 4 over Q, that the extension is simple and there exists a primitive element γ in "K" so that "K" = Q(γ). One can in fact check that with

:γ = α + β

the powers γ"i" for 0 ≤ "i" ≤ 3 can be written out as linear combinations of 1, α, β and αβ with integer coefficients. Taking these as a system of linear equations, or by factoring, one can solve for α and β over Q(γ), which implies that this choice of γ is indeed a primitive element in this example.

More generally, the set of all primitive elements for a finite separable extension L/K is the complement of a finite collection of proper subspaces of L.

See also

* Primitive element (finite field)

References


Wikimedia Foundation. 2010.

Игры ⚽ Поможем сделать НИР

Look at other dictionaries:

  • Primitive root modulo n — In modular arithmetic, a branch of number theory, a primitive root modulo n is any number g with the property that any number coprime to n is congruent to a power of g (mod n ). That is, if g is a primitive root (mod n ) and gcd( a , n ) = 1,… …   Wikipedia

  • Fundamental theorem of Galois theory — In mathematics, the fundamental theorem of Galois theory is a result that describes the structure of certain types of field extensions.In its most basic form, the theorem asserts that given a field extension E / F which is finite and Galois,… …   Wikipedia

  • Théorème de l'élément primitif — En mathématiques, et plus spécifiquement en algèbre, le théorème de l élément primitif est un des théorèmes de base de la théorie des extensions finies de corps. Il stipule que toute extension finie séparable est simple, c est à dire engendré par …   Wikipédia en Français

  • Dirichlet's unit theorem — In mathematics, Dirichlet s unit theorem is a basic result in algebraic number theory due to Gustav Lejeune Dirichlet.[1] It determines the rank of the group of units in the ring OK of algebraic integers of a number field K. The regulator is a… …   Wikipedia

  • Element (mathematics) — In mathematics, an element or member of a set is any one of the distinct objects that make up that set. Contents 1 Sets 2 Notation and terminology 3 Cardinality of sets 4 Exampl …   Wikipedia

  • Theorem — The Pythagorean theorem has at least 370 known proofs[1] In mathematics, a theorem is a statement that has been proven on the basis of previously established statements, such as other theorems, and previously accepted statements …   Wikipedia

  • Primitive recursive function — The primitive recursive functions are defined using primitive recursion and composition as central operations and are a strict subset of the recursive functions (recursive functions are also known as computable functions). The term was coined by… …   Wikipedia

  • Compact element — In the mathematical area of order theory, the compact or finite elements of a partially ordered set are those elements that cannot be subsumed by a supremum of any non empty directed set that does not already contain members above the compact… …   Wikipedia

  • Perron–Frobenius theorem — In linear algebra, the Perron–Frobenius theorem, proved by Oskar Perron (1907) and Georg Frobenius (1912), asserts that a real square matrix with positive entries has a unique largest real eigenvalue and that the corresponding… …   Wikipedia

  • Hales–Jewett theorem — In mathematics, the Hales–Jewett theorem is a fundamental combinatorial result of Ramsey theory, concerning the degree to which high dimensional objects must necessarily exhibit some combinatorial structure; it is impossible for such objects to… …   Wikipedia

Share the article and excerpts

Direct link
… Do a right-click on the link above
and select “Copy Link”