Generalized Laguerre polynomials

The generalized Laguerre polynomials are real-rooted with simple roots, and consecutive ones interlace. Suitable finite combinations of consecutive Laguerre polynomials keep simple positive roots.

Results

We use the monic, sign-reversed normalization $$ P_n^{(\alpha)}(x) = n!\, L_n^{(\alpha)}(-x) = \sum_k \binom{n}{k} (\alpha+k+1)_{n-k}\, x^k , $$ with $(y)_m$ the rising factorial, so that the roots are nonpositive.

Theorem (roots and interlacing). For $\alpha \ge -1$ and $n\ge0$, $P_n^{(\alpha)}$ is real-rooted with simple roots and $P_n^{(\alpha)} \ll P_{n+1}^{(\alpha)}$. For $\alpha > -1$ all roots are strictly negative.

For every real $\alpha$ the family satisfies a Favard three-term recurrence. For $\alpha > -1$ and $m \neq n$, $$ \int_0^\infty P_m^{(\alpha)}(-x)\, P_n^{(\alpha)}(-x)\, x^\alpha e^{-x}\, dx = 0. $$

Theorem (finite combinations). Let $\ell_n^{(\alpha)}=(-1)^nn!\,L_n^{(\alpha)}$ be the classical monic Laguerre polynomial, with positive roots. Let $K\le n$, $\gamma_0=1$, $\gamma_1,\dots,\gamma_K$ real, and $$ Q(x)=\sum_{j=0}^K(-1)^j\gamma_j\,(x)_{K-j}. $$ If $\alpha>-1$, $Q$ is real-rooted and all its roots are below $\alpha+1$, then $\sum_{j=0}^K\gamma_j\,\ell_{n-j}^{(\alpha)}$ is real-rooted with simple positive roots.

For $K=1$ and $n\ge1$: if $\alpha>-1$ and $\gamma<\alpha+1$, then $\ell_n^{(\alpha)}+\gamma\,\ell_{n-1}^{(\alpha)}$ has simple positive roots. This includes $\gamma=-1$ and, for $\alpha>0$, $\gamma=1$.

Proposition (raising step). For $a>0$ let $p\mapsto(x+a)p+xp'$. Applied to a monic real-rooted polynomial $p$ of degree at least $1$ with simple roots, nonnegative coefficients and $p(0)\ne0$, it gives a polynomial with simple roots that $p$ interlaces. Iterating steps with positive parameters preserves simple negative roots.

References

  1. [Sze39] G. Szegő. Orthogonal Polynomials. Colloquium Publications, American Mathematical Society, 1939.
    BibTeX
    @book{Szego1939,
      author = {Szegő, G.},
      title = {Orthogonal {P}olynomials},
      year = {1939},
      series = {Colloquium Publications},
      publisher = {American Mathematical Society},
      isbn = {9781470431716},
      doi = {10.1090/coll/023},
      url = {https://doi.org/10.1090/coll/023}
    }
  2. [Dur25, Theorem 1.3] Antonio J. Durán. Zeros of linear combinations of Laguerre polynomials. arXiv e-prints, 2025.
    BibTeX
    @article{Duran2025x,
      author = {Antonio J. Durán},
      title = {Zeros of linear combinations of {L}aguerre polynomials},
      year = {2025},
      eprint = {2507.22425v1},
      url = {https://arxiv.org/abs/2507.22425v1},
      journal = {arXiv e-prints}
    }

Definitions

  • Generalized Laguerre polynomials

    Polynomial.generalizedLaguerresource
    noncomputable def generalizedLaguerre (n : ℕ) (α : R) : R[X] :=
      ∑ k ∈ range (n + 1),
        C ((Nat.choose n k : R) *
          (ascPochhammer R (n - k)).eval (α + k + 1)) * X ^ k
  • A fixed bandwidth-K combination of consecutive monic Laguerre polynomials

    RealRooted.laguerreCombinationsource
    @[expose] noncomputable def laguerreCombination
        (K : ℕ) (gamma : ℕ → ℝ) (n : ℕ) (alpha : ℝ) : ℝ[X] :=
      ∑ j ∈ Finset.range (K + 1), C (gamma j) * monicLaguerre (n - j) alpha
  • The auxiliary polynomial Σ (-1)^j γ_j (X)_{K-j}

    RealRooted.laguerrePochhammerSumsource
    @[expose] noncomputable def laguerrePochhammerSum (K : ℕ) (gamma : ℕ → ℝ) : ℝ[X] :=
      ∑ j ∈ Finset.range (K + 1),
        C ((-1 : ℝ) ^ j * gamma j) * ascPochhammer ℝ (K - j)

Theorems

  • Generalized Laguerre polynomials are real-rooted

    RealRooted.generalizedLaguerre_splitssource
    theorem generalizedLaguerre_splits (n : ℕ) {α : ℝ} (hα : -1 ≤ α) :
        (generalizedLaguerre n α).Splits
  • Roots are negative for α > -1

    RealRooted.generalizedLaguerre_roots_negsource
    theorem generalizedLaguerre_roots_neg (n : ℕ) {α : ℝ} (hα : -1 < α) :
        ∀ r ∈ (generalizedLaguerre n α).roots, r < 0
  • Generalized Laguerre polynomials have simple roots

    RealRooted.generalizedLaguerre_hasSimpleRootssource
    theorem generalizedLaguerre_hasSimpleRoots (n : ℕ) {α : ℝ} (hα : -1 ≤ α) :
        HasSimpleRoots (generalizedLaguerre n α)
  • Consecutive generalized Laguerre polynomials interlaceMain result

    RealRooted.generalizedLaguerre_strictInterl_succsource
    theorem generalizedLaguerre_strictInterl_succ (n : ℕ) {α : ℝ} (hα : -1 ≤ α) :
        StrictInterl (generalizedLaguerre n α) (generalizedLaguerre (n + 1) α)
  • Monic Laguerre polynomials satisfy a Favard recurrence

    RealRooted.generalizedLaguerre_satisfiesFavardRecurrencesource
    theorem generalizedLaguerre_satisfiesFavardRecurrence (α : ℝ) :
        SatisfiesFavardRecurrence
          (fun n ↦ generalizedLaguerre n α)
          (fun n ↦ generalizedLaguerreDiag n α)
          (fun n ↦ generalizedLaguerreSubdiag n α)
  • Generalized Laguerre polynomials are orthogonal on the half-line

    RealRooted.generalizedLaguerre_integral_orthogonalsource
    theorem generalizedLaguerre_integral_orthogonal
        {α : ℝ} (hα : -1 < α) {m n : ℕ} (hmn : m ≠ n) :
        (∫ x in Ioi 0,
          (generalizedLaguerre m α).eval (-x) *
            (generalizedLaguerre n α).eval (-x) *
              x ^ α * Real.exp (-x)) = 0
  • Auxiliary roots below α + 1 give a combination with simple positive roots

    RealRooted.laguerreCombination_splits_simple_roots_possource
    theorem laguerreCombination_splits_simple_roots_pos
        {K n : ℕ} (hKn : K ≤ n) {gamma : ℕ → ℝ} {alpha : ℝ}
        (hgamma : gamma 0 = 1) (halpha : -1 < alpha)
        (hQsplits : (laguerrePochhammerSum K gamma).Splits)
        (hQroots : ∀ r ∈ (laguerrePochhammerSum K gamma).roots, r < alpha + 1) :
        (laguerreCombination K gamma n alpha).Splits ∧
          HasSimpleRoots (laguerreCombination K gamma n alpha) ∧
          ∀ r ∈ (laguerreCombination K gamma n alpha).roots, 0 < r
  • Iterated Laguerre raising steps preserve simple negative roots

    RealRooted.laguerreRaisingSteps_splits_simple_roots_negsource
    theorem laguerreRaisingSteps_splits_simple_roots_neg
        {as : List ℝ} (ha : ∀ a ∈ as, 0 < a) {p : ℝ[X]}
        (hpmonic : p.Monic) (hpsplits : p.Splits)
        (hpsimple : HasSimpleRoots p) (hpcoeff : HasNonnegCoeffs p)
        (hp0 : p.coeff 0 ≠ 0) :
        let q
  • A raising step interlaces its input and has simple roots

    RealRooted.strictInterl_and_hasSimpleRoots_laguerreRaisingStepsource
    theorem strictInterl_and_hasSimpleRoots_laguerreRaisingStep
        (a : ℝ) {p : ℝ[X]} (hpdegree : 1 ≤ p.natDegree)
        (hpmonic : p.Monic) (hpsplits : p.Splits) (hpsimple : HasSimpleRoots p)
        (hpcoeff : HasNonnegCoeffs p) (hp0 : p.coeff 0 ≠ 0) :
        StrictInterl p (laguerreRaisingStep a p) ∧
          HasSimpleRoots (laguerreRaisingStep a p)
  • For γ < α + 1, L_n + γ L_{n-1} has simple positive roots

    RealRooted.laguerreCombinationOne_splits_simple_roots_possource
    theorem laguerreCombinationOne_splits_simple_roots_pos
        {n : ℕ} (hn : 1 ≤ n) {α γ : ℝ} (hα : -1 < α)
        (hγ : γ < α + 1) :
        (laguerreCombinationOne n α γ).Splits ∧
          HasSimpleRoots (laguerreCombinationOne n α γ) ∧
          ∀ r ∈ (laguerreCombinationOne n α γ).roots, 0 < r
  • The case γ = 1 for α > 0

    RealRooted.laguerreCombinationOne_one_splits_simple_roots_possource
    theorem laguerreCombinationOne_one_splits_simple_roots_pos
        {n : ℕ} (hn : 1 ≤ n) {α : ℝ} (hα : 0 < α) :
        (laguerreCombinationOne n α 1).Splits ∧
          HasSimpleRoots (laguerreCombinationOne n α 1) ∧
          ∀ r ∈ (laguerreCombinationOne n α 1).roots, 0 < r

Lean source RealRooted/Challenges/Orthogonal/LaguerrePolynomials.lean at revision d6670742. Formalized 2026-09-07.