Take , . These nine points satisfy . Thus the zero polynomial has nine alternating error extrema of magnitude one and is minimax among polynomials of degree at most seven by the Chebyshev alternation theorem. Hence every such polynomial has uniform error at least one.
One can also prove the bound directly. If the error were strictly below one everywhere, would have sign . The intermediate value theorem would give a distinct zero in each of the eight intervening intervals, contradicting the degree bound. Since the continuous error attains its maximum on the compact interval, there is an with .

Articles by others on the same topic (0)

There are currently no matching articles.