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.
Use the reduction criterion: a primitive integer-coefficient polynomial whose leading coefficient remains nonzero modulo a prime number is irreducible over if its reduction is irreducible over . This follows from Gauss lemma for polynomials, since a nontrivial factorization over the integers would reduce to a nontrivial factorization of the same degrees. For a monic polynomial the factors may be taken monic, so neither degree can drop.
Modulo the polynomial is . Its values at and are both , so it has no linear polynomial factor. A reducible quartic polynomial without a linear polynomial factor must factor into two irreducible quadratic polynomials. The only monic irreducible quadratic polynomial over is : among monic quadratic polynomials a nonzero constant is necessary, and has a root, while has none.
But , so and . Consequently
Thus does not divide , excluding the remaining possible factorization. We obtain
At ,
This is an overestimate, with signed quadrature error
The relative error is , approximately . The quartic polynomial lies beyond the degree of precision of a quadrature rule of Simpson's rule, so the exactness of the previous cases no longer applies.
Fix , write , , and let on this interval. The Hermite interpolation conditions give both
Two applications of integration by parts therefore give
On this single cubic piece, the same calculation also gives
Here inside the interval, and all four endpoint values of are zero. Since , we obtain the exact identity
This is an integral inequality, with no assertion that the integrand on the left has one sign pointwise. The stronger nodal derivative conditions make the boundary terms vanish on each interval separately; part (i) only needed their cancellation after summing.
The stated Hermite interpolating polynomial exists uniquely in . Indeed, a polynomial in the kernel of a linear map of the value-and-derivative data map has a double root of a polynomial at each of distinct interpolation nodes. A nonzero such polynomial would have polynomial degree at least , which is impossible. The map is therefore an injective function and a linear map between vector spaces of the same finite dimension of a vector space, , and hence is a linear isomorphism. No higher smoothness of the original function is required to construct it.
An explicit illustration uses interpolation nodes , values , and zero derivatives at every interpolation node. The clamped cubic spline is on and its reflection on . Its Hermite interpolating polynomial is the quartic polynomial . On , , and the corresponding reflected formula holds on . Direct integration gives , , and , exactly as the energy identity predicts.
Suppose a monic real quartic polynomial has no nonnegative real zero and its real part on the imaginary axis is everywhere positive. For sufficiently large , its image of the quarter-circle arc from to , closed by the straight chord from to , has winding number one: compare with on the arc and its constant image on the chord. The rest of the actual sector boundary maps into the right half-plane, so its replacement by that chord preserves the winding number. The argument principle then counts exactly one root in the open first quadrant, including multiplicity.