Embeddings and Lebesgue-Type Inequalities for the Greedy Algorithm in Banach Spaces

Mathematics - Functional Analysis FOS: Mathematics 0101 mathematics 41A65, 41A46, 41A17, 46B15, 46B45 01 natural sciences Functional Analysis (math.FA)
DOI: 10.1007/s00365-018-9415-9 Publication Date: 2018-01-22T16:34:31Z
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 non necessarily quasi-greedy bases.<br/>30 pages<br/>
SUPPLEMENTAL MATERIAL
Coming soon ....
REFERENCES (32)
CITATIONS (15)
EXTERNAL LINKS
PlumX Metrics
RECOMMENDATIONS
FAIR ASSESSMENT
Coming soon ....
JUPYTER LAB
Coming soon ....