Skip to main content
Log in

Characterization of Weight-Semi-greedy Bases

  • Published:
Journal of Fourier Analysis and Applications Aims and scope Submit manuscript

Abstract

One classical result in greedy approximation theory is that almost-greedy and semi-greedy bases are equivalent in the context of Schauder bases in Banach spaces with finite cotype. This result was proved by Dilworth et al. (Studia Math 159:67–101, 2003) and, recently, in the study of Berná (J Math Anal Appl 470:218–225, 2019), the author proved that the condition of finite cotype can be removed. One of the results in this paper is to show that the condition of Schauder can be relaxed using the \(\rho \)-admissibility, notion introduced in the study of Berná et al. (Rev Mat Complut; https://doi.org/10.1007/s13163-019-00328-9). On the other hand, in the study of Dilworth et al. (Tr Mat Inst Steklova 303: 120–141, 2018), the authors extend the notion of semi-greediness to the context of weights and proved the following: if w is a weight and \(\mathscr {B}\) is a Schauder basis in a Banach space \(\mathbb X\) with finite cotype, then w-semi-greediness and w-almost-greediness are equivalent notions. Here, we prove the same characterization but removing the condition of finite cotype. Also, we give some results improving the behavior of some constants in the relation between w-greedy-type bases and some w-democracy properties.

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.

Similar content being viewed by others

References

  1. Albiac, F., Ansorena, J.L.: Characterization of 1-almost greedy bases. Rev. Mat. Complut. 30(1), 13–24 (2017)

    Article  MathSciNet  Google Scholar 

  2. Berná, P.M.: Equivalence of almost-greedy and semi-greedy bases. J. Math. Anal. Appl. 470, 218–225 (2019)

    Article  MathSciNet  Google Scholar 

  3. Berná, P.M., Blasco, Ó., Garrigós, G.: Lebesgue inequalities for greedy algorithm in general bases. Rev. Mat. Complut. 30, 369–392 (2017)

    Article  MathSciNet  Google Scholar 

  4. Berná, P. M., Blasco, Ó., Garrigós, G., Hernández, E., Oikhberg, T.: The Lebesgue-type parameter for the Chebyshev Thresholding Greedy Algorithm. Rev. Mat. Complut. https://doi.org/10.1007/s13163-019-00328-9

  5. Berná, P.M., Dilworth, S.J., Kutzarova, D., Oikhberg, T., Wallis, B.: The weighted Property (A) and the greedy algorithm. J. Approx. Theory 248, 105300 (2019)

    Article  MathSciNet  Google Scholar 

  6. Cohen, A., DeVore, R.A., Hochmuth, R.: Restricted nonlinear approximation. Constr. Approx. 16, 85–113 (2000)

    Article  MathSciNet  Google Scholar 

  7. Dilworth, S.J., Kalton, N.J., Kutzarova, D.: On the existence of almost greedy bases in Banach spaces. Studia Math. 159, 67–101 (2003)

    Article  MathSciNet  Google Scholar 

  8. 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  Google Scholar 

  9. Dilworth, S.J., Kutzarova, D., Oikhberg, T.: Lebesgue constants for the weak greedy algorithm. Rev. Mat. Complut. 28(2), 393–409 (2015)

    Article  MathSciNet  Google Scholar 

  10. Dilworth, S.J., Kutzarova, D., Temlyakov, V.N.: Convergence of some greedy algorithms in Banach spaces. J. Fourier Anal. Appl. 8(5), 489–505 (2002)

    Article  MathSciNet  Google Scholar 

  11. Dilworth, S.J., Kutzarova, D., Temlyakov, V.N., Wallis, B.: Weight-almost greedy bases. Tr. Mat. Inst. Steklova 303, 120–141 (2018)

    MathSciNet  MATH  Google Scholar 

  12. Kerkyacharian, G., Picard, D., Temlyakov, V.N.: Some inequalities for the tensor product of greedy bases and weight-greedy bases. East J. Approx. 12, 103–118 (2006)

    MathSciNet  Google Scholar 

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

    MathSciNet  MATH  Google Scholar 

  14. Oikhberg, T.: Greedy algorithms with gaps. J. Approx. Theory 255, 176–190 (2018)

    Article  MathSciNet  Google Scholar 

  15. Temlyakov, V.N.: Greedy Approximation. Cambridge University Press, Cambridge (2011)

    Book  Google Scholar 

  16. Temlyakov, V.N.: Sparse Approximation with Bases, Advanced Courses in Mathematics. CRM Barcelona. Birkhäuser, Basel (2015)

    Google Scholar 

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

    Article  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Pablo Manuel Berná.

Additional information

Communicated by Massimo Fornasier.

Publisher's Note

Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.

The author was supported by a PhD fellowship of the program “Ayudas para contratos predoctorales para la formación de doctores 2017” (MINECO, Spain) and the Grants MTM-2016-76566-P (MINECO, Spain) and 20906/PI/18 (Fundación Séneca, Región de Murcia, Spain)

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Berná, P.M. Characterization of Weight-Semi-greedy Bases. J Fourier Anal Appl 26, 21 (2020). https://doi.org/10.1007/s00041-020-09727-9

Download citation

  • Received:

  • Published:

  • DOI: https://doi.org/10.1007/s00041-020-09727-9

Keywords

Mathematics Subject Classification

Navigation