An improved restriction estimate in
Abstract.
We improve the restriction estimate in to the range , based on some Kakeya type incidence estimates and the refined decoupling theorem.
1. Introduction
Let be a function supported in the two-dimensional unit ball . Denote by be the extension operator
(1.1) |
where . The following conjecture was made by Stein, which is known as (Stein’s) restriction conjecture (for paraboloid).
Conjecture 1.1 (Restriction conjecture in ).
Suppose . Then for any ,
(1.2) |
Conjecture (1.1) was first proved for by Tomas and Stein. In 1991, by relating it to the Kakeya problem, Bourgain improved the range to in the milestone work [Bou91]. In 2002, Tao [Tao03] improved (1.2) to using a two-ends argument, which was introduced by Wolff [Wol01] a bit earlier. Then in 2010, Bourgain-Guth [BG11] further improved the range to via a broad-narrow decomposition. More recently, Guth [Gut16] brought ideas from incidence geometry, the polynomial partitioning, and improved (1.2) to the range . The best known result so far was due to the first author [Wan22], showing (1.2) for by combining the polynomial partitioning technique and the two-ends argument, and exploring a so-called broom structure.
We give another small improvement based on some Kakeya estimates and the refined decoupling theorem.
Theorem 1.2.
The restriction estimate (1.2) is true for .
Using an epsilon removal argument by Tao [Tao99], it suffices to prove that for any and , there exists a constant such that the following holds: for ,
(1.3) |
For any -ball in , let . In the paper we will prove
(1.4) |
where . Note that (1.4) implies (1.3) by (restricted type) real interpolation, and hence Theorem 1.2.
Bourgain [Bou91] originates the idea of studying the restriction problem using wave packets. A wave packet serves as a building block for , and is essentially supported in a long thin tube. To this end, it is important to understand how different wave packets interact with each other. An effective tool to understand the interaction is the polynomial partitioning introduced by Guth [Gut16]. Broadly speaking, polynomial partitioning (iteration) allows one to partition the space into cells, so that in each cell contributes roughly the same, and there is a certain algebraic constraint among all the cells that controls their interaction via wave packets. In addition to this algebraic constraint, the oscillation of wave packets also plays an important role, which is usually handled by induction on scales.
The main idea of this paper is to apply a refined Wolff’s hairbrush estimate (at two different scales) to bound the number of tubes through each cell when the cells are relatively concentrated and apply the refined decoupling theorem ([GIOW20] and independently by Du and Zhang) when the cells are spread-out.
Let us briefly explain the refined Wolff’s hairbrush estimate. Let be a set of -tubes that has less than tubes in each -separated direction. A shading is a map such that . Suppose for each . The refined Wolff’s hairbrush estimate says that if the shading on each tube is “two-ends”, then for a typical point in , the multiplicity is , improving upon Wolff’s original bound
Our proof is based on the framework built in [Wan22]. Morally speaking, after polynomial partitioning, the cells are organized into a collection of fat surfaces , which is the –neighborhood of a (low degree) algebraic surface intersecting a ball of radius , for some
If , then it is already proved in [Wan22] that the restriction estimate holds for , which is better than what we currently prove.
If , then we observe that the wave packets of need to be “sticky”, otherwise we can obtain improved “broom estimate”. Here “sticky” means that the wave packets pointing in nearby directions (within an -directional cap) are contained in a small number of parallel -tubes. In this case, we apply the aforementioned refined hairbrush bound to the set of -tubes and conclude that the number of those tubes through each is small, which is an improvement over the polynomial Wolff axiom.
The case when is more involved. Roughly speaking, if the cells (who have a small diameter ) are spread-out among many -balls, then we apply refined decoupling estimate. Otherwise, we apply the bilinear restriction estimate locally and then use a square function to control all local contributions. The square function will further be estimated using the refined hairbrush bound.
Organization of the paper. The paper is organized as the following: Section 2 contains several technical results, for instance, pruning of wave packets, a refined Wolff’s hairbrush estimate. We also review the polynomial partitioning in this section. Section 3 and 4 contains some quantitative two-ends reductions. In Section 5 we deal with the case and the case is discussed in Section 6.
Acknowledgement. We would like to thank Larry Guth and Ruixiang Zhang for helpful discussions on Lemma 2.6. The second author would like to thank Xiaochun Li for discussions about Lemma 2.8, and would like to thank Nets Katz for discussions about Lemma 2.11.
Notations:
We normalize in the whole paper.
We use to denote the diameter of a small ball in (or a small cap on the paraboloid). Sometimes when we say is a “scale-” directional cap, we mean . Denote by the collection of scale- directional caps. The letter is reserved for -balls (scale- directional caps).
We write if for all small .
We write if for some absolute constant .
Let be a binary relation. To avoid abundant notations that handle rapidly decreasing terms, if are two real numbers, then in this paper may occasionally (when Schwartz tails appear) mean
(1.5) |
For a set we define .
Here are some numerical factors we will use in the paper: is a large constant depending on , , , .
2. Preliminary tools and lemmas
2.1. Wave packet and its pruning
The scale- wave packet decomposition is
(2.1) |
where is a collection of finitely overlapping -balls in and is a bump function associated to ; and is a smooth partition of unity of with compact Fourier support. Such wave packet decomposition can be found in [Wan22] Section 2 (see also [Gut16] Section 2).
Here is a key feature of wave packets: Given a function in , if is supported in on a unit ball, then is essentially constant (in the sense of averaging) for any unit ball . That is, one would expect for any (see for instance, [Wan22] Lemma 2.6, 2.7). This leads to the following observation: is essentially constant on every scale- tube in the form
(2.2) |
where is the center of , and is any point in (for example, ).
What follows is a pruning of scale- wave packets of the function . Let us introduce scales:
(2.3) |
with . The pruning of will be proceeded from the smallest scale to the biggest scale . First let us prune wave packets at the smallest scale . By dyadic pigeonholing, we can find a dyadic number so that
-
(1)
There is a corresponding scale- directional set , and for each , a scale- tube set . Denote also .
-
(2)
Uniformly for each ,
(2.4) -
(3)
For each , are about the same up to a constant multiple.
-
(4)
The norm of the sum of wave packets dominates the norm of , in the sense that .
Define be the pruned function at the smallest scale . This is the pruning at the first step.
Next, suppose there is a pruned function at scale , we would like to prune it at scale . By dyadic pigeonholing, there are dyadic numbers , and a collection of fat tubes so that
-
(1)
Any two either are parallel, or make an angle .
-
(2)
Each contains many fat tubes in .
-
(3)
For each directional cap with , there are either parallel fat tubes pointing to this direction, or no tubes at all.
-
(4)
The above two items imply that for any with direction ,
(2.5) -
(5)
.
Define be the pruned function at scale . We remark that although the pruning at scale may destroy some uniform structure at scale with (for example, the fact that at scale there are parallel fat tubes may no longer be true. Instead, there will be parallel fat tubes), the upper bound estimate (2.5) still remains true for all , namely, for every with and every fat tube that points to .
The pruned function at the biggest scale is the one we will carefully study in the rest of the paper. For simplicity, we still denote by an abuse of notation. Let us emphasize some properties of the new :
- (1)
-
(2)
We have for each directional cap and ,
(2.6)
2.2. Broad-narrow reduction
The broad-narrow reduction was introduced in [BG11]. Specifically, partition the unit ball into cubes such that , where is a large number but is also small compared to , for example, . Here is the formal definition of broadness (2-broad).
Definition 2.1 ([Gut16]).
Given and any , we define as the largest number in . That is,
(2.7) |
Eventually we will choose . Roughly speaking, the broad-narrow reduction allows us to focus on those points where considerably many make major contribution to . A similar definition is given in [Wan22] Section 2.2. After the broad-narrow reduction (see for instance [Gut16]), we only need to consider the -norm .
2.3. Polynomial partitioning
Let us recall the polynomial partitioning introduced in [Gut16]. One can use Corollary 1.7 in [Gut16] with a given degree to partition the measure . The outcomes are
-
(1)
A polynomial of degree .
-
(2)
A collection of disjoint cells with such that
(2.8) -
(3)
are about the same up to a constant multiple for all .
-
(4)
We can refined the polynomial partitioning a little bit to get an extra information on each : is contained in an -ball in . This refinement was obtained in [Wan22].
Now we introduce a wall , which is a thin neighborhood of the variety :
(2.9) |
Define for each a smaller cell and let . One advantage for looking at the smaller cell is that any tube of dimensions can only intersect at most cells in .
The decomposition above leads to a partition
(2.10) |
and hence an estimate
(2.11) |
If the first term in (2.11) dominates, then we say “we are in the cellular case”. Let be the sum of wave packets that intersect . A crucial fact is
(2.12) |
This yields, supposing that we are in the cellular case,
(2.13) |
If the second term in (2.11) dominates, then we say “we are in the algebraic case”. In this case we will divide wave packets into a transversal part and a tangential part. Introduce a collection of -balls in . For each , we define as the portion of the wall inside :
(2.14) |
and call it an “algebraic fat surface”. Then we define a tangential function and a transverse function for each . Roughly speaking, the tangential function contains all the wave packets that the -tube is -tangent to at each point of , and the transverse function contains all the remaining wave packet. Here is the formal definition of tangential tubes:
Definition 2.3 ([Gut16], Definition 3.3).
The collection of tangential tubes is the set of tubes obeying the following two conditions:
-
.
-
If is any non-singular point of lying in , then
(2.15)
Hence inside we have
(2.16) |
which gives that for ,
(2.17) |
One can iteratively use the polynomial partitioning above for either cellular case and algebraic case to obtain a “tree” structure.111We do not break the algebraic case into transverse case and tangent case when performing the iteration. This is different from the iteration (induction) given in [Gut16]. Each node of this tree is either a cellular cell or an algebraic cell. Note that in either cellular or algebraic case, the diameter of each resulting cell is strictly decreasing (decrease by either or ). The iteration will stop when the diameter of each cell is smaller than . A cell that appears the last step of the iteration is called a “leaf”. Here is a summary of this iteration:
Lemma 2.4 ([Wan22] Lemma 3.3).
For a function supported in , there is a tree structure of height satisfying the followings:
-
(1)
The root of the tree is .
-
(2)
For each , the children of a node of depth are some subsets of , and each lies in a ball of radius . The radius is called the scale of , and the radii are the same for all of depth . Moreover, there is a collection of -tubes associated to each .
-
(3)
There is a number and indices such that each node of depth is a portion of a fat -surface, and . Here by a fat -surface we mean a thin neighborhood , where is a union of smooth algebraic surfaces with , and is an -ball. To emphasis that is a portion of a fat surface, we denote and let be the collection of all .
-
(4)
The sets are finitely overlapping.
-
(5)
Let . For each we have
(2.18) as well as
(2.19) where the sum is over all nodes in the tree of depth .
-
(6)
If , then for each node of depth , a -tube intersects children of .
-
(7)
Denote by the collection of leaves in the tree . Then all sets in are disjoint.
The algebraic cases in the iteration are very important to us. Note that for a leaf , there are unique algebraic fat surfaces , so that is within a containing chain
(2.20) |
Besides the outcomes from Lemma 2.4, we are in particular interested in some pointwise estimates similar to (2.12) and (2.17). Note that for any and any ancestor of that , by (2.12) one has
(2.21) |
Here we use the convention and .
We know that is essentially a sum of scale- ( is the scale of ) wave packets, which are determined by tubes from, say . The dimensions of the tubes in are roughly . For any subcollection , define as the function concentrated on wave packets from . Recall (2.17). The pointwise equality (2.21) further yields that
(2.22) |
If all are small, then similar to (2.12) we also have . To find out when are small, we want to compare with . It is hard to get something meaningful for general , while if is either a collection of transverse tubes or a collection of tangent tubes with respect to an algebraic fat surface , it was showed in [Wan22] Lemma 10.2 that
(2.23) |
for any .
This crucial fact gives that for any fat surface and (see Definition 2.1 for ), if for all , then
(2.24) |
where is the collection of tangent tube corresponding to the algebraic fat surface (note that and see also Lemma 3.10 in [Wan22]). We remark that (2.23) and (2.24) also hold for replaced by , where is a function similar to that will be given later in (4.6).
Remark 2.5.
The notations here are slightly different from the notations in [Wan22] (in particular, Lemma 3.7 in [Wan22]). We continue to use to denote the tangential function one obtained for the fat surface in polynomial partitioning iteration. While means in [Wan22], which essentially refers to restricting the original function to the wave packets from .
We know by definition that tubes from are contained in the fat surface with some scale . While more is true because we are looking at the broad norm on . Roughly speaking, the following lemma allows us to assume that tubes in are contained in the -neighborhood of planes.
Lemma 2.6.
There exist a collection of planes so that if we let be the subcollection that each -tube is contained in the -neighborhood of some planes in , then
(2.25) |
Proof.
Recall that , where is a finite union of transverse complete intersections, each of which has degree at most , and is an -ball containing . Partition into finitely overlapping -balls . Denote by the subcollection of tubes in that intersects :
(2.26) |
By Definition 2.3, there is a plane so that tubes in are all contained in a fat plane . We are interested in the intersection . Our (heuristic) goal is to prove the following dichotomy: either , or (see Definition 2.7 for ). Note that the latter case cannot happen for too many almost distinct . Otherwise it would violate , which is given by Wongkew’s theorem.
Let be a point. After rotation and translation, let us assume that is the origin and is the vertical plane . The following set parameterizes a -tube whose center is and direction is :
Here is a small absolute number (for example, =1/100). By some appropriate rigid transform, we can assume that all tubes from have a parameterization . Consider the set ( is roughly a -tube in )
(2.27) |
This set basically contains the union of tubes in that intersect and is -tangent to the vertical plane ( is morally ).
Denote the parameter spaces
(2.28) |
We claim that is semialgebraic with complexity at most . In fact, if consider the following two sets
(2.29) |
and
(2.30) |
then is the complement of in , where is the projection . By Tarski’s projection theorem (see [KR18]), has complexity , hence so is .
Let be the interval that parameterizes directions in the vertical plane . Consider the projection and , . Let . By Tarski’s projection theorem again, the projection is a semialgebraic set of complexity . Hence is a union of disjoint intervals (a point is an interval of length zero). Notice that if is large enough, then the “broad number” (see Definition 2.1) is much larger than the number of intervals .
Suppose . Then by the definition of -norm (Definition 2.1) we know that there are at least tubes coming from -separate directions that intersect , hence the origin. Since is larger the the number of intervals , there is at least one interval with . The pull back is a union of -tubes rooted at , each of which is -tangent to the vertical plane. Hence
(2.31) |
Now we claim that there exists planes , each of which is some plane , so that is contained in the union . Note that this is enough to prove our lemma.
Suppose on the contrary that cannot be covered by less than fat planes where . Let . In particular, it means that for , . Hence
(2.32) | ||||
However, Wongkew’s theorem gives , yielding a contradiction. ∎
2.4. Broom
As mentioned in the previous subsection, we obtain a tree after running the polynomial partitioning iteration for . Also we have
(2.33) |
In [Wan22], a relation “” between -balls () and -tubes was introduced to make use of the broom structure. Roughly speaking, a scale- tube is related to an -ball if the wave packet is associated to a significant amount of fat algebraic surfaces inside . The formal definition of the relation is given in [Wan22] Section 6. Using this relation, for fixed , we can define a related function , which is the sum all the wave packets that is related to , and similarly for a unrelated function . In other words, for a fixed ball if we define (recall (2.4))
(2.34) |
as well as
(2.35) |
then
(2.36) |
There is a broom estimate (2.37) for the unrelated function , which roughly says that the -tubes rooted at a fat surface are only a small portion of all the -tubes with similar directions. Indeed, suppose is fat surface at scale (see Lemma 2.4 for and ) and is the collection of -tubes inside with direction . Then
(2.37) |
where is an fat tube containing , pointing to the direction , and is the -ball containing that we obtained from the polynomial partitioning iteration. One can compare (2.37) with the broom estimate (7.12) in [Wan22]. Note that compared to the right hand side of (7.12) in [Wan22], the right hand side of (2.37) is integrated in a smaller region . This extra information is in fact given readily from the proof of Lemma 7.2 in [Wan22], since those -tubes associated to (that is, for some , and the directional cap of is contained in ) are all contained in .
Recall the wave packet pruning in Section 2.1. Suppose and suppose but for some scale in (2.3). Then as a consequence of (2.6) and (2.37),
(2.38) |
Comparing (2.38) to (7.12) in [Wan22], there is an extra gain .
Remark 2.7.
Let and . We remark that , the sum of a subcollection of unrelated wave packets, still satisfies the broom estimates (2.37) and (2.38) (with replaced by ). Indeed, the broom estimate (2.37) follows from the ingredient: Suppose is concentrated on , a broom rooted at containing scale- wave packets (see Definition 5.4 in [Wan22] for a broom). Then inside there are at least scale- wave packets in (recall (2.4)). Hence by Lemma 5.10 in [Wan22] we have (2.37).
In Section 3, we will introduce a new relation “” among the -tubes and the -balls based on some Kakeya structures. Eventually for each -ball , we will define an “ultimate” unrelated function—the sum of wave packets that as well as . This unrelated function enjoys both the broom estimate (2.38) (see Remark 2.7) and some additional Kakeya estimates.
2.5. A “planar” bilinear estimate
The main result in this subsection (Lemma 2.8) is essentially two-dimensional. While for our later purpose, we instead state it under the three-dimensional setting.
Suppose that is a truncated planar curve with positive two-dimensional second fundamental form. Suppose also that are two sub-curves with . Let be two large numbers. The classical bilinear theory says that if , are two functions whose Fourier transforms are supported in , respectively, then (see also (2.44))
(2.39) |
where with the plane being parallel to the planar curve .
Lemma 2.8.
Let be defined at the beginning of this subsection, and let be a collection of disjoint -balls contained in ( was introduced below (2.39)) with . Let be that are about the same up to a factor of for all , and that . In addition, the decomposition of in (2.42) satisfy the uniform-incidence assumption (2.43). Then
(2.40) |
Proof.
By Hölder’s inequality and the bilinear estimate (2.39) one has
(2.41) | ||||
Estimate (2.41) is indeed sharp, unless there are some additional assumptions on the set and the functions .
Decompose as (such decomposition can be viewed as a scale- wave packet decomposition of and . See also Section 2.1)
(2.42) |
where is a collection planar -tubes contained in , and is supported in a -cap, whose shortest direction is the same as the longest direction of .
Suppose every satisfies the following uniform-incidence assumption
(2.43) |
Then for each , by Hölder’s inequality and the Córdoba-Fefferman orthogonality,
(2.44) | ||||
Note that from the uniform-incidence assumption (2.43),
(2.45) | ||||
2.6. A refined Wolff’s hairbrush result
In [Wol95], Wolff used a geometric structure called “hairbrush” to obtain the 5/2 bound for the three-dimensional Kakeya maximal conjecture. Roughly speaking, suppose is a collection of tubes with -separated directions, and suppose for each tube there is an associated shading with a uniform density assumption where . Then for any ,
(2.48) |
While a careful analysis suggests that (2.48) is sharp only if for each tube , the shading is concentrated on one end of . Thus, the union can be a much larger set if the shading satisfies some two-ends condition (see Figure 1).
Definition 2.9 (quantitative two-ends at scale ).
Let be a collection of tubes in . Each has shading . Suppose we can partition into many -segments . We say is quantitative two-ends at scale () if
-
(1)
For those , are about the same up to a constant multiple.
-
(2)
For each , the number nonempty segments is bounded below by .
Remark 2.10.
If is quantitative two-ends at scale and is a subset satisfying , then there is a subset of that is also quantitative two-ends at a smaller scale . This is because by pigeonholing we can find segments so that are about the same up to a constant multiple, and their sum is . We will use this observation in the proof of next Lemma.
Lemma 2.11.
Suppose that is a collection of tube in pointing in -separated directions, and there are parallel tubes in each direction. Suppose also there is a so that for each , there is a shading satisfying . Moreover, the shading is quantitative two-ends at scale for some . Define . Then .
As a direct corollary, note that by dyadic pigeonholing, there exists a dyadic number and a subset so that
-
(1)
Every point in intersects many .
-
(2)
.
Also note that one can apply the bound to obtain by (2) and some dyadic pigeonholing. Hence we also have
-
(i)
.
-
(ii)
If we let be the subset so that every point in intersects many , then .
Proof.
Recall that . What follows is a “quantitative broad-narrow” reduction on every point . Define for each a set of tubes
(2.49) |
and for any directional cap a subset
(2.50) |
Lemma 2.12.
Let and . Suppose . Then there are a scale with , a directional cap with , a collection of directional caps with , so that are about the same up to a constant multiple for . Moreover, , for any , , and
(2.51) |
Proof.
The proof is quite standard. We will prove the lemma by an iterative argument. First partition into many -caps . By pigeonholing there is a subcollection so that are about the same up to a constant multiple for , and
(2.52) |
If , then we stop. Otherwise, pick any , partition it into many -caps and repeat the argument above. At the -th step of the iteration (if the iteration does not stop at step ), we have a collection of caps and a cap with so that for every , and , as well as
(2.53) |
Since , the iteration will eventually stop at some step with . Denote by , , and so that . To see (2.51) holds, note that . ∎
For any point with , by Lemma 2.12 define
(2.54) |
If we already have then there is nothing to prove. Otherwise, for those with , define
(2.55) |
Note that the number of possible choices of dyadic is . By Lemma 2.12 and a pigeonholing on the dyadic numbers , there exists a so that
(2.56) |
Define a new shading
(2.57) |
Remark 2.13.
Every point is now quantitative -broad with respect to the shading . That is, the set can be partition into subcollections so that are about the same, and for most pairs , tubes in and are -transverse. The quantitative lower bound is crucial, since it implies that if is a subset that contains a fraction tubes in , then most pairs of tubes in are still -transverse.
Let be a collection of finitely overlapping -caps of . For each , let be a collection of parallel -tubes pointing to the directional cap that forms a finitely overlapping cover of the unit ball. Denote by . For any , let
(2.58) |
Note that for each there is a depending on so that
(2.59) |
Hence by Lemma 2.12 and pigeonholing again there is a subset with so that
-
(1)
for all .
-
(2)
.
-
(3)
For each , either or , where is defined as
(2.60)
Denote by
(2.61) |
By the definition of we know
(2.62) |
Hence to prove the lemma, it suffices to prove that for any
(2.63) |
Let us fix a from now on.
For each , recall in (2.59). Since , by pigeonholing there are a dyadic number and a subset with
(2.64) |
so that for all , . Note that by Remark 2.13, every point in is still quantitative -broad with respect to the shading . Define a new shading
(2.65) |
By pigeonholing there is a subset with so that for all .
Thus, on one hand
(2.66) |
On the other hand, pick any . Since every point in is quantitative -broad with respect to the shading , and note that is quantitative two-ends (see Remark 2.10) for every tube . By Wolff’s hairbrush argument and the two-dimensional X-ray estimate, we get
(2.67) |
Since and since by assumption, the above two estimates imply
(2.68) |
which is what we need in (2.63). ∎
3. Quantitative two-ends reductions
In this section we conduct two quantitative two-ends reductions to the tube set (see (2.4)). The two reductions will be applied to two different methods of bounding , respectively. Before elaborating on the reductions, let us briefly demonstrate our two methods. Along the way we will recognize the need of the two-ends reductions—it strengthens some Kakeya estimates.
3.1. Brief outline for the two methods
The first method deals with the case . Suppose that for each scale- fat surface (see Lemma 2.4 for ), there are scale- directional caps that contribute to . Hence by orthogonality (see (2.36) for )
(3.1) |
Each -tube is associated to an -tube that has the same direction as . Note that only those scale- wave packets with make contribution to the scale- wave packet (see Lemma 7.1 in [Gut18]). Denote as the collection of the fat tubes so that each is associated to at least one -tube such that . Suppose but for some scale in (2.3). Then from the wave packet pruning in Section 2.1 we know that contains parallel tubes. Recall the broom estimate (2.38)
(3.2) |
A crucial observation here is that there is a Kakeya type constraint between and . Indeed, suppose further that each -ball in contains at least one fat surface . Then each -ball in the set intersects fat tubes in . Hence by Wolff’s 5/2-maximal Kakeya estimate and the triangle inequality we have222There is in fact a stronger “X-ray” estimate when is big. But it is not useful to us here since can be as small as .
(3.3) |
Plugging this back to (3.1) and (3.2) one gets a refinement
(3.4) |
which is stronger than that only uses the polynomial Wolff axiom (i.e. ) and the broom estimate.
However, it is not always true that each -ball in contains a fat surface . To deal with this issue, define a shading as the union of -balls in that contains at least an (see Definition 3.5). After pigeonholing and possibly refining , we may assume for some uniform constant for all fat tubes . Again, by Wolff’s 5/2-maximal Kakeya estimate and the triangle inequality we have
(3.5) |
The above estimate can be strengthened into, by Lemma 2.11,
(3.6) |
if the shading is quantitative two-ends (see Definition 2.9). Plugging this back to (3.1) and (3.2) one gets a refinement
(3.7) |
which is stronger than when .
3.2. Sorting for leaves
Recall in Lemma 2.4 that there are a collection of leaves , and collections of fat surfaces , each of which corresponds to a scale . In this subsection we would like to sort and find a fraction of that are distributed regularly in , . This can be considered as a preparation for the two-ends reduction.
Let be two natural numbers with , and , . We will first sort the leaves from the biggest scale to scale , and then from scale to scale .
3.2.1. First sorting
The sorting deals with the case and will be given in an iterative manner. Let and let . Starting from scale , suppose we have obtained a collection of leaves at scale . Now we sort with respect to to obtain a refinement with .
By pigeonholing, choose a set of –cubes such that
-
(1)
each contains about the same number of leaves in ,
-
(2)
contains at least a -fraction of leaves in
Let denote a set of finitely overlapping –cubes covering . Since each contains about the same amount of leaves in , by pigeonholing again, we can discard some cubes in to have either or contains about the same number of cubes for all nonempty . Moreover, we still have that contains at least a -fraction of leaves in .
Now there exists an injection (up to a constant factor)
(3.8) |
Each triple is associated with a unique triple of parameters depending implicitly on , where
-
(1)
means the number of such that . Write , then
(3.9) -
(2)
means the number of such that is about . For a fixed , let denote the set of such , then
(3.10) -
(3)
means the number of such that . For a fixed , let denote the set of such , then
(3.11)
We remark that the number is uniform for all triples . This follows from the definition of (see above (3.8)).
Since each is associated with a unique triple , it is also associated with a unique triple of parameters . By pigeonholing, there exists a uniform triple such that the ’s that are associated with it consist of at least a -fraction of the original set . Note that if is chosen, so is for other and , namely, is considered as a whole when doing pigeonholing. Denote by
-
(1)
the collection of fat surfaces that ,
-
(2)
the set of contained in ,
-
(3)
the collection of -cubes that .
Then we have and
(3.12) |
Let , so . By (3.12) and pigeonholing again there is a and a collection of -balls so that for any , and the set contains a fraction of -cubes in . To ease notations, still denote this fraction of -cubes by , and denote by , by . Hence we have
(3.13) |
Let denote the set of leaves in that each is contained in some . Since each contains about the same number of leaves in , we get
Since is supported in for some variety with degree at most and some ball of radius , by Wongkew’s theorem (see [Gut16] Theorem 4.7) one can bound the Lebesgue measure of from above as , yielding
(3.14) |
This finishes the sorting for leaves at the scale . We remark that now each contains about the same amount of leaves in .
Lemma 3.1.
Let and be a subset with . Then there exists subsets and parameters satisfying Subsection 3.2.1 with in the place of , and . In addition, each contains about the same number of leaves in (up to a factor of ) and where is the set of leaves that each of which is contained in some .
Proof.
Since , and each in Subsection 3.2.1 contains about the same number of leaves in , we can discard the –cubes from that contains a less than -fraction of the original cells.
Now each contains about the same number of leaves in and where is the set of leaves in .
Proceed as in Subsection 3.2.1 and find a subset satisfying same the uniform property and contains a significant fraction of the leaves and for each , is uniquely associated with a triple and a triple of parameters , where and . If , then , which is a contradiction. Same reason applies to . ∎
3.2.2. Second sorting
The second sorting will also be given in an iterative manner, and is simpler than the first one. From the first sorting we know that there is a collection of leaves at scale . Starting from the scale , suppose we have obtained a collection of leaves from scale . Now we sort at scale to obtain a refinement with .
By pigeonholing, we can find , a collection finitely overlapping -balls in , so that each contains about the same amount of leaves in up to a constant multiple, and the set satisfies . This finishes the sorting for leaves at the scale .
Finally, to ease the notation we set . This finishes our sorting of leaves.
3.3. The quantitative two-ends reductions
We will realize the reductions by defining a new relation (the relation mentioned in Section 2.4 is recognized as the old relation) between the -tubes and the -balls (recall , and see Section 2.4 for ). Recall from the previous subsection (see also Lemma 2.4) that there are collections of fat surfaces , each of which corresponds to a scale , and there are two natural numbers that , while , .
3.3.1. First type of related tubes
Suppose at first . For each -ball , let us define a collection of related tubes, which is a subset of (see (2.4) for ). To do so, we would like to define a shading for each . Recall that in the first sorting (Section 3.2.1) there is a collection of -balls .
Definition 3.2.
For each -tube , define a shading as the union of all the -balls that . Namely,
(3.15) |
For each , partition it into many -segments . We sort the segments according to . That is, let be the collection of such that . Define a new shading ( implicitly depends on )
(3.16) |
For each -ball , define . Then we can partition as
(3.17) |
so that for all
(3.18) |
and hence are about the same up to a constant multiple. We remark that for , when and
Recall . We will distinguish two cases: and . For each -ball , define the collection of related tubes and non-related tubes ( stands for “new relation”)
(3.19) |
Hence any related tube belongs to sets , and thus is related to balls . Recall (3.17) and notice that for a fixed pair , either or . Define
(3.20) |
Since for any , we have that is quantitative two-ends at scale (see Definition 2.9). What follows is a useful incidence estimate among the -balls in and the -tubes in .
Lemma 3.3.
Fix a pair . Denote by the number of shading intersects . Then, recalling and near (2.4), we clearly have
(3.21) |
More importantly, there is a subset with
(3.22) |
so that whenever .
Proof.
Note that by (2.4), contains parallel tubes. After rescaling, apply Lemma 2.11 with , , , and (which is a subset of ). Thus, there is a dyadic number
(3.23) |
and a set , such that for any other dyadic number , the set satisfies . Summing up all dyadic one has
(3.24) |
Since is a subset of , there is a subset with
(3.25) |
so that each intersects shadings . ∎
Since for each -ball and each we have for , when . A direct corollary of Lemma 3.3 is the following.
Corollary 3.4.
Fix a pair . For each -ball , let . Suppose . Then there is a subset with
(3.26) |
so that each intersects tubes .
3.3.2. Second type of related tubes
Suppose . In this case, we focus on those -balls in (see Section 3.2.2, the second sorting of leaves) and those fat tubes , where is a collection of -tubes that each contains at least one -tube that (see Section 2.1 for the step- function ), and that any two fat tubes in either are parallel, or make an angle . Let be that (see (2.3) for ), so there are at most parallel tubes in (see above (2.6)).
Similar to Definition 3.2, we define a shading on each fat tube via the -balls in .
Definition 3.5.
For each fat tube , define a shading as the union of all the -balls in that also intersect . Namely,
(3.27) |
Recall and . For each , we similarly partition it into many -segments . We sort the segments according to : Let be the collection of such that . Define a new shading
(3.28) |
For each -ball , define . Then we can partition it as
(3.29) |
so that for all
(3.30) |
and hence the mass are about the same up to a constant multiple. Note that for , when and
We similarly distinguish two cases: and . For each -ball , define the collection of related tubes and non-related tubes
(3.31) |
Hence any related tube is related to balls . Now for each define a collection of related -tubes
(3.32) |
as well as a collection of non-related -tubes
(3.33) |
Recall (3.29). Fix a pair , define
(3.34) |
as well as
(3.35) |
Note that for each fat tube , by definition and . What follows is an incidence estimate among the -balls in and the fat tubes in .
Lemma 3.6.
Fix a pair . There is a subset with
(3.36) |
so that each -ball intersects shadings with .
The proof of Lemma 3.6 is similar to the one of Lemma 3.3. One just needs to notice that contains parallel fat tubes (see the beginning of Section 3.3.2). We omit details.
Corollary 3.7.
Fix a pair . For each -ball , let . Suppose . Then there is a subset with
(3.37) |
so that each -ball intersects fat tubes (see Section 2.1 for ). Also, since , every intersects balls in .
At this point we finish defining the new related tubes at all scales . Recall the old relation in Section 2.4. Define for each -ball the ultimate related tubes and non-related tubes as (recall (2.34) and (2.35))
(3.38) |
so that each belongs to collections . From these we can define a related function and a non-related function
(3.39) |
where (see above (3.17) for ). We remark that the unrelated function still enjoys the broom estimate (2.38) (see Remark 2.7).
3.4. Handling the related function
Recall Lemma 2.4 that are about the same for all . Suppose there is a fraction of that . Then we can conclude our main estimate (1.4) by induction on scales.
Lemma 3.8.
Proof.
Using the induction hypothesis (1.4) at scale we have
(3.43) |
Note that each belongs to collections . Hence, after summing up all one has by Plancherel
(3.44) | ||||
This is what we desire. ∎
Suppose instead there is a fraction of that . We will handle this case in the rest of the paper.
4. Finding the correct scale
From the end of last section, we know that there is a fraction of that . By pigeonholing, there is an -ball (which we fix from now on) and a subset so that
-
(1)
.
-
(2)
are about the same up to constant multiple for all .
-
(3)
It holds that
(4.1)
Recall (3.39) that is a sum of wave packets for , where
(4.2) |
for any . Hence from (3.17), (3.20), (3.34), and (3.35), we know that at every scale there is a partition
(4.3) |
with (see (3.20)). We would like to consider the generators of the algebra created by the sets . To do so, define two vectors , , and the set
(4.4) |
Then the sets form a disjoint union of . Since the number of choices for is bounded above by , by pigeonholing there are a pair and a subset with so that the function satiafies
(4.5) |
and that are about the same for all up to a constant multiple.
To ease notation, we set
(4.6) |
in the rest of the paper for simplicity. Hence , are about the same up to a constant multiple for all ,
(4.7) |
and also
(4.8) |
We remark that the leaves in are all contained in the -ball .
We plug the new function back to the tree structure obtained in Lemma 2.4, and want to find the scale that the tangent case dominates. The following lemma is an analogy of Lemma 3.9 in [Wan22]. Its proof is also similar, so the detail is omitted.
Lemma 4.1.
Recall the tree structure obtained in Lemma 2.4. For the function in (4.6), either of the following happens:
-
(1)
There are -fraction of leaves so that
(4.9) which corresponds to the case that the polynomial partitioning iteration does not stop before reaching the smallest scale .
-
(2)
We can choose the smallest integer , (see Lemma 2.4 for ), so that there is a subset with
(4.10) and for each ,
(4.11) while for all ,
(4.12)
If the second case holds, then there are a degree , a collection of scale- fat surfaces, which we still denote by , so that each contains about the same amount of leaves in , and (by (2.18) and (2.19))
(4.13) |
and that the set contains a fraction leaves in . Still denote this fraction of leaves by . In addition, from Lemma 2.4 item (6) we have
(4.14) |
If the first case in Lemma 4.1 holds, then similar to Lemma 4.1 in [Wan22], one can prove (1.4) for . Therefore, let us assume that the second case in lemma 4.1 is true, so we are given a and a corresponding scale .
Remark 4.2.
Since are about the same (see the beginning of this section), without loss of generality let us assume are also about the same up to a constant multiple for all .
Recall in (2.20) that each leaf is within a containing chain . Similar to (2.21) and (2.22), we have for ,
(4.15) |
and hence for any subcollection ,
(4.16) |
For the we have
(4.17) |
Note that (2.23) still holds when is replaced by . Hence the contribution from is also dominated by the contribution from , which is negligible since step is the first step that tangential case dominates (see (4.12)). Thus, for each leaf , one has similar to (2.24) that
(4.18) |
This leads to, by an abuse on notation ,
(4.19) | ||||
(4.20) |
The step corresponds to a scale , which we denote by in the rest of the paper for brevity. If then by Lemma 7.5 in [Wan22] we know that (1.4) is true when (see also Remark 2.7). Hence, let us assume from now on. By Lemma 2.4 item (4), we know that the fat surfaces in are essentially -separated. Let us put this into a lemma for later use.
Lemma 4.3.
The sets are finitely overlapping.
Note that by (4.4), (4.6), the set is contained in for some (see (3.20), (3.35) for ). The following two lemmas are the consequences of the two-ends reduction in Section 3. We remark that from the sorting of leaves (Section 3.2) and from (4.8), the assumptions and in Corollary 3.4 and Corollary 3.7 respectively hold readily.
Lemma 4.4.
Suppose . Let be that (see (2.3) for ). Then from Section 3.3.2 (Corollary 3.7 in particular) we have
-
(1)
Two dyadic numbers .
-
(2)
A collection of -tubes so that each -tube in (see (4.6) for ) is contained in some fat tube .
-
(3)
A collection of -balls so that each ball intersects tubes , and .
-
(4)
Every leaf in is contained in some of .
-
(5)
Every intersects balls in .
Note that each contains about the same amount of leaves in (see Section 3.2.2). As a consequence of (3), (4), and from Lemma 4.1 and (4.8) respectively, the set contains a fraction of leaves in . Hence, if still denote this fraction of leaves by , then we have
-
(6)
Every leaf in is contained in some of .
Lemma 4.5.
Suppose . Let be that (see (2.3) for ). We have from Section 3.2.1, Section 3.3.1 (Corollar 3.4 in particular) and Lemma 4.1 that
-
(1)
Three dyadic numbers .
- (2)
-
(3)
A set of -cubes . For every , a set of -cubes with so that any leaf in contained in is contained by some . Also, (see (3.11)) and the set has cardinality .
-
(4)
A set . Since (mentioned above Lemma 4.4), we still have .
-
(5)
Two dyadic numbers , a subset with , so that each intersects tubes in . Moreover, an estimate (3.21).
-
(6)
Every leaf in is contained in some .
Note that each contains about the same amount of leaves in (see Section 3.2.1). As a consequence of (5), (6), and from Lemma 4.1 and (4.8) respectively, the set contains a fraction of leaves in . Hence, if still denote this fraction of leaves by , then we have
-
(7)
Every leaf in is contained in some of .
In addition, since again each contains about the same amount of leaves in , by pigeonholing we can find a subset so that
-
(8)
, and the set contains a fraction of leaves in , and each intersects tubes in (see item (5)). Moreover, by (3.21) we have .
5. First method
The first method will handle the case . Recall Lemma 4.1 ((4.13) in particular) that each contains about the same amount of leaves in . We have from (4.19)
(5.1) | ||||
(5.2) |
5.1. Some more preparations
Cover each cell with non-overlapping -cubes , and let be the collection of all these cubes. Similar to (3.14),
(5.3) |
Note that by Lemma 4.3, the collections are finitely overlapped. Write
(5.4) | ||||
(5.5) |
By dyadic pigeonholing, we can find a dyadic number , a subset , a subset , and a subset so that
-
(1)
For all
(5.6) -
(2)
Each is contained by some -cube in some , and each contains about the same amount of leaves in up to a constant multiple for .
-
(3)
It holds that
(5.7)
Hence we also have
(5.8) |
Recall Lemma 4.4. Since each -tube is contained by some fat tube , we know that each -tube with is associated to one (and at least one) fat tube (see also Lemma 7.1 in [Gut18]). Thus, after deleting those with , for an and for some -ball that , the number of scale- directional caps in is bounded above by the number of tubes in intersecting , which is by Lemma 4.4.
By the polynomial Wolff axiom, there is another upper bound for the number of scale- directional caps in , which is . This follows from Lemma 4.9 in [Gut16] (see also Lemma 2.6). Therefore, compared to (7.26) in [Wan22], we obtain the following refinement: for every where , one has
(5.9) |
where is the -ball containing . Combining it with the broom estimate (2.38) (see also Remark 2.7) and the fact that ,
(5.10) | ||||
Estimate (5.10) works well when is big. While when is small, we need another argument.
Now for a fixed , let us focus on
(5.11) |
where (see (5.6) for )
(5.12) |
What follows is another dyadic pigeonholing. Note that the function is a sum of wave packets at scale inside the -ball containing the cell . A heuristic understanding for is that if denoting , then inside
(5.13) |
For each define
(5.14) |
We would like to use pigeonholing to find a fraction of fat surfaces , so that for all tubes the quantities are about the same up to a constant multiple. To do so, for each dyadic number , we partition the collection as
(5.15) |
where is a subcollection defined as
(5.16) |
Using this partition, we can write
(5.17) |
where is the sum of wave packets from . Hence
(5.18) |
By pigeonholing on and dyadic pigeonholing on the value , we can choose a uniform such that for a fraction of fat surfaces and a fraction of -balls ,
-
(1)
.
-
(2)
For all appearing in the first item, are about the same up to a constant multiple.
Recall that we have made some uniform assumptions on and the number of leaves in each -cube in . (see (5.6) and the statement below it). To avoid extra notations, let us assume the above is true for all and all , without loss of generality.
Now by Lemma 2.6 and Lemma 2.8, and the fact that broad-norm is essentially dominated by bilinear norm, one has (see (5.6), (5.16) for and (5.12) for )
(5.19) | ||||
Here is the -ball containing . Summing up all cells we get
(5.20) |
We also would like to give an upper bound for . From Lemma 4.4 we know that each is contained in some . Write
(5.21) |
Notice that by our definition of in (5.16), any -tube belongs to at most distinct collections . By -orthogonality, for each -ball we have
(5.22) | ||||
(5.23) |
Since each intersects at most balls in (see Lemma 4.4), we can sum up all and get
(5.24) |
This suggests a gain when is small.
5.2. Wrap up
Finally, let us wrap up all the information we get so far. We are going to estimate in three ways. from (4.13) and (5.8) we know that .
5.2.1. Case 1.
5.2.2. Case 2.
5.2.3. Case 3.
5.3. Numerology
Recall (5.26), (5.33) and (5.37). One wants to find the smallest so that the minimum of the following system is bounded above by
(5.38) |
Simplify (5.38) by multiplying the first two terms and by using
(5.39) |
so that we could get rid of the factor and have
(5.40) |
Now by using with and (see (5.3) and (5.6)), one gets
(5.41) |
which is bounded above by 1 when .
In conclusion, we have when and ,
(5.42) |
6. Second method
The second method will handle the case (). Roughly speaking, we will use a square function estimate if each “admissible” -ball is “associated to” a lot of fat surfaces . Otherwise, we use the refined decoupling theorem.
Recall Section 3.2.1 and Lemma 4.5. Since (see (4.8) and (4.10)), let us assume without loss of generality that each contains about the same amount of leaves in up to a constant multiple (see also Lemma 3.1). As a result, are about the same up to a constant multiple for all . Note that by Lemma 3.1, after further refinement, the parameters change by at most a factor of .
Go back to (4.19). Write
(6.1) | ||||
6.1. Case one
By Lemma 4.5 (item (7) in particular), we have from (6.1) that
(6.2) |
For a fixed and a fixed , let us focus on
(6.3) |
What follows is another dyadic pigeonholing similar to the one near (5.16). For each dyadic number , we partition the collection as
(6.4) |
where is a subcollection defined as (see Lemma 4.5 for )
(6.5) |
and is defined as
(6.6) |
Using this partition, inside we can write
(6.7) |
Since there are at most choices of , one gets
(6.8) |
By dyadic pigeonholing, we can choose a uniform such that for a fraction of , , and , .
By pigeonholing again, for a fraction of the remaining and , the quantity are about the same. We restrict our attention on those and . Recall that by Lemma 3.1, after further refinement (see also the uniform assumption above (6.1)), the parameters change by at most a factor of .
Now by Lemma 2.6 and Lemma 2.8 (in fact we only use (2.47)), and the fact that broad-norm is essentially dominated by bilinear norm, one has
(6.9) |
Here is given in Lemma 4.5 (), and is defined in (6.5). Summing up all and all , we get via (6.2) that
(6.10) | ||||
Since are about the same for all and since (see (3.11) and Lemma 4.5), we further have
(6.11) | ||||
Next, we would like to bound . For a fixed -cube , here is useful observation: Each -tube can belong to at most many . This is because on one hand if , then intersects at least many -cubes in (equivalently, in ). While on the other hand each can intersect at most distinct -cubes in .
This leads to
(6.12) | ||||
Thus, after summing over we have
(6.13) |
Inside each , invoke the orthogonality so that
(6.14) |
which, via Hölder’s inequality, is bounded above by
(6.15) |
Therefore, combine the above calculations with (6.11) so that
(6.16) | ||||
(6.17) |
To bound (6.17), notice that for each -cap (see (2.4) for )
(6.18) |
Since we already assume above (2.4) that are all about the same, so by (6.18)
(6.19) |
giving the reduction
(6.20) | ||||
6.2. Case two
Our second estimate uses the refined decoupling in [GIOW20] (see [BD15] for the original Bourgain-Demeter decoupling theorem).
Theorem 6.1 ([GIOW20] Theorem 4.2).
Let . Suppose is a sum of scale- wave packets so that are about the same up to a constant multiple. Let be a union of -balls in such that each -ball intersects to at most tubes from . Then there exists (for example, ) so that
(6.25) |
We know from Lemma 4.5 item (8) and (4.19)
(6.26) |
Also, again from Lemma 4.5 item (8) we know that for each , there are at most many -tubes in that intersect it. Hence by the refined decoupling (6.25) one has (recall (2.4) for the definition of )
(6.27) |
By Bernstein’s inequality and Plancherel,
(6.28) |
which is bounded above by
(6.29) |
Thus, the above calculations give
(6.30) |
where the quantity has the expression
(6.31) |
6.3. Case three
Our third and final estimate use the information on (see Lemma 4.5, in particular, ). On one hand, for each fat surface , by Lemma 2.6, Lemma 2.8 (only (2.41)), and the fact that broad-norm is essentially dominated by bilinear norm, one has
(6.32) |
Here we use the estimate , which is given in the line below (3.10). Note that by definition the function is a sum of all tangential wave packets intersecting , so we cannot use (4.14) to sum up for all fat surfaces .
6.4. Numerology
Finally, combining and simplifying (6.23), (6.30), (6.34), (6.35), one hopes to find the smallest such that the minimum the following equations
(6.36) |
is bounded above by . Recall also the relations
Use the estimate to rewrite the first term of system (6.36):
(6.37) |
Combining the first two equations to get rid of (multiply the first one with the power of the second one, then use ), one gets
(6.38) |
Calculate to obtain
(6.39) |
One gets that when the above is bounded by 1 if . Combining the result in (5.42) we have
(6.40) |
if . This proves our main estimate 1.4.
Remark 6.2.
The first method in Section 5 does not work very well when is much bigger than . It mainly is because in this case, we have to focus on -balls and tubes instead of -balls and -tubes. A (bad) consequence is that we cannot get (3.3), (3.4) from (3.1), (3.2), since each tube may contains a lot of -tube, each of which is a target fat tube in the broom estimate (2.37).
While for near our first method still shows some strength. In particular, when one can optimize the system (5.38) to obtain the range . On the other hand, our second method gives a better range of when is larger. If we optimize these two methods for , we can indeed have
(6.41) |
when and .
References
- [BD15] Jean Bourgain and Ciprian Demeter. The proof of the decoupling conjecture. Ann. of Math. (2), 182(1):351–389, 2015.
- [BG11] Jean Bourgain and Larry Guth. Bounds on oscillatory integral operators based on multilinear estimates. Geom. Funct. Anal., 21(6):1239–1295, 2011.
- [Bou91] Jean Bourgain. Besicovitch type maximal operators and applications to Fourier analysis. Geom. Funct. Anal., 1(2):147–187, 1991.
- [GIOW20] Larry Guth, Alex Iosevich, Yumeng Ou, and Hong Wang. On Falconer’s distance set problem in the plane. Invent. Math., 219(3):779–830, 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, 2018.
- [KR18] Nets Hawk Katz and Keith M. Rogers. On the polynomial Wolff axioms. Geom. Funct. Anal., 28(6):1706–1716, 2018.
- [Tao99] Terence Tao. The Bochner-Riesz conjecture implies the restriction conjecture. Duke Math. J., 96(2):363–375, 1999.
- [Tao03] Terence Tao. A sharp bilinear restrictions estimate for paraboloids. Geom. Funct. Anal., 13(6):1359–1384, 2003.
- [Wan22] Hong Wang. A restriction estimate in using brooms. Duke Mathematical Journal, 171(8):1749 – 1822, 2022.
- [Wol95] Thomas Wolff. An improved bound for Kakeya type maximal functions. Rev. Mat. Iberoamericana, 11(3):651–674, 1995.
- [Wol01] Thomas Wolff. A sharp bilinear cone restriction estimate. Ann. of Math. (2), 153(3):661–698, 2001.