A Functional Characterization of Almost Greedy and Partially Greedy Bases in Banach Spaces

Abstract

In 2003, S. J. Dilworth, N. J. Kalton, D. Kutzarova and V. N. Temlyakov introduced the notion of almost greedy (respectively partially greedy) bases. These bases were characterized in terms of quasi-greediness and democracy (respectively conservativeness). In this paper, we show a new functional characterization of these type of bases in general Banach spaces following the spirit of the characterization of greediness proved in 2017 by P. M. Berná and Ó. Blasco.

Keywords

• greedy algorithm
• nonlinear approximation
• bases
• Banach spaces