← LibraryAlgebraic Numbers and Minimal PolynomialsEngineering · MathematicsLesson 276/385← PrevNext →
ArticlePublished 7 Aug 20262 min readBy Kevin Joginalgebraic numberminimal polynomialalgebraic integermonic

Number Fields and Algebraic Numbers

Algebraic Numbers and Minimal Polynomials

Algebraic numbers, minimal polynomials, algebraic integers, and the computational tests that distinguish them.

Engineering / MathematicsNumber Fields and Algebraic Numbers2 min readKV-MATH-0573

An algebraic number is a root of a non-zero polynomial with rational coefficients. The minimal polynomial is the canonical object attached to it, and nearly every computation begins by obtaining one.

Minimal polynomial

Definition
The monic rational polynomial of least degree having the number as a root. It is unique and irreducible.
Degree
The degree of the algebraic number, and the dimension of the field it generates over the rationals.
Conjugates
The other roots of the minimal polynomial. There are exactly as many as the degree, all distinct.

Algebraic integers

An algebraic integer is an algebraic number whose minimal polynomial has integer coefficients. Since the minimal polynomial is monic by definition, this is a genuine restriction.

a is an algebraic integer <=> its minimal polynomial is monic with integer coefficientsTesting this requires the minimal polynomial, not merely some polynomial satisfied.

Closure properties

Algebraic numbers form a field and algebraic integers form a ring. Both closure statements are constructive: minimal polynomials of sums and products are computed by resultants.

Constructing minimal polynomials of combinations
OperationConstruction
SumResultant eliminating one variable from the two minimal polynomials
ProductSimilar resultant construction
InverseReverse the coefficient list of the minimal polynomial
ConjugatesOther roots of the same minimal polynomial

Obtaining a minimal polynomial

From a matrix representation, the minimal polynomial is extracted from the characteristic polynomial by squarefree factorisation — see the Hessenberg method. From a numerical approximation, it can be recovered by lattice-based dependence detection, with mandatory exact verification.

Source. Henri Cohen, A Course in Computational Algebraic Number Theory, Springer GTM 138 — 4.1.1. Structural reference unverified: the source file was not available during authoring; chapter and section numbers are taken from the published edition and have not been checked against a physical copy.

Continue learning

p-adic Root Finding and Newton PolygonsArticle · MathematicsNEXT LESSON →Number Fields: Definition and Basic PropertiesArticle · MathematicsRoot Finding over the Reals and Complex NumbersArticle · MathematicsThe Standard Representation of Algebraic NumbersArticle · Mathematics