Weak weight-semi-greedy Markushevich bases
Abstract
We introduce and study the notion of weak weight-semi-greedy Markushevich bases - which extends the concepts of weight semi-greedy and weak semi-greedy Markushevich bases. In particular, we study conditions under which such bases are weight almost greedy. We also define the notion of weak weight almost greedy bases, and prove that this formally weaker concept is equivalent to that concept of weight almost greedy bases. Finally, we study some parameters involving the weak thresholding and Chebyshevian greedy algorithms.
Keywords
Cite
@article{arxiv.2111.00693,
title = {Weak weight-semi-greedy Markushevich bases},
author = {Miguel Berasategui and Silvia Lassalle},
journal= {arXiv preprint arXiv:2111.00693},
year = {2024}
}
Comments
May 20, 2023: Fixed a line in the proof of Proposition 3.24. September 29, 2022: Added a missing condition in the statement of Example 7.3; fixed some typos, and made general style improvements; November 1, 2022 styleim provements April 7, 2023: The proof of Prop. 3.24 was modified so that only finitely supported vectors are used, so only approximations by projections are needed