The Galois Correspondence
Galois theory attaches to a field extension its group of symmetries and shows that, for the right extensions, the subgroups of that group are in exact order-reversing correspondence with the intermediate fields. The automorphism group, Artin's theorem, the characterization of Galois extensions, and the Fundamental Theorem together turn questions about fields into questions about finite groups.
╌╌╌╌
A field extension records that is a larger field containing . Galois theory studies its symmetries: the ways can be rearranged that leave untouched. These symmetries form a group, and for a well-behaved class of extensions the internal structure of that group reproduces, exactly and in reverse, the lattice of fields lying between and . A question about fields (which subfields exist, which are themselves symmetric over ) becomes a question about a finite group (which subgroups exist, which are normal). The insolvability of the quintic and the three classical construction problems are settled by reading group structure off the extension.
Automorphisms and the group they form
Composition of automorphisms is again an automorphism, and the inverse of an isomorphism is an isomorphism, so is a group under composition. The identity map is always present. Every automorphism sends and , hence fixes the entire prime subfield generated by . So and admit only the identity: and .
The single fact that makes these groups computable is that an automorphism cannot move a root of a polynomial anywhere except to another root of the same polynomial.
The proof is a one-line consequence of being a ring homomorphism that fixes . If with , then applying and using gives , so satisfies the same equation.1 Two corollaries follow immediately:
- Automorphisms are determined by their action on generators. If , then is determined by the values , each of which is a root of the corresponding minimal polynomial.
- is finite for finite extensions. There are finitely many generators, each with finitely many conjugate roots, so only finitely many candidate maps exist.
Not every assignment of generators to conjugate roots yields an automorphism — the generators may satisfy algebraic relations that any automorphism must respect. This is the recurring subtlety in computing a Galois group by hand.
First examples
Fixed fields and the Galois connection
The construction runs both ways. From a subfield we produced a group of automorphisms; from a group of automorphisms we recover a subfield.
That is closed under the field operations follows because each is a homomorphism: if fixes and then it fixes , , and . The two constructions — subfield fixing group and subgroup fixed field — are inclusion-reversing.
A larger field imposes more conditions to fix, so fewer automorphisms qualify; a larger group of automorphisms fixes fewer elements. This pair of arrows between the poset of subfields and the poset of subgroups is a Galois connection. The content of the theory is that, restricted to the right extensions, the connection is a bijection.
Bounding the automorphism count
The example showed the automorphism group can be smaller than the degree. It is never larger. The bound comes from counting extensions of an isomorphism to a splitting field.
The proof is an induction on using the extension theorem for isomorphisms of base fields: an isomorphism extends to at most isomorphisms of the splitting fields, and to exactly when the irreducible factors have distinct roots.2 Taking and specializes the count to automorphisms. The same argument, refined in the next section, gives for every finite extension.
Artin's theorem
The counting bound goes one direction. The reverse — that a finite group of automorphisms is the full automorphism group of its fixed field, and the degree equals the group order — is a theorem of Artin, and it rests on a lemma about the independence of characters.
An embedding restricts to a character , and this character carries all the information about (only is omitted, and ). So the following theorem applies directly to field automorphisms.
The proof takes a minimal-length dependence relation , picks with , evaluates the relation at , and subtracts times the original. The term cancels while the term remains with nonzero coefficient, producing a shorter relation, contradicting minimality.4 The application to fields is Artin's theorem.
Both inequalities are proved by manufacturing a linear dependence among the where none can exist. If , a homogeneous system with more unknowns than equations has a nonzero solution, which assembles into a dependence of the over — impossible by independence of characters. If , one takes elements independent over and, using that is closed under composition, again extracts a shorter-than-minimal dependence.5 Three corollaries follow.
- Sharp bound. for any finite extension, with equality if and only if is the fixed field of . So is Galois exactly when .
- No hidden automorphisms. If is a finite group of automorphisms with fixed field , then exactly; is Galois with Galois group .
- Distinct groups, distinct fixed fields. Different finite subgroups of have different fixed fields.
The last corollary is the injectivity that the Fundamental Theorem upgrades to a bijection: taking fixed fields is a one-to-one map from subgroups to intermediate fields.
Characterizations of a Galois extension
Artin's theorem also delivers the converse of the counting bound and, with it, a structural characterization.
The forward direction shows that for any , the distinct images are the roots of a polynomial whose coefficients, being symmetric under , lie in the fixed field . Since the minimal polynomial of divides and divides it, they are equal — so the minimal polynomial is separable and splits in .6 This yields four interchangeable descriptions.
| # | Characterization | Emphasis |
|---|---|---|
| 1 | Splitting field of a separable polynomial over | existence of enough roots |
| 2 | equals the fixed field of | nothing outside is fixed |
| 3 | maximal automorphism count | |
| 4 | Finite, normal, and separable | roots and repeated-root conditions |
A normal extension is one that, containing a single root of an irreducible polynomial, contains all of them; a separable extension has minimal polynomials with distinct roots. An extension fails to be Galois the moment one irreducible polynomial has a root in but not all of them; fails on this very point.
The Fundamental Theorem
Let be Galois with group .
The bijection is the two Artin corollaries: distinct subgroups have distinct fixed fields (injective), and every intermediate field is the fixed field of because is the splitting field of the same separable polynomial viewed over (surjective). The degree statements are Artin applied to and the tower law.
The normality clause has an operational reading: conjugating by yields , so is stable under all of exactly when for all , i.e. . When is not Galois, the elements of still act, but they carry to conjugate fields isomorphic to it rather than back to itself.
A worked correspondence:
The field is the splitting field of , hence Galois of degree over . An automorphism sends and independently, giving four maps, all of which are automorphisms. Writing for the sign flip on and for the sign flip on ,
the Klein four-group. Every subgroup of an abelian group is normal, so every intermediate field is Galois over . The three subgroups of order correspond to the three quadratic subfields.
| Subgroup | Fixed field | |
|---|---|---|
The composite fixes because it flips both factors. Displaying the two lattices side by side, inverted so that inclusions match, shows the bijection concretely.
A non-abelian correspondence: the splitting field of
The splitting field of over is , where is a primitive cube root of unity. It has degree , and the Galois group permutes the three roots faithfully, so . Generators are (a -cycle of the roots, sending and fixing ) and (complex conjugation, fixing and sending ), with and .
The subgroups of dictate the intermediate fields. Complex conjugation fixes the real root , and the -cycle generates the unique normal subgroup . The full correspondence has six matched pairs.
| Subgroup | Order | Fixed field | Normal | |
|---|---|---|---|---|
| yes | ||||
| yes | ||||
| no | ||||
| no | ||||
| no | ||||
| yes |
The three normal subgroups match the three fields Galois over : itself, the quadratic with , and the base . The three conjugate order- subgroups match the three cubic fields — isomorphic but distinct, permuted by as it conjugates the subgroups. None is Galois over , since each holds one root of and misses the other two.
Footnotes
- Dummit & Foote, Abstract Algebra, §14.1, Proposition 2 — automorphisms fixing permute the roots of any polynomial over ; an automorphism of is determined by its action on a generating set. ↩
- Dummit & Foote, Abstract Algebra, §14.1, Proposition 5 — the number of automorphisms of a splitting field is at most , with equality for separable polynomials, proved by induction via the isomorphism-extension theorem (Theorem 13.27). ↩
- Dummit & Foote, Abstract Algebra, §14.1, Corollary 6 and the Galois-extension definition — defines Galois; splitting fields of separable polynomials attain the bound. ↩
- Dummit & Foote, Abstract Algebra, §14.2, Theorem 7 and Corollary 8 (linear independence of characters) — distinct characters, and hence distinct embeddings and automorphisms, are linearly independent as functions. ↩
- Dummit & Foote, Abstract Algebra, §14.2, Theorem 9 (Artin) and Corollaries 10–12 — for a finite group of automorphisms with fixed field , ; distinct finite subgroups have distinct fixed fields. ↩
- Dummit & Foote, Abstract Algebra, §14.2, Theorem 13 and Theorem 14 (Fundamental Theorem) — the four characterizations of Galois extensions and the inclusion-reversing bijection between subfields and subgroups, with the normality clause . ↩
╌╌ END ╌╌