I didn't really study galois theory over char. p all that well the first time I studied it, so let's review.
Let J⊆K be an inclusion of fields, so K is a field extension of J.
An irreducible polynomial f∈J[x] is separable iff it has distinct roots in the algebraic closure of J, J.
Said differently, the polynomial f has no repeated roots in any extension of J.
Said differently, the polynomial f has distinct roots in its splitting field over J. The roots as separable since we can separate all the roots from each other --- they are all distinct.
Said differently, the polynomial derivative f′ of f is not the zero polynomial.
§ Proof that p is not separable iff p,p′ share a root
§ Forward: p is not separable implies p,p′ do not share a root.
Let p have a repeated root α∈K. Thus p(x)≡(x−α)2g(x) in K.
Computing p′ by product rule, we see that it is p′(x)=2(x−α)g(x)+(x−α)2g′(x) which can be written as p′(x)=(x−α)(2g(x)+g′(x).
This shows that p′(x) has (x−α) as a root.
§ Backward: p,p′ share a root implies p is not separable
Let α∈K be such that p(α)=p′(α)=0.
Write p(x)≡∏i(x−ri) for roots ri∈K.
Let α=r1 [WLOG ].
We know by product rule of calculus that p′(x)≡∑i∏j=i(x−ri).
Computing p′(α)=p′(r1), only the first term survives, which is ∏j=1(ri−rj) [all other terms have an (x−r1) term which vanishes.
For this to vanish, we must have some j such that ri=rj.
This implies that p has a repeated root ri,rj and is thus not separable.
Let L/K and char(K)=0. Then we claim that L is separable.
Let f be an irreducible polynomial in K[x]. (the minimal polynomial of some element in L)
Recall that a polynomial f∈K[x] is irreducible over a field K iff it cannot be written as the product of two non-constant polynomials.
We wish to show that f is separable (has no repeated roots).
For contradiction, suppose that f has a repeated root r in the algebraic closure. so f(x)≡(x−r)2g(x) for r∈K[x], g(x)∈K[x].
Thus, f(x) and f′(x)share a common factor in K[x].
But the GCD algorithm works in K[x], thus f(x) and f′(x) share a common factor in K[x] [SID: I find this dubious! ]
Hence, this means that gcd(f,f′)∈K[x] is not a constant polynomial.
If gcd(f,f′)=f, then f can be factored, which contradicts its irreducibility.
Thus, gcd(f,f′)=f [to prevent contradiction ].
However, f′ has smaller degree than f. Thus the only way it can be divided by its GCD ( f) which has larger degree than it is if f′(x)=0.
This means (in characteristic zero) that f(x) is linear, and thus cannot have repeated roots!
That this means that f(x) is zero can be seen by computing te derivative. Suppose f(x)≡∑i=0naixi with an=0. Then f′(x)=∑i=1niaixi−1. Since an=0, nan=0, and thus the derivative of an nth degree polynomial is (n−1) degree.
§ All Polynomials over character 0 is separable, alternative proof.
Let f be an irreducible polynomial in K[x] (the minimal polynomial of some element in L). We claim that f is separable.
The key lemma is to show that if g is ANY polynomial which shares a root r with f, then f∣g.
Idea: since f(r)=g(r)=0, this means that (x−r) divides gcd(f,g). Thus, gcd(f,g) is non-constant.
Further, gcd(f,g)∣f since the gcd divides both its factors.
But since gcd(f,g) divides f while f is irreducible, we must have gcd(f,g) equals f.
Since gcd(f,g)=f divides g, we have f∣g.
Now, going back to our claim, let f be some irreducible in K[x]. Suppose for contradiction that f is not separable. Then f,f′ share a common root. By the above lemma, this implies that f divides f′. But this is absurd, since deg(f)>deg(f′).
Hence, no irreducible polynomial in f can share a root with its derivative, which implies f is always separable.
This breaks down for character p since f′ can simply "die out".
§ All finite field extensions over character 0 is separable
Can write any finite field extension L/K as L=K(α1,…,αn). This is the same as K(α1)(α2)…(αn).
Since separability of field extensions is transitive, and at each step, we add an element with separable minimal polynomial (all polynomials over char. 0 are separable), the full extension is separable.
§ All field extensions over character p is separable
Consider Fpm⊆Fpn.
build the "Fermat's little theorem" polynomial xpn−x=f(x).
All elements of Fpn satisfy this, thus f(x) has pn roots, which means all of its roots are distinct.
Alternatively, see that f′(x)=pnxpn−1−1=0−1=−1 so f(x) and f′(x) don't share a commmon root.
Let K be a finite separable extension of J and Ω be an arbitrary extension of J. (usually, Ω is the p-adics, J is Q, K is a number field).
Then, K⊗JΩ is a product of finite separable extensions of Ω. So K⊗JΩ≡∏iΩi, where each Ωi is a finite extension of Ω.
If α is a primitive element for the extension K (so K=J(α)), then the image of α⊗1 in Ωiis a primitive element for Ωi over Ω.
If f is the minimal poly. for α∈K over J and fi is the minimal polynomial for αi∈Ωi over Ω then f(x)=∏ifi(x).
Proof : Start with a primitive element α for K/J. Then K≃ϕJ[x]/(f(x))for f(x) the minimal polynomial of α over J. So ϕ witnesses this isomorphism.
Consider K⊗JΩ. This is isomorphic to (J[x]/(f(x)))⊗Ω. Call the map that sends the LHS to the RHS as ϕ⊗id
We claim that the ring (J[x]/(f(x)))⊗JΩ is isomorphic to Ω[x]/(f(x)). Intuition: tensoring by J doesn't do anything useful, and we can re-interpret f(x) as living in Ω(x). The isomorphism is ψ((g(x)+K(x)f(x))⊗ω)≡ω⋅g(x)+Ω[x]f(x).
Now suppose f factors as ∏ifi over Ω[x]. Since α is separable over J and Ω is an extension of J, all the fi are distinct (otherwise it contradicts separability). Thus the family of ideals {(fi)} is pairwise coprime.