Existence of almost greedy bases in mixed-norm sequence and matrix spaces, including besov spaces

We prove that the sequence spaces lp ⊕ lq and the spaces of infinite matrices lp(lq ), lq l(p) and ( ∞ n=1 n lp)lq , which are isomorphic to certain Besov spaces, have an almost greedy basis whenever 0 < p < 1 < q < ∞. More precisely, we custom-build almost greedy bases i...

Descripción completa

Detalles Bibliográficos
Autores: Albiac Alesanco, Fernando José, Ansorena, José L., Bello, Glenier, Wojtaszczyk, Przemyslaw
Tipo de recurso: artículo
Estado:Versión publicada
Fecha de publicación:2023
País:España
Institución:Universidad San Jorge (USJ)
Repositorio:Academica-e. Repositorio Institucional de la Universidad Pública de Navarra
OAI Identifier:oai:academica-e.unavarra.es:2454/46667
Acceso en línea:https://hdl.handle.net/2454/46667
Access Level:acceso abierto
Palabra clave:Almost greedy basis
Conditional basis
Quasi-greedy basis
Subsymmetric basis
Thresholding greedy algorithm
lp-Spaces
Descripción
Sumario:We prove that the sequence spaces lp ⊕ lq and the spaces of infinite matrices lp(lq ), lq l(p) and ( ∞ n=1 n lp)lq , which are isomorphic to certain Besov spaces, have an almost greedy basis whenever 0 < p < 1 < q < ∞. More precisely, we custom-build almost greedy bases in such a way that the Lebesgue parameters grow in a prescribed manner. Our arguments critically depend on the extension of the Dilworth–Kalton– Kutzarova method from Dilworth et al. (Stud Math 159(1):67–101, 2003), which was originally designed for constructing almost greedy bases in Banach spaces, to make it valid for direct sums of mixed-normed spaces with nonlocally convex components. Additionally, we prove that the fundamental functions of all almost greedy bases of these spaces grow as (ml/q )∞ m=l.