On the union of essentially distinct $\delta$-tubes
Qiuyu Ren

TL;DR
This paper establishes sharp lower bounds on the measure of unions of essentially distinct $ ext{delta}$-tubes in $ ext{R}^n$, characterizes extremal configurations, and introduces a new convexity measurement via the X-ray transform.
Contribution
It provides the first asymptotically sharp bounds for unions of essentially distinct $ ext{delta}$-tubes and introduces a novel convexity measurement based on the X-ray transform.
Findings
Sharp lower bounds for union measure of $ ext{delta}$-tubes
Characterization of extremal configurations
New convexity measurement method
Abstract
We say two -tubes (dimension ) in are essentially distinct if the measure of their intersection is smaller than a half of a single -tube. For a collection of essentially distinct -tubes, we give the asymptotically sharp lower bound for the measure of their union. Then we characterize all sharp examples. We will give a new measurement of convexity based on the X-ray transform.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsPoint processes and geometric inequalities · Limits and Structures in Graph Theory · Analytic and geometric function theory
On the union of essentially distinct -tubes
Qiuyu Ren
Department of Mathematics, Massachusetts Institute of Technology, Cambridge, MA 02139, USA
Abstract.
We say two -tubes (dimension ) in are essentially distinct if the measure of their intersection is smaller than a half of a single -tube. For a collection of essentially distinct -tubes, we give the asymptotically sharp lower bound for the measure of their union. Then we characterize all sharp examples. We will give a new measurement of convexity based on the X-ray transform.
1. Introduction
The Kakeya conjecture has long been a famous unsolved problem in analysis. We call a compact set in a Kakeya set if it contains a translation of every unit segment in . For , there exists Kakeya set of measure zero. However, the Kakeya conjecture states that:
Conjecture 1.1** (Kakeya set conjecture).**
Every Kakeya set in has Hausdorff and Minkowski dimension .
Of course, the result for Hausdorff dimension implies the one for Minkowski dimension.
The conjecture is trivial for , easy for but remains unsolved for any . One can ask various different questions which are closely related to Kakeya conjecture. Most of these “Kakeya family” problems remain open.
Our work is closely to one of these conjectures, namely the Kakeya tube conjecture. To formulate it, let us first fix some notations.
Let , . A -tube in with center and direction is defined to be the set
[TABLE]
where is any preimage of in .
The angle between two directions (or two -tubes with direction ) is defined to be .
We say a collection of tubes (or a collection of directions ) is -separated if the angle between every two of them is greater than . We say it is maximal -separated if it is -separated and for some prescribed small constant .
Conjecture 1.2** (Kakeya tube conjecture).**
For any , there exists such that for and any maximal -separated collection of -tubes we have
[TABLE]
Where denotes the Lebesgue measure.
The Minkowski version of the Kakeya set conjecture is a direct corollary of the Kakeya tube conjecture. More generally, if we replace the exponent in (2) by for some , the result would imply that every Kakeya set has Minkowski dimension at least . Many partial progresses have been made. For example, Wolff [12] showed this for . Later, Katz and Tao [7] showed this for . Still better results have been made, but we do not attempt to give a full list here.
We will not directly tackle this problem. Instead, we consider a variant of it. We say a collection of -tubes is essentially distinct if for every where is a fixed constant. Notice that “essentially distinct” is a weaker condition than “-separated” (at least for suitably large, which we will assume from now on).
In this article, we give an asymptotically sharp lower bound of for a collection of essentially distinct -tubes in Section 2. We will see that the bound has a different expression for large and small . Then we turn to the inverse problem: when the equality is approximately attained, what can we say about the configuration of these tubes? In Section 3, we settle the situation when is large. In the rest of this article we focus on the more difficult situation when is small.
In Section 4, we states our main rigidity result for small . In Section 5, we present some lemmas needed for its proof.
Let be the set of all lines in . Give the canonical measure by identifying with the product space . The X-ray transform of a suitably defined function is a function , . In Section 6 we reveal a close relationship between the norm of the -ray transform of the indicator function of a set and the convexity of . This is an essential ingredient for our proof for the rigidity result.
On one hand, Christ [4] proved (as a special case) that
[TABLE]
for some constant . On the other hand, it is a fact in integral geometry (see e.g. Ren [10, (6.5.13)]) that always takes the value when is convex, thus for the equality in (3) is attained up to a constant. We will show that when , in the converse direction, if we first suppose the equality in (3) holds up to a constant for , then is “almost convex” (see Theorem 6.6). In particular, this gives raises to a reasonable measurement of convexity of sets (or more generally, functions) in when .
Finally, in Section 7 we give the complete proof for the rigidity result for small .
Throughout this article, is a small number, is an integer, is a collection of essentially distinct -tubes in , with .
We write for and for for some certain constant which may vary from line to line, and may depend on some prescribed constants (e.g. the dimension ) but not on any particular choice of variables (e.g. , , ). We write for .
For a set , we write for its characteristic function. We use to denote the open ball in with center and radius . We use to denote the coordinate vectors of . We use to denote the Lebesgue measure in or its induced surface/line measure for some surface/line in , which will be clear in the context. For a set and a line , we use to denote .
A tube in with radius , height , center and direction is the set defined by (1) with , replaced by , , respectively (so is a tube with radius , height , center and direction ). For a direction , the -cap about , denoted as , is defined to be the set of all directions within angle of .
2. Sharp bound for the volume
In this section, we give the asymptotically sharp lower bound for . We will use the “bush” argument first introduced by Bourgain [2].
Theorem 2.1**.**
The following estimate is sharp up to constant factors:
[TABLE]
Proof 1*.*
We define a function on by .
Denote . Then we have the following estimate:
[TABLE]
Consider any subcollection whose tubes are within angle from each other. Then by an application of the pigeonhole principle, we see that every point is contained in tubes in . Since we can cover by -caps, we see that can be written as the union of such subcollection . It follows that .
Now (5) yields
[TABLE]
On the other hand, choose a point with . Then there are tubes containing . We can choose a suitably large constant so that for any two tubes containing with angle greater than , we always have , where .
Since, by pigeonhole principle, there are tubes in containing with direction in any certain -cap, we can choose tubes in , say , with -separated directions. Then
[TABLE]
[TABLE]
Now (6)(8) gives (4). We are left to show the estimate is sharp.
When , we first put disjoint -tubes in the same direction together into a large tube with radius and the same direction as the -tubes. We fix a maximal collection of -separated directions (which has cardinality ). Then we put one copy of the large tube together with all -tubes inside in each direction we have chosen, such that all the large tubes have the same center, say . Now we have placed essentially distinct -tubes, which can be covered by a ball of radius . We call this a standard configuration at . Take disjoint copy of some standard configurations, we have then constructed -tubes whose union has volume .
When , we first take disjoint -tubes in the same direction together into a large tube with radius . We fix a maximal collection of -separated directions restricted to a -cap of (which has cardinality ). Then we put one copy of the large tube together with all -tubes inside in each direction we have chosen, such that all the large tubes have the same center. Now we have placed essentially distinct -tubes, which can be covered by a tube of radius (and height , say). Thus the union of these -tubes has volume .
3. Rigidity for large
Now we consider the inverse problem for Theorem 2.1. That is, we suppose the equality holds (up to constant) in (4). We hope to show that must look like the example we gave in Section 2. We shall first make this precise for . We call the examples we constructed in the previous section ”standard examples”.
The equality holds means that there exists a constant independent of such that
[TABLE]
Definition 3.1**.**
Let be a -tube, be any point. The vertical distance between and is . The horizontal distance between and is . Here is a preimage of in .
Thus, the -tube consists of all points that are within horizontal distance and vertical distance with respect to .
Definition 3.2**.**
For any , , , an -good configuration at is a collection of essentially distinct -tubes which satisfies the following conditions:
- (a)
All tubes in are within horizontal distance and vertical distance with respect to . 2. (b)
There exists a collection of -separated directions with , such that for some , where each consists of at least tubes, all of whose directions are in .
We see that a -good configuration at looks very much like a subset of a certain standard configuration at we defined in the previous section. On one hand, measures how much a generic tube in a good configuration deviates from the one in the standard configuration: we can translate each tube vertically with respect to for no more than distance and then tilt each tube around its center for no more than angle (and then possibly throw away a few tubes that intersect some other tubes in the same direction, but there will still be a positive amount of tubes remain) to get a subset of a standard configuration. On the other hand, measures the portion of our good configuration possesses in the standard configuration: a -good configuration contains no less than tubes, which has a portion of a standard configuration (this still holds even if we account for the tubes thrown away in the previous remark).
With this in mind, we see that the following theorem tells us that the standard examples we constructed in the previous section are essentially the only examples for equality to hold.
Theorem 3.3**.**
There exists , such that for any , there exists , such that for any satisfying (9), we can extract at least -good configurations from , such that for any two different good configurations we extract.
Some remarks are in order.
Remark 3.4*.*
- (i)
We do not need to add the assumption since this is implied by (4) and (9). 2. (ii)
By Definition 3.2 we see that the total number of tubes we extract in the theorem is no less than . This means a positive portion of tubes in can be chosen to be an approximate copy of a subset of a (positive part of a) standard example. 3. (iii)
We cannot expect essentially better result than Theorem 3.3:
For one thing, it is clear that we cannot require (the portion of a good configuration in a standard configuration) to be independent of or . For another thing, we can only guarantee to extract a positive portion of tubes but not an arbitrarily large portion of tubes to be contained in a standard example, even if we dropped the requirement that different good configurations are disjoint (which is nonessential). This is shown by the following example.
Example 3.5**.**
Let . Use the example for small we constructed before, construct a configuration that contains -tubes, respectively, such that the configurations are far away from each other. Call these configurations . Take . We see that , , so (9) holds for some fixed .
To define rigidity, at least we have to fix a which depends only on this fixed , and say a collection of tubes is good if it (approximately) constitutes at least a portion of some standard example.
But after we fix this and any positive integer , for all sufficiently small , we see that any subcollection with must intersect with of . If is a good collection of tubes, then there is a standard example such that constitutes a portion at least of . But by the construction of standard example we see that . So
[TABLE]
In other words . This means we cannot guarantee to extract an arbitrarily large portion of to be (approximately) contained in a standard example.
We now prove the following two lemmas, from which Theorem 3.3 follows.
Lemma 3.6**.**
There exists such that for any , there exists such that for any satisfying (9), there exist at least disjoint balls of radius , each of which contains at least tubes in .
Proof 2*.*
Let denotes the multiplicity function of points in with respect to . Then
[TABLE]
On the other hand, we already see in the proof of Theorem 2.1 that . This, together with (9)(10), implies that there exist some constants independent of and such that for
[TABLE]
we have .
Let
[TABLE]
where is a constant to be chosen later.
Now we want to cover by a collection of balls with and for .
To do this, select one by one. Having chosen , we pick any (if it exists). By pigeonhole principle, the condition implies every point in is covered by balls chosen. On the other hand, by the bush argument in the proof of Theorem 2.1 we see that
[TABLE]
for all , thus
[TABLE]
This means the selection process eventually stops at some
[TABLE]
With the chosen , we now have
[TABLE]
Thus we can choose some such that . Accordingly .
Now find a collection of disjoint balls with . If does not cover , then we can add more balls into this collection. Hence the collection can be chosen so that
[TABLE]
Or written explicitly, for some independent of .
For each , by the choice of and we know that
[TABLE]
Since every -tube intersects with is contained in , the set satisfies
[TABLE]
Hence for some . The proof is complete.
Lemma 3.7**.**
For any , , there exists such that for any collection of essentially distinct -tubes contained in a ball of radius , with cardinality at least , there exists a subcollection of which is a -good configuration.
Proof 3*.*
For any , let be the tube with radius , height which has the same center and direction as .
Then , . Therefore there exists a point such that there are tubes passing .
Take . Then and that satisfies (a) of Definition 3.2. Now it suffices to extract a subcollection of that satisfies (b).
Cover by a collection of -caps such that each direction is covered by caps in . Let has direction in .
As remarked in the proof of Theorem 2.1, each point in is contained in -tubes in with direction in a certain -cap. Now that all our tubes are contained in , , we thus know that . We also have , where . From these we deduce that there exist , such that the set
[TABLE]
has cardinality at least . Decrease if necessary, we may also assume has pairwise angle larger than .
For each , we further cover by -caps. By pigeonhole principle we can find (written more explicitly, ) tubes in with direction in one of those -caps. Take and the proof is complete.
4. Rigidity for small
Now we turn to the situation when is small. In this case, the equality of (4) takes the form
[TABLE]
for some fixed constant .
We hope to prove similar result as in the previous section, i.e. our example constructed earlier is unique in some sense. However, it is not true that we can extract a certain amount of tubes in that resembles a subset of the “standard example”. In fact, examples with different outlook do exist.
Example 4.1**.**
When for some , we first employ the “standard example” we have constructed when the dimension of the whole space is to obtain a sharp example of a collection of essentially distinct -tubes in . For each , take to be the -tube whose intersection with is , and whose center and direction are both contained in . Then gives a sharp example for dimension .
We now have seemingly different examples which satisfy (11) for some large (at least when ). There is a better way to describe these examples.
Example 4.2**.**
Suppose , so that .
Let . Put as many essentially distinct -tubes into as possible.
We see that there are -separated directions in each of which we can put essentially distinct tubes. Now the total number of -tubes we put is and their union has volume .
Based on this description, we can make two guesses. First, all examples satisfying (11) arise in similar way. i.e. there is a “good” set with such that most of the tubes are contained in a set congruent to . Second, every example arises this way does contain tubes, thus is a sharp example. We shall now make these precise.
What does “good” mean? Since our tubes has radius , it is natural to require to be (a) -discretized (i.e. is a union of balls of radius ) for some constant . But this is obviously not enough. For example, we take to be an annulus with width and volume , then for , it is not possible to put as many as essentially distinct -tubes inside . A natural guess is that should also be (b) convex. It turns out that these two conditions, plus the assumption that (c) does not have too large diameter, are sufficient for both the two guesses.
We first deal with the second guess. That is to say, implies “good”.
Theorem 4.3**.**
Let be a convex -discretized set with and . Then we can put essentially distinct -tubes into .
Remark 4.4*.*
Of course, our proof presented below is not the best way to solve this problem (see Remark 4.6). However, we do want to show some continuization argument which turns discrete problems into continuous ones. Similar technique will be needed in the proof of Theorem 4.5, and we shall not repeat it again then.
Proof 4*.*
Take a collection of -separated directions such that are pairwise disjoint but . Then .
For any direction , let denote the maximal number of essentially distinct -tubes with direction that can be placed into , denote the maximal number of essentially distinct tubes with radius , height and direction that can be placed into .
For any , we can find . Since any -tube with direction is contained in a tubes with radius , height and direction , we see that . Thus
[TABLE]
where , is the preimage of in , .
Now we replace by , and we redefine to be the maximal number of essentially distinct -tubes with direction that can be placed into . Then agrees with the previous definition. It suffices to show that
[TABLE]
We may further replace the -tubes in the definition of by -tubes, and by doing a rescaling, we are left to show (13) provided that is a convex -discretized set with and .
Let . Then , is convex and -discretized.
Write where is a unit vector, , and is the -th coordinate vector. Denote by . Then
[TABLE]
For fixed , divide into -slices whose interiors are pairwise disjoint, where each -slice is congruent to , such that the two dimensions correspond to are spanned by and . Denote , .
Let be the projection map. For a -tube with direction , is contained in a tube of dimension with radius and height . Thus a translation of it can be contained in if , where is the central line in the -slice . Moreover, in the vertical direction (the last coordinate), has width above each point in and a total width in the vertical direction of at most . Thus if a translation of can be contained in , then a total of essentially distinct -tubes with direction can be placed into . The above argument shows that
[TABLE]
(By one can check that this is actually an equality rather than inequality. The other direction is used for the proof of Theorem 4.5.)
Thus
[TABLE]
Here we used the fact that .
Now let . Then is convex and . We have
[TABLE]
[TABLE]
where denotes the set of all lines in with the natural measure.
But it is a known fact (see Ren [10, (6.5.13)]) that for any convex set , we have
[TABLE]
Thus (13) follows from (17), and the proof is complete.
Proving the other guess we made is much harder. We have only an (approximate) equality on our hand but are asking for rather rigid structural property for a given sharp example. We first state out this rigidity result, which is one of the main theorems in our paper.
Theorem 4.5**.**
Suppose satisfies (11), then we can find a convex -discretized set with and , such that there are tubes in contained in a set that is congruent to . Here the implicit constants depend only on .
Remark 4.6*.*
There is an alternative way to define “good”. We may define a “good” set to be any box (resp. ellipsoid) in with all side length (resp. axis length) belonging to for a suitable constant . The equivalence between this definition and the one we stated follows from the fact that for any convex set with non-empty interior, there exists homothetic boxes (resp. ellipsoids) with and (see [5]). Nevertheless, we stick with our previous definition.
We extract several technical tools for our proof of Theorem 4.5 and present them in the next two sections. Then we give the complete proof in Section 7.
5. Lemmas
Lemma 5.1**.**
*For every and positive integer , there exists such that the following holds:
For any measure space with , any measurable set with , and an assignment with for each , there exists such that:*
- (a)
; 2. (b)
.
Where denotes the volume of the -simplex with vertices .
Proof 5*.*
For , we denote the -hyperplane determined by points in general position by . For any -hyperplane and , we define to be the -neighborhood of . Under these notations, the ball in can also be written as .
Below we give an algorithm to explicitly find the desired points .
Set (a total of ’s), , , , . We begin the following process:
Step :
Pick any . Set . We begin the following subprocess:
Substep :
If then stop the subprocess. Otherwise, choose such that satisfies
[TABLE]
If there exists such that
[TABLE]
then goto Substep , otherwise stop the subprocess.
The subprocess must stop at some . If , then we have selected , and we stop the whole process. Otherwise, for all we have
[TABLE]
Now we define
[TABLE]
[TABLE]
[TABLE]
[TABLE]
[TABLE]
And we goto Step .
Now let us analyze the above process. By an induction we see that for each step , we have
[TABLE]
Every time when we move from Step to Step , by choice of we have
[TABLE]
(The denominator in the last term is if .)
Also,
[TABLE]
From (19) we know that for any step I,
[TABLE]
Using the simple fact , we know that
[TABLE]
Thus (5) gives
[TABLE]
Next, we show that the process would eventually stop, and the total number of steps is bounded above by some constant .
We use induction on to show that the quantity in any step is bounded above by a constant .
For , suppose the the bound exists for all , consider . Denote , , (20)(23) give that
[TABLE]
Thus it suffices to take
[TABLE]
(The numerator in the last term is if .)
The induction is complete, and the assertion of the boundedness of the total number of steps follows.
Now suppose the whole process stop at Step . We shall show that the points satisfy our desired properties (a)(b) for some constants .
[TABLE]
(b): By (21) and the boundedness of total number of steps,
[TABLE]
By the construction of , , , we see that
[TABLE]
and that for each , the distance from to the -hyperplane satisfies
[TABLE]
But is contained in a box of size , thus (24) further yields
[TABLE]
and then (25) yields
[TABLE]
The proof is complete.
Lemma 5.2**.**
Let be a measurable set with . For , denote . Then
[TABLE]
Proof 6*.*
Define
[TABLE]
Then for all . Denote , where is a constant to be chosen later.
Let be the projection map along , . For any , take its preimage , we have
[TABLE]
Thus
[TABLE]
Apply the isoperimetric inequality to , we get
[TABLE]
In other words
[TABLE]
Now we have estimate
[TABLE]
where we took .
Lemma 5.3**.**
Let be a free abelian group, , , , such that , and that the map , maps at most points to one point. Then .
Katz, Tao proved this result for . But there is no significant difference in the proof for this general version, as remarked by Oberlin [9]. We shall avoid unnecessary repetition here and refer the readers to [6].
6. X-ray transform and convexity
We propose a new measurement for the convexity of sets in , which follows from a more general definition given for suitably defined functions in . We shall see that our definitions (especially the one for sets) have many nice properties. For some other measurements of convexity, one may consult [8]. In particular, our definition is close to that of Beer [1], but has its own advantage.
In this section, we will always assume .
Definition 6.1**.**
The convexity index of a function is defined to be
[TABLE]
The convexity index of a set is defined to be
[TABLE]
where is the set of all lines in with the natural measure.
Remark 6.2*.*
Although our definition of convexity index has several advantages over the one defined by Beer [1], it fails to measure convexity when .
Proposition 6.3**.**
The convexity index of a function (resp. a set ) is invariant under non-singular affine transformations or rearrangement on a set of measure zero. Also, is invariant under multiplication by nonzero constants.
Remark 6.4*.*
The Beer convexity index (defined only for sets) is also invariant under non-singular affine transformations, but it is sensitive to changes on a set of measure zero. From this point of view, our definition of convexity index is more natural under the analytical sense.
Proof 7*.*
Let be any non-singular affine transformation in . Write . Then we have
[TABLE]
For any line with direction , we have
[TABLE]
For , , let denotes an orthogonal complement of in , denotes the line passing with direction . Then
[TABLE]
Suppose where almost everywhere. Then for fixed , exists and equals to zero for almost every , so
[TABLE]
Thus . On the other hand, it is clear that . It follows that .
The statements for sets follow from those for functions.
The invariance of under multiplication by nonzero constant is obvious.
Theorem 6.5**.**
- (1)
For any whose convexity index is defined, we have , where the implicit constant depends only on . 2. (2)
For any set whose convexity index is defined, we have , and the equality on the right holds if and only if is convex up to rearrangement of points in a set of measure zero.
The statement for functions follows from the following estimate for the X-ray transform:
[TABLE]
which was first proved (as a special case) by Christ [4].
As for the statement for sets, we shall follow the computation of the equality case for convex sets (Ren [10, (6.5.13)]) and give a proof for our more general statements.
Proof 8*.*
Using a change of variable formula (see Ren [10, (6.2.37)]), we have
[TABLE]
For a fixed , let us identify with . For , define . Then is monotonically increasing and we can choose a monotonically increasing such that . Then
[TABLE]
and thus
[TABLE]
Combine (28)(31), we get the desired inequality . Note that trivially holds.
For convex , we see that equality in (30) holds for all , so . More generally, if differs from a convex set on a set of measure zero, then by Proposition 6.3.
Conversely, when , we see that for almost every , the equality in (30) holds. Equivalently, there exists with , such that for all , the equality in (30) holds for almost every in direction . For these , since is monotonically increasing with (29), we deduce that
[TABLE]
This implies that there exists a segment with
[TABLE]
A point is said to be a point of Lebesgue density of if
[TABLE]
where ranges over all balls containing and denotes the radius of . Let be the set of all points of Lebesgue density of . It is well known (e.g. see Stein [11, Corollary 3.1.5]) that and differ by a set of measure zero. We claim that is convex, from which the statement follows.
Suppose , lies on the open segment . Let be given. Find such that for any ball containing or with .
Now let be any ball containing with . Then we can find balls , containing , respectively, both with radii , such that the centers of lie on a line with direction in . By the choice of , we see that are disjoint. Let denote the set of all lines parallel to that intersect . We now have
[TABLE]
Denote , then
[TABLE]
By the choice of , we see that for almost every , is defined and intersects with both and , thus it contains . Now
[TABLE]
Since is arbitrary, we conclude that , and the proof is complete.
The following theorem is an asymptotic version of Theorem 6.5(2). Neither of these two holds for the Beer convexity index.
Theorem 6.6**.**
Let be a set whose convexity index is defined. Suppose there is a convex set with for some constant , then . Conversely, suppose for some constant , then there exists a convex set with . Here all implicit constants depend only on .
Proof 9*.*
The forward direction is straightforward. We first find a ellipsoid containing with (see [5]). Since the assumptions and conclusions are all invariant under non-singular affine transformations, we may assume is a ball with radius . Then .
We have
[TABLE]
where is the projection of along onto , which is an -ball of radius , and is the line passing with direction .
By Hölder’s inequality,
[TABLE]
thus (32) yields
[TABLE]
So by definition.
For the converse direction, we first prove the following lemma. We say a set is star-convex at point if contains all segments , .
Lemma 6.7**.**
Let the assumptions be as in Theorem 6.6, then there exists with , such that for every , there exists a set that is star-convex at point , with . Here the implicit constants depend only on .
Proof 10*.*
For , , , we use to denote the set of all lines in passing with the natural measure, and to denote the intersection of with the ray with initial point and direction . Then
[TABLE]
On the other hand, using polar coordinate, we can write
[TABLE]
Now (10)(34) together with the assumption yield
[TABLE]
But for the integrands above we have
[TABLE]
And note that the value of left hand side above is independent of . Thus for generic these two terms should be comparable. More precisely, there exists , such that
[TABLE]
for all . Again, for the integrands above we have
[TABLE]
This time we deduce that there exists such that
[TABLE]
and that
[TABLE]
for all .
Now, (35) implies that there exists such that for all . Now we take
[TABLE]
Then is star-convex at , and we have
[TABLE]
and that
[TABLE]
The statement follows.
Now we come back to the proof of the converse direction of Theorem 6.6.
Since all the assumptions and conclusions are invariant under non-singular affine transformations, we may assume that .
For any set and point , we use to denote the union of all segments , . Use the notations in Lemma 6.7, for each , denote , then , so
[TABLE]
Apply Lemma 5.1 with being the restriction of the Lebesgue measure space to the set and being , we see that there exists with
[TABLE]
and
[TABLE]
Denote .
For any set and point , we use to denote the union of all rays with initial point that passes some point in . We now state the following lemma which will be useful.
Lemma 6.8**.**
Suppose with , are the vertices of a regular -simplex contained in with side length and center [math]. Suppose furthermore that for all . Let , be a constant, . Then for some and all , we have
[TABLE]
Corollary 6.9**.**
Let the notations be as in Lemma 6.8. Assume . Let denote the ellipsoid with center [math] whose axes agree with the coordinate axes, and whose semi-axes have length in the direction of the first coordinates and in the last. Then for some and all , we have
[TABLE]
Proof 11*.*
This follows by applying the affine transformation () to the case in Lemma 6.8 and some rescaling.
Assuming Lemma 6.8, we now finish the proof of the converse direction of Theorem 6.6.
By applying an affine transformation with determinant , we may assume are vertices of a regular -simplex with side length and center [math].
First we suppose for a large constant .
Denote the -hypersurfaces of the simplex by . Then
[TABLE]
But each is contained in the associated “cone substracting ellipsoid” of given by Corollary 6.9 if we take , suitably small, , and suitably large. It follows that , so .
Below we can assume for a fixed large constant .
Take , suitably small, in Lemma 6.8, then by the same argument, the corresponding cones associated with cover all of . It follows that
[TABLE]
for all . Hence we can find a constant such that
[TABLE]
uniformly in . Take , then , and
[TABLE]
and the proof is complete.
It remains to prove Lemma 6.8.
For convenience, we replace the given by , , and prove the same result. This reduction is justified by taking an affine transformation of determinant and some rescaling.
We prove the lemma for .
Let , , , , . We now estimate .
For , let , . Since , we have
[TABLE]
So that for all , and thus .
Also, for all , we have
[TABLE]
Thus
[TABLE]
Here denotes the ray with initial point that passes . Notice, in the last line, is empty if for some . Thus, only if all are contained in a cap on of radius (use the canonical distance on ).
Now we write , where is a collection of caps of radius on the sphere with such that each cap on with radius is contained some . Now (9) further gives
[TABLE]
Fix an . We now estimate .
Denote the unit normal vector in the direction from [math] to the center of by . Since and , one can check that (which implies ) unless . Below we shall assume . By symmetry we further assume .
Denote . Take , . Then one can check that is contained in the plank between and .
Let
[TABLE]
Then , , and that
[TABLE]
Denote , , then
[TABLE]
Thus
[TABLE]
and
[TABLE]
Now we have
[TABLE]
Summing up all in (9), we get
[TABLE]
Thus
[TABLE]
The proof for Lemma 6.8, and thus for Theorem 6.6, is complete.
7. Proof of Theorem 4.5
We can first find some balls of radius such that are pairwise disjoint and that
[TABLE]
Denote , . Then we have , and that by (4)(11) (here and below, the implicit constant may depend on ),
[TABLE]
Assume . Then
[TABLE]
Thus , and . Now, we see that the theorem follows if we can prove the statement for replaced by (with a possibly larger constant ).
Thus, we may as well assume at the beginning that all are contained in a ball of radius .
Then, by an application of pigeonhole principle, we may assume that all tubes have direction contained in a -cap. Moreover, using the trick in the proof of Lemma 3.7, we may also assume there is a point such that all tubes are within vertical distance with respect to . Without loss of generality let be the origin, assume all tubes have direction within of the vertical direction (the last coordinate).
At this point, we use the arithmetic method first introduced by Bourgain [3] to prove the following result.
Proposition 7.1**.**
Suppose (11) holds. Then there exists a collection of -separated directions with such that for all , where
[TABLE]
Proof 12*.*
We may assume has the properties as remarked above.
Denote , . Then for all , intersect each tube in at an -ellipsoid whose axes all have length within . Let , , then .
Pick any , then
[TABLE]
tells us that there exists such that . Denote . Then and , .
For , let , . Then for a suitably chosen small constant , we have
[TABLE]
Now pick any , for each . Then . Moreover, for any , by pigeonhole principle (note that ) there are tubes with , .
Identify with its projection in . Let , , , . Then by the remarks above we have
[TABLE]
[TABLE]
Suppose maps at most points to one point. Apply Lemma 5.3, we see that
[TABLE]
In other words . Thus there exists some being the image of tubes under . This means there are tubes with direction within of the direction determined by the vector (note again that ). By pigeonhole principle there exists a direction with .
On the other hand, by definition of and pigeonhole principle,
[TABLE]
so .
Above, all implicit constants depend only on . Now if we enlarge to and do the same argument, we see that for any subcollection of with cardinality , we can always find a direction with . Hence the proposition follows when we repeat this argument times.
Now back to the proof of Theorem 4.5. The theorem follows if we prove the corresponding result for replaced by , which we now assume. Denote . Let , then everywhere by the bush argument in the proof of Theorem 2.1. We have
[TABLE]
Equality implies in some with . Thus
[TABLE]
Again, equality implies that there is some with such that
[TABLE]
Let , . We can choose a certain such that .
By applying a rotation (and loosen the constant to in the assumption that all tubes have direction within of the vertical direction) if necessary, we assume is the vertical direction. For with some center , let be the tube with vertical direction, radius , height , and center , where is the projection map onto . Recall is within vertical distance with respect to [math], we see that . Denote identified with a subset of . Then , is -discretized, , , and that by (39),
[TABLE]
On the other hand,
[TABLE]
holds for all . Now equality in (40) implies there exists some with such that
[TABLE]
For any set , , denote
[TABLE]
Under this notation, a similar continuization argument (in the reverse direction) as in the proof of Theorem 4.3 shows that
[TABLE]
where is a constant depends only on and the implicit constant in (41), that is to say, .
Next, we show that there exists convex with .
Case 1: .
Then (42) becomes . Thus we can find an interval such that by definition of . This is actually an (approximate) equality since .
Case 2: .
By definition of , we see that . Thus (42) further gives
[TABLE]
This means . Now the existence of follows from Theorem 6.6.
Let us finally finish the proof of Theorem 4.5.
By replacing by a slightly larger set if necessary, we may assume that is a box in (see [5]). Suppose the shortest side of has length . Then the intersection of any ball of radius in with has volume . Since is the union of such balls, we see that . By choice of it follows that .
Since , we see that intersects with tubes in the union. Replacing by a slightly larger box if necessary (notice , so this will not change too much), we may assume contains such tubes , and thus contains tubes in .
Since , by (39) we see that
[TABLE]
But for all . Equality in (43) shows that there exists and with , such that
[TABLE]
For all , this further implies there is a segment, say , of length contained in with the same direction as , such that . Then is easily seen to be contained in the box
[TABLE]
where “” denotes the Minkowski sum of sets. Hence, is contained in , where is the -neighborhood of .
Now and contains all tubes in , where . Since all are contained in a ball of radius and have direction within of the vertical direction, we can find a box with and such that contains tubes in . Let be the -neighborhood of , then satisfies all the requirements in our statement. The proof is complete.∎
8. Acknowledgements
This research was done during the 2019 Summer Program of Undergraduate Research (SPUR) of the MIT Mathematics Department. First of all, I want to thank my mentor Yuqiu Fu who has provided many insightful ideas and spotted numerous errors I have made. I also want to thank Professor Larry Guth for the proposal of the original problem and Professor David Jerison for the suggestion of considering the inverse problem. Finally, I thank my mother for her constant support, without which I would undoubtedly fail to complete this work.
The reference list from the paper itself. Each links out to its DOI / PubMed record.
- 1[1] Gerald Beer, The index of convexity and parallel bodies , Pacific Journal of Mathematics 53 (1974), no. 2, 337–345.
- 2[2] Jean Bourgain, Besicovitch type maximal operators and applications to fourier analysis , Geometric and Functional analysis 1 (1991), no. 2, 147–187.
- 3[3] by same author, On the dimension of kakeya sets and related maximal inequalities , Geometric and Functional Analysis 9 (1999), no. 2, 256–282.
- 4[4] Michael Christ, Estimates for the k-plane transform , Indiana University Mathematics Journal 33 (1984), no. 6, 891–910.
- 5[5] Peter M. Gruber, Chapter 1.10 - aspects of approximation of convex bodies , Handbook of Convex Geometry (P.M. Gruber and J.M. Wills, eds.), North-Holland, Amsterdam, 1993, pp. 319 – 345.
- 6[6] Nets Hawk Katz and Terence Tao, Bounds on arithmetic projections, and applications to the kakeya conjecture , Mathematical Research Letters 6 (1999), no. 6, 625–630.
- 7[7] by same author, New bounds for kakeya problems , Journal d’Analyse Mathématique 87 (2002), no. 1, 231–263.
- 8[8] Peter Mani-Levitska, Chapter 1.1 - characterizations of convex sets , Handbook of Convex Geometry (P.M. Gruber and J.M. Wills, eds.), North-Holland, Amsterdam, 1993, pp. 19 – 41.
