Automorphisms of Fields
An automorphism of a field is an isomorphism . For an extension , an -automorphism also fixes every element of . If is a root of , then is again a root of : -automorphisms PERMUTE the roots of polynomials over .
Applying to gives , because respects sums and products and leaves the coefficients (in ) alone. So an -automorphism can only move a root to another root of the same polynomial. If is generated by roots, an automorphism is completely determined by where it sends them, which turns field questions into questions about permutations — groups.
A -automorphism must send to a root of : either or . So there are exactly two: the identity and . For example , and respects products: .
A -automorphism of sends to a root of lying in . But that field is real, and has only one real root. So the only automorphism is the identity — even though the degree is .
An automorphism cannot send a root anywhere it likes: it must go to a root of the SAME minimal polynomial. In no automorphism sends to , since is not a root of .
Complex conjugation is an -automorphism of . Which roots of does it swap, and what is ?
Show the answerHide the answer
It swaps and . Since , its conjugate is , which equals — conjugation respects products.
The Galois Group
The -automorphisms of form a group under composition. When is the splitting field of a polynomial with distinct roots (a Galois extension), . The Galois group of a polynomial is the Galois group of its splitting field; it acts faithfully on the roots, so it is a subgroup of .
Here the two halves of the course meet. A field extension now has a group attached to it, the group of its symmetries, and the size of that group equals the degree of the extension. Computing a Galois group means deciding which permutations of the roots are realized by automorphisms.
An automorphism sends and independently, giving automorphisms — matching . Each non-identity one has order , so the group is , not .
The splitting field has degree , so the Galois group has order and sits inside , which also has order . So it is all of : every permutation of the three roots comes from an automorphism. It is non-abelian.
is cyclic of order , generated by the Frobenius automorphism (it respects sums by the freshman's dream). For the group is : .
only for Galois extensions. has degree but only automorphism, because it is not the splitting field of .
What is the order of the Galois group of over ?
Show the answerHide the answer
Its splitting field is , of degree , so the group has order (it is cyclic, ).
The Fundamental Theorem of Galois Theory
For a finite Galois extension with group , the maps (the fixed field) and are inverse bijections between subgroups and intermediate fields . They reverse inclusion, and , . Moreover is Galois exactly when is normal in .
This is the theorem the whole course has been building towards. Questions about fields between and — how many there are, their degrees, which are themselves splitting fields — become questions about the subgroups of one finite group, which the first half taught you to answer. Bigger subgroups fix smaller fields.
has subgroups: the trivial one, three of order , and . So there are intermediate fields: , the three quadratic fields , , , and .
has subgroups, so the splitting field has intermediate fields: , , the quadratic field (fixed by , normal — and indeed is Galois), and three cubic fields , , fixed by the three subgroups of order , which are not normal.
The correspondence reverses inclusion: the WHOLE group corresponds to the SMALLEST field , and the trivial subgroup to the largest field . Mixing this up gives degrees upside down; use to keep track.
The Galois group of is cyclic of order . How many intermediate fields are there, counting and ?
Show the answerHide the answer
A cyclic group of order has one subgroup for each divisor of : — so intermediate fields.
Solvability by Radicals
A polynomial over can be solved by radicals (its roots expressed using and -th roots) exactly when its Galois group is a solvable group. are solvable, which is why there are formulas for degrees ; is not, because is simple.
Adjoining an -th root produces an extension whose Galois group is abelian (given the roots of unity), so a radical formula builds the splitting field through a chain of abelian steps — and the Galois group must break down into abelian pieces, which is what "solvable" means. An irreducible quintic whose Galois group is therefore has no formula in radicals. The Sylow and simple-group results of the first half are exactly what proves is not solvable.
is irreducible (Eisenstein, ) and has exactly real roots, so complex conjugation swaps the other two: the Galois group contains a transposition. It also contains a -cycle (since divides the degree of the splitting field). A transposition and a -cycle generate , so the Galois group is , of order , and the roots cannot be written with radicals.
is solved by radicals: its roots are . Its Galois group has order and is solvable, consistent with the criterion.
The theorem does not say quintics are never solvable — and are. It says there is no single formula for ALL quintics, and that particular ones, like , cannot be solved by radicals at all.
Why does every polynomial of degree at most have a solution in radicals?
Show the answerHide the answer
Its Galois group is a subgroup of (or smaller), and is solvable ( with abelian quotients); subgroups of solvable groups are solvable. So the criterion is met.
Why It Works
If with and , then , using that fixes each .
If and is the minimal polynomial of , an -automorphism is determined by , which must be a root of in . There are at most such roots, with equality when splits into distinct linear factors in .
If has fixed field , then is Galois with group , so . The tower law gives — Lagrange's theorem and the tower law are two views of the same count.