A negative log sample forces factorial Bernstein cost at distinct positive log primes
ProvedMasulloRH.bernstein_bilateral_prime_interpolation_costharmonic-analysisinterpolation
For n+1 increasing prime nodes below P where a smooth real profile vanishes, its value at negative log 2 times (n+1)! is bounded by A times (B log(2P))^(n+1) when the derivative of order n+1 on the enclosing interval is bounded by A B^(n+1). Applied to a difference of bilateral probe profiles this quantifies a fixed-band interpolation obstruction.
Preamble
import Mathlib import Theorems.Thm_MetodosNumericos_lagrange_error_bound open Set
Formal statement
theorem MasulloRH.bernstein_bilateral_prime_interpolation_cost (n : ℕ) (p : Fin (n+1) → ℕ) (P : ℕ)
(hp : ∀ i, (p i).Prime) (hinc : StrictMono p) (hP : ∀ i, p i ≤ P)
(H : ℝ → ℝ) (A B : ℝ) (hA : 0 ≤ A) (hB : 0 ≤ B)
(hc : ContDiff ℝ (n+1 : ℕ) H)
(hzero : ∀ i, H (Real.log (p i : ℝ)) = 0)
(hder : ∀ y ∈ Ioo (-Real.log 2-1) (Real.log (P:ℝ)+1),
|iteratedDerivWithin (n+1) H (Ioo (-Real.log 2-1) (Real.log (P:ℝ)+1)) y| ≤ A * B^(n+1)) :
|H (-Real.log 2)| * ((n+1).factorial : ℝ) ≤
A * (B * (Real.log (P:ℝ)+Real.log 2))^(n+1) := by sorrySource
Masullo finite-place bilateral comparison and Hardy band restriction. Uses the platform-certified Freitas–Métodos Numéricos Lagrange remainder bound.