Chebyshev's extremal property of the Chebyshev polynomials
ProvedFamousTheorems.chebyshev_extremal_leading_coeff_6cChebyshev's extremal property. Let be a real polynomial of degree at most with for all . Then the leading coefficient of is at most .
Equality holds for the Chebyshev polynomial . Equivalently, among monic polynomials of degree , the scaled Chebyshev polynomial has the smallest supremum norm on . This is the starting point of approximation theory and explains why Chebyshev nodes are good interpolation points.
Formalization note. Mathlib's Polynomial.Chebyshev.leadingCoeff_le_of_forall_abs_le_one. The exponent is natural-number subtraction, so for the bound is . P.leadingCoeff is the coefficient of the top-degree term of (and for ).
Preamble
import Mathlib
Formal statement
namespace FamousTheorems
theorem chebyshev_extremal_leading_coeff_6c {n : ℕ} {P : Polynomial ℝ} (hPdeg : P.degree ≤ n)
(hPbnd : ∀ x ∈ Set.Icc (-1 : ℝ) 1, |P.eval x| ≤ 1) : P.leadingCoeff ≤ 2 ^ (n - 1) := by sorry
end FamousTheoremsSource
Listed in Mathlib's curated theorem manifests (docs/1000.yaml); formalized in Mathlib as `Polynomial.Chebyshev.leadingCoeff_le_of_forall_abs_le_one`. Proof here reduces to that Mathlib result.