Rakhmanov’s interpolation estimate with two capped reciprocal factors
ProvedMomentSearch.rakhmanov_interpolation_kernelapproximation-theorypolynomialsrakhmanov
Let have degree at most and absolute value at most one at the midpoint grid nodes , where . Write and let be the density in (2.8). At each there are and a point with and such that
for a universal positive constant . This is the interpolation and equilibrium estimate (2.30). The numerical caps are absorbed into . The bound follows from (2.23), the choice of a root with intervening mass at most , and (2.26). The maxima in the denominators implement the caps even at coincident points.
Preamble
import Mathlib
Formal statement
theorem MomentSearch.rakhmanov_interpolation_kernel :
∃ A : ℝ, 0 < A ∧
∀ N k : ℕ, 1 ≤ k → k < N →
∀ P : Polynomial ℝ, P.natDegree ≤ k →
(∀ j : ℕ, 1 ≤ j → j ≤ N → |P.eval (-1 + (2 * (j : ℝ) - 1) / (N : ℝ))| ≤ 1) →
∀ r : ℝ, r = Real.sqrt (1 - (k : ℝ) ^ 2 / (N : ℝ) ^ 2) →
∀ x : ℝ, -r < x → x < r →
∃ M y : ℝ, 0 < M ∧ M ≤ (N : ℝ) / 2 ∧ |x - y| ≤ 2 / M ∧
(N : ℝ) / Real.pi * Real.arctan ((N : ℝ) / (k : ℝ) *
Real.sqrt (r ^ 2 - x ^ 2)) ≤ M ∧
|P.eval x| ≤ A * (∑ j ∈ Finset.Icc 1 N,
1 / (max 1 ((N : ℝ) * |(-1 + (2 * (j : ℝ) - 1) / (N : ℝ)) - x|) *
max 1 (M * |(-1 + (2 * (j : ℝ) - 1) / (N : ℝ)) - y|))) := 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 §2.1, (2.8), and §2.2, (2.19)–(2.30), pp. 63–67.