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
2topics build on this
404prerequisites beneath it
See this on the map →
Galois GroupsInsolvability of the QuinticRuler and Compass Constructions (Algebraic Proof)
galois-correspondence subgroups fixed-fields

Core Idea

For a finite Galois extension K/F, there is a bijection between subgroups of Gal(K/F) and intermediate fields F ⊆ E ⊆ K. This bijection is order-reversing: larger subgroups correspond to smaller fields.

Explainer

The Fundamental Theorem of Galois Theory is the crowning result of the Galois correspondence — it reveals a complete dictionary between algebra (subgroups of the Galois group) and the geometry of field extensions (intermediate fields). Since you have studied Galois groups, you know that Gal(K/F) is the group of field automorphisms of K that fix F pointwise. The theorem says this group encodes everything about the "landscape" of intermediate fields sitting between F and K.

The key word is bijection: every subgroup H of Gal(K/F) corresponds to exactly one intermediate field E = KH (the fixed field of H), and every intermediate field corresponds to exactly one subgroup. Nothing is missed; nothing is duplicated. The fixed field KH consists of all elements of K that every automorphism in H leaves unchanged. You can think of H as a "symmetry group" of K — the elements that H's symmetries cannot disturb form precisely the fixed field.

The order-reversing character is the most surprising feature. Bigger subgroup → smaller fixed field. Why? A larger subgroup has more automorphisms, and with more automorphisms imposing rigidity, fewer elements survive — so the fixed field shrinks. Conversely, a smaller subgroup has fewer constraints, allowing more elements to be fixed. Formally, |Gal(K/E)| = [K:E] and [E:F] = [Gal(K/F) : Gal(K/E)]. The field degrees and subgroup indices match exactly, quantifying the correspondence.

There is also a structural theorem for normal subgroups: H is normal in Gal(K/F) if and only if the fixed field E = KH is itself a Galois extension of F. In that case, Gal(E/F) ≅ Gal(K/F)/H. Normal subgroups correspond to "nice" intermediate extensions — ones whose own Galois groups appear as quotients of the big Galois group. This is the algebraic link to the insolvability of the quintic: a polynomial is solvable by radicals if and only if its Galois group is solvable (has a chain of normal subgroups with abelian quotients), and the general quintic's Galois group S₅ is not solvable.

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 (1)

Leads To (2)