A strictly convex normed space is a normed vector space whose unit sphere contains no nontrivial line segment. Equivalently, for distinct unit vectors ,Suppose are both elements of best approximation in a normed space to , and let . If then . If and , the vectors and are distinct unit vectors. Strict convexity givesBut , contradicting the definition of . Thus there is at most one best approximant. This proves uniqueness of best approximation in a strictly convex space, and does not assert existence for an arbitrary, possibly nonclosed, linear subspace.
Take and . The Lp space is strictly convex because is strictly convex: for distinct unit functions its pointwise midpoint inequality is strict on a set of positive measure, hence integration gives norm strictly below one. The finite-dimensional linear subspace has a best approximant: any minimizing sequence is bounded by , and finite-dimensional compactness gives a convergent subsequence whose limit minimizes the continuous error. Uniqueness follows from part 1.
Write that unique minimizer as and its residual as . Translation on the circle preserves the Lp norm. Since , the translated polynomial is another minimizer. Uniqueness forcesAlso . Therefore the polynomial has residual , with the same norm as , and is again a minimizer. HenceTo extract the consequence, write the trigonometric polynomial as . The first identity gives . Only in the indicated frequency range is a multiple of , so is constant. The second identity makes this constant its own negative and therefore zero. Thus the lower-frequency Lp approximation to a single harmonic isFor the space already consists only of constants, and the negative-translation argument gives the same result.
Articles by others on the same topic
There are currently no matching articles.