Romyar SharifiLECTURE NOTES
READING EDITIONPDF

LECTURE NOTES / Chapter 10

Abstract Algebra

Romyar Sharifi

Chapter 10 Topics in Galois theory

Book contents

Chapter 10
Topics in Galois theory

10.1. Norm and trace

Definition 10.1.1.

Let E∕F be a finite extension of fields. For α ∈ E, let mα: E → E denote the F-linear transformation defined by left multiplication by α.

a.

The norm map N ⁡ E∕F : E → F is defined by N ⁡ E∕F (α) = det ⁡ mα for α ∈ E.

b.

The trace map Tr ⁡ E∕F : E → F is defined by Tr ⁡ E∕F (α) = tr ⁡ mα for α ∈ E.

Remark 10.1.2.

For a finite field extension E∕F, the trace map Tr ⁡ E∕F is a homomorphism, and the norm map N ⁡ E∕F is a homomorphism to F× upon restriction to E×.

Proposition 10.1.3.

Let E∕F be a finite extension of fields, and let α ∈ E. Let f ∈ F [x] be the minimal polynomial of α over F, let d = [F (α) : F ], let s = [E : F (α)], and let F¯ be an algebraic closure of F. Suppose that f factors in F¯[x] as

f = ∏i=1d(x−α i)

for some α1,…,αd ∈F¯. Then the characteristic polynomial of mα is fs, and we have

N ⁡ E∕F (α) = ∏i=1dα is and Tr ⁡ E∕F (α) = s∑i=1dα i.
Proof.

If {β1,…,βs} is a basis for E∕F (α), then {βiαj∣1 ≤ i ≤ s,0 ≤ j ≤ d−1} is a basis for E∕F. The matrix A representing mα with respect to this basis (with the lexicographical ordering on the pairs (i,j)) is block diagonal with s blocks all equal to the matrix for mα: F (α) → F (α) for the ordered basis {1,α,…,αd−1}. As we have an isomorphism of fields F (α)≅𝐹 [x]∕(f) fixing F under which α is sent to the coset of x, the latter matrix is the companion matrix Af.

By Lemma 8.10.10, we have char ⁡ mα = fs. Lemma 8.7.21 tells us that

fs = xd−tr ⁡ (m α)xd−1 +⋯+(−1)ddet ⁡ (m α),

By expanding out the factorization of fs in F¯[x], we see that N ⁡ E∕F α and Tr ⁡ E∕F α are as stated in this case. □

We can also express the norm as a power of a product of conjugates and the trace as a multiple of a sum of conjugates.

Proposition 10.1.4.

Let E∕F be a finite field extension, and let t = [E : F ]i be its degree of inseparability. Then, for α ∈ E, we have

N ⁡ E∕F (α) = ∏σ∈Emb ⁡ F (E)σαt and Tr ⁡ E∕F (α) = t∑σ∈Emb ⁡ F (E)𝜎𝛼.
Proof.

The distinct conjugates of α in a fixed algebraic closure F¯ of F are exactly the 𝜏𝛼 for τ ∈ Emb ⁡ F (F (α)). These 𝜏𝛼 are the distinct roots of the minimal polynomial of α over F, each occuring with multiplicity the degree [F (α) : F ]i of insparability of F (α)∕F. Now, as in the proof of Lemma 6.10.17, each of these embeddings extends to [E : F (α)]s distinct embeddings of E into F¯, and each extension σ ∈ Emb ⁡ F (E) of τ sends α to τ(α). By Proposition 10.1.3, we have

N ⁡ E∕F α = ∏τ∈Emb ⁡ F (F (α))(𝜏𝛼)[E:F (α)][F (α):F ]i = ∏ σ∈Emb ⁡ F (E)σα[E:F (α)]i[F (α):F ]i = ∏ σ∈Emb ⁡ F (E)σαt,

and similarly for the trace. □

We have the following immediate corollary.

Corollary 10.1.5.

Let E∕F be a finite separable extension of fields. Then, for α ∈ E, we have

N ⁡ E∕F (α) = ∏σ∈Emb ⁡ F (E)𝜎𝛼 and Tr ⁡ E∕F (α) = ∑σ∈Emb ⁡ F (E)𝜎𝛼.

We also have the following.

Proposition 10.1.6.

Let K∕F be a finite field extension and E be an intermediate field in the extension. Then we have

N ⁡ K∕F = N ⁡ E∕F ∘N ⁡ K∕E and Tr ⁡ K∕F = Tr ⁡ E∕F ∘Tr ⁡ K∕E.
Proof.

Since [K : F ]i = [K : E]i[E : F ]i, it suffices by Proposition 10.1.4 to show that

∏δ∈Emb ⁡ F (K)𝛿𝛼 = ∏σ∈Emb ⁡ F (E)σ (∏τ∈Emb ⁡ E(K)𝜏𝛼).

We extend each σ to an automorphism σ~ of F¯ fixing F. We then have

∏σ∈Emb ⁡ F (E)σ (∏τ∈Emb ⁡ E(K)𝜏𝛼) = ∏σ∈Emb ⁡ F (E)∏τ∈Emb ⁡ E(K)(σ~∘τ)α. (10.1.1)

For the trace map, we simply replace the products by sums.

Let σ,σ′∈ Emb ⁡ F (E) and τ,τ′∈ Emb ⁡ E(K), and suppose that

σ~∘τ = σ~′∘τ′∈ Emb ⁡ F (K) (10.1.2)

Since σ~∘τ|E = σ|E, we have that σ = σ′. Since σ~ is an automorphism, we then apply its inverse to (10.1.2) to obtain τ = τ′. As there are

|Emb ⁡ F (E)||Emb ⁡ E(K)| = [E : F ]s[K : E]s = [K : F ]s = |Emb ⁡ F (K)|

terms of the product in (10.1.1), we have the result. □

Example 10.1.7.

The norm for the extension ℚ(d)∕ℚ, where d is a square-free integer, is given by

N ⁡ ℚ(d)∕ℚ(x+yd) = (x+yd)(x−yd) = x2 −dy2

for x,y ∈ℚ.

Example 10.1.8.

For a,b,c ∈ℚ, we have

N ⁡ ℚ(23)∕ℚ(a+b23 +c(23)2) = (a+b23+c(23)2)(a+𝑏𝜔23+cω2(23)2)(a+bω223+𝑐𝜔(23)2) = a3 +2b3 +4c3 −6𝑎𝑏𝑐,

for ω a primitive cube root of unity. The trace is simpler:

Tr ⁡ ℚ(23)∕ℚ(a+b23+c(23)2) = 3a.

Definition 10.1.9.

A E-valued linear character of a group G is a group homomorphism χ : G → E×, where E is a field.

Definition 10.1.10.

We say that a set of E-valued linear characters X of a group G is E-linearly independent if it linearly independent as a subset of the E-vector space of functions G → E.

Theorem 10.1.11.

Any set of E-valued linear characters G → E× of a group G is E-linearly independent.

Proof.

Let X be a set of linear characters G → E×. Suppose by way of contradiction that m ≥ 1 is minimal such that there m distinct, linearly dependent elements of G. Choose ai ∈ E and χi ∈ X with 1 ≤ i ≤ m for which

∑i=1ma iχi = 0.

Also, let h ∈ G be such that χ1(h)≠χm(h). Set bi = ai(χi(h)−χm(h)) for 1 ≤ i ≤ m−1. For any g ∈ G, we then have

∑i=1m−1b iχi(g) = ∑i=1ma i(χi(h)−χm(h))χi(g) = ∑i=1ma iχi(h𝑔)−χm(h)∑i=1ma iχi(g) = 0.

Since b1≠0 and ∑ ⁡i=1m−1biχi has only m−1 terms, this contradicts the existence of m. □

In the case of cyclic extensions, the kernels of the norm map bears a simple description.

Theorem 10.1.12 (Hilbert’s Theorem 90).

Let E∕F be a finite cyclic extension of fields, and let σ be a generator of its Galois group. Then

ker⁡N ⁡ E∕F = {σ(β) β ∣β ∈ E×}.
Proof.

Set n = [E : F ]. Let β ∈ E, and note that

N ⁡ E∕F (σ(β) β ) = ∏i=0n−1σi+1(β) σi(β) = N ⁡ E∕F (β) N ⁡ E∕F (β) = 1.

Next, suppose that α ∈ker⁡N ⁡ E∕F , and set

xγ = γ +𝛼𝜎(γ)+𝛼𝜎(α)σ2(γ)+⋯+𝛼𝜎(α)⋯σn−2(α)σn−1(γ)

for γ ∈ E. The elements of Gal ⁡ (E∕F ), which is to say the powers of σ, are distinct E-valued characters on E×, and therefore they are E-linearly independent. Thus, there exists γ ∈ E× such that xγ≠0. We then note that

𝛼𝜎(xγ) = 𝛼𝜎(γ)+𝛼𝜎(α)σ2(γ)+⋯+𝛼𝜎(α)⋯σn−2(α)σn−1(γ)+N ⁡ E∕F (α)γ = xγ,

so α = σ(xγ−1) xγ−1 , finishing the proof. □

There is also an additive form of Hilbert’s Theorem 90, which describes the kernel of the trace. We leave the proof to the reader.

Proposition 10.1.13 (Additive Hilbert’s Theorem 90).

Let E∕F be a finite cyclic extension of fields, and let σ be a generator of its Galois group. Then

ker⁡Tr ⁡ E∕F = {σ(β)−β∣β ∈ E}.

10.2. Discriminants

In this section, we give a second treatment of discriminants.

Definition 10.2.1.

Let F be a field and V a finite-dimensional F-vector space. A F-bilinear form is a F-bilinear map ψ : V ×V → F.

Definition 10.2.2.

A F-bilinear form ψ on a F-vector space V is said to be symmetric if ψ(v,w) = ψ(w,v) for all v,w ∈ V.

Example 10.2.3.

Given a matrix Q ∈ Mn(F ), we can define a bilinear form on Fn by

ψ(v,w) = vT 𝑄𝑤

for v,w ∈ Fn which is symmetric if and only if Q is.

Example 10.2.4.

If E∕F is a finite extension of fields, then ψ : E ×E → F defined by

ψ(α,β) = Tr ⁡ E∕F (𝛼𝛽)

for α,β ∈ E is a symmetric F-bilinear form on E.

Definition 10.2.5.

The discriminant D(ψ) of a bilinear form ψ on a finite dimensional F-vector space V relative to an ordered basis (v1,…,vn) of V is the determinant of the matrix with (i,j) entry equal to ψ(vi,vj).

Lemma 10.2.6.

Let ψ : V ×V → F be a F-bilinear form on a finite-dimensional vector space V of dimension n ≥ 1. Let v1,…,vn ∈ V, and let T : V → V be a F-linear transformation. Then

det ⁡ (ψ(T vi,T vj)) = (det ⁡ T )2 ⋅det ⁡ (ψ(v i,vj))
Proof.

It suffices to show this in the case that the vi form a basis of V, since in this case, for any w1,…,wn ∈ V there exists a linear transformation U : V → V with U(vi) = wi for all i. We then have

det ⁡ (ψ(Twi,Twj)) = det ⁡ (ψ(T Uvi,T Uvj)) = det ⁡ (T U)2det ⁡ (ψ(v i,vj)) = det ⁡ (T )2det ⁡ (ψ(w i,wj)).

So, assume that the vi form a basis of V, and let A = (a𝑖𝑗) denote the matrix of T with respect to the ordered basis (v1,…,vn) of V. We have T vi = ∑ ⁡k=1na𝑘𝑖vk for each i, and therefore we have

ψ(T vi,T vj) = ∑k=1na 𝑘𝑖∑l=1na 𝑙𝑗ψ(vk,vl).

As matrices, we then have

(ψ(T vi,T vj)) = AT (ψ(v i,vj))A,

and the result follows as det ⁡ T = det ⁡ A = det ⁡ AT . □

Remark 10.2.7.

It follows from Lemma 10.2.6 that the discriminant of a bilinear form with respect to a basis is independent of its ordering, since a permutation matrix has determinant ±1.

Definition 10.2.8.

Let E∕F be a finite extension of fields. The discriminant D(β1,…,βn) of E∕F relative to an ordered basis (β1,…,βn) of E as a F-vector space is the discriminant of the bilinear form

(α,β)↦Tr ⁡ E∕F (𝛼𝛽)

relative to the basis.

Proposition 10.2.9.

Let E∕F be a finite separable extension of fields. Then the discriminant of E∕F relative to an ordered basis (β1,…,βn) of E satisfies

D(β1,…,βn) = (det ⁡ (σiβj))2,

where {σ1,…,σn} is the set of embeddings of E in an algebraic closure of F that fix F.

Proof.

Note that

Tr ⁡ E∕F (βiβj) = ∑k=1nσ k(βi)σk(βj),

so the matrix (Tr ⁡ E∕F (βiβj)) equals QT Q, where Q ∈ Mn(E) satisfies Q𝑖𝑗 = σi(βj). □

Definition 10.2.10.

Let F be a field, and let α1,…,αn ∈ F. The Vandermonde matrix for α1,…,αn is

Q(α1,…,αn) = ( 1 α1 ⋯ α1n−1 1 α2 ⋯ α2n−1 ⋮ ⋮ ⋮ 1 αn ⋯ αnn−1 ).

Lemma 10.2.11.

Let F be a field, and let Q(α1,…,αn) be the Vandermonde matrix for elements α1,…,αn of F. Then

det ⁡ Q(α1,… ⁡ ,αn) = ∏1≤i<j≤n(αj−αi).
Proof.

We work by induction on n ≥ 1, the case n = 1 asserting the obvious fact that det ⁡ Q(α) = 1 for any α ∈ F. To compute the determinant of Q = Q(α1,…,αn), in order of descending i ≤ n−1 subtract α1 times the ith column of Q from the (i+1)th column, which leaves the determinant unchanged. We then obtain

det ⁡ Q = | 1 0 ⋯ 0 1 α2 −α1 ⋯ α2n−2(α2 −α1) ⋮ ⋮ ⋮ 1 αn−α1 ⋯ αnn−2(αn−α1) | = | α2 −α1 ⋯ α2n−2(α2 −α1) ⋮ ⋮ αn−α1 ⋯ αnn−2(αn−α1) | = ∏i=2n(α i−α1)⋅Q(α2,…,αn),

and the result now follows by induction. □

Proposition 10.2.12.

Suppose that E∕F is a separable extension of degree n, and let α ∈ E be such that E = F (α). Then

D(1,α,…,αn−1) = D(f),

where f ∈ F [x] is the minimal polynomial of α.

Proof.

Let σ1,σ2,…,σn be the embeddings of E in a fixed algebraic closure of F, and set αi = σi(α). Then σi(αj−1) = αij−1, so Lemmas 10.2.9 and 10.2.11 tell us that

D(1,α,…,αn−1) = det ⁡ Q(α1,α2,… ⁡ ,α n)2 = ∏1 ≤i<j≤n(αj−αi)2.

The latter term is just D(f). □

Definition 10.2.13.

Let F be a field and f = ∑ ⁡i=0naixi ∈ F [x]. The derivative f′∈ F [x] of f is f′ = ∑ ⁡i=1niaixi−1.

Remark 10.2.14.

An irreducible polynomial f ∈ F [x] is inseparable if and only if f′ = 0.

Proposition 10.2.15.

Suppose that E∕F is a separable extension of degree n, and let α ∈ E be such that E = F (α), and let f ∈ F [x] be the minimal polynomial of α. Then

D(f) = (−1)n(n−1) 2 NE∕F (f′(α)),

where f′∈ F [x] is the derivative of f.

Proof.

Let α1,…,αn be the conjugates of α in an algebraic closure F¯ of F. Then

f′(x) = ∑ i=1n∏ j=1 j≠i n(x−α j),

so we have

f′(α i) = ∏j=1 j≠i n(α i−αj)

for each i, and the conjugates of f′(α) in F¯ are the f′(αi). We then have

NE∕F (f′(α)) = ∏ i=1n∏ j=1 j≠i n(α i−αj) = (−1)n(n−1) 2 D(f)

□

Corollary 10.2.16.

Let L∕F be a finite separable extension of fields. Then the discriminant of L∕F relative to an ordered basis (β1,β2,…,βn) of L is nonzero.

Proof.

Since L∕F is separable, there exists α ∈ L such that L = F (α). Then (1,α,…,αn−1) is an ordered basis of L∕F, and there exists an invertible F-linear transformation T : L → L with T (αi−1) = βi for 1 ≤ i ≤ n. By Lemma 10.2.6, we have that

D(β1,β2,…,βn) = (det ⁡ T )2D(1,α,… ⁡ ,αn−1).

It follows Proposition 10.2.12 that D(1,α,…,αn−1)≠0, so we have the result. □

Remark 10.2.17.

Together, Lemma 10.2.6 and Corollary 10.2.16 tell us that the discriminant of a finite separable field extension L∕F (relative to an ordered basis) reduces to a element of F×∕F×2 that is independent of the choice of basis.

10.3. Extensions by radicals

Definition 10.3.1.

Let F be a field. A Kummer extension E of F is one that is given by adjoining roots of elements of F.

Notation 10.3.2.

For a field F of characteristic not dividing n ≥ 1, we let μn denote the group of nth roots of unity in a given algebraic closure of F.

Proposition 10.3.3.

Let F be a field, and let F¯ be a fixed algebraic closure of F. Let n ≥ 1 and a ∈ F. Let E = F (α) for α ∈F¯ with αn = a, and let d ≥ 1 be minimal such that αd ∈ F.

a.

The extension E∕F is Galois if and only if char ⁡ F does not divide d and E contains μd.

b.

If E∕F is Galois and μd ⊂ F, then the map

χa: Gal ⁡ (E∕F ) →∼μd,χa(σ) = σ(α) α .

is an isomorphism of groups.

Proof.

The minimal polynomial f of α divides xd−αd but not xm−αm for any m dividing d. If μd has order d, then f is separable as xd−αd is. If μd has order m for some m properly dividing d, then f divides xd−αd = (xm−αm)d∕m but not xm−αm so is inseparable. Note that char ⁡ F does not divide d if and only if μd has order d, so we suppose for the remainder of the proof that this holds.

Any field embedding σ of E in F¯ fixing F must send α to 𝜁𝛼 for some ζ ∈ μd. If μd ⊂ E, then every such element lies in E, so E∕F is Galois. Conversely, if E∕F is Galois, then since f does not divide any xm−αm with m properly dividing d and μd has order d, it has a root of the form 𝜁𝛼 with ζ ∈ μd of order d. Then ζ = (𝜁𝛼)⋅α−1 ∈ E, so μd ⊂ E.

Finally, if E∕F is Galois and μd ⊂ F, then the map χa as defined in the statement is bijective by what we have already said, and it satisfies

χa(𝜎𝜏) = 𝜎𝜏(α) α = σ(α) α ⋅σ(τ(α) α ) = χa(σ)⋅σ(χa(τ)) = χa(σ)χa(τ)

for σ,τ ∈ Gal ⁡ (E∕F ), noting that σ fixes μd. □

Definition 10.3.4.

Let F be a field containing μn for some n ≥ 1 that is not divisible by char ⁡ F. For any a ∈ F× and extension E∕F containing an nth root of a, the Kummer character attached to a is the homorphism χa: Gal ⁡ (E∕F ) → μn given by

χa(σ) = σ(an) an

for σ ∈ Gal ⁡ (E∕K).

Proposition 10.3.5.

Let F be a field of characteristic not dividing n ≥ 1, and suppose that F contains the nth roots of unity. Let E be a cyclic extension of F of degree n. Then E = F (an) for some a ∈ F×.

Proof.

Let ζ be a primitive nth root of unity in F. Note that NE∕F (ζ) = ζn = 1, so Hilbert’s Theorem 90 tells us that there exists α ∈ E and a generator σ of Gal ⁡ (E∕F ) with σ(α) α = ζ. Note that

NE∕F (α) = ∏i=1nσiα = ∏ i=1nζiα = ζn(n−1) 2 αn = (−1)n−1αn,

so setting a = −NE∕F (−α), we have αn = a. Since α has n distinct conjugates in E, we have that E = F (α). □

Notation 10.3.6.

Let Δ be a subset of a field K, and let n ≥ 1 be such that K contains the nth roots of unity in K¯. Then K(Δn) is the field given by adjoining an nth root of each element of Δ to K.

Theorem 10.3.7 (Kummer duality).

Let F be a field of characteristic not dividing n ≥ 1, and suppose that F contains the nth roots of unity. Let E be a finite abelian extension of F of exponent dividing n, and set Δ = E×n∩F×. Then E = F (Δn), and there is a perfect bimultiplicative pairing

⟨,⟩: Gal ⁡ (E∕F )×Δ∕F×n → μ n

given by ⟨σ,a⟩ = χa(σ) for σ ∈ Gal ⁡ (E∕F ) and a ∈Δ.

Proof.

Since μn ⊂ F, Proposition 10.3.3 tells us that the map taking a ∈Δ to its Kummer cocycle χa yields an injection

ψ : Δ∕F×n → Hom ⁡ (Gal ⁡ (E∕F ),μ n).

This gives rise to the bimultiplicative Kummer pairing ⟨,⟩, and it implies that any a ∈Δ∕F×n of order d dividing n pairs with some element of Gal ⁡ (E∕F ) to a dth root of unity.

We claim that ψ is surjective. Let χ : Gal ⁡ (E∕F ) → μn be a homomorphism, and let H = ker⁡χ, which by the fundamental theorem of Galois theory corresponds to some cyclic extension K∕F of degree dividing n. By Proposition 10.3.5, we have that K = F (α) for some α with a = αn ∈Δ, and then χ = χak for some k ≥ 1. That is, χ = χb with b = ak ∈Δ, so ψ(b) = χ. Since Δ∕F×n is therefore finite of degree [E : F ], we have that the map

Gal ⁡ (E∕F ) → Hom ⁡ (Δ∕F×n,μ n)

induced by the pairing is an isomorphism as well, and thus the Kummer pairing is perfect. □

Remark 10.3.8.

One may replace Δ in Theorem 10.3.7 by any Γ ⊆Δ with Δ = ΓK×n. Then Δ∕K×n should be replaced by the isomorphic Γ∕(Γ∩K×n).

Definition 10.3.9.

A finite field extension E∕F is solvable by radicals if there exists s ≥ 0 and fields Ei for 0 ≤ i ≤ s with E0 = F, E ⊆ Es, and Ei+1 = Ei(αini) for some αi ∈ Ei and integers ni ≥ 1 with ni ∤ char ⁡ F for 0 ≤ i < s. If we can take Es = E, then we say that E is a radical extension of F.

Theorem 10.3.10.

Let K∕F be a finite Galois extension of fields of degree not divisible by char ⁡ F. Then K∕F is solvable by radicals if and only if Gal ⁡ (K∕F ) is a solvable group.

Proof.

If K∕F is solvable by radicals, then there exists a field K′ containing F that is a radical extension of F. Suppose that K′ = Ks′ where K0′ = F and Ki+1′ = Ki′(αini) for some ni ≥ 1 with ni ∤ char ⁡ F and αi ∈ Ki′ for 0 ≤ i < s. In fact, we may redefine the fields Ki′ by setting K1′ = F (μm) where m = ∏ ⁡i=1sni by replacing Kj′ by Kj−1′(μm) for 1 ≤ j ≤ s and defining it as such for j = s+1. Then each Ki+1′∕Ki′ for 1 ≤ i ≤ s is a cyclic extension of exponent dividing m. Now set Ki = Ki′∩K(μm) for each 1 ≤ i ≤ s, and note that Ki+1∕Ki is then also cyclic of degree dividing m, while K1∕K0 is abelian. Thus the groups Gal ⁡ (K∕Ki) for 1 ≤ i ≤ s+1 form a subnormal series in Gal ⁡ (K∕F ) with abelian composition facts, and Gal ⁡ (K∕F ) is solvable.

Conversely, if Gal ⁡ (K∕F ) is solvable, then we have intermediate fields Ki with K0 = F, Ks = K, and Ki ⊂ Ki+1 such that Ki+1∕F is Galois and Ki+1∕Ki is cyclic of degree dividing n = [K : F ]. Then Ki+1(μn)∕Ki(μn) is also cyclic of degree dividing n, so there exists αi ∈ Ki(μn) such that Ki+1(μn) = Ki(μn)(αin). Then K(μn)∕F (μn) is a radical extension, and since F (μn)∕F is given by adjoining an nth root of unity, K(μn)∕F is also radical. As K is contained in K(μn), we conclude that K∕F is solvable by radicals. □

Corollary 10.3.11.

If F is a field of characteristic not dividing 6 and K is the splitting field over F of a polynomial of degree at most 4, then K∕F is solvable by radicals.

Proof.

We know that Gal ⁡ (K∕F ) is isomorphic to a subgroup of Sn for n equal to the degree of the polynomial defining K, and Sn is solvable for n ≤ 4, so Gal ⁡ (K∕F ) is solvable as well. □

Example 10.3.12.

The splitting field K of the polynomial f = 2x5 −10x+5 ∈ℚ[x] has Galois group isomorphic to S5, and S5 is insolvable, so K∕ℚ is not solvable by radicals. To see this, note first that the polynomial is irreducible by the Eisenstein criterion for the prime 5. So, 5 divides [K : ℚ], and hence the image G in S5 of Gal ⁡ (K∕ℚ) under a permutation representation of the roots contains a 5 cycle. Moreover, f′ = 10(x4 −1) has real roots at ±1 and f(−1) > 0 while f(1) < 0, so f has exactly three real roots. In particular, if τ ∈ Gal ⁡ (K∕ℚ) is the restriction of complex conjugation, then τ fixes the three real roots and transposes the two imaginary roots, so G contains a transposition. But S5 is generated by any five cycle and any transposition, so Gal ⁡ (K∕ℚ)≅G = S5.

10.4. Linearly disjoint extensions

Proposition 10.4.1.

Let K be a field, and let f ∈ K[x] be monic and irreducible. Let M be a field extension of K, and suppose that f factors as ∏ ⁡i=1mfiei in M[x], where the fi are irreducible and distinct and each ei is positive. Then we have an isomorphism

κ : K[x]∕(f)⊗KM →∼∏i=1mM[x]∕(f iei)

of M-algebras such that if g ∈ K[x], then κ((g+(f))⊗1) = (g+(fiei))i.

Proof.

Note that we have a canonical isomorphism K[x]⊗KM →∼M[x] that gives rise to the first map in the composition

K[x]∕(f)⊗KM →∼M[x]∕(f) →∼∏i=1mM[x]∕(f iei),

the second isomorphism being the Chinese remainder theorem. The composition is κ. □

We have the following consequence.

Lemma 10.4.2.

Let L∕K be a finite separable extension of fields, and let M be an algebraically closed field containing K. Then we have an isomorphism of M-algebras

κ : L⊗KM →∼∏σ : L↪MM,

where the product is taken over field embeddings of L in M fixing K, such that

κ(β ⊗1) = (𝜎𝛽)σ

for all β ∈ L.

Proof.

Write L = K(𝜃), and let f ∈ K[x] be the minimal polynomial of 𝜃. Then we define κ as the composition

L⊗KM →∼ M[x] (x−σ(𝜃)) →∼∏σ : L↪MM,

where the first isomorphism is that of Proposition 10.4.1 and the second takes x to σ(𝜃) in the coordinate corresponding to σ. Any β ∈ L has the form g(𝜃) for some g ∈ K[x], and since any σ : L↪M fixing K fixes the coefficients of g, we have κ(β ⊗1) is as stated. □

Remark 10.4.3.

If we compose κ of Lemma 10.4.2 with the natural embedding L↪L⊗KM that takes α ∈ L to α ⊗1, then the composition

ιM: L →∏σ : L↪MM

is the product of the field embeddings σ of L in M fixing K.

Definition 10.4.4.

Let K be a field and L and M be extensions of K both contained in some field Ω. We say that L and M are linearly disjoint over K if every K-linearly independent subset of L is M-linearly independent.

Lemma 10.4.5.

Let K be a field and L and M be extensions of K both contained in some field Ω. If L and M are linearly disjoint over K, then L∩M = K.

Proof.

If x ∈ L∩M with x∉K, then x and 1 are elements of L that are K-linearly independent but not M-linearly independent, so L and M are not linearly disjoint over K. □

From the definition, it may not be clear that the notion of linear disjointness is a symmetric one. However, this follows from the following.

Proposition 10.4.6.

Let K be a field and L and M be extensions of K both contained in some field Ω. Then L and M are linearly disjoint over K if and only if the map φ : L⊗KM → 𝐿𝑀 induced by multiplication is an injection.

Proof.

Suppose that γ1,…,γs ∈ M are L-linearly dependent, and write ∑ ⁡i=1sβiγi = 0 for some βi ∈ L. If φ is injective, then we must have ∑ ⁡i=1sβi⊗γi = 0, which means that the γi are K-linearly dependent.

Conversely, let L and M be linearly disjoint over K. Suppose that we have a nonzero

x = ∑i=1sβ i⊗γi ∈ker⁡φ

for some βi ∈ L and γi ∈ M, with s taken to be minimal. If x≠0, then the γi are L-linearly dependent, so they are K-linearly dependent. In this case, without loss of generality, we may suppose that

γs+∑i=1s−1α iγi = 0

for some αi in K. Then

x = ∑i=0s−1(β i−αiβs)⊗γi,

contradicting minimality. Thus ker⁡φ = 0. □

Corollary 10.4.7.

Let K be a field and L and M be extensions of K both contained in a given algebraic closure of K. Then L and M are linearly disjoint over K if and only if L⊗KM is a field.

Proof.

Note that 𝐿𝑀 is a union of subfields of the form K(α,β) with α ∈ L and β ∈ M. Since α and β are algebraic over K, we have K(α,β) = K[α,β], and every element of the latter ring is a K-linear combination of monomials in α and β. Thus φ of Proposition 10.4.6 is surjective, and the result follows from the latter proposition. □

Corollary 10.4.8.

Let K be a field and L and M be finite extensions of K inside a given algebraic closure of K. Then [𝐿𝑀 : K] = [L : K][M : K] if and only if L and M are linearly disjoint over K.

Proof.

Again, we have the surjection φ : L⊗KM → 𝐿𝑀 given by multiplication which is an injection if and only if L and M are linearly disjoint by Proposition 10.4.6. As L⊗KM has dimension [L : K][M : K] over K, the result follows. □

Remark 10.4.9.

Suppose that L = K(𝜃) is a finite extension of K. To say that L is linearly disjoint from a field extension M of K is by Propostion 10.4.1 exactly to say that the minimal polynomial of 𝜃 in K[x] remains irreducible in M[x].

We prove the following in somewhat less generality than possible.

Lemma 10.4.10.

Let L be a finite Galois extension of a field K inside an algebraic closure Ω of K, and let M be an extension of K in Ω. Then L and M are linearly disjoint if and only if L∩M = K.

Proof.

We write L = K(𝜃) for some 𝜃 ∈ L, and let f ∈ K[x] be the minimal polynomial of 𝜃. As Gal ⁡ (𝐿𝑀∕M)≅Gal ⁡ (L∕(L∩M)) by restriction, we have L∩M = K if and only if [𝐿𝑀 : M] = [L : K]. Since 𝐿𝑀 = M(𝜃), this occurs if and only if f is irreducible in M[x]. The result then follows from Remark 10.4.9. □

10.5. Normal bases

Definition 10.5.1.

A normal basis of a finite Galois extension L∕K is a basis of L as a K-vector space of the form {σ(α)∣σ ∈ Gal ⁡ (L∕K)} for some α ∈ L.

The goal of this section is to prove E. Noether’s theorem that every finite Galois extension has a normal basis. We start with the following lemma.

Lemma 10.5.2.

Let L∕K be a finite Galois extension with Galois group {σ1,…,σn}, where n = [L : K]. Let {α1,…,αn} be a basis of L as a K-vector space. Then the set

{(σ1(αj),…,σn(αj))∣1 ≤ j ≤ n}

is an L-basis of Ln.

Proof.

Let W be the L-span of the subset of Ln in question. Set W∨ = Hom ⁡ L(W,L), and let φ ∈ (Ln)∨ be such that φ(W ) = 0. It suffices to show that φ = 0. Note that there exists u = (a1,…,an) ∈ Ln such that φ(v) = uT v for all v ∈ Ln, so ∑ ⁡i=1naiσi(αj) = 0 for all 1 ≤ j ≤ n. As {α1,…,αn} is a K-basis of L, we therefore have that ∑ ⁡i=1naiσi vanishes on L. Since the σi are L-linearly independent, we have ai = 0 for all i, and therefore φ = 0. □

Lemma 10.5.3.

Every finite cyclic extension of fields has a normal basis.

Proof.

Let L∕K be finite cyclic of degree n, generated by an element σ. Then K[Gal ⁡ (L∕K)] is isomorphic to K[x]∕(xn−1) via the unique K-algebra homomorphism that takes σ to x. As L is a K[Gal ⁡ (L∕K)]-module, it becomes a K[x]-module annihilated by xn−1. If f = ∑ ⁡i=0n−1cixi ∈ K[x] annihilates L, then ∑ ⁡i=0n−1ciσi(α) = 0 for all α ∈ L, which by the linear independence of the σi forces f to be zero. Thus, the annihilator of L is (xn−1), and by the structure theorem for finitely generated modules over the PID K[x], this means that L has a K[x]-summand isomorphic to K[x]∕(xn−1), generated by some α ∈ L. Since the latter module has K-dimension n, as does L, the elements {α,σ(α),…,σn−1(α)} form a K-basis of L. □

Theorem 10.5.4 (Normal basis theorem).

Every finite Galois extension of fields has a normal basis.

Proof.

Let L∕K be a finite Galois extension of degree n. Since any finite extension of finite fields is cyclic, we may by Lemma 10.5.3 suppose that K is infinite. Write Gal ⁡ (L∕K) = {σ1,… ⁡ ,σn} and σ1 = 1. Let {α1,…,αn} be a basis of L as a K-vector space. It suffices to find β ∈ L with D(σ1(β),…,σn(β))≠0 by Corollary 10.2.16.

Define an element p ∈ L[x1,…,xn] by

p(x1,…,xn) = det ⁡ (∑k=1nσ j−1σ i(αk)xk)2.

Note that the coefficients of p are fixed by the elements of Gal ⁡ (L∕K), since they permute the columns of the matrix. By Lemma 10.5.2, we can find βj ∈ L for 1 ≤ j ≤ n be such that

∑j=1nβ j(σ1(αj),σ2(αj),…,σn(αj)) = (1,0,…,0).

Then for all 1 ≤ i,j ≤ n, we have

∑k=1nσ j−1σ i(αk)βk = δi,j,

so p(β1,…,βn) = det ⁡ (In)2 = 1, so p≠0. Since K is infinite, there exist a1,…,an ∈ K with p(a1,…,an)≠0. For γ = ∑ ⁡j=1naiαi, we have by Proposition 10.2.9 the first equality in

D(σ1(γ),…,σn(γ)) = det ⁡ (σj−1σ i(γ))2 = p(a1,… ⁡ ,a n)≠0.

□

10.6. Profinite groups

Definition 10.6.1.

A topological group G is a group endowed with a topology with respect to which both the multiplication map G×G → G and the inversion map G → G that takes an element to its inverse are continuous.

Examples 10.6.2.

a.

The groups ℝ, ℂ, ℝ×, and ℂ× are continuous with respect to the topologies defined by their absolute values.

b.

Any group can be made a topological group by endowing it with the discrete topology.

Remark 10.6.3.

We may consider the category of topological groups, in which the maps are continuous homomorphisms between topological groups.

Definition 10.6.4.

A homomorphism ϕ : G → G′ between topological groups G and G′ is a topological isomorphism if it is both an isomorphism and a homeomorphism.

The following lemma is almost immediate, since elements of a group are invertible.

Lemma 10.6.5.

Let G be a topological group and g ∈ G. Then the map mg: G → G with mg(a) = 𝑔𝑎 for all a ∈ G is a topological isomorphism.

We also have the following.

Lemma 10.6.6.

A group homomorphism ϕ : G → G′ between topological groups is continuous if and of only, for each open neighborhood U of 1 in G′ with 1 ∈ U, the set ϕ−1(U) contains an open neighborhood of 1.

Proof.

We consider the non-obvious direction. Let V be an open set in G′, and suppose that g ∈ G is such that h = ϕ(g) ∈ V. Then h−1V is open in G′ as well, by Lemma 10.6.5. By assumption, there exists an open neighborhood W of 1 in G contained in ϕ−1(h−1V ), and so 𝑔𝑊 is an open neighborhood of g in G such that ϕ(𝑔𝑊 ) ⊆ V. Hence, ϕ is continuous. □

Lemma 10.6.7.

Let G be a topological group.

a.

Any open subgroup of G is closed.

b.

Any closed subgroup of finite index in G is open.

Proof.

If H is an open (resp., closed) subgroup of G, then its cosets are open (resp., closed) as well. Moreover, G−H is the union of the nontrivial cosets of H. Therefore, G−H is open if G is open and closed if G is closed of finite index, so that there are only finitely many cosets of H. □

Lemma 10.6.8.

Every open subgroup of a compact group G is of finite index in G.

Proof.

Let H be a open subgroup of G. Note that G is the union of its distinct H-cosets, which are open and disjoint. Since G is compact, there can therefore only be finitely many cosets, which is to say that H is of finite index in G. □

We leave it to the reader to verify the following.

Lemma 10.6.9.

a.

A subgroup of a topological group is a topological group with respect to the subspace topology.

b.

The quotient of a topological group G by a normal subgroup N is a topological group with respect to the quotient topology, and it is Hausdorff if G is Hausdorff and N is closed.

c.

A direct product of topological groups is a topological group with respect to the product topology.

Remark 10.6.10.

The category of topological Hausdorff abelian groups is not abelian, though it is additive and admits kernels and cokernels. For instance, consider the inclusion map ι : ℚ →ℝ with ℝ having its usual topology and ℚ having the subspace topology. Then ker⁡ι = 0 and coker ⁡ ι = 0 (since ℚ is dense in ℝ, and thus every continuous map from ℝ is determined by its values on ℚ). By Proposition 9.8.15, we have im ⁡ ι≅ℝ but coim ⁡ ι≅ℚ.

Recall that an inverse system of groups is covariant functor from a codirected set to the category of groups. Here, we shall view it as a contravariant functor from a directed set I, or more concretely, a collection (Gi,ϕi,j) of groups Gi for i ∈ I and homomorphisms ϕi,j: Gi → Gj for every i,j ∈ I with j ≤ i. The following simple proposition gives a direct construction of the inverse limit of an inverse system.

Proposition 10.6.11.

Let (Gi,ϕi,j) be an inverse system of groups over a directed indexing set I. Then the an inverse limit of the system is given explicitly by the group

G = {(gi)i ∈∏i∈IGi∣ϕi,j(gi) = gj}

and the maps πi: G → Gi for i ∈ I that are the compositions of the G →∏ ⁡i∈IGi → Gi of inclusion followed by projection.

We may endow an inverse limit of groups with a topology as follows.

Definition 10.6.12.

Let (Gi,ϕi,j) be an inverse system of topological groups over an indexing set I, with continuous maps. Then the inverse limit topology on the inverse limit G of Proposition 10.6.11 is the subspace topology for the product topology on ∏ ⁡i∈IGi.

Lemma 10.6.13.

The inverse limit of an inverse system (Gi,ϕi,j) of topological groups (over a directed indexing set I) is a topological group under the inverse limit topology.

Proof.

The maps

∏i∈IGi×∏i∈IGi →∏i∈IGi and ∏i∈IGi →∏i∈IGi

given by componentwise multiplication and inversion are clearly continuous, and this continuity is preserved under the subspace topology on the inverse limit. □

Remark 10.6.14.

In fact, the inverse limit of an inverse system of topological groups and continuous maps, when endowed with the product topology, is an inverse limit in the category of topological groups.

When we wish to view it as a topological group, we typically endow a finite group with the discrete topology.

Definition 10.6.15.

A profinite group is an inverse limit of a system of finite groups, endowed with the inverse limit topology for the discrete topology on the finite groups.

Recall the following definition.

Definition 10.6.16.

A topological space is totally disconnected if and only if every point is a connected component.

We leave the following as difficult exercises.

Proposition 10.6.17.

A compact Hausdorff space is totally disconnected if and only if it has a basis of open neighborhoods that are also closed.

Proposition 10.6.18.

A compact Hausdorff group that is totally disconnected has a basis of neighborhoods of 1 consisting of open normal subgroups (of finite index).

We may now give a topological characterization of profinite groups.

Theorem 10.6.19.

A profinite topological group G is compact, Hausdorff, and totally disconnected.

Proof.

First, suppose that G is profinite, equal to an inverse limit of a system (Gi,ϕi,j) of finite groups over an indexing set I. The direct product ∏ ⁡i∈IGi of finite (discrete) groups Gi is compact Hausdorff (compactness being Tychonoff’s theorem). As a subset of the direct product, G is Hausdorff, and to see it is compact, we show that G is closed. Suppose that

(gi)i ∈∏i∈IGi

with (gi)i∉G, and choose i,j ∈ I with i > j and ϕi,j(gi)≠gj. The open subset

{(hk)k ∈∏k∈IGk∣hi = gi,hj = gj}

of the direct product contains (gi)i and has trivial intersection with G. In that the complement of G is open, G itself is closed. Finally, note that any open set ∏ ⁡i∈IUi with each Ui open in Gi (i.e., an arbitrary subset) and Ui = Gi for all but finitely many i is also closed. That is, its complement is the intersection

⋂ j∈I((Gj−Uj)×∏i∈I−{j}Ui)

of open sets, which is actually equal to the finite intersection over j ∈ I with Ui≠Gi. It is therefore open, and by Proposition 10.6.17, the group G is totally disconnected. □

Remark 10.6.20.

We leave it to the reader to check that the converse to Theorem 10.6.19 also holds. They key is found in the proof of part a of the following proposition.

Proposition 10.6.21.

Let G be a profinite group, and let 𝒰 be the set of all open normal subgroups of G. Then the following canonical homomorphisms are homeomorphisms:

a.

G →lim ←N∈𝒰G∕N,

b.

H →lim ←N∈𝒰H∕(H ∩N), for H a closed subgroup of G, and

c.

G∕K →lim ←N∈𝒰G∕𝑁𝐾, for K a closed normal subgroup of G.

Proof.

We prove part a. The continuous map ϕ from G to the inverse limit Q of its quotients has closed image, and ϕ is injective since 𝒰 is a basis of 1 in G as in Proposition 10.6.18. Suppose that (gNN)N∈𝒰 is not in the image of ϕ, which is exactly to say that the intersection of the closed sets gNN is empty. Since G is compact this implies that some finite subset of the {gNN∣N ∈𝒰} is empty, and letting M be the intersection of the N in this subset, we see that gMM = ∅, which is a contradiction. In other words, ϕ is surjective. □

The following is a consequence of Proposition 10.6.21a. We leave the proof to the reader.

Corollary 10.6.22.

Let G be a profinite group and 𝒱 a set of open normal subgroups of G that forms a basis of open neighborhoods of 1. Then the homomorphism

G →lim ←N∈𝒱G∕N

is a homeomorphism.

The following lemma will be useful later.

Lemma 10.6.23.

The closed subgroups of a profinite group are exactly those that may be written as intersections of open subgroups.

Proof.

In a topological group, an open subgroup is also closed, an arbitrary intersection of closed sets is closed, and an arbitrary intersection of subgroups is a subgroup, so an intersection of open subgroups is a closed subgroup. Let 𝒰 denote the set of open subgroups of a profinite group G. Let H be a closed subgroup of G. It follows from Proposition 10.6.21b and the second isomorphism theorem that the set of subgroups of the norm 𝑁𝐻 with N open normal in G has intersection H. Note that each 𝑁𝐻 is open as a union of open subgroups, so it is open. □

We may also speak of pro-p groups.

Definition 10.6.24.

A pro-p group, for a prime p, is an inverse limit of a system of finite p-groups.

We may also speak of profinite and pro-p completions of groups.

Definition 10.6.25.

Let G be a group.

a.

The profinite completion G^ of G is the inverse limit of its finite quotients G∕N, for N a normal subgroup of finite index in G, together with the natural quotient maps G∕N → G∕N′ for N ≤ N′.

b.

The pro-p completion G(p) of G, for a prime p, is the inverse limit of the finite quotients of G of p-power order, i.e., of the G∕N for N ⊴ G with [G : N] a power of p, together with the natural quotient maps.

Remark 10.6.26.

A group G is endowed with a canonical homomorphism to its profinite completion G^ by the universal property of the inverse limit.

Remark 10.6.27.

We may also speak of topological rings and fields, where multiplication, addition, and the additive inverse map are continuous, and in the case of a topological field, the multiplicative inverse map on the multiplicative group is continuous as well. We may speak of profinite rings as inverse limits by quotients by two-sided ideals of finite index (or for pro-p rings, of p-power index).

The next proposition shows that ℤp is the pro-p completion of ℤ.

Proposition 10.6.28.

Let p be a prime. We have an isomorphism of rings

ψ : ℤp →∼lim ←k≥1ℤ∕pkℤ,∑ i=0∞a ipi↦(∑ i=0k−1a ipi) k,

where the maps ℤ∕pk+1ℤ →ℤ∕pkℤ in the system are the natural quotient maps. Moreover, ψ is a homeomorphism.

Proof.

The canonical quotient map ψk: ℤp →ℤ∕pkℤ is the kth coordinate of ψ, which is then a ring homomorphism by the universal property of the inverse limit. The kernel ψ is the intersection of the kernels of the maps ψk, which is exactly

⋂ kpkℤ p = 0.

Moreover, any sequence of partial sums modulo increasing powers of p has a limit in ℤp, which maps to the sequence under ψ. The open neighborhood pnℤp of 0 in the p-adic topology is sent to the intersection

(∏k=1n{0}×∏ k=n+1∞ℤ p∕pkℤ p)∩(lim ←k≥1ℤ∕pkℤ),

which is open in the product topology. On the other hand, the inverse image of a basis open neighborhood

(∏k=1nU k×∏k=n+1∞ℤ p∕pkℤ p)∩(lim ←k≥1ℤ∕pkℤ)

with 0 ∈ Uk for all 1 ≤ k ≤ n under ψ clearly contains pnℤp. It then follows from Lemma 10.6.6 that ψ is a homeomorphism. □

Definition 10.6.29.

The Prüfer ring ℤ^ is the profinite completion of ℤ. That is, we have

ℤ≅lim ←n≥1ℤ∕𝑛ℤ

with respect to the quotient maps ℤ∕𝑛ℤ →ℤ∕𝑚ℤ for m∣n.

Since ℤ∕𝑛ℤ may be written as a direct product of the ℤ∕pkℤ for primes p with pk exactly dividing n, we have the following.

Lemma 10.6.30.

We have an isomorphism of topological rings

ℤ^≅∏pprimeℤp.

Example 10.6.31.

The free profinite (or pro-p) group on a generating set S is the profinite (resp., pro-p) completion of the free group on S.

Remark 10.6.32.

As with free groups, closed subgroups of free profinite (or pro-p) groups are free profinite (or pro-p) groups. Moreover, every profinite (resp., pro-p) group is a topological quotient of the free group on a set of its generators, so we may present such groups via generators and relations much as before.

Definition 10.6.33.

A subset S of a topological group G is said to be a topological generating set of G if G is the closure of the subgroup generated by S.

Definition 10.6.34.

We say that a topological group is (topologically) finitely generated if it has a finite set of topological generators.

Remark 10.6.35.

If G is a free profinite (or pro-p) group on a set S, then it is topologically generated by S.

We leave a proof of the following to the reader.

Lemma 10.6.36.

Let G be a topological group, and let H be a (normal) subgroup. Then the closure H¯ of H is also a (normal) subgroup of G.

10.7. Infinite Galois theory

Recall that an algebraic extension of fields L∕K is Galois if it is normal, so that every polynomial in K[x] that has a root in L splits completely, and separable, so that no irreducible polynomial in K[x] has a double root in L. The Galois group Gal ⁡ (L∕K) of such an extension is the group of automorphisms of L that fix K.

In the setting of finite Galois extensions L∕K, the subfields E of L containing F are in one-to-one correspondence with the subgroups H of Gal ⁡ (L∕K). In fact, the maps E↦Gal ⁡ (L∕E) and H↦LH give inverse bijections between these sets. This is not so in the setting of infinite Galois extensions, where there are rather more subgroups than there are subfields. To fix this issue, we place a topology on Gal ⁡ (L∕K) and consider only the closed subgroups under this topology. The above-described correspondences then work exactly as before.

Proposition 10.7.1.

Let L∕K be a Galois extension of fields. Let E denote the set of finite Galois extensions of K contained in L, ordered by inclusion. This is a directed set. Let ρ be the map

ρ : Gal ⁡ (L∕K) →lim ←E∈EGal ⁡ (E∕K)

defined by the universal property of the inverse limit, with the maps Gal ⁡ (E′∕K) → Gal ⁡ (E∕K) for E,E′∈E with E ⊆ E′ and the maps Gal ⁡ (L∕K) → Gal ⁡ (E∕K) for E ∈E being restriction maps. Then ρ is an isomorphism.

Proof.

Let σ ∈ Gal ⁡ (L∕K). If σ|E = 1 for all E ∈E, then since

L = ⋃ E∈EE,

we have that σ = 1. On the other hand, if elements σE ∈ Gal ⁡ (E∕K) for each E ∈E are compatible under restriction, then define σ ∈ Gal ⁡ (L∕K) by σ(α) = σE(α) if α ∈ E. Then, if α ∈ E′ for some E′∈E as well, then

σE′(α) = σE∩E′(α) = σE(α),

noting that E ∩E′∈E. Therefore, σ is well-defined, and so ρ is bijective. □

Proposition 10.7.1 gives us an obvious topology to place on the Galois group of a Galois extension.

Definition 10.7.2.

Let L∕K be a Galois extension of fields. The Krull topology on Gal ⁡ (L∕K) is the unique topology under which the set of Gal ⁡ (L∕E) for E∕K finite Galois with E ⊆ L forms a basis of open neighborhoods of 1.

Remark 10.7.3.

The Krull topology agrees with the inverse limit topology induced by the isomorphism of Proposition 10.7.1, since

1 → Gal ⁡ (L∕E) → Gal ⁡ (L∕K) → Gal ⁡ (E∕K) → 1

is exact. Therefore, if L∕K is Galois, then Gal ⁡ (L∕K) is a topological group under the Krull topology.

Lemma 10.7.4.

Let L∕K be a Galois extension of fields. The open subgroups in Gal ⁡ (L∕K) are exactly those subgroups of the form Gal ⁡ (L∕E) with E an intermediate field in L∕K of finite degree over K.

Proof.

First, let E be an intermediate field in L∕K of finite degree. Let E′ be the Galois closure of E in L, which is of finite degree over K. Then Gal ⁡ (L∕E′) is an open normal subgroup under the Krull topology, contained in Gal ⁡ (L∕E). Since Gal ⁡ (L∕E) is then a union of left Gal ⁡ (L∕E′)-cosets, which are open, we have that Gal ⁡ (L∕E) is open.

Conversely, let H be an open subgroup in Gal ⁡ (L∕K). Then H contains Gal ⁡ (L∕E) for some finite Galois extension E∕K in L. Any α ∈ LH, where LH is the fixed field of H in L, is contained in MGal ⁡ (L∕E), where M is the Galois closure of K(α). Since the restriction map Gal ⁡ (L∕E) → Gal ⁡ (M∕E) is surjective, we then have α ∈ MGal ⁡ (M∕E). But M∕K is finite, so MGal ⁡ (M∕E) = E by the fundamental theorem of Galois theory. Thus LH ⊆ E.

Let H¯ be the image of H under the restriction map π : Gal ⁡ (L∕K) → Gal ⁡ (E∕K). As Gal ⁡ (L∕E) ≤ H, we have that π−1(H¯) = H. We remark that H¯ = Gal ⁡ (E∕LH), since H¯ = Gal ⁡ (E∕EH¯) by the fundamental theorem of Galois theory for finite extensions and LH = EH = EH¯. But π−1(H¯) is then Gal ⁡ (L∕LH) as well. □

From this, we may derive the following.

Lemma 10.7.5.

Let L∕K be a Galois extension of fields. The closed subgroups of Gal ⁡ (L∕K) are exactly those of the form Gal ⁡ (L∕E) for some intermediate field E in the extension L∕K.

Proof.

Under the Krull topology on Gal ⁡ (L∕K), the open subgroups are those of the form Gal ⁡ (L∕E) with E∕K finite. By Lemma 10.6.23, we have therefore that the closed subgroups are those that are intersections of Gal ⁡ (L∕E) over a set S of finite degree over K intermediate fields E. Any such intersection necessarily fixes the compositum E′ = ∏ ⁡E∈SE, while if an element of Gal ⁡ (L∕K) fixes E′, then it fixes every E ∈ S, so lies in the intersection. That is, any closed subgroup has the form

Gal ⁡ (L∕E′) = ⋂ E∈SGal ⁡ (L∕E).

□

Theorem 10.7.6 (Fundamental theorem of Galois theory).

Let L∕K be a Galois extension. Then there are inverse one-to-one, inclusion reversing correspondences

Infinite Galois correspondence. A full diagram description follows.
Diagram description: Infinite Galois correspondence

The two displayed maps are mutually inverse, inclusion-reversing bijections between the specified collections.

Objects, listed by row and column:

  • Row 1, from left to right: column 1: left brace intermediate extensions inL / K right brace; column 2: left brace closed subgroups of Gal (L / K) right brace.

Arrows and lines:

  1. An arrow from left brace intermediate extensions inL / K right brace to left brace closed subgroups of Gal (L / K) right brace, labelled psi.
  2. An arrow from left brace closed subgroups of Gal (L / K) right brace to left brace intermediate extensions inL / K right brace, labelled theta.

given by ψ(E) = Gal ⁡ (L∕E) for any intermediate extension E in L∕K and 𝜃(H) = LH for any closed subgroup H of Gal ⁡ (L∕K). These correspondences restrict to bijections between the normal extensions of K in L and the closed normal subgroups of Gal ⁡ (L∕K), as well as to bijections between the finite degree (normal) extensions of K in L and the open (normal) subgroups of Gal ⁡ (L∕K). For any E of finite degree and the corresponding closed of finite index H, we have

[L : E] = Gal ⁡ (L∕E) and |H| = [L : LH].

Moreover, if E is normal over K (resp., H ⊴ Gal ⁡ (L∕K) is closed), then restriction induces a topological isomorphism

Gal ⁡ (L∕K)∕Gal ⁡ (L∕E) →∼Gal ⁡ (E∕K)

(resp., Gal ⁡ (L∕K)∕H →∼Gal ⁡ (LH∕K)).

Proof.

We will derive this from the fundamental theorem of Galois theory for finite Galois extensions. Let E be an intermediate extension in L∕K. Then E ⊆ LGal ⁡ (L∕E) by definition. Let x ∈ LGal ⁡ (L∕E). The Galois closure M of E(x) in L is of finite degree over E. But every element of Gal ⁡ (M∕E) extends to an element of Gal ⁡ (L∕E), which fixes x. So x ∈ MGal ⁡ (M∕E), which equals E by fundamental theorem of Galois theory for finite Galois extensions. Since x was arbitrary, we have E = LGal ⁡ (L∕E). In other words, 𝜃(ψ(E)) = E.

Let H be a closed subgroup of Gal ⁡ (L∕K). In Lemma 10.7.5, we saw that H = Gal ⁡ (L∕E) for some intermediate E in L∕K. Since E = LGal ⁡ (L∕E) = LH from what we have shown, we have that H = Gal ⁡ (L∕LH). Therefore, ψ(𝜃(H)) = H. It follows that we have the desired inclusion-reserving one-to-one correspondences. The other claims are then easily checked, or follow from the case of finite degree, and are left to the reader. □

Definition 10.7.7.

A separable closure of a field L is any field that contains all roots of all separable polynomials in L.

Notation 10.7.8.

We typically denote a separable closure of L by Lsep.

Remark 10.7.9.

If one fixes an algebraically closed field Ω containing L, then there is a unique separable closure of L in Ω, being the subfield generated by the roots of all separable polynomials in L[x].

Definition 10.7.10.

The absolute Galois group of a field K is the Galois group

GK = Gal ⁡ (Ksep∕K),

where Ksep is a separable closure of K.

Remark 10.7.11.

The absolute Galois group, despite the word “the”, is not unique, but rather depends on the choice of separable closure. An isomorphism of separable closures gives rise to a canonical isomorphism of absolute Galois groups, however.

Example 10.7.12.

Let q be a power of a prime number. Then there is a unique topological isomorphism G𝔽q →∼ℤ^ sending the Frobenius automorphism φq: x↦xq to 1. To see this, note that Gal ⁡ (𝔽qn∕𝔽q) →ℤ∕𝑛ℤ given by sending φq to 1 is an isomorphism, and these give rise to compatible isomorphisms in the inverse limit

G𝔽q →∼lim ←nGal ⁡ (𝔽qn∕𝔽q) →∼lim ←nℤ∕𝑛ℤ →∼ℤ^.

Example 10.7.13.

Let ℚ(μp∞) denote the field given by adjoining all p-power roots of unity to ℚ. Then

Gal ⁡ (ℚ(μp∞)∕ℚ)≅lim ←nGal ⁡ (ℚ(μpn)∕ℚ)≅lim ←n(ℤ∕pnℤ)×≅ℤ p×

the middle isomorphisms arising from the pnth cyclotomic characters.

Terminology 10.7.14.

The isomorphism Gal ⁡ (ℚ(μp∞)∕ℚ) →ℤp× of Example 10.7.13 called the p-adic cyclotomic character.

Since the compositum of two abelian extensions of a field inside a fixed algebraic closure is abelian, the following makes sense.

Notation 10.7.15.

Let K be a field. The maximal abelian extension of K inside an algebraic closure of K is denoted Kab.

Remark 10.7.16.

The abelianization GKab of the absolute Galois group GK of a field K canonically isomorphic to Gal ⁡ (Kab∕K) via the map induced by restriction on GK.

Find in the notes