1 Introduction
For a function
$\sigma $
on
${{\mathbb R}^n}$
, let
$T_\sigma $
be the corresponding Fourier multiplier operator given by
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20241108010952271-0447:S1474748023000518:S1474748023000518_eqnu1.png?pub-status=live)
for a Schwartz function f on
${{\mathbb R}^n}$
, where
$\widehat {f}(\xi ):=\int _{{{\mathbb R}^n}}f(x)e^{2\pi i\langle x,\xi \rangle }dx$
is the Fourier transform of f. The function
$\sigma $
is called an
$L^p$
multiplier if
$T_\sigma $
is bounded on
$L^p({{\mathbb R}^n})$
for
$1<p<\infty $
. For several decades, figuring out a sharp condition for
$\sigma $
to be an
$L^p$
multiplier has been one of the most interesting problems in harmonic analysis. Although there is no complete answer to this question, we have some satisfactory results. In 1956, Mihlin [Reference Mihlin23] proved that
$\sigma $
is an
$L^p$
multiplier provided that
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20241108010952271-0447:S1474748023000518:S1474748023000518_eqn1.png?pub-status=live)
This result was refined by Hörmander [Reference Hörmander21] who replaced (1.1) by the weaker condition
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20241108010952271-0447:S1474748023000518:S1474748023000518_eqnu2.png?pub-status=live)
where
$L_s^2({{\mathbb R}^n})$
denotes the fractional Sobolev space on
${{\mathbb R}^n}$
and
$\psi $
is a Schwartz function on
${{\mathbb R}^n}$
generating Littlewood–Paley functions, which will be officially defined in Section 2.1. We also remark that
$s>n/2$
is the best possible regularity condition for the
$L^p$
boundedness of
$T_{\sigma }$
.
Now, we define the (real) Hardy space. Let
$\phi $
be a smooth function on
${{\mathbb R}^n}$
that is supported in
$\{x\in {{\mathbb R}^n}: |x|\le 1\}$
, and we define
$\phi _l:=2^{ln}\phi (2^l\cdot )$
. Then the Hardy space
$H^p({{\mathbb R}^n})$
,
$0<p\le \infty $
, consists of tempered distributions f on
${{\mathbb R}^n}$
such that
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20241108010952271-0447:S1474748023000518:S1474748023000518_eqn2.png?pub-status=live)
is finite. The space provides an extension to
$0<p\le 1$
in the scale of classical
$L^p$
spaces for
$1<p\le \infty $
, which is more natural and useful in many respects than the corresponding
$L^p$
extension. Indeed,
$L^p({{\mathbb R}^n})=H^p({{\mathbb R}^n})$
for
$1<p\le \infty $
and several essential operators, such as singular integrals of Calderón–Zygmund type, that are well-behaved on
$L^p({{\mathbb R}^n})$
only for
$1<p\le \infty $
are also well-behaved on
$H^p({{\mathbb R}^n})$
for
$0<p\le 1$
. Now, let
$\mathscr {S}({{\mathbb R}^n})$
denote the Schwartz space on
${{\mathbb R}^n}$
and
$\mathscr {S}_0({{\mathbb R}^n})$
be its subspace consisting of f satisfying
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20241108010952271-0447:S1474748023000518:S1474748023000518_eqnu3.png?pub-status=live)
Then it turns out that
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20241108010952271-0447:S1474748023000518:S1474748023000518_eqn3.png?pub-status=live)
We remark that
$\mathscr {S}({{\mathbb R}^n})$
is also dense in
$H^p({{\mathbb R}^n})=L^p({{\mathbb R}^n})$
for
$1<p<\infty $
, but not for
$0<p\le 1$
. See [Reference Stein31, Chapter III, §5.2] for more details. Moreover, as mentioned in [Reference Stein31, Chapter III, §5.4], if
$f\in L^1({{\mathbb R}^n})\cap H^p({{\mathbb R}^n})$
for
$0<p\le 1$
, then
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20241108010952271-0447:S1474748023000518:S1474748023000518_eqn4.png?pub-status=live)
We refer to [Reference Burkholder, Gundy and Silverstein2, Reference Calderón3, Reference Fefferman and Stein7, Reference Stein31, Reference Uchiyama33] for more details.
In 1977, Calderón and Torchinsky [Reference Calderón and Torchinsky4] provided a natural extension of the result of Hörmander to the Hardy space
$H^p({{\mathbb R}^n})$
for
$0<p\le 1$
. For the purpose of investigating
$H^p$
estimates for
$0<p\le 1$
, the operator
$T_{\sigma }$
is assumed to initially act on
$\mathscr {S}_0({{\mathbb R}^n})$
and then to admit an
$H^p$
-bounded extension for
$0<p< \infty $
via density, in view of (1.3). Then Calderón and Torchinsky proved
Theorem A [Reference Calderón and Torchinsky4].
Let
$0<p\le 1$
. Suppose that
$s>n/p-n/2$
. Then we have
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20241108010952271-0447:S1474748023000518:S1474748023000518_eqnu4.png?pub-status=live)
for all
$f\in \mathscr {S}_0({{\mathbb R}^n})$
.
For more information about the theory of Fourier multipliers, we also refer the reader to [Reference Baernstein and Sawyer1, Reference Grafakos, He, Honzík and Nguyen13, Reference Grafakos and Park19, Reference Grafakos and Slavíková20, Reference Park25, Reference Seeger28, Reference Seeger29, Reference Seeger and Trebels30] and the references therein.
We now turn our attention to multilinear extensions of the above multiplier results. Let m be a positive integer greater or equal to
$2$
. For a bounded function
$\sigma $
on
$({{\mathbb R}^n})^m$
, let
$T_\sigma $
now denote an m-linear Fourier multiplier operator given by
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20241108010952271-0447:S1474748023000518:S1474748023000518_eqnu5.png?pub-status=live)
for
$f_1,\dots ,f_m\in \mathscr {S}_0({{\mathbb R}^n})$
. The first important result concerning multilinear multipliers was obtained by Coifman and Meyer [Reference Coifman and Meyer5] who proved that if N is sufficiently large and
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20241108010952271-0447:S1474748023000518:S1474748023000518_eqn5.png?pub-status=live)
for all
$|\alpha _1|+\cdots + |\alpha _m|\le N$
, then
$T_{\sigma }$
is bounded from
$L^{p_1}({{\mathbb R}^n})\times \cdots \times L^{p_m}({{\mathbb R}^n})$
into
$L^p({{\mathbb R}^n})$
for
$1<p_1,\dots ,p_m<\infty $
and
$1\le p<\infty $
. This result is a multilinear analogue of Mihlin’s result in which Equation (1.1) is required, but the optimal regularity condition, such as
$|\alpha |\le [n/2]+1$
in Equation (1.1), is not considered in the result of Coifman and Meyer. Afterwards, Tomita [Reference Tomita32] provided a sharp estimate for multilinear multiplier
$T_{\sigma }$
, as a multilinear counterpart of Hörmander’s result. Let
$\Psi ^{(m)}$
be a Schwartz function on
$({{\mathbb R}^n})^m$
having the properties that
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20241108010952271-0447:S1474748023000518:S1474748023000518_eqnu6.png?pub-status=live)
For
$s\geq 0$
, we define the Sobolev norm
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20241108010952271-0447:S1474748023000518:S1474748023000518_eqn6.png?pub-status=live)
Theorem B [Reference Tomita32].
Let
$1<p,p_1,\dots ,p_m<\infty $
with
$1/p=1/p_1+\cdots +1/p_m$
. Suppose that
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20241108010952271-0447:S1474748023000518:S1474748023000518_eqnu7.png?pub-status=live)
for
$s>mn/2$
. Then we have
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20241108010952271-0447:S1474748023000518:S1474748023000518_eqn7.png?pub-status=live)
for
$f_1,\dots ,f_m \in \mathscr {S}_0({{\mathbb R}^n})$
.
The standard Sobolev space
$L_s^2(({{\mathbb R}^n})^m)$
in Equation (1.7) is replaced by a product-type Sobolev space in many recent papers.
Theorem C [Reference Grafakos, Miyachi, Nguyen and Tomita14, Reference Grafakos, Miyachi and Tomita15, Reference Grafakos and Nguyen18, Reference Miyachi and Tomita24].
Let
$0<p_1,\dots ,p_m\leq \infty $
and
$0<p<\infty $
with
$1/p=1/p_1+\dots +1/p_m$
. Suppose that
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20241108010952271-0447:S1474748023000518:S1474748023000518_eqn8.png?pub-status=live)
for any nonempty subsets J of
$ \{1,\dots ,m\}$
, and
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20241108010952271-0447:S1474748023000518:S1474748023000518_eqn9.png?pub-status=live)
Then we have
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20241108010952271-0447:S1474748023000518:S1474748023000518_eqn10.png?pub-status=live)
for
$f_1,\dots ,f_m\in \mathscr {S}_0({{\mathbb R}^n})$
.
Here, the space
$L_{(s_1,\dots ,s_m)}^{2}(({{\mathbb R}^n})^m)$
indicates the product type Sobolev space on
$({{\mathbb R}^n})^m$
, in which the norm is defined by replacing the term
$(1+4\pi ^2 |\vec {\boldsymbol {\xi }}|^2)^s$
in Equation (1.6) by
$\prod _{j=1}^{m}\big ( 1+4\pi ^2|\xi _j|^2\big )^{s_j}$
. It is known in [Reference Park27] that the condition (1.8) is sharp in the sense that if the condition does not hold, then there exists
$\sigma $
such that the corresponding operator
$T_{\sigma }$
does not satisfy Equation (1.10). We also refer the reader to [Reference Cruze-Uribe and Nguyen6, Reference Fujita and Tomita11] for weighted estimates for multilinear Fourier multipliers.
As an extension of Theorem A to the whole range
$0<p_1,\dots ,p_m\le \infty $
, in the recent paper of the authors, Lee, Heo, Hong, Park and Yang [Reference Lee, Heo, Hong, Lee, Park, Park and Yang22], we provide a multilinear multiplier theorem with standard Sobolev space conditions.
Theorem D [Reference Lee, Heo, Hong, Lee, Park, Park and Yang22].
Let
$0<p_1, \cdots , p_m \le \infty $
and
$0<p<\infty $
with
$1/p=1/p_1+\cdots +1/p_m$
. Suppose that
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20241108010952271-0447:S1474748023000518:S1474748023000518_eqn11.png?pub-status=live)
for any subsets J of
$\{1,\dots ,m\}$
, and
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20241108010952271-0447:S1474748023000518:S1474748023000518_eqn12.png?pub-status=live)
Then we have
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20241108010952271-0447:S1474748023000518:S1474748023000518_eqn13.png?pub-status=live)
for
$f_1,\dots ,f_m\in \mathscr {S}_0({{\mathbb R}^n})$
.
The optimality of the condition (1.11) was achieved by Grafakos, He and Hónzik [Reference Grafakos, He and Honzík12] who proved that if Equation (1.13) holds, then we must necessarily have
$s\ge mn/2$
and
$1/p-1/2\le s/n+\sum _{j\in J}\big (1/p-1/2\big )$
for all subsets J of
$\{1,\dots ,m\}$
.
We remark that in the bilinear case
$m=2$
, Theorem D follows from Theorem C as Equation (1.11) implies the existence of
$s_1$
and
$s_2$
, with
$s_1+s_2=s$
, satisfying Equation (1.8). This is well described in the first proof of Theorem D in [Reference Lee, Heo, Hong, Lee, Park, Park and Yang22]. However, when
$m\ge 3$
, this inclusion is not evident even if similar types of regularity conditions are required in both theorems.
Unlike the estimate in Theorem A, the multilinear extensions in Theorems C and D consider the Lebesgue space
$L^p$
as a target space when
$p\le 1$
(recall that
$L^p=H^p$
for
$1<p<\infty $
).
If a function
$\sigma $
on
$({{\mathbb R}^n})^m$
satisfies Equation (1.9) for
$s_1,\dots ,s_m>n/2$
or (1.12) for
$s>mn/2$
, then Theorems C and D imply that
$T_{\sigma }(f_1,\dots ,f_m)\in L^1$
for all
$f_1,\dots ,f_m\in \mathscr {S}_0({{\mathbb R}^n})$
. Therefore, in order for
$T_{\sigma }(f_1,\dots ,f_m)$
to belong to
$H^p({{\mathbb R}^n})$
for
$0<p\le 1$
, it should be necessary that
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20241108010952271-0447:S1474748023000518:S1474748023000518_eqn14.png?pub-status=live)
in view of Equation (1.4). However, this property is generally not guaranteed, even if all the functions
$f_1,\dots ,f_m$
satisfy the moment conditions, in the multilinear setting, while, in the linear case,
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20241108010952271-0447:S1474748023000518:S1474748023000518_eqnu8.png?pub-status=live)
for
$N\ge 0$
. Recently, by imposing additional cancellation conditions corresponding to (1.14), Grafakos, Nakamura, Nguyen and Sawano [Reference Grafakos, Nakamura, Nguyen and Sawano16, Reference Grafakos, Nakamura, Nguyen and Sawano17] obtain a mapping property into Hardy spaces for
$T_{\sigma }$
.
Theorem E [Reference Grafakos, Nakamura, Nguyen and Sawano16, Reference Grafakos, Nakamura, Nguyen and Sawano17].
Let
$0<p_1, \cdots , p_m \le \infty $
and
$0<p\le 1$
with
$1/p=1/p_1+\cdots +1/p_m$
. Let N be sufficiently large and
$\sigma $
satisfy Equation (1.5) for all multi-indices
$|\alpha _1|+\dots +|\alpha _m|\le N$
. Suppose that
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20241108010952271-0447:S1474748023000518:S1474748023000518_eqnu9.png?pub-status=live)
for all multi-indices
$|\alpha |\le \frac {n}{p}-n$
, where
$a_j$
’s are
$(p_j,\infty )$
-atoms. Then we have
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20241108010952271-0447:S1474748023000518:S1474748023000518_eqn15.png?pub-status=live)
for
$f_1,\dots ,f_m\in \mathscr {S}_0({{\mathbb R}^n})$
.
Here, the
$(p,\infty )$
-atom is similar, but more generalized concept than
$H^{p}$
-atoms defined in Section 2, and we adopt the convention that
$(\infty ,\infty )$
-atom a simply means
$a\in L^{\infty }({{\mathbb R}^n})$
with no cancellation condition. See [Reference Grafakos, Nakamura, Nguyen and Sawano16, Reference Grafakos, Nakamura, Nguyen and Sawano17] for the definition and properties of the
$(p,\infty )$
-atom.
We remark that Theorem E successfully shows the boundedness into
$H^p({{\mathbb R}^n})$
, but the optimal regularity conditions considered in Theorems C and D are not pursued at all as it requires sufficiently large N.
The aim of this paper is to establish the boundedness into
$H^p$
for trilinear multiplier operators, analogous to Equation (1.15), with the same regularity conditions as in Theorem D, which is significantly more difficult in general. Unfortunately, we do not obtain the desired results for general m-linear operators for
$m\ge 4$
and we will discuss some obstacles for this generalization in the appendix.
To state our main result, let us write
$\Psi :=\Psi ^{(3)}$
and in what follows, we will use the notation
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20241108010952271-0447:S1474748023000518:S1474748023000518_eqnu10.png?pub-status=live)
for a function
$\sigma $
on
$({{\mathbb R}^n})^3$
. Let
$0<p\le 1$
, and we will consider trilinear multipliers
$\sigma $
satisfying
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20241108010952271-0447:S1474748023000518:S1474748023000518_eqn16.png?pub-status=live)
for all
$f_1,f_2,f_3\in \mathscr {S}_0({{\mathbb R}^n})$
. Then the main result is as follows:
Theorem 1. Let
$0<p_1,p_2,p_3<\infty $
and
$0<p\le 1$
with
$1/p=1/p_1+1/p_2+1/p_3$
. Suppose that
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20241108010952271-0447:S1474748023000518:S1474748023000518_eqn17.png?pub-status=live)
where J is an arbitrary subset of
$\{1,2,3\}$
. Let
$\sigma $
be a function on
$({{\mathbb R}^n})^3$
satisfying
$\mathcal {L}_s^2[\sigma ]<\infty $
and the vanishing moment condition (1.16). Then we have
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20241108010952271-0447:S1474748023000518:S1474748023000518_eqn18.png?pub-status=live)
for
$f_1,f_2,f_3\in \mathscr {S}_0({{\mathbb R}^n})$
.
We remark that
$(1/p_1,1/p_2,1/p_3)$
in Theorem 1 is contained in one of the following sets:
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20241108010952271-0447:S1474748023000518:S1474748023000518_eqnu11.png?pub-status=live)
See Figure 1 for the regions
$\mathscr {R}_{{\mathrm {i}}}$
. Then the condition (1.17) becomes
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20241108010952271-0447:S1474748023000518:S1474748023000518_eqn19.png?pub-status=live)
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20241108010952271-0447:S1474748023000518:S1474748023000518_fig1.png?pub-status=live)
Figure 1 The regions
$\mathscr {R}_{{\mathrm {i}}}$
,
$0\le {\mathrm {i}}\le 7$
.
In the proof of Theorem 1, we will mainly focus on the case
$(1/p_1,1/p_2,1/p_3)\in \mathscr {R}_{{\mathrm {i}}}$
,
${\mathrm {i}}=1,2,3$
, in which
$s>n/p_{{\mathrm {i}}}+n/2$
is required. Then the remaining cases follow from interpolation methods. More precisely, via interpolation,
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20241108010952271-0447:S1474748023000518:S1474748023000518_eqnu12.png?pub-status=live)
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20241108010952271-0447:S1474748023000518:S1474748023000518_eqnu13.png?pub-status=live)
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20241108010952271-0447:S1474748023000518:S1474748023000518_eqnu14.png?pub-status=live)
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20241108010952271-0447:S1474748023000518:S1474748023000518_eqnu15.png?pub-status=live)
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20241108010952271-0447:S1474748023000518:S1474748023000518_eqnu16.png?pub-status=live)
where the case
$1/p_1+1/p_2+1/p_3=1$
for
$(1/p_1,1/p_2,1/p_3)\in \mathscr {R}_0$
will be treated separately. Here, a complex interpolation method will be applied, but the regularity condition on s will be fixed. Moreover, the index p will be also fixed so that the vanishing moment condition (1.16) will not be damaged in the process of the interpolation. For example, when
$(1/p_1,1/p_2,1/p_3)\in \mathscr {R}_4$
, we set
$s>n/p_1+n/p_2$
and fix the index p with
$1/p=1/p_1+1/p_2+1/p_3$
. We also fix
$\sigma $
satisfying the vanishing moment condition (1.16). Now, we choose
$(1/p_1^0,1/p_2^0,1/p_3)\in R_1$
and
$(1/p_1^1,1/p_2^1,1/p_3)\in \mathscr {R}_2$
so that
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20241108010952271-0447:S1474748023000518:S1474748023000518_eqnu17.png?pub-status=live)
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20241108010952271-0447:S1474748023000518:S1474748023000518_eqnu18.png?pub-status=live)
Then the two estimates
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20241108010952271-0447:S1474748023000518:S1474748023000518_eqnu19.png?pub-status=live)
imply
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20241108010952271-0447:S1474748023000518:S1474748023000518_eqnu20.png?pub-status=live)
The detailed arguments concerning the interpolation (for all the cases) will be provided in Section 3.
The estimates for
$(1/p_1,1/p_2,1/p_3)\in \mathscr {R}_{{\mathrm {i}}}$
,
${\mathrm {i}}=1,2,3$
, will be restated in Proposition 3.1 below, and they will be proved throughout three sections (Sections 5–7). Since one of
$p_j$
’s is less or equal to
$1$
, we benefit from the atomic decomposition for the Hardy space. Moreover, for other indices greater than 2, we employ the techniques of (variant)
$\varphi $
-transform, introduced by Frazier and Jawerth [Reference Frazier and Jawerth8, Reference Frazier and Jawerth9, Reference Frazier and Jawerth10] and Park [Reference Park26], which will be presented in Section 2. Then
$T_{\sigma }(f_1,f_2,f_3)$
can be decomposed in the form
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20241108010952271-0447:S1474748023000518:S1474748023000518_eqnu21.png?pub-status=live)
where
$\mathrm {K}$
is a finite set, and then we will actually prove that each
$T^{\kappa }(f_1,f_2,f_3)$
satisfies the estimate
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20241108010952271-0447:S1474748023000518:S1474748023000518_eqn20.png?pub-status=live)
where
$\Vert u_{{\mathrm {i}}}\Vert _{L^{p_{{\mathrm {i}}}}({{\mathbb R}^n})}\lesssim \Vert f_{{\mathrm {i}}}\Vert _{H^{p_{{\mathrm {i}}}}({{\mathbb R}^n})}$
for
${\mathrm {i}}=1,2,3$
. Since the above estimate separates the left-hand side into three functions of x, we may apply Hölder’s inequality with exponents
$1/p=1/p_1+1/p_2+1/p_3$
to obtain, in view of Equation (1.2),
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20241108010952271-0447:S1474748023000518:S1474748023000518_eqnu22.png?pub-status=live)
Such pointwise estimates (1.20) will be described in several lemmas in Sections 6 and 7, and the proofs will be given in Section 9 separately, which is one of the keys in this paper.
Notation
For a cube Q in
${{\mathbb R}^n}$
let
${\mathbf {x}}_Q$
be the lower left corner of Q and
$\ell (Q)$
be the side-length of Q. We denote by
$Q^*$
,
$Q^{**}$
and
$Q^{***}$
the concentric dilates of Q with
$\ell (Q^*)=10\sqrt {n}\ell (Q)$
,
$\ell (Q^{**})=\big (10\sqrt {n} \big )^2\ell (Q)$
and
$\ell (Q^{***})=\big (10\sqrt {n} \big )^3\ell (Q)$
. Let
$\mathcal {D}$
stand for the family of all dyadic cubes in
${{\mathbb R}^n}$
and
$\mathcal {D}_j$
be the subset of
$\mathcal {D}$
consisting of dyadic cubes of side-length
$2^{-j}$
. For each
${\mathbf {x}}\in {{\mathbb R}^n}$
and
$l\in {\mathbb {Z}}$
, let
$B_{{\mathbf {x}}}^l:=B({\mathbf {x}},100n2^{-l})$
be the ball of radius
$100n2^{-l}$
and center
${\mathbf {x}}$
. We use the notation
$\langle \cdot \rangle $
to denote both the inner product of functions and
$\langle y\rangle := (1+4\pi ^2|y|^2)^{1/2}$
for
$y\in \mathbb {R}^M$
,
$M\in {\mathbb {N}}$
. That is,
$\langle f, g \rangle =\int _{{{\mathbb R}^n}} f(x) \overline {g(x)}\,dx$
for two functions f and g, and
$\langle x_1\rangle :=(1+4\pi ^2|x_1|^2)^{1/2}$
,
$\langle (x_1,x_2)\rangle :=\big (1+4\pi ^2(|x_1|^2+|x_2|^2)\big )^{1/2}$
for
$x_1,x_2\in {{\mathbb R}^n}$
.
2 Preliminaries
2.1 Hardy spaces
Let
$\theta $
be a Schwartz function on
${{\mathbb R}^n}$
such that
$\mbox {supp}(\widehat {\theta })\subset \{\xi \in {{\mathbb R}^n}: |\xi |\le 2\}$
and
$\widehat {\theta }(\xi )=1$
for
$|\xi |\le 1$
. Let
$\psi :=\theta -2^{-n}\theta (2^{-1}\cdot )$
, and for each
$j\in {\mathbb {Z}}$
we define
$\theta _j:=2^{jn}\theta (2^j\cdot )$
and
$\psi _j:=2^{jn}\psi (2^j\cdot )$
. Then
$\{\psi _j\}_{j\in {\mathbb {Z}}}$
forms a Littlewood–Paley partition of unity, satisfying
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20241108010952271-0447:S1474748023000518:S1474748023000518_eqnu23.png?pub-status=live)
We define the convolution operators
${\Gamma }_j$
and
${\Lambda }_j$
by
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20241108010952271-0447:S1474748023000518:S1474748023000518_eqnu24.png?pub-status=live)
The Hardy space
$H^p({{\mathbb R}^n})$
can be characterized with the (quasi-)norm equivalences
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20241108010952271-0447:S1474748023000518:S1474748023000518_eqn21.png?pub-status=live)
and
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20241108010952271-0447:S1474748023000518:S1474748023000518_eqn22.png?pub-status=live)
which is the Littlewood–Paley theory for Hardy spaces. In addition, when
$p\le 1$
, every
$f\in H^p({{\mathbb R}^n})$
can be decomposed as
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20241108010952271-0447:S1474748023000518:S1474748023000518_eqn23.png?pub-status=live)
where
$a_k$
’s are
$H^p$
-atoms having the properties that
$\mbox {supp}(a_k)\subset Q_k$
,
$\Vert a_k\Vert _{L^{\infty }({{\mathbb R}^n})}\le |Q_k|^{-1/p}$
for some cube
$Q_k$
,
$\int x^{\gamma }a_k(x)dx=0$
for all multi-indices
$|\gamma |\le M$
, and
$\big ( \sum _{k=1}^{\infty }|\lambda _k|^p\big )^{1/p}\lesssim \Vert f\Vert _{H^p({{\mathbb R}^n})},$
where M is a fixed integer satisfying
$M\ge [n/p-n]_+$
, which may be actually arbitrarily large. Furthermore, each
$H^p$
-atom
$a_k$
satisfies
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20241108010952271-0447:S1474748023000518:S1474748023000518_eqnu25.png?pub-status=live)
2.2 Maximal inequalities
Let
$\mathcal {M}$
denote the Hardy–Littlewood maximal operator, defined by
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20241108010952271-0447:S1474748023000518:S1474748023000518_eqnu26.png?pub-status=live)
for a locally integrable function f on
${{\mathbb R}^n}$
, where the supremum ranges over all cubes Q containing x. For given
$0<r<\infty $
, we define
$\mathcal {M}_rf:=\big ( \mathcal {M}\big (|f|^r\big )\big )^{1/r}$
. Then it is well-known that
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20241108010952271-0447:S1474748023000518:S1474748023000518_eqn24.png?pub-status=live)
whenever
$r<p< \infty $
and
$r<q\le \infty $
. We note that for
$1\le r<\infty $
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20241108010952271-0447:S1474748023000518:S1474748023000518_eqn25.png?pub-status=live)
For
${\boldsymbol {m}} \in {{\mathbb Z}^n}$
and any dyadic cubes
$Q\in \mathcal {D}$
, we use the notation
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20241108010952271-0447:S1474748023000518:S1474748023000518_eqnu27.png?pub-status=live)
Then we define the dyadic shifted maximal operator
$\mathcal {M}_{dyad}^{ {\boldsymbol {m}}}$
by
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20241108010952271-0447:S1474748023000518:S1474748023000518_eqnu28.png?pub-status=live)
where the supremum is taken over all dyadic cubes Q containing x. It is clear that
$\mathcal {M}_{dyad}^{\mathbf {0}}f(x)\le \mathcal {M}f(x)$
and accordingly,
$\mathcal {M}_{dyad}^{\mathbf {0}}$
is bounded on
$L^p$
for
$p>1$
. In general, the following maximal inequality holds: For
$1<p<\infty $
and
${\boldsymbol {m}}\in {{\mathbb Z}^n}$
we have
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20241108010952271-0447:S1474748023000518:S1474748023000518_eqn26.png?pub-status=live)
The inequality (2.6) follows from the repeated use of the inequality in one-dimensional setting that appears in [Reference Stein31, Chapter II, §5.10], and we omit the detailed proof here. Refer to [Reference Lee, Heo, Hong, Lee, Park, Park and Yang22, Appendix] for the argument.
2.3 Variants of
$\varphi $
-transform
For a sequence of complex numbers
${\boldsymbol {b}}:=\{b_Q\}_{Q\in \mathcal {D}}$
, we define
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20241108010952271-0447:S1474748023000518:S1474748023000518_eqnu29.png?pub-status=live)
for
$0<p<\infty $
, where
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20241108010952271-0447:S1474748023000518:S1474748023000518_eqnu30.png?pub-status=live)
Let
$\widetilde {\psi _j}:=\psi _{j-1}+\psi _j+\psi _{j+1}$
for
$j\in {\mathbb {Z}}$
. Observe that
$\widetilde {\psi _j}$
enjoys the properties that
$\mbox {supp}(\widehat {\widetilde {\psi }})\subset \{\xi \in {{\mathbb R}^n}: 2^{j-2}\le |\xi |\le 2^{j+2}\}$
and
$\psi _j=\psi _j\ast \widetilde {\psi _j}$
. Then we have the representation
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20241108010952271-0447:S1474748023000518:S1474748023000518_eqn27.png?pub-status=live)
where
$\psi ^Q(x):=|Q|^{{1}/{2}}\psi _j(x-{\mathbf {x}}_Q)$
,
$\widetilde {\psi }^Q(x):=|Q|^{{1}/{2}}\widetilde {\psi _j}(x-{\mathbf {x}}_Q)$
for each
$Q\in \mathcal {D}_j$
, and
$b_Q=\langle f,\widetilde {\psi }^Q\rangle $
. This implies that
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20241108010952271-0447:S1474748023000518:S1474748023000518_eqnu31.png?pub-status=live)
where
$\mathcal {S}'/\mathcal {P}$
stands for a tempered distribution modulo polynomials. Moreover, in this case, we have
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20241108010952271-0447:S1474748023000518:S1474748023000518_eqn28.png?pub-status=live)
Therefore, the Hardy space
$H^p({{\mathbb R}^n})$
can be characterized by the discrete function space
$\dot {f}^{p,2}$
, in view of the equivalence in Equation (2.2). We refer to [Reference Frazier and Jawerth8, Reference Frazier and Jawerth9, Reference Frazier and Jawerth10] for more details.
It is also known in [Reference Park26] that
${\Gamma }_jf$
has a representation analogous to (2.7) with an equivalence similar to (2.8), while
$f\not = \sum _{j\in {\mathbb {Z}}}{\Gamma }_jf$
generally. Let
$\widetilde {\theta }:=2^n\theta (2\cdot )$
and
$\widetilde {\theta _j}:=2^{jn}\widetilde {\theta }(2^j\cdot )=\theta _{j+1}$
so that
$\theta _j=\theta _j\ast \widetilde {\theta _{j}}$
. Let
$\theta ^Q(x):=|Q|^{{1}/{2}}\theta _j(x-{\mathbf {x}}_Q)$
,
$\widetilde {\theta }^Q(x):=|Q|^{{1}/{2}}\widetilde {\theta _{j}}(x-{\mathbf {x}}_Q)$
, and
$b_Q=\langle f,\widetilde {\theta }^Q\rangle $
for each
$Q\in \mathcal {D}_j$
. Then we have
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20241108010952271-0447:S1474748023000518:S1474748023000518_eqn29.png?pub-status=live)
and for
$0<p<\infty $
and
$0<q\le \infty $
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20241108010952271-0447:S1474748023000518:S1474748023000518_eqn30.png?pub-status=live)
We refer to [Reference Park26, Lemma 3.1] for more details.
3 Proof of Theorem 1: reduction and interpolation
The proof of Theorem 1 can be obtained by interpolating the estimates in the following propositions.
Proposition 3.1. Let
$0<p_1,p_2,p_3< \infty $
and
$0<p< 1$
with
$1/p=1/p_1+1/p_2+1/p_3$
. Suppose that
$(1/p_1,1/p_2,1/p_3)\in \mathscr {R}_{1}\cup \mathscr {R}_2\cup \mathscr {R}_3$
and
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20241108010952271-0447:S1474748023000518:S1474748023000518_eqnu32.png?pub-status=live)
Let
$\sigma $
be a function on
$({{\mathbb R}^n})^3$
satisfying
$\mathcal {L}_s^2[\sigma ]<\infty $
and the vanishing moment condition (1.16). Then we have
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20241108010952271-0447:S1474748023000518:S1474748023000518_eqnu33.png?pub-status=live)
for
$f_1,f_2,f_3\in \mathscr {S}_0({{\mathbb R}^n})$
.
Proposition 3.2. Let
$0<p\le 1$
. Suppose that one of
$p_1,p_2,p_3$
is equal to p and the other two are infinity. Suppose that
$s>n/p+n/2$
. Let
$\sigma $
be a function on
$({{\mathbb R}^n})^3$
satisfying
$\mathcal {L}_s^2[\sigma ]<\infty $
and the vanishing moment condition (1.16). Then we have
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20241108010952271-0447:S1474748023000518:S1474748023000518_eqnu34.png?pub-status=live)
for
$f_1,f_2,f_3\in \mathscr {S}_0({{\mathbb R}^n})$
.
We present the proof of Proposition 3.1 in Sections 5, 6 and 7 and that of Proposition 3.2 in Section 8. For now, we proceed with the following interpolation argument, simply assuming the above propositions hold.
Lemma 3.1. Let
$0<p_1^0, p_2^0, p_3^0\le \infty $
,
$0<p_1^1, p_2^1, p_3^1\le \infty $
and
$0<p^0,p^1<\infty $
. Suppose that
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20241108010952271-0447:S1474748023000518:S1474748023000518_eqnu35.png?pub-status=live)
Then for any
$0<\theta <1$
,
$0<p_1,p_2,p_3\le \infty $
and
$0<p<\infty $
satisfying
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20241108010952271-0447:S1474748023000518:S1474748023000518_eqnu36.png?pub-status=live)
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20241108010952271-0447:S1474748023000518:S1474748023000518_eqnu37.png?pub-status=live)
we have
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20241108010952271-0447:S1474748023000518:S1474748023000518_eqnu38.png?pub-status=live)
The proof of the lemma is essentially same as that of [Reference Lee, Heo, Hong, Lee, Park, Park and Yang22, Lemma 2.4], so it is omitted here.
3.1 Proof of Equation (1.18) when
$(1/p_1,1/p_2,1/p_3)\in \mathscr {R}_4\cup \mathscr {R}_5\cup \mathscr {R}_6$
We need to work only with
$(1/p_1,1/p_2,1/p_3)\in \mathscr {R}_4$
since the other cases are just symmetric versions. In this case,
$2<p_3<\infty $
and as mentioned in Equation (1.19), the condition (1.17) is equivalent to
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20241108010952271-0447:S1474748023000518:S1474748023000518_eqnu39.png?pub-status=live)
Now, choose
$\widetilde {p_1},\widetilde {p_2}<1$
such that
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20241108010952271-0447:S1474748023000518:S1474748023000518_eqnu40.png?pub-status=live)
and thus
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20241108010952271-0447:S1474748023000518:S1474748023000518_eqnu41.png?pub-status=live)
Let
$\epsilon _1, \epsilon _2>0$
be numbers with
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20241108010952271-0447:S1474748023000518:S1474748023000518_eqnu42.png?pub-status=live)
and select
$q_1,q_2>2$
such that
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20241108010952271-0447:S1474748023000518:S1474748023000518_eqnu43.png?pub-status=live)
Then we observe that
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20241108010952271-0447:S1474748023000518:S1474748023000518_eqnu44.png?pub-status=live)
for some
$0<\theta <1$
. Let
$C_1:=(1/(\widetilde {p_1}-\epsilon _1),1/q_1,1/p_3)$
and
$C_2:=(1/q_2,1/(\widetilde {p_2}-\epsilon _2),1/p_3)$
. It is obvious that
$C_1\in \mathscr {R}_1$
,
$C_2\in \mathscr {R}_2$
, and thus it follows from Proposition 3.1 that
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20241108010952271-0447:S1474748023000518:S1474748023000518_eqnu45.png?pub-status=live)
Finally, the assertion (1.18) for
$(1/p_1,1/p_2,1/p_3)\in \mathscr {R}_4$
is derived by means of interpolation in Lemma 3.1. See Figure 2 for the interpolation.
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20241108010952271-0447:S1474748023000518:S1474748023000518_fig2.png?pub-status=live)
Figure 2
$(1-\theta )\big (\frac {1}{\widetilde {p_1}-\epsilon _1},\frac {1}{q_1},\frac {1}{p_3} \big )+\theta \big ( \frac {1}{q_2},\frac {1}{\widetilde {p_2}-\epsilon _2},\frac {1}{p_3}\big )=(\frac {1}{p_1},\frac {1}{p_2},\frac {1}{p_3})\in \mathscr {R}_4$
.
3.2 Proof of Equation (1.18) when
$(1/p_1,1/p_2,1/p_3)\in \mathscr {R}_0$
We first fix
$1/2<p<1$
such that
$1/p_1+1/p_2+1/p_3=1/p$
and assume that, in view of Equation (1.19),
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20241108010952271-0447:S1474748023000518:S1474748023000518_eqnu46.png?pub-status=live)
Then we choose
$2<p_0<\infty $
such that
$1+1/2+1/p_0=1/p$
. Then it is clear that
$(1/p_1,1/p_2,1/p_3)$
is located inside the hexagon with the vertices
$(1,1/p_0,1/2)$
,
$(1,1/2,1/p_0)$
,
$(1/2,1,1/p_0)$
,
$(1/p_0,1,1/2)$
,
$(1/p_0,1/2,1)$
and
$(1/2,1/p_0,1)$
. Now, we choose a sufficiently small
$\epsilon>0$
and
$2<\widetilde {p_0}<\infty $
such that
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20241108010952271-0447:S1474748023000518:S1474748023000518_eqnu47.png?pub-status=live)
and the point
$(1/p_1,1/p_2,1/p_3)$
is still inside the smaller hexagon with
$D_1:=(1,1/\widetilde {p_0},1/(2+\epsilon ))$
,
$D_2:=(1,1/(2+\epsilon ),1/\widetilde {p_0})$
,
$D_3:=(1/(2+\epsilon ),1,1/\widetilde {p_0})$
,
$D_4:=(1/\widetilde {p_0},1,1/ (2+\epsilon ))$
,
$D_5:=(1/\widetilde {p_0},1/(2+\epsilon ),1)$
, and
$D_6:=(1/(2+\epsilon ),1/\widetilde {p_0},1)$
. Now, Proposition 3.1 deduces that
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20241108010952271-0447:S1474748023000518:S1474748023000518_eqnu48.png?pub-status=live)
for
$(1/q_1,1/q_2,1/q_3)\in \{D_1,D_2,D_3,D_4,D_5,D_6 \}$
, as
$D_1,D_2\in \mathscr {R}_1$
,
$D_3,D_4\in \mathscr {R}_2$
and
$D_5,D_6\in \mathscr {R}_3$
. This implies, via interpolation in Lemma 3.1,
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20241108010952271-0447:S1474748023000518:S1474748023000518_eqnu49.png?pub-status=live)
See Figure 3 for the interpolation.
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20241108010952271-0447:S1474748023000518:S1474748023000518_fig3.png?pub-status=live)
Figure 3
$\big (\frac {1}{p_1},\frac {1}{p_2},\frac {1}{p_3}\big )\in \mathscr {R}_0$
.
For the case
$p=1$
, we interpolate the estimates in Proposition 3.2. To be specific, for any given
$0<p_1,p_2,p_3<\infty $
with
$1/p_1+1/p_2+1/p_3=1$
, the estimate (1.18) with
$p=1$
follows from interpolating
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20241108010952271-0447:S1474748023000518:S1474748023000518_eqnu50.png?pub-status=live)
3.3 Proof of Equation (1.18) when
$(1/p_1,1/p_2,1/p_3)\in \mathscr {R}_7$
Let
$0<p\le 1/2$
be such that
$1/p=1/p_1+1/p_2+1/p_3$
, and assume that
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20241108010952271-0447:S1474748023000518:S1474748023000518_eqnu51.png?pub-status=live)
We choose
$0<p_0\le 1$
, satisfying
$1/p_0+1=1/p$
, so that
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20241108010952271-0447:S1474748023000518:S1474748023000518_eqnu52.png?pub-status=live)
Then there exist
$\epsilon>0$
and
$2<q<\infty $
so that
$s>n/(p_0-\epsilon )+n/2$
and
$1/p=1/(p_0-\epsilon )+2/q$
. Let
$E_1:=\big (1/(p_0-\epsilon ),1/q,1/q\big )$
,
$E_2:=\big (1/q,1/(p_0-\epsilon ),1/q\big )$
, and
$E_3:=\big (1/q,1/q,1/(p_0-\epsilon )\big )$
. Then it is immediately verified that
$E_1\in \mathscr {R}_1$
,
$E_2\in \mathscr {R}_2$
,
$E_3\in \mathscr {R}_3$
, and
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20241108010952271-0447:S1474748023000518:S1474748023000518_eqnu53.png?pub-status=live)
for some
$0<\theta _1,\theta _2,\theta _3<1$
with
$\theta _1+\theta _2+\theta _3=1$
. Therefore, Proposition 3.1 yields that
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20241108010952271-0447:S1474748023000518:S1474748023000518_eqnu54.png?pub-status=live)
and using the interpolation method in Lemma 3.1, we conclude the estimate (1.18) holds for
$(1/p_1,1/p_2,1/p_3)\in \mathscr {R}_7$
. See Figure 4 for the interpolation.
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20241108010952271-0447:S1474748023000518:S1474748023000518_fig4.png?pub-status=live)
Figure 4
$\theta _1\big (\frac {1}{p_0-\epsilon },\frac {1}{q},\frac {1}{q}\big )+\theta _2\big (\frac {1}{q},\frac {1}{p_0-\epsilon },\frac {1}{q}\big )+\theta _3\big (\frac {1}{q},\frac {1}{q},\frac {1}{p_0-\epsilon }\big )=\big (\frac {1}{p_1},\frac {1}{p_2},\frac {1}{p_3}\big )\in \mathscr {R}_7$
.
4 Auxiliary lemmas
This section is devoted to providing several technical results which will be repeatedly used in the proof of Propositions 3.1 and 3.2.
Lemma 4.1. Let
$N\in \mathbb {N}$
and
$a\in \mathbb {R}^n$
. Suppose that a Schwartz function f, defined on
${{\mathbb R}^n}$
, satisfies
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20241108010952271-0447:S1474748023000518:S1474748023000518_eqn31.png?pub-status=live)
Then for any
$0\leq \epsilon \leq 1$
, there exists a constant
$C_{\epsilon }>0$
such that
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20241108010952271-0447:S1474748023000518:S1474748023000518_eqnu55.png?pub-status=live)
Proof. Using the Taylor theorem for
$\phi _l$
, we write
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20241108010952271-0447:S1474748023000518:S1474748023000518_eqnu56.png?pub-status=live)
Then it follows from the condition (4.1) that
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20241108010952271-0447:S1474748023000518:S1474748023000518_eqnu57.png?pub-status=live)
For
$|\alpha |=N$
, we note that
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20241108010952271-0447:S1474748023000518:S1474748023000518_eqn32.png?pub-status=live)
and
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20241108010952271-0447:S1474748023000518:S1474748023000518_eqn33.png?pub-status=live)
Then by averaging both Equation (4.2) and Equation (4.3), we obtain that
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20241108010952271-0447:S1474748023000518:S1474748023000518_eqnu58.png?pub-status=live)
which completes the proof.
Now, we recall that
$\widetilde {\psi _j}=\psi _{j-1}+\psi _j+\psi _{j+1}$
and
$\widetilde {\theta _j}=2^{n}\theta _j(2\cdot )$
, and then define
$\widetilde {{\Lambda }_j}g:=\widetilde {\psi _j}\ast g$
and
$\widetilde {{\Gamma }_j}g:=\widetilde {\theta _j}\ast g$
.
Lemma 4.2. Let
$2\le q<\infty $
,
$s>{n}/{q}$
, and
$L>n,s$
. Let
$\varphi $
be a function on
${{\mathbb R}^n}$
satisfying
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20241108010952271-0447:S1474748023000518:S1474748023000518_eqnu59.png?pub-status=live)
For
$j\in \mathbb {Z}$
and for each
$Q\in \mathcal {D}_j$
, let
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20241108010952271-0447:S1474748023000518:S1474748023000518_eqnu60.png?pub-status=live)
and for a Schwartz function g on
${{\mathbb R}^n}$
let
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20241108010952271-0447:S1474748023000518:S1474748023000518_eqnu61.png?pub-status=live)
Then we have
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20241108010952271-0447:S1474748023000518:S1474748023000518_eqnu62.png?pub-status=live)
Proof. For
$2\le q<\infty $
, we have
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20241108010952271-0447:S1474748023000518:S1474748023000518_eqnu63.png?pub-status=live)
where Hölder’s inequality is applied if
$2<q<\infty $
. Clearly,
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20241108010952271-0447:S1474748023000518:S1474748023000518_eqnu64.png?pub-status=live)
for sufficiently large
$M>n$
. Therefore, the left-hand side of the claimed estimate is less than a constant times
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20241108010952271-0447:S1474748023000518:S1474748023000518_eqn34.png?pub-status=live)
The
$L^2$
norm is dominated by
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20241108010952271-0447:S1474748023000518:S1474748023000518_eqnu65.png?pub-status=live)
Note that
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20241108010952271-0447:S1474748023000518:S1474748023000518_eqnu66.png?pub-status=live)
and thus the preceding term is controlled by a constant multiple of
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20241108010952271-0447:S1474748023000518:S1474748023000518_eqnu67.png?pub-status=live)
Here, we used the facts that
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20241108010952271-0447:S1474748023000518:S1474748023000518_eqnu68.png?pub-status=live)
and
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20241108010952271-0447:S1474748023000518:S1474748023000518_eqnu69.png?pub-status=live)
Since the sum over
$R\in \mathcal {D}_j$
converges, we deduce
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20241108010952271-0447:S1474748023000518:S1474748023000518_eqnu70.png?pub-status=live)
and thus the desired result follows.
Lemma 4.3. Let
$2\le p,q< \infty $
,
$s>{n}/\min {\{p,q\}}$
and
$L>n,s$
. For
$j\in {\mathbb {Z}}$
and
$Q\in \mathcal {D}_j$
, let
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20241108010952271-0447:S1474748023000518:S1474748023000518_eqnu71.png?pub-status=live)
where g is a Schwartz function on
${{\mathbb R}^n}$
. Then we have
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20241108010952271-0447:S1474748023000518:S1474748023000518_eqn35.png?pub-status=live)
Proof. It is easy to verify that for
$Q\in \mathcal {D}_j$
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20241108010952271-0447:S1474748023000518:S1474748023000518_eqnu72.png?pub-status=live)
and thus the left-hand side of Equation (4.5) is less than a constant multiple of
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20241108010952271-0447:S1474748023000518:S1474748023000518_eqnu73.png?pub-status=live)
by virtue of the maximal inequality (2.4) with
$s>{n}/\min {\{p,q \}}$
. We see that
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20241108010952271-0447:S1474748023000518:S1474748023000518_eqnu74.png?pub-status=live)
since
$\ell ^2\hookrightarrow \ell ^q$
,
$L>n$
and
$\langle 2^j(y-{\mathbf {x}}_Q)\rangle \gtrsim \langle 2^j(y-x)\rangle $
for
$Q\in \mathcal {D}_j$
and
$x\in Q$
. Using Equation (2.4) again, the left-hand side of Equation (4.5) is less than a constant times
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20241108010952271-0447:S1474748023000518:S1474748023000518_eqnu75.png?pub-status=live)
Lemma 4.4. Let
$1 \le q < \infty $
,
$s>{n}/{q}$
and
$L>n,s$
. For
$j\in {\mathbb {Z}}$
and
$Q\in \mathcal {D}_j$
, let
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20241108010952271-0447:S1474748023000518:S1474748023000518_eqnu76.png?pub-status=live)
where g is a Schwartz function on
${{\mathbb R}^n}$
. Then for
$1<p\le \infty $
with
$q\le p$
we have
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20241108010952271-0447:S1474748023000518:S1474748023000518_eqn36.png?pub-status=live)
Proof. For any
$j\in {\mathbb {Z}}$
and
$Q\in \mathcal {D}_j$
, there exists a unique lattice
${\boldsymbol {m}}_Q\in {{\mathbb Z}^n}$
such that
${\mathbf {x}}_Q=2^{-j}{\boldsymbol {m}}_Q$
. For any
$j\in {\mathbb {Z}}$
and
$x\in {{\mathbb R}^n}$
, let
$Q_{j,x}$
be a unique dyadic cube in
$\mathcal {D}_j$
containing x. Then we have the representations
${\mathbf {x}}_{Q_{j,x}}=2^{-j}{\boldsymbol {m}}_{Q_{j,x}}$
for
${\boldsymbol {m}}_{Q_{j,x}}\in {{\mathbb Z}^n}$
and
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20241108010952271-0447:S1474748023000518:S1474748023000518_eqnu77.png?pub-status=live)
Now, for
$Q\in \mathcal {D}_j$
, we write
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20241108010952271-0447:S1474748023000518:S1474748023000518_eqnu78.png?pub-status=live)
where the penultimate inequality follows from the fact that
$u_x\in [0,1)^n$
. This deduces
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20241108010952271-0447:S1474748023000518:S1474748023000518_eqnu79.png?pub-status=live)
Therefore, the left-hand side of Equation (4.6) is less than a constant times
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20241108010952271-0447:S1474748023000518:S1474748023000518_eqnu80.png?pub-status=live)
as
$sq>n$
, where we applied Minkowski’s inequality if
$p> q$
and the maximal inequality (2.6). This completes the proof.
Lemma 4.5. Let a be an
$H^p$
-atom associated with Q, satisfying
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20241108010952271-0447:S1474748023000518:S1474748023000518_eqn37.png?pub-status=live)
and fix
$L_0>0$
. Then we have
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20241108010952271-0447:S1474748023000518:S1474748023000518_eqn38.png?pub-status=live)
and
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20241108010952271-0447:S1474748023000518:S1474748023000518_eqn39.png?pub-status=live)
Moreover, for
$1\leq r \leq \infty $
,
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20241108010952271-0447:S1474748023000518:S1474748023000518_eqn40.png?pub-status=live)
Proof. We will prove only the estimates for
${\Lambda }_ja$
, and the exactly same argument is applicable to
${\Gamma }_ja$
as well. Let us first assume
$2^j\ell (Q)\ge 1$
. Then we have
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20241108010952271-0447:S1474748023000518:S1474748023000518_eqnu81.png?pub-status=live)
since
$|x-y|\gtrsim |x-{\mathbf {x}}_Q| $
for
$x\in (Q^*)^c$
and
$y\in Q$
.
Now, suppose that
$2^j\ell (Q)<1$
. By using the vanishing moment condition (4.7), we obtain
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20241108010952271-0447:S1474748023000518:S1474748023000518_eqnu82.png?pub-status=live)
If
$x\in Q^*$
, then it is clear that
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20241108010952271-0447:S1474748023000518:S1474748023000518_eqnu83.png?pub-status=live)
If
$x\in (Q^*)^c$
, then we have
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20241108010952271-0447:S1474748023000518:S1474748023000518_eqnu84.png?pub-status=live)
which implies
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20241108010952271-0447:S1474748023000518:S1474748023000518_eqnu85.png?pub-status=live)
This proves Equation (4.8).
Moreover, using the estimate (4.8), we have
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20241108010952271-0447:S1474748023000518:S1474748023000518_eqnu86.png?pub-status=live)
This concludes the proof of Equation (4.10).
5 Proof of Proposition 3.1: Reduction
5.1 Reduction via paraproduct
Without loss of generality, we may assume
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20241108010952271-0447:S1474748023000518:S1474748023000518_eqnu87.png?pub-status=live)
We first note that
$T_{\sigma }(f_1,f_2,f_3)$
can be written as
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20241108010952271-0447:S1474748023000518:S1474748023000518_eqnu88.png?pub-status=live)
We shall work with only the case
$j_1\ge j_2\ge j_3$
as other cases follow from a symmetric argument. When
$j_1\ge j_2\ge j_3$
, it is easy to verify that
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20241108010952271-0447:S1474748023000518:S1474748023000518_eqnu89.png?pub-status=live)
where
$\sigma _j(\vec {\boldsymbol {\xi }}):=\sigma (\vec {\boldsymbol {\xi }}) \widehat {\Theta }(\vec {\boldsymbol {\xi }}/2^j)$
and
$\widehat {\Theta }(\vec {\boldsymbol {\xi }}):=\sum _{l=-2}^2\widehat {\Psi }(2^{l}\vec {\boldsymbol {\xi }})$
so that
$\widehat {\Theta }(\vec {\boldsymbol {\xi }})=1$
for
$2^{-2}\le |\vec {\boldsymbol {\xi }}|\le 2^{2}$
and
$\mbox {supp}(\widehat {\Theta })\subset \{\vec {\boldsymbol {\xi }}\in ({{\mathbb R}^n})^3:2^{-3}\le |\vec {\boldsymbol {\xi }}|\le 2^3\}$
. Then we observe that
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20241108010952271-0447:S1474748023000518:S1474748023000518_eqn41.png?pub-status=live)
by virtue of the triangle inequality. Moreover, using the fact that
$ {\Gamma }_jf=\sum _{k\le j}{\Lambda }_kf, $
we write
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20241108010952271-0447:S1474748023000518:S1474748023000518_eqnu90.png?pub-status=live)
and especially, let
$T_{\sigma }^{(2)}:=T_{\sigma }^{(2),0}$
. Then it is enough to prove that
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20241108010952271-0447:S1474748023000518:S1474748023000518_eqn42.png?pub-status=live)
since the operator
$T_{\sigma }^{(2),k}$
,
$1\le k\le 9$
, can be handled in the same way as
$T_{\sigma }^{(2)}$
.
It should be remarked that the vanishing moment condition (1.16) now implies
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20241108010952271-0447:S1474748023000518:S1474748023000518_eqn43.png?pub-status=live)
5.2 Proof of (5.2) for
$\mu =1$
In this case, we may simply follow the arguments used in the proof of Theorems B and D. The proof is based on the fact that if
$\widehat {g_k}$
is supported in
$\{\xi \in {{\mathbb R}^n}: C_0^{-1} 2^{k}\le |\xi |\le C_02^{k}\}$
for
$C_0>1$
, then
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20241108010952271-0447:S1474748023000518:S1474748023000518_eqn44.png?pub-status=live)
The proof of Equation (5.4) is elementary and standard, simply using the estimate
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20241108010952271-0447:S1474748023000518:S1474748023000518_eqnu91.png?pub-status=live)
for all
$0<r<\infty $
and for some
$h\in {\mathbb {N}}$
, depending on
$C_0$
, and the maximal inequality (2.4). We refer to [Reference Yamazaki34, Theorem 3.6] for details.
By using the equivalence in Equation (2.2),
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20241108010952271-0447:S1474748023000518:S1474748023000518_eqnu92.png?pub-status=live)
We see that the Fourier transform of
$T_{\sigma _k}\big ({\Lambda }_kf_1,{\Gamma }_{k-10}f_2,{\Gamma }_{k-10}f_3 \big )$
is supported in
$\big \{\xi \in {{\mathbb R}^n} : 2^{k-2}\leq |\xi |\leq 2^{k+2} \big \}$
and thus the estimate (5.4) yields that
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20241108010952271-0447:S1474748023000518:S1474748023000518_eqnu93.png?pub-status=live)
Then it is already proved in [Reference Grafakos, Miyachi, Nguyen and Tomita14, (3.14)] that the preceding expression is dominated by the right-hand side of Equation (5.2) for
$s>n/\min {\{p_1,p_2,p_3\}}+n/2$
, where we remark that
$\min {\{p_1,p_2,p_3\}}\le 1$
. This proves Equation (5.2) for
$\mu =1$
.
5.3 Proof of Equation (5.2) for
$\mu =2$
Recall that
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20241108010952271-0447:S1474748023000518:S1474748023000518_eqn45.png?pub-status=live)
and observe that
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20241108010952271-0447:S1474748023000518:S1474748023000518_eqnu94.png?pub-status=live)
where
$\ast _{3n}$
means the convolution on
$\mathbb {R}^{3n}$
.
It suffices to consider the case when
$(1/p_1,1/p_2,1/p_3)$
belongs to
$\mathscr {R}_1$
or
$\mathscr {R}_3$
, as the remaining case is symmetrical to the case
$(1/p_1,1/p_2,1/p_3)\in \mathscr {R}_1$
, in view of Equation (5.5). We will mainly focus on the case
$(1/p_1,1/p_2,1/p_3)\in \mathscr {R}_1$
, while simply providing a short description for the case
$(1/p_1,1/p_2,1/p_3)\in \mathscr {R}_3$
in the remark below as almost same arguments will be applied in that case.
Therefore, we now assume
$0<p_1\le 1$
and
$2<p_2,p_3<\infty $
, and in turn, suppose that
$s>n/p_1+n/2$
. By using the atomic decomposition in Equation (2.3), the function
$f_1\in H^{p_1}({{\mathbb R}^n})$
can be written as
$f_1=\sum _{k=1}^{\infty }\lambda _k a_k$
, where
$a_k$
’s are
$H^{p_1}$
-atoms associated with cubes
$Q_k$
, and
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20241108010952271-0447:S1474748023000518:S1474748023000518_eqn46.png?pub-status=live)
As mentioned before, we may assume that M is sufficiently large and
$\int {x^{\gamma }a_k(x)}dx=0$
holds for all multi-indices
$|\gamma |\le M$
.
By the definition in Equation (1.2), we have
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20241108010952271-0447:S1474748023000518:S1474748023000518_eqnu95.png?pub-status=live)
and thus we need to prove that
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20241108010952271-0447:S1474748023000518:S1474748023000518_eqn47.png?pub-status=live)
The left-hand side is less than the sum of
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20241108010952271-0447:S1474748023000518:S1474748023000518_eqnu96.png?pub-status=live)
and
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20241108010952271-0447:S1474748023000518:S1474748023000518_eqnu97.png?pub-status=live)
recalling that
$Q_k^{***}$
is the dilate of
$Q_k$
by a factor
$(10\sqrt {n})^3$
. The two terms
$\mathcal {I}$
and
$\mathcal {J}$
will be treated separately in the next two sections.
Remark. When
$(1/p_1,1/p_2,1/p_3)\in \mathscr {R}_3$
(that is,
$0<p_3\le 1, ~2<p_1,p_2< \infty $
), we need to prove
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20241108010952271-0447:S1474748023000518:S1474748023000518_eqnu98.png?pub-status=live)
where
$\widetilde {a_k}$
is the
$H^{p_3}$
-atom associated with
$f_3$
. This is actually, via symmetry, equivalent to the estimate that for
$0<p_1\le 1$
and
$2<p_2,p_3< \infty $
,
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20241108010952271-0447:S1474748023000518:S1474748023000518_eqn48.png?pub-status=live)
where
$a_k$
is the
$H^{p_1}$
-atom for
$f_1$
. The proof of Equation (5.8) is almost same as that of Equation (5.7) which will be discussed in Sections 6 and 7. So this will not be pursued in this paper, just saying that Equation (4.9) will be needed rather than Equation (4.8), and the estimate
$\big \Vert \big \{ {\Gamma }_ja_k\big \}_{j\in {\mathbb {Z}}}\big \Vert _{L^r(\ell ^{\infty })}\sim \Vert a_k\Vert _{H^r({{\mathbb R}^n})}$
will be required in place of the equivalence
$\big \Vert \big \{ {\Lambda }_ja_k\big \}_{j\in {\mathbb {Z}}}\big \Vert _{L^r(\ell ^{2})}\sim \Vert a_k\Vert _{H^r({{\mathbb R}^n})}$
.
6 Proof of Proposition 3.1: estimate for
$\mathcal {I}$
For the estimation of
$\mathcal {I}$
, we need the following lemma whose proof will be given in Section 9.
Lemma 6.1. Let
$0<p_1\le 1$
and
$2<p_2,p_3<\infty $
, and suppose that
$\Vert f_1\Vert _{H^{p_1}({{\mathbb R}^n})}=\Vert f_2\Vert _{H^{p_2}({{\mathbb R}^n})}=\Vert f_3\Vert _{H^{p_3}({{\mathbb R}^n})}=1$
and
$\mathcal {L}_s^2[\sigma ]=1$
for
$s>n/p_1+n/2$
. Then there exist nonnegative functions
$u_1$
,
$u_2$
and
$u_3$
on
${{\mathbb R}^n}$
such that
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20241108010952271-0447:S1474748023000518:S1474748023000518_eqnu99.png?pub-status=live)
and for
$x\in {{\mathbb R}^n}$
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20241108010952271-0447:S1474748023000518:S1474748023000518_eqn49.png?pub-status=live)
This lemma, together with Hölder’s inequality, clearly shows that
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20241108010952271-0447:S1474748023000518:S1474748023000518_eqnu100.png?pub-status=live)
7 Proof of Proposition 3.1: estimate for
$\mathcal {J}$
Recall that for each
$Q_k$
and
$l\in {\mathbb {Z}}$
,
$B_{{\mathbf {x}}_{Q_k}}^l=B({\mathbf {x}}_{Q_k},100n2^{-l})$
stands for the ball of radius
$100n2^{-l}$
and center
${\mathbf {x}}_{Q_k}$
. Simply writing
$B_k^l:=B_{{\mathbf {x}}_{Q_k}}^l$
, we bound
$\mathcal {J}$
by the sum of
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20241108010952271-0447:S1474748023000518:S1474748023000518_eqnu101.png?pub-status=live)
and
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20241108010952271-0447:S1474748023000518:S1474748023000518_eqnu102.png?pub-status=live)
and treat them separately.
7.1 Estimate for
$\mathcal {J}_1$
Using the representations in Equations (2.7) and (2.9), we write
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20241108010952271-0447:S1474748023000518:S1474748023000518_eqnu103.png?pub-status=live)
where we recall
$\psi ^P(x)=|P|^{{1}/{2}}\psi _j(x-{\mathbf {x}}_P)$
and
$\theta ^R(x)=|R|^{{1}/{2}}\theta _j(x-{\mathbf {x}}_R)$
for
$P,R\in \mathcal {D}_j$
. Then it follows from Equations (2.8), (2.10), (2.1) and (2.2) that
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20241108010952271-0447:S1474748023000518:S1474748023000518_eqn50.png?pub-status=live)
and
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20241108010952271-0447:S1474748023000518:S1474748023000518_eqn51.png?pub-status=live)
We write
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20241108010952271-0447:S1474748023000518:S1474748023000518_eqnu104.png?pub-status=live)
where
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20241108010952271-0447:S1474748023000518:S1474748023000518_eqn52.png?pub-status=live)
and
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20241108010952271-0447:S1474748023000518:S1474748023000518_eqn53.png?pub-status=live)
Then we have
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20241108010952271-0447:S1474748023000518:S1474748023000518_eqnu105.png?pub-status=live)
where
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20241108010952271-0447:S1474748023000518:S1474748023000518_eqnu106.png?pub-status=live)
Now, we will show that
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20241108010952271-0447:S1474748023000518:S1474748023000518_eqn54.png?pub-status=live)
7.1.1 Proof of Equation (7.5) for
$\nu =1$
We further decompose
$\mathcal {U}_1(x,y)$
as
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20241108010952271-0447:S1474748023000518:S1474748023000518_eqnu107.png?pub-status=live)
where
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20241108010952271-0447:S1474748023000518:S1474748023000518_eqn55.png?pub-status=live)
and accordingly, we define
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20241108010952271-0447:S1474748023000518:S1474748023000518_eqnu108.png?pub-status=live)
Then we claim the following lemma.
Lemma 7.1. Let
$0<p_1\le 1$
and
$2<p_2,p_3<\infty $
, and let
$\mathcal {U}_1^{\mathrm {in}/\mathrm {out}}$
be defined as in Equation (7.6). Suppose that
$\Vert f_1\Vert _{H^{p_1}({{\mathbb R}^n})}=\Vert f_2\Vert _{H^{p_2}({{\mathbb R}^n})}=\Vert f_3\Vert _{H^{p_3}({{\mathbb R}^n})}=1$
and
$\mathcal {L}_s^2[\sigma ]=1$
for
$s>n/p_1+n/2$
. Then there exist nonnegative functions
$u_1^{\mathrm {in}}$
,
$u_1^{\mathrm {out}}$
,
$u_2$
and
$u_3$
on
${{\mathbb R}^n}$
such that
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20241108010952271-0447:S1474748023000518:S1474748023000518_eqnu109.png?pub-status=live)
and for
$x\in {{\mathbb R}^n}$
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20241108010952271-0447:S1474748023000518:S1474748023000518_eqn56.png?pub-status=live)
The proof of Lemma 7.1 will be given in Section 9. Taking the lemma for granted and using Hölder’s inequality, we can easily show that
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20241108010952271-0447:S1474748023000518:S1474748023000518_eqnu110.png?pub-status=live)
7.1.2 Proof of Equation (7.5) for
$\nu =2$
For
$P\in \mathcal {D}$
and
$l\in {\mathbb {Z}}$
let
$B_P^l:=B_{{\mathbf {x}}_P}^l=B({\mathbf {x}}_P,100n2^{-l})$
. By introducing
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20241108010952271-0447:S1474748023000518:S1474748023000518_eqn57.png?pub-status=live)
we write
$\mathcal {U}_2=\mathcal {U}_2^{1,\mathrm {in}}+\mathcal {U}_2^{1,\mathrm {out}}+\mathcal {U}_2^{2,\mathrm {in}}+\mathcal {U}_2^{2,\mathrm {out}}$
and consequently,
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20241108010952271-0447:S1474748023000518:S1474748023000518_eqnu111.png?pub-status=live)
where
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20241108010952271-0447:S1474748023000518:S1474748023000518_eqnu112.png?pub-status=live)
Then we apply the following lemma that will be proved in Section 9.
Lemma 7.2. Let
$0<p_1\le 1$
and
$2<p_2,p_3<\infty $
, and let
$\mathcal {U}_2^{\eta ,\mathrm {in}/\mathrm {out}}$
be defined as in Equation (7.8). Suppose that
$\Vert f_1\Vert _{H^{p_1}({{\mathbb R}^n})}=\Vert f_2\Vert _{H^{p_2}({{\mathbb R}^n})}=\Vert f_3\Vert _{H^{p_3}({{\mathbb R}^n})}=1$
and
$\mathcal {L}_s^2[\sigma ]=1$
for
$s>n/p_1+n/2$
. Then there exist nonnegative functions
$u_1^{\mathrm {in}}$
,
$u_1^{\mathrm {out}}$
,
$u_2$
and
$u_3$
on
${{\mathbb R}^n}$
such that
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20241108010952271-0447:S1474748023000518:S1474748023000518_eqnu113.png?pub-status=live)
and for each
$\eta =1,2$
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20241108010952271-0447:S1474748023000518:S1474748023000518_eqn58.png?pub-status=live)
Then Lemma 7.2 and Hölder’s inequality yield that
$\mathcal {J}_1^2$
is controlled by the sum of four terms in the form
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20241108010952271-0447:S1474748023000518:S1474748023000518_eqnu114.png?pub-status=live)
which is obviously less than a constant. This proves Equation (7.5) for
$\nu =2$
.
7.1.3 Proof of Equation (7.5) for
$\nu =3$
This case is essentially symmetrical to the case
$\nu =2$
. For
$R\in \mathcal {D}$
and
$l\in {\mathbb {Z}}$
, let
$B_R^l:=B_{{\mathbf {x}}_R}^l=B({\mathbf {x}}_R,100n2^{-l})$
. Let
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20241108010952271-0447:S1474748023000518:S1474748023000518_eqn59.png?pub-status=live)
and then we write
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20241108010952271-0447:S1474748023000518:S1474748023000518_eqnu115.png?pub-status=live)
where
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20241108010952271-0447:S1474748023000518:S1474748023000518_eqnu116.png?pub-status=live)
Now, Equation (7.5) for
$\nu =3$
follows from the lemma below.
Lemma 7.3. Let
$0<p_1\le 1$
and
$2<p_2,p_3<\infty $
, and let
$\mathcal {U}_3^{\eta ,\mathrm {in}/\mathrm {out}}$
be defined as in Equation (7.10). Suppose that
$\Vert f_1\Vert _{H^{p_1}({{\mathbb R}^n})}=\Vert f_2\Vert _{H^{p_2}({{\mathbb R}^n})}=\Vert f_3\Vert _{H^{p_3}({{\mathbb R}^n})}=1$
and
$\mathcal {L}_s^2[\sigma ]=1$
for
$s>n/p_1+n/2$
. Then there exist nonnegative functions
$u_1^{\mathrm {in}}$
,
$u_1^{\mathrm {out}}$
,
$u_2$
, and
$u_3$
on
${{\mathbb R}^n}$
such that
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20241108010952271-0447:S1474748023000518:S1474748023000518_eqnu117.png?pub-status=live)
and for each
$\eta =1,2$
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20241108010952271-0447:S1474748023000518:S1474748023000518_eqnu118.png?pub-status=live)
The proof of the lemma will be provided in Section 9.
7.1.4 Proof of Equation (7.5) for
$\nu =4$
In this case, we divide
$\mathcal {U}_4$
into eight types depending on whether x belongs to each of
$B_P^l$
and
$B_R^l$
and whether
${\Lambda }_ja_k$
is supported in
$Q_k^*$
. Indeed, let
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20241108010952271-0447:S1474748023000518:S1474748023000518_eqn60.png?pub-status=live)
and we define
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20241108010952271-0447:S1474748023000518:S1474748023000518_eqn61.png?pub-status=live)
for
$\eta =1,2,3,4$
.
Then we use the following lemma to obtain the desired result.
Lemma 7.4. Let
$0<p_1\le 1$
and
$2<p_2,p_3<\infty $
, and let
$\mathcal {U}_4^{\eta ,\mathrm {in}/\mathrm {out}}$
be defined as in Equation (7.12). Suppose that
$\Vert f_1\Vert _{H^{p_1}({{\mathbb R}^n})}=\Vert f_2\Vert _{H^{p_2}({{\mathbb R}^n})}=\Vert f_3\Vert _{H^{p_3}({{\mathbb R}^n})}=1$
and
$\mathcal {L}_s^2[\sigma ]=1$
for
$s>n/p_1+n/2$
. Then there exist nonnegative functions
$u_1^{\mathrm {in}}$
,
$u_1^{\mathrm {out}}$
,
$u_2$
, and
$u_3$
on
${{\mathbb R}^n}$
such that
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20241108010952271-0447:S1474748023000518:S1474748023000518_eqn62.png?pub-status=live)
and for each
$\eta =1,2,3,4,$
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20241108010952271-0447:S1474748023000518:S1474748023000518_eqn63.png?pub-status=live)
We will prove the lemma in Section 9.
7.2 Estimate for
$\mathcal {J}_2$
Let
$x\in (Q_k^{***})^c\cap B_{k,l}$
. For
$\nu =1,2,3,4$
, let
$\Omega _{\nu }(P,R)$
be defined as in Equation (7.3). Then as in the proof of the estimate for
$\mathcal {J}_1$
, we consider the four cases:
$x \in \Omega _{1}(P,R)$
,
$x \in \Omega _{2}(P,R)$
,
$x \in \Omega _{3}(P,R)$
and
$x \in \Omega _{4}(P,R)$
. That is, for each
$\nu =1,2,3,4$
, let
$\mathcal {U}_{\nu }$
be defined as in Equation (7.4) and
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20241108010952271-0447:S1474748023000518:S1474748023000518_eqnu119.png?pub-status=live)
Then it suffices to show that for each
$\nu =1,2,3,4$
,
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20241108010952271-0447:S1474748023000518:S1474748023000518_eqn64.png?pub-status=live)
7.2.1 Proof of Equation (7.15) for
$\nu =1$
In this case, the proof can be simply reduced to the following lemma, which will be proved in Section 9.
Lemma 7.5. Let
$0<p_1\le 1$
and
$2<p_2,p_3<\infty $
, and let
$\mathcal {U}_1$
be defined as in Equation (7.4). Suppose that
$\Vert f_1\Vert _{H^{p_1}({{\mathbb R}^n})}=\Vert f_2\Vert _{H^{p_2}({{\mathbb R}^n})}=\Vert f_3\Vert _{H^{p_3}({{\mathbb R}^n})}=1$
and
$\mathcal {L}_s^2[\sigma ]=1$
for
$s>n/p_1+n/2$
. Then there exist nonnegative functions
$u_1$
,
$u_2$
and
$u_3$
on
${{\mathbb R}^n}$
such that
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20241108010952271-0447:S1474748023000518:S1474748023000518_eqnu120.png?pub-status=live)
and for
$x\in {{\mathbb R}^n}$
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20241108010952271-0447:S1474748023000518:S1474748023000518_eqn65.png?pub-status=live)
Then it follows from Hölder’s inequality that
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20241108010952271-0447:S1474748023000518:S1474748023000518_eqnu121.png?pub-status=live)
7.2.2 Proof of Equation (7.15) for
$\nu =2$
For
$P\in \mathcal {D}$
and
$l\in {\mathbb {Z}}$
, let
$B_P^l:=B_{{\mathbf {x}}_P}^l$
be the ball of center
${\mathbf {x}}_P$
and radius
$100n2^{-l}$
as before. We define
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20241108010952271-0447:S1474748023000518:S1474748023000518_eqn66.png?pub-status=live)
and write
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20241108010952271-0447:S1474748023000518:S1474748023000518_eqnu122.png?pub-status=live)
where
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20241108010952271-0447:S1474748023000518:S1474748023000518_eqnu123.png?pub-status=live)
Then we need the following lemmas.
Lemma 7.6. Let
$0<p_1\le 1$
and
$2<p_2,p_3<\infty $
and let
$\mathcal {U}_2^{1}$
be defined as in (7.17). Suppose that
$\Vert f_1\Vert _{H^{p_1}({{\mathbb R}^n})}=\Vert f_2\Vert _{H^{p_2}({{\mathbb R}^n})}=\Vert f_3\Vert _{H^{p_3}({{\mathbb R}^n})}=1$
and
$\mathcal {L}_s^2[\sigma ]=1$
for
$s>n/p_1+n/2$
. Then there exist nonnegative functions
$u_1$
,
$u_2$
and
$u_3$
on
${{\mathbb R}^n}$
such that
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20241108010952271-0447:S1474748023000518:S1474748023000518_eqnu124.png?pub-status=live)
and
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20241108010952271-0447:S1474748023000518:S1474748023000518_eqn67.png?pub-status=live)
Lemma 7.7. Let
$0<p_1\le 1$
and
$2<p_2,p_3<\infty $
, and let
$\mathcal {U}_2^{2}$
be defined as in Equation (7.17). Suppose that
$\Vert f_1\Vert _{H^{p_1}({{\mathbb R}^n})}=\Vert f_2\Vert _{H^{p_2}({{\mathbb R}^n})}=\Vert f_3\Vert _{H^{p_3}({{\mathbb R}^n})}=1$
and
$\mathcal {L}_s^2[\sigma ]=1$
for
$s>n/p_1+n/2$
. Then there exist nonnegative functions
$u_1$
,
$u_2$
and
$u_3$
on
${{\mathbb R}^n}$
such that
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20241108010952271-0447:S1474748023000518:S1474748023000518_eqnu125.png?pub-status=live)
and
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20241108010952271-0447:S1474748023000518:S1474748023000518_eqnu126.png?pub-status=live)
The above lemmas will be proved in Section 9. Using Lemmas 7.6 and 7.7, we obtain
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20241108010952271-0447:S1474748023000518:S1474748023000518_eqnu127.png?pub-status=live)
which finishes the proof of Equation (7.15) for
$\nu =2$
.
7.2.3 Proof of Equation (7.15) for
$\nu =3$
We use the notation
$B_R^l:=B_{{\mathbf {x}}_R}^l$
for
$R\in \mathcal {D}$
and
$l\in {\mathbb {Z}}$
as before and write
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20241108010952271-0447:S1474748023000518:S1474748023000518_eqnu128.png?pub-status=live)
where
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20241108010952271-0447:S1474748023000518:S1474748023000518_eqn68.png?pub-status=live)
and
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20241108010952271-0447:S1474748023000518:S1474748023000518_eqnu129.png?pub-status=live)
As in the proof of the case
$\nu =2$
, it suffices to prove the following two lemmas.
Lemma 7.8. Let
$0<p_1\le 1$
and
$2<p_2,p_3<\infty $
, and let
$\mathcal {U}_3^{1}$
be defined as in Equation (7.19). Suppose that
$\Vert f_1\Vert _{H^{p_1}({{\mathbb R}^n})}=\Vert f_2\Vert _{H^{p_2}({{\mathbb R}^n})}=\Vert f_3\Vert _{H^{p_3}({{\mathbb R}^n})}=1$
and
$\mathcal {L}_s^2[\sigma ]=1$
for
$s>n/p_1+n/2$
. Then there exist nonnegative functions
$u_1$
,
$u_2$
and
$u_3$
on
${{\mathbb R}^n}$
such that
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20241108010952271-0447:S1474748023000518:S1474748023000518_eqn69.png?pub-status=live)
and
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20241108010952271-0447:S1474748023000518:S1474748023000518_eqn70.png?pub-status=live)
Lemma 7.9. Let
$0<p_1\le 1$
and
$2<p_2,p_3<\infty $
, and let
$\mathcal {U}_3^{2}$
be defined as in Equation (7.19). Suppose that
$\Vert f_1\Vert _{H^{p_1}({{\mathbb R}^n})}=\Vert f_2\Vert _{H^{p_2}({{\mathbb R}^n})}=\Vert f_3\Vert _{H^{p_3}({{\mathbb R}^n})}=1$
and
$\mathcal {L}_s^2[\sigma ]=1$
for
$s>n/p_1+n/2$
. Then there exist nonnegative functions
$u_1$
,
$u_2$
and
$u_3$
on
${{\mathbb R}^n}$
such that
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20241108010952271-0447:S1474748023000518:S1474748023000518_eqn71.png?pub-status=live)
and
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20241108010952271-0447:S1474748023000518:S1474748023000518_eqn72.png?pub-status=live)
The proof of Lemmas 7.8 and 7.9 will be provided in Section 9.
7.2.4 Proof of Equation (7.15) for
$\nu =4$
Let
$B_P^l:=B_{{\mathbf {x}}^P}^l$
and
$B_R^l:=B_{{\mathbf {x}}_R}^l$
for
$P,R\in \mathcal {D}$
and
$l\in {\mathbb {Z}}$
, and let
$\Xi _{\eta }(P,R,l)$
be defined as in Equation (7.11). Now, we write
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20241108010952271-0447:S1474748023000518:S1474748023000518_eqnu130.png?pub-status=live)
where
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20241108010952271-0447:S1474748023000518:S1474748023000518_eqn73.png?pub-status=live)
Accordingly, we define
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20241108010952271-0447:S1474748023000518:S1474748023000518_eqnu131.png?pub-status=live)
Then we obtain the desired result from the following lemmas.
Lemma 7.10. Let
$0<p_1\le 1$
and
$2<p_2,p_3<\infty $
, and let
$\mathcal {U}_4^{\eta }$
,
$\eta =1,2,3$
, be defined as in Equation (7.24). Suppose that
$\Vert f_1\Vert _{H^{p_1}({{\mathbb R}^n})}=\Vert f_2\Vert _{H^{p_2}({{\mathbb R}^n})}=\Vert f_3\Vert _{H^{p_3}({{\mathbb R}^n})}=1$
and
$\mathcal {L}_s^2[\sigma ]=1$
for
$s>n/p_1+n/2$
. Then there exist nonnegative functions
$u_1$
,
$u_2$
and
$u_3$
on
${{\mathbb R}^n}$
such that
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20241108010952271-0447:S1474748023000518:S1474748023000518_eqnu132.png?pub-status=live)
and for each
$\eta =1,2,3$
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20241108010952271-0447:S1474748023000518:S1474748023000518_eqn74.png?pub-status=live)
Lemma 7.11. Let
$0<p_1\le 1$
and
$2<p_2,p_3<\infty $
, and let
$\mathcal {U}_4^{4}$
be defined as in Equation (7.24). Suppose that
$\Vert f_1\Vert _{H^{p_1}({{\mathbb R}^n})}=\Vert f_2\Vert _{H^{p_2}({{\mathbb R}^n})}=\Vert f_3\Vert _{H^{p_3}({{\mathbb R}^n})}=1$
and
$\mathcal {L}_s^2[\sigma ]=1$
for
$s>n/p_1+n/2$
. Then there exist nonnegative functions
$u_1$
,
$u_2$
and
$u_3$
on
${{\mathbb R}^n}$
such that
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20241108010952271-0447:S1474748023000518:S1474748023000518_eqn75.png?pub-status=live)
and
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20241108010952271-0447:S1474748023000518:S1474748023000518_eqn76.png?pub-status=live)
The proof of the lemmas will be given in Section 9.
8 Proof of Proposition 3.2
We need to deal only with, via symmetry, the case when
$0<p_1=p\le 1$
and
$p_2=p_3=\infty $
. As before, we assume that
$\| f_1 \|_{H^p({{\mathbb R}^n})} = \|f_2 \|_{L^\infty ({{\mathbb R}^n})} = \| f_3 \|_{L^\infty ({{\mathbb R}^n})}=1$
and
$\mathcal {L}_s^2[\sigma ]=1$
for
$s>n/p+n/2$
. In this case, we do not decompose the frequencies of
$f_2, f_3$
and only make use of the atomic decomposition on
$f_1$
. Let
$a_k$
’s be
$H^p$
-atoms associated with
$Q_k$
so that
$f_1=\sum _{k=1}^{\infty }\lambda _k a_k$
and
$\big (\sum _{k=1}^{\infty }|\lambda _k|^p\big )^{1/p}\lesssim 1$
. Then we will prove that
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20241108010952271-0447:S1474748023000518:S1474748023000518_eqn77.png?pub-status=live)
and
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20241108010952271-0447:S1474748023000518:S1474748023000518_eqn78.png?pub-status=live)
8.1 Proof of Equation (8.1)
Since
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20241108010952271-0447:S1474748023000518:S1474748023000518_eqnu133.png?pub-status=live)
the left-hand side of Equation (8.1) is controlled by
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20241108010952271-0447:S1474748023000518:S1474748023000518_eqnu134.png?pub-status=live)
Using Hölder’s inequality, the
$L^2$
boundedness of
$\mathcal {M}$
and Theorem D, we have
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20241108010952271-0447:S1474748023000518:S1474748023000518_eqnu135.png?pub-status=live)
and thus Equation (8.1) follows from
$\big (\sum _{k=1}^{\infty }|\lambda _k|^p\big )^{1/p}\lesssim 1$
.
8.2 Proof of Equation (8.2)
Let
$B_k^l=B({\mathbf {x}}_{Q_k},100 n2^{-l})$
as before. We now decompose the left-hand side of Equation (8.2) as the sum of
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20241108010952271-0447:S1474748023000518:S1474748023000518_eqnu136.png?pub-status=live)
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20241108010952271-0447:S1474748023000518:S1474748023000518_eqnu137.png?pub-status=live)
and thus we need to show that
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20241108010952271-0447:S1474748023000518:S1474748023000518_eqnu138.png?pub-status=live)
Actually, the proof of these estimates will be complete once we have verified the following lemmas.
Lemma 8.1. Let
$0<p\le 1$
. Suppose that
$\Vert f_1\Vert _{H^{p}({{\mathbb R}^n})}=\Vert f_2\Vert _{H^{\infty }({{\mathbb R}^n})}=\Vert f_3\Vert _{H^{\infty }({{\mathbb R}^n})}=1$
and
$\mathcal {L}_s^2[\sigma ]=1$
for
$s>n/p+n/2$
. Then there exist nonnegative functions
$u_1$
,
$u_2$
and
$u_3$
on
${{\mathbb R}^n}$
such that
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20241108010952271-0447:S1474748023000518:S1474748023000518_eqnu139.png?pub-status=live)
and
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20241108010952271-0447:S1474748023000518:S1474748023000518_eqn79.png?pub-status=live)
Lemma 8.2. Let
$0<p\le 1$
. Suppose that
$\Vert f_1\Vert _{H^{p}({{\mathbb R}^n})}=\Vert f_2\Vert _{H^{\infty }({{\mathbb R}^n})}=\Vert f_3\Vert _{H^{\infty }({{\mathbb R}^n})}=1$
and
$\mathcal {L}_s^2[\sigma ]=1$
for
$s>n/p+n/2$
. Then there exist nonnegative functions
$u_1$
,
$u_2$
and
$u_3$
on
${{\mathbb R}^n}$
such that
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20241108010952271-0447:S1474748023000518:S1474748023000518_eqnu140.png?pub-status=live)
and
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20241108010952271-0447:S1474748023000518:S1474748023000518_eqn80.png?pub-status=live)
The proof of the two lemmas will be given in Section 9.
9 Proof of the key lemmas
9.1 Proof of Lemma 6.1
Let
$1<r<2$
such that
$s>{3n}/{r}>{3n}/{2}$
, and we claim the pointwise estimate
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20241108010952271-0447:S1474748023000518:S1474748023000518_eqn81.png?pub-status=live)
Indeed, choosing t so that
${3n}/{r}<3t<s$
, we apply Hölder’s inequality to bound the left-hand side of Equation (9.1) by
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20241108010952271-0447:S1474748023000518:S1474748023000518_eqnu141.png?pub-status=live)
We observe that
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20241108010952271-0447:S1474748023000518:S1474748023000518_eqnu142.png?pub-status=live)
using the Hausdorff–Young inequality, Equation (5.1) and the inclusion
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20241108010952271-0447:S1474748023000518:S1474748023000518_eqnu143.png?pub-status=live)
where A is a ball of a constant radius, whose proof is contained in [Reference Grafakos and Park19, (1.8)]. Applying Equation (2.5) to the remaining three
$L^r$
norms, we finally obtain Equation (9.1).
Now, we choose
$\widetilde {r}$
and q such that
$2<\widetilde {r}<p_2,p_3$
and
${1}/{q}+{2}/{\widetilde {r}}=1$
. Finally, using the estimate (9.1) and Hölder’s inequality, we have
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20241108010952271-0447:S1474748023000518:S1474748023000518_eqnu144.png?pub-status=live)
where we choose
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20241108010952271-0447:S1474748023000518:S1474748023000518_eqnu145.png?pub-status=live)
and this proves (6.1). Moreover,
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20241108010952271-0447:S1474748023000518:S1474748023000518_eqnu146.png?pub-status=live)
where the last inequality follows from Equation (5.6) and the estimate
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20241108010952271-0447:S1474748023000518:S1474748023000518_eqnu147.png?pub-status=live)
for
$q<r_0<\infty $
. Here, we applied Hölder’s inequality, the maximal inequality (2.4), the equivalence in (2.2) and properties of the
$H^{p_1}$
-atom
$a_k$
. It is also easy to verify
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20241108010952271-0447:S1474748023000518:S1474748023000518_eqnu148.png?pub-status=live)
and
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20241108010952271-0447:S1474748023000518:S1474748023000518_eqnu149.png?pub-status=live)
9.2 Proof of Lemma 7.1
Since
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20241108010952271-0447:S1474748023000518:S1474748023000518_eqnu150.png?pub-status=live)
we can choose
$s_1,s_2,s_3$
such that
$s_1>{n}/{p_1}-{n}/{2}$
,
$s_2,s_3>{n}/{2}$
, and
$s=s_1+s_2+s_3$
.
Using the estimates
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20241108010952271-0447:S1474748023000518:S1474748023000518_eqnu151.png?pub-status=live)
we have
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20241108010952271-0447:S1474748023000518:S1474748023000518_eqn82.png?pub-status=live)
We observe that for
$|x-y|\le 2^{-l}$
,
$x\in (Q_k^{***})^c\cap (B_k^l)^c$
and
$z_1\in Q_k^*$
,
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20241108010952271-0447:S1474748023000518:S1474748023000518_eqn83.png?pub-status=live)
and thus, by using Lemma 4.5,
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20241108010952271-0447:S1474748023000518:S1474748023000518_eqnu152.png?pub-status=live)
for sufficiently large M, where
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20241108010952271-0447:S1474748023000518:S1474748023000518_eqn84.png?pub-status=live)
This proves that
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20241108010952271-0447:S1474748023000518:S1474748023000518_eqn85.png?pub-status=live)
and therefore, we obtain
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20241108010952271-0447:S1474748023000518:S1474748023000518_eqn86.png?pub-status=live)
Similar to Equation (9.2), we write
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20241108010952271-0447:S1474748023000518:S1474748023000518_eqnu153.png?pub-status=live)
Instead of Equation (9.3), we make use of the estimate
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20241108010952271-0447:S1474748023000518:S1474748023000518_eqn87.png?pub-status=live)
for
$|x-y|\le 2^{-l}$
and
$x\in (Q_k^{***})^c\cap (B_k^l)^c$
. Then, using the argument that led to Equation (9.5), we have
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20241108010952271-0447:S1474748023000518:S1474748023000518_eqn88.png?pub-status=live)
where M,
$L_0$
are sufficiently large numbers and
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20241108010952271-0447:S1474748023000518:S1474748023000518_eqn89.png?pub-status=live)
Now, we deduce
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20241108010952271-0447:S1474748023000518:S1474748023000518_eqn90.png?pub-status=live)
According to Equations (9.6) and (9.10), the estimate (7.7) follows from taking
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20241108010952271-0447:S1474748023000518:S1474748023000518_eqnu154.png?pub-status=live)
It is clear that
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20241108010952271-0447:S1474748023000518:S1474748023000518_eqn91.png?pub-status=live)
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20241108010952271-0447:S1474748023000518:S1474748023000518_eqn92.png?pub-status=live)
in view of Equations (7.1) and (7.2). To estimate
$u_1^{\mathrm {in}}$
and
$u_1^{\mathrm {out}}$
, we note that
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20241108010952271-0447:S1474748023000518:S1474748023000518_eqn93.png?pub-status=live)
where we applied Minkowski’s inequality and a change of variables, and similarly,
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20241108010952271-0447:S1474748023000518:S1474748023000518_eqn94.png?pub-status=live)
for
$L_0>s+n$
. Now, we have
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20241108010952271-0447:S1474748023000518:S1474748023000518_eqnu155.png?pub-status=live)
and the integral is dominated by
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20241108010952271-0447:S1474748023000518:S1474748023000518_eqnu156.png?pub-status=live)
The first term is no more than a constant times
$\ell (Q_k)^{-p_1(s_1-({n}/{p_1}-{n}/{2}))}$
, and the second one is bounded by
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20241108010952271-0447:S1474748023000518:S1474748023000518_eqnu157.png?pub-status=live)
due to Equation (9.13). This proves
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20241108010952271-0447:S1474748023000518:S1474748023000518_eqn95.png?pub-status=live)
In a similar way, together with Equation (9.14), we can also prove
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20241108010952271-0447:S1474748023000518:S1474748023000518_eqn96.png?pub-status=live)
choosing
$M>L_0-{3n}/{2}$
.
9.3 Proof of Lemma 7.2
As in the proof of Lemma 7.1, we pick
$s_1,s_2,s_3$
satisfying
$s_1>{n}/{p_1}-{n}/{2}$
,
$s_2,s_3>{n}/{2}$
, and
$s=s_1+s_2+s_3>n/p_1+n/2$
.
We first consider the case
$\eta =1$
. For
$x\in P^c\cap (B_P^l)^c$
and
$|x-y|\le 2^{-l}$
, we have
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20241108010952271-0447:S1474748023000518:S1474748023000518_eqn97.png?pub-status=live)
By using
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20241108010952271-0447:S1474748023000518:S1474748023000518_eqnu158.png?pub-status=live)
we have
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20241108010952271-0447:S1474748023000518:S1474748023000518_eqn98.png?pub-status=live)
Using Equations (9.3) and (9.17) and Lemma 4.5, the integral in the preceding expression is bounded by
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20241108010952271-0447:S1474748023000518:S1474748023000518_eqnu159.png?pub-status=live)
for sufficiently large
$M>0$
, where
$\widetilde {\psi ^P}(z_2):=\langle 2^j(z_2-{\mathbf {x}}_P)\rangle ^{s_2}\psi ^P(z_2)$
for
$P\in \mathcal {D}_j$
and
$I_{k,j,s}^{\mathrm {in}}$
is defined as in Equation (9.4). Note that
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20241108010952271-0447:S1474748023000518:S1474748023000518_eqn99.png?pub-status=live)
and thus it follows from Lemma 4.2 that the
$L^2$
norm in the last displayed expression is dominated by
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20241108010952271-0447:S1474748023000518:S1474748023000518_eqnu160.png?pub-status=live)
This yields that
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20241108010952271-0447:S1474748023000518:S1474748023000518_eqn100.png?pub-status=live)
Similarly, using Equations (9.7) and (9.17), Lemma 4.5 and Lemma 4.2, we have
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20241108010952271-0447:S1474748023000518:S1474748023000518_eqn101.png?pub-status=live)
where
$I_{k,j,s}^{\mathrm {out}}$
is defined as in Equation (9.9).
When
$\eta =2$
, we use the inequality
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20241108010952271-0447:S1474748023000518:S1474748023000518_eqn102.png?pub-status=live)
for
$x\in (B_k^l)^c \cap B_{P}^l$
. Then, similar to Equation (9.18), we have
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20241108010952271-0447:S1474748023000518:S1474748023000518_eqnu161.png?pub-status=live)
and the integral is dominated by a constant times
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20241108010952271-0447:S1474748023000518:S1474748023000518_eqnu162.png?pub-status=live)
due to Equations (9.3) and (9.22), Lemma 4.5 and Lemma 4.2, where
$I_{k,j,s}^{\mathrm {in}}$
and
$\mathscr {B}_P^2(f_2)$
are defined as in Equations (9.4) and (9.19). Therefore,
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20241108010952271-0447:S1474748023000518:S1474748023000518_eqn103.png?pub-status=live)
Similarly, we can also prove that
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20241108010952271-0447:S1474748023000518:S1474748023000518_eqn104.png?pub-status=live)
Combining Equations (9.20), (9.21), (9.23) and (9.24), the estimate (7.9) holds with
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20241108010952271-0447:S1474748023000518:S1474748023000518_eqnu163.png?pub-status=live)
Clearly, as in Equations (9.15), (9.16) and (9.12),
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20241108010952271-0447:S1474748023000518:S1474748023000518_eqnu164.png?pub-status=live)
and Lemma 4.3 proves that
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20241108010952271-0447:S1474748023000518:S1474748023000518_eqnu165.png?pub-status=live)
9.4 Proof of Lemma 7.3
The proof is almost same as that of Lemma 7.2. By letting
$M>0$
be sufficiently large and exchanging the role of terms associated with
$f_2$
and
$f_3$
in the estimate (9.18), we may obtain
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20241108010952271-0447:S1474748023000518:S1474748023000518_eqn105.png?pub-status=live)
where
$I_{k,j,s}^{\mathrm {in}}$
is defined as in Equation (9.4),
$\widetilde {\theta ^R}(z_3):=\langle 2^j(z_3-{\mathbf {x}}_R)\rangle ^{s_3}\theta ^R(z_3)$
for
$R\in \mathcal {D}_j$
and
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20241108010952271-0447:S1474748023000518:S1474748023000518_eqn106.png?pub-status=live)
Similarly,
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20241108010952271-0447:S1474748023000518:S1474748023000518_eqn107.png?pub-status=live)
where
$I_{k,j,s}^{\mathrm {out}}$
is defined as in Equation (9.9).
For the case
$\eta =2$
, we use the fact that for
$x\in (B_k^l)^c\cap B_R^l$
,
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20241108010952271-0447:S1474748023000518:S1474748023000518_eqnu166.png?pub-status=live)
instead of Equation (9.22). Then we have
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20241108010952271-0447:S1474748023000518:S1474748023000518_eqnu167.png?pub-status=live)
and
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20241108010952271-0447:S1474748023000518:S1474748023000518_eqnu168.png?pub-status=live)
which are analogous to Equations (9.25) and (9.27).
Then Lemma 7.3 follows from Equations (9.15), (9.16) and (9.11) and Lemma 4.4 by choosing
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20241108010952271-0447:S1474748023000518:S1474748023000518_eqnu169.png?pub-status=live)
9.5 Proof of Lemma 7.4
Let
$I_{k,j,s}^{\mathrm {in}}$
,
$I_{k,j,s}^{\mathrm {out}}$
,
$\mathscr {B}_P^2(f_2)$
and
$\mathscr {B}_R^3(f_3)$
be defined as before. Let
$M>0$
be a sufficiently large number. We claim the pointwise estimates that for each
$\eta =1,2,3,4$
,
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20241108010952271-0447:S1474748023000518:S1474748023000518_eqnu170.png?pub-status=live)
The proof of the above claim is a repetition of the arguments used in the proof of Lemmas 7.2 and 7.3, so we omit the details. We now take
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20241108010952271-0447:S1474748023000518:S1474748023000518_eqnu171.png?pub-status=live)
9.6 Proof of Lemma 7.5
We choose
$0<\epsilon <1$
such that
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20241108010952271-0447:S1474748023000518:S1474748023000518_eqn108.png?pub-status=live)
We note that
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20241108010952271-0447:S1474748023000518:S1474748023000518_eqnu172.png?pub-status=live)
By using Lemma 4.1 with the vanishing moment condition (5.3), we have
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20241108010952271-0447:S1474748023000518:S1474748023000518_eqnu173.png?pub-status=live)
where
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20241108010952271-0447:S1474748023000518:S1474748023000518_eqnu174.png?pub-status=live)
and
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20241108010952271-0447:S1474748023000518:S1474748023000518_eqnu175.png?pub-status=live)
Now, the left-hand side of Equation (7.16) is dominated by
$\mathscr {J}^{in}(x)+\mathscr {J}^{out}(x)$
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20241108010952271-0447:S1474748023000518:S1474748023000518_eqnu176.png?pub-status=live)
To estimate
$\mathscr {J}^{\mathrm {in}}$
, we first see that
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20241108010952271-0447:S1474748023000518:S1474748023000518_eqnu177.png?pub-status=live)
using the Cauchy–Schwarz inequality with
$s>{3n}/{2}$
, and thus
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20241108010952271-0447:S1474748023000518:S1474748023000518_eqn109.png?pub-status=live)
by using the fact that
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20241108010952271-0447:S1474748023000518:S1474748023000518_eqnu178.png?pub-status=live)
For the other term
$\mathscr {J}^{out}$
, we choose
$s_1$
such that
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20241108010952271-0447:S1474748023000518:S1474748023000518_eqn110.png?pub-status=live)
which is possible due to Equation (9.28), and
$s_2,s_3>{n}/{2}$
such that
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20241108010952271-0447:S1474748023000518:S1474748023000518_eqn111.png?pub-status=live)
We observe that, for
$y\in (Q_k^{**})^c$
,
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20241108010952271-0447:S1474748023000518:S1474748023000518_eqnu179.png?pub-status=live)
where Lemma 4.5 is applied in the first inequality. Here, M and
$L_0$
are sufficiently large numbers such that
$L_0-s_1>n$
and
$M-L_0+3n/2>0$
. By letting
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20241108010952271-0447:S1474748023000518:S1474748023000518_eqn112.png?pub-status=live)
we have
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20241108010952271-0447:S1474748023000518:S1474748023000518_eqn113.png?pub-status=live)
and the integral is, via the Cauchy-Schwarz inequality, less than
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20241108010952271-0447:S1474748023000518:S1474748023000518_eqnu180.png?pub-status=live)
This deduces that
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20241108010952271-0447:S1474748023000518:S1474748023000518_eqnu181.png?pub-status=live)
since
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20241108010952271-0447:S1474748023000518:S1474748023000518_eqnu182.png?pub-status=live)
Therefore, by using the Cauchy–Schwarz inequality
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20241108010952271-0447:S1474748023000518:S1474748023000518_eqn114.png?pub-status=live)
where the last inequality holds due to
$s_1>{n}/{2}$
and
$M-L_0+{3n}/{2}>0$
.
In conclusion, the estimate (7.16) can be derived from Equations (9.29) and (9.34), using the choices of
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20241108010952271-0447:S1474748023000518:S1474748023000518_eqnu183.png?pub-status=live)
It is obvious from Equations (7.1) and (7.2) that
$\Vert u_2\Vert _{L^{p_2}({{\mathbb R}^n})}, \Vert u_3\Vert _{L^{p_3}({{\mathbb R}^n})}\lesssim 1$
. Furthermore,
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20241108010952271-0447:S1474748023000518:S1474748023000518_eqn115.png?pub-status=live)
This completes the proof.
9.7 Proof of Lemma 7.6
Choose
$s_1$
,
$s_2$
, and
$s_3$
such that
$s_1>{n}/{p_1}-{n}/{2}$
,
$s_2>{n}/{2}$
,
$s_3>{n}/{2}$
and
$s=s_1+s_2+s_3$
. For
$x\in B_k^l\cap (B_P^l)^c$
and
$|x-y|\le 2^{-l}$
, we have
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20241108010952271-0447:S1474748023000518:S1474748023000518_eqn116.png?pub-status=live)
This implies
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20241108010952271-0447:S1474748023000518:S1474748023000518_eqnu184.png?pub-status=live)
where
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20241108010952271-0447:S1474748023000518:S1474748023000518_eqnu185.png?pub-status=live)
By using the Cauchy–Schwarz inequality and Lemma 4.2, we obtain
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20241108010952271-0447:S1474748023000518:S1474748023000518_eqn117.png?pub-status=live)
where
$\mathscr {B}_P^2(f_2)$
is defined as in Equation (9.19) for some
$L>n,s_2$
, and
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20241108010952271-0447:S1474748023000518:S1474748023000518_eqn118.png?pub-status=live)
Now, we choose
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20241108010952271-0447:S1474748023000518:S1474748023000518_eqnu186.png?pub-status=live)
Clearly, Equation (7.18) holds and
$\Vert u_2\Vert _{L^{p_2}({{\mathbb R}^n})}, \Vert u_3\Vert _{L^{p_3}({{\mathbb R}^n})} \lesssim 1$
due to Lemma 4.3 and Equation (7.2). In addition,
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20241108010952271-0447:S1474748023000518:S1474748023000518_eqnu187.png?pub-status=live)
and the integral is controlled by
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20241108010952271-0447:S1474748023000518:S1474748023000518_eqnu188.png?pub-status=live)
by using Hölder’s inequality and the
$L^2$
boundedness of
$\mathcal {M}$
. It follows from Minkowski’s inequality and Lemma 4.5 that
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20241108010952271-0447:S1474748023000518:S1474748023000518_eqnu189.png?pub-status=live)
and this finally yields that
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20241108010952271-0447:S1474748023000518:S1474748023000518_eqn119.png?pub-status=live)
9.8 Proof of Lemma 7.7
For
$x\in B_k^l\cap B_P^l$
,
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20241108010952271-0447:S1474748023000518:S1474748023000518_eqn120.png?pub-status=live)
Since
$s>{n}/{p_1}+{n}/{2}$
, there exist
$0<\epsilon _0,\epsilon _1<1$
such that
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20241108010952271-0447:S1474748023000518:S1474748023000518_eqnu190.png?pub-status=live)
Choose
$t_1$
and
$t_2$
satisfying
$t_1>{n}/{p_1}$
,
$t_2>{n}/{p_2}$
and
$t_1+t_2=\big [ {n}/{p_1}+{n}/{p_2}\big ]+\epsilon _0$
, and let
$N_0:=\big [ {n}/{p_1}+{n}/{p_2}\big ]-n $
. Then Lemma 4.1, together with the vanishing moment condition (5.3), and the estimate (9.40) yield that
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20241108010952271-0447:S1474748023000518:S1474748023000518_eqnu191.png?pub-status=live)
where
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20241108010952271-0447:S1474748023000518:S1474748023000518_eqnu192.png?pub-status=live)
This deduces
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20241108010952271-0447:S1474748023000518:S1474748023000518_eqn121.png?pub-status=live)
Using Hölder’s inequality with
$\frac {1}{2}+\frac {1}{(1/p_2'-1/2)^{-1}}+\frac {1}{p_2}=1$
and Lemma 4.2, we see that
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20241108010952271-0447:S1474748023000518:S1474748023000518_eqnu193.png?pub-status=live)
because
$s-n-\epsilon _1=s-t_1-t_2-\epsilon _1+N_0+\epsilon _0$
,
$s-t_1-t_2-\epsilon _1>n(1/p_2'-1/2)$
. This shows that the integral in the right-hand side of Equation (9.41) is dominated by a constant times
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20241108010952271-0447:S1474748023000518:S1474748023000518_eqnu194.png?pub-status=live)
where
$\mathscr {B}_P^2(f_2)$
is defined as in Equation (9.19) and M is sufficiently large. Consequently,
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20241108010952271-0447:S1474748023000518:S1474748023000518_eqn122.png?pub-status=live)
Now, we are done with
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20241108010952271-0447:S1474748023000518:S1474748023000518_eqnu195.png?pub-status=live)
as
$\Vert u_{{\mathrm {i}}}\Vert _{L^{p_{{\mathrm {i}}}}({{\mathbb R}^n})}\lesssim 1$
,
${\mathrm {i}}=1,2,3$
, follow from Lemma 4.3, Equation (7.2) and the argument that led to (9.35) with
$t_1>n/p_1$
.
9.9 Proof of Lemma 7.8
Let
$s_1$
,
$s_2$
and
$s_3$
satisfy
$s_1>{n}/{p_1}-{n}/{2}$
,
$s_2>{n}/{2}$
,
$s_3>{n}/{2}$
and
$s=s_1+s_2+s_3$
. By mimicking the argument that led to Equation (9.37) with
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20241108010952271-0447:S1474748023000518:S1474748023000518_eqnu196.png?pub-status=live)
for
$x\in B_k^l\cap (B_R^l)^c$
and
$|x-y|\le 2^{-l}$
, instead of Equation (9.36), we can prove
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20241108010952271-0447:S1474748023000518:S1474748023000518_eqnu197.png?pub-status=live)
where
$J_{k,j,s}^1$
and
$\mathscr {B}_R^3(f_3)$
are defined as in Equations (9.38) and (9.26) for some
$L>n,s_3$
.
Now, let
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20241108010952271-0447:S1474748023000518:S1474748023000518_eqnu198.png?pub-status=live)
Then the estimate (7.21) is clear and it follows from Equations (9.39) and (7.1) and Lemma 4.4 that Equation (7.20) holds.
9.10 Proof of Lemma 7.9
Let
$0<\epsilon _0,\epsilon _1<1$
satisfy
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20241108010952271-0447:S1474748023000518:S1474748023000518_eqnu199.png?pub-status=live)
and select
$t_1,t_3$
so that
$t_1>{n}/{p_1}$
,
$t_3>{n}/{p_3}$
and
$t_1+t_3=\big [{n}/{p_1}+{n}/{p_3} \big ]+\epsilon _0$
. Let
$N_0:= \big [ {n}/{p_1}+{n}/{p_3}\big ]-n$
and
$B_R^3(f_3)$
be defined as in Equation (9.26). Then, as the counterpart of Equation (9.42), we can get
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20241108010952271-0447:S1474748023000518:S1474748023000518_eqnu200.png?pub-status=live)
where the embedding
$\ell ^2\hookrightarrow \ell ^{\infty }$
is applied. By taking
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20241108010952271-0447:S1474748023000518:S1474748023000518_eqnu201.png?pub-status=live)
9.11 Proof of Lemma 7.10
The proof is almost same as that of Lemmas 7.6 and 7.8. Let
$s_1$
,
$s_2$
and
$s_3$
be numbers such that
$s_1>{n}/{p_1}-{n}/{2}$
,
$s_2>{n}/{2}$
,
$s_3>{n}/{2}$
and
$s=s_1+s_2+s_3$
. We claim that for
$\eta =1,2,3$
,
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20241108010952271-0447:S1474748023000518:S1474748023000518_eqn123.png?pub-status=live)
where
$J_{k,j,s}^1$
,
$\mathscr {B}_P^2(f_2)$
and
$\mathscr {B}_R^3(f_3)$
are defined as in Equations (9.38), (9.19) and (9.26), respectively. Then we have Equation (7.25) with the choice
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20241108010952271-0447:S1474748023000518:S1474748023000518_eqnu202.png?pub-status=live)
The estimates for
$u_1,u_2,u_3$
follow from Equation (9.39), Lemma 4.3 and Lemma 4.4.
Now, we return to the proof of Equation (9.43). For
$x\in B_k^l\cap (B_P^l)^c\cap (B_R^l)^c$
and
$|x-y|\le 2^{-l}$
, we have
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20241108010952271-0447:S1474748023000518:S1474748023000518_eqn124.png?pub-status=live)
Then we have
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20241108010952271-0447:S1474748023000518:S1474748023000518_eqnu203.png?pub-status=live)
where
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20241108010952271-0447:S1474748023000518:S1474748023000518_eqnu204.png?pub-status=live)
Now, using the method similar to that used in the proof of Equation (9.37), we obtain Equation (9.43) for
$\eta =1$
.
For the case
$\eta =2$
, we use the fact, instead of Equation (9.44), that for
$x\in B_k^l\cap (B_P^l)^c\cap B_R^l$
and
$|x-y|\le 2^{-l}$
,
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20241108010952271-0447:S1474748023000518:S1474748023000518_eqnu205.png?pub-status=live)
This shows that
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20241108010952271-0447:S1474748023000518:S1474748023000518_eqnu206.png?pub-status=live)
where
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20241108010952271-0447:S1474748023000518:S1474748023000518_eqnu207.png?pub-status=live)
and then Equation (9.43) for
$\eta =2$
follows.
Similarly, we can prove that for
$x\in B_k^l\cap B_P^l\cap (B_R^l)^c$
and
$|x-y|\le 2^{-l}$
,
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20241108010952271-0447:S1474748023000518:S1474748023000518_eqnu208.png?pub-status=live)
where
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20241108010952271-0447:S1474748023000518:S1474748023000518_eqnu209.png?pub-status=live)
This proves (9.43) for
$\eta =3$
.
9.12 Proof of Lemma 7.11
We first note that
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20241108010952271-0447:S1474748023000518:S1474748023000518_eqn125.png?pub-status=live)
for
$x\in B_k^l\cap B_P^l\cap B_R^l$
. Since
${n}/{p}<s-\big ({n}/{2}-{n}/{p_2}-{n}/{p_3} \big )$
, there exist
$0<\epsilon _0,\epsilon _1<1$
such that
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20241108010952271-0447:S1474748023000518:S1474748023000518_eqnu210.png?pub-status=live)
Choose
$t_1$
,
$t_2$
, and
$t_3$
satisfying
$t_1>{n}/{p_1}$
,
$t_2>{n}/{p_2}$
,
$t_3>{n}/{p_3}$
, and
$t_1+t_2+t_3=\big [ {n}/{p}\big ]+\epsilon _0$
and let
$N_0:=\big [ {n}/{p}\big ]-n $
. Then it follows from Lemma 4.1 and the estimate (9.45) that
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20241108010952271-0447:S1474748023000518:S1474748023000518_eqnu211.png?pub-status=live)
where
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20241108010952271-0447:S1474748023000518:S1474748023000518_eqnu212.png?pub-status=live)
This deduces that
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20241108010952271-0447:S1474748023000518:S1474748023000518_eqn126.png?pub-status=live)
Since
$s-\big [{n}/{p} \big ]+{n}/{2}-\epsilon _0-\epsilon _1>\big ({n}/{2}-{n}/{p_2} \big )+\big ({n}/{2}-{n}/{p_3}\big )$
, there exist
$\mu _2$
and
$\mu _3$
such that
$\mu _2>{n}/{2}-{n}/{p_2}$
,
$\mu _3>{n}/{2}-{n}/{p_3}$
, and
$\mu _1+\mu _2=s-\big [ {n}/{p}\big ]+{n}/{2}-\epsilon _0-\epsilon _1$
. Using Hölder’s inequality with
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20241108010952271-0447:S1474748023000518:S1474748023000518_eqnu213.png?pub-status=live)
we have
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20241108010952271-0447:S1474748023000518:S1474748023000518_eqnu214.png?pub-status=live)
and then Lemma 4.2 yields that the preceding expression is less than a constant times
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20241108010952271-0447:S1474748023000518:S1474748023000518_eqnu215.png?pub-status=live)
because
$\mu _2>n(1/p_2'-1/2)$
and
$\mu _3>n(1/p_3'-1/2)$
, where
$\mathscr {B}_P^2(f_2)$
and
$\mathscr {B}_R(f_3)$
are defined as in Equations (9.19) and (9.26).
Now, the integral in the right-hand side of Equation (9.46) is dominated by a constant times
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20241108010952271-0447:S1474748023000518:S1474748023000518_eqnu216.png?pub-status=live)
and this is no more than
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20241108010952271-0447:S1474748023000518:S1474748023000518_eqnu217.png?pub-status=live)
where
$N_0+\epsilon _0+\mu _2+\mu _3=s-\frac {n}{2}-\epsilon _1$
. Hence, it follows that
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20241108010952271-0447:S1474748023000518:S1474748023000518_eqnu218.png?pub-status=live)
Now, let
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20241108010952271-0447:S1474748023000518:S1474748023000518_eqnu219.png?pub-status=live)
9.13 Proof of Lemma 8.1
Using the fact that
$\sum _{j\in {\mathbb {Z}}}\widehat {\Psi }(2^{-j}\vec {\boldsymbol {\xi }})=1$
for
$\vec {\boldsymbol {\xi }}\not =\vec {\boldsymbol {0}}$
, we can write
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20241108010952271-0447:S1474748023000518:S1474748023000518_eqn127.png?pub-status=live)
where
$\widetilde {\sigma _j}(\vec {\boldsymbol {\xi }}):=\sigma (\vec {\boldsymbol {\xi }})\widehat {\Psi }(2^{-j}\vec {\boldsymbol {\xi }})$
so that
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20241108010952271-0447:S1474748023000518:S1474748023000518_eqnu220.png?pub-status=live)
Moreover, due to the support of
$\widetilde {\sigma _j}$
,
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20241108010952271-0447:S1474748023000518:S1474748023000518_eqn128.png?pub-status=live)
Now, the left-hand side of Equation (8.3) is less than
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20241108010952271-0447:S1474748023000518:S1474748023000518_eqnu221.png?pub-status=live)
Let
$s_1,s_2,s_3$
be numbers such that
$s_1>n/p-n/2$
,
$s_2,s_3>n/2$
, and
$s=s_1+s_2+s_3$
. For
$x\in (Q^{***})^c\cap (B_k^l)^c$
and
$|x-y| \le 2^{-l}$
,
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20241108010952271-0447:S1474748023000518:S1474748023000518_eqnu222.png?pub-status=live)
In the same argument as in the proof of Equations (9.5) and (9.8), with Equation (4.8) replaced by Equation (4.9), we can get
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20241108010952271-0447:S1474748023000518:S1474748023000518_eqnu223.png?pub-status=live)
where
$I_{k,j,s}^{in}$
and
$I_{k,j,s}^{out}$
are defined as in Equaitons (9.4) and (9.9), respectively, and
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20241108010952271-0447:S1474748023000518:S1474748023000518_eqnu224.png?pub-status=live)
This yields that
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20241108010952271-0447:S1474748023000518:S1474748023000518_eqnu225.png?pub-status=live)
and thus Equation (8.3) follows from choosing
$u_2(x)=u_3(x):=1$
and
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20241108010952271-0447:S1474748023000518:S1474748023000518_eqnu226.png?pub-status=live)
Now, it is straightforward that
$\Vert u_1\Vert _{L^p({{\mathbb R}^n})}$
is less than
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20241108010952271-0447:S1474748023000518:S1474748023000518_eqnu227.png?pub-status=live)
and the
$L^p$
-norm in the preceding expression is less than
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20241108010952271-0447:S1474748023000518:S1474748023000518_eqnu228.png?pub-status=live)
where Equations (9.13) and (9.14) are applied in the penultimate inequality for sufficiently large M. This concludes that
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20241108010952271-0447:S1474748023000518:S1474748023000518_eqnu229.png?pub-status=live)
9.14 Proof of Lemma 8.2
Select
$0<\epsilon <1$
such that
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20241108010952271-0447:S1474748023000518:S1474748023000518_eqnu230.png?pub-status=live)
Then Lemma 4.1 yields that
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20241108010952271-0447:S1474748023000518:S1474748023000518_eqnu231.png?pub-status=live)
where we applied
$2^l\lesssim |x-{\mathbf {x}}_{Q_k}|$
for
$x\in B_k^l$
in the penultimate inequality and
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20241108010952271-0447:S1474748023000518:S1474748023000518_eqnu232.png?pub-status=live)
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20241108010952271-0447:S1474748023000518:S1474748023000518_eqnu233.png?pub-status=live)
Now, we claim that
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20241108010952271-0447:S1474748023000518:S1474748023000518_eqn129.png?pub-status=live)
Once Equation (9.49) holds, we obtain
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20241108010952271-0447:S1474748023000518:S1474748023000518_eqnu234.png?pub-status=live)
which implies (8.4) with
$u_2(x)=u_3(x):=1$
and
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20241108010952271-0447:S1474748023000518:S1474748023000518_eqnu235.png?pub-status=live)
Moreover,
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20241108010952271-0447:S1474748023000518:S1474748023000518_eqnu236.png?pub-status=live)
because
$N_p+n+\epsilon>n/p$
.
Therefore, it remains to show Equation (9.49). Indeed, it follows from Theorem D that
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20241108010952271-0447:S1474748023000518:S1474748023000518_eqnu237.png?pub-status=live)
For the other term, we use both Equations (9.47) and (9.48) to write
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20241108010952271-0447:S1474748023000518:S1474748023000518_eqnu238.png?pub-status=live)
Let
$s_1,s_2,s_3$
be numbers satisfying
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20241108010952271-0447:S1474748023000518:S1474748023000518_eqnu239.png?pub-status=live)
similar to Equations (9.30) and (9.31). Then, using the argument in Equation (9.33), we have
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20241108010952271-0447:S1474748023000518:S1474748023000518_eqnu240.png?pub-status=live)
where
$A_{j,Q_k}$
is defined as in Equation (9.32). This finally yields that
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20241108010952271-0447:S1474748023000518:S1474748023000518_eqnu241.png?pub-status=live)
for M and
$L_0$
satisfying
$M>L_0-s_1-n$
, which completes the proof of Equation (9.49).
Appendix A Bilinear Fourier multipliers
$(m=2)$
We remark that Theorem 1 still holds in the bilinear setting where all the arguments above work as well.
Theorem 2. Let
$0<p_1,p_2\le \infty $
and
$0<p\le 1$
with
$1/p=1/p_1+1/p_2$
. Suppose that
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20241108010952271-0447:S1474748023000518:S1474748023000518_eqnu242.png?pub-status=live)
where J is an arbitrary subset of
$\{1,2\}$
. Let
$\sigma $
be a function on
$({{\mathbb R}^n})^2$
satisfying
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20241108010952271-0447:S1474748023000518:S1474748023000518_eqnu243.png?pub-status=live)
and the bilinear analogue of the vanishing moment condition (1.16). Then the bilinear Fourier multiplier
$T_{\sigma }$
, associated with
$\sigma $
, satisfies
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20241108010952271-0447:S1474748023000518:S1474748023000518_eqnu244.png?pub-status=live)
for
$f_1,f_2\in \mathscr {S}_0({{\mathbb R}^n})$
.
The proof is similar, but much simpler than that of Theorem 1. Moreover, unlike Theorem 1, Theorem 2 covers the results for
$p_{j}=\infty $
,
$j=1,2$
, which follow immediately from the bilinear analogue of Proposition 3.2.
Appendix B General m-linear Fourier multipliers for
$m\ge 4$
The structure of the proof of Theorem 1 is actually very similar to those of Theorems C and D, in which
$T_{\sigma }(f_1,\dots ,f_m)$
is written as a finite sum of
$T^{\kappa }(f_1,\dots ,f_m)$
for some variant operators
$T^{\kappa }$
, and then
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20241108010952271-0447:S1474748023000518:S1474748023000518_eqn130.png?pub-status=live)
where
$\Vert u_{j}\Vert _{L^{p_{j}}({{\mathbb R}^n})}\lesssim \Vert f_{j}\Vert _{L^{p_{j}}({{\mathbb R}^n})}$
for
$1\le j\le m$
. Compared to the
$H^{p_1}\times \cdots \times H^{p_m}\to L^p$
estimates in Theorems C and D, one of the obstacles to be overcome for the boundedness into Hardy space
$H^p$
is to replace the left-hand side of Equation (B.1) by
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20241108010952271-0447:S1474748023000518:S1474748023000518_eqnu245.png?pub-status=live)
and we have successfully accomplished this for
$m=3$
as mentioned in Equation (1.20). One of the methods we have adopted is
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20241108010952271-0447:S1474748023000518:S1474748023000518_eqnu246.png?pub-status=live)
where
$2<\widetilde {r}<p_2,p_3$
and
$1/q+2/\widetilde {r}=1$
. Then we have
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20241108010952271-0447:S1474748023000518:S1474748023000518_eqnu247.png?pub-status=live)
by the
$L^{p_j}$
boundedness of
$\mathcal {M}_{\widetilde {r}}$
with
$\widetilde {r}<p_j$
. Such an argument is contained in the proof of Lemma 6.1. However, if we consider m-linear operators for
$m\ge 4$
, then the above argument does not work for
$p_2,\dots ,p_m>2$
. For example, it is easy to see that
$1/q + 3/\widetilde {r}$
exceeds
$1$
if
$\widetilde {r}>2$
is sufficiently close to
$2$
. That is, we are not able to obtain m-linear estimates for
$0<p_1\le 1$
and
$2< p_2, \cdots , p_m<\infty $
,
$m\ge 4$
. This is critical because our approach in this paper highly relies on interpolation between the estimates in the regions
$\mathscr {R}_1, \mathscr {R}_2, \mathscr {R}_3$
, which are trilinear versions of
$\{(1/p_1, \cdots , 1/p_m) : 0<p_1\le 1, \, 2< p_2, \cdots , p_m<\infty \}$
.
Acknowledgements
J.B. Lee is supported by NRF grant 2021R1C1C2008252. B. Park is supported in part by NRF grant 2022R1F1A1063637 and by POSCO Science Fellowship of POSCO TJ Park Foundation
Competing interests
The authors have no competing interest to declare.