Separable polynomials have distinct roots
A polynomial is separable iff it has no repeated roots in an algebraic closure (equivalently gcd(f,f')=1).
Let be a field and be nonzero. In an algebraic closure , the following are equivalent:
- has no repeated roots in , i.e. every root occurs with multiplicity .
- in , where is the formal derivative.
- In the splitting field of over , the polynomial factors as a product of distinct linear factors.
When these conditions hold, is called separable. In particular, an algebraic element is separable over precisely when its minimal polynomial (over ) has distinct roots in .
Remarks
A useful characteristic- test: if , then iff for some ; in that case cannot be separable unless .
Examples
- Characteristic : always distinct for irreducibles. Over , has derivative , and , so its three complex roots are distinct in its splitting field.
- A purely inseparable example. Over , the polynomial satisfies . In , it has a single root with multiplicity , so is not separable and is not a separable element over .
- A separable polynomial in characteristic . Over , has derivative , hence . It splits as with distinct roots (indeed it cuts out the prime field).