# Chebyshev theorem

(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

2010 Mathematics Subject Classification: Primary: 41A50 [MSN][ZBL]

If a function $f(x)$ is continuous on $[a,b]$ and if

$$A=\max_{a\leq x\leq b}|f(x)-P_n(x)|,$$

$$P_n(x)=\sum_{k=0}^na_kx^k,$$

then $P_n(x)$ is the polynomial of best uniform approximation for $f(x)$, i.e.

$$\max_{a\leq x\leq b}|f(x)-P_n(x)|=\min_{\{c_k\}}\max_{a\leq x\leq b}\left|f(x)-\sum_{k=0}^nc_kx^k\right|,$$

if and only if there exist $n+2$ points $a\leq x_0<\dots<x_{n+1}\leq b$ in Chebyshev alternation, which means that the condition

$$f(x_i)-P_n(x_i)=\epsilon A(-1)^i,\quad i=0,\dots,n+1,$$

is satisfied, where $\epsilon=1$ or $-1$. This theorem was proved by P.L. Chebyshev in 1854 (cf. ) in a more general form, namely for the best uniform approximation of functions by rational functions with fixed degrees of the numerator and denominator. Chebyshev's theorem remains valid if instead of algebraic polynomials one considers polynomials

$$P_n(x)=\sum_{k=0}^nc_k\phi_k(x),$$

where $\{\phi_k(x)\}_{k=0}^n$ is a Chebyshev system. The criterion formulated in Chebyshev's theorem leads to methods for the approximate construction of polynomials of best uniform (Chebyshev) approximation. In a somewhat different formulation Chebyshev's theorem can be extended to functions of a complex variable (cf. ) and to abstract functions (cf. ).

How to Cite This Entry:
Chebyshev theorem. Encyclopedia of Mathematics. URL: http://encyclopediaofmath.org/index.php?title=Chebyshev_theorem&oldid=36521
This article was adapted from an original article by Yu.N. Subbotin (originator), which appeared in Encyclopedia of Mathematics - ISBN 1402006098. See original article