Gamma identities for the midpoint nodal polynomial
ProvedMomentSearch.midpoint_nodal_gamma_identitiesapproximation-theorygamma-functionrakhmanov
For the midpoint nodes, set , , and let be the monic polynomial vanishing at those nodes. On ,
At the -th node, . For the first identity, write and use the Gamma recurrence and reflection formula off the nodes. At the nodes both sides vanish. For the derivative, the product with its -th factor omitted has absolute value .
Preamble
import Mathlib
Formal statement
theorem MomentSearch.midpoint_nodal_gamma_identities (N : ℕ) (hN : 0 < N) :
let ζ : ℕ → ℝ := fun j => -1 + (2 * (j : ℝ) - 1) / (N : ℝ)
let T := Lagrange.nodal (Finset.Icc 1 N) ζ
let b : ℝ := Real.pi * N / 2
let G : ℝ → ℝ := fun x =>
(2 / (N : ℝ)) ^ N / Real.pi *
(Real.Gamma ((N : ℝ) / 2 * (1 + x) + 1 / 2) *
Real.Gamma ((N : ℝ) / 2 * (1 - x) + 1 / 2))
(∀ x ∈ Set.Icc (-1 : ℝ) 1, |T.eval x| = G x * |Real.cos (b * (x + 1))|) ∧
(∀ j ∈ Finset.Icc 1 N, |T.derivative.eval (ζ j)| = G (ζ j) * b) := by sorrySource
Rakhmanov, Bounds for polynomials with a unit discrete norm, §2.1, (2.3) and (2.6), https://annals.math.princeton.edu/2007/165-1/p03. This is the alternative Gamma expression derived from the recurrence and reflection identities in NIST DLMF §5.5, https://dlmf.nist.gov/5.5.