A note on local smoothing estimates for fractional Schrödinger equations
Abstract.
We improve local smoothing estimates for fractional Schrödinger equations for .
1. Introduction
Let and . Consider the fractional Schrödinger equation
(1.1) |
The case corresponds to the Schrödinger equation. For , the solution of (1.1) can be written as
(1.2) |
Here, we use the notation . Denote the standard Bessel potential space by . For simplicity, we define satisfying .
Conjecture 1.1 (Local smoothing conjecture).
Fix a number . For , it holds that
(1.3) |
for every .
Let be the exponent for which the Fourier restriction problem for paraboloid in is verified in [HZ20]. Note that when this is the best exponent for the restriction problem. Our main theorem is as follows.
Theorem 1.2.
We consider in the range below
(1.4) |
For , it holds that
(1.5) |
for every .
Our strategy is to adapt the method in the Fourier restriction problem to the local smoothing. We remark that the case is already known. Actually, in the work of Rogers [Rog08], it is proved that the local smoothing estimate for Schrödinger equation follows from the restriction estimate for paraboloid. Thus, when , the recent restriction results in [HZ20] and [Wan18] already imply certain local smoothing estimates. However, for other , an analogous implication has not been discovered and our result is new. For the case , we adapt the ideas of [GOW21a] and improve the results in [GRY20] (Theorem 1.6), [GMZ20], and in [GOW21a] (Corollary 1.5). The case is slightly different from the case as the manifold associated to the operator has negative Gaussian curvature. We combine the ideas of [GO20] and [GOW21a], and improve the results in [RS10].
One of our main tools is the polynomial partitioning, which was introduced by Guth to the study of oscillatory integral operators in [Gut16] and [Gut18]. Another main tool is the polynomial Wolff axiom, which was first formulated by Guth and Zahl in [GZ18], and later proved by Katz and Rogers in [KR18]. Furthermore, a refined version called the nested polynomial Wolff axiom was verified independently in [HRZ19] and [Zah21]. What’s more, there is a stronger result which is a slice version of polynomial Wolff (see (3.69) and (5.17)). This result was implicitly proved in [Zah21], and we will use it in our proof.
In the appendix, we explore some connections between local smoothing estimates for the fractional Schrödinger equations and restriction type estimates. Our argument is based on the ideas in [GOW+21b], and it generalizes the result in [Rog08].
Organization of the paper. In Section 2, we reduce the local smoothing estimate to a localized estimate (2.8), and review the wave packet decomposition. In Section 3, we prove Theorem 1.2 for the model case , and later we will use similar arguments to prove it for other cases. In Section 4 and 5, we prove Theorem 1.2 for the case and , respectively. In the appendix, we study the relationship between the local smoothing and Fourier restriction estimates.
Notation.
-
•
Denote the ball of radius centered at in . We sometimes write or for provided that there will be no confusion. We also sometimes use and for and , respectively.
-
•
We write to mean that for any power , there is a constant such that
Acknowledgement. The authors would like to thank Andreas Seeger for helpful discussions on the case . The authors would also like to thank Shaoming Guo, Hong Wang and Ruixiang Zhang for valuable discussions on the appendix of this manuscript. C.O. was partially supported by the NSF grant DMS-1800274.
2. Preliminaries
In this section, we reduce the local smoothing estimate to the localized version of it. We also review the wave packet decomposition.
2.1. Some reductions
In this subsection, we do some reductions to make Theorem 1.2 more like a Fourier restriction problem.
We apply some change of variables and assume that the integral of runs over . We first consider functions whose Fourier support is on the annulus . For such , we will prove that
(2.1) |
Let us assume this inequality for a moment and prove Theorem 1.2. By the Littlewood-Paley decomposition, it suffices to show (1.5) for functions whose Fourier support is contained in the annulus . By a simple scaling argument, we have
(2.2) |
where
(2.3) |
Notice that the function has Fourier support in the unit ball. By applying (2.1) and a scaling argument, we obtain
(2.4) |
for every function whose Fourier support is in a ball of radius .
We have showed that (1.5) follows from (2.1). We can make a further reduction. By a standard localization argument (for example, see Lemma 8 of [Rog08] or Corollary 2.2 of [GMZ20]), it suffices to prove
(2.5) |
for every function whose Fourier support is on .
We will reformulate the inequality (2.5) using a different language in order to be consistent with the paper for the Fourier restriction problem. Let be a hypersurface in , represented by the graph of a function . Define the extension operator corresponding to the hypersurface by
(2.6) |
where . Notice that the hypersurface has all positive principal curvatures for the case , and it has principal curvatures with different signs for the case . Therefore, the inequality (2.5) follows from the following theorem.
Theorem 2.1.
Suppose that satisfies
(2.7) |
For , it holds that
(2.8) |
for every number and function supported in .
2.2. Wave packet decomposition
In this subsection, we review the wave packet decomposition.
Let . We consider a hypersurface and a function on . For any -dimensional ball , let us do wave packet decomposition of associated to this ball.
Take a collection of finitely overlapping balls of radius , and take a smooth partition of unity adapted to this cover, and write . We next cover by finitely overlapping balls of radius centered at . For each , let be a smooth partition of unity adapted to this cover. We now have the decomposition
(2.9) |
We want to make the summand compactly supported, so multiply a function , which is supported on and equal to one on -neighborhood of the support of . Since decays rapidly outside of a ball of radius centered at the origin, we have
(2.10) |
Define as the summand on the right hand side of (2.12). Denote by the center of the ball . Let be given, and define the tube by
(2.11) |
Define to be the collection of the tubes . If the set is empty, then we do not include this set in . We sometimes use the notation
(2.12) |
This finishes the wave packet decomposition on the ball .
We next consider the ball of radius centered at the point . Define and the collection of the tubes
(2.13) |
Define the phase function , and the wave packet
(2.14) |
Notice that we have the decomposition
(2.15) |
A key property of the wave packet is as follows. We refer to Proposition 2.6 of [Gut16] for the details.
Proposition 2.2.
For every , we have
(2.16) |
Therefore, on the ball , we have the wave packet decomposition
(2.17) |
and the function decays rapidly outside of the tube .
Next we discuss how to compare wave packets at different scales. Suppose that we have two scales . Consider balls . Given , define to be a collection of the tubes in satisfying that for every element there exists such that
(2.18) |
For every , we define
(2.19) |
The lemma below relates small wave packets to larger wave packets.
Lemma 2.3 (Lemma 5.2 of [HZ20]).
Given and ,
(2.20) |
3. The discussion of a model case: in
In this section, we prove Theorem 2.1 for the case and . The reason that we discuss this model case is to avoid irrelevant technical difficulties and shed light on our method. After we finish the proof of this model case, we will see in later sections that our method can be easily adapted to the proofs for other cases in Theorem 2.1. Actually, we classify them into two cases: in ; in any dimensions. Both cases have been studied in the setting of Fourier restriction problem. In later sections, we will derive the local smoothing estimates by combining the techniques in Fourier restriction problem and the method for the model case discussed in this section.
In this section, we assume our Fourier extension operator is
where . Our goal is to prove the following estimate.
Theorem 3.1.
For , we have
(3.1) |
for every number and function supported in .
3.1. Broad function
We follow [Gut16] to define the broad function.
Let be a finitely overlapping covering, where are -squares. We will later set . We consider a decomposition , where .
For , we say that is -broad for if:
We define to be if is -broad for and zero otherwise.
We will prove the following estimate for broad functions.
Theorem 3.2.
For any , there exists such that for every , we have
(3.2) |
Moreover, .
In the rest of this subsection, we quickly see how to prove (3.1) assuming Theorem 3.2. By interpolation, it suffices to prove
(3.3) |
We induct on . Assume (3.3) is true for radius . We first show the following rescaling lemma.
Lemma 3.3.
Assuming (3.3) is true for radius , then for any -square , we have
(3.4) |
Proof.
Since this parabolic rescaling argument is well-known, we only do the calculation for centered at the origin.
Let . We have
By change of variable, we have
Also, we have , . Since such that is -bounded, we have .
We divide into balls of radius . Since is supported in . For each such ball , by the hypothesis we have
Summing over , we get
Plugging in and noting that , we obtain
which finishes the proof. ∎
We continue the proof of (3.3). Recall and we set . By the definition of the broad function, we have
(3.5) |
As a result, we obtain
(3.6) |
Using Theorem 3.2, we can bound the first term by
if is large enough. For the second term, we apply Lemma 3.3 to obtain
(3.7) |
Here we use and we assume is large enough so that the negative power of cancels the implicit constant.
Combining things together, we proved (3.3).
In the remaining of the section, we prove Theorem 3.2. We choose . Without loss of generality, we can assume the wave packets of are contained in since those outside contribute little to the left hand side of (3.2). The proof includes several steps. First, we will do a one-step polynomial partitioning, where we will deal with three cases: cellular case, transverse case and tangent case. Next, we iterate the polynomial partitioning until we encounter the tangent case or the radius becomes small. Finally, we will combine the estimates from polynomial partitioning and the sliced polynomial Wolff estimate to derive our result.
3.2. One-step polynomial partitioning
First, we recall the polynomial partitioning lemma. Here we use the modified version which gives additional information on the radius of cells. For more details, we refer to [Wan18] page 10.
Lemma 3.4.
Let be a non-negative function on . Then for any , there is a non-zero polynomial of degree at most so that is a disjoint union of open sets , and the integrals agree up to a factor of 2. Moreover, the polynomial is a product of non-singular polynomials, and each set is contained in a ball of radius .
Take the parameters and .
Let us apply Lemma 3.4 to the function . Then there exists a non-zero polynomial of degree at most so that is a disjoint union of cells and so that for each ,
(3.8) |
Moreover, we can assume that is a product of non-singular polynomials.
Define the wall and the cells by
(3.9) |
Here, the superscript “” on indicates that we are doing the first polynomial partition. We have the following estimate
(3.10) |
We say that we are in the cellular case if the first term dominates the second term. Otherwise, we say that we are in the wall case.
Let us deal with the integral of the broad function on . We cover by balls of radius . For each , we will define tangent tubes and transverse tubes associated to .
Definition 3.5 (Tangent tubes).
Define to be the set of all tubes obeying the following conditions:
.
If is any non-singular point of lying in , then
(3.11) |
Recall that is the unit vector in the direction of the tube .
Definition 3.6 (Transverse tubes).
Define to be the set of all tubes obeying the following conditions:
.
There exists a non-singular point of lying in , so that
(3.12) |
Recall that is divided into squares of diameter . We apply the wave packet decomposition (2.15) to , so that
(3.13) |
We define
(3.14) |
For being a collection of these ’s, we define
(3.15) |
Define similarly. Lastly, we define the bilinear function
(3.16) |
We have the following lemma:
Lemma 3.7 (Lemma 3.8 of [Gut16]).
If and , then
(3.17) |
Here the summation is summing over the roughly subsets of the set of caps .
Now we plug (3.17) into (3.10) to obtain:
(3.18) |
There are three cases: If the first term on the right hand side dominates, we say we are in the cellular case; If the second term on the right hand side dominates, we say we are in the transverse case; If the third term on the right hand side dominates, we say we are in the tangent case.
3.2.1. Cellular case
Suppose that we are in the cellular case. Denote by the collection of the cells , and by the collection of the tubes in intersecting the cell . Notice that the cardinality of is comparable to . Define
(3.19) |
By Lemma 3.7 of [Gut16], for every , we have
(3.20) |
Since we are in the cellular case, we have
(3.21) |
Notice that by Lemma 3.2 of [Gut16], each tube can intersect at most many cells in , thus
(3.22) |
Since the cardinality of the cells is comparable to , by pigeonholing, we can take a sub-collection of the cells so that the cardinality of which is comparable to and for each in this sub-collection we have
(3.23) |
By abusing the notation, we still denote this sub-collection by . By (3.21) and (3.8), we have
(3.24) |
To indicate the relation between functions and cells, we write for any . For convenience, later we will drop the subscript to simply write for any .
3.2.2. Transverse case
Suppose that we are in the transverse case. We have
Choose the that maximizes the right hand side, so we have
(3.25) |
We set to be the collection of these cells . For , we write . Note that is the sum of a subset of wave packets of , so
(3.26) |
By Lemma 5.7 of [Gut18], each tube belongs to at most different sets , so we have
(3.27) |
3.2.3. Tangent case
Suppose we are in the tangent case, then
(3.28) |
We need the following estimate for the bilinear term.
Lemma 3.8 ((43) of [Gut16]).
(3.29) |
3.3. Iteration
In the last subsection, we work with the function in the cell and result in one the three cases. We will iterate this process in this subsection. We would like to state this iteration as an algorithm.
Algorithm 1 (Iteration of polynomial partitioning).
Suppose we begin with a function , a cell and a small number . By iteratively doing the polynomial partitioning, we have the following output:
There exists an integer () which denotes the total number of iteration steps. There is a function STATE which we use to record the state of each step:
(3.32) |
We stop at step because of one of the two reasons: either we first encounter the tangent state STATE()=tang, or the radius at step is small ( is as below).
At each step , , we have:
1. A radius which is defined recursively by
(3.33) |
We also set . Here are another two important parameters defined by
(3.34) | |||
(3.35) |
Note that we have
(3.36) | |||
(3.37) |
2. A set of cells such that each is contained in a -ball . Each has a unique parent . We denote this relation by
(3.38) |
Moreover we have the nested property for these cells. That is, for any cell , there exist unique such that
(3.39) |
3. A set of functions .
4. There are three possible cases for each step : cellular case, transverse case and tangent case. The outputs for each case are the following:
Cellular case: If cell, we have the following estimates:
(3.40) |
(3.41) |
(3.42) |
Transverse case: If trans, we have the following estimates:
(3.43) |
(3.44) |
(3.45) |
Tangent case: If tang, so , then we have the following estimates:
(3.46) |
(3.47) |
(3.48) |
(3.49) |
Proof.
The proof follows from the same idea as in the last subsection. Note that in the last subsection we have dealt with . We briefly explain how to pass from step to step .
Suppose we already obtained cells and functions
and note that each cell is contained in a ball of radius . Now, we fix a cell . We apply the same argument as in the last subsection, with replaced by , replaced by , replaced by . We just give a sketch here.
As in the Subsection 3.1, we still use -squares to cover and define the broad function . Apply polynomial partitioning to the function , then we obtain cells and a wall denoted by such that an inequality similar to (3.10) holds:
(3.50) |
To deal with the integral over wall, we cover by balls of radius . For each , similar to Definition 3.5 and 3.6, we can define the tangent tubes and transverse tubes associated to , but the tubes here are of dimensions . We also remark that we do wave packet decomposition for at scale . Similarly we can define the bilinear function as in (3.16).
We also have the following lemma which is similar to Lemma 3.7:
Lemma 3.9.
If and , then
(3.51) |
Summing over , we obtain
(3.53) |
There are three cases: If the first term on the right hand side dominates, we set STATE=cell; If the second term on the right hand side dominates, we set STATE=trans; If the third term on the right hand side dominates, we set STATE=tang.
When STATE=cell, we can find cells which is a subset of , and functions , so that similar to (3.23), (3.22) and (3.24), we have (3.40), (3.41) and (3.42).
When STATE=trans, we remark that (3.43), (3.44) and (3.45) are analogues of (3.26), (3.27) and (3.25).
When STATE=tang, we remark that (3.46) is an analogue of (3.31). (3.47) holds because each has only one child: in the tangent case. (3.48) is an analogue of (3.28). Also, (3.49) is an analogue of (3.30)
We also remark that the relations “” between cells in and cells in are apparently defined according to the polynomial partitioning process: we say if is obtained by doing polynomial partitioning to .
We finally remark that the subscript in is always less than , since , so the broad functions are always well-defined here. ∎
3.4. Put things together
As stated in Algorithm 1, the iteration stops due to one of the two reasons: STATE()=tang; .
Let us consider the case that the iteration stops due to the smallness of the radius . Iterating (3.42) and (3.45), we have
(3.54) |
Also note that the diameter of is , so
(3.55) |
By iterating (3.41) and (3.44) and noting , we have
(3.56) |
By iterating (3.40) and (3.43), we have the inequality for each . Since we assumed the wave packet of is contained in , we have is essentially supported in . By Hölder’s inequality, we have , so
(3.57) |
Next, we consider the case that STATE=tang. Similar to (3.55), we have
(3.59) |
By (3.49), we have
(3.60) |
We also have (3.56) and (3.57). But here in the tangent case, we need a new estimate of other than (3.57). We will obtain it using polynomial Wolff. Fix a cell . Let us first recall how we obtain from . We have the chain that indicates the relations between cells at different scales:
For , let be the ball of radius that contains . is obtained as follows. We do wave packet decomposition for in and choose a subset of wave packets of that are related to the cell . Then we define to be the sum of these chosen wave packets. We may denote by the set of these wave packets and write the relation as
(3.61) |
To compare wave packets at different scale, we need the following definition.
Definition 3.10.
For two tubes and with . We say if
(3.62) |
Now we define the tube set
(3.63) |
and the function
Since is concentrated in wave packets from , we have
Before proving an upper bound for , we state the polynomial Wolff estimate in . For its proof, we refer to [Wu20] (or Lemma 11.1 in [GJW21]).
Lemma 3.11 (Three dimensional polynomial Wolff).
Fix . Set . Let be a two-dimensional algebraic variety of complexity at most . Let be a ball contained in . We define
(3.68) |
Here, is the dilation of . We also define
Then for every , we have
(3.69) |
We are ready to prove the following estimate
Lemma 3.12.
For any , we have
(3.70) |
Proof.
From (3.67), we have by -orthogonality that Set
We claim that
(3.71) |
If it holds, then we use polynomial Wolff estimate that , and together with Hölder’s inequality, so that we obtain
(3.72) |
Now, we prove (3.71). From the notation (2.12), we can rewrite (3.66) as
(3.73) |
So,
(3.74) |
We show that the second term on the right hand side is negligible. Note that is supported in , and is essentially supported in , so is essentially supported in . By the definition of , we see that if , then . As a result, we proved that is negligible. Ignoring the negligible term, we have
(3.75) |
which finishes the proof. ∎
4. A proof for the case
In this section, we prove Theorem 2.1 for the case: has eigenvalues of different signs and . The strategy is very similar to that for . The main difference is, for the case , the surface has negative Gaussian curvature. When it comes to the restriction problem, the obstacles from this difference is well understood in [GO20]. We will simply combine the ideas therein with the ideas in Section 3. Since the main idea is already addressed in Section 3, we give only a sketch of the proof here.
We first make some reductions. As in the previous section, by discarding the contribution outside , we may assume that the wave packets of is contained in . Moreover, it suffices to prove (2.8) for polynomials of the form
(4.1) |
satisfying the condition
(4.2) |
Here, is a small number. Once we prove (2.8) for such polynomials, the general case follows by a simple application of Taylor’s theorem (see Section 2 of [GO20] for the details). Hence, we may assume that satisfies the condition (4.2) and aim to prove
(4.3) |
4.1. Broad-narrow reduction
We do broad-narrow reduction in this subsection. Since the surface has negative curvature, the broad-narrow reduction is more involved than that for the surface with positive curvature as we did in Section 3. We will follow the idea from [GO20].
4.1.1. Bad lines
Let be a small number given by
(4.4) |
Take a collection of points on the unit circle such that is a maximal -separated set. For every and with , let denote the line passing through the point with direction vector . Similarly, for every and with , let denote the line passing through with direction vector .
Let us now define bad lines. Suppose that a line is given. We define an affine transformation associated to the line in the following way. First, let be the action of translation that sends to the origin and let be the rotation mapping to the point . Define
(4.5) |
We write the polynomial as
(4.6) |
By the assumption (4.2), we see that . The line is called a bad line provided that
(4.7) |
We define a bad line for in a similar way, with the role of and in (4.6) and (4.7) exchanged. Take . Let denote the -neighborhood of and call it a bad strip. We denote the collection of all the bad strips by
(4.8) |
4.1.2. Broad function
Consider dyadic numbers
(4.9) |
Let . Define to be a collection of all dyadic squares with side length in a set . We sometimes use for .
For every , we say that is -broad if
(4.10) |
and
(4.11) |
for every . For and , we use the notation . We let denote the function which is if is an -broad point of and 0 otherwise.
We will prove the following estimate.
Theorem 4.1.
For every there exist dyadic numbers with
(4.12) |
and such that for every , we have
(4.13) |
Moreover, .
4.2. Proof of Theorem 2.1 for the negative curvature case
In this subsection, we prove (4.3) by assuming Theorem 4.1. By interpolation, it suffices to prove
(4.14) |
We use induction on the radius . Assume that (4.14) is true for radius . By isotropic and anisotropic rescaling, we can prove the following lemmas.
Lemma 4.2 (cf. Lemma 3.2 of [GO20]).
Suppose that . Under the induction hypothesis, for every square , we have
(4.15) |
The proof of the above lemma is essentially the same as that for Lemma 3.3. We leave out the details.
Lemma 4.3 (cf. Lemma 3.3 of [GO20]).
Suppose that . Under the induction hypothesis, for every , we have
(4.16) |
Sketch of the proof of Lemma 4.3.
The proof is essentially given in Lemma 3.3 of [GO20], so we only give a sketch here. For simplicity, assume that our strip is . We apply the rescaling . After the rescaling, becomes
(4.17) |
where is some function satisfying the conditions (4.1) and (4.2). Define the function and denote (4.17) by . We apply the change of variables on the physical variables , and obtain
(4.18) |
We decompose the rectangular box into smaller squares of sidelength , and apply the induction hypothesis on . Then (4.18) is bounded by
(4.19) |
By changing back to the original variables, the above term becomes
(4.20) |
This completes the proof. ∎
Let us continue the proof of (4.14). By the definition of the broad function, we obtain
(4.21) |
We raise both sides to the -th power, integrate over , replace the max by -norms, and obtain
(4.22) |
We apply Theorem 4.1 to the first term, apply Hölder’s inequality, and obtain
(4.23) |
provided that is large enough so that
(4.24) |
This takes care of the contribution from the first term. Let us bound the second term on the right hand side of (4.22). We first break our ball into smaller balls , and apply Lemma 4.2 with , and obtain
(4.25) |
Recall that . Hence, the second term is also harmless. The third term can be dealt with by following the same argument. We leave out the details. Let us move on to the fourth term. By Lemma 4.3, we obtain
(4.26) |
By Lemma 3.1 of [GO20], we have
(4.27) |
Notice that the term is harmless. Also, recall that . Combining all the information, we obtain the desired bound for the fourth term. This completes the proof of (4.14).
Now it suffices to prove Theorem 4.1, which we will discuss in the next section.
4.3. Proof of Theorem 4.1
In this subsection, we prove Theorem 4.1. Fix . Take the parameters and . Let be a large number depending on but independent of . We write . Here, is a ball of radius . Then we apply the wave packet decomposition to : . We sometimes write for . We follow the proof in Section 3.2, and obtain an inequality similar to (3.10):
(4.28) |
Define by
(4.29) |
By Lemma 4.2 of [GO20], for every , we have
(4.30) |
Cover the wall by balls of radius . Define and as in Definition 3.5 and 3.6. Define the functions and as in (3.14) and (3.15). Lastly, we define the bilinear function. Compared with (3.16), the bilinear function is more involved here.
(4.31) |
In the above formula, we use the notation “good pair” for which we didn’t give the definition in this paper. In fact, the definition is not important here because we will simply cite the following two lemmas as a black box. We refer to Section 3.2 of [GO20] for the definition of the “good pair” and more discussions.
Lemma 4.4 (Lemma 5.4 of [GO20]).
Suppose that satisfies
(4.32) |
for every . Then for every
(4.33) |
The summation runs over all possible collections of squares with sidelength . This summation does not play a significant role.
Lemma 4.5 ((5.127) of [GO20]).
(4.34) |
The above lemma is proved in (5.127) of [GO20], which is a consequence of the -estimate (Lemma 5.6 of [GO20]). We refer to the paper for the proof.
By Lemma 4.4, we have the counterpart of (3.18):
(4.35) |
The only difference between this inequality and (3.18) is that is replaced by . This does not make any change for the rest of the proof. Note that the bilinear function also has the nice estimate (4.34) as a counterpart of (3.29).
So far, we have finished the part of the proof corresponding to Section 3.1 and Section 3.2. For each main estimate in Section 3.1 or Section 3.2, we can find in this section its counterpart which has been adapted to the negative curvature setting. What remains is to do iteration as we did in Section 3.3. Although we are in the negative curvature setting, we can follow the arguments in Section 3.3 line by line to finish the proof of Theorem 4.1. We do not reproduce it here.
5. A proof for the case
In this section, we prove that when the surface has positive principle curvatures we have
(5.1) |
for every . Using Bourgain-Guth’s broad-narrow reduction in [BG11], (5.1) boils down to the following -broad estimate
(5.2) |
where the -broad norm is defined in [Gut18] Page 86. The reduction from (5.1) to (5.2) is quite standard, and we refer to [Gut18] Section 9 for details.
The main estimate is as follows.
Theorem 5.1.
Let and
(5.3) |
Then for every and , we have
(5.4) |
Before we start the proof, let us recall some notations from [HZ20].
Definition 5.2.
A grain is defined to be a pair where is a transverse complete intersection and is a ball of radius . A multigrain is an tuple of grains
(5.5) |
satisfying
-
(1)
for ,
-
(2)
,
-
(3)
.
Definition 5.3.
Let be a multigrain with
(5.6) |
Define to be a sub-collection of for which element satisfies the following nested tube hypothesis: there exists for such that
-
(1)
,
-
(2)
,
-
(3)
hold for all .
The proof of Theorem 5.1 is based on an algorithm of polynomial partitioning. Let us state it below.
Algorithm 2 ([HZ20] page 9).
Inputs: Fix and let be a smooth function satisfying
(5.7) |
Then we have the following Outputs:
a finite collection of open subsets of of diameter at most .
A codimension () and an integer parameter .
An -tuple of:
-
(1)
Scales satisfying
-
(2)
Large parameters .
For a family of level multigrains. Each has multiscale .
For an assigmment of a function to each .
The above data is chosen so that the following properties hold:
-
(1)
Define . Then
(5.8) -
(2)
(5.9) -
(3)
For
(5.10) where .
- (4)
This finishes the statement of the algorithm. We are now ready to prove Theorem 5.1. Since has radius at most , we have
(5.13) |
Combining this inequality with (5.8) and (5.9), we have
(5.14) |
In order to estimate , we will apply (5.10) and (5.12), and combine them with the following lemma. This lemma plays a role of the counterpart of Lemma 4.3 of [HZ20].
Lemma 5.4.
For ,
(5.15) |
The main ingredient of the proof of Lemma 5.4 is the nested polynomial Wolff.
Lemma 5.5 (Nested polynomial Wolff).
Fix and so that . Let be semi-algebraic sets of complexity at most such that for each , is a manifold with codimension contained in . We recursively define another sequence of sets . Set . For each , define
(5.16) |
We also define
Then for every , we have
(5.17) |
Remark 5.6.
This is a higher dimensional version of Lemma 3.11. One minor difference is that the constant here behaves badly when the complexity is big, so in order to apply this lemma we have to set as an absolute constant that only depends on .
Since the proof of Lemma 5.5 is implicitly contained in [Zah21], we just sketch the proof here. First, by (2.33) in [Zah21], we have the estimate
Next, we follow the proof of Lemma 2.6 in [Zah21] where we set to be . From (2.17) in [Zah21] where we set and , we obtain (5.17). We are ready to prove Lemma 5.4.
Proof of Lemma 5.4.
The proof is the same as that for Lemma 3.12. Set
(5.18) |
We see that is essentially supported in , so
(5.19) |
By (5.10), (5.12), and the above lemma, we have
(5.20) |
for all . We take a geometric average over with weight . Then
(5.21) |
where for and . Applying this inequality to the right hand side of (5.14), we obtain
(5.22) |
Here and are given on page 12 of [HZ20]. Following the same optimization process therein gives the desired bound (5.4). We do not reproduce it.
6. Appendix: Approach using pseudo-conformal transformation
In this section, we briefly explain how the pseudo-conformal transformation can be applied to local smoothing problems. Similar ideas date back to [Car92], [Rog08].
Define a “restriction type” operator by
(6.1) |
for . Here, is a compactly supported smooth function.
Conjecture 6.1 (Restriction type conjecture).
For , , and , it holds that
(6.2) |
Notice that when , this conjecture follows from the restriction conjecture for a paraboloid by the Taylor’s theorem on the function . In [Rog08], it is proved that the restriction estimate for a paraboloid implies a local smoothing estimate for the Schrödinger equation. The goal of this section is to generalize his theorem to the general fractional Schrödinger equations.
Theorem 6.2.
The wave packets of behave very similarly to that for a restriction operator for paraboloid. It looks very plausible to prove Theorem 1.2 for the case by using the above theorem and following the arguments in [GOW+21b]. On the other hand, for the case , the operator behaves differently from that for the case —the manifold associated with the operator has a negative Gaussian curvature. In particular, the operator does not seem to have a transverse equidistribution property, which is a key ingredient in [GOW+21b]. Even though the restriction estimate for surfaces with negative Gaussian curvature is well understood in [GO20] and [BMV20], the arguments therein do not simply rely on the properties of wave packets. Thus, it is not straightforward to the authors whether their ideas can be applied to the operator . We do not explore in this direction here.
Sketch of the proof of Theorem 6.2.
Recall that in Section 2 we showed that (1.3) follows by (2.5). So it remains to prove
(6.3) |
for whose Fourier support is contained in the annulus . By plugging a smooth cutoff function with a suitable support ( on the annulus and is supported on a slightly thicker annulus), we may write
(6.4) |
In this way, we can write
(6.5) |
where the kernel is defined as
(6.6) |
Since is a smooth function, it follows that decays rapidly outside . Hence one can assume that is supported in an ball in without loss of generality.
Let us rewrite the kernel as
(6.7) |
Note that this kernel decays rapidly for on the region . Hence, we may assume that . In particular, since is restricted to the range , one can assume . For simplicity, let us introduce the notation . Define the phase function . Then
(6.8) |
and this function vanishes only at . By the method of stationary phase (see Theorem 7.7.5 of [H0̈3]) and considering only the main term (the other terms can be handled similarly), one can pretend that
(6.9) |
Simple calculation gives
(6.10) |
The factor can be treated as 1 after using some scaling on the variable . So, our operator can be morally written as
(6.11) |
where .
Now let us prove (6.3). Via (6.11), what we need to prove becomes
(6.12) |
Define
(6.13) |
so that
(6.14) |
Employing the pseudo-conformal transformation , we have
(6.15) |
Note that
(6.16) |
where and is the extension operator (6.1). We apply some rescaling on the physical variables: and on the frequency variables: . After this rescaling, we obtain
(6.17) |
The hypothesis (6.2) gives
(6.18) |
Combining all the inequalities (6.15), (6.17), and (6.18), we finally get
(6.19) |
This completes the proof of (6.12), and thus, the proof of Theorem 6.2. ∎
References
- [BG11] Jean Bourgain and Larry Guth. Bounds on oscillatory integral operators based on multilinear estimates. Geom. Funct. Anal., 21(6):1239–1295, 2011.
- [BMV20] Stefan Buschenhenke, Detlef Müller, and Ana Vargas. Fourier restriction for smooth hyperbolic 2-surfaces. preprint, arXiv:2010.10449, 2020.
- [Car92] Anthony Carbery. Restriction implies Bochner-Riesz for paraboloids. Math. Proc. Cambridge Philos. Soc., 111(3):525–529, 1992.
- [GJW21] Shengwen Gan, Yifan Jing, and Shukun Wu. New bounds for Stein’s square function in . preprint, arXiv:2104.14731, 2021.
- [GMZ20] Chuanwei Gao, Changxing Miao, and Jiqiang Zheng. Improved local smoothing estimate for the fractional schrödinger operator, 2020.
- [GO20] Shaoming Guo and Changkeun Oh. A restriction estimate for surfaces with negative gaussian curvatures, 2020.
- [GOW21a] Shengwen Gan, Changkeun Oh, and Shukun Wu. New bounds for stein’s square functions in higher dimensions. preprint, arXiv:2108.11567, 2021.
- [GOW+21b] Shaoming Guo, Changkeun Oh, Hong Wang, Shukun Wu, and Ruixiang Zhang. The Bochner-Riesz problem: an old approach revisited. preprint, arXiv:2104.11188, 2021.
- [GRY20] Shaoming Guo, Joris Roos, and Po-Lam Yung. Sharp variation-norm estimates for oscillatory integrals related to Carleson’s theorem. Anal. PDE, 13(5):1457–1500, 2020.
- [Gut16] Larry Guth. A restriction estimate using polynomial partitioning. J. Amer. Math. Soc., 29(2):371–413, 2016.
- [Gut18] Larry Guth. Restriction estimates using polynomial partitioning ii. Acta Math., 221(1):81–142, 09 2018.
- [GZ18] Larry Guth and Joshua Zahl. Polynomial Wolff axioms and Kakeya-type estimates in . Proceedings of the London Mathematical Society, 117(1):192–220, 2018.
- [H0̈3] Lars Hörmander. The analysis of linear partial differential operators. I. Classics in Mathematics. Springer-Verlag, Berlin, 2003. Distribution theory and Fourier analysis, Reprint of the second (1990) edition [Springer, Berlin; MR1065993 (91m:35001a)].
- [HRZ19] Jonathan Hickman, Keith M Rogers, and Ruixiang Zhang. Improved bounds for the Kakeya maximal conjecture in higher dimensions. arXiv preprint arXiv:1908.05589, 2019.
- [HZ20] Jonathan Hickman and Joshua Zahl. A note on fourier restriction and nested polynomial Wolff axioms. arXiv:2010.02251, 2020.
- [KR18] Nets Hawk Katz and Keith M. Rogers. On the polynomial Wolff axioms. Geometric and Functional Analysis, 28(6):1706–1716, 2018.
- [Rog08] Keith M. Rogers. A local smoothing estimate for the Schrödinger equation. Adv. Math., 219(6):2105–2122, 2008.
- [RS10] Keith M. Rogers and Andreas Seeger. Endpoint maximal and smoothing estimates for Schrödinger equations. J. Reine Angew. Math., 640:47–66, 2010.
- [Wan18] Hong Wang. A restriction estimate in using brooms. arXiv:1802.04312, 2018.
- [Wu20] Shukun Wu. On the Bochner-Riesz operator in . preprint, arXiv:2008.13043, 2020.
- [Zah21] Joshua Zahl. New Kakeya estimates using Gromov’s algebraic lemma. Advances in Mathematics, 380:107596, 2021.