A best approximation to from is a vector such that
The definition requires attainment of the infimum. This finite-dimensional subspace does have such an approximation, as the explicit projection below shows; completeness of the whole inner-product space is unnecessary.
Expand both squared norms using the inner product:
Adding cancels the cross terms, giving the parallelogram law
The real part may be omitted in a real inner-product space.
Suppose both minimize the distance, with common value . Apply the parallelogram identity to and :
The midpoint belongs to the linear subspace , so its distance from is at least . It follows that , hence . Thus the best approximation is unique.
Let , using the convention that the inner product is linear in its first argument. Orthonormality gives
for every . Hence is orthogonal to . For any , the Pythagorean identity gives , so is the unique best approximation. Therefore
Expand the norm of the orthonormal-basis expression. All cross terms vanish and , so
The residual is orthogonal to . Thus the Pythagorean theorem gives . Substitute part (ii) and rearrange:
Nonnegativity of the left-hand side also gives the finite form of Bessel's inequality.
Assume the usual nondegenerate interval . The integral is bilinear and symmetric because the functions and weight are real. It is nonnegative on . If is nonzero at a point, continuity makes bounded below by a positive number on a nontrivial relative interval nearby, and the positive continuous weight is also bounded below there. Hence . Thus the formula is positive definite and defines an inner product.
The functions are orthogonal precisely when
A singleton interval would make this integral zero for every function, so the condition is necessary.
The intended orthogonal-polynomial convention is . An arbitrary orthonormal basis without this degree ordering does not satisfy the claim: permuting a standard basis can place the nonzero constant polynomial last, where it has no roots rather than . The following proof uses the required degree ordering.
It makes orthogonal to every polynomial of degree less than , since form a basis of that lower-degree space. Let be the distinct roots in at which changes sign, and put , with if . The product has constant sign on except at its finitely many zeros: each sign change of is canceled by that of .
If , then has degree below , so orthogonality gives . But a nonzero constant-sign continuous product against the positive weight has a nonzero integral, a contradiction. Thus . Since , there are exactly such roots, all simple, with no additional endpoint roots. In particular
This also includes , where the polynomial is nonzero constant and has no roots.
Use the intended degree ordering from part (b). Let be the degree- Lagrange cardinal polynomial at the distinct roots of :
For any , polynomial division gives with and . Orthogonality of to makes the integral of zero, and that product also vanishes at every quadrature node. Meanwhile by interpolation. Consequently
Thus the rule is exact up to degree . To determine the sign of a weight, apply exactness to , of degree :
The inequality is strict because is a nonzero polynomial and the weight is positive. This is the Gaussian quadrature construction; the source asks only for nonnegative weights, and the proof gives positivity.

Articles by others on the same topic (0)

There are currently no matching articles.