TOPICS
Search

Real-Rooted Polynomial


A real-rooted polynomial is a nonzero polynomial all of whose complex roots are real numbers. For a polynomial p(x)=sum_(k=0)^(m)a_kx^k of polynomial degree m with nonnegative coefficients, real-rootedness implies that the sequence a_0, ..., a_m is an ultra log-concave sequence, and hence a logarithmically concave sequence (Xie and Xu 2026, p. 3). Real-rootedness therefore gives coefficient inequalities stronger than ordinary log-concavity.

For example, (1+x)^m is real-rooted and its normalized coefficients a_k/(m; k) are all 1. The dependence polynomial of a finite simple graph has a complete real-rootedness classification due to Xie and Xu (2026, p. 4).

The derivative of a nonconstant real-rooted polynomial is again real-rooted by Rolle's theorem. Repeated differentiation therefore preserves real-rootedness until a nonzero constant is reached.

A nonconstant monic polynomial p is real-rooted iff it is the characteristic polynomial det(xI-T) of a real symmetric matrix T. Schmeisser (1993, pp. 13-14) gives a tridiagonal matrix construction from the coefficients, including repeated roots. For distinct roots, this matrix is similar to the companion matrix. Repeated roots require distinguishing the characteristic polynomial from the matrix minimal polynomial.

A monic polynomial of fixed positive polynomial degree in one variable whose coefficients are real analytic in one real parameter t on an open interval, and which is real-rooted for every t in that interval, admits real analytic root functions (Alekseevsky et al. 1998). These functions need not remain in increasing order. For example, x^2-t^2 has the analytic roots t and -t, whereas the increasing choice -|t|, |t| is not differentiable at t=0.

For smooth coefficients, root functions can always be chosen twice differentiable, but their second derivatives need not be continuous (Kriegl et al. 2004). Thus twice differentiable does not mean C2. The restriction to one parameter is essential for the real analytic statement. The polynomial x^2-s^2-t^2 is real-rooted for every (s,t) in R^2, but its roots cannot be chosen differentiably near (0,0) (Alekseevsky et al. 1998).


See also

Characteristic Polynomial, Companion Matrix, Dependence Polynomial, Descartes' Sign Rule, Hyperbolic Polynomial, Logarithmically Concave Sequence, Polynomial, Real Root, Real Symmetric Matrix, Rolle's Theorem, Root, Sturm Theorem, Tridiagonal Matrix, Ultra Log-Concave Sequence

Explore with Wolfram|Alpha

References

Alekseevsky, D.; Kriegl, A.; Michor, P. W.; and Losik, M. "Choosing Roots of Polynomials Smoothly." Israel J. Math. 105, 203-233, 1998. https://doi.org/10.1007/BF02780330.Kriegl, A.; Losik, M.; and Michor, P. W. "Choosing Roots of Polynomials Smoothly, II." Israel J. Math. 139, 183-188, 2004. https://doi.org/10.1007/BF02787548.Schmeisser, G. "A Real Symmetric Tridiagonal Matrix with a Given Characteristic Polynomial." Lin. Alg. Appl. 193, 11-18, 1993. https://doi.org/10.1016/0024-3795(93)90268-S.Xie, Y.-T. and Xu, S.-J. "Ultra Log-Concavity and Real-Rootedness of Dependence Polynomials." Elec. J. Combin. 33, P4.9, 2026. https://doi.org/10.37236/13310.

Cite this as:

Weisstein, Eric W. "Real-Rooted Polynomial." From MathWorld--A Wolfram Resource. https://mathworld.wolfram.com/Real-RootedPolynomial.html

Subject classifications