Article · Wikipedia archive · Last revised Jul 16, 2026

Lethargy theorem

In mathematics, a lethargy theorem is a statement about the distance of points in a metric space from members of a sequence of subspaces; one application in numerical analysis is to approximation theory, where such theorems quantify the difficulty of approximating general functions by functions of special form, such as polynomials. In more recent work, the convergence of a sequence of operators is studied: these operators generalise the projections of the earlier work.

Last revised
Jul 16, 2026
Read time
≈ 1 min
Length
313 w
Citations
Source

In mathematics, a lethargy theorem is a statement about the distance of points in a metric space from members of a sequence of subspaces; one application in numerical analysis is to approximation theory, where such theorems quantify the difficulty of approximating general functions by functions of special form, such as polynomials. In more recent work, the convergence of a sequence of operators is studied: these operators generalise the projections of the earlier work.

Bernstein's lethargy theorem

Let V 1 V 2 {\displaystyle V_{1}\subset V_{2}\subset \ldots } be a strictly ascending sequence of finite-dimensional linear subspaces of a Banach space X, and let ϵ 1 ϵ 2 {\displaystyle \epsilon _{1}\geq \epsilon _{2}\geq \ldots } be a decreasing sequence of real numbers tending to zero. Then there exists a point x in X such that the distance of x to Vi is exactly ϵ i {\displaystyle \epsilon _{i}} .

See also

See also

References

References