Embeddings and Lebesgue-type inequalities for the greedy algorithm in Banach spaces (Q1615982)

Let \(X\) be a separable Banach space (over \(\mathbb{K}=\mathbb{R}\) or \(\mathbb{C}\}\)) with dual \(X^*\) and \(\{e_n,e^*_n\}_{n=1}^\infty\) a biorthogonal system in \(X\times X^*\). One supposes that the system \(\{e_n,e^*_n\}_{n=1}^\infty\) is semi-normalized, i.e., there exist \(\alpha,\beta>0\) such that \(\alpha\leq \|e_n\|,\|e_n^*\|\leq \beta,\, \forall n\in\mathbb{N}\), and complete, i.e., the span of \(\{e_n\}_{n=1}^\infty\) is dense in \(X\). The \(N\)-term approximation and the expansional \(N\)-term approximation are defined by \[ \sigma_N(x):=\inf\big\{\big\|x-\sum_{n\in A}c_ne_n\big\| : c_n\in\mathbb{K},\, |A|\leq N\big\} \] and \[ \tilde\sigma_N(x):=\inf\big\{\big\|x-\sum_{n\in A}e^*_n(x)e_n\big\| : |A|\leq N\big\}\,, \] respectively. A greedy set of order \(N\) is a set \(A\subset \mathbb{N}\) with \(|A|=N\) and \(\min_{n\in A}|e^*_n(x)|\geq \max_{n\notin A}|e^*_n(x)|\). One denotes this by \(A\in\mathcal{G}(x,N)\). A greedy operator of order \(N\) is defined by \(G_Nx=\sum_{n\in A_x}e^*_n(x)e_n\,,\) for some \(A_x\in \mathcal{G}(x,N)\). One denotes by \(\mathcal{G}_N\) the set of all greedy operators of order \(N\). The smallest number \(L_N\) such that \[ \|x- G_Nx\|\leq L_N\sigma_N(x), \quad\text{for all }\;x\in X\quad\text{and }\;G_N\in\mathcal{G}_N,\leqno(\ast) \] is called the Lebesgue-type constant associated to the greedy algorithm and the inequality \((*)\) a Lebesgue-type inequality. A similar definition is given for \(\tilde L_N\) by replacing \(\sigma_N(x)\) with \(\tilde\sigma_N(x)\). The paper is concerned with evaluations for these Lebesgue-type constants. As the authors write in the abstract: ``The bounds are given only in terms of the upper democracy functions of the basis and its dual. We also show that these estimates are equivalent to embeddings between the given Banach space and certain discrete weighted Lorentz spaces. Finally, the asymptotic optimality of these inequalities is illustrated in various examples of not necessarily quasi-greedy bases.''