Roots of a Pólya frequency polynomial from its lowest coefficients

The coefficients $c_0,c_1,c_2$ of a Pólya frequency polynomial locate its root closest to the origin and bound the number of roots near zero.

A real polynomial is a Pólya frequency (PF) polynomial if its coefficients are nonnegative and it is zero or has only real nonpositive roots [ASW52]. For a PF polynomial $p$ with $p(0) = c_0 > 0$, $$ p(x) = c_0 \prod_i (1 + \lambda_i x), \qquad \lambda_i = -1/r_i > 0, $$ where $r_i$ runs over the roots of $p$ with multiplicity, and $c_1 = c_0 \sum_i \lambda_i$.

Results

Theorem (largest root). Let $p$ be PF with $p(0) = 1$ and $c_1 > 0$, and suppose $2 c_2 = \varepsilon c_1^2$ with $\varepsilon < 1/2$. Then $p$ has a largest root $-v$, it is simple, and $$ 1 \le c_1 v \le \frac{1}{1-\varepsilon}, \qquad |c_1 v - 1| \le \frac{\varepsilon}{1-\varepsilon}, \qquad \frac{1 - 2\varepsilon}{1 - \varepsilon} \le v\, p'(-v) \le 1 . $$ Thus the largest root is close to $-1/c_1$ when $\varepsilon$ is small.

Theorem (roots near zero). Let $p$ be PF with $c_0 > 0$, let $R > 0$ and let $j \ge 1$ be an integer with $R\, c_1 \le j\, c_0$. Then $(-R, 0)$ contains at most $j - 1$ roots of $p$, counted with multiplicity.

Theorem (linear lower bound). If $p$ is PF with $c_0 > 0$, then for $t \ge 0$ with $t c_1 \le c_0$, $$ c_0 - t c_1 \le p(-t). $$ Hence $p(-t) > 0$ whenever $t c_1 < c_0$, and every root $r$ satisfies $r c_1 \le -c_0$.

Proof

All three statements follow from the factorization above. The linear bound is the inequality $\prod_i (1 - z_i) \ge 1 - \sum_i z_i$ for $z_i \in [0, 1]$, applied to $z_i = t \lambda_i$.

References

See [ASW52] for the characterization of PF polynomials by their roots.

  1. [ASW52] Michael Aissen, I. J. Schoenberg, & A. M. Whitney. On the generating functions of totally positive sequences I. Journal d’Analyse Mathématique, 2(1), 93-103, 1952.
    BibTeX
    @article{AissenSchoenbergWhitney1952,
      author = {Aissen, Michael and Schoenberg, I. J. and Whitney, A. M.},
      title = {On the generating functions of totally positive sequences {I}},
      year = {1952},
      journal = {Journal d'Analyse Mathématique},
      volume = {2},
      number = {1},
      pages = {93--103},
      doi = {10.1007/BF02786970},
      url = {https://doi.org/10.1007/BF02786970}
    }

Theorems

  • The largest root from the three lowest coefficientsMain result

    RealRooted.IsPFPolynomial.exists_largest_root_of_coeff_one_possource
    theorem exists_largest_root_of_coeff_one_pos {p : ℝ[X]} (hp : IsPFPolynomial p)
        (h0 : p.coeff 0 = 1) (ha : 0 < p.coeff 1) {ε : ℝ}
        (hε : 2 * p.coeff 2 = ε * p.coeff 1 ^ 2) (hε2 : ε < 1 / 2) :
        ∃ v : ℝ, 0 < v ∧ -v ∈ p.roots ∧ p.roots.count (-v) = 1 ∧ (∀ r ∈ p.roots, r ≤ -v) ∧
          1 ≤ p.coeff 1 * v ∧ p.coeff 1 * v ≤ 1 / (1 - ε) ∧
          |p.coeff 1 * v - 1| ≤ ε / (1 - ε) ∧
          (1 - 2 * ε) / (1 - ε) ≤ v * p.derivative.eval (-v) ∧ v * p.derivative.eval (-v) ≤ 1
  • At most j - 1 roots in (-R, 0) when R c₁ ≤ j c₀

    RealRooted.IsPFPolynomial.card_filter_roots_lt_of_mul_coeff_one_lesource
    theorem card_filter_roots_lt_of_mul_coeff_one_le {p : ℝ[X]} (hp : IsPFPolynomial p)
        (h0 : 0 < p.coeff 0) {R : ℝ} (hR : 0 < R) {j : ℕ} (hj : j ≠ 0)
        (h : R * p.coeff 1 ≤ j * p.coeff 0) :
        (p.roots.filter fun r => -R < r).card < j
  • Linear lower bound c₀ - t c₁ ≤ p(-t) for a PF polynomial

    RealRooted.IsPFPolynomial.coeff_zero_sub_mul_coeff_one_le_eval_negsource
    theorem coeff_zero_sub_mul_coeff_one_le_eval_neg {p : ℝ[X]} (hp : IsPFPolynomial p)
        (h0 : 0 < p.coeff 0) {t : ℝ} (ht : 0 ≤ t) (htc : t * p.coeff 1 ≤ p.coeff 0) :
        p.coeff 0 - t * p.coeff 1 ≤ p.eval (-t)

Lean source RealRooted/Challenges/PolyaFrequency/LowCoefficients.lean at revision d6670742. Formalized 2026-11-03.