Solution

ID: past-exam-of-the-mathematics-course-of-the-university-of-cambridge/2006/ii/paper-2/2g/a/solution

The Chebyshev alternation theorem says that a polynomial of degree at most is a best uniform approximation to a real continuous function on a compact interval if and only if there are ordered points at which attains its uniform norm with alternating signs. For nonzero error these are equal-magnitude alternating extrema; the zero-error case is understood separately. The best approximating polynomial is unique.

New to topics? Read the docs here!