## You are here

Homeminimal polynomial

## Primary tabs

# minimal polynomial

Let $K/F$ be a field extension and $\kappa\in K$ be algebraic over $F$. The *minimal polynomial for $\kappa$ over $F$* is a monic polynomial $m(x)\in F[x]$ such that $m(\kappa)=0$ and, for any other polynomial $f(x)\in F[x]$ with $f(\kappa)=0$, $m$ divides $f$. Note that, for any element $\kappa$ that is algebraic over $F$, a minimal polynomial exists; moreover, because of the monic condition, it exists uniquely.

Given $\kappa\in K$, a polynomial $m$ is the minimal polynomial of $\kappa$ if and only if $m(\kappa)=0$ and $m$ is both monic and irreducible.

Related:

DegreeOfAnAlgebraicNumber

Type of Math Object:

Definition

Major Section:

Reference

## Mathematics Subject Classification

11C08*no label found*11R04

*no label found*12F05

*no label found*12E05

*no label found*

- Forums
- Planetary Bugs
- HS/Secondary
- University/Tertiary
- Graduate/Advanced
- Industry/Practice
- Research Topics
- LaTeX help
- Math Comptetitions
- Math History
- Math Humor
- PlanetMath Comments
- PlanetMath System Updates and News
- PlanetMath help
- PlanetMath.ORG
- Strategic Communications Development
- The Math Pub
- Testing messages (ignore)

- Other useful stuff

## Recent Activity

Sep 17

new question: numerical method (implicit) for nonlinear pde by roozbe

new question: Harshad Number by pspss

Sep 14

new problem: Geometry by parag

Aug 24

new question: Scheduling Algorithm by ncovella

new question: Scheduling Algorithm by ncovella

new question: numerical method (implicit) for nonlinear pde by roozbe

new question: Harshad Number by pspss

Sep 14

new problem: Geometry by parag

Aug 24

new question: Scheduling Algorithm by ncovella

new question: Scheduling Algorithm by ncovella