World Library  
Flag as Inappropriate
Email this Article

Minimal polynomial (field theory)

Article Id: WHEBN0009667106
Reproduction Date:

Title: Minimal polynomial (field theory)  
Author: World Heritage Encyclopedia
Language: English
Subject: BCH code, Minimal polynomial, Berlekamp–Massey algorithm, Reference desk/Archives/Mathematics/2015 March 8, Separable extension
Collection: Field Theory, Polynomials
Publisher: World Heritage Encyclopedia

Minimal polynomial (field theory)

In field theory, a branch of mathematics, a minimal polynomial is defined relative to a field extension E/F and an element of the extension field E. The minimal polynomial of an element, if it exists, is a member of F[x], the ring of polynomials in the variable x with coefficients in F. Given an element α of E, let Jα be the set of all polynomials f(x) in F[x] such that f(α) = 0. The element α is called a root or zero of each polynomial in Jα. The set Jα is so named because it is an ideal of F[x]. The zero polynomial, whose every coefficient is 0, is in every Jα since 0αi = 0 for all α and i. This makes the zero polynomial useless for classifying different values of α into types, so it is excepted. If there are any non-zero polynomials in Jα, then α is called an algebraic element over F, and there exists a monic polynomial of least degree in Jα. This is the minimal polynomial of α with respect to E/F. It is unique and irreducible over F. If the zero polynomial is the only member of Jα, then α is called a transcendental element over F and has no minimal polynomial with respect to E/F.

Minimal polynomials are useful for constructing and analyzing field extensions. When α is algebraic with minimal polynomial a(x), the smallest field that contains both F and α is isomorphic to the quotient ring F[x]/⟨a(x)⟩, where ⟨a(x)⟩ is the ideal of F[x] generated by a(x). Minimal polynomials are also used to define conjugate elements.


  • Definition 1
    • Uniqueness 1.1
  • Properties 2
  • Examples 3
  • References 4


Let E/F be a field extension, α an element of E, and F[x] the ring of polynomials in x over F. The minimal polynomial of α is the monic polynomial of least degree among all polynomials in F[x] having α as a root; it exists when α is algebraic over F, that is, when f(α) = 0 for some non-zero polynomial f(x) in F[x].


Let a(x) be the minimal polynomial of α with respect to E/F. The uniqueness of a(x) is established by considering the ring homomorphism subα from F[x] to E that substitutes α for x, that is, subα(f(x)) = f(α). The kernel of subα, ker(subα), is the set of all polynomials in F[x] that have α as a root. That is, ker(subα) = Jα from above. Since subα is a ring homomorphism, ker(subα) is an ideal of F[x]. Since F[x] is a principal ring whenever F is a field, there is at least one polynomial in ker(subα) that generates ker(subα). Such a polynomial will have least degree among all non-zero polynomials in ker(subα), and a(x) is taken to be the unique monic polynomial among these.


A minimal polynomial is irreducible. Let E/F be a field extension over F as above, α ∈ E, and fF[x] a minimal polynomial for α. Suppose f = gh, where g,hF[x] are of lower degree than f. Now f(α) = 0. Since fields are also integral domains, we have g(α) = 0 or h(α) = 0. This contradicts the minimality of the degree of f. Thus minimal polynomials are irreducible.


If F = Q, E = R, α = √2, then the minimal polynomial for α is a(x) = x2 − 2. The base field F is important as it determines the possibilities for the coefficients of a(x). For instance, if we take F = R, then the minimal polynomial for α = √2 is a(x) = x − √2.

If α = √2 + √3, then the minimal polynomial in Q[x] is a(x) = x4 − 10x2 + 1 = (x − √2 − √3)(x + √2 − √3)(x − √2 + √3)(x + √2 + √3).

The minimal polynomial in Q[x] of the sum of the square roots of the first n prime numbers is constructed analogously, and is called a Swinnerton-Dyer polynomial.

The minimal polynomials in Q[x] of roots of unity are the cyclotomic polynomials.


  • Weisstein, Eric W., "Algebraic Number Minimal Polynomial", MathWorld.
  • Minimal polynomial at
  • Pinter, Charles C. A Book of Abstract Algebra. Dover Books on Mathematics Series. Dover Publications, 2010, p. 270-273. ISBN 978-0-486-47417-5
This article was sourced from Creative Commons Attribution-ShareAlike License; additional terms may apply. World Heritage Encyclopedia content is assembled from numerous content providers, Open Access Publishing, and in compliance with The Fair Access to Science and Technology Research Act (FASTR), Wikimedia Foundation, Inc., Public Library of Science, The Encyclopedia of Life, Open Book Publishers (OBP), PubMed, U.S. National Library of Medicine, National Center for Biotechnology Information, U.S. National Library of Medicine, National Institutes of Health (NIH), U.S. Department of Health & Human Services, and, which sources content from all federal, state, local, tribal, and territorial government publication portals (.gov, .mil, .edu). Funding for and content contributors is made possible from the U.S. Congress, E-Government Act of 2002.
Crowd sourced content that is contributed to World Heritage Encyclopedia is peer reviewed and edited by our editorial staff to ensure quality scholarly research articles.
By using this site, you agree to the Terms of Use and Privacy Policy. World Heritage Encyclopedia™ is a registered trademark of the World Public Library Association, a non-profit organization.

Copyright © World Library Foundation. All rights reserved. eBooks from World eBook Library are sponsored by the World Library Foundation,
a 501c(4) Member's Support Non-Profit Organization, and is NOT affiliated with any governmental agency or department.