Maximal inequalities, frames and greedy algorithms
Preprint
Abstract
The aim of this article is to use Banach lattice techniques to study coordinate systems in function spaces. We begin by proving that the greedy algorithm of a basis is order convergent if and only if a certain maximal inequality is satisfied. We then show that absolute frames need not admit a reconstruction algorithm with respect to the usual order convergence, but do allow for reconstruction with respect to the order convergence inherited from the double dual. After this, we investigate the extent to which such coordinate systems affect the geometry of the underlying function space. Most notably, we prove that a Banach lattice $X$ is lattice isomorphic to a closed sublattice of a $C(K)$-space if and only if every unconditional sequence in $X$ is absolute.
Keywords
All Related Versions
This publication has 39 references indexed in Scilit:
- Regular Operators between Banach Lattices2007
- Characterization ofL p (R n ) using Gabor framesJournal of Fourier Analysis and Applications, 2001
- Greedy Algorithm for General Biorthogonal SystemsJournal of Approximation Theory, 2000
- On the Almost Everywhere Convergence of Wavelet Summation MethodsApplied and Computational Harmonic Analysis, 1996
- A generalization of Birkhoff's pointwise ergodic theoremActa Mathematica, 1994
- Krivine's theorem and the indices of a Banach latticeActa Applicandae Mathematicae, 1992
- Some characterizations of AM- and AL-spacesMathematische Zeitschrift, 1975
- On subspaces of quotients of (ΣG n ) lp and (ΣG n ) coIsrael Journal of Mathematics, 1972
- An inequality of Paley and convergence a.e. of Walsh-Fourier seriesArkiv för Matematik, 1969
- Maximal inequalities as necessary conditions for almost everywhere convergenceProbability Theory and Related Fields, 1964