In approximation theory, Jackson's inequality is an inequality bounding the value of function's best approximation by algebraic or trigonometric polynomials in terms of the modulus of continuity or modulus of smoothness of the function or of its derivatives.^[1] Informally speaking, the smoother the function is, the better it can be approximated by polynomials.

For trigonometric polynomials, the following was proved by Dunham Jackson:

Theorem 1: If ${\displaystyle f:[0,2\pi ]\to \mathbb {C} }$ is an ${\displaystyle r}$ times differentiable periodic function such that

${\displaystyle \left|f^{(r)}(x)\right|\leq 1,\qquad x\in [0,2\pi ],}$

then, for every positive integer ${\displaystyle n}$, there exists a trigonometric polynomial ${\displaystyle T_{n-1}}$ of degree at most ${\displaystyle n-1}$ such that

${\displaystyle \left|f(x)-T_{n-1}(x)\right|\leq {\frac {C(r)}{n^{r}}},\qquad x\in [0,2\pi ],}$

where ${\displaystyle C(r)}$ depends only on ${\displaystyle r}$.

The Akhiezer–Krein–Favard theorem gives the sharp value of ${\displaystyle C(r)}$ (called the Akhiezer–Krein–Favard constant):

${\displaystyle C(r)={\frac {4}{\pi }}\sum _{k=0}^{\infty }\left[{\frac {(-1)^{k}}{2k+1}}\right]^{r+1}~.}$

Jackson also proved the following generalisation of Theorem 1:

Theorem 2: One can find a trigonometric polynomial ${\displaystyle T_{n}}$ of degree ${\displaystyle \leq n}$ such that

${\displaystyle |f(x)-T_{n}(x)|\leq {\frac {C(r)\omega \left({\frac {1}{n}},f^{(r)}\right)}{n^{r}}},\qquad x\in [0,2\pi ],}$

where ${\displaystyle \omega (\delta ,g)}$ denotes the modulus of continuity of function ${\displaystyle g}$ with the step ${\displaystyle \delta .}$

An even more general result of four authors can be formulated as the following Jackson theorem.

Theorem 3: For every natural number ${\displaystyle n}$, if ${\displaystyle f}$ is ${\displaystyle 2\pi }$-periodic continuous function, there exists a trigonometric polynomial ${\displaystyle T_{n}}$ of degree ${\displaystyle \leq n}$ such that

${\displaystyle |f(x)-T_{n}(x)|\leq c(k)\omega _{k}\left({\tfrac {1}{n}},f\right),\qquad x\in [0,2\pi ],}$

where constant ${\displaystyle c(k)}$ depends on ${\displaystyle k\in \mathbb {N} ,}$ and ${\displaystyle \omega _{k}}$ is the ${\displaystyle k}$-th order modulus of smoothness.

For ${\displaystyle k=1}$ this result was proved by Dunham Jackson. Antoni Zygmund proved the inequality in the case when ${\displaystyle k=2,\omega _{2}(t,f)\leq ct,t>0}$ in 1945. Naum Akhiezer proved the theorem in the case ${\displaystyle k=2}$ in 1956. For ${\displaystyle k>2}$ this result was established by Sergey Stechkin in 1967.

Generalisations and extensions are called Jackson-type theorems. A converse to Jackson's inequality is given by Bernstein's theorem. See also constructive function theory.

• Korneichuk, N.P.; Motornyi, V.P. (2001) [1994], "Jackson_inequality", Encyclopedia of Mathematics, EMS Press
• Weisstein, Eric W. "Jackson's Theorem". MathWorld.

This mathematical analysis–related article is a stub. You can help Wikipedia by adding missing information.

• v
• t
• e