Approximation by linear sampling operators in Banach spaces
Yurii Kolomoitsev
TL;DR
This work develops a comprehensive theory of approximation by linear sampling operators in general Banach lattices $X$, establishing direct and inverse estimates, convergence criteria, and strong converse inequalities that extend beyond classical $L_p$ spaces. By leveraging Steklov averaging and tailored moduli of smoothness, the authors connect sampling-operator errors to semi-discrete $K$-functionals and smoothness functionals, yielding a unified framework for both periodic and non-periodic settings. The results cover a broad class of sampling operators, including Lagrange-type and quasi-interpolation schemes, and provide concrete examples with Bochner–Riesz, Fejér, and sinc-type kernels, together with precise conditions under which the bounds hold. The practical impact lies in enlarging the class of Banach-lattice function spaces and sampling schemes for which sharp, verifiable approximation guarantees can be obtained, with explicit inverse-type and strong-converse statements. Overall, the paper advances the theoretical foundations of sampling-based approximation by unifying direct, inverse, and strong-converse results via $K$-functionals and Steklov-based smoothness across periodic and non-periodic domains.
Abstract
This paper studies approximation properties of linear sampling operators in general Banach lattices $X$. We obtain matching direct and inverse approximation estimates, convergence criteria, equivalence results involving special $K$-functionals and their realizations by sampling operators, as well as strong converse inequalities, which, to the best of our knowledge, have not been previously established for sampling operators even in the classical spaces $L_p$. The results extend several classical theorems previously known mainly in $L_p$ and apply to all functions $f\in X$ for which the corresponding sampling operator is well defined, thereby substantially enlarging the class of functions that can be considered in this framework.
