Continuity of roots
Real-rootedness of monic polynomials of fixed degree is preserved under coefficientwise limits, and it propagates along continuous families of squarefree polynomials. Root counts are constant across intervals without roots. These facts are the basic tools for deformation and limit arguments.
Results
We write $\lVert p\rVert_1$ for the sum of the absolute values of the coefficients of $p$. Roots are counted with multiplicity.
Theorem (closure). Let $f$ be monic. If for every $\varepsilon>0$ there is a monic real-rooted polynomial $g$ of degree $\deg f$ with all coefficients within $\varepsilon$ of those of $f$, then $f$ is real-rooted. In particular, a coefficientwise limit of monic real-rooted polynomials of degree $\deg f$ is real-rooted.
Theorem (continuous families). Let $P_t$ be real polynomials of constant degree $d$ for $t$ in a preconnected set $S$, with each coefficient continuous in $t$ and each $P_t$ squarefree (equivalently, separable). If $P_a$ is real-rooted for some $a\in S$, then $P_b$ is real-rooted for all $b\in S$.
Theorem (nearby roots). Let $f,g$ be monic of the same degree $m$, let $g$ be real-rooted, and let all coefficients of $g$ be within $\varepsilon>0$ of those of $f$. For every complex root $z$ of $f$ there is a complex root $w$ of $g$ with $$|z-w|<\bigl((m+1)\varepsilon\bigr)^{1/m}\max(|z|,1).$$
Theorem (pencils). Let $f,g$ be monic of the same degree $m$, let $t>0$ and $\varepsilon>0$ with $(t+1)^{-1}(\lVert f\rVert_1+\lVert g\rVert_1)<\varepsilon$, and let $tf+g$ be nonzero and real-rooted. For every real root $a$ of $f$ there is a real root $b$ of $tf+g$, and for every complex root $z$ of $f$ there is a complex root $w$ of $tf+g$, within $((m+1)\varepsilon)^{1/m}\max(|a|,1)$, respectively $((m+1)\varepsilon)^{1/m}\max(|z|,1)$. Such $t>0$ exists for every $\varepsilon>0$.
Theorem (degree-increasing perturbation). Let $f$ be real-rooted, $\deg f<\deg g$ and $\rho>0$. There is $\delta>0$ such that for all $0<\mu<\delta$ with $f+\mu g$ real-rooted, every root $a$ of $f$ of multiplicity $k$ has at least $k$ roots of $f+\mu g$ within distance $\rho$ of $a$.
Theorem (root counts). Let $a\le b$ and let $p$ have no root in $[a,b]$. Then $p$ has equally many roots $\le a$ and $\le b$, equally many roots $>a$ and $>b$, and no root in $(a,b]$. If $f,g$ both have no root in $[a,b]$, then the number of roots $\le t$ of $f$ minus that of $g$, and likewise for roots $>t$, agree at $t=a$ and $t=b$. If $f,g$ have no root in $(a,b)$, the difference of the numbers of roots $>t$ is the same for all $t\in(a,b)$, and so is its parity.
Lemmas. For real $\mu\ne0$, the polynomials $f+\mu g$ and $g+\mu^{-1}f$ have the same roots. If $h\ne0$ is real-rooted and $f(-u^2)=u^n\,h\bigl((1-u^2)/u\bigr)$ for all nonzero $u\in\mathbb C$, then $f$ is real-rooted. If $t\mapsto P_t(a)$ is continuous and nonvanishing on $[t_0,t_1]$, then $P_{t_0}(a)\,P_{t_1}(a)>0$.
References
For the continuity of zeros, see [RS02].
- [RS02] Analytic Theory of Polynomials. London Mathematical Society Monographs, Oxford University Press, 2002.
BibTeX
@book{RahmanSchmeisser2002, author = {Rahman, Q. I. and Schmeisser, G.}, title = {Analytic Theory of Polynomials}, publisher = {Oxford University Press}, series = {London Mathematical Society Monographs}, year = {2002} }