Perfect Fields and Inseparability

Why does every extension of the rational numbers behave so well? Meanwhile, extensions of Fp(t)\mathbb{F}_p(t) can hide pathological, "unrepairable" phenomena. The answer lies in a single algebraic gadget, the Frobenius endomorphism. It also lies in a property of a field called perfection. In characteristic zero every algebraic extension is automatically separable. So the subtleties of Separable Extensions never surface. In characteristic pp, however, a polynomial can fail to have distinct roots. This can happen in a way that has nothing to do with genuine multiplicity. The derivative test itself becomes blind, because pp-th powers freeze under differentiation. This article isolates exactly which characteristic-pp fields avoid this disease. These are the perfect fields, those on which the Frobenius map x↦xpx \mapsto x^p is surjective. We show that perfection is equivalent to the total absence of inseparable irreducible polynomials. So over a perfect field, algebraic = separable. This restores the clean picture familiar from characteristic zero. We then build the general theory of inseparability for imperfect fields. This culminates in the separable/purely inseparable factorization of any algebraic extension. The stakes are high: Galois theory, in its classical form, is a theory of separable extensions. The fundamental theorem of Galois theory requires separability at its foundation. Perfect fields are precisely the fields over which this requirement is free. No hypothesis needs to be checked. Finite fields, algebraically closed fields, and all fields of characteristic zero are perfect. This is why finite-field arithmetic (a subject this discussion sets up) never needs to worry about inseparability. This holds even though it lives in positive characteristic. This article gives the full logical architecture. It covers the definition and basic properties of the Frobenius endomorphism. It covers the theorem characterizing perfect fields. It covers the structure theory of purely inseparable extensions. It also covers the separable–inseparable degree factorization [L:K]=[L:K]s[L:K]i[L:K] = [L:K]_s[L:K]_i. Each claim is proved in full. Explicit counterexamples show exactly where imperfection breaks the theory.

Key takeaways
  • The Frobenius endomorphism ϕ(x)=xp\phi(x) = x^p is a field homomorphism in characteristic pp, always injective on a field.
  • A field KK of characteristic pp is perfect if Frobenius is also surjective, i.e., every element has a pp-th root in KK.
  • Fields of characteristic 00, finite fields, and algebraically closed fields are always perfect.
  • Over a perfect field, every algebraic extension is separable — inseparability simply cannot occur.
  • Over an imperfect field, minimal polynomials of the form xp−ax^p - a with aa not a pp-th power are irreducible yet have a repeated root, giving genuinely inseparable extensions.
  • Any algebraic extension L/KL/K factors canonically through a separable part and a purely inseparable part, with degree multiplying as [L:K]=[L:K]s [L:K]i[L:K]=[L:K]_s\,[L:K]_i.
  • Key idea: perfection is exactly the condition that makes the derivative test for repeated roots reliable, so that algebraic automatically means separable.

Where this lives today

Perfect fields quietly govern which parts of Galois theory apply "for free." In arithmetic geometry, the function field Fp(t)\mathbb{F}_p(t) of the projective line over a finite field is imperfect, and inseparable extensions of it correspond geometrically to Frobenius twists and purely inseparable isogenies of algebraic curves and abelian varieties — phenomena entirely absent in characteristic 00 geometry. In cryptography, elliptic curves over finite fields Fq\mathbb{F}_q rely essentially on the perfection of Fq\mathbb{F}_q: the Frobenius endomorphism x↦xqx \mapsto x^q is a bijection, and this bijectivity underlies point-counting algorithms (Schoof's algorithm) and the structure of the endomorphism ring used in pairing-based cryptosystems. In coding theory, Reed–Solomon and BCH codes are built over finite fields, and the perfection of Fq\mathbb{F}_q guarantees that minimal polynomials of code-defining elements are separable, which is what makes the roots of generator polynomials distinct and the associated linear-algebra machinery (syndromes, error-locator polynomials) well-behaved. In algebraic geometry more broadly, the notion of a variety being smooth versus merely regular diverges precisely in the imperfect-field setting, and resolving this divergence (via notions like geometric reducedness and the Frobenius twist) is a standard technical hurdle in positive-characteristic algebraic geometry. Finally, this entire discussion is the essential preparation for Finite Fields: because every finite field is perfect, the Galois theory of finite fields is unconditionally separable, and the Frobenius automorphism (rather than merely an injective endomorphism) becomes the single generator of every Galois group Gal⁡(Fpn/Fp)\operatorname{Gal}(\mathbb{F}_{p^n}/\mathbb{F}_p).

:::quiz[Over a perfect field KK of characteristic pp, which statement is proved true for every irreducible f∈K[x]f \in K[x]?]

  • ff has degree divisible by pp
  • f′≡0f' \equiv 0 always
  • ff is inseparable whenever deg⁡f>1\deg f > 1
  • gcd⁡(f,f′)=1\gcd(f,f') = 1, so ff is separable ✓

:::quiz[For a general algebraic extension L/KL/K of finite degree in characteristic pp, the separable degree [L:K]s[L:K]_s and total degree satisfy]

  • [L:K]s=[L:K][L:K]_s = [L:K] always
  • [L:K]=[L:K]s⋅[L:K]i[L:K] = [L:K]_s \cdot [L:K]_i where [L:K]i[L:K]_i is a power of pp ✓
  • [L:K]s[L:K]_s is always a power of pp
  • [L:K]s[L:K]_s can be larger than [L:K][L:K]

Ask the tutor: How does the separable/purely-inseparable degree factorization generalize to infinite algebraic extensions, and what role does it play in defining the Galois group of an imperfect field's separable closure?

DefinitionPerfect field, Frobenius, inseparability

Let KK be a field.

Frobenius endomorphism. If char⁡(K)=p>0\operatorname{char}(K) = p > 0, the map

ϕK:K→K,ϕK(x)=xp\phi_K : K \to K, \qquad \phi_K(x) = x^p

is called the Frobenius endomorphism of KK.

Perfect field. A field KK is perfect if either char⁡(K)=0\operatorname{char}(K) = 0, or char⁡(K)=p>0\operatorname{char}(K) = p > 0 and ϕK\phi_K is surjective (equivalently, K=Kp:={xp:x∈K}K = K^p := \{x^p : x \in K\}).

Separable and inseparable polynomials. A nonconstant polynomial f∈K[x]f \in K[x] is separable if it has no repeated roots in a splitting field; otherwise it is inseparable. An irreducible polynomial ff is separable iff gcd⁡(f,f′)=1\gcd(f, f') = 1, equivalently iff f′≠0f' \neq 0.

Separable and purely inseparable elements/extensions. Let L/KL/K be an algebraic extension. An element α∈L\alpha \in L is separable over KK if its minimal polynomial over KK is separable. The element α\alpha is purely inseparable over KK if αpn∈K\alpha^{p^n} \in K for some n≥0n \geq 0 (when char⁡ K=p\operatorname{char}\, K = p; if char⁡ K=0\operatorname{char}\, K = 0 the only purely inseparable elements over KK are those of KK itself). The extension L/KL/K is separable if every element of LL is separable over KK, and purely inseparable if every element of L∖KL\setminus K is purely inseparable over KK.

Intuition — prose building the mental picture

Think of the derivative as a diagnostic tool for repeated roots: a polynomial ff has a repeated root exactly when ff and f′f' share a common root, detected by gcd⁡(f,f′)≠1\gcd(f,f') \neq 1. In characteristic 00 this test never fails silently, because the derivative of a nonconstant polynomial is never the zero polynomial (degree strictly drops, and no integer coefficient can vanish). But in characteristic pp, differentiation has a blind spot: the derivative of xpx^p is pxp−1=0p x^{p-1} = 0. More generally, any polynomial in xpx^p alone — say g(xp)g(x^p) — has zero derivative. This means the diagnostic tool can report "no repeated roots visible" even for a polynomial that factors, over an extension, as (x−α)p(x-\alpha)^p. Perfection is precisely the hypothesis that plugs this hole. If KK is perfect, one can show that no irreducible polynomial over KK can have zero derivative (because a=bpa=b^p can be absorbed as (x−b)p(x-b)^p trivially, contradicting irreducibility unless the polynomial has degree 11). So over a perfect field, the diagnostic tool for repeated roots never has a blind spot: every irreducible polynomial is automatically separable. Over an imperfect field, however, there is some element a∈Ka \in K with no pp-th root in KK, and then xp−ax^p - a is an irreducible polynomial whose derivative vanishes identically — it is inseparable, and in fact has only one root (with multiplicity pp) in its splitting field. Picture the "pp-th power map" as folding the field onto a sub-copy of itself. Perfection says this fold is actually a bijection: nothing is missed. Imperfection means the image KpK^p is a proper subfield, and the "missing" elements outside KpK^p are exactly the raw material for building inseparable, and purely inseparable, extensions.

Figure
The Frobenius map on a perfect vs. an imperfect field
Perfect field K (e.g. 𝔽_p) K = K^p φ: x ↦ x^p is a bijection K → K Imperfect field K = 𝔽_p(t) K^p = 𝔽_p(t^p) t ∉ K^p φ: K → K^p is a proper-image injection
TheoremCharacterization of perfect fields

Let KK be a field. Then KK is perfect if and only if every irreducible polynomial in K[x]K[x] is separable, equivalently if and only if every algebraic extension of KK is separable.

LemmaFrobenius is a field homomorphism, injective on a field

Let KK be a field with char⁡(K)=p>0\operatorname{char}(K) = p > 0. Then ϕK(x)=xp\phi_K(x) = x^p is a ring homomorphism K→KK \to K, and it is injective.

Proof

Additivity. By the Freshman's Dream, for x,y∈Kx, y \in K,

(x+y)p=∑k=0p(pk)xkyp−k.(x+y)^p = \sum_{k=0}^p \binom{p}{k} x^k y^{p-k}.

For 0<k<p0 < k < p, the binomial coefficient (pk)=p!k!(p−k)!\binom{p}{k} = \frac{p!}{k!(p-k)!} has pp dividing the numerator but not k!(p−k)!k!(p-k)! (since k,p−k<pk, p-k < p and pp is prime), so p∣(pk)p \mid \binom{p}{k}. As char⁡(K)=p\operatorname{char}(K) = p, all middle terms vanish in KK, leaving (x+y)p=xp+yp(x+y)^p = x^p + y^p.

Multiplicativity. (xy)p=xpyp(xy)^p = x^p y^p holds in any commutative ring, from commutativity and associativity of multiplication.

Unit. ϕK(1)=1p=1\phi_K(1) = 1^p = 1. Thus ϕK\phi_K is a ring homomorphism. Any ring homomorphism between fields is injective: its kernel is an ideal of the field KK, and the only ideals of a field are (0)(0) and KK itself; since ϕK(1)=1≠0\phi_K(1) = 1 \ne 0, the kernel is not all of KK, so the kernel is (0)(0).

∎
Proof

We prove the main theorem in both directions.

(⇒\Rightarrow) Suppose KK is perfect. If char⁡(K)=0\operatorname{char}(K) = 0 every irreducible polynomial is automatically separable: if f∈K[x]f \in K[x] is irreducible of degree n≥1n \geq 1 and f′≡0f' \equiv 0, then since char⁡=0\operatorname{char} = 0 each coefficient of f′f' is an integer multiple of the corresponding coefficient of ff times a nonzero integer power, forcing ff to be constant, a degree-00 polynomial — contradicting n≥1n \geq 1. (Concretely, if f=∑aixif = \sum a_i x^i then f′=∑iaixi−1f' = \sum i a_i x^{i-1}; in characteristic 00, iai=0  ⟺  ai=0i a_i = 0 \iff a_i = 0 for i≥1i \geq 1, so f′≡0f'\equiv 0 forces ff constant.) So assume char⁡(K)=p>0\operatorname{char}(K) = p > 0 and KK is perfect, i.e. K=KpK = K^p. Let f∈K[x]f \in K[x] be irreducible and suppose, for contradiction, that ff is inseparable, i.e. f′≡0f' \equiv 0. Write f=∑i=0naixif = \sum_{i=0}^n a_i x^i. Then f′=∑i=1niaixi−1=0f' = \sum_{i=1}^n i a_i x^{i-1} = 0 forces iai=0i a_i = 0 in KK for every i≥1i \geq 1; since char⁡(K)=p\operatorname{char}(K) = p, this means ai=0a_i = 0 whenever p∤ip \nmid i. Hence ff involves only powers of xpx^p:

f(x)=∑j=0mbj(xp)j=g(xp),bj:=ajp.f(x) = \sum_{j=0}^m b_j (x^p)^j = g(x^p), \qquad b_j := a_{jp}.

Since KK is perfect, each bjb_j has a pp-th root cj∈Kc_j \in K (i.e. cjp=bjc_j^p = b_j). Using the Lemma (Frobenius is a homomorphism) applied inductively, for any elements of KK we have (∑cjxj)p=∑cjpxjp=∑bjxjp=f(x)(\sum c_j x^j)^p = \sum c_j^p x^{jp} = \sum b_j x^{jp} = f(x). Hence

f(x)=(∑j=0mcjxj)p=h(x)p,h(x):=∑j=0mcjxj∈K[x].f(x) = \left( \sum_{j=0}^m c_j x^j \right)^p = h(x)^p, \qquad h(x) := \sum_{j=0}^m c_j x^j \in K[x].

If m≥1m \geq 1, i.e. ff is nonconstant of degree n=mp≥p≥2n = mp \geq p \geq 2, then f=hpf = h^p is a nontrivial factorization in K[x]K[x] (since deg⁡h=m≥1\deg h = m \geq 1 and p≥2p \geq 2, both factors are nonconstant), contradicting irreducibility of ff unless m=0m = 0. But m=0m=0 means ff is a nonzero constant, contradicting that ff is a nonconstant irreducible polynomial to begin with. This contradiction shows f′≢0f' \not\equiv 0, so gcd⁡(f,f′)\gcd(f,f') (a proper divisor of the irreducible ff, since deg⁡f′<deg⁡f\deg f' < \deg f and f′≠0f' \neq 0) must be 11 — that is, ff is separable. Since every irreducible polynomial over KK is separable, every algebraic extension L/KL/K is separable: every α∈L\alpha \in L has minimal polynomial over KK separable by the above, so α\alpha is separable over KK, and this holds for every element of LL.

(⇐\Leftarrow) Suppose every irreducible polynomial in K[x]K[x] is separable. If char⁡(K)=0\operatorname{char}(K)=0 there is nothing to prove (KK is perfect by definition). Suppose char⁡(K)=p>0\operatorname{char}(K) = p > 0 and, for contradiction, KK is not perfect: there exists a∈K∖Kpa \in K \setminus K^p. Consider f(x)=xp−a∈K[x]f(x) = x^p - a \in K[x]. Claim: ff is irreducible over KK. Let α\alpha be a root of ff in an algebraic closure K‾\overline{K}, so αp=a\alpha^p = a. In K‾[x]\overline{K}[x],

xp−a=xp−αp=(x−α)p,x^p - a = x^p - \alpha^p = (x - \alpha)^p,

using the Frobenius identity (x−α)p=xp−αp(x-\alpha)^p = x^p - \alpha^p in characteristic pp (apply the Lemma's additivity to x+(−α)x + (-\alpha), noting (−α)p=−αp(-\alpha)^p = -\alpha^p since pp is odd or, for p=2p=2, −1=1-1=1). So every monic factor of ff in K[x]K[x] has the form (x−α)k(x-\alpha)^k for some 0≤k≤p0 \le k \le p, and such a factor lies in K[x]K[x] iff its constant term ±αk∈K\pm\alpha^k \in K. If 1≤k≤p−11 \le k \le p-1, then since gcd⁡(k,p)=1\gcd(k,p)=1 there exist integers u,vu,v with uk+vp=1uk + vp = 1; then α=αuk+vp=(αk)u(αp)v=(αk)uav\alpha = \alpha^{uk+vp} = (\alpha^k)^u (\alpha^p)^v = (\alpha^k)^u a^v. If αk∈K\alpha^k \in K, this expresses α∈K\alpha \in K, so αp=a\alpha^p = a would be a pp-th power in KK, contradicting a∉Kpa \notin K^p. Hence no proper monic factor (x−α)k(x-\alpha)^k, 1≤k≤p−11\le k \le p-1, lies in K[x]K[x], and ff is irreducible over KK. But f(x)=(x−α)pf(x) = (x-\alpha)^p has the single root α\alpha with multiplicity p≥2p \geq 2, so ff is inseparable — contradicting the hypothesis that every irreducible polynomial over KK is separable. Hence no such aa exists, i.e. K=KpK = K^p, so KK is perfect. This proves the equivalence: KK perfect   ⟺  \iff every irreducible over KK is separable   ⟺  \iff every algebraic extension of KK is separable (the last equivalence following since if some algebraic extension were inseparable it would contain an element with inseparable minimal polynomial, and conversely an inseparable irreducible polynomial generates an inseparable simple extension).

∎
CorollaryFinite fields are perfect

Every finite field K=FqK = \mathbb{F}_q (q=pnq = p^n) is perfect.

Proof

By the Lemma, ϕK:K→K\phi_K : K \to K is injective. Since KK is finite, an injective self-map of a finite set is automatically surjective (pigeonhole). Hence ϕK\phi_K is bijective, so K=KpK = K^p, and KK is perfect by definition.

∎
CorollaryAlgebraically closed fields are perfect

Every algebraically closed field KK is perfect.

Proof

If char⁡(K)=0\operatorname{char}(K) = 0 this is immediate. If char⁡(K)=p>0\operatorname{char}(K) = p > 0, let a∈Ka \in K. Since KK is algebraically closed, xp−ax^p - a has a root b∈Kb \in K, so bp=ab^p = a, i.e. a∈Kpa \in K^p. As aa was arbitrary, K=KpK = K^p.

∎

Worked examples

Example 1: An explicit inseparable extension over Fp(t)\mathbb{F}_p(t). Let K=F2(t)K = \mathbb{F}_2(t), the field of rational functions in one variable tt over F2\mathbb{F}_2. This field is not perfect: consider a=t∈Ka = t \in K. Suppose t=c2t = c^2 for some c=f(t)/g(t)∈Kc = f(t)/g(t) \in K with f,g∈F2[t]f,g \in \mathbb{F}_2[t] coprime. Then tg(t)2=f(t)2t g(t)^2 = f(t)^2. Comparing degrees, deg⁡f=deg⁡g+12\deg f = \deg g + \tfrac12, impossible for integers unless we track it via the degree of tt carefully: write deg⁡(tg2)=1+2deg⁡g\deg(t g^2) = 1 + 2\deg g, which is odd, while deg⁡(f2)=2deg⁡f\deg(f^2) = 2\deg f is even. An odd number cannot equal an even number, so no such cc exists. Hence t∉K2t \notin K^2, confirming KK is imperfect. Now let L=K(α)L = K(\alpha) where α2=t\alpha^2 = t, i.e. α=t\alpha = \sqrt{t} in a splitting field. By the theorem's proof (the irreducibility argument for xp−ax^p - a), f(x)=x2−tf(x) = x^2 - t is irreducible over KK, since t∉K2t \notin K^2. So [L:K]=2[L:K] = 2, and

x2−t=x2−α2=(x−α)2in L[x],x^2 - t = x^2 - \alpha^2 = (x - \alpha)^2 \quad \text{in } L[x],

using char 22, so (−α)=α(-\alpha)=\alpha. Thus α\alpha is the only root of its minimal polynomial, with multiplicity 22: the extension L/KL/K is purely inseparable of degree 22. Note also L=F2(α)=F2(t1/2)L = \mathbb{F}_2(\alpha) = \mathbb{F}_2(t^{1/2}), and indeed L2=F2(t)=K⊊LL^2 = \mathbb{F}_2(t) = K \subsetneq L, so LL itself is still imperfect — inseparability, once introduced, does not "heal" automatically; extracting one pp-th root does not make the field perfect (there remain infinitely many other elements without pp-th roots, e.g. t1/2+1t^{1/2}+1, etc., and α\alpha itself has no square root in LL unless t1/4t^{1/4} is adjoined). The Galois-theoretic pathology is visible directly: Aut⁡(L/K)\operatorname{Aut}(L/K) is trivial (any KK-automorphism of LL must send α\alpha to a root of x2−tx^2 - t in LL, and the only root in LL is α\alpha itself, since the polynomial factors as (x−α)2(x-\alpha)^2 with no other root), yet [L:K]=2>1=∣Aut⁡(L/K)∣[L:K] = 2 > 1 = |\operatorname{Aut}(L/K)|. This is the signature failure mode that separability rules out: for separable extensions the count of KK-embeddings into an algebraic closure equals the degree, but here it collapses to 11.

Example 2: Mixed separable/inseparable degree computation. Let K=F3(t)K = \mathbb{F}_3(t), and let L=K(β,γ)L = K(\beta, \gamma) where β\beta is a root of x3−tx^3 - t (so β3=t\beta^3 = t, purely inseparable generator) and γ\gamma is a root of x2−tx^2 - t over K(β)K(\beta) — but we should be careful: we want a genuinely mixed example, so instead take γ2−γ−t=0\gamma^2 - \gamma - t = 0, i.e. adjoin a root of the separable Artin–Schreier-type polynomial g(x)=x2−x−tg(x) = x^2 - x - t over K(β)K(\beta). Step 1: [K(β):K]=3[K(\beta):K] = 3. As in Example 1, t∉K3t \notin K^3 (an analogous degree-parity argument: if t=c3t = c^3 with c=f/gc=f/g in lowest terms, then deg⁡(t g3)=1+3deg⁡g≢0(mod3)\deg(t\,g^3)=1+3\deg g \not\equiv 0 \pmod 3 while deg⁡(f3)=3deg⁡f≡0(mod3)\deg(f^3) = 3\deg f \equiv 0\pmod 3, contradiction), so x3−tx^3 - t is irreducible over KK by the same argument as before (using gcd⁡(k,3)=1\gcd(k,3)=1 for 1≤k≤21\le k\le 2), giving degree 33, and this extension is purely inseparable since x3−t=(x−β)3x^3-t=(x-\beta)^3 in the splitting field (char 33). Step 2: g(x)=x2−x−t∈K(β)[x]g(x) = x^2 - x - t \in K(\beta)[x]. Compute g′(x)=2x−1g'(x) = 2x - 1, which is not identically zero (coefficient 2=−1≠02 = -1 \neq 0 in F3\mathbb{F}_3). Since gg has degree 22, if gg is irreducible over K(β)K(\beta) then gcd⁡(g,g′)=1\gcd(g,g')=1 automatically forces separability (as g′≢0g'\not\equiv 0 and deg⁡g′<deg⁡g\deg g' <\deg g, a common irreducible factor of g,g′g,g' would have to be gg itself dividing g′g', impossible by degree). Is gg irreducible over K(β)=F3(β)K(\beta) = \mathbb{F}_3(\beta) (note K(β)=F3(t1/3)=F3(β)K(\beta) = \mathbb{F}_3(t^{1/3}) = \mathbb{F}_3(\beta) since t=β3t = \beta^3)? A root of gg would need to lie in F3(β)\mathbb{F}_3(\beta); a short valuation argument at the place β=0\beta=0 (i.e. t=0t=0) shows t=β3t = \beta^3 has odd "type" incompatible with x2−x−tx^2-x-t having a root that's a rational function of β\beta of the required pole order — concretely, if γ=h(β)∈F3(β)\gamma = h(\beta) \in \mathbb{F}_3(\beta) solved γ2−γ=β3\gamma^2-\gamma = \beta^3, comparing pole orders at β=∞\beta=\infty forces deg⁡h=3/2\deg h = 3/2, again not an integer. So gg is irreducible over K(β)K(\beta), and by the degree-22 argument above it is separable. Hence [L:K(β)]=2[L : K(\beta)] = 2, separable. By the tower law, [L:K]=[L:K(β)] [K(β):K]=2⋅3=6[L:K] = [L:K(\beta)]\,[K(\beta):K] = 2 \cdot 3 = 6. The separable degree [L:K]s[L:K]_s (the number of KK-embeddings of LL into an algebraic closure K‾\overline K, equivalently the degree of the maximal separable subextension) is 22, since β\beta contributes purely inseparably (only one embedding possible, sending β↦β\beta \mapsto \beta as it's the unique root of x3−tx^3-t) while γ\gamma contributes separably (two embeddings, corresponding to the two roots of gg over K(β)K(\beta)). The inseparable degree is [L:K]i=[L:K]/[L:K]s=6/2=3[L:K]_i = [L:K]/[L:K]_s = 6/2 = 3. This matches the general theorem that [L:K]=[L:K]s[L:K]i[L:K]=[L:K]_s[L:K]_i with [L:K]i[L:K]_i a power of p=3p=3.

CounterexampleDropping perfection: irreducibility does not imply separability

The theorem shows perfection of KK is exactly what guarantees every irreducible polynomial over KK is separable. Drop perfection and this fails immediately, as already exhibited: over K=Fp(t)K = \mathbb{F}_p(t), the polynomial

f(x)=xp−t∈K[x]f(x) = x^p - t \in K[x]

is irreducible (shown above via the coprime-fraction degree argument) but inseparable, since f′(x)=pxp−1=0f'(x) = px^{p-1} = 0 identically in characteristic pp, and indeed f(x)=(x−t1/p)pf(x) = (x - t^{1/p})^p in a splitting field — a single root of multiplicity pp. Thus the hypothesis "KK perfect" cannot be weakened: for imperfect KK there always exists such an irreducible-but-inseparable polynomial (take any a∈K∖Kpa \in K \setminus K^p, which exists by definition of imperfect, and set f=xp−af = x^p - a). This also shows the Galois correspondence's basic counting principle — degree equals number of embeddings — genuinely requires separability, since for this ff, the field K(t1/p)K(t^{1/p}) admits only one KK-embedding into any extension (sending t1/pt^{1/p} to the unique root of ff), while [K(t1/p):K]=p>1[K(t^{1/p}):K] = p > 1.

Scope, edge cases & common traps

SituationWhat holdsWhat can fail
char⁡(K)=0\operatorname{char}(K) = 0KK automatically perfect; all algebraic extensions separableNothing — no inseparability phenomena exist
KK finitePerfect (Frobenius injective + finite ⇒\Rightarrow bijective)—
KK algebraically closedPerfect—
K=Fp(t)K = \mathbb{F}_p(t), function fieldImperfect: t∉Kpt \notin K^pIrreducible polynomials can be inseparable (xp−tx^p-t)
L/KL/K algebraic, KK imperfectLL may still be separable over KK (e.g. K(2t)K(\sqrt{2t}) type separable elements exist too)Perfection of KK is sufficient, not necessary, for a given extension to be separable
LL purely inseparable over imperfect KK[L:K][L:K] is a power of pp; unique KK-embedding into K‾\overline KNaive degree-counts of embeddings fail badly

The mathematician behind it

Origins · 1 minErnst Steinitz and how this was discovered
ES
Ernst Steinitz
1871–1928 · Foundations of abstract field theory, Breslau and Berlin

Ernst Steinitz was a German mathematician whose 1910 paper Algebraische Theorie der Körper essentially founded the abstract theory of fields as an independent subject, systematically treating characteristic, prime fields, algebraic and transcendental extensions, and — crucially for this article — the distinction between perfect ("vollkommen") and imperfect fields. Before Steinitz, field theory existed mainly as a tool embedded inside classical Galois theory over Q\mathbb{Q} or C\mathbb{C}; Steinitz asked what remains true for an arbitrary field, and in doing so isolated exactly the hypotheses (like perfection) that later became standard structural assumptions throughout algebra.

History
- 1893 — Steinitz begins doctoral studies in Breslau, later working under Ferdinand Georg Frobenius's circle of influence in Berlin, where the endomorphism x↦xpx\mapsto x^p that bears Frobenius's name becomes central to characteristic-pp arithmetic.
- 1910 — Steinitz publishes Algebraische Theorie der Körper in Crelle's Journal, introducing the general axiomatic notion of a field, defining perfect (vollkommen) fields, and proving that algebraic extensions of perfect fields are separable.
- 1920s — Emil Artin and collaborators, building on Steinitz, integrate the perfect/imperfect dichotomy into the modern Galois-theoretic framework, clarifying the separable/purely-inseparable factorization of extensions.
- 1930 — Bartel van der Waerden's Moderne Algebra textbook popularizes Steinitz's field-theoretic framework, cementing "perfect field" as standard terminology across the discipline.
- 1940s–1950s — The theory of function fields of curves over finite fields (arithmetic geometry) forces systematic engagement with imperfect base fields, since Fp(t)\mathbb{F}_p(t) is the prototypical imperfect field arising in algebraic geometry over finite fields.
Why is characteristic 00 automatically perfect?

In characteristic 00, the notion of "pp-th power map" does not apply, so the definition of perfect field simply declares all characteristic-00 fields perfect by convention/vacuously. More substantively, the reason characteristic-00 fields never exhibit inseparability is that the derivative of any nonconstant polynomial f=∑aixif=\sum a_i x^i is nonzero: the term nanxn−1na_nx^{n-1} (top degree) survives because n≠0n \ne 0 in a field of characteristic 00 (no positive integer is ever 00). Hence f′≠0f' \ne 0 for every nonconstant ff, so gcd⁡(f,f′)\gcd(f,f') is a proper divisor whenever ff is irreducible, forcing separability automatically. This is exactly the failure mode that characteristic pp introduces via p⋅(anything)=0p \cdot(\text{anything}) = 0.

Is every subfield of a perfect field also perfect?

No, and this is a frequent point of confusion. Perfection is not inherited by subfields in general. For example, Fp‾\overline{\mathbb{F}_p} (the algebraic closure of Fp\mathbb{F}_p) is perfect, but it contains subfields like Fp(t)\mathbb{F}_p(t) only if tt is transcendental — which cannot happen inside Fp‾\overline{\mathbb{F}_p} since every element there is algebraic over Fp\mathbb{F}_p. So this particular example doesn't arise, but in general (e.g., inside a large enough field extension) one can have a perfect field containing an imperfect subfield, such as the perfect closure of Fp(t)\mathbb{F}_p(t) containing the imperfect Fp(t)\mathbb{F}_p(t) itself. Perfection is a "closure" property, not automatically hereditary downward.

Does every imperfect field have a "perfect closure"?

Yes. Given any field KK of characteristic p>0p>0, one constructs the perfect closure K1/p∞K^{1/p^\infty} by adjoining pnp^n-th roots of every element of KK for all n≥0n\ge0 inside a fixed algebraic closure. This yields the smallest perfect field containing KK, and it is purely inseparable over KK. This construction is the algebraic backbone of Frobenius-twist techniques in positive-characteristic algebraic geometry, though its detailed structure belongs to a more advanced treatment than perfection itself.

Can a purely inseparable extension have degree not a power of pp?

No. If L/KL/K is a finite purely inseparable extension in characteristic pp, then [L:K][L:K] is always a power of pp. The reason: each generator α\alpha of LL over KK satisfies αpn∈K\alpha^{p^n}\in K for some nn, so its minimal polynomial over KK divides xpn−αpn=(x−α)pnx^{p^n}-\alpha^{p^n}=(x-\alpha)^{p^n}, forcing the minimal polynomial to have degree a power of pp. Building up LL by successive simple purely inseparable extensions and multiplying degrees (tower law) preserves this power-of-pp property at each stage.

Is xp−x−ax^p - x - a (Artin–Schreier polynomial) always separable, even over imperfect fields?

Yes, always, regardless of whether KK is perfect. Its derivative is pxp−1−1=−1≠0px^{p-1}-1=-1\ne0 in characteristic pp, so gcd⁡(f,f′)=gcd⁡(f,−1)=1\gcd(f,f')=\gcd(f,-1)=1 automatically, no matter what a∈Ka\in K is or whether KK is perfect. This is the key mechanism behind Artin–Schreier theory, which classifies degree-pp separable (in fact Galois, cyclic) extensions in characteristic pp — a phenomenon completely orthogonal to the perfect/imperfect dichotomy, since it concerns extensions that are separable by construction.

Why does perfection matter for the Fundamental Theorem of Galois Theory?

The Fundamental Theorem of Galois Theory requires the extension L/KL/K to be Galois, which by definition demands both normality and separability. If KK is perfect, separability is free: any normal algebraic extension of KK is automatically Galois, so the correspondence between subgroups of Aut⁡(L/K)\operatorname{Aut}(L/K) and intermediate fields applies unconditionally. Over an imperfect KK, one must separately verify separability for every extension considered, since normal-but-inseparable extensions (like K(t1/p)/KK(t^{1/p})/K, which is normal — the only root of xp−tx^p-t lies in the extension — but not Galois) genuinely occur and break the correspondence.

Does perfection say anything about transcendental elements?

Directly, no — perfection is defined purely via the algebraic condition K=KpK=K^p and concerns algebraic extensions of KK. However, transcendence is exactly the mechanism that most commonly produces imperfect fields in practice: rational function fields Fp(t1,…,tn)\mathbb{F}_p(t_1,\dots,t_n) over a perfect constant field are themselves imperfect precisely because the transcendental generators tit_i have no pp-th roots within the field. So while perfection itself is an algebraic notion, its failure in nature is overwhelmingly tied to the presence of transcendental elements over a finite (or more generally imperfect) constant field.

Before this

Where this leads