General Haar systems and greedy approximation
Anna Kamont
Studia Mathematica, Tome 147 (2001), p. 165-184 / Harvested from The Polish Digital Mathematics Library

We show that each general Haar system is permutatively equivalent in Lp([0,1]), 1 < p < ∞, to a subsequence of the classical (i.e. dyadic) Haar system. As a consequence, each general Haar system is a greedy basis in Lp([0,1]), 1 < p < ∞. In addition, we give an example of a general Haar system whose tensor products are greedy bases in each Lp([0,1]d), 1 < p < ∞, d ∈ ℕ. This is in contrast to [11], where it has been shown that the tensor products of the dyadic Haar system are not greedy bases in Lp([0,1]d) for 1 < p < ∞, p ≠ 2 and d ≥ 2. We also note that the above-mentioned general Haar system is not permutatively equivalent to the whole dyadic Haar system in any Lp([0,1]), 1 < p < ∞, p ≠ 2.

Publié le : 2001-01-01
EUDML-ID : urn:eudml:doc:285259
@article{bwmeta1.element.bwnjournal-article-doi-10_4064-sm145-2-5,
     author = {Anna Kamont},
     title = {General Haar systems and greedy approximation},
     journal = {Studia Mathematica},
     volume = {147},
     year = {2001},
     pages = {165-184},
     zbl = {0980.41017},
     language = {en},
     url = {http://dml.mathdoc.fr/item/bwmeta1.element.bwnjournal-article-doi-10_4064-sm145-2-5}
}
Anna Kamont. General Haar systems and greedy approximation. Studia Mathematica, Tome 147 (2001) pp. 165-184. http://gdmltest.u-ga.fr/item/bwmeta1.element.bwnjournal-article-doi-10_4064-sm145-2-5/