Weak weight-semi-greedy Markushevich bases

The main purpose of this paper is to study weight-semi-greedy Markushevich bases, and in particular, find conditions under which such bases are weight-almost greedy. In this context, we prove that, for a large class of weights, the two notions are equivalent. We also show that all weight semi-greedy bases are truncation quasi-greedy and weight-superdemocratic. In all of the above cases, we also bring to the context of weights the weak greedy and Chebyshev greedy algorithms—which are frequently studied in the literature on greedy approximation. In the course of our work, a new property arises naturally and its relation with squeeze symmetric and bidemocratic bases is given. In addition, we study some parameters involving the weak thresholding and Chebyshevian greedy algorithms. Finally, we give examples of conditional bases with some of the weighted greedy-type conditions we study.