Chebyshev–Gauss quadrature
ProvedFamousTheorems.chebyshev_gauss_quadratureChebyshev–Gauss quadrature. Let and let be a real polynomial of degree less than . Then
The nodes are the zeros of the Chebyshev polynomial . This is the Gauss quadrature rule for the Chebyshev weight, and it is exact up to the optimal degree . It is unusual in that the nodes and the weights, all equal to , are given in closed form.
Formalization note. Mathlib's Polynomial.Chebyshev.integral_eq_sumZeroes. Polynomial.Chebyshev.measureT is Lebesgue measure on with density , and Polynomial.Chebyshev.sumZeroes n P is the weighted sum on the right.
Preamble
import Mathlib
Formal statement
namespace FamousTheorems
open MeasureTheory
theorem chebyshev_gauss_quadrature {n : ℕ} {P : Polynomial ℝ} (hn : n ≠ 0) (hP : P.degree < 2 * n) :
∫ x, P.eval x ∂Polynomial.Chebyshev.measureT = Polynomial.Chebyshev.sumZeroes n P := by sorry
end FamousTheoremsSource
Listed in Mathlib's curated theorem manifests (docs/1000.yaml); formalized in Mathlib as `Polynomial.Chebyshev.integral_eq_sumZeroes`. Proof here reduces to that Mathlib result.