Weighted Lagrange basis bound on the midpoint grid
ProvedMomentSearch.rakhmanov_weighted_grid_basisapproximation-theorypolynomialsrakhmanov
For the midpoint grid nodes , let be the corresponding Lagrange basis polynomial. Write , where is the uniform-grid logarithmic potential (2.1). The Lean statement uses its explicit elementary formula. There is an absolute constant with
Off the nodes, use , the nodal-product estimate in Lemma 1 and (2.6), and the cosine bound (2.28). At a node, the basis values are given by their interpolation property. The cap is written with a positive denominator so that the expression covers coincidence.
Preamble
import Mathlib
Formal statement
theorem MomentSearch.rakhmanov_weighted_grid_basis :
∃ A : ℝ, 0 < A ∧
∀ N : ℕ, 0 < N →
let ζ : ℕ → ℝ := fun j => -1 + (2 * (j : ℝ) - 1) / (N : ℝ)
let w : ℝ → ℝ := fun z => Real.exp (-(N : ℝ) / 2 *
((1 + z) * Real.log (1 + z) + (1 - z) * Real.log (1 - z)))
∀ x ∈ Set.Icc (-1 : ℝ) 1, ∀ j ∈ Finset.Icc 1 N,
|(Lagrange.basis (Finset.Icc 1 N) ζ j).eval x| ≤
A * (w (ζ j) / w x) / max 1 ((N : ℝ) * |ζ j - x|) := by sorrySource
E. A. Rakhmanov, Bounds for polynomials with a unit discrete norm, Ann. of Math. 165 (2007), 55–88. https://annals.math.princeton.edu/2007/165-1/p03 Lemma 1 and §2.2, (2.6), (2.19)–(2.20), (2.28), pp. 63–67.