← Back

note / modern mathematics

Session 04 — Algebraic Numbers and Minimal Polynomials

Algebraic Numbers and Minimal Polynomials

Central Question

How does one polynomial capture an algebraic element and determine the size of its field extension?

Why This Matters

Minimal polynomials connect equations to vector-space dimension, giving a structural meaning to the complexity of adjoining a number.

Mathematical Notes

The minimal polynomial contains every polynomial relation

An element α\alpha is algebraic over FF if some nonzero polynomial in F[x]F[x] vanishes at it; otherwise it is transcendental. For algebraic α\alpha, its minimal polynomial mαm_\alpha is the unique monic polynomial of least positive degree that vanishes at α\alpha.

It is irreducible: a factorization into smaller positive-degree factors would force one factor to vanish. Division by mαm_\alpha also proves

f(α)=0mαf.f(\alpha)=0\quad\Longleftrightarrow\quad m_\alpha\mid f.

Consequently,

F(α)F[x]/(mα),[F(α):F]=degmα.F(\alpha)\cong F[x]/(m_\alpha),\qquad [F(\alpha):F]=\deg m_\alpha.

If the degree is nn, the powers 1,α,,αn11,\alpha,\ldots,\alpha^{n-1} span by reduction modulo mαm_\alpha. They are independent because a dependence would be a lower-degree polynomial relation. Degree counts independent coordinates, not the number of elements in the field.

Examples with certified degrees

Element over Q\mathbb Q Minimal polynomial Degree Reason
2\sqrt2 x22x^2-2 2 No rational root
23\sqrt[3]2 x32x^3-2 3 Eisenstein at 2
24\sqrt[4]2 x42x^4-2 4 Eisenstein at 2
2+3\sqrt2+\sqrt3 x410x2+1x^4-10x^2+1 4 Generates the degree-four biquadratic field

For the last row, if β=2+3\beta=\sqrt2+\sqrt3, then β1=32\beta^{-1}=\sqrt3-\sqrt2. Thus

3=β+β12,2=ββ12.\sqrt3=\frac{\beta+\beta^{-1}}2,\qquad \sqrt2=\frac{\beta-\beta^{-1}}2.

So Q(β)=Q(2,3)\mathbb Q(\beta)=\mathbb Q(\sqrt2,\sqrt3), whose degree is established in the tower session. Squaring twice supplies the displayed quartic relation; the degree proves it is minimal.

Irreducibility tools worth retaining

For a primitive integer polynomial, Gauss's lemma equates irreducibility over Q\mathbb Q with irreducibility over Z\mathbb Z. Eisenstein applies when a prime divides every nonleading coefficient, does not divide the leading coefficient, and its square does not divide the constant coefficient. An irreducible reduction modulo a prime also certifies rational irreducibility if the degree is preserved. Reducible reduction does not prove rational reducibility.

The base field matters: 2\sqrt2 has degree two over Q\mathbb Q but degree one over Q(2)\mathbb Q(\sqrt2). If α\alpha is transcendental, evaluation embeds F[x]F[x] and extends to an isomorphism F(x)F(α)F(x)\cong F(\alpha); no finite power basis exists.

Learning Prompt

Teach algebraic versus transcendental elements as the natural next step from adjoining roots. Develop minimal polynomials and extension degree from first principles. Explain why [Q(2):Q]=2[\mathbb Q(\sqrt2):\mathbb Q]=2, then explore examples of degrees 3, 4, etc. Connect extension degree to vector spaces.

Ideas

Examples

Questions

Connections

One Thing That Surprised Me

Further Rabbit Holes

Sources

Ian Stewart, Galois Theory, fifth edition, CRC Press, §§3.2–3.5, 5.1–5.4; §6.2. Publisher and edition details.