Solution

ID: past-exam-of-the-mathematics-course-of-the-university-of-cambridge/2003/iii/paper-69/3/c/solution

Choose a best uniform approximation . It exists because this vector subspace is a finite-dimensional vector space and a minimizing sequence is bounded: . Finite-dimensional equivalence of norms then supplies a convergent subsequence of coefficients. If , the Chebyshev alternation theorem gives alternating error extrema. The intermediate value theorem supplies a zero of in each of the intervening open intervals. These interpolation nodes are distinct, and uniqueness of polynomial interpolation gives
The convergence follows from the Weierstrass approximation theorem. If , choose any distinct nodes: the polynomial interpolant is still . This constructs interpolation nodes from best uniform approximation; the nodes depend on , and no universal node system for all continuous functions is asserted.

New to topics? Read the docs here!