Equioscillation theorem

Let ${\displaystyle f}$ be a continuous function from ${\displaystyle [a,b]}$ to ${\displaystyle \mathbb {R} }$. Among all the polynomials of degree ${\displaystyle \leq n}$, the polynomial ${\displaystyle g}$ minimizes the uniform norm of the difference ${\displaystyle \|f-g\|_{\infty }}$ if and only if there are ${\displaystyle n+2}$ points ${\displaystyle a\leq x_{0}<x_{1}<\cdots <x_{n+1}\leq b}$ such that ${\displaystyle f(x_{i})-g(x_{i})=\sigma (-1)^{i}\|f-g\|_{\infty }}$ where ${\displaystyle \sigma =\pm 1}$.

Several minimax approximation algorithms are available, the most common being the Remez algorithm.

• Notes on how to prove Chebyshev’s equioscillation theorem at the Wayback Machine (archived July 2, 2011)
• The Chebyshev Equioscillation Theorem by Robert Mayans

• The de la Vallée-Poussin alternation theorem at the Encyclopedia of Mathematics