For an integer , the monic polynomial uniquely minimizes the uniform norm on among real monic polynomials of degree . The minimum norm is . The normalization uses the leading coefficient of the Chebyshev polynomial .
At the alternating extrema of , a strictly smaller competitor would make its difference from change sign at least times. That difference has degree at most , a contradiction; the equioscillation theorem also gives uniqueness. The degree-zero case is separate: the only monic polynomial of degree zero is , whose norm is , not .
Articles by others on the same topic
There are currently no matching articles.