Equioscillation theorem

In mathematics, 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 $$f$$ be a continuous function from $$[a,b]$$ to $$\mathbb{R}$$. Among all the polynomials of degree $$\le n$$, the polynomial $$g$$ minimizes the uniform norm of the difference $$ \| f - g \| _\infty $$ if and only if there are $$n+2$$ points $$a \le x_0 < x_1 < \cdots < x_{n+1} \le b$$ such that $$f(x_i) - g(x_i) = \sigma (-1)^i \| f - g \|_\infty$$ where $$\sigma$$ is either -1 or +1.

Variants
The equioscillation theorem is also valid when polynomials are replaced by rational functions: among all rational functions whose numerator has degree $$\le n$$ and denominator has degree $$\le m$$, the rational function $$g = p/q$$, with $$p$$ and $$q$$ being relatively prime polynomials of degree $$n-\nu$$ and $$m-\mu$$, minimizes the uniform norm of the difference $$ \| f - g \| _\infty $$ if and only if there are $$m + n + 2 - \min\{\mu,\nu\}$$ points $$a \le x_0 < x_1 < \cdots < x_{n+1} \le b$$ such that $$f(x_i) - g(x_i) = \sigma (-1)^i \| f - g \|_\infty$$ where $$\sigma$$ is either -1 or +1.

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