Bézout matrices and interlacing

Two real polynomials of equal degree have strictly interlacing real roots if and only if their Bézout matrix is positive definite.

Results

For real polynomials $p$ and $q$ of degree at most $n$, the Bézoutian $$ \frac{q(x)\,p(y) - q(y)\,p(x)}{x - y} = \sum_{i,j=0}^{n-1} b_{ij}\, x^i y^j $$ is a polynomial. Its coefficient matrix $B_n(q,p) = (b_{ij})$ is the symmetric $n \times n$ Bézout matrix.

Theorem (equal degree). Let $p$ and $q$ have degree $n$ and positive leading coefficients. Then $p$ and $q$ are real-rooted with strictly interlacing roots, $$ \alpha_1 < \beta_1 < \alpha_2 < \beta_2 < \dots < \alpha_n < \beta_n, $$ where $\alpha_i$ and $\beta_i$ are the roots of $p$ and $q$, if and only if $B_n(q,p)$ is positive definite. If $B_n(q,p)$ is positive definite, then $p$ and $q$ are real-rooted.

Theorem (successor degree). [Fis06, Cor. 9.145] Let $f$ have degree $d+1$ and $g$ degree $d$, both with positive leading coefficients. Then $B_{d+1}(f,g)$ is positive definite if and only if $g$ interlaces $f$ and the two polynomials have no common root, that is, $$ \alpha_1 < \beta_1 < \alpha_2 < \dots < \beta_d < \alpha_{d+1} $$ for the roots $\alpha_i$ of $f$ and $\beta_i$ of $g$.

Proposition (Wronskian). Let $p$ and $q$ have degree at most $n$. If $B_n(q,p)$ is positive definite, then $q'(t)\,p(t) - q(t)\,p'(t) > 0$ for all real $t$.

Proof

Evaluating the Bézoutian at the roots of one polynomial gives Wronskian values. Congruence with a Vandermonde matrix therefore turns the Bézout matrix into a diagonal matrix whose entries have the signs of the Wronskian at those roots, and these are positive exactly when the roots interlace. Conversely, a positive definite Bézout matrix makes the Wronskian positive, which excludes common real roots, and it excludes non-real roots because its Hermitian form would vanish on a conjugate pair.

References

C. Hermite, “Sur le nombre des racines d'une équation algébrique comprise entre des limites données,” J. Reine Angew. Math. 52 (1856), 39–51; M. G. Krein and M. A. Naimark, “The method of symmetric and Hermitian forms in the theory of the separation of the roots of algebraic equations” (1936), English translation in Linear and Multilinear Algebra 10 (1981), 265–308. The successor-degree criterion is [Fis06, Cor. 9.145]. See the contextual statement on symmetricfunctions.com.

  1. [Fis06] Steve Fisk. Polynomials, roots, and interlacing. arXiv e-prints, 2006.
    BibTeX
    @article{Fisk2006x,
      Author = {Steve Fisk},
      Title = {Polynomials, roots, and interlacing},
      Year = {2006},
      Eprint = {arXiv:math/0612833},
      journal = {arXiv e-prints}
    }

Definitions

  • Bézout matrix

    Polynomial.bezoutMatrixsource
    def bezoutMatrix {R : Type*} [CommRing R] (n : ℕ) (p q : R[X]) :
        Matrix (Fin n) (Fin n) R :=
      fun i j ↦ bezoutEntry p q i.1 j.1
  • Strict interlacing of equal-degree polynomials

    RealRooted.StrictInterlSameDegreesource
    def StrictInterlSameDegree (p q : ℝ[X]) : Prop :=
      (p ≠ 0 ∧ p.Splits) ∧ (q ≠ 0 ∧ q.Splits) ∧ p.natDegree = q.natDegree ∧
        List.Interleaves (· > ·) (p.roots.sort (· ≤ ·)).reverse (q.roots.sort (· ≤ ·)).reverse

Theorems

  • Strict interlacing is positive definiteness of the Bézout matrixMain result

    RealRooted.strictInterlSameDegree_iff_bezoutMatrix_posDefsource
    theorem strictInterlSameDegree_iff_bezoutMatrix_posDef
        {p q : ℝ[X]} {n : ℕ}
        (hp_pos : HasPosLeadingCoeff p) (hq_pos : HasPosLeadingCoeff q)
        (hp_deg : p.natDegree = n) (hq_deg : q.natDegree = n) :
        StrictInterlSameDegree p q ↔ (bezoutMatrix n q p).PosDef
  • Successor-degree interlacing is positive definiteness of the Bézout matrix

    RealRooted.bezoutMatrix_posDef_iff_interlaces_succsource
    theorem bezoutMatrix_posDef_iff_interlaces_succ {f g : ℝ[X]} {d : ℕ}
        (hf_pos : HasPosLeadingCoeff f) (hg_pos : HasPosLeadingCoeff g)
        (hf_deg : f.natDegree = d + 1) (hg_deg : g.natDegree = d) :
        (bezoutMatrix (d + 1) f g).PosDef ↔
          Interlaces g f ∧ ∀ x, f.IsRoot x → ¬ g.IsRoot x
  • A positive definite Bézout matrix forces real roots

    RealRooted.bezoutMatrix.splits_of_posDefsource
    lemma bezoutMatrix.splits_of_posDef {n : ℕ}
        {p q : ℝ[X]} (hp_pos : HasPosLeadingCoeff p) (hq_pos : HasPosLeadingCoeff q)
        (hp_deg : p.natDegree = n) (hq_deg : q.natDegree = n)
        (hB : (bezoutMatrix n q p).PosDef) :
        p.Splits ∧ q.Splits
  • A positive definite Bézout matrix gives a positive Wronskian

    RealRooted.bezoutMatrix.wronskian_pos_of_posDefsource
    lemma bezoutMatrix.wronskian_pos_of_posDef
        {p q : ℝ[X]} {n : ℕ}
        (hq_deg : q.natDegree ≤ n + 1) (hp_deg : p.natDegree ≤ n + 1)
        (h : (bezoutMatrix (n + 1) q p).PosDef) (t : ℝ) :
        0 < q.derivative.eval t * p.eval t - q.eval t * p.derivative.eval t

Lean source RealRooted/Challenges/Interlacing/Bezoutian.lean at revision d6670742. Formalized 2026-10-06.