The alternating polynomial given by the Vandermonde product is alternating: interchanging two variables changes its sign. One proof writes it as a Vandermonde determinant, up to a fixed sign, and interchanging two variables interchanges the corresponding determinant rows. Since transpositions generate ,Thus every even permutation fixes , while a transposition negates the nonzero formal polynomial, so it is not invariant under all of . This uses and characteristic different from two, as in the subsequent rational setting. For both groups are trivial and the last distinction does not arise.
The discriminant is a symmetric polynomial in the four roots, so the Fundamental theorem of symmetric polynomials expresses it polynomially in the elementary symmetric polynomial. For this depressed quartic they are , , . Scaling each root by multiplies the discriminant by , while scale by . Thus only weighted-degree-twelve monomials can appear, giving .
For , use and the monic discriminant identity . At this gives , so . For , the roots are zero together with those of . The cubic's discriminant is . The extra squared differences from zero multiply this by , giving . HenceThese computations are polynomial identities, so they extend to parameter values with repeated roots as well.
For a polynomial with distinct roots, the criterion isWrite . Part (a) gives . If every Galois permutation is even, is fixed by the entire Galois group and therefore belongs to its fixed field . Thus is a rational square. Conversely, if with , then in a field implies . Every automorphism fixes this nonzero element, so its permutation sign must be one.
The distinct-root hypothesis is necessary in the statement's intended degree- permutation action. The source says “arbitrary degree” without stating that hypothesis. If repeated roots were allowed, zero discriminant would carry no sign information: has discriminant zero, while its nontrivial automorphism swaps and fixes the two rational-root positions, an odd permutation. The criterion above applies to the squarefree polynomial, or to the squarefree part with its degree and root action adjusted accordingly.
Set . The polynomial becomes , and translating all roots leaves their pairwise differences unchanged. Part (b) givesIt is nonzero and lies strictly between and . An integer which is a rational square is an integer square, so this is not a rational square. The roots are distinct because the discriminant is nonzero. By (c), .
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 . ThusThe 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 andFor 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. HenceThe 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.
A finite group is solvable if its derived series, defined by and , reaches the identity after finitely many steps. Equivalently it has a subnormal series with abelian factor groups. The factors need not all have prime order for this definition.
Let . This is an abelian subgroup, and conjugation preserves its nonidentity cycle type, so it is normal in and hence in . The serieshas factors , , and , all abelian. Thus .
The rotations form a cyclic subgroup of index two, so it is normal. The quotient has order two and is cyclic. Hence has abelian factors, proving . Its commutator subgroup is contained in the abelian rotation subgroup, so its second derived subgroup is already trivial.
Let and let be a primitive th root of unity. The roots are , so . Eisenstein gives , while the prime cyclotomic extension has degree . Both degrees divide , and they are coprime. Conversely adjoining to the cyclotomic field has degree at most . These two bounds giveRestriction to gives a normal subgroup of order , hence cyclic, with quotient . Restriction is onto because embeddings of the intermediate field extend in the finite Galois splitting field. Thus has abelian factors, proving . For the cyclotomic field is just , and the same argument gives degree two and a cyclic group.
Articles by others on the same topic
There are currently no matching articles.