Field theory and polynomials Proposition
The minimal polynomial divides every polynomial vanishing at the element
Builds on Minimal polynomial of an algebraic elementDivision algorithm for polynomialsDivisibility in a commutative ring
Statement
Let be a field extension, let be algebraic over , and let be its minimal polynomial. For every with , the polynomial divides in .
Remarks
The proof: polynomial division gives with . Then , so by the minimality of . Equivalently, the kernel of the evaluation map , , is the ideal . If is a root of and is monic and irreducible over , then .
Reading path
To understand this page from the ground up, read these 19 pages in order. The foundations come first.
Show the path as a graph
- no evidence level
- Group concept
- Ring definition
- Commutative ring definition
- Polynomial ring definition
- Subring definition
- Unit of a ring definition
- Divisibility in a commutative ring definition
- Degree of a polynomial definition
- Polynomial evaluation definition
- Field definition
- Leading coefficient definition
- Root of a polynomial definition
- Subfield definition
- Monic polynomial definition
- Field extension definition
- Division algorithm for polynomials statement
- Algebraic element definition
- Minimal polynomial of an algebraic element definition
- The minimal polynomial divides every polynomial vanishing at the element statement
Where this leads
17 pages build on this one.
- Uniqueness of finite fields of a given order
- Uniqueness of the algebraic closure
- Galois field
- Uniqueness of splitting fields
- Impossibility of doubling the cube
- Impossibility of trisecting the angle
- Degree of a simple extension is the degree of the minimal polynomial
- The degree of a constructible number is a power of two
- Impossibility of squaring the circle
- Gauss–Wantzel theorem
- K(a) is isomorphic to K[x] modulo the minimal polynomial
- Model theory of algebraically closed fields
- Weil conjectures
- Steinitz's theorem on algebraically closed fields
- Standard conjectures on algebraic cycles
- Categorical theory
- Impossibility of the classical construction problems
Further reading
About this page
| Tag | 06K7SARZKR |
|---|---|
| URI | m2://06K7SARZKR |
| Kind | statement, proposition |
| Writing | W0 stub |
| MSC | 12F05 |
| Status | This copy of the site has no build data. Run m2 status 06K7SARZKR. |
| Uses | Minimal polynomial of an algebraic element, Division algorithm for polynomials, Divisibility in a commutative ring |
Markdown · JSON · Edit on GitHub
What this page needs for W1
- an inventory row: the row of the inventory that the node accounts for (0 of 1)
The writing levels say how complete the text of a page is. They do not measure its truth.