Multiplier sequences

A real sequence is a multiplier sequence if the diagonal operator it defines preserves real-rootedness; these are classified by Jensen polynomials and by the Laguerre–Pólya class.

Results

A polynomial is real-rooted if it is zero or splits over $\mathbb R$, and PF (Pólya frequency) if it is zero or has nonnegative coefficients and only real, nonpositive roots. For a real sequence $\gamma=(\gamma_0,\gamma_1,\dotsc)$ the diagonal operator is $$ a_0+a_1x+\dotsb+a_nx^n\ \mapsto\ \gamma_0a_0+\gamma_1a_1x+\dotsb+\gamma_na_nx^n . $$ The sequence $\gamma$ is a multiplier sequence if this operator maps every real-rooted polynomial to a real-rooted polynomial, and a PF multiplier sequence if it maps every PF polynomial to a PF polynomial. The finite versions restrict to inputs of degree at most $n$. The Jensen polynomial of $\gamma$ is $g_n(x)=\sum_k\binom nk\gamma_kx^k$.

Theorem (Pólya–Schur). Let $\gamma_k\ge0$ for all $k$. Then $\gamma$ is a multiplier sequence if and only if every Jensen polynomial $g_n$ is PF.

Theorem (Laguerre–Pólya classification). Assume $\sum_k|\gamma_k|R^k/k!<\infty$ for some $R>0$, and let $f(z)=\sum_k\gamma_kz^k/k!$.

Every multiplier sequence $\gamma$ satisfies one of the following: $\gamma$, $-\gamma$, $\bigl((-1)^k\gamma_k\bigr)$ or $\bigl(-(-1)^k\gamma_k\bigr)$ is a PF multiplier sequence.

Theorem (log-concavity). If $\gamma$ is a PF multiplier sequence, then $\gamma_k\gamma_{k+2}\le\gamma_{k+1}^2$ for all $k$.

Theorem (Laguerre). Let $\varphi$ be a real-rooted polynomial with only nonpositive roots. Then $\varphi(0),\varphi(1),\varphi(2),\dotsc$ is a multiplier sequence, and a PF multiplier sequence if $\varphi$ has nonnegative leading coefficient. In particular $k+r$ is a PF multiplier sequence for every real $r\ge0$. More generally, if $f$ is of type I, then $\bigl(\operatorname{Re}f(k)\bigr)_{k\ge0}$ is a PF multiplier sequence.

Theorem (examples). For real $\alpha>0$, the sequence $1/(\alpha)_k$, with $(\alpha)_k=\alpha(\alpha+1)\dotsm(\alpha+k-1)$, is a PF multiplier sequence. In particular $1/k!$ is one.

Theorem (operators). If $\varphi$ is Laguerre–Pólya and $g$ is real-rooted, then $\varphi(D)\,g=\sum_k\operatorname{Re}\bigl(\varphi^{(k)}(0)/k!\bigr)\,g^{(k)}$ is real-rooted. In particular, for $a\ge0$ the operator $e^{-aD^2}$ maps real-rooted polynomials to real-rooted polynomials.

Theorem (interlacing). If $\gamma$ is a multiplier sequence with $\gamma_k>0$ for all $k$ and $f\ll g$, then $\sum_k\gamma_kf_kx^k\ll\sum_k\gamma_kg_kx^k$.

Theorem (bidiagonal preservers). For sequences $\alpha,\beta$, the bidiagonal operator sends $\sum_ka_kx^k$ to $\sum_k(\alpha_ka_k+\beta_{k-1}a_{k-1})x^k$, with the second term omitted for $k=0$. It maps PF polynomials of degree at most $d$ to PF polynomials in each of the following cases:

Theorem (Jensen-pencil contraction). Call $(A,B)$ compatible if every nonnegative linear combination of $A$ and $B$ is zero or real-rooted. Let $*_d$ be Schur–Szegő composition (see the Hadamard products page). Let $A$, $xB$ and $p$ be PF of degree at most $d$ with $\deg B\le d$, and suppose $(A,xB)$ is compatible. Then $(A*_dp,\ x\,(B*_dp))$ is compatible. Two steps of the proof hold more generally.

Theorem (Bernstein-diagonal preservers). Fix $D\ge1$, let $B_k=\binom Dk x^k(1+x)^{D-k}$, let $\gamma$ be a real sequence, let $L$ be the linear map with $LB_k=\gamma_kB_k$, and put $g=L\bigl((1+2x)^D\bigr)=\sum_k\gamma_kB_k$. Let $\mathcal C_D$ be the set of polynomials of degree exactly $D$ with positive leading coefficient and all roots in $[-1,0]$. Then $$ L(\mathcal C_D)\subseteq\mathcal C_D\cup\{0\}\iff g\in\mathcal C_D\cup\{0\}. $$ If these hold, then $Lf\ne0$ for all $f\in\mathcal C_D$ if and only if $g$ is real-rooted with all roots in $(-1,0)$.

Proof

The Bernstein-diagonal map is conjugate by the Cayley change of variable $J_Df(z)=(1-z)^Df\bigl(z/(1-z)\bigr)$ to the diagonal operator of $\gamma$, which turns $B_k$ into $\binom Dkz^k$ and $L$ into Schur–Szegő composition with $J_Dg$, so the statement follows from [KS06, Prop. 1.2 and Thm. 1.3].

References

  1. [SP14] J Schur & G Polya. Ü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}
    }
  2. [KS06] Vladimir Kostov & Boris Shapiro. On the Schur--Szegö composition of polynomials. Comptes Rendus. Mathématique, 343(2), 81-86, 2006.
    BibTeX
    @article{KostovShapiro2006,
      author = {Kostov, Vladimir and Shapiro, Boris},
      title = {On the {S}chur--{S}zeg{\"o} composition of polynomials},
      year = {2006},
      journal = {Comptes Rendus. Mathématique},
      volume = {343},
      number = {2},
      pages = {81--86},
      doi = {10.1016/j.crma.2006.06.007},
      url = {https://doi.org/10.1016/j.crma.2006.06.007}
    }

Definitions

  • Diagonal operator of a sequence

    RealRooted.diagonalOperatorsource
    def diagonalOperator (gamma : ℕ → ℝ) (p : ℝ[X]) : ℝ[X] :=
      p.sum fun n a => monomial n (gamma n * a)
  • Jensen polynomials

    RealRooted.jensenPolynomialsource
    def jensenPolynomial (n : ℕ) (gamma : ℕ → ℝ) : ℝ[X] :=
      ∑ k ∈ Finset.range (n + 1),
        monomial k ((Nat.choose n k : ℝ) * gamma k)
  • Finite multiplier sequence

    RealRooted.IsFiniteMultiplierSequencesource
    def IsFiniteMultiplierSequence (n : ℕ) (gamma : ℕ → ℝ) : Prop :=
      ∀ {p : ℝ[X]},
        p.natDegree ≤ n →
        p.Splits →
        diagonalOperator gamma p = 0 ∨ (diagonalOperator gamma p).Splits
  • Multiplier sequence

    RealRooted.IsMultiplierSequencesource
    def IsMultiplierSequence (gamma : ℕ → ℝ) : Prop :=
      ∀ n : ℕ, IsFiniteMultiplierSequence n gamma
  • Finite PF multiplier sequence

    RealRooted.IsFinitePFMultiplierSequencesource
    def IsFinitePFMultiplierSequence (n : ℕ) (gamma : ℕ → ℝ) : Prop :=
      ∀ {p : ℝ[X]},
        IsPFPolynomial p →
        p.natDegree ≤ n →
        IsPFPolynomial (diagonalOperator gamma p)
  • PF multiplier sequence

    RealRooted.IsPFMultiplierSequencesource
    def IsPFMultiplierSequence (gamma : ℕ → ℝ) : Prop :=
      ∀ n : ℕ, IsFinitePFMultiplierSequence n gamma
  • Exponential generating function

    RealRooted.complexExpGeneratingFunctionsource
    def complexExpGeneratingFunction (gamma : ℕ → ℝ) : ℂ → ℂ :=
      FormalMultilinearSeries.ofScalarsSum (E := ℂ)
        (fun k => ((gamma k / k.factorial : ℝ) : ℂ))
  • Laguerre–Pólya class of type I

    RealRooted.IsLaguerrePolyaTypeIsource
    def IsLaguerrePolyaTypeI (f : ℂ → ℂ) : Prop :=
      ∃ p : ℕ → ℝ[X],
        (∀ n, IsPFPolynomial (p n)) ∧
          TendstoLocallyUniformly
            (fun n (z : ℂ) => (p n).map Complex.ofRealHom |>.eval z) f atTop
  • Type I up to the signs ±f(±z)

    RealRooted.IsLaguerrePolyaTypeISignedsource
    def IsLaguerrePolyaTypeISigned (f : ℂ → ℂ) : Prop :=
      (IsLaguerrePolyaTypeI f ∨ IsLaguerrePolyaTypeI (fun z => -f z)) ∨
        (IsLaguerrePolyaTypeI (fun z => f (-z)) ∨
          IsLaguerrePolyaTypeI (fun z => -f (-z)))
  • A bidiagonal operator preserving PF polynomials of degree at most d

    RealRooted.BidiagonalPFPreserversource
    def BidiagonalPFPreserver (alpha beta : ℕ → ℝ) (d : ℕ) : Prop :=
      ∀ {p : ℝ[X]},
        IsPFPolynomial p →
        p.natDegree ≤ d →
        IsPFPolynomial (bidiagonalOperator alpha beta p)
  • Jensen-pencil certificate

    RealRooted.BidiagonalJensenPencilCertificatesource
    def BidiagonalJensenPencilCertificate
        (alpha beta : ℕ → ℝ) (d : ℕ) : Prop :=
      IsPFPolynomial (jensenPolynomial d alpha) ∧
      IsPFPolynomial (X * jensenPolynomial d beta) ∧
      ∀ lam : ℝ, 0 ≤ lam →
        IsPFPolynomial (bidiagonalJensenPencil alpha beta d lam)
  • The Bernstein-diagonal map L(B_k) = γ_k B_k on [−1, 0]RealRooted original

    RealRooted.bernsteinDiagonalsource
    def bernsteinDiagonal (D : ℕ) (γ : ℕ → ℝ) : ℝ[X] →ₗ[ℝ] ℝ[X] :=
      cayleyConj D (diagonalLinearMap γ)

Theorems

  • Pólya–Schur: multiplier sequences via Jensen polynomials

    RealRooted.isMultiplierSequence_iff_jensenPolynomial_isPFsource
    theorem isMultiplierSequence_iff_jensenPolynomial_isPF
        {gamma : ℕ → ℝ} (hgamma : ∀ k, 0 ≤ gamma k) :
        IsMultiplierSequence gamma ↔
          ∀ n : ℕ, IsPFPolynomial (jensenPolynomial n gamma)
  • Pólya–Schur: PF multiplier sequences are the Laguerre–Pólya type I class

    RealRooted.IsPFMultiplierSequence.iff_laguerrePolya_egfsource
    theorem IsPFMultiplierSequence.iff_laguerrePolya_egf
        {gamma : ℕ → ℝ}
        (hpositive : ∃ R : NNReal, 0 < R ∧
          Summable (fun k => ‖gamma k‖ * (R : ℝ) ^ k / k.factorial)) :
        IsPFMultiplierSequence gamma ↔
          IsLaguerrePolyaTypeI (complexExpGeneratingFunction gamma)
  • Pólya–Schur: classification of all multiplier sequencesMain result

    RealRooted.IsMultiplierSequence.iff_signedLaguerrePolya_egfsource
    theorem IsMultiplierSequence.iff_signedLaguerrePolya_egf
        {gamma : ℕ → ℝ}
        (hpositive : ∃ R : NNReal, 0 < R ∧
          Summable (fun k => ‖gamma k‖ * (R : ℝ) ^ k / k.factorial)) :
        IsMultiplierSequence gamma ↔
          IsLaguerrePolyaTypeISigned (complexExpGeneratingFunction gamma)
  • Every multiplier sequence is a PF one up to signs

    RealRooted.IsMultiplierSequence.exists_pf_sign_normalizationsource
    theorem IsMultiplierSequence.exists_pf_sign_normalization
        {gamma : ℕ → ℝ} (hgamma : IsMultiplierSequence gamma) :
        (IsPFMultiplierSequence gamma ∨
            IsPFMultiplierSequence (fun k => -gamma k)) ∨
          (IsPFMultiplierSequence (fun k => (-1 : ℝ) ^ k * gamma k) ∨
            IsPFMultiplierSequence (fun k => -((-1 : ℝ) ^ k * gamma k)))
  • PF multiplier sequences are log-concave

    RealRooted.IsPFMultiplierSequence.logConcavesource
    theorem IsPFMultiplierSequence.logConcave {gamma : ℕ → ℝ}
        (hgamma : IsPFMultiplierSequence gamma) (k : ℕ) :
        gamma k * gamma (k + 2) ≤ gamma (k + 1) ^ 2
  • Reciprocal rising factorials 1/(α)ₖ form a PF multiplier sequence

    RealRooted.isPFMultiplierSequence_inv_ascPochhammersource
    theorem isPFMultiplierSequence_inv_ascPochhammer {α : ℝ} (hα : 0 < α) :
        IsPFMultiplierSequence (fun k => ((ascPochhammer ℝ k).eval α)⁻¹)
  • 1/k! is a PF multiplier sequence

    RealRooted.isPFMultiplierSequence_inv_factorialsource
    theorem isPFMultiplierSequence_inv_factorial :
        IsPFMultiplierSequence (fun k => ((k.factorial : ℝ))⁻¹)
  • Laguerre's theorem: φ(0), φ(1), … is a multiplier sequence

    RealRooted.isMultiplierSequence_eval_of_roots_nonpossource
    theorem isMultiplierSequence_eval_of_roots_nonpos {φ : ℝ[X]} (hφ : φ.Splits)
        (hroots : ∀ r ∈ φ.roots, r ≤ 0) :
        IsMultiplierSequence (fun k => φ.eval (k : ℝ))
  • Laguerre's theorem in the PF convention

    RealRooted.isPFMultiplierSequence_eval_of_roots_nonpossource
    theorem isPFMultiplierSequence_eval_of_roots_nonpos {φ : ℝ[X]} (hφ : φ.Splits)
        (hroots : ∀ r ∈ φ.roots, r ≤ 0) (hlead : 0 ≤ φ.leadingCoeff) :
        IsPFMultiplierSequence (fun k => φ.eval (k : ℝ))
  • k + r is a PF multiplier sequence for r ≥ 0

    RealRooted.isPFMultiplierSequence_natCast_addsource
    theorem isPFMultiplierSequence_natCast_add {r : ℝ} (hr : 0 ≤ r) :
        IsPFMultiplierSequence (fun k => (k : ℝ) + r)
  • Type I functions sampled at 0, 1, 2, … are PF multiplier sequences

    RealRooted.IsLaguerrePolyaTypeI.isPFMultiplierSequence_eval_natCastsource
    theorem IsLaguerrePolyaTypeI.isPFMultiplierSequence_eval_natCast {f : ℂ → ℂ}
        (hf : IsLaguerrePolyaTypeI f) :
        IsPFMultiplierSequence (fun k => (f k).re)
  • Laguerre–Pólya: φ(D) preserves real-rootedness

    RealRooted.IsLaguerrePolya.taylorDifferentialOperator_eq_zero_or_splitssource
    theorem IsLaguerrePolya.taylorDifferentialOperator_eq_zero_or_splits {φ : ℂ → ℂ}
        (hφ : IsLaguerrePolya φ) {g : ℝ[X]} (hg : g.Splits) :
        taylorDifferentialOperator φ g = 0 ∨ (taylorDifferentialOperator φ g).Splits
  • The heat operator exp(−aD²) preserves real-rootedness

    RealRooted.taylorDifferentialOperator_exp_neg_mul_sq_eq_zero_or_splitssource
    theorem taylorDifferentialOperator_exp_neg_mul_sq_eq_zero_or_splits {a : ℝ} (ha : 0 ≤ a)
        {g : ℝ[X]} (hg : g.Splits) :
        taylorDifferentialOperator (fun z => Complex.exp (-(a : ℂ) * z ^ 2)) g = 0 ∨
          (taylorDifferentialOperator (fun z => Complex.exp (-(a : ℂ) * z ^ 2)) g).Splits
  • Bidiagonal PF preservers from a stable symbol

    RealRooted.BorceaBranden.bidiagonalPFPreserver_of_affineSymbolsource
    theorem bidiagonalPFPreserver_of_affineSymbol
        {alpha beta : ℕ → ℝ} {d : ℕ}
        (hSymbol : MvUpperHalfPlaneStable
          (complexifyMv
            (RealRooted.BorceaBranden.finiteAlgebraicSymbol d
              (bidiagonalLinearMap alpha beta))))
        (halpha : ∀ k, k ≤ d → 0 ≤ alpha k)
        (hbeta : ∀ k, k ≤ d → 0 ≤ beta k) :
        BidiagonalPFPreserver alpha beta d
  • Bidiagonal PF preservers from a Jensen-pencil certificate

    RealRooted.BidiagonalJensenPencilCertificate.toPFPreserversource
    theorem BidiagonalJensenPencilCertificate.toPFPreserver
        {alpha beta : ℕ → ℝ} {d : ℕ}
        (hcert : BidiagonalJensenPencilCertificate alpha beta d) :
        BidiagonalPFPreserver alpha beta d
  • A positive multiplier sequence preserves interlacing

    RealRooted.IsMultiplierSequence.strictInterl_diagonalOperator_of_possource
    theorem IsMultiplierSequence.strictInterl_diagonalOperator_of_pos
        {gamma : ℕ → ℝ} (hgamma : IsMultiplierSequence gamma)
        (hpos : ∀ k, 0 < gamma k) {f g : ℝ[X]} (hfg : StrictInterl f g) :
        StrictInterl (diagonalOperator gamma f) (diagonalOperator gamma g)
  • Schur–Szegő composition preserves Jensen-pencil compatibility, positive constant termsRealRooted original

    RealRooted.compatible_schurSzego_jensen_of_pos_coeff_zerosource
    theorem compatible_schurSzego_jensen_of_pos_coeff_zero
        {d : ℕ} {A B p : ℝ[X]}
        (hA : IsPFPolynomial A) (hB : IsPFPolynomial B)
        (hp : IsPFPolynomial p)
        (hAdeg : A.natDegree ≤ d) (hBdeg : B.natDegree ≤ d)
        (hpdeg : p.natDegree ≤ d)
        (hA0 : 0 < A.coeff 0) (hB0 : 0 < B.coeff 0)
        (hp0 : 0 < p.coeff 0)
        (hcompat : Compatible A (X * B)) :
        Compatible (schurSzegoComp d A p)
          (X * schurSzegoComp d B p)
  • Positive translation preserves Jensen-pencil compatibilityRealRooted original

    RealRooted.compatible_jensen_translatesource
    theorem compatible_jensen_translate
        {A B : ℝ[X]} (hA : IsPFPolynomial A) (hB : IsPFPolynomial B)
        (hA0 : A ≠ 0) (hB0 : B ≠ 0)
        (hcompat : Compatible A (X * B))
        {eps : ℝ} (heps : 0 < eps) :
        Compatible (A.comp (X + C eps)) (X * B.comp (X + C eps))
  • A coefficientwise continuous curve of PF sequences has a PF endpointRealRooted original

    RealRooted.IsPolyaFreqSeq.of_continuous_curvesource
    theorem IsPolyaFreqSeq.of_continuous_curve
        {a : ℕ → ℝ} {u : ℝ → ℕ → ℝ}
        (hu : ∀ k : ℕ, Continuous (fun eps : ℝ ↦ u eps k))
        (hu0 : ∀ k : ℕ, u 0 k = a k)
        (hpos : ∀ {eps : ℝ}, 0 < eps → IsPolyaFreqSeq (u eps)) :
        IsPolyaFreqSeq a
  • Schur–Szegő composition by a PF polynomial preserves Jensen-pencil compatibilityRealRooted original

    RealRooted.Compatible.schurSzegoComp_jensenPencilsource
    theorem Compatible.schurSzegoComp_jensenPencil
        {d : ℕ} {A B p : ℝ[X]}
        (hA : IsPFPolynomial A) (hXB : IsPFPolynomial (X * B))
        (hp : IsPFPolynomial p)
        (hAdeg : A.natDegree ≤ d) (hBdeg : B.natDegree ≤ d)
        (hpdeg : p.natDegree ≤ d)
        (hcompat : Compatible A (X * B)) :
        Compatible (schurSzegoComp d A p) (X * schurSzegoComp d B p)
  • A Bernstein-diagonal map preserves [−1, 0]-rooted polynomials iff its symbol doesRealRooted original

    RealRooted.bernsteinDiagonal_maps_iffsource
    theorem bernsteinDiagonal_maps_iff (D : ℕ) (γ : ℕ → ℝ) :
        (∀ f : ℝ[X], IsBernsteinRooted D f →
            bernsteinDiagonal D γ f = 0 ∨ IsBernsteinRooted D (bernsteinDiagonal D γ f)) ↔
          (bernsteinDiagonalSymbol D γ = 0 ∨ IsBernsteinRooted D (bernsteinDiagonalSymbol D γ))
  • A Bernstein-diagonal preserver is injective iff the symbol has roots in (−1, 0)RealRooted original

    RealRooted.bernsteinDiagonal_ne_zero_iffsource
    theorem bernsteinDiagonal_ne_zero_iff (D : ℕ) (γ : ℕ → ℝ)
        (hg : bernsteinDiagonalSymbol D γ = 0 ∨ IsBernsteinRooted D (bernsteinDiagonalSymbol D γ)) :
        (∀ f : ℝ[X], IsBernsteinRooted D f → bernsteinDiagonal D γ f ≠ 0) ↔
          IsRealRootedIn (Ioo (-1) 0) (bernsteinDiagonalSymbol D γ)

Lean source RealRooted/Challenges/Preservers/MultiplierSequence.lean at revision d6670742. Formalized 2026-09-07.