Renormings and symmetry properties of 1-greedy bases (Q719346): Difference between revisions

Let \(X\) be a Banach space and \((e_{i})\) be a (Schauder) basis of \(X.\) If \(x\in X,\) \(x=\sum_{i=1}^{\infty}x_{i}e_{i}\), one fixes a permutation \(\rho\) of \(\mathbb{N}\) such that \(|x_{\rho_{(1)}}| \geq|x_{\rho_{(2)}}| \geq\dots\). The \(m\)-th greedy approximant to \(x\) is defined by \(\mathcal{G}_{m}(x)=\sum_{i=1}^{m}x_{\rho(i)}e_{\rho(i)}\). The best \(m\)-term approximation of \(x\) is defined by \[ \mathcal{\sigma}_{m}(x)=\inf\left\{ \left\| x-\sum_{i\in A}a_{i} e_{i}\right\| :A\subset\mathbb{N},\;\left| A\right| \leq m,(a_{i})_{i\in A}\subset\mathbb{R}\right\}. \] The basis \((e_{i})\) is called a \(C\)-greedy basis for \(X\) if there exists \(C>0\) (\(C\)-greedy) such that \(\|x-\mathcal{G}_{m} (x)\| \leq C\sigma_{m}(x)\) for all \(x\in X\) and \(m\in\mathbb{N}\). In this paper, the authors continue the study of 1-greedy bases, initiated by \textit{F. Albiac} and \textit{P. Wojtaszczyk} [J. Approximation Theory 138, No. 1, 65--86 (2006; Zbl 1087.65048)], solving some open problems posed by Albiac and Wojtaszczyk, concerning symmetry properties of 1-greedy bases and improving the greedy constant by renorming. The results obtained by the authors are the following. {\parindent=6mm \begin{itemize}\item[1.] There is a Banach space with a normalized basis which is 1-greedy and not symmetric. \item[2.] There is a norm on \(C_{00}\oplus C_{00}\) equivalent to the norm \(\|\;\|_{\ell_{2}}+\| \;\|_{\ell_{2,1}}\) with respect to which the unit vector basis is 1-greedy and non-subsymmetric. \item[3.] There is no renorming of the dyadic Hardy space \(H_{1}\) which makes its natural basis 1-greedy. There is no renorming of the Tsirelson space \(T\) for which there is a 1-greedy normalized basis of \(T\). \item[4.] For any \(1<p<\infty\), there is a renorming of \(L_{p}[0,1]\) such that the Haar basis is 1-unconditional and 1-bidemocratic. \item[5.] There exists a 1-unconditional, 1-democratic basis which is not \(C\)-greedy for any \(C<2.\) \item[6.] There is a renorming of the Lorentz space \(\ell_{2,1}\) such that the unit vector basis is 1-greedy, 2-unconditional but not \((2-\varepsilon)\)-unconditional for any \(\varepsilon>0.\) \end{itemize}} Some corollaries of these results are obtained.