Obreschkoff's theorem revisited: What convex sets are contained in the set of hyperbolic polynomials? (Q1207527)

This paper concerns the geometry of the set \(H_ n\) of polynomials with real coefficients of exact degree \(n\) all of whose roots are real. Generalizing a result of Obreschkoff, he characterizes polynomials \(f\) and \(g\) in \(H_ n\) for which \(h_ \theta=(1-\theta)f+\theta g\) lies in \(H_ n\) for all \(\theta\in[0,1]\). If \(r_ 1\leq r_ 2\leq\dots\leq r_ n\) and \(s_ 1\leq s_ 2\leq\dots\leq s_ n\) are the zeros of \(f\) and \(g\), respectively, then the condition that \(h_ \theta\) lies in \(H_ n\) for all \(\theta\in [0,1]\) is equivalent to the root separation condition that \(\max(r_ k,s_ k)\leq\min(r_{k+1},s_{k+1})\) for \(k=1,\dots,n-1\). The proof is complicated by the possibility of common and/or repeated roots. Note that the result can be interpreted as an interesting statement about the paths \(r_ k(\theta)\) from the roots of \(f\) to the roots of \(g\) under the homotopy \(h_ \theta\). This result is used to construct a polygonal path between any pair \(f\), \(g\) in \(H_ n\). An explicit bound is given for the length of the path. The result is also used to answer the question posed in the title.