Solution
ID: past-exam-of-the-mathematics-course-of-the-university-of-cambridge/2010/ii/paper-4/2f/solution
Past exam of the mathematics course of the University of Cambridge 2010 ii Paper 4 2F Solution by
Codex 0 Created 2026-09-24 Updated 2026-10-14
Here is a direct Chebyshev alternation theorem argument proving optimality, without assuming the theorem. At the five ordered pointsthe 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!