Interlacing from a monomial chain
A linear operator that preserves nonnegative coefficients and real-rootedness of PF inputs, and maps the monomials $1,x,\dotsc,x^D$ to an interlacing chain, preserves interlacing of pairs with nonnegative coefficients and degree at most $D$. This reduces interlacing preservation to a check on monomials.
Results
A polynomial is PF (Pólya frequency) if it is zero or has nonnegative coefficients and only real, nonpositive roots.
Theorem (monomial chain). Let $T$ be a real-linear operator on $\mathbb R[x]$ and $D\in\mathbb N$. Suppose that
- $T$ maps polynomials with nonnegative coefficients to polynomials with nonnegative coefficients;
- $T$ maps every nonzero PF polynomial of degree at most $D$ to a nonzero real-rooted polynomial;
- $T(1)\ll T(x)\ll\dotsb\ll T(x^D)$.
If $f\ll g$ have nonnegative coefficients and $\deg g\le D$, then $Tf\ll Tg$.
Theorem (rootwise order). Let $T$ satisfy (1)--(3), and in addition $\deg Tp=D$ whenever $\deg p=D$. Let $r_1,\dotsc,r_D\le0$ be the roots of a monic polynomial $p$ of degree $D$.
- If one root $r_i$ is replaced by some $b$ with $r_i\le b\le0$, then each root of the image $T p$, in increasing order, does not decrease.
- If $0\le a\le b$ and all roots of $p$ lie in $[-b,-a]$, then each root of $T\bigl((x+b)^D\bigr)$ is at most the corresponding root of $Tp$, which is at most the corresponding root of $T\bigl((x+a)^D\bigr)$.
Theorem (root derivative). Let $T$ be linear, $p=\prod_i(x-r_i)$, and let $\rho$ be a simple root of $Tp$. Then for each $i$ there is a function $\rho(s)$, differentiable at $0$, with $\rho(0)=\rho$ and $\rho(s)$ a root of $T\bigl((x-r_i-s)\prod_{j\ne i}(x-r_j)\bigr)$ for all small $s$, and $$ \rho'(0)=\frac{T\bigl(p/(x-r_i)\bigr)(\rho)}{(Tp)'(\rho)} . $$
Theorem (stable pencils). Let $T$ satisfy (1)--(3), and let $f,g\ne0$ have nonnegative coefficients with $1\le\deg f\le D$ and $\deg Tf\ge1$. If $f(z)+w\,g(z)$ is upper-half-plane stable, then so is $(Tf)(z)+w\,(Tg)(z)$.
Corollary (Narayana transform). The Mao–Wang Narayana transform $N_m$ satisfies $N_mf\ll N_mg$ whenever $f\ll g$ have nonnegative coefficients; see the Narayana page.
The proof rests on a closure property of quadratic pencils. Let $F\ll G\ll H$ have nonnegative coefficients. For $b\ge0$ put $$ Q_b=H+2bG+b^2F,\qquad A_b=G+bF,\qquad B_b=H+bG . $$
Theorem (quadratic closure). If $Q_b$ is real-rooted for every $b\ge0$, then $A_a\ll Q_a$ and $A_a\ll B_a$ for every $a\ge0$. That is, $$ G+aF\ \ll\ H+aG . $$
If $F,G,H$ have positive leading coefficients and $r$ is a root of none of them, then the quadratic $b\mapsto Q_b(r)$ has at most as many positive roots as the number of roots of $H$ above $r$ minus the number of roots of $F$ above $r$.
Proof
The quadratic closure propagates the monomial chain through all PF inputs, one nonpositive linear factor at a time. The Garloff–Wagner Krein expansion then passes from one-root deletions to every interlacing pair.
References
- [Bra11] Iterated sequences and the geometry of zeros. Journal für die reine und angewandte Mathematik (Crelles Journal), 2011(658), 2011.
BibTeX
@article{Branden2011b, author = {Brändén, Petter}, title = {Iterated sequences and the geometry of zeros}, year = {2011}, journal = {Journal für die reine und angewandte Mathematik (Crelles Journal)}, volume = {2011}, number = {658}, doi = {10.1515/crelle.2011.063}, url = {https://doi.org/10.1515/crelle.2011.063} }