Logarithmic bound for the two-factor sum on a uniform grid
ProvedMomentSearch.rakhmanov_grid_kernel_sumapproximation-theorypolynomialsrakhmanov
Take the midpoint grid nodes of spacing , where . For any real and with , the finite sum
is at most for a universal positive constant . This is the discrete summation step of (2.31)–(2.34), with conservative caps. One can first bound by using the triangle inequality. On each side of , grid spacing bounds the sum of the resulting factors by a harmonic contribution up to scale and a reciprocal-square tail beyond it.
Preamble
import Mathlib
Formal statement
theorem MomentSearch.rakhmanov_grid_kernel_sum :
∃ D : ℝ, 0 < D ∧
∀ N : ℕ, 0 < N → ∀ M x y : ℝ, 0 < M → M ≤ (N : ℝ) / 2 → |x - y| ≤ 2 / M →
(∑ j ∈ Finset.Icc 1 N,
1 / (max 1 ((N : ℝ) * |(-1 + (2 * (j : ℝ) - 1) / (N : ℝ)) - x|) *
max 1 (M * |(-1 + (2 * (j : ℝ) - 1) / (N : ℝ)) - y|))) ≤
D * Real.logb 2 ((N : ℝ) / M) := 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.2, (2.30)–(2.34), pp. 67–68.