Hostname: page-component-74656f9884-8rzl6 Total loading time: 0 Render date: 2026-11-05T18:43:26.362Z Has data issue: false hasContentIssue false

Weak weight-semi-greedy Markushevich bases

Published online by Cambridge University Press:  26 June 2023

Miguel Berasategui
Affiliation:
IMAS–UBA–CONICET - Pab I, Facultad de Cs. Exactas y Naturales, Universidad de Buenos Aires, 1428 Buenos Aires, Argentina (mberasategui@dm.uba.ar)
Silvia Lassalle
Affiliation:
Departamento de Matemática y Ciencias, Universidad de San Andrés, Vito Dumas 284, 1644 Victoria, Buenos Aires, Argentina IMAS–CONICET, Intendente Güiraldes S/N, 1428, Buenos Aires, Argentina (slassalle@udesa.edu.ar)
Rights & Permissions [Opens in a new window]

Abstract

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.

Information

Type
Research Article
Copyright
Copyright © The Author(s), 2023. Published by Cambridge University Press on behalf of The Royal Society of Edinburgh