Embeddings and Lebesgue-type inequalities for the greedy algorithm in Banach spaces
Functional Analysis
2017-09-18 v2
Abstract
We obtain Lebesgue-type inequalities for the greedy algorithm for arbitrary complete seminormalized biorthogonal systems in Banach spaces. The bounds are given only in terms of the upper democracy functions of the basis and its dual. We also show that these estimates are equivalent to embeddings between the given Banach space and certain discrete weighted Lorentz spaces. Finally, the asymptotic optimality of these inequalities is illustrated in various examples of non necessarily quasi-greedy bases.
Cite
@article{arxiv.1707.07513,
title = {Embeddings and Lebesgue-type inequalities for the greedy algorithm in Banach spaces},
author = {P. M. Berná and O. Blasco and G. Garrigós and E. Hernández and T. Oikhberg},
journal= {arXiv preprint arXiv:1707.07513},
year = {2017}
}
Comments
30 pages