The thresholding greedy algorithm, greedy bases, and duality (Q1423645)

Let \(X\) be a Banach space with a normalized basis \((e_n)\) and biorthogonal functionals \((e_n^*)\) and let \(x\in X\). Order the nonzero scalars \(e_n^*(x)\) by decreasing the modulus (if \(| e_n^*(x)| =| e_m^*(x)| \) and \(n<m\), then \(e_n^*(x)\) precedes \(e_m^*(x)\)). Denote this order by \(\rho\). The \(n\)-th greedy approximation is given by \(G_n(x)=\sum_{k=1}^n e_{\rho(k)}^*(x)e_{\rho(k)}\). This approximation provides a theoretical model for the thresholding procedure that is used in image compression and other applications [see \textit{S.~V. Konyagin} and \textit{V.~N. Temlyakov}, East J. Approx. 5, 365--379 (1999; Zbl 1084.46509)]. The basis \((e_n)\) is greedy if there exists \(C\) such that for all \(x\in X\) and \(n\in \mathbb{N}\) we have \(\| x-G_n(x)\| \leq C\inf \| x-\sum_{x\in A}\alpha_ke_k\| \), where the infimum is taken over all sets of cardinality \(| A| =n\) and all scalars \((\alpha_k)\). \textit{P. Wojtaszczyk} [J. Approx. Theory 107, 293--314 (2000; Zbl 0974.65053)] proved that \(G_n(x)\to x\) for every \(x\) iff there exists \(C\) such that \(\| G_n(x)\| \leq C\| x\| \) for all \(x\). A basis with this property is called quasi-greedy. In the paper under review, two natural intermediate conditions are introduced and investigated: \((e_n)\) is almost greedy if \(\| x-G_n(x)\| \leq C\inf\{\| x-\sum_{k\in A}e_k^*(x)e_k\| :\;| A| =n\}\) and partially greedy if \(\| x-G_n(x)\| \leq C\| \sum_{n+1}^{\infty} e_k^*(x)e_k\| \). The authors investigate the duality of these conditions. In particular, they show that if \((e_n)\) is a greedy basis of a Banach space \(X\) with nontrivial Rademacher type, then \((e_n^*)\) is a greedy basis for \(X^*\). Examples are presented which show that if \(X\) has trivial type, then \((e_n^*)\) need not be a greedy basic sequence. It is proved that \((e_n)\) and \((e_n^*)\) are both almost greedy if and only if they are both partially greedy, along with some other results.