🔢 mathematics

A simple proof of the fundamental theorem of Galois theory

This paper presents a simple proof of the fundamental theorem of Galois theory by leveraging the combinatorial fact that a field cannot be expressed as the union of finitely many proper subfields.

Original authors: Martin Brandenburg

Published 2026-04-02

📖 5 min read🧠 Deep dive

CC BY 4.0

Original authors: Martin Brandenburg

Original paper licensed under CC BY 4.0 (http://creativecommons.org/licenses/by/4.0/). ✨ This is an AI-generated explanation of the paper below. It is not written or endorsed by the authors. For technical accuracy, refer to the original paper. Read full disclaimer

Imagine you are a detective trying to solve a mystery involving two different worlds: a World of Numbers (Fields) and a World of Symmetries (Groups).

This paper by Martin Brandenburg is a guidebook on how to translate perfectly between these two worlds. It proves a famous rule called the Fundamental Theorem of Galois Theory.

Here is the simple, everyday explanation of what the paper does, using analogies.

1. The Two Worlds

The Number World (Fields): Think of this as a giant, complex puzzle box. Inside, there are smaller boxes (subfields) nested within it. For example, the "Real Numbers" contain the "Rational Numbers," which contain the "Integers."
The Symmetry World (Groups): Think of this as a team of dancers. Each dancer represents a way to shuffle the numbers in the puzzle box without breaking the rules of math. If you swap two numbers and the math still works, that's a "symmetry."

The Big Question: Is there a perfect map between the nested boxes in the Number World and the teams of dancers in the Symmetry World?

Does every specific sub-box correspond to exactly one specific team of dancers?
Does every team of dancers correspond to exactly one specific sub-box?

The answer is YES, but only if the puzzle box is "well-behaved" (what mathematicians call a Galois Extension).

2. The Author's Secret Weapon: The "No-Union" Rule

Most textbooks prove this by doing heavy calculus-like math (counting degrees and using complex linear algebra).

Brandenburg's approach is different. He uses a simple, logical trick based on a combinatorial fact:

A field cannot be the union of a few smaller fields.

The Analogy:
Imagine a giant pizza (the big field). Can you cover the entire pizza perfectly by stacking just a few small, leftover slices (proper subfields) on top of each other?

No. No matter how you arrange a finite number of smaller slices, there will always be some crust or cheese left uncovered.
If you try to cover the whole pizza with a finite number of smaller slices, you will always fail.

Brandenburg uses this "No-Union" rule as a hammer to smash through the difficult parts of the proof.

3. How the Proof Works (Step-by-Step)

The paper breaks the problem into two main tasks:

Task A: From Numbers to Dancers (The "Fixed Field" Problem)

The Setup: You have a team of dancers (a subgroup). They dance around the pizza. Some parts of the pizza never move; they stay fixed.
The Claim: The set of "fixed" numbers (the parts of the pizza that didn't move) defines a specific sub-box.
The Proof: The author shows that if you take the "fixed" numbers and look at the dancers that only fix those numbers, you get exactly the team you started with.
The Magic Trick: He uses the "No-Union" rule here. He argues: "If there was a dancer who wasn't in our team but still fixed the numbers, they would have to agree with our team everywhere. But since the whole pizza can't be covered by the 'agreement zones' of the other dancers, this extra dancer must actually be one of our team members."

Task B: From Dancers to Numbers (The "Fixed Group" Problem)

The Setup: You have a sub-box (an intermediate field). You ask: "Who are all the dancers that leave this sub-box untouched?"
The Claim: This group of dancers perfectly matches the symmetries of that sub-box.
The Proof: This relies on the fact that the puzzle box is "separable" and "normal" (well-behaved). The author shows that the number of dancers is exactly equal to the size of the puzzle box relative to the sub-box.

4. Why This Paper is Special

Usually, proving this theorem is like trying to climb a mountain using a heavy, technical rope (standard algebraic proofs).

Brandenburg says: "Let's just walk up the side path."

He avoids complex tools like "splitting fields" (a standard but heavy concept).
He avoids "linear independence of characters" (a very abstract algebraic concept).
Instead, he uses the simple logic that "You can't cover a whole field with a few smaller fields."

5. The Takeaway (The "So What?")

This theorem is the Rosetta Stone of algebra. It tells us that:

Structure: The structure of the numbers (how they are nested) is exactly the same as the structure of the symmetries (how they can be shuffled).
Translation: If you want to know if a specific number puzzle can be solved by a formula (like the quadratic formula), you don't need to look at the numbers. You just look at the "dancers" (the group). If the dancers have a specific shape, the puzzle is solvable. If they are too chaotic, it's impossible.

In summary:
This paper is a clever, streamlined guide that proves you can perfectly translate between the "shape of a number system" and the "shape of its symmetries," using a simple logical trick about how you can't cover a whole pizza with a few small slices. It makes a complex mathematical mountain feel like a gentle hill.

1. Problem Statement

The paper addresses the Fundamental Theorem of Galois Theory, which establishes a bijection between the intermediate fields of a finite Galois extension $L/K$ and the subgroups of its Galois group $\text{Aut}_K(L)$ .

Standard textbook proofs of this theorem typically rely on:

Comparing the degrees of field extensions with the orders of subgroups.
The linear independence of characters (Dedekind's Lemma).
The theory of splitting fields.

The author argues that these methods, while standard, are often indirect or rely on heavy machinery. The goal is to provide a direct, self-contained proof that derives the theorem's two core components directly from definitions and basic field theory, minimizing reliance on advanced algebraic tools.

2. Methodology

The proof strategy is divided into two distinct parts, corresponding to the two directions of the Galois correspondence:

A. Combinatorial Approach (Subgroups to Fields)

To prove that for a subgroup $H \subseteq \text{Aut}_K(L)$ , the fixed field satisfies $H = \text{Aut}_{L^H}(L)$ , the author employs a combinatorial argument regarding the structure of fields.

Core Lemma: The proof relies on the fact that a field cannot be written as the union of finitely many proper subfields (Lemma 3.3).
Mechanism: The author shows that if an automorphism $\tau$ fixes the fixed field $L^H$ , then the field $L$ is the union of the "equalizers" (subfields where $\sigma(a) = \tau(a)$ ) for all $\sigma \in H$ . By the combinatorial lemma, one of these equalizers must be the entire field $L$ , implying $\tau = \sigma$ for some $\sigma \in H$ .
Advantage: This avoids the use of linear independence of characters and degree counting.

B. Direct Definition-Based Approach (Fields to Subgroups)

To prove that for an intermediate field $E$ , the fixed field of its automorphism group satisfies $E = L^{\text{Aut}_E(L)}$ , the author uses:

Separability and Normality: The proof utilizes the definitions of separable and normal extensions directly.
Transitivity: It leverages the transitive action of the Galois group on the set of homomorphisms $\text{Hom}_K(L, \bar{K})$ .
Logic: If an element $a$ is fixed by all automorphisms of $L$ that fix $E$ , the author shows that $a$ must lie in $E$ by analyzing the roots of its minimal polynomial and the properties of separable extensions.

3. Key Contributions and Structure

Preliminaries (Section 2)

The paper establishes a self-contained foundation, assuming only basic field theory (minimal polynomials, degree of extensions). It proves:

Lemma 2.1 & 2.2: Bounds on the number of homomorphisms between extensions.
Lemma 2.3: Existence of extensions of homomorphisms to algebraic closures (using Zorn's Lemma or induction).
Lemma 2.5: For algebraic extensions, injective endomorphisms are surjective ( $\text{Hom}_K(L, L) = \text{Aut}_K(L)$ ).

Combinatorial Results (Section 3)

This section provides the novel engine for the proof:

Lemma 3.1: A vector space over an infinite field is not a union of finitely many proper subspaces.
Lemma 3.3: A field cannot be the union of finitely many proper subfields.
- Proof Sketch: For finite fields, the multiplicative group is cyclic, making the union impossible. For infinite fields, it reduces to the vector space case over the intersection of the subfields.
Significance: This result is used to prove that the fixed field of a finite group of automorphisms captures exactly that group (Proposition 4.2).

Classification of Extensions (Sections 5 & 6)

The paper rigorously defines and proves properties of:

Separable Extensions: Proving that for finite separable extensions, the number of embeddings equals the degree $[L:K]$ (Proposition 5.3).
Normal Extensions: Defined via the transitivity of the action of $\text{Aut}_K(L)$ on $\text{Hom}_K(L, \bar{K})$ . It proves that normality is preserved in intermediate extensions (Lemma 6.2).

The Main Theorem (Section 7)

The author combines the previous results to prove the Fundamental Theorem (Theorem 7.4):

Bijection: Establishes the inverse relationship between intermediate fields and subgroups.
- $E \mapsto \text{Aut}_E(L)$
- $H \mapsto L^H$
Order Reversal: Proves the maps are inclusion-reversing.
Degree/Index Formula: Shows $[E:K] = [\text{Aut}_K(L) : \text{Aut}_E(L)]$ .
Lattice Isomorphism: Demonstrates how intersections and compositums of fields correspond to generated subgroups and intersections of subgroups.
Normality Correspondence: Proves that an intermediate field $E/K$ is normal if and only if $\text{Aut}_E(L)$ is a normal subgroup of $\text{Aut}_K(L)$ , leading to the isomorphism $\text{Aut}_K(L)/\text{Aut}_E(L) \cong \text{Aut}_K(E)$ .

4. Results

Direct Proof of Part (1): $E = L^{\text{Aut}_E(L)}$ is derived directly from the definitions of normal and separable extensions without comparing degrees.
Direct Proof of Part (2): $H = \text{Aut}_{L^H}(L)$ is derived using the combinatorial fact that a field is not a finite union of proper subfields.
Self-Containment: The paper does not assume prior knowledge of Galois theory, splitting fields, or linear independence of characters, making it a standalone introduction.

5. Significance

Pedagogical Value: The paper serves as an excellent introduction to Galois theory for students who have only basic field theory. It demystifies the theorem by removing "black box" theorems like the linear independence of characters.
Conceptual Clarity: By separating the proof into a combinatorial part (for subgroups) and a structural part (for fields), it highlights the distinct nature of the two directions of the correspondence.
Alternative to Standard Proofs: It offers a fresh perspective that avoids the traditional "degree counting" argument, which often obscures the structural reasons why the bijection holds.
Generality: The combinatorial lemma (Lemma 3.3) is a powerful tool that can be applied to other areas of algebra, such as proving the Primitive Element Theorem (as noted in Remark 3.4).

In summary, Brandenburg provides a streamlined, rigorous, and conceptually distinct proof of the Fundamental Theorem of Galois Theory, relying on the elegant combinatorial insight that fields cannot be decomposed into finite unions of proper subfields.