Schreier families and \mathcal{F}-(almost) greedy bases

From MaRDI portal
Publication:6415902

arXiv2211.01030MaRDI QIDQ6415902FDOQ6415902


Authors: Kevin Beanland, Hùng Viẹt Chu Edit this on Wikidata


Publication date: 2 November 2022

Abstract: Let mathcalF be a hereditary collection of finite subsets of mathbbN. In this paper, we introduce and characterize mathcalF-(almost) greedy bases. Given such a family mathcalF, a basis (en)n for a Banach space X is called mathcalF-greedy if there is a constant Cgeqslant1 such that for each xinX, minmathbbN, and Gm(x), we have |x - G_m(x)| leqslant C infleft{left|x-sum_{nin A}a_ne_n ight|,:, |A|leqslant m, Ain mathcal{F}, (a_n)subset mathbb{K} ight}. Here Gm(x) is a greedy sum of x of order m, and mathbbK is the scalar field. From the definition, any mathcalF-greedy basis is quasi-greedy and so, the notion of being mathcalF-greedy lies between being greedy and being quasi-greedy. We characterize mathcalF-greedy bases as being mathcalF-unconditional, mathcalF-disjoint democratic, and quasi-greedy, thus generalizing the well-known characterization of greedy bases by Konyagin and Temlyakov. We also prove a similar characterization for mathcalF-almost greedy bases. Furthermore, we provide several examples of bases that are nontrivially mathcalF-greedy. For a countable ordinal alpha, we consider the case mathcalF=mathcalSalpha, where mathcalSalpha is the Schreier family of order alpha. We show that for each alpha, there is a basis that is mathcalSalpha-greedy but is not mathcalSalpha+1-greedy. In other words, we prove that none of the following implications can be reversed: for two countable ordinals , mbox{quasi-greedy} Longleftarrow mathcal{S}_alphambox{-greedy} Longleftarrow mathcal{S}_�etambox{-greedy} Longleftarrow mbox{greedy}.













This page was built for publication: Schreier families and $\mathcal{F}$-(almost) greedy bases

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6415902)