Skip to main content
Log in

Characterization of 1-almost greedy bases

  • Published:
Revista Matemática Complutense Aims and scope Submit manuscript

Abstract

This article closes the cycle of characterizations of greedy-like bases in the “isometric” case initiated in Albiac and Wojtaszczyk (J. Approx. Theory 138(1):65–86, 2006) with the characterization of 1-greedy bases and continued in Albiac and Ansorena (J. Approx. Theory 201:7–12, 2016) with the characterization of 1-quasi-greedy bases. Here we settle the problem of providing a characterization of 1-almost greedy bases in Banach spaces. We show that a basis in a Banach space is almost greedy with almost greedy constant equal to 1 if and only if it has Property (A). This fact permits now to state that a basis is 1-greedy if and only if it is 1-almost greedy and 1-quasi-greedy. As a by-product of our work we also provide a tight estimate of the almost greedy constant of a basis in the non-isometric case.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. Albiac, F., Wojtaszczyk, P.: Characterization of 1-greedy bases. J. Approx. Theory 138(1), 65–86 (2006)

    Article  MathSciNet  MATH  Google Scholar 

  2. Albiac, F., Ansorena, J.L.: Characterization of 1-quasi-greedy bases. J. Approx. Theory 201, 7–12 (2016)

    Article  MathSciNet  MATH  Google Scholar 

  3. Dilworth, S.J., Kutzarova, D., Odell, E., Schlumprecht, T., Zsák, A.: Renorm-ing spaces with greedy bases. J. Approx. Theory 188, 39–56 (2014)

    Article  MATH  Google Scholar 

  4. Dilworth, S.J., Kalton, N.J., Kutzarova, D., Temlyakov, V.N.: The thresholding greedy algorithm, greedy bases, and duality. Constr. Approx. 19(4), 575–597 (2003)

    Article  MathSciNet  MATH  Google Scholar 

  5. Konyagin, S.V., Temlyakov, V.N.: A remark on greedy approximation in Banach spaces. East J. Approx. 5(3), 365–379 (1999)

    MathSciNet  MATH  Google Scholar 

  6. Wojtaszczyk, P.: Greedy algorithm for general biorthogonal systems. J. Approx. Theory 107(2), 293–314 (2000)

    Article  MathSciNet  MATH  Google Scholar 

Download references

Acknowledgments

The authors feel indebted to the anonymous referee of an earlier version of this paper for pointing out to us how to shorten the proof of the Main Theorem.

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to F. Albiac.

Additional information

F. Albiac acknowledges the support of the Spanish Ministry for Economy and Competitivity Grants MTM2012-31286 for Operators, lattices, and structure of Banach spaces, and MTM2014-53009-P for Análisis Vectorial, Multilineal, y Aplicaciones. J.L. Ansorena acknowledges the support of the Spanish Ministry for Economy and Competitivity Grant MTM2014-53009-P for Análisis Vectorial, Multilineal, y Aplicaciones.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Albiac, F., Ansorena, J.L. Characterization of 1-almost greedy bases. Rev Mat Complut 30, 13–24 (2017). https://doi.org/10.1007/s13163-016-0204-3

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s13163-016-0204-3

Keywords

Mathematics Subject Classification

Navigation