Root exclusion for second-order differential equations

If a real-rooted polynomial satisfies a second-order linear differential equation, a Laguerre inequality forces a discriminant to be nonpositive at each of its roots. Many polynomial families defined by a recurrence $K_nF_{n+1}=p_nF_n+q_nF_n'$ satisfy such equations, and then a sign condition on the discriminant gives real roots and interlacing for the whole family.

Results

Theorem (Laguerre's inequality at a root). If $p$ is a real-rooted polynomial and $z$ is a root of $p$, then $$3\,p''(z)^2-4\,p'(z)\,p'''(z)\ge0.$$

Theorem (root exclusion). Let $p\ne0$ and $A\,p''+B\,p'+C\,p=0$ for polynomials $A,B,C$. If $z$ is a root of $p$ and $A(z)\ne0$, then $p'(z)\ne0$, so the root is simple. If moreover $p$ is real-rooted, then the discriminant $$\Delta=B^2+4A'B-4A\,(B'+C)$$ satisfies $\Delta(z)\le0$. Equivalently, a real-rooted solution has no root at a point $z$ with $A(z)\ne0$ and $\Delta(z)>0$.

Proposition (propagation). Let $F_n$ satisfy $K_nF_{n+1}=p_nF_n+q_nF_n'$ with $K_n\ne0$, and let $a_0F_0''+b_0F_0'+c_0F_0=0$. Suppose that for every $n$ there is a linear map $U_n$ on polynomials such that, for every polynomial $g$, applying the operator $a_{n+1}D^2+b_{n+1}D+c_{n+1}$ to $p_ng+q_ng'$ gives $U_n$ applied to $a_ng''+b_ng'+c_ng$. Then $a_nF_n''+b_nF_n'+c_nF_n=0$ for every $n$.

Theorem (real roots and interlacing). In this setting, let moreover $K_n>0$ and $\deg F_n=d+n$, let each $F_n$ have positive leading coefficient, nonnegative coefficients and positive constant term, and let $F_0$ be real-rooted. Write $\Delta_n$ for the discriminant of $(a_n,b_n,c_n)$. Suppose that for all $n$ and all $x<0$ we have $a_n(x)\ne0$, and that $q_n(x)\ge0$ implies $\Delta_n(x)>0$. Then every $F_n$ is real-rooted with simple negative roots, and $F_n\ll F_{n+1}$ for all $n$.

Proof

At a negative root $x$ of $F_n$ the exclusion theorem gives $\Delta_n(x)\le0$, hence $q_n(x)<0$. The critical-sign criterion of Ma–Wang and Liu–Wang then propagates simple negative roots and interlacing.

References

For the second Laguerre form, see the Laguerre inequalities. For a related method based on the Sonin function, see Sonin envelopes.

Theorems

  • Laguerre's inequality at a root: 3 p''² - 4 p' p''' ≥ 0RealRooted original

    RealRooted.three_mul_sq_eval_derivative_derivative_sub_four_mul_nonnegsource
    theorem three_mul_sq_eval_derivative_derivative_sub_four_mul_nonneg
        {p : ℝ[X]} (hp : p.Splits) {z : ℝ} (hz : p.IsRoot z) :
        0 ≤ 3 * p.derivative.derivative.eval z ^ 2 -
          4 * p.derivative.eval z * p.derivative.derivative.derivative.eval z
  • At a root z with A(z) ≠ 0 of a real-rooted solution, the ODE discriminant is nonpositiveRealRooted original

    RealRooted.ode_discriminant_eval_nonpos_of_isRootsource
    theorem ode_discriminant_eval_nonpos_of_isRoot
        {p A B C : ℝ[X]} (hp0 : p ≠ 0) (hp : p.Splits)
        (hode : A * p.derivative.derivative + B * p.derivative + C * p = 0)
        {z : ℝ} (hz : p.IsRoot z) (hA : A.eval z ≠ 0) :
        (B ^ 2 + 4 * A.derivative * B - 4 * A * (B.derivative + C)).eval z ≤ 0
  • A point where the ODE discriminant is positive is not a rootRealRooted original

    RealRooted.not_isRoot_of_ode_discriminant_eval_possource
    theorem not_isRoot_of_ode_discriminant_eval_pos
        {p A B C : ℝ[X]} (hp0 : p ≠ 0) (hp : p.Splits)
        (hode : A * p.derivative.derivative + B * p.derivative + C * p = 0)
        {z : ℝ}
        (hpos : 0 < (B ^ 2 + 4 * A.derivative * B -
          4 * A * (B.derivative + C)).eval z)
        (hA : A.eval z ≠ 0) :
        ¬p.IsRoot z
  • Roots are simple wherever the leading ODE coefficient does not vanishRealRooted original

    RealRooted.eval_derivative_ne_zero_of_odesource
    theorem eval_derivative_ne_zero_of_ode
        {p A B C : ℝ[X]} {z : ℝ} (hp0 : p ≠ 0)
        (hode : A * p.derivative.derivative + B * p.derivative + C * p = 0)
        (hz : p.IsRoot z) (hA : A.eval z ≠ 0) :
        p.derivative.eval z ≠ 0
  • An intertwining identity propagates the second-order ODE along a differential recurrenceRealRooted original

    RealRooted.second_order_ode_family_of_recurrencesource
    theorem second_order_ode_family_of_recurrence
        (F : ℕ → ℝ[X]) (a b c p q : ℕ → ℝ[X]) (K : ℕ → ℝ)
        (U : ℕ → ℝ[X] →ₗ[ℝ] ℝ[X])
        (hK : ∀ n, K n ≠ 0)
        (hrec : ∀ n,
          C (K n) * F (n + 1) = p n * F n + q n * (F n).derivative)
        (hbase :
          a 0 * (F 0).derivative.derivative + b 0 * (F 0).derivative + c 0 * F 0 = 0)
        (hintertwine : ∀ n g,
          a (n + 1) * (p n * g + q n * g.derivative).derivative.derivative +
              b (n + 1) * (p n * g + q n * g.derivative).derivative +
              c (n + 1) * (p n * g + q n * g.derivative) =
            U n (a n * g.derivative.derivative + b n * g.derivative + c n * g)) :
        ∀ n, a n * (F n).derivative.derivative + b n * (F n).derivative + c n * F n = 0
  • ODE propagation gives real-rooted rows with simple negative roots and interlacingMain resultRealRooted original

    RealRooted.splits_simple_roots_neg_strictInterl_of_odesource
    theorem splits_simple_roots_neg_strictInterl_of_ode
        (F : ℕ → ℝ[X]) (a b c p q : ℕ → ℝ[X]) (K : ℕ → ℝ) (d : ℕ)
        (U : ℕ → ℝ[X] →ₗ[ℝ] ℝ[X])
        (hdegree : ∀ n, (F n).natDegree = d + n)
        (hpos : ∀ n, HasPosLeadingCoeff (F n))
        (hnonneg : ∀ n, HasNonnegCoeffs (F n))
        (hconst : ∀ n, 0 < (F n).coeff 0)
        (hsplits₀ : (F 0).Splits)
        (hK : ∀ n, 0 < K n)
        (hrec : ∀ n,
          C (K n) * F (n + 1) = p n * F n + q n * (F n).derivative)
        (hode₀ :
          a 0 * (F 0).derivative.derivative + b 0 * (F 0).derivative + c 0 * F 0 = 0)
        (hintertwine : ∀ n g,
          a (n + 1) * (p n * g + q n * g.derivative).derivative.derivative +
              b (n + 1) * (p n * g + q n * g.derivative).derivative +
              c (n + 1) * (p n * g + q n * g.derivative) =
            U n (a n * g.derivative.derivative + b n * g.derivative + c n * g))
        (ha : ∀ n x, x < 0 → (a n).eval x ≠ 0)
        (hdisc : ∀ n x, x < 0 → 0 ≤ (q n).eval x →
          0 < (b n ^ 2 + 4 * (a n).derivative * b n -
            4 * a n * ((b n).derivative + c n)).eval x) :
        (∀ n, (F n).Splits ∧ HasSimpleRoots (F n) ∧
          ∀ r, (F n).IsRoot r → r < 0) ∧
          ∀ n, StrictInterl (F n) (F (n + 1))

Lean source RealRooted/Challenges/Roots/OdeRootBounds.lean at revision d6670742. Formalized 2026-11-01.