Field theory and polynomials Definition
Separable polynomial
Builds on Formal derivative
Definition
Let be a commutative ring and let . The polynomial is separable if there are with , where is the formal derivative of .
Remarks
Over a field , is separable if and only if has no repeated root in an algebraic closure of . The polynomial is separable over , because and . Over , the irreducible polynomial is not separable, because its derivative is . Some older texts call an irreducible polynomial separable when it has distinct roots, and extend this to other polynomials factor by factor.
Reading path
To understand this page from the ground up, read these 5 pages in order. The foundations come first.
Show the path as a graph
- no evidence level
- Group concept
- Ring definition
- Polynomial ring definition
- Formal derivative definition
- Separable polynomial definition
Where this leads
26 pages build on this one.
- Order of the Galois group of a Galois extension equals its degree
- Galois extension
- Separable extension
- Primitive element theorem
- Fundamental theorem of Galois theory
- Grothendieck's Galois theory
- Artin–Schreier theory
- Galois theory
- Separably closed field
- Krasner's lemma
- Separable closure
- Galois group of a finite field extension
- Perfect field
- Infinite Galois theory
- Characterizations of Galois extensions
- Cyclic extension
- Normal basis theorem
- Separably generated extension
- Shafarevich's theorem on solvable Galois groups
- Abelian extension
- Étale fundamental group
- Krull topology
- Perfect closure
- Artin's theorem on fixed fields
- Hilbert's Theorem 90
- Inverse Galois problem
Further reading
- Web https://en.wikipedia.org/wiki/Separable_polynomial, lead section
About this page
| Tag | 03J8BS7FMV |
|---|---|
| URI | m2://03J8BS7FMV |
| Kind | definition |
| Writing | W1 stated |
| MSC | 12F10 |
| Defines | Separable polynomial |
| Uses | Formal derivative |
Markdown · JSON · Edit on GitHub
What this page needs for W2
- edge instance_of in: one example (0 of 1)
- edge not_instance_of in: one non-example that fails one clause (0 of 1)
The writing levels say how complete the text of a page is. They do not measure its truth.