Interlacing from a monomial chain
Let $T$ be a real-linear operator on polynomials of degree at most $D$. Suppose that $T$ preserves nonnegative coefficients, sends every nonzero PF polynomial in the degree box to a nonzero real-rooted polynomial, and its monomial images form the oriented chain
Then $T$ preserves oriented interlacing of nonnegative-coefficient real-rooted inputs in the same degree box. The quadratic tangent theorem propagates the monomial chain through each nonpositive linear factor.
The proof first propagates the monomial chain through all PF factors, and then uses the Garloff–Wagner Krein expansion to pass from one-root deletions to every oriented interlacing pair.
References
The decomposition step uses the Krein expansion for interlacing polynomials; the operator perspective is related to P. Brändén, “Iterated sequences and the geometry of zeros,” Journal für die reine und angewandte Mathematik 658 (2011), 115–131.