Decoupled coefficients of orthogonal polynomial projections

ID: decoupled-coefficients-of-orthogonal-polynomial-projections

Let be a real function with , and let be the vector space of real polynomials of degree at most . Its orthogonal projection is the least-squares polynomial in an orthogonal-polynomial basis
Each coefficient depends on just one weighted inner product with and one squared norm. In particular, the coefficients stay the same when the allowed polynomial degree increases. This statement assumes a fixed weight, interval and normalization of the orthogonal polynomials.
To see why the least-squares normal equations decouple, first write a trial polynomial as in any basis of . The residual must be orthogonal to each permitted direction, giving
The Gram matrix usually couples the unknown coefficients. With , it becomes , leaving the separate equations . For the monomial basis on with , by contrast, is zero when is odd and when is even. Distinct even powers, or distinct odd powers, remain coupled.
There is also a proof of the minimum that uses no differentiation. The defining coefficients give for . Thus is orthogonal to all of . For every , the Pythagorean theorem in an inner-product space gives
The second term is nonnegative and vanishes exactly when , proving that the least-squares solution is unique. This is an integrated squared-error optimum; it does not assert a smallest error at every point or a smallest uniform norm.
For , the nested orthogonal projections satisfy the exact residual budget
Indeed, is a linear combination of mutually orthogonal polynomials, and is orthogonal to it. Every newly retained component removes exactly from the squared error. No infinite expansion or completeness assumption is needed for this finite identity. The Legendre least-squares projections of a cubic make every term explicit.

New to topics? Read the docs here!