Rakhmanov’s midpoint nodal envelope and derivative bound
ProvedMomentSearch.rakhmanov_midpoint_nodal_envelopeapproximation-theorypolynomialsrakhmanov
For let be the monic nodal polynomial of the midpoint grid, , and for the uniform logarithmic potential of (2.1). The Lean statement uses the explicit elementary formula for .
There is a scale for each such that
This is the upper envelope in Lemma 1 and the lower envelope at the nodes from (2.6), with . The phase can be written with because and the absolute value of cosine is unchanged by this reflection.
Preamble
import Mathlib
Formal statement
theorem MomentSearch.rakhmanov_midpoint_nodal_envelope :
∀ 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)))
let T := Lagrange.nodal (Finset.Icc 1 N) ζ
let b : ℝ := Real.pi * N / 2
∃ c : ℝ, 0 < c ∧
(∀ x ∈ Set.Icc (-1 : ℝ) 1,
|T.eval x| ≤ 2 * c * |Real.cos (b * (x + 1))| / w x) ∧
(∀ j ∈ Finset.Icc 1 N,
c * b / w (ζ j) ≤ |T.derivative.eval (ζ j)|) := by sorrySource
E. A. Rakhmanov, Bounds for polynomials with a unit discrete norm, Ann. of Math. 165 (2007), 55–88, §2.1, Lemma 1 and (2.1), (2.4)–(2.6), p. 63; proof in §3.2. https://annals.math.princeton.edu/2007/165-1/p03