Skip to main content
Log in

Asymptotic Greediness of the Haar System in the Spaces \(L_p[0,1]\), \(1<p<\infty \)

  • Published:
Constructive Approximation Aims and scope

Abstract

Our aim in this paper is to attain a sharp asymptotic estimate for the greedy constant \(C_{g}[\mathcal {H}^{(p)},L_p]\) of the (normalized) Haar system \(\mathcal {H}^{(p)}\) in \(L_{p}[0,1]\) for \(1<p<\infty \). We will show that the super-democracy constant of \(\mathcal {H}^{(p)}\) in \(L_{p}[0,1]\) grows as \(p^{*}=\max \{p,p/(p-1)\}\) as \(p^*\) goes to \(\infty \). Thus, since the unconditionality constant of \(\mathcal {H}^{(p)}\) in \(L_{p}[0,1]\) is \(p^*-1\), the well-known general estimates for the greedy constant of a greedy basis obtained from the intrinsic features of greediness (namely, democracy and unconditionality) yield that \(p^{*}\lesssim C_{g}[\mathcal {H}^{(p)},L_p]\lesssim (p^{*})^{2}\). Going further, we develop techniques that allow us to close the gap between those two bounds, establishing that, in fact, \(C_{g}[\mathcal {H}^{(p)},L_p]\approx p^{*}\). Our work answers a question that was raised by Hytonen  (2015).

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  MATH  Google Scholar 

  2. Albiac, F., Kalton, N.J.: Topics in Banach Space Theory. Graduate Texts in Mathematics, vol. 233, 2nd edn, p. xx+508. Springer, New York (2016)

    Book  MATH  Google Scholar 

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

    Article  MathSciNet  MATH  Google Scholar 

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

    Article  MathSciNet  MATH  Google Scholar 

  5. Burkholder, D.: A proof of Pelczyński’s conjecture for the Haar system. Stud. Math. 91(1), 79–83 (1988)

    Article  MATH  Google Scholar 

  6. 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 

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

    Article  MathSciNet  MATH  Google Scholar 

  8. Garrigós, G., Hernández, E., Oikhberg, T.: Lebesgue-type inequalities for quasi-greedy bases. Constr. Approx. 38(3), 447–470 (2013)

    Article  MathSciNet  MATH  Google Scholar 

  9. Hytonen, T.: Question posed during the Conference Banach Spaces and their Applications in Analysis, held at the CIRM (Luminy, France) from 12–16 January, 2015

  10. 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 

  11. Temlyakov, V.N.: The best \(m\)-term approximation and greedy algorithms. Adv. Comput. Math. 8(3), 249–265 (1998)

    Article  MathSciNet  MATH  Google Scholar 

  12. Temlyakov, V.N.: Greedy approximation. Acta Numer. 17, 235–409 (2008)

    Article  MathSciNet  MATH  Google Scholar 

Download references

Acknowledgements

F. Albiac and J. L. Ansorena acknowledge the support of the grant MTM2014-53009-P (MINECO, Spain). F. Albiac was also supported by the Grant MTM2016-76808-P (MINECO, Spain). P. M. Berná was supported by a Ph.D. fellowship from the program FPI-UAM, as well as the Grants MTM-2016-76566-P (MINECO, Spain) and 19368/PI/14 (Fundación Séneca, Región de Murcia, Spain).

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Fernando Albiac.

Additional information

Communicated by Vladimir N. Temlyakov.

Publisher's Note

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

Appendix: Summary of the Most Commonly Employed Constants

Appendix: Summary of the Most Commonly Employed Constants

Symbol

Name of constant

Ref. equation

\(C_{a}\)

Symmetry for largest coeffs. constant

(1.10)

\(C_{{g}}\)

Greedy constant

(1.3)

\(\Delta \)

Democracy constant

(1.7)

\(\Delta _{{b}}\)

Bi-democracy constant

(1.13)

\(\Delta _{{d}}\)

Disjoint-democracy constant

(1.7)

\(\Delta _{{s}}\)

Superdemocracy constant

(1.9)

\(\Delta _{{sb}}\)

Super bi-democratic constant

(2.2)

\(\Delta _{{sd}}\)

Disjoint-superdemocracy constant

(1.9)

\(K_{{su}}\)

Suppression unconditional constant

(1.4)

\(K_{{u}}\)

Lattice unconditional constant

(1.5)

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. & Berná, P.M. Asymptotic Greediness of the Haar System in the Spaces \(L_p[0,1]\), \(1<p<\infty \). Constr Approx 51, 427–440 (2020). https://doi.org/10.1007/s00365-019-09466-1

Download citation

  • Received:

  • Revised:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s00365-019-09466-1

Keywords

Mathematics Subject Classification

Navigation