Theorems · Definition · special functions
Polynomial.Chebyshev.sumNodes
ℕ → (ℕ → ℝ) → Polynomial ℝ → ℝ
For a polynomial P and coefficient function c, sumNodes n c P is a linear combination
of P evaluated at the n'th order Chebyshev nodes, with coefficients taken from c.
- Cited by
- 6 results in Mathlib
- Foundations
- Depth 172 from the axioms · uses propext, Classical.choice, Quot.sound
Around this declaration
Dashed lines are statement dependencies; solid lines are citations in proofs.
Cites6
Mathlib declarations this one mentions in its statement or cites explicitly in its proof. Plumbing is filtered out.
- Realstatement and proof · cited by 25,697
- Polynomialstatement and proof · cited by 5,681
- Finset.sumproof · cited by 5,195
- Polynomial.evalproof · cited by 796
- Finset.Iicproof · cited by 280
- Polynomial.Chebyshev.nodeproof · cited by 9
Cited by6
Results whose statement or proof uses this declaration.
- Polynomial.Chebyshev.sumNodes_eq_sumNodes_T_iffstatement and proof · cited by 2
- Polynomial.Chebyshev.sumNodes_le_sumNodes_Tstatement and proof · cited by 2
- Polynomial.Chebyshev.coeff_eq_iff_of_forall_abs_le_oneproof · cited by 1
- Polynomial.Chebyshev.coeff_le_of_forall_abs_le_oneproof · cited by 1
- Polynomial.Chebyshev.eval_iterate_derivative_eq_iff_of_boundedproof · cited by 0
- Polynomial.Chebyshev.eval_iterate_derivative_le_of_forall_abs_le_oneproof · cited by 0