 Chebyshev alternation theorem

A degree-at-most-$m$ polynomial is a best uniform approximation precisely when its error attains alternating extrema of equal magnitude at at least $m+2$ ordered points.