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 SubgroupsInsolvability 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 ZeroThe Number ZeroCounting to FiveCounting to 10Counting to 20Counting a Set of Objects Up to 20Cardinality: The Last Number CountedMatching Numerals to QuantitiesSubitizing Small QuantitiesAddition Within 10Number Bonds to 10Addition Within 20Doubles and Near DoublesDoubles Facts Within 10Near Doubles Facts Within 20Mental Math Strategies for AdditionMental Math: Adding and Subtracting TensAddition Within 100Repeated Addition as MultiplicationMultiplication as Equal GroupsMultiplication: ArraysBasic Multiplication Facts (0s, 1s, 2s, 5s, 10s)Multiplication Facts Within 100Division as Equal SharingDivision as Grouping (Measurement Division)Division: Grouping (Repeated Subtraction) ModelDivision: Fair Sharing ModelDivision as Equal SharingDivision as GroupingBasic Division FactsDivision Facts Within 100Multiplication and Division Fact FamiliesRelationship Between Multiplication and DivisionDivision Facts as Inverse of MultiplicationRemainders and Quotients in DivisionDivision Word ProblemsMulti-Step Word ProblemsSolving Multi-Step Word ProblemsMultiplication Word ProblemsDivision Word ProblemsIntroduction to Long DivisionFactors and MultiplesPrime and Composite NumbersEquivalent FractionsRelating Fractions and DecimalsDecimal Place ValueIntegers and the Number LineComparing and Ordering IntegersAbsolute ValueAdding IntegersSubtracting IntegersMultiplying IntegersIntroduction to ExponentsOrder of OperationsInteger Order of OperationsVariable ExpressionsThe Distributive PropertyVariables and Expressions ReviewIntroduction to PolynomialsAdding and Subtracting PolynomialsMultiplying PolynomialsFactorialPermutationsCombinationsCounting Principles: Addition and Multiplication RulesIntroduction to Graph TheoryPropositional Logic FoundationsLogical EquivalencesSet Operations: Union, Intersection, and ComplementProof by CasesProving by Cases and ExhaustionVacuous Truth and Trivial CasesProof by Cases (Proof by Exhaustion)Mathematical InductionBinary Operations and Algebraic StructuresGroup Definition and ExamplesBasic Properties of GroupsGroup HomomorphismsGroup IsomorphismsCayley's TheoremCosets and Lagrange's TheoremNormal SubgroupsQuotient GroupsFirst Isomorphism Theorem for GroupsFirst Isomorphism Theorem for RingsFirst Isomorphism Theorem for GroupsThird Isomorphism Theorem for GroupsFirst Isomorphism Theorem for RingsIntegral DomainsPrincipal Ideal DomainsUnique Factorization DomainsPolynomial RingsField ExtensionsAlgebraic and Transcendental ElementsSplitting FieldsFinite FieldsGalois GroupsFundamental Theorem of Galois Theory

Longest path: 98 steps · 404 total prerequisite topics

Prerequisites (2)

Leads To (2)