Solution

ID: past-exam-of-the-mathematics-course-of-the-university-of-cambridge/2008/iii/paper-75/3/a/solution

A nontrivial example is , the Chebyshev polynomial characterized by . Its supremum norm is one. At the points , , its values alternate between and ; reversing their order gives increasing nodes with the same alternation.
The zero polynomial therefore satisfies the Chebyshev alternation theorem for degree at most , so . Since the smaller polynomial space is contained in the larger one, ; the zero polynomial is feasible in the smaller space as well, giving the reverse inequality. Hence
A constant function would also give equality with both errors zero, but this example shows that equality can occur at a positive approximation error.

New to topics? Read the docs here!