Linear versus nonlinear forms of partial unconditionality of bases
Date
Authors
Director
Publisher
Impacto
Abstract
The main results in this paper contribute to bringing to the fore novel underlying connections between the contemporary concepts and methods springing from greedy approximation theory with the well-established techniques of classical Banach spaces. We do that by showing that bounded-oscillation unconditional bases, introduced by Dilworth et al. in 2009 in the setting of their search for extraction principles of subsequences verifying partial forms of unconditionality, are the same as truncation quasi-greedy bases, a new breed of bases that appear naturally in the study of the performance of the thresholding greedy algorithm in Banach spaces. We use this identification to provide examples of bases that exhibit that bounded-oscillation unconditionality is a stronger condition than Elton's near unconditionality. We also take advantage of our arguments to provide examples that allow us to tell apart certain types of bases that verify either debilitated unconditionality conditions or weaker forms of quasi-greediness in the context of abstract approximation theory.
Description
Keywords
Department
Faculty/School
Degree
Doctorate program
item.page.cita
item.page.rights
© 2024 The Author(s). Published by Elsevier Inc. This is an open access article under the CC BY license
Los documentos de Academica-e están protegidos por derechos de autor con todos los derechos reservados, a no ser que se indique lo contrario.