On Shapiro's lethargy theorem and some applications
Abstract
Shapiro's lethargy theorem states that if An is any non-trivial linear approximation scheme on a Banach space X, then the sequences of errors of best approximation E(x,An) = ∈fa ∈ An ||x - an||X decay almost arbitrarily slowly. Recently, Almira and Oikhberg investigated this kind of result for general approximation schemes in the quasi-Banach setting. In this paper, we consider the same question for F-spaces with non decreasing metric d. We also provide applications to the rate of decay of s-numbers, entropy numbers, and slow convergence of sequences of operators.
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.