Solution

ID: past-exam-of-the-mathematics-course-of-the-university-of-cambridge/2010/ii/paper-4/2f/solution

The fourth Chebyshev polynomial is . Therefore take
Indeed , and on , as follows from .
Here is a direct Chebyshev alternation theorem argument proving optimality, without assuming the theorem. At the five ordered points
the error takes the alternating values . If a polynomial of degree at most three had strictly smaller uniform error, then would have alternating strictly positive and strictly negative values at these points. The intermediate value theorem would give a distinct root in each of the four intervening intervals. A nonzero polynomial of degree at most three cannot have four distinct roots. This contradiction proves the required minimax inequality.

New to topics? Read the docs here!