This note aims at popularizing a short note of Meinolf Geck,
“On the characterization of Galois extensions
”, Amer. Math. Monthly 121 (2014), no. 7, 637–639 (
Article,
Math Reviews,
arXiv), that proposes a radical shortcut to the treatment of Galois theory at an elementary level. The proof of the pudding is in the eating, so let's see how it works. The novelty lies in theorem 2, but I give the full story so as to be sure that I do not hide something under the rug.
Proposition 1. Let K→L be a field extension. Then L is not the union of finitely many subfields M such that K→M⊊L.
Proof. It splits into two parts, according whether K is finite or infinite.
Assume that K is finite and let q=Card(K). Then L is finite as well, and let n=[L:K] so that Card(L)=qn. If M is a subextension of L, then Card(L)=qm, for some integer m dividing n; moreover, xqm=x for every x∈L. Then the union of all strict sub-extensions of L has cardinality at most ∑m=1n−1qm=q−1qn−q<qn.
It remains to treat the case where K is infinite; then the proposition follows from the fact that a finite union of strict subspace of a K-vector space E is not equal to E. Let indeed (Ei)1≤i≤n be a family of strict subspaces of E and let us prove by induction on n that E=⋃i=1nEi. The cases n≤1 are obvious. By induction we know that for every j∈{1,…,n}, the union ⋃i=jEi is distinct from E, hence select an element x∈E such that x∈E2∪⋯∪En. The desired result follows if, by chance, x∈E1. Otherwise, choose y∈E∖E1. For s=t∈K, and i∈{2,…,n}, observe that y+sx and y+tx cannot both belong to Ei, for this would imply that (s−t)x∈Ei, hence x∈Ei since s=t. Consequently, there are at most n−1 elements s∈K such that y+sx∈⋃i=2nEi. Since K is infinite, there exists s∈K such that y+sx∈⋃i=2nEi. Then y+sx∈E1, neither, since x∈E1 and y∈E1. This proves that E=⋃i=1nEi.
Let
K→L be a field extension and let
P∈K[T]. We say that
P is split in
L if it is a product of linear factors in
L[T]. We say that
P is separable if all of its roots (in some extension where it is split) have multiplicity
1. We say that
K→L is a splitting extension of
P if
P is split in
L and if
L is the subextension of
K generated by the roots of
P in
L. Finally, we let
AutK(L) be the set of
K-linear automorphisms of
L; it is a group under composition.
Theorem 2. Let K→L be a finite extension of fields and let G=AutK(L). Then Card(G)≤[L:K]. Moreover, the following conditions are equivalent:
- One has Card(G)=[L:K];
- There exists an irreducible separable polynomial P∈K[T] such that deg(P)=[L:K] and which is split in L;
- The extension K→L is a splitting extension of a separable polynomial in K[T];
- One has K=LG.
Remark 3. In the conditions of (2), let us fix a root
z∈L of
P. One has
L=K(z). Moreover, the map
f↦f(z) is a bijection from
AutK(L) to the set of roots of
P in
L.
Proof of Theorem 2.
(a) Let us prove that Card(G)≤[L:K]. Let m∈N be such that m≤Card(G) and let σ1,…,σm be distinct elements of G. For 1≤i<j≤m, let Mi,j be the subfield of L consisting of all x∈L such that σi(x)=σj(x). It is a strict subextension of L because σi=σj. Consequently, L is not the union of the subfields Mi,j and there exists an element z∈L such that σi(z)=σj(z) for all i=j. Let P be the minimal polynomial of z. Then the set {σ1(z),…,σm(z)} consists of distinct roots of P, hence deg(P)≥m. In particular, m≤[L:K]. Since this holds for every m≤Card(G), this shows that Card(G)≤[L:K].
(b) If one has Card(G)=[L:K], then taking m=Card(G), we get an irreducible polynomial P∈K[T] of degree m, with m distinct roots in L. Necessarily, P is separable and split in L. This gives (1)⇒(2).
The implication (2)⇒(3) is obvious.
(1)⇒(4). Let M=LG. One has AutK(L)=AutM(L)=G. Consequently, Card(G)≤[L:M]. Since Card(G)=[L:K]=[L:M][M:K], this forces M=K.
(4)⇒(3). There exists a G-invariant subset A of L such that L=K(A). Then P=∏a∈A(T−a) is split in L, and is G-invariant. Consequently, P∈K[T]. By construction, P is separable and L is a splitting extension of P.
(3)⇒(1). Let M be a subextension of L and let f:M→L be a K-morphism. Let a∈A and let Qa be the minimal polynomial of a over M. The association g↦g(a) defines a bijection between the set of extensions of f to M(a) and the set of roots of Qa in L. Since P(a)=0, the polynomial Qa divides P, hence it is separable and split in L. Consequently, f has exactly deg(Qa)=[M(a):M] extensions to M(a).
By a straightforward induction on Card(B), for every subset B of A, the set of K-morphisms from K(B) to L has cardinality [K(B):K]. When B=A, every such morphism is surjective, hence Card(AutK(L))=[L:K].
If these equivalent conditions hold, we say that the finite extension
K→L is Galois.
Corollary 4. Let K→L be a finite Galois extension. The maps H→LH and M→AutM(L) are bijections, inverse one of the other, between subgroups of AutK(L) and subextensions K→M⊂L.
Proof. a) For every subextension K→M⊂L, the extension M⊂L is Galois. In particular, M=LAutM(L) and AutM(L)=[L:M].
b) Let H⊂AutK(L) and let M=LH. Then M→L is a Galois extension and [L:M]=AutM(L); moreover, one has H⊂AutM(L) by construction. Let us prove that H=AutM(L). Let z∈L be any element whose minimal polynomial Pz over M is split and separable in L. One has Card(AutM(L))=deg(Pz). On the other hand, the polynomial Qz=∏σ∈H(T−σ(z))∈L[T] divides Pz and is H-invariant, hence it belongs to LH[T]=M[T]. This implies that Pz=Qz, hence Card(H)=deg(Pz)=Card(AutM(L)). Consequently, H=AutM(L).
Corollary 5. Let K→L be a Galois extension and let K→M→L be an intermediate extension. The extension M→L is Galois too. Moreover, the following assertions are equivalent:
- The extension K→M is Galois;
- AutM(L) is a normal subgroup of AutK(L);
- For every σ∈AutK(L), one has σ(M)⊂M.
Proof. (a) Let P∈K[T] be a separable polynomial of which K→L is a splitting field. Then M→L is a splitting extension of P, hence M→L is Galois.
(b) (1)⇒(2): Let σ∈AutK(L). Let z be any element of M and let P∈K[T] be its minimal polynomial. One has P(σ(z))=σ(P(z))=0, hence σ(z) is a root of P; in particular, σ(z)∈M. Consequently, the restriction of σ to M is a K-morphism from M to itself; it is necessarily a K-automorphism. We thus have defined a map from AutK(L) to AutK(M); this map is a morphism of groups. Its kernel is AutM(L), so that this group is normal in AutK(L).
(2)⇒(3): Let σ∈AutK(L) and let H=σAutM(L)σ−1. By construction, one has σ(M)⊂LH. On the other hand, the hypothesis that AutM(L) is normal in AutK(L) implies that H=AutM(L), so that LH=M. We thus have proved that σ(M)⊂M.
(3)⇒(1): Let A be a finite subset of M such that M=K(A) and let B be its orbit under AutK(L). The polynomial ∏b∈B(T−b) is separable and invariant under AutK(L), hence belongs to K[T]. By assumption, one has B⊂M. This implies that K→M is Galois.
Remark 6. Let
L be a field, let
G be a finite group of automorphisms of
L and let
K=LG. Every element
a of
L is algebraic and separable over
K; inded,
a is a root of the separable polynomial
∏b∈G⋅a(T−b)=0, which is
G-invariant hence belongs to
K[T]. There exists a finite extension
M of
K, contained in
L, such that
G⋅M=M and such that the map
AutK(L)→AutK(M) is injective. Then
K→M is Galois, and
G=AutK(M). Indeed, one has
G⊂AutK(M), hence
K⊂MAutK(M)⊂MG⊂LG=K. This implies that
K→M is Galois and the Galois correspondence then implies
G=AutK(M). The argument applies to every finite extension of
K which contains
M. Consequently, they all have degree
Card(G); necessarily,
L=M.
Remark 7 (editions). Matt Baker points out that the actual novelty of the treatment lies in theorem 2, the rest is standard. Also, remark 6 has been edited following an observation of Christian Naumovic that it is not a priori obvious that the extension
K→L is finite.