Regularized Brascamp-Lieb inequalities and an application
Dominique Maldague

TL;DR
This paper introduces a regularized form of the Brascamp-Lieb inequalities, extending their applicability and leading to a generalized multilinear Kakeya inequality, with implications for harmonic analysis.
Contribution
It proposes a novel regularization of the Brascamp-Lieb inequalities and demonstrates their application to a broader multilinear Kakeya inequality.
Findings
Regularized Brascamp-Lieb inequalities established.
Generalized multilinear Kakeya inequality derived.
Potential applications in harmonic analysis explored.
Abstract
We present a regularized version of H\"{o}lder-Brascamp-Lieb inequalities studied by Bennett, Carbery, Christ, and Tao. These inequalities lead to a generalization of the multilinear Kakeya inequality.
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.
Regularized Brascamp-Lieb inequalities and an application
Dominique Maldague
Department of Mathematics
Massachusetts Institute of Technology
Cambridge, MA 02142-4307, USA
Abstract.
We present a certain regularized version of Brascamp-Lieb inequalities studied by Bennett, Carbery, Christ, and Tao. Using the induction-on-scales method of Guth, these regularized inequalities lead to a generalization of the multilinear Kakeya inequality.
By Brascamp-Lieb inequalities, we mean inequalities of the form
[TABLE]
where the are nonnegative, measurable functions, is a -tuple of linear maps from to , and . A related quantity is the smallest constant which satisfies the above inequality for all nonnegative input functions , denoted by . Locally bounded properties of lead to multilinear Kakeya inequalities: Guth [13] first did this for a special case and Bennett, Bez, Flock, and Lee [3] extended Guth’s approach to data satisfying . The motivation for this paper is to formulate a regularized version of which leads to multilinear Kakeya inequalities in the case that we do not have finite Brascamp-Lieb data (see below for further discussion of multilinear Kakeya).
Some of the most fundamental inequalities of this form are Hölder’s inequality and Young’s convolution inequality. In [7], Brascamp and Lieb determined the optimal version of Young’s convolution inequality (also proved independently by Beckner in [2]), and proved a generalized Young’s inequality for more than three functions. Barthe gave a concrete description of when in the rank one case (all ) [1]. In 2008, Bennett, Carbery, Christ, and Tao (BCCT) determined the criterion for [4]. BCCT also investigated extremal configurations and variants of the Brascamp-Lieb inequality in [4] and [5] respectively.
In this paper, we consider the following regularized version of (1):
[TABLE]
where the are nonnegative, measurable functions that are constant on cubes in the unit cube lattice of , meaning on all sets of the form where . The optimal constant for this inequality is defined by
[TABLE]
where the supremum is taken over with nonzero, nonnegative functions that are constant on each cube in a unit cube tiling of . The goal of this paper is to identify the growth rate of as a function of , which we do in the following theorem.
Theorem 1**.**
Let , , and . For each , let be an integer satisfying and let be a surjective linear map. There exist constants , depending on and , which satisfy
[TABLE]
for all , where the supremum is taken over all subspaces of .
Since the value of does not change if we replace by , it is no loss of generality to assume that the are surjective. The quantity is finite because
[TABLE]
Also note that if the supremum defining were taken over nonnegative which were not necessarily constant on the unit cube lattice of , then is not necessarily finite (see Theorem 2.2 in [5]).
One motivation for understanding the regularized Brascamp-Lieb inequality is to extend multilinear Kakeya results. First formulated in 2006, the multilinear Kakeya inequality is an -measurement of how much tubes in different directions can overlap. Let be a collection of neighborhoods of lines in that are sufficiently parallel (independent of ) to the -axis, where is the standard basis vector. The multilinear Kakeya inequality states that
[TABLE]
for . For the endpoint exponent and the special case that the are parallel to the , (4) is just the Loomis-Whitney inequality, a special Brascamp-Lieb inequality. Thus multilinear Kakeya can be regarded as a generalization of Loomis-Whitney.
Bennett, Carbery, and Tao proved (4) in 2006 without an epsilon loss away from the endpoint (which implies the endpoint with an epsilon loss by Hölder’s inequality) [6]. In 2009, Guth eliminated the loss factor using an alternative proof involving Dvir’s polynomial method approach to the analogous problem over finite fields [12, 9]. Guth reproved a weaker, truncated version of the multilinear Kakeya inequality with a simple induction on scales argument in [12].
Since the multilinear Kakeya inequality is a generalization of Loomis-Whitney, it is natural to wonder if there are analogues of the multilinear Kakeya inequality which are generalizations of Brascamp-Lieb inequalities. Bennett, Bez, Flock, and Lee [3] proved a stability property of the Brascamp-Lieb constant which combined with Guth’s induction on scales result, led to a truncated multilinear Kakeya inequality with losses for finite Brascamp-Lieb data (meaning ). Zhang further developed Guth’s polynomial method proof in [12] to prove that these losses could be removed [14].
In this paper, we prove a multilinear Kakeya result without any assumptions on the Brascamp-Lieb data. Instead, a factor which controls the regularized Brascamp-Lieb constant appears in the upper bound. To describe our generalized (truncated) multilinear Kakeya inequality, fix some notation. Let be a -tuple of orthogonal projections from to subspaces where has dimension . Let . We will consider affine subspaces which, modulo translations, are within a distance of the . Here distance is the standard metric on the Grassmann manifold of -dimensional subspaces of .
Theorem 2**.**
Fix and orthogonal projections from onto . Then there exists satisfying for every , there exists such that
[TABLE]
holds for all finite collections of -neighborhoods of -dimensional affine subspaces of which, modulo translations, are within a distance of the fixed subspace .
Using a small variation of the induction-on-scales method of Guth [13], Theorem 2 follows from Theorem 1 and the locally-bounded result Theorem 5 below, which follows from work in [3]. Theorem 5 shows that the asymptotic growth rate in of is stable under perturbation of . A similar stability for the implicit constant in the upper bound of Theorem 1 is less clear, but turns out not to be necessary for proving Theorem 2.
The following theorem is a locally uniform bound for , but which only achieves the expected sharp growth rate in for certain exponents . Let and for each , .
Theorem 3**.**
Fix and orthogonal projections from onto . Then there exist and such that
[TABLE]
holds for all orthogonal projections where is an -dimensional subspace of which is within a distance of .
We remark that the power of in Theorem 3 above matches that in Theorem 1 (with ) if for all , but can be larger in general. Indeed, a helpful reviewer pointed out the example in for which , , and with exponents . In this case the power of in Theorem 1 is while in Theorem 3 above, we have . Also observe that Theorem 2 above implies an -loss version of Theorem 3 with the optimal growth rate .
An earlier draft of this manuscript had a stronger version of Theorem 3 which was not fully justified. The proof of Theorem 2, which was used in the later work [11], was edited in the present manuscript to no longer rely on Theorem 3 at all (see §4). This adjustment was facilitated by private correspondence with the authors of [11], and I am particularly appreciative of Ruixiang Zhang for helping with the revised proof.
In §2, we describe the example given by BCCT in §5 of [5], which proves the lower bound in Theorem 1. The upper bound in Theorem 1 follows as a corollary of the more technical Proposition 4 discussed in §3. The proof of Proposition 4 follows the inductive arguments of BCCT in the proofs of Theorems 2.1 and 2.5 of [5]. In §4, we discuss the proof of Theorem 2 and Theorem 3. The author wishes to thank Larry Guth for bringing this problem to her attention and to thank Michael Christ for valuable conversations.
1. Funding
The author was supported by an National Science Foundation Graduate Research Fellowship under Grant No. [DGE 1106400].
2. Lower bound for
In this section, we describe the example given by BCCT in §5 from [5]. We use this example to demonstrate that there exists satisfying
[TABLE]
Proof of the lower bound for from Theorem 1.
Fix a vector and surjective linear maps . Let be a subspace. For a subspace let denote linear projection onto . Define the collections
[TABLE]
and let be the indicator function of the set , where .
Let be a constant we will define independently of . Define the set by
[TABLE]
Let be the operator norm of so that for all and . Choose , which guarantees that . Now verify that if , then for all : Write uniquely as where and . By the definition of , and , which implies that and . Then
[TABLE]
and
[TABLE]
It follows from these displayed inequalities that , which holds for all . Putting everything together, we have
[TABLE]
for a constant which depends on the dimension . Using the inclusion
[TABLE]
and that is the indicator function of , obtain the final inequality
[TABLE]
where is a constant depending on . ∎
3. Upper bound for
The upper bound from Theorem 1 follows as a corollary to Proposition 4 below. The proof of Proposition 4 proceeds in an analogous way as the proofs of Theorems 2.1 and 2.5 in [5]. We introduce some notation before we state the proposition. Let , be subspaces and let be surjective linear maps. For each , fix a subset which satisfies , where . For a parameter and a function , define the quantity
[TABLE]
where .
Proposition 4**.**
Let . Suppose , , , and are given as above. Then there exist parameters , for , and a constant such that
[TABLE]
for all and all nonnegative, measurable functions .
Granting this proposition, we first prove the upper bound from Theorem 1.
Proof of the upper bound for .
Take , , and in Proposition 4. It follows from the proposition that there exist constants such that
[TABLE]
for all and all measurable functions . Consider functions which are constant on cubes where . Then
[TABLE]
which finishes the proof. ∎
Proof of Proposition 4.
Without loss of generality, assume that for all . If , then Proposition 4 follows from Theorem 2.5 in [5], so it suffices to assume that the supremum is positive. Fix the notation and . We proceed by induction on the dimension .
Begin with the base case . In this case, for all . If , then choose so that . Using the generalized Hölder’s inequality,
[TABLE]
where is from the subsitution . For each ,
[TABLE]
which finishes this case.
The other case is that . Let . Then by the generalized Hölder’s inequality,
[TABLE]
This concludes the base case.
Next consider the case where the ambient dimension is . Furthermore, assume we are in the subcase where there exists a proper subspace such that
[TABLE]
Define coordinates and write
[TABLE]
For each , let and be the linear projections. Define the subsets to be the collections of satisfying . Then contains the collection of such that has nonempty intersection with , from which it follows that covers . Since , by the inductive hypothesis (using the linear maps ), there exist (depending on the maximum of , , and ) such that
[TABLE]
for all . Let . The maps are clearly surjective because . For each , define by , so . Now analyze the quantities on the right hand side of the displayed inequality above.
[TABLE]
where in the last line, we used the fact that since , . Note that for each , the number of which satisfy is controlled by a dimensional constant times . This means that
[TABLE]
Putting this together with (6) and (7), we have
[TABLE]
where depends on dimensions, , , and . The growth rate of is not a concern since the number of steps in our induction is finite. For , define
[TABLE]
It remains to bound
[TABLE]
Fix the subset of that satisfy . The subset has the property that covers . Using that is surjective (discussed above), by the inductive hypothesis, there exist constants such that
[TABLE]
For any subspace ,
[TABLE]
and for each ,
[TABLE]
Using the above equalities and the inequality
[TABLE]
which holds because of the subcase we are in, conclude that for all . This means that the power of that appears on the right hand side of (8) is 0, and we may let tend to infinity on the right hand side to integrate over all of . Summarizing our results for this subcase, we have
[TABLE]
Observe that for each ,
[TABLE]
For each , the number of such that
[TABLE]
is bounded by
[TABLE]
which is controlled by a constant depending only on dimension, , and . Also use the fact that covers to bound the quantity in (9) by
[TABLE]
which finishes this subcase.
Now suppose that the ambient dimension and that all proper subspaces satisfy
[TABLE]
Consider the set of all -tuples such that
[TABLE]
for all proper subspaces . Equivalently, equals the intersection
[TABLE]
This is the intersection of with finitely many closed half-spaces (even though there are infinitely many subspaces , there are finitely many vectors ). Therefore has finitely many extreme points, and since is compact and convex, equals the convex hull of its extreme points. If we prove the result for the extreme points , an application of complex interpolation says that if where , then
[TABLE]
so it suffices to consider the extreme points.
Next we want to show that where
[TABLE]
Observe . Consider and any index . Then for the subspace , satisfies
[TABLE]
This leads to
[TABLE]
which means and thus .
If is an extreme point of , then at least one of the inequalities defining must be equality. If
[TABLE]
for some proper subspace , then we are in subcase 1 above. The alternative is that for at least one . In that case, we are trying to prove that there exist so that
[TABLE]
This follows from induction on the number of factors with base case . When , for appropriate constants depending on ,
[TABLE]
By Hölder’s inequality, this is bounded by
[TABLE]
for an appropriate constant and where we used that covers in the final inequality.
∎
4. A generalized multilinear Kakeya inequality
In order to prove Theorem 2, we first prove a stability condition in the form of Theorem 5. Theorem 2 is proved using the induction-on-scales approach of Guth [13].
Begin with Theorem 5, which records the local boundedness of the growth rate of in as a function of . Theorem 5 states a version of the result in §2.1 in [3] and we reproduce their argument (and some notations) here for completeness.
Theorem 5** ([3]).**
Fix and orthogonal projections from onto . Then there exists such that
[TABLE]
holds for all orthogonal projections where is an -dimensional subspace of which is within a distance of the fixed subspace .
Proof.
Let and let denote the compact set of all orthonormal sets of vectors in . Fix and let . For each , choose a subset satisfying ,
[TABLE]
and
[TABLE]
Since is continuous for each , there exists such that for each whenever and . In particular, for each , so
[TABLE]
Recall that is compact, so there exists a finite collection so that the sets
[TABLE]
with cover . Finally, choosing , conclude that if (in the sense of Theorem 5), then for any , there is some from compactness so that
[TABLE]
Since the number of is bounded by dimension, Theorem 5 is proved.
∎
Next, we prove a weaker version of Theorem 2 in the form of the following proposition. This proposition follows the argument of Guth in [13]. It is similar to the argument described in [3], except that we do not use any locally uniform control over the (regularized) Brascamp-Lieb constants. An analogous proof could have been used in [3] to prove their Theorem 1.2 without relying on their Theorem 1.1.
Proposition 6**.**
Fix and orthogonal projections from onto . There exists so that the following is true. Let be orthogonal projection maps, where the are -dimensional subspaces within of the . For every , there exist and so that
[TABLE]
holds for all finite collections of -neighborhoods of -dimensional affine subspaces of which, modulo translations, are within a distance of the fixed subspace .
Proof.
Let be given and let be given by Theorem 5. Suppose that are given as in the statement of Proposition 6.
We follow the multi-scale argument of Guth which analyzes the following quantity. Define to be the smallest constant in the inequality
[TABLE]
where the are arbitrary finite collections of -neighborhoods of -perturbations of . The multi-scale relationship relates to .
Partition into axis parallel cubes of sidelength . Then
[TABLE]
Let be a -neighborhood of an affine subspace which is parallel to and so that . For each ,
[TABLE]
where we used that is a cube in of sidelength and is a 1-neighborhood of an -dimensional affine subspace of , and so Theorem 1 applies. Now let , where is large enough so that implies . Then for each , , so
[TABLE]
Using this in (11) and with (10) leads to
[TABLE]
This proves that for a constant which is allowed to depend on ,
[TABLE]
Now use the multi-scale inequality. Iterate it times to obtain
[TABLE]
By Theorem 1 and Theorem 5, because is a -perturbation of , there exists so that
[TABLE]
It follows from this and (12) that
[TABLE]
Choose so that and take so that . It follows using the trivial bound that
[TABLE]
This proves the proposition, where .
∎
Finally, we prove Theorem 2 using Proposition 6.
Proof of Theorem 2.
Let be given and let , where is given by Theorem 5 (which is the same from Proposition 6). This parameter depends on the fixed subspaces . We finish the proof of Theorem 2 using a compactness argument.
Let denote orthogonal projection maps, where the are -dimensional subspaces within of the . For each , let the parameters be given by Proposition 6 and write to denote the open rectangle which is the product of -neighborhoods of with respect to the Grassmanian metric on -dimensional subspaces.
Let denote the closed -neighborhood of and consider the -fold product , which is compact. The open rectangles cover , so we may extract a finite subcover indexed by . Let . For each , cover by a finite set of .
The number of needed for the to cover is determined by fixed dimensions, , and the numbers . Since the set of themselves depends on the fixed , , and , this number of is an acceptable contribution to the constant in the statement of Theorem 2.
We have covered by at most many -cubes, each of which is contained in some (where there are at most many ). Write for the collection of which are also in the -neighborhood of . Then by pigeonholing,
[TABLE]
The tuple is contained in , and therefore there is some so that is within of for each . Then is a collection of -neighborhoods of affines subspaces which are within of for each . Since the rectangle of -neighborhoods of is contained in the rectangle of -neighborhoods of , and by definition, , conclude that is a collection of affine subspaces within of for each . This means that we may control the right hand side of (14) by Proposition 6. Since there are many , we are done.
∎
5. Some stability of
In this section, we describe a concrete stability result using the factoring-through-critical subspaces argument from [4]. In order to keep track of the implicit constant, we factor through one-dimensional subspaces at a time, sacrificing the probable optimal growth rate in except for special cases of exponents . Let be a vector space of dimension , be -dimensional subspaces of , and .
Notation 7**.**
Let be nontrivial dimensional subspaces and let , which is -dimensional.
Notation 8**.**
Let also be dimensional subspaces and write , which is -dimensional.
Definition 9**.**
Suppose that and are orthogonal projection maps. For , means that for each , is within a distance of in the usual Grassmanian metric on -dimensional subspaces.
Definition 10**.**
For each , fix a subset which satisfies , where . For a subspace and a function , define the quantity
[TABLE]
Notation 11**.**
For vectors , let denote the linear span of . For each , will denote the orthogonal complement of in (and the same for ).
Lemma 12**.**
Fix . There exists a basis of , a small parameter , and a constant such that the following holds. If satisfies , then for each ,
[TABLE]
and
[TABLE]
for all . Furthermore, for each and ,
[TABLE]
Proof.
We describe an algorithm for choosing the vectors .
Choose a unit vector so that for all . Then for all , so for sufficiently small,
[TABLE]
whenever .
Now suppose that have been chosen to satisfy the properties in the lemma until . Let be the set of indices for which . First suppose that is nonempty. Choose a unit vector such that (recall that ). Then for each , . This is because if there were constants so that , then , which contradicts how we selected . Thus for each ,
[TABLE]
For sufficiently small and appropriate , this also guarantees that
[TABLE]
whenever and , and verifies property (16) for . If , then . For sufficiently small , we also have whenever and . Then , so
[TABLE]
If is empty, then choose to be any orthonormal basis of in and the induction ends. Since is empty, for each , and for sufficiently small , whenever . Thus
[TABLE]
for each and .
∎
Definition 13**.**
For each , let .
Proof of Theorem 3.
In this argument, all constants are permitted to depend on and , but not on . Consider the integral
[TABLE]
Let and be as in Lemma 12. Express in terms of this basis as , where . Perform a change of variables and use Fubini’s theorem to bound the above integral by
[TABLE]
where the constants only depend on and the specific basis we fixed from Lemma 12. Each set is a subset of . For each , consider the innermost integral
[TABLE]
Let . Apply the 1-dimensional base case in the proof of Proposition 4 to obtain the upper bound
[TABLE]
The exponent depends on and is negative. Since each of the are bounded below by Lemma 12, there is a constant so that the previous displayed math is bounded by
[TABLE]
For each , let and let
[TABLE]
Here the notation is the orthogonal complement of inside of . The maps are clearly surjective because . For each , define by , so . Now analyze the quantities that appear in (19).
[TABLE]
where in the last line, we used the fact that since , . Note that for each , the number of which satisfy is controlled by the ambient dimension . This means that
[TABLE]
Putting everything together so far, we have bounded (18) by
[TABLE]
where depends on and .
Now suppose that the integral (18) is bounded by a constant factor times
[TABLE]
where . The maps are defined by
[TABLE]
By construction of the , either or for depending only on . Furthermore, if , then for all . In that case, for each ,
[TABLE]
so we may ignore this constant factor from the integral (20) above. Assume without loss of generality that for each . Then apply the one-dimensional base case of the proof of Proposition 4 to obtain for each
[TABLE]
The norms on the right hand side are equal to
[TABLE]
It suffices to sum over lattice points and which are within a distance of and respectively. Similar to an analogous step in the proof of Proposition 4, (21) is bounded by
[TABLE]
where . Here we used that both and are contained in . For each , the number of such that
[TABLE]
is controlled by a constant depending only on dimension. Also use the fact that covers to bound the quantity in (22) by a constant multiple of
[TABLE]
This concludes the intermediate inductive step.
Finally, consider the result of this induction. We have shown that (18) is bounded by a constant multiple of
[TABLE]
The nonnegative input functions in the definition of are assumed to be constant on cubes in the unit cube lattice of , where we identify (with the induced metric from ) isometrically with . Then for a dimensional constant ,
[TABLE]
It remains to check that the exponent of is the desired quantity. By the construction in Lemma 12, if and if . Define indexing sets . Then for each ,
[TABLE]
Note in addition that if for each , then for each , ,
[TABLE]
In this case,
[TABLE]
∎
The reference list from the paper itself. Each links out to its DOI / PubMed record.
- 1[1] F. Barthe, On a reverse form of the Brascamp-Lieb inequality , Invent. Math. 134 (1998), 335–361.
- 2[2] W. Beckner, Inequalities in Fourier analysis , Annals of Math., 102 (1975), 159–182.
- 3[3] J. Bennett, N. Bez, T. Flock, and S. Lee, Stability of the Brascamp-Lieb constant and applications , Amer. J. Math. 140 (2018), no. 2, 543-569.
- 4[4] J. Bennett, A. Carbery, M. Christ, and T. Tao, The Brascamp-Lieb inequalities: finiteness, structure and extremals , Geom. Funct. Anal. 17 (2008), no. 5, 1343–1415.
- 5[5] J. Bennett, A. Carbery, M. Christ, and T. Tao, Finite bounds for Hölder-Brascamp-Lieb multilinear inequalities , Math. Res. Lett. 17 (2010), no. 4, 647-666.
- 6[6] J. Bennett, A. Carbery, T. Tao, On the multilinear restriction and Kakeya conjectures , Acta Math. 196 (2006), no. 2, 261–302.
- 7[7] H. J. Brascamp and E. H. Lieb, Best constants in Young’s inequality, its converse, and its generalization to more than three functions , Adv. Math. 20 (1976), 151-173.
- 8[8] E. A. Carlen, E. H. Lieb, and M. Loss, A sharp analog of Young’s inequality on S N superscript 𝑆 𝑁 S^{N} and related entropy inequalities , Jour. Geom. Anal. 14 (2004), 487–520.
