# Equioscillation theorem

The equioscillation theorem concerns the approximation of continuous functions using polynomials when the merit function is the maximum difference (uniform norm). Its discovery is attributed to Chebyshev.

## Statement

Let ${\displaystyle f}$ be a continuous function from ${\displaystyle [a,b]}$ to ${\displaystyle \mathbf {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} such that ${\displaystyle f(x_{i})-g(x_{i})=\sigma (-1)^{i}||f-g||_{\infty }}$ where ${\displaystyle \sigma =\pm 1}$.

## Algorithms

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