Diagonal operators of PF multiplier sequences and interlacing

A diagonal operator $x^n\mapsto\gamma_nx^n$ coming from a finite PF multiplier sequence preserves interlacing of PF polynomials. For multiplier sequences of real-rootedness, the orientation of the image pair is decided by the sign of one ratio $\gamma_{d-1}/\gamma_d$.

Results

For $\gamma:\mathbb N\to\mathbb R$ let $\Gamma\bigl(\sum a_nx^n\bigr)=\sum\gamma_na_nx^n$. A polynomial is PF if it has nonnegative coefficients and is zero or has only real, nonpositive roots. We say $\gamma$ is a finite PF multiplier sequence of degree $N$ if $\Gamma$ maps PF polynomials of degree at most $N$ to PF polynomials, and a finite multiplier sequence of degree $N$ if $\Gamma$ maps real-rooted polynomials of degree at most $N$ to zero or to real-rooted polynomials. On this page $f\ll g$ also holds when $f$ or $g$ is zero, as in the zero-aware convention, unless $f$ and $g$ are said to be nonzero.

Theorem (PF multipliers). Let $\gamma$ be a finite PF multiplier sequence of degree $N$, and let $f,g$ be PF polynomials of degree at most $N$ with $f\ll g$. Then $\Gamma f\ll\Gamma g$.

Theorem (orientation). Let $\gamma$ be a finite multiplier sequence of degree $N$, let $f\ll g$ be nonzero with $\deg f,\deg g\le N$, and suppose $\gamma_{\deg f}\ne0$ and $\gamma_{\deg g}\ne0$. Put $d=\deg f$ and $\rho=\gamma_{d-1}/\gamma_d$, reading $d-1$ as $0$ when $d=0$.

In each case the images are nonzero.

Theorem (weighted sums). Let $\gamma$ be a multiplier sequence with $\gamma_k>0$ for all $k$, let $h$ be a nonzero polynomial, and let $a_1,\dotsc,a_r\ge0$ with some $a_i>0$. Let $p_1,\dotsc,p_r$ have positive leading coefficients. If $h\ll p_i$ for all $i$, then $\Gamma h\ll\sum_ia_i\,\Gamma p_i$, and both sides are nonzero. If $p_i\ll h$ for all $i$, then $\sum_ia_i\,\Gamma p_i\ll\Gamma h$.

Theorem (lists). Let $\gamma$ be a finite PF multiplier sequence of degree $N$ and let $f_1,\dotsc,f_r$ be polynomials of degree at most $N$ such that $f_i\ll f_j$ for $i<j$, every $f_i$ has nonnegative coefficients, and every nonzero $f_i$ is real-rooted. Then $\Gamma f_1,\dotsc,\Gamma f_r$ has the same three properties.

References

  1. [BB09] Julius Borcea & Petter Brändén. The Lee–Yang and Pólya–Schur programs. I. Linear operators preserving stability. Inventiones mathematicae, 177(3), 541-569, 2009.
    BibTeX
    @article{BorceaBranden2009I,
      doi = {10.1007/s00222-009-0189-3},
      url2 = {https://doi.org/10.1007/s00222-009-0189-3},
      year = {2009},
      month = mar,
      publisher = {Springer Science and Business Media {LLC}},
      volume = {177},
      number = {3},
      pages = {541--569},
      author = {Julius Borcea and Petter Br{\"{a}}nd{\'{e}}n},
      title = {The {L}ee--{Y}ang and {P}{\'{o}}lya--{S}chur programs. {I}. {L}inear operators preserving stability},
      journal = {Inventiones mathematicae}
    }
  2. [BB10] J. Borcea & P. Brändén. Multivariate Pólya--Schur classification problems in the Weyl algebra. Proceedings of the London Mathematical Society, 101(1), 73-104, 2010.
    BibTeX
    @article{BorceaBranden2010,
      eprint = {math/0606360},
      doi = {10.1112/plms/pdp049},
      url = {https://doi.org/10.1112/plms/pdp049},
      year = {2010},
      month = jul,
      publisher = {Wiley},
      volume = {101},
      number = {1},
      pages = {73--104},
      author = {J. Borcea and P. Br{\"{a}}nd{\'{e}}n},
      title = {Multivariate {P}{\'{o}}lya--{S}chur classification problems in the {W}eyl algebra},
      journal = {Proceedings of the London Mathematical Society}
    }
  3. [Bra15] Petter Brändén. Unimodality, Log-Concavity, Real-Rootedness and Beyond. Handbook of enumerative combinatorics, 437-483, 2015.
    BibTeX
    @incollection{Branden2015,
      doi = {10.1201/b18255-10},
      year = {2015},
      month = mar,
      publisher = {Chapman and Hall/{CRC}},
      pages = {437--483},
      author = {Petter Br{\"{a}}nd{\'{e}}n},
      title = {Unimodality, Log-Concavity, Real-Rootedness and Beyond},
      booktitle = {Handbook of Enumerative Combinatorics}
    }

Theorems

  • Finite PF multipliers preserve directed interlacingMain result

    RealRooted.IsFinitePFMultiplierSequence.interl_diagonalOperatorsource
    theorem IsFinitePFMultiplierSequence.interl_diagonalOperator
        {N : ℕ} {gamma : ℕ → ℝ}
        (hgamma : IsFinitePFMultiplierSequence N gamma)
        {f g : ℝ[X]} (hf : IsPFPolynomial f) (hg : IsPFPolynomial g)
        (hfg : Interl f g)
        (hfdeg : f.natDegree ≤ N) (hgdeg : g.natDegree ≤ N) :
        Interl (diagonalOperator gamma f) (diagonalOperator gamma g)
  • Nonpositive adjacent multipliers reverse strict interlacing

    RealRooted.IsFiniteMultiplierSequence.strictInterl_diagonalOperator_reversesource
    theorem IsFiniteMultiplierSequence.strictInterl_diagonalOperator_reverse
        {N : ℕ} {gamma : ℕ → ℝ}
        (hgamma : IsFiniteMultiplierSequence N gamma)
        {f g : ℝ[X]} (hfg : StrictInterl f g)
        (hfdeg : f.natDegree ≤ N) (hgdeg : g.natDegree ≤ N)
        (hdegree : f.natDegree = g.natDegree)
        (hgamma_f : gamma f.natDegree ≠ 0)
        (hgamma_g : gamma g.natDegree ≠ 0)
        (hsign : gamma (f.natDegree - 1) * gamma f.natDegree ≤ 0) :
        StrictInterl (diagonalOperator gamma g) (diagonalOperator gamma f)
  • Nonnegative ratio preserves strict orientation

    RealRooted.IsFiniteMultiplierSequence.strictInterl_diagonalOperator_of_ratio_nonnegsource
    theorem IsFiniteMultiplierSequence.strictInterl_diagonalOperator_of_ratio_nonneg
        {N : ℕ} {gamma : ℕ → ℝ}
        (hgamma : IsFiniteMultiplierSequence N gamma)
        {f g : ℝ[X]} (hfg : StrictInterl f g)
        (hfdeg : f.natDegree ≤ N) (hgdeg : g.natDegree ≤ N)
        (hgamma_f : gamma f.natDegree ≠ 0)
        (hgamma_g : gamma g.natDegree ≠ 0)
        (hratio : 0 ≤ gamma (f.natDegree - 1) / gamma f.natDegree) :
        StrictInterl (diagonalOperator gamma f) (diagonalOperator gamma g)
  • Nonpositive ratio reverses strict orientation

    RealRooted.IsFiniteMultiplierSequence.strictInterl_diagonalOperator_reverse_of_ratio_nonpossource
    theorem IsFiniteMultiplierSequence.strictInterl_diagonalOperator_reverse_of_ratio_nonpos
        {N : ℕ} {gamma : ℕ → ℝ}
        (hgamma : IsFiniteMultiplierSequence N gamma)
        {f g : ℝ[X]} (hfg : StrictInterl f g)
        (hfdeg : f.natDegree ≤ N) (hgdeg : g.natDegree ≤ N)
        (hdegree : f.natDegree = g.natDegree)
        (hgamma_f : gamma f.natDegree ≠ 0)
        (hgamma_g : gamma g.natDegree ≠ 0)
        (hratio : gamma (f.natDegree - 1) / gamma f.natDegree ≤ 0) :
        StrictInterl (diagonalOperator gamma g) (diagonalOperator gamma f)
  • Zero ratio gives both strict orientations

    RealRooted.IsFiniteMultiplierSequence.strictInterl_diagonalOperator_both_of_ratio_eq_zerosource
    theorem IsFiniteMultiplierSequence.strictInterl_diagonalOperator_both_of_ratio_eq_zero
        {N : ℕ} {gamma : ℕ → ℝ}
        (hgamma : IsFiniteMultiplierSequence N gamma)
        {f g : ℝ[X]} (hfg : StrictInterl f g)
        (hfdeg : f.natDegree ≤ N) (hgdeg : g.natDegree ≤ N)
        (hdegree : f.natDegree = g.natDegree)
        (hgamma_f : gamma f.natDegree ≠ 0)
        (hgamma_g : gamma g.natDegree ≠ 0)
        (hratio : gamma (f.natDegree - 1) / gamma f.natDegree = 0) :
        StrictInterl (diagonalOperator gamma f) (diagonalOperator gamma g) ∧
          StrictInterl (diagonalOperator gamma g) (diagonalOperator gamma f)
  • Positive multipliers preserve common-left weighted sums

    RealRooted.IsMultiplierSequence.strictInterl_weightedSum_left_of_possource
    theorem IsMultiplierSequence.strictInterl_weightedSum_left_of_pos
        {gamma : ℕ → ℝ} (hgamma : IsMultiplierSequence gamma)
        (hgamma_pos : ∀ k, 0 < gamma k)
        (l : List (ℝ × ℝ[X])) (h : ℝ[X])
        (hnonneg : ∀ ap ∈ l, 0 ≤ ap.1)
        (hinterl : ∀ ap ∈ l, StrictInterl h ap.2)
        (hpoly_pos : ∀ ap ∈ l, HasPosLeadingCoeff ap.2)
        (hex : ∃ ap ∈ l, 0 < ap.1) :
        StrictInterl (diagonalOperator gamma h)
          (weightedSum (l.map fun ap => (ap.1, diagonalOperator gamma ap.2)))
  • Positive multipliers preserve common-right weighted sums

    RealRooted.IsMultiplierSequence.strictInterl_weightedSum_right_of_possource
    theorem IsMultiplierSequence.strictInterl_weightedSum_right_of_pos
        {gamma : ℕ → ℝ} (hgamma : IsMultiplierSequence gamma)
        (hgamma_pos : ∀ k, 0 < gamma k)
        (l : List (ℝ × ℝ[X])) (h : ℝ[X])
        (hnonneg : ∀ ap ∈ l, 0 ≤ ap.1)
        (hinterl : ∀ ap ∈ l, StrictInterl ap.2 h)
        (hpoly_pos : ∀ ap ∈ l, HasPosLeadingCoeff ap.2)
        (hex : ∃ ap ∈ l, 0 < ap.1) :
        StrictInterl
          (weightedSum (l.map fun ap => (ap.1, diagonalOperator gamma ap.2)))
          (diagonalOperator gamma h)
  • Finite PF multipliers preserve ordered PF lists

    RealRooted.IsInterlacingSeq0NonnegRealRooted.diagonalOperator_of_finitePFsource
    theorem IsInterlacingSeq0NonnegRealRooted.diagonalOperator_of_finitePF
        {N : ℕ} {gamma : ℕ → ℝ} {fs : List ℝ[X]}
        (hgamma : IsFinitePFMultiplierSequence N gamma)
        (hdeg : ∀ p ∈ fs, p.natDegree ≤ N)
        (hfs : IsInterlacingSeq0NonnegRealRooted fs) :
        IsInterlacingSeq0NonnegRealRooted
          (fs.map (diagonalOperator gamma))

Lean source RealRooted/Challenges/Preservers/ProperPositionPF.lean at revision d6670742. Formalized 2026-10-11.