A best approximation to from is an element satisfying . This is a minimum over the specified approximation subspace, not over all of .
Expand using the inner product. The two cross terms cancel:
Adding proves , for real or complex inner products.
Suppose both attain the minimum distance . Apply (b) to and :
The midpoint belongs to , so its squared distance is at least . Thus , forcing . Existence will also follow constructively in (d)(i).
Set , with the convention that the inner product is linear in its first argument. Orthonormality gives , hence . For any the Pythagorean identity yields
Thus this is the best approximation, and uniqueness gives . No completeness assumption on is necessary for this finite-dimensional construction.
Take the squared norm of the orthonormal expansion from (i). All mixed inner products vanish and every diagonal inner product is one, so
The decomposition is orthogonal by (i). Therefore . Substitute (ii) and rearrange to obtain
In particular nonnegativity of the left side gives the finite Bessel inequality.
Assume the intended nondegenerate interval and real-valued continuous functions. The integral is bilinear and symmetric. Since , it gives . If a continuous is nonzero at some point, continuity makes strictly positive on a subinterval of positive length, so its integral is positive. Hence forces , proving positive definiteness. Orthogonality means . If , the displayed integral is identically zero and is not an inner product on the stated function space; that degenerate case must be excluded.
An arbitrary orthonormal basis does not have the printed property. For example on with , take the usual normalized constant and linear Legendre polynomials and swap their labels . The resulting family is still an orthonormal basis but has one zero, rather than zero. The necessary intended hypothesis is that has degree , or equivalently that the basis is obtained by orthogonalizing in that order.
Under this hypothesis, is orthogonal to every polynomial of degree less than . Let be its sign-changing zeros in and put . If , then has a constant nonzero sign except at finitely many points: each interior sign change has been canceled, and all remaining zeros have even multiplicity or occur at endpoints. Since , its integral cannot vanish. But orthogonality to , of degree , says that integral is zero, a contradiction. Thus . Since the polynomial has degree , it follows that
This proves the requested conclusion in its standard intended setting and explains why it does not follow from the literal basis statement alone.
Use the degree-ordered orthogonal polynomials identified in (b); otherwise the printed nodes need not exist. Let be the degree- Lagrange interpolation polynomial with and set .
For any , polynomial division gives with and . Orthogonality gives , while this product also vanishes at every node. The interpolation formula for then proves
Apply this exactness to , of degree at most . It gives , because is not the zero polynomial. Thus all quadrature weights are actually strictly positive, stronger than the requested nonnegativity. Here exactness is for the weighted integral defined at the start of the question.

Articles by others on the same topic (0)

There are currently no matching articles.