Greedy bases are best for \(m\)-term approximation (Q1039885)

The main result of the paper is Theorem 1 studying greedy bases. More precisely, let \(X\) be a Banach space and let \(B\) be a greedy and Riesz basis (or greedy and Bessel basis) which satisfies the \(\Delta_2\) condition: \[ \sum_{k=1}^n 2^k l_{2^k}^{-1} \leq A 2^n l_{2^n}^{-1} \quad \text{for}\; n\geq 1. \] Suppose that \(K\) is aligned with \(B\) and that \(B'\) is an unconditional basis for \(X\). Theorem~1 shows that there exist absolute constant \(C>0\) and \(\tau\in \mathbb{N}\) such that \[ \sigma_{2^n} (B,K)\leq C \sum_{k=n-\tau}^\infty \sigma_{2^k}(B', K) \quad \text{for}\quad n\in \mathbb{N},\;n\geq \tau. \]