A topic in the Open Knowledge Graph — a free, open map of 15,290 topics and the order to learn them in.

Fundamental Theorem of Galois Theory

Research Depth 97 in the knowledge graph ☐ I know this ☆ Set as goal
33topics build on this
404prerequisites beneath it
See this on the map →
Galois GroupsNormal Subgroups→→Insolvability of the QuinticSecond Isomorphism Theorem for Groups
galois-theory correspondence fundamental

Core Idea

For Galois extension F/K, there is a bijection between intermediate fields E (K ⊆ E ⊆ F) and subgroups H of Gal(F/K), given by H ↔ FH (the fixed field). Subgroups are normal iff corresponding fields are Galois extensions. The correspondence reverses inclusion.

Explainer

The Fundamental Theorem of Galois Theory is a dictionary that translates field-theoretic questions into group-theoretic ones and back. You already know that a Galois group Gal(F/K) is the group of all field automorphisms of F that fix K pointwise — every element permutes the roots of the minimal polynomial while leaving the base field unchanged. The Fundamental Theorem reveals that this group encodes the complete structure of every intermediate field between K and F.

The correspondence works like this: for each subgroup H of Gal(F/K), define its fixed field FH as the set of all elements of F that every automorphism in H leaves unchanged. This fixed field is an intermediate field sitting between K and F. Conversely, for each intermediate field E, you get the subgroup of Gal(F/K) consisting of all automorphisms that fix E. The theorem says these two operations — taking fixed fields and taking fixing subgroups — are inverses of each other, establishing a perfect bijection.

The most striking feature of this bijection is that it reverses inclusion: a larger subgroup corresponds to a smaller intermediate field, and vice versa. Think about why: if H is big (many automorphisms must all fix an element), then very few elements of F are fixed, so FH is small. If H is small (fewer constraints), more elements can satisfy them, making FH large. This reversal is not accidental — it mirrors the way index and degree are related: [Gal(F/K) : H] = [FH : K].

The theorem also captures the qualitative difference between "nice" and "arbitrary" intermediate fields via normal subgroups. Recall from your study of normal subgroups that H is normal in G when it is closed under conjugation — gHg⁻¹ = H for all g in G. In the Galois correspondence, H is a normal subgroup of Gal(F/K) if and only if FH is itself a Galois extension of K. In this case, the quotient group Gal(F/K)/H is isomorphic to Gal(FH/K). This is the engine behind the theory of solvable equations: the question of whether a polynomial's roots can be expressed in radicals reduces to whether the Galois group has a particular chain of normal subgroups — a composition series through solvable groups. The field/subgroup dictionary converts a geometric question about fields into a purely algebraic question about group structure.

Practice Questions 5 questions

Prerequisite Chain

Understanding Zero → The Number Zero → Counting to Five → Counting to 10 → Counting to 20 → Counting a Set of Objects Up to 20 → Cardinality: The Last Number Counted → Matching Numerals to Quantities → Subitizing Small Quantities → Addition Within 10 → Number Bonds to 10 → Addition Within 20 → Doubles and Near Doubles → Doubles Facts Within 10 → Near Doubles Facts Within 20 → Mental Math Strategies for Addition → Mental Math: Adding and Subtracting Tens → Addition Within 100 → Repeated Addition as Multiplication → Multiplication as Equal Groups → Multiplication: Arrays → Basic Multiplication Facts (0s, 1s, 2s, 5s, 10s) → Multiplication Facts Within 100 → Division as Equal Sharing → Division as Grouping (Measurement Division) → Division: Grouping (Repeated Subtraction) Model → Division: Fair Sharing Model → Division as Equal Sharing → Division as Grouping → Basic Division Facts → Division Facts Within 100 → Multiplication and Division Fact Families → Relationship Between Multiplication and Division → Division Facts as Inverse of Multiplication → Remainders and Quotients in Division → Division Word Problems → Multi-Step Word Problems → Solving Multi-Step Word Problems → Multiplication Word Problems → Division Word Problems → Introduction to Long Division → Factors and Multiples → Prime and Composite Numbers → Equivalent Fractions → Relating Fractions and Decimals → Decimal Place Value → Integers and the Number Line → Comparing and Ordering Integers → Absolute Value → Adding Integers → Subtracting Integers → Multiplying Integers → Introduction to Exponents → Order of Operations → Integer Order of Operations → Variable Expressions → The Distributive Property → Variables and Expressions Review → Introduction to Polynomials → Adding and Subtracting Polynomials → Multiplying Polynomials → Factorial → Permutations → Combinations → Counting Principles: Addition and Multiplication Rules → Introduction to Graph Theory → Propositional Logic Foundations → Logical Equivalences → Set Operations: Union, Intersection, and Complement → Proof by Cases → Proving by Cases and Exhaustion → Vacuous Truth and Trivial Cases → Proof by Cases (Proof by Exhaustion) → Mathematical Induction → Binary Operations and Algebraic Structures → Group Definition and Examples → Basic Properties of Groups → Group Homomorphisms → Group Isomorphisms → Cayley's Theorem → Cosets and Lagrange's Theorem → Normal Subgroups → Quotient Groups → First Isomorphism Theorem for Groups → First Isomorphism Theorem for Rings → First Isomorphism Theorem for Groups → Third Isomorphism Theorem for Groups → First Isomorphism Theorem for Rings → Integral Domains → Principal Ideal Domains → Unique Factorization Domains → Polynomial Rings → Field Extensions → Algebraic and Transcendental Elements → Splitting Fields → Finite Fields → Galois Groups → Fundamental Theorem of Galois Theory

Longest path: 98 steps · 404 total prerequisite topics

Prerequisites (2)

Leads To (2)