Write a rational root of a polynomial as in lowest terms with . Substituting into the monic integer-coefficient polynomial and multiplying by gives
Every term other than is divisible by , so . But implies , and hence . Thus
This is the monic case of the rational root theorem. The monic polynomial assumption is essential because it removes any leading coefficient that could supply prime factors of the denominator.
A cubic polynomial over a field is reducible if and only if it has a root in that field: a nontrivial factorization of degree three has a linear polynomial factor, and conversely a root supplies one by the factor theorem.
The rational root theorem, or part (b), shows that a rational root of this monic polynomial must be an integer. Such an integer must divide the constant coefficient , so the only candidates are . Direct evaluation gives
None vanishes. Hence there is no rational root, proving
The same no-root argument alone would not decide a quartic polynomial, which could factor as two quadratic polynomials; its sufficiency here uses degree three.
Expansion down the last column gives the characteristic polynomial
The quadratic polynomial has roots , which are not rational numbers. For example, the rational root theorem restricts any rational root of this monic integer polynomial to or , and neither works. If had a diagonalization over , its characteristic polynomial would be a product of linear factors with rational numbers as their roots. It is not, so is not diagonalizable over .
Use completing the square in the Hermitian form , rather than unitary diagonalization of a normal matrix. The first pivot is one, so
A second square completion gives
Therefore one answer is
The diagonal entries of are rational, , and the displayed identity for every proves .
If were a unitary matrix, this matrix congruence would also be a similarity transformation, so the diagonal entries of would be the eigenvalues of . Its characteristic polynomial is
Thus its eigenvalues are , two of which are irrational. A unitary factor cannot give a rational diagonal here. Alternatively, the permitted rational root theorem implies that three rational eigenvalues would all be integers, whereas the quadratic factor has no integer roots.
A cubic over a field is reducible exactly when it has a root in that field: a nontrivial factorization must contain a degree-one factor. By the rational root theorem, a rational root of this monic integer polynomial must be an integer dividing its constant coefficient, hence either or . Substitution gives and , respectively. Neither is zero. Thus the cubic is irreducible over .
Write the rational number as with coprime integers and . Substituting into the monic polynomial and multiplying by gives
All terms except the first are divisible by , so . If , it has a prime factor dividing , and the Euclid lemma implies that this prime divides , contradicting coprimality. Thus , proving this special case of the rational root theorem:
For , the derivative is positive everywhere, so the mean value theorem makes strictly increasing. Since a polynomial is a continuous function, the intermediate value theorem and the values , locate its unique real root in . By the rational root theorem, a rational root of a monic integer polynomial must be an integer. There is no integer in , so the unique real root is an irrational number. The denominator part of that theorem also follows directly: if in lowest terms were a root, would force , hence .
Let be the Galois group of a polynomial of the irreducible quartic. Irreducibility makes a transitive subgroup of . The three roots of the given cubic resolvent of a quartic correspond to the three partitions of the four quartic roots into two unordered pairs, and the kernel of the -action on these partitions is the Klein four-group . If the resolvent has Galois group , the image of in this action is all of . Among the transitive subgroups of the symmetric group on four points, only has this image. Hence
Now put . The Eisenstein criterion at proves that is an irreducible polynomial, and its cubic resolvent is
Its discriminant of a depressed cubic is
For odd , the -adic valuation of is three because ; for , . Thus is never a square in .
By the rational root theorem, a reducible has an integer root among . Reduction modulo shows that the root is divisible by ; writing it as , with , gives
The only possibilities are and , corresponding to roots and . For every other prime, is irreducible with nonsquare discriminant, so its Galois group is and the criterion above gives the quartic group . For or , the reducible resolvent makes the quartic group a proper subgroup. Therefore
The element is a root of
By the rational root theorem, any rational root of this monic polynomial must be one of
Direct substitution shows that none is a root. A reducible cubic over a field has a linear factor, so is an irreducible polynomial over . It is therefore the minimal polynomial of , and
Irreducibility makes the quartic Galois group a transitive subgroup of . Its square discriminant puts it inside , leaving or . The cubic resolvent is
The rational root theorem shows it is irreducible over . Thus the Galois group acts transitively on the three pairings of four roots, excluding . Consequently
If a monic polynomial has roots in a splitting field, its polynomial discriminant is
It is a symmetric polynomial in the roots, so it belongs to the base field; it is nonzero exactly when is a separable polynomial.
Put
the Vandermonde determinant. A root permutation sends to . Hence the Galois group of a polynomial is contained in the alternating group exactly when every Galois automorphism fixes , which by the fixed-field property is equivalent to . This implies that is a square in . Conversely, if for , then , so . The Galois group therefore fixes and consists of even permutations. This proves the discriminant criterion for an alternating Galois group.
Now let
The rational root theorem shows that none of is a root, so this cubic is irreducible over . The discriminant of a depressed cubic is
This is not a square in , so the Galois group of an irreducible cubic is over .
Over , the discriminant is the square
The cubic remains irreducible: a root in the degree-two extension would generate over both a degree-three field, by irreducibility, and a subfield of a degree-two field, contradicting the tower law for field extensions. Its Galois group over is consequently .
The Fundamental theorem of symmetric polynomials states that every symmetric polynomial in variables over a field is a polynomial in the elementary symmetric polynomials, uniquely so. For the three roots, Vieta's formulas give , , .
The squared product of root differences is symmetric. Expansion in elementary symmetric polynomials gives
One can verify the displayed identity simply by substituting the definitions of and expanding; it is the cubic polynomial discriminant.
If the cubic is irreducible, its roots are distinct in characteristic zero, so . Its Galois group is a transitive subgroup of , hence either or . A permutation of the roots multiplies by its sign. The fixed-field assertion of the Fundamental theorem of Galois theory therefore gives exactly when all group elements are even. Thus
For example, has no rational root: neither nor is a root, and these are the only possibilities by the rational root theorem. Its discriminant is , so and its group is .