A splitting field is an extension in which the polynomial factors into linear factors and which is generated over the base field by its roots. Prove existence together with the factorial divisibility by strong induction on , with degrees zero and one immediate for a nonzero polynomial.
If is reducible, write with , . By induction first split in with degree dividing , then split over with degree dividing . The resulting field is generated over by all roots of , hence is a splitting field. Its degree divides , which divides because the binomial coefficient is an integer.
If is irreducible, adjoin a root , obtaining degree . Over this field divide out and split the degree- quotient by induction. That splitting field together with the base already contains every root and has degree over dividing . Thus
The reducible/irreducible distinction proves divisibility, not just an upper bound on the degree, and works without assuming separability.
In the distinct-root convention, a polynomial is separable if it has no repeated roots in its splitting field, equivalently . A common factorwise convention instead requires each distinct irreducible factor to have no repeated roots; repeated occurrences of an already separable factor do not affect the splitting field. Under either separability convention, the splitting field is a finite normal separable extension and
For failure in the inseparable case, take and . It is irreducible, for example by Eisenstein at the prime in . Its splitting field is of degree , but the polynomial has just one distinct root. Every -automorphism fixes that root, so the Galois group is trivial rather than having order .
Factor . Its splitting field is . The first quadratic field is real, so it cannot contain the nonreal . Thus adjoining the second square root doubles the degree again. Independent sign changes of the two square roots give all four automorphisms, so
Eisenstein's criterion at two makes irreducible: all nonleading coefficients are divisible by two and the constant is not divisible by four. Its Galois group is therefore transitive on five roots, and its order is divisible by five, so Cauchy's theorem for finite groups supplies a five-cycle.
The derivative is , with real critical points , . The values are and . The derivative is positive outside these two points and negative between them, so there are exactly three real roots and one nonreal conjugate pair. Complex conjugation therefore acts as a single transposition.
A five-cycle together with any transposition generates : conjugating that transposition by powers of the cycle gives edges joining labels with a fixed nonzero difference modulo five. These edges form a connected graph, and transpositions on a connected graph generate the symmetric group. Hence
The equality of degree and group order uses separability in characteristic zero.
The nonzero cubes modulo thirteen are , which excludes three. Thus this cubic has no root in its base field and is irreducible. For a root , the extension has degree three. The base field already contains the primitive cube root of unity , since and . Hence the other two roots are and , already in this extension, making it the full splitting field.
The Frobenius endomorphism satisfies , so it cycles all three roots. Therefore

Articles by others on the same topic (0)

There are currently no matching articles.