Characterization of 1-almost greedy bases

DOI10.1007/S13163-016-0204-3MaRDI QIDQ506412zbMATH OpenOpenAlexFDO

Authors F. Albiac, J. L. Ansorena

Publication date 31 January 2017

Published in Revista Matemática Complutense (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1506.03397

zbMATH Keywords

almost greedy basisproperty (A)quasi-greedy basisthresholding greedy algorithmunconditional basis

Mathematics Subject Classification ID

Abstract approximation theory (approximation in normed linear spaces and other abstract spaces) (41A65) Summability and bases; functional analytic aspects of frames in Banach and Hilbert spaces (46B15)

Abstract: This article closes the cycle of characterizations of greedy-like bases in the isometric case initiated in [F. Albiac and P. Wojtaszczyk, Characterization of $1$-greedy bases, J. Approx. Theory 138 (2006)] with the characterization of $1$-greedy bases and continued in [F. Albiac and J. L. Ansorena, Characterization of $1$-quasi-greedy bases, arXiv:1504.04368v1 [math.FA] (2015)] 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 (semi-normalized) 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 characterization of almost greedy bases.

Recommendations

• Characterization of 1-quasi-greedy bases
• Characterization of 1-greedy bases
• Characterizations of almost greedy and partially greedy bases
• Characterization of greedy bases in Banach spaces
• On the existence of almost greedy bases in Banach spaces

Cites work

• A remark on greedy approximation in Banach spaces.
• Characterization of 1-greedy bases
• Characterization of 1-quasi-greedy bases
• Greedy algorithm for general biorthogonal systems
• Renorming spaces with greedy bases
• The thresholding greedy algorithm, greedy bases, and duality

Cited in

(37)

• Lebesgue inequalities for the greedy algorithm in general bases
• Building highly conditional almost greedy and quasi-greedy bases in Banach spaces
• Conditional quasi-greedy bases in non-superreflexive Banach spaces
• Strong partially greedy bases and Lebesgue-type inequalities
• Variations of property (A) constants and Lebesgue-type inequalities for the weak thresholding greedy algorithms
• Asymptotic greediness of the Haar system in the spaces \(L_p[0,1]\), \(1<p<\infty \)
• Lebesgue inequalities for Chebyshev thresholding greedy algorithms
• Weight-partially greedy bases and weight-property \((A)\)
• Characterization of weight-semi-greedy bases
• Smooth approximations without critical points of continuous mappings between Banach spaces, and diffeomorphic extractions of sets
• The weighted property (A) and the greedy algorithm
• Weak greedy algorithms and the equivalence between semi-greedy and almost greedy Markushevich bases
• Extensions and new characterizations of some greedy-type bases
• Performance of the thresholding greedy algorithm with larger greedy sums
• Characterizations of almost greedy and partially greedy bases
• An example of an almost greedy basis in \(L^1(0,1)\)
• On the existence of almost greedy bases in Banach spaces
• Greedy approximation for biorthogonal systems in quasi-Banach spaces
• New parameters and Lebesgue-type estimates in greedy approximation
• Characterization of greedy bases in Banach spaces
• Elton's near unconditionality of bases as a threshold-free form of greediness
• Counterexamples in isometric theory of symmetric and greedy bases
• Linear versus nonlinear forms of partial unconditionality of bases
• Schreier families and \(\mathcal{F}\)-(almost) greedy bases
• On consecutive greedy and other greedy-like type of bases
• The best m-term approximation with respect to polynomials with constant coefficients
• Weak weight-semi-greedy Markushevich bases
• Greedy algorithms: a review and open problems
• On sequential greedy-type bases
• Twenty-five years of greedy bases
• Strong partially greedy bases with respect to an arbitrary sequence
• Enlarge greedy sums in greedy-type properties by different factors
• On greedy types frame systems
• Conditional bases with Property (A)
• Characterization of 1-greedy bases
• Lebesgue constants for Chebyshev thresholding greedy algorithms
• Characterization of 1-quasi-greedy bases

This page was built for publication: Characterization of 1-almost greedy bases

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q506412)