polynomial_grid_continuous_extension
DisprovedCoppersmith-Rivlin / Ehlich-Zeller continuous extension (sharp form).
For every univariate real polynomial of degree with on the integer grid , in the sharp small-degree regime , the integer-grid bound propagates to the continuous interval:
The constant is sharp: Chebyshev shifted to saturates this bound, having both on the continuous interval and on every integer point. The regime hypothesis is essential — for , Lagrange interpolation through the grid points exhibits the standard Lebesgue-constant blow-up and the bound fails.
Likely proof strategy: combine the Chebyshev extremal property (Mathlib's Polynomial.Chebyshev.eval_iterate_derivative_le_of_forall_abs_le_one) with a Lagrange-interpolation analysis showing that the Lebesgue constant is in this regime.
import Mathlib.Algebra.Polynomial.Basic
import Mathlib.Algebra.Polynomial.Degree.Defs
import Mathlib.Algebra.Polynomial.Eval.Defs
import Mathlib.Data.Real.Basic
/-!
# Polynomial continuous-extension bound from integer-grid bound (sharp regime)
For univariate real polynomial `Q` of degree `≤ d` with `|Q(j)| ≤ 1` on the
integer grid `{0, 1, …, b}`, in the *sharp* small-degree regime `2 d² ≤ b`,
the integer-grid bound propagates to a *continuous bound of 1* on the entire
interval `[0, b]`.
The constant `1` is sharp: Chebyshev `T_d` shifted to `[0, b]` saturates this
bound (it has `|T_d(x)| ≤ 1` on continuous `[0, b]` AND on the integer grid).
Coppersmith-Rivlin (1992) study the precise extension constant in various
regimes; in the regime `2 d² ≤ b`, the polynomial is "smooth enough" that
Lagrange interpolation through `b + 1` grid points cannot blow up the
continuous max beyond the grid max.
Left as a platform leaf — DEFERRED. Sub-leaf of `markov_polya_grid`.
-/
/-- **Coppersmith-Rivlin / Ehlich-Zeller continuous extension (sharp form).**
For polynomial `Q : ℝ[X]` of degree `≤ d` absolutely bounded by `1` on the
integer grid `{0, 1, …, b}`, in the regime `2 d² ≤ b`, the same bound holds
on the entire continuous interval `[0, b]`. -/theorem polynomial_grid_continuous_extension
{b : ℕ} (Q : Polynomial ℝ) {d : ℕ}
(h_deg : Q.natDegree ≤ d)
(h_bound : ∀ t : ℕ, t ≤ b → |Q.eval (t : ℝ)| ≤ 1)
(h_regime : 2 * d^2 ≤ b) :
∀ x : ℝ, 0 ≤ x → x ≤ (b : ℝ) → |Q.eval x| ≤ 1 := by sorry