Abstract
We obtain Lebesgue-type inequalities for the greedy algorithm for arbitrary complete seminormalized biorthogonal systems in Banach spaces. 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.
Similar content being viewed by others
Notes
Slightly more elaborate computations actually lead to \(d(N)=N+1\).
Slightly more elaborate computations, using the definition of \({\mathbf {y}}_n\) in (8.6), actually give \(d^*_{c_0}(N)=1\), and also \(D^*_{c_0}(N)=\log _2(N+1)\) if \(N+1=2^n\).
We thank an anonymous referee for pointing out this fact.
References
Albiac, F., Ansorena, J.L.: Lorentz spaces and embeddings induced by almosts greedy bases in Banach spaces. Constr. Approx. 43, 197–215 (2016)
Berná, P.M., Blasco, O., Garrigós, G.: Lebesgue inequalities for greedy algorithm in general bases. Rev. Mat. Complut. 30, 369–392 (2017)
Bednorz, W.: Greedy type bases in Banach spaces. In: Book Bednorz, W. (ed.) Advances in Greedy Algorithms, pp. 325–356. I-Tech, Vienna (2008). Open Access Database: www.intechweb.org
Benett, C., Sharpley, R.C.: Interpolation of Operators. Academic Press, London (1988)
Carro, M.J., Raposo, J., Soria, J.: Recent developments in the theory of Lorentz spaces and weighted inequalities. Memoirs of the American Mathematical Society (2007)
Dilworth, S.J., Kalton, N.J., Kutzarova, D.: On the existence of almost greedy bases in Banach spaces. Studia Math. 159(1), 67–101 (2003)
Dilworth, S.J., Kalton, N.J., Kutzarova, D., Temlyakov, V.N.: The thresholding greedy algorithm, greedy bases, and duality. Constr. Approx. 19, 575–597 (2003)
Dilworth, S.J., Kutzarova, D., Oikhberg, T.: Lebesgue constants for the weak greedy algorithm. Rev. Matem. Compl. 28(2), 393–409 (2015)
Dilworth, S.J., Soto-Bajo, M., Temlyakov, V.N.: Quasi-greedy bases and Lebesgue-type inequalities. Studia Math. 211, 41–69 (2012)
Dilworth, S.J., Mitra, D.: A conditional quasi-greedy basis of \(\ell ^1\). Studia Math. 144, 95–100 (2001)
Fabian, M., Habala, P., Hajek, P., Montesinos Santalucía, V., Pelant, J., Zizler, V.: Functional Analysis and Infinite-Dimensional Geometry. Springer, New York (2001)
Garrigós, G., Hernández, E., Oikhberg, T.: Lebesgue-type inequalities for quasi-greedy bases. Constr. Approx. 38(3), 447–470 (2013)
Garrigós, G., Hernández, E., de Natividade, M.: Democracy functions and optimal embeddings for approximation spaces. Adv. Comput. Math. 37(2), 255–283 (2012)
Gribonval, R., Nielsen, M.: Some remarks on non-linear approximation with Schauder bases. East. J. Approx. 7(2), 1–19 (2001)
Hajek, P., Montesinos-Santalucía, V., Vanderwerff, J., Zizler, V.: Biorthogonal Systems in Banach Spaces. Springer, New York (2008)
Hernández, E.: Lebesgue-type inequalities for quasi-greedy bases (2011). Preprint. ArXiv:1111.0460v2 [matFA]. 16 Nov 2011
Holub, J.R., Retherford, J.R.: Some curious bases for \(c_0\) and \(C[0,1]\). Studia Math. 34, 227–240 (1970)
Konyagin, S.V., Temlyakov, V.N.: A remark on greedy approximation in Banach spaces. East. J. Approx. 5, 365–379 (1999)
Krein, S., Petunin, J., Semenov, E.: Interpolation of Linear Operators, Translations Mathematical Monograph, vol. 55. American Mathematical Society, Providence (1992)
Lindenstrauss, J.: On a certain subspace of \(\ell ^1\). Bull. Acad. Polon. Sci. 12, 539–542 (1964)
Lindenstrauss, J., Tzafriri, L.: Classical Banach spaces, vol. I. Springer, New York (1977)
Oswald, P.: Greedy algorithms and best m-term approximation with respect to biorthogonal systems. J. Fourier Anal. Appl. 7(4), 325–341 (2001)
Singer, I.: Bases in Banach Spaces, vol. I. Springer, New York (1970)
Stein, E.M., Weiss, G.: Introduction to Fourier Analysis on Euclidean spaces. Princeton University Press, Princeton (1971)
Temlyakov, V.N.: Greedy algorithm and n-term trigonometric approximation. Const. Approx. 14, 569–587 (1998)
Temlyakov, V.N.: The best \(m\)-term approximation and greedy algorithms. Adv. Comput. Math. 8, 249–265 (1998)
Temlyakov, V.N.: Nonlinear \(m\)-term approximation with regard to the multivariate Haar system. East J. Approx. 4, 87–106 (1998)
Temlyakov, V.N.: Greedy Approximation. Cambridge University Press, Cambridge (2011)
Temlyakov, V.N.: Sparse Approximation with Bases, Advanced Courses in Mathematics. CRM Barcelona, Birkhäuser, Basel (2015)
Temlyakov, V.N., Yang, M., Ye, P.: Lebesgue-type inequalities for greedy approximation with respect to quasi-greedy bases. East J. Approx 17, 127–138 (2011)
Wojtaszczyk, P.: Greedy algorithm for general biorthogonal systems. J. Approx. Theory 107, 293–314 (2000)
Wojtaszczyk, P.: Greedy Type Bases in Banach Spaces, Constructive Theory of Functions, pp. 136–155. DARBA, Sofia (2003)
Acknowledgements
The research of the first, third and fourth authors is supported by Grants MTM-2013-40495-P and MTM-2016-76566-P (Spain). The research of the second author is supported by Grant MTM-2014-53009-P (Spain). The research of the first, third, and fourth authors is also partially supported by grant 19368/PI/14 (Fundación Séneca, Región de Murcia, Spain). The last author’s research is partially supported by the Simons Foundation travel award 210060.
Author information
Authors and Affiliations
Corresponding author
Additional information
Communicated by Vladimir N. Temlyakov.
Rights and permissions
About this article
Cite this article
Berná, P.M., Blasco, O., Garrigós, G. et al. Embeddings and Lebesgue-Type Inequalities for the Greedy Algorithm in Banach Spaces. Constr Approx 48, 415–451 (2018). https://doi.org/10.1007/s00365-018-9415-9
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s00365-018-9415-9
Keywords
- Non-linear approximation
- Lebesgue-type inequality
- Greedy algorithm
- Quasi-greedy basis
- Biorthogonal system
- Discrete Lorentz space