Kolmogorov criterion for uniform approximation (source code)

= Kolmogorov criterion for uniform approximation
{c}

Let $K$ be a <compact Hausdorff space>, $U$ a real <linear subspace> of $C(K,\mathbb R)$, $f\in C(K,\mathbb R)$ and $u\in U$. Put $e=f-u$ and $E=\{x:|e(x)|=\|e\|_\infty\}$. Then $u$ is a <best uniform approximation> from $U$ precisely when every $v\in U$ has some $x\in E$ with $e(x)v(x)\leq0$.<Math CS 887: Approximation Theory by Carl de Boor>[Kolmogorov criterion (47), printed p.29, real specialization]{ref}

If a direction $v$ has strictly matching error signs everywhere on $E$, <compactness> makes $u+tv$ a uniformly better approximant for sufficiently small $t>0$. Conversely, for any candidate $u+v$, an active point with $e(x)v(x)\leq0$ has $|e(x)-v(x)|\geq|e(x)|$, preventing improvement. The <linear subspace> hypothesis ensures that differences of candidates are admissible directions; for a general nonlinear family, the quantified direction set would have to change. This criterion yields the <Chebyshev alternation theorem>.