E-raamat: Embeddings of Decomposition Spaces

"Many smoothness spaces in harmonic analysis are decomposition spaces. In this paper we ask: Given two such spaces, is there an embedding between the two? A decomposition space [ equation] is determined by a covering [ equation] of the frequency domain, anintegrability exponent p, and a sequence space [ equation]. Given these ingredients, the decomposition space norm of a distribution g is defined as [ equation] is a suitable partition of unity for Q. We establish readily verifiable criteria which ensure the existence of a continuous inclusion ("an embedding") [ equation], mostly concentrating on the case where [ equation]. Under suitable assumptions on Q, P, we will see that the relevant sufficient conditions are [ equation] and finiteness of a nested norm ofthe form [ equation]. Like the sets Ij, the exponents t, s and the weights [ omega], [ beta] only depend on the quantities used to define the decomposition spaces. In a nutshell, in order to apply the embedding results presented in this article, no knowledge of Fourier analysis is required; instead, one only has to study the geometric properties of the involved coverings, so that one can decide the finiteness of certain sequence space norms defined in terms of the coverings. These sufficient criteria are quite sharp: For almost arbitrary coverings and certain ranges of p1, p2, our criteria yield a complete characterization for the existence of the embedding. The same holds for arbitrary values of p1, p2 under more strict assumptions on the coverings. We also prove a rigidity result, namely that--[ equation]--two decomposition spaces [ equation] and [ equation] can only coincide if their "ingredients" are equivalent, that is, if [ equation] and [ equation] and if the coverings Q,P and the weights w, v are equivalent in a suitable sense. The resulting embedding theory is illustrated by applications to [ omega]-modulation and Besov spaces. All known embedding results for these spaces are special cases of our approach; often, we improve considerably upon the state ofthe art"--