Take , as intended by the stated normalization. The Chebyshev polynomial recurrence , with and , shows by mathematical induction that has polynomial degree and leading coefficient . Consequently is a monic polynomial. At the ordered Chebyshev extreme points ,and .
Suppose a monic polynomial of the same polynomial degree had . The difference has degree at most because its leading coefficients cancel. Its signs at the ordered extreme points strictly alternate. The intermediate value theorem supplies a distinct root of a polynomial between each consecutive pair, giving at least roots. This contradicts its degree bound. Hence the monic Chebyshev extremal polynomial satisfiesAt the printed formula instead gives , which is not monic; the degree-zero minimizer is the constant one. This endpoint case requires the separate normalization .
Put in the weighted inner product. Since ,The last equality follows by the product-to-sum trigonometric identity and integration. Thus these are nonzero mutually orthogonal polynomials. The first are linearly independent, and the vector space has dimension ; therefore .
For any , the function of the real parameter has a minimum at . Its derivative there vanishes, proving . This is precisely the defining orthogonality of an orthogonal projection, or a least-squares polynomial in an orthogonal-polynomial basis. Conversely, this condition and the Pythagorean theorem for inner product spaces give , proving the minimum and its uniqueness.
Expand in the basis already established and take the inner product with . Orthogonality leaves , soIn particular and for . These are the corresponding Chebyshev series coefficients with the constant coefficient convention used in this question.
Articles by others on the same topic
There are currently no matching articles.