The norm induced by a real inner product isPositive definiteness and homogeneity follow from the inner product axioms; Cauchy-Schwarz gives the triangle inequality by expanding .
Use the usual weighted interpretation, identifying functions equal almost everywhere; on raw pointwise functions the displayed integral is only a seminorm. Assume . If is orthogonal to , then for every ,Conversely, suppose minimizes the error. For and every real , compare with :If the linear coefficient were nonzero, a sufficiently small with the appropriate sign would make the expression negative. Thus for every , proving best approximation is equivalent to orthogonality of the residual.
Write and . Orthogonality of to and givesThe Gram matrix is positive definite, with determinant , so the solution is unique. Solving yields
The singular weight requires care about the space of admissible polynomials. Since , has finite squared norm. A polynomial has finite error relative to near zero exactly when : a nonzero constant term makes the integrand asymptotic to , whose integral diverges. If , the residual is and the integrand is .
Thus the full space is not a subspace of , so the projection theorem cannot be applied to it as written. Nevertheless a unique best finite-error approximation does exist inFor , this is the zero space and the answer is . For , is finite dimensional and its Gram matrix is positive definite, because a nonzero polynomial cannot vanish on an interval. Solving the normal equations therefore gives its unique orthogonal projection of . All omitted polynomials have infinite error, so this also minimizes the extended error over the full polynomial set. The distinction is an invalid full-space projection premise, not nonexistence of every finite-error best approximation. As throughout weighted , use equivalence classes for the underlying measure.
Articles by others on the same topic
There are currently no matching articles.