Pólya frequency polynomials from a hypergeometric coefficient ratio

A real polynomial with positive constant term whose coefficients satisfy a hypergeometric ratio with positive parameters is PF.

Results

A polynomial is PF (Pólya frequency) if it is zero or has nonnegative coefficients and only real, nonpositive roots.

Theorem (coefficient ratio). Let $a,b>0$, let $p$ be a real polynomial of degree at most $d$ with $p(0)>0$, and suppose $$ (k+1)(a+k)\,p_{k+1}=(d-k)(b+d-k-1)\,p_k\qquad(0\le k<d). $$ Then $p$ is PF.

Theorem (lists of parameters). Let $a_1,\dotsc,a_s>0$ and $b_1,\dotsc,b_t>0$, with $s,t\ge0$ arbitrary and repetitions allowed. If $p$ has degree at most $d$, $p(0)>0$ and $$ (k+1)\prod_i(a_i+k)\,p_{k+1}=(d-k)\prod_j(b_j+d-k-1)\,p_k\qquad(0\le k<d), $$ then $p$ is PF. Two polynomials of degree at most $d$ satisfying the same ratio differ by a scalar factor, provided one of them has nonzero constant term.

Theorem (Euler factors). Let moreover $r_1,\dotsc,r_u>0$ and $s_1,\dotsc,s_v>0$, and put $h(k)=\prod_i(r_i+k)\prod_j(s_j+d-k)$. If $p$ has degree at most $d$, $p(0)>0$ and $$ (k+1)\prod_i(a_i+k)\,h(k)\,p_{k+1}=(d-k)\prod_j(b_j+d-k-1)\,h(k+1)\,p_k\qquad(0\le k<d), $$ then $p$ is PF.

Proof

The two-sided Jensen polynomial with weights $1/(a)_k$ and $1/(b)_k$, where $(a)_k$ is the rising factorial, is PF, because reciprocal Pochhammer products with positive parameters are PF multiplier sequences. A polynomial with the given coefficient ratio is a positive multiple of it. The Euler factors are handled with shifted Euler PF multipliers.

References

The parameter region of the first theorem is that of Theorem 4.6 of A. Martínez-Finkelshtein, J. Morales and D. Perales, Real roots of hypergeometric polynomials via finite free convolution. For multiplier sequences, see the multiplier sequences page.

Definitions

  • The two-sided Jensen polynomial with reciprocal-Pochhammer weights

    RealRooted.pochhammerJensenPolynomialsource
    def pochhammerJensenPolynomial (d : ℕ) (lower upper : List ℝ) : ℝ[X] :=
      twoSidedJensenPolynomial d (invPochhammerProduct lower) (invPochhammerProduct upper)
  • The same model with additional two-sided Euler factors

    RealRooted.eulerPochhammerPolynomialsource
    def eulerPochhammerPolynomial (d : ℕ) (lower upper rising falling : List ℝ) : ℝ[X] :=
      twoSidedJensenPolynomial d
        (fun k => eulerProduct rising k * invPochhammerProduct lower k)
        (fun k => eulerProduct falling k * invPochhammerProduct upper k)

Theorems

  • Reciprocal Pochhammer products with positive parameters are PF multiplier sequences

    RealRooted.isPFMultiplierSequence_invPochhammerProductsource
    theorem isPFMultiplierSequence_invPochhammerProduct {parameters : List ℝ}
        (h : ∀ a ∈ parameters, 0 < a) :
        IsPFMultiplierSequence (invPochhammerProduct parameters)
  • Pochhammer Jensen polynomials with positive parameters are PF

    RealRooted.pochhammerJensenPolynomial_isPFsource
    theorem pochhammerJensenPolynomial_isPF {lower upper : List ℝ}
        (hl : ∀ a ∈ lower, 0 < a) (hr : ∀ b ∈ upper, 0 < b) (d : ℕ) :
        IsPFPolynomial (pochhammerJensenPolynomial d lower upper)
  • A polynomial with coefficient ratio (d-k)(b+d-k-1) / ((k+1)(a+k)), a, b > 0, is PF

    RealRooted.isPFPolynomial_of_pochhammer_coeff_ratiosource
    theorem isPFPolynomial_of_pochhammer_coeff_ratio
        {p : ℝ[X]} {d : ℕ} {a b : ℝ}
        (ha : 0 < a) (hb : 0 < b) (hdegree : p.natDegree ≤ d)
        (hzero : 0 < p.coeff 0)
        (hratio : ∀ k < d,
          ((k : ℝ) + 1) * (a + k) * p.coeff (k + 1) =
            ((d : ℝ) - k) * (b + d - k - 1) * p.coeff k) :
        IsPFPolynomial p
  • The coefficient-ratio criterion with arbitrary lists of upper and lower parameters

    RealRooted.isPFPolynomial_of_pochhammer_list_coeff_ratiosource
    theorem isPFPolynomial_of_pochhammer_list_coeff_ratio
        {p : ℝ[X]} {d : ℕ} {lower upper : List ℝ}
        (hl : ∀ a ∈ lower, 0 < a) (hr : ∀ b ∈ upper, 0 < b) (hdegree : p.natDegree ≤ d)
        (hzero : 0 < p.coeff 0)
        (hratio : ∀ k < d,
          ((k : ℝ) + 1) * (lower.map (fun a : ℝ => a + k)).prod * p.coeff (k + 1) =
            ((d : ℝ) - k) * (upper.map (fun b : ℝ => b + d - k - 1)).prod * p.coeff k) :
        IsPFPolynomial p
  • A coefficient ratio determines the polynomial up to a scalar

    RealRooted.eq_C_mul_of_coeff_ratiosource
    theorem eq_C_mul_of_coeff_ratio {p q : ℝ[X]} {d : ℕ} {A B : ℕ → ℝ}
        (hA : ∀ k < d, A k ≠ 0) (hp : p.natDegree ≤ d) (hq : q.natDegree ≤ d)
        (hq0 : q.coeff 0 ≠ 0)
        (hpr : ∀ k < d, A k * p.coeff (k + 1) = B k * p.coeff k)
        (hqr : ∀ k < d, A k * q.coeff (k + 1) = B k * q.coeff k) :
        p = C (p.coeff 0 / q.coeff 0) * q
  • Euler factors preserve the PF property of the Pochhammer Jensen model

    RealRooted.eulerPochhammerPolynomial_isPFsource
    theorem eulerPochhammerPolynomial_isPF {lower upper rising falling : List ℝ}
        (hl : ∀ a ∈ lower, 0 < a) (hu : ∀ b ∈ upper, 0 < b)
        (hr : ∀ r ∈ rising, 0 < r) (hs : ∀ s ∈ falling, 0 < s) (d : ℕ) :
        IsPFPolynomial (eulerPochhammerPolynomial d lower upper rising falling)
  • Coefficient-ratio criterion with two-sided Euler weightsMain result

    RealRooted.isPFPolynomial_of_euler_pochhammer_coeff_ratiosource
    theorem isPFPolynomial_of_euler_pochhammer_coeff_ratio
        {p : ℝ[X]} {d : ℕ} {lower upper rising falling : List ℝ}
        (hl : ∀ a ∈ lower, 0 < a) (hu : ∀ b ∈ upper, 0 < b)
        (hr : ∀ r ∈ rising, 0 < r) (hs : ∀ s ∈ falling, 0 < s)
        (hdegree : p.natDegree ≤ d) (hzero : 0 < p.coeff 0)
        (hratio : ∀ k < d,
          ((k : ℝ) + 1) * (lower.map (fun a : ℝ => a + k)).prod *
              eulerWeight d rising falling k * p.coeff (k + 1) =
            ((d : ℝ) - k) * (upper.map (fun b : ℝ => b + d - k - 1)).prod *
              eulerWeight d rising falling (k + 1) * p.coeff k) : IsPFPolynomial p

Lean source RealRooted/Challenges/Preservers/HypergeometricCoefficientRatios.lean at revision d6670742. Formalized 2026-10-27.