The Thresholding Greedy Algorithm versus Approximations with Sizes Bounded by Certain Functions $f$

TL;DR

This paper introduces and characterizes $f$-greedy and $f$-almost greedy bases in Banach spaces, revealing their relations and equivalences for functions in a large class, with examples illustrating the theory.

Contribution

It defines and analyzes $f$-greedy and $f$-almost greedy bases, establishing their equivalence for non-identity functions and exploring their relationships across different functions.

Findings

$f$-greedy and $f$-almost greedy bases are characterized and related.

For non-identity $f$, $f$-greedy and $f$-almost greedy bases are equivalent.

Examples demonstrate the applicability of the theoretical results.

Abstract

Let $X$ be a Banach space and $(e_n)_{n=1}^\infty$ be a basis. For a function $f$ in a large collection $\mathcal{F}$ (closed under composition), we define and characterize $f$-greedy and $f$-almost greedy bases. We study relations among these bases as $f$ varies and show that while a basis is not almost greedy, it can be $f$-greedy for some $f\in \mathcal{F}$. Furthermore, we prove that for all non-identity function $f\in \mathcal{F}$, we have the surprising equivalence $$f\mbox{-greedy}\ \Longleftrightarrow \ f\mbox{-almost greedy}.$$ We give various examples of Banach spaces to illustrate our results.