Embeddings of Decomposition Spaces
Authors: Voigtlaender Felix 
Published: June 2023

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

D

(

Q

,

L
p

,
Y
)

\mathcal {D}(\mathcal {Q}, L^p, Y)

is determined by a covering

Q

=
(

Q
i

)

i
∈
I

\mathcal {Q} = (Q_i)_{i \in I}

of the frequency domain, an integrability exponent

p
p

, and a sequence space

Y
⊂

C

I

{Y \subset \mathbb {C}^I}

. Given these ingredients, the decomposition space norm of a distribution

g
g

is defined as
<mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" alttext="double-vertical-bar g double-vertical-bar Subscript script upper D left-parenthesis script upper Q comma upper L Sub Superscript p Subscript comma upper Y right-parenthesis Baseline equals double-vertical-bar left-parenthesis double-vertical-bar script upper F Superscript negative 1 Baseline left-parenthesis phi Subscript i Baseline dot ModifyingAbove g With caret right-parenthesis double-vertical-bar Subscript upper L Sub Superscript p Subscript Baseline right-parenthesis Subscript i element-of upper I Baseline double-vertical-bar Subscript upper Y Baseline comma">

‖
g
‖

D

(

Q

,

L
p

,
Y
)

=

‖

(

‖

F

−
1

(

φ

i

⋅

g
^

)

‖

L

p

)

i
∈
I

‖

Y

,

{ \left \Vert g \right \Vert _{\mathcal {D}(\mathcal {Q}, L^p, Y)} = \left \Vert \left ( \left \Vert \mathcal {F}^{-1} \left ( \varphi _{i} \cdot \widehat {g} \right ) \right \Vert _{L^{p}} \right )_{i \in I} \right \Vert _{Y} } ,

where

(

φ
i

)

i
∈
I

(\varphi _i)_{i \in I}

is a suitable partition of unity for

Q

\mathcal {Q}

.

We establish readily verifiable criteria which ensure the existence of a continuous inclusion (“an embedding”)
<mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" alttext="script upper D left-parenthesis script upper Q comma upper L Superscript p 1 Baseline comma upper Y right-parenthesis right-arrow with hook script upper D left-parenthesis script upper P comma upper L Superscript p 2 Baseline comma upper Z right-parenthesis">

D

(

Q

,

L

p
1

,
Y
)
↪

D

(

P

,

L

p
2

,
Z
)

\mathcal {D}(\mathcal {Q},L^{p_1},Y) \hookrightarrow \mathcal {D}(\mathcal {P},L^{p_2},Z)

, mostly concentrating on the case where

Y
=

ℓ

w

q

1

(
I
)

Y = \ell _{w}^{q_{1}} ( I )

and

Z
=

ℓ

v

q

2

(
J
)

Z = \ell _{v}^{q_{2}} (J)

. Under suitable assumptions on

Q

,

P

\mathcal {Q}, \mathcal {P}

, we will see that the relevant sufficient conditions are

p

1

≤

p

2

p_{1} \leq p_{2}

and finiteness of a nested norm of the form
\[
<mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" alttext="double-vertical-bar left-parenthesis double-vertical-bar left-parenthesis alpha Subscript i Baseline beta Subscript j Baseline dot v Subscript j Baseline slash w Subscript i Baseline right-parenthesis Subscript i element-of upper I Sub Subscript j Subscript Baseline double-vertical-bar Subscript script l Sub Superscript t Subscript Baseline right-parenthesis Subscript j element-of upper J Baseline double-vertical-bar Subscript script l Sub Superscript s Subscript Baseline comma with upper I Subscript j Baseline equals StartSet i element-of upper I colon upper Q Subscript i Baseline intersection upper P Subscript j Baseline not-equals empty-set EndSet for j element-of upper J period">

‖

(

‖

(

α

i

β

j

⋅

v

j

/

w

i

)

i
∈

I

j

‖

ℓ

t

)

j
∈
J

‖

ℓ

s

,

with

I

j

=

{
i
∈
I

:

Q

i

∩

P

j

≠
∅
}

for 
j
∈
J

.

\left \Vert \left ( \left \Vert \left ( \alpha _{i} \beta _{j} \cdot v_{j} / w_{i} \right )_{ i \in I_{j}} \right \Vert _{\ell ^{t}} \right )_{j\in J} \right \Vert _{\ell ^{s}} \, , \quad \text {with} \quad I_{j} = \left \{ i \in I \,:\, Q_{i} \cap P_{j} \neq \varnothing \right \} \quad \text {for } j \in J \,.

\]
Like the sets

I
j

I_j

, the exponents

t
,
s

t, s

and the weights

α
,
β

\alpha , \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

p
1

,

p
2

p_1, p_2

, our criteria yield a complete characterization for the existence of the embedding. The same holds for arbitrary values of

p
1

,

p
2

p_1, p_2

under more strict assumptions on the coverings.

We also prove a rigidity result, namely that—for

(

p

1

,

q

1

)
≠
(
2
,
2
)

(p_{1}, q_{1}) \neq (2, 2)

—two decomposition spaces

D

(

Q

,

L

p
1

,

ℓ
w

q
1

)

\mathcal {D}(\mathcal {Q}, L^{p_1}, \ell _w^{q_1})

and

D

(

P

,

L

p
2

,

ℓ
v

q
2

)

\mathcal {D}(\mathcal {P}, L^{p_2}, \ell _v^{q_2})

can only coincide if their “ingredients” are equivalent, that is, if

p

1

=

p

2

p_{1} = p_{2}

and

q

1

=

q

2

q_{1} = q_{2}

and if the coverings

Q

,

P

\mathcal {Q}, \mathcal {P}

and the weights

w
,
v

w, v

are equivalent in a suitable sense.

The resulting embedding theory is illustrated by applications to

α
\alpha

-modulation and Besov spaces. All known embedding results for these spaces are special cases of our approach; often, we improve considerably upon the state of the art.