Research reports

Maximal inequalities, frames and greedy algorithms

by P. Berná and D. Freeman and T. Oikhberg and M. Taylor

(Report number 2026-02)

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: Basic sequence, order convergence, greedy algorithm, maximal function, Schauder frame

BibTeX
@Techreport{BFOT26_1157,
  author = {P. Berná and D. Freeman and T. Oikhberg and M. Taylor},
  title = {Maximal inequalities, frames and greedy algorithms},
  institution = {Seminar for Applied Mathematics, ETH Z{\"u}rich},
  number = {2026-02},
  address = {Switzerland},
  url = {https://www.sam.math.ethz.ch/sam_reports/reports_final/reports2026/2026-02.pdf },
  year = {2026}
}

Disclaimer
© Copyright for documents on this server remains with the authors. Copies of these documents made by electronic or mechanical means including information storage and retrieval systems, may only be employed for personal use. The administrators respectfully request that authors inform them when any paper is published to avoid copyright infringement. Note that unauthorised copying of copyright material is illegal and may lead to prosecution. Neither the administrators nor the Seminar for Applied Mathematics (SAM) accept any liability in this respect. The most recent version of a SAM report may differ in formatting and style from published journal version. Do reference the published version if possible (see SAM Publications).

JavaScript has been disabled in your browser