Iterated derivative shifts
The shift $p\mapsto p-\varepsilon p'$ preserves real-rootedness for every real $\varepsilon$ and, for $\varepsilon>0$, produces an interlacing polynomial and, after $\deg p$ iterations, simple roots. It is the standard way to perturb a real-rooted polynomial into one with simple roots.
Results
For real $\varepsilon$ let $T_\varepsilon p=p-\varepsilon p'$.
Theorem (real-rootedness). If $p$ is real-rooted, then $T_\varepsilon p$ is real-rooted for every real $\varepsilon$, and so is every iterate $T_\varepsilon^kp$. If $p\ne0$, then $T_\varepsilon^kp\ne0$.
Theorem (interlacing). If $p\ne0$ is real-rooted and $\varepsilon>0$, then $p\ll T_\varepsilon p$.
Theorem (derivative). Let $p$ be real-rooted with positive leading coefficient and $\deg p\ge1$. If $\varepsilon\le0$, then $p'\ll T_\varepsilon p$. The same holds without the assumption on the leading coefficient of $p$ if $p=dq$ and $p'=dr$, where $d\ne0$ is real-rooted, $r\ll q$, and $q,r$ have positive leading coefficients.
Theorem (simple roots). Let $f\ne0$ be real-rooted and $\varepsilon>0$. If $\deg f=n$, then $T_\varepsilon^nf$ has simple roots. If $\deg f\le k$, then $T_{-\varepsilon}^kf$ has simple roots.
Theorem (nearby roots). Let $p$ be real-rooted, $a$ a root of $p$, $n\ge0$ and $\eta>0$. Then there is $\delta>0$ such that for every $0<\varepsilon<\delta$ the polynomial $T_\varepsilon^np$ has a real root $b$ with $$ |a-b|<\bigl((\deg p+1)\eta\bigr)^{1/\deg p}\max(|a|,1). $$ The same holds for the roots of the $k$-th derivative of $p$, and for $a$ with $k<\operatorname{mult}_a(p)$ it gives a root of $(T_\varepsilon^np)^{(k)}$ near $a$, with $\deg p$ replaced by $\deg p^{(k)}$ in the bound.
Theorem (sequences). Let $P_i\ne0$ be real-rooted, $\varepsilon_i>0$ and $k_i\in\mathbb N$. Then $T_{\varepsilon_i}^{k_i}P_i$ is real-rooted and $T_{\varepsilon_i}^{k_i}P_i\ll T_{\varepsilon_i}^{k_i+1}P_i$. Moreover, let $P_0\ne0$ and $F_n\ne0$ be real-rooted, and let $\varepsilon_n$ be real. If $P_{n+1}=F_n\,T_{\varepsilon_n}^{k_n}P_n$, or $P_{n+1}=T_{\varepsilon_n}^{k_n}P_n\,F_n$, then every $P_n$ is nonzero and real-rooted.
References
- [SP14] Über zwei Arten von Faktorenfolgen in der Theorie der algebraischen Gleichungen. J. Reine Angew. Math., 1914.
BibTeX
@article{SchurPolya1914, title={{\"U}ber zwei {A}rten von {F}aktorenfolgen in der {T}heorie der algebraischen {G}leichungen}, author={Schur, J and Polya, G}, year={1914}, journal={J. Reine Angew. Math.}, publisher={Walter de Gruyter, Berlin/New York Berlin, New York} } - [Obr63] Verteilung und Berechnung der Nullstellen reeller Polynome. Hochschulbücher für Mathematik, vol. 55, VEB Deutscher Verlag der Wissenschaften, 1963.
BibTeX
@book{Obreschkoff1963, author = {Obreschkoff, Nikola}, title = {Verteilung und Berechnung der Nullstellen reeller Polynome}, series = {Hochschulb{\"u}cher f{\"u}r Mathematik}, volume = {55}, publisher = {VEB Deutscher Verlag der Wissenschaften}, address = {Berlin}, year = {1963} }