A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2018; you can also visit the original URL.
The file type is application/pdf
.
General Haar systems and greedy approximation
2001
Studia Mathematica
We show that each general Haar system is permutatively equivalent in L p ([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 L p ([0, 1]), 1 < p < ∞. In addition, we give an example of a general Haar system whose tensor products are greedy bases in each L p ([0, 1] d ), 1 < p < ∞, d ∈ N. This is in contrast to [11] , where it has been shown that the tensor products of the dyadic Haar system are not
doi:10.4064/sm145-2-5
fatcat:iu4ygwxghjdsrcxsmrz4pm7ryy