On the boundedness for the bilinear quadratic functional given by arbitrary strips
Abstract.
This study provides initial results on the boundedness of the (smooth) bilinear quadratic functional defined by an arbitrary collection of disjoint strips. The square function under consideration is a combination between the well-known Rubio de Francia square function from the linear setting with the bilinear Hilbert transform’s singularity structure, which involves modulation invariance.
Key words and phrases:
Bilinear Fourier multipliers, Orthogonality2000 Mathematics Subject Classification:
42A45Contents
1. Introduction
In this work, we aim to give a first result concerning the boundedness of the bilinear square function, built on the BHT (bilinear Hilbert transform) structure and an arbitrary collection of strips.
Let us first review this topic which originates to the work of Rubio de Francia [10]: consider an arbitrary collection of disjoint open intervals of the real line, then the associated (sub)linear square function
is bounded in for every , where here stands for the non-smooth frequency projection on
This important result encodes the orthogonality of the projections due to the disjointness in frequency, in any Lesbesgue spaces , . If for some specific configurations (for example the dyadic intervals ) one can enlarge the range of boundedness, it is known that for the general statement the range is the maximal one.
We refer the reader to [2] for more details about the literature on this topic and to its bilinear version. In fact, if on the real line, the frequency domain has a simple geometry (described by a collection of intervals), in the bilinear context the frequency domain is the plane and there could be far more subtle geometric aspects (curvature, bi-parameter, invariance by non-trivial modulation, …).
So now, consider a collection of disjoint arbitrary open subsets of , we can consider the bilinear quadratic functional
where now is the bilinear projection
For more details about the literature, we move the reader to the introduction in [2], where the problem has been solved for beeing an arbitrary collection of squares in the smooth case in [2] (i.e. with a smooth cutoff as symbol instead of the non-smooth characteristic function) and then later in the non-smooth case in [8]. The result as also been extended to the setting of an arbitrary collection of rectangles, see [9].
This current work is dedicated to the situation where is a disjoint collection of parallel strips. Indeed, the geometry of a strip is motivated by the geometry of the BHT (bilinear Hilbert transform): we identify a strip (parallel to the first diagonal) to an interval by
One can then consider its (non-smooth) bilinear projection
which is equal to a linear combination between the identity and some modulated BHT’s, where the bilinear Hilbert transform BHT is given by
We recall that the BHT is bounded (see [13, 14]) from to for every exponents such that their inverse belong to the range ( will always be the dual exponent of , defined by and which can be negative since can be smaller than )
Following the analogy of Rubio de Francia’s result, it is then natural to try to understand if there is also some orthogonality aspects in this bilinear setting: to an arbitrary disjoint collection of intervals, identify the collection of disjoint strips (such that are disjoint) and to look for boundeness of the quadratic bilinear functional
This question has been studied by the author in [7] under the condition that the strips have all the same length, which allowed to use a BHT time-frequency analysis, combined with some -vector valued arguments.
Up to now, there is no results in the literature dealing with an arbitrary collection of strips and such a question seems to be quite challenging. We also move the reader to the introduction in [3, 4] and mostly [4, Paragraph III in Section 1.2.3], where different problems (even more difficult) related to this question have been described.
This work aims to provide a first answer, dealing with the smooth situation. So we start with a collection of disjoint strips , that we identify by its interval with
Associated to , we build the smooth bilinear projector
with a compactly supported function in and adapted to it (i.e. for sufficiently enough integers , ). To such a collection , one can consider the bilinear square function
If in the linear setting the -result is trivial (by -orthogonality), there is no similar easy results in the bilinear setting. The linear -range (where the exponent and its dual is larger than ) has a bilinear counterpart which is the (strict) local range:
Our main result is the following:
Theorem 1.1.
Let be a disjoint collection of strips: are pairewise disjoint. Then for every , there exists a -neighborhood of the local range such that for every exponents satisfying , the square function is bounded from to with and a uniform bound (with respecto to ) of order
Remark 1.2.
So our result is the first result dealing with an arbitrary collection of disjoint strips (up to an -loss) and the statement can be thought as the bilinear version of the -boundedness in the linear context. As we will see, the proof is far more delicate and subtle than in the linear setting !
As it will be proved, can be taken for example of the form
We already know that
where is the bilinear maximal function (since for every , the smooth bilinear operator is pointwisely controled by ). We know (see [12]) that is bounded in the BHT range . So by interpolation we get the following:
Theorem 1.3.
Fix exponents with . One has for every ,
with
About the optimality of the range (up to the parameter as small as we want), one coud follow an analogy between the linear theory and the bilinear theory, and by observing that the quadratic functionals are not symmetric, we could expect the following:
Conjecture 1.4.
For every collection of disjoint strips , every and every exponents such that then uniformly in the collection , we might have
for given by (and maybe even without the loss ).
Remark 1.5.
-
(a)
A similar conjecture could also be formulated in the context of [2], where an arbitrary collection of squares is considered; however, even this simpler case remains unsolved. While the proof does not rely on symmetric arguments for the functions and for the dualizing functions , it appears that the proof only works in the stated range which is symmetric.
-
(b)
In the context where the strips have same (or equivalent) width, then in [11] it has been proved the estimate for , without any loss .
-
(c)
Moreover all these questions can be extended to the non-smooth context, where the symbol in is replaced by the characteristic function . In such a non-smooth setting, it is only known the boundedness in the strict local- range for strips of the same width – see [7] and an estimate is proved without any loss.
The proof of Theorem 1.1 will follow the approach developped in [2] for squares, and that we adapt here for strips. It goes through a size/energy argument after having defined the suitable quantities and a reshuffling of the frequency geometry into columns and rows. With respect to [2], the main difference is the following one. In [2] we were considering -functionals over a collection of squares, for – which by duality means to consider some -sequence of functions. If a strip can be discretized by a collection of squares, the main obstacle will be that we cannot sum over these square in , since . So the main idea will be to define a new energy for the dual functions which will be a quantity. Indeed, since we can only hope to sum in over the squares along a fixed strip, then by ’homogenity’ we have to sum in the strips as well. That will be done up to a loss in terms of to the power with and it will be necessary in several occasions that (which will then become the in the statement).
2. Discrete model operators and interpolation
2.1. Reduction to a well-distributed collection of strips
In the linear setting, namely Rubio de Francia’s work [10], a first step is to reduce the study to the case of a well-separated collection of intervals, which is a slightly stronger condition than the disjointness: a collection of interval is said to be well-separated if111The numerical constant is not important and could be replaced by any constant .
| the collection is pairwise disjoint. |
In this current work, we will need to discretize the strips by squares (in order to apply some time-frequency analysis involving tiles) which will have to be mutually disjoint (when coming from different strips). Hence we will need to use the property of well-separated and we first explain how in the smooth case, this is easily doable to assume.
Proposition 2.1.
To prove Theorem 1.1, we may assume that the collection of strips or more precisely of intervals is well-distributed.
Proof.
We start with an initial collection which is only disjoint. Then for every interval we consider its Whitney covering (partition) by dyadic intervals: with dyadic intervals such that
and denote for
so that we have
We then consider a partition of the unity associated to the covering , so that
and each beeing adapted to , which means that and for sufficiently large integers .
So then we decompose
By the properties of construction, is supported and adapted to the union of two intervals which constitute a well-separated collection and are uniformly bounded by . So if we assume that the result is true for such collections, we deduce that for every , the corresponding square function is bounded with an extra and then we conclude by using that pointwisely
∎
So from now on and in all the remaining part of this work, we will assume that the collection of intervals is well-separated.
The next step of the reduction is to discretize the square function and to use multilinear interpolation to reduce to restricted weak-type estimates for the discrete models.
2.2. Reduction to discrete model operators
By duality, to estimate in (), one can test it and use
where we take the supremum over the sequence of functions belonging to and beeing normalized.
In this part is the smooth bilinear projector, so by covering the strip with squares (of scale the one of the strip) and then by performing a windowed Fourier decomposition, it is rather standard that can be decomposed along wave-packets:
Definition 2.2 (Wave-packet).
For a rectangle of area , a wave-packet is a smooth function -normalized which has a frequency support on and is adapted to in frequence and to in space, i.e. for sufficiently large integers and , for every then
For an interval , we denote
where is an exponent as large as required (and which can vary from a line to another one).
By standard arguments, we then have the following decomposition 222Here we denote by the fact that the LHS can be decomposed into a (finite or infinite with fastly decreasing coefficients) sum of terms of the form the RHS.:
where the sum can be restricted to intervals and belonging to a dyadic grid (up to a finite sum of similar terms in order to take into account shifted dyadic grids as well).
So it is sufficient to work on such discrete models. Aiming that we fix the collection of dyadic intervals and we recall the notion of tri-tiles:
Definition 2.3.
A (unitary) tile is the product of two dyadic intervals of area one . A tri-tile is a collection of three tiles sharing the same spatial interval
with the property that . We denote by for a generic (finite) collection of tri-tiles. For such a tri-tile , we will denote the frequency square which will play an important role, interacting with the strips.
With these notions, we are then reduced to the study of the following trilinear form (and to prove bounds, uniformly with respect to any finite collection )
where is a sequence of functions (indexed by the collection of strips) and by , we mean that has to meet and so in particular have to be at the scale of (and more precisely of ). When then where is the strip given by the double interval . Because we assume that the collection of strips is well-distributed that means that such a frequency square will not meet any other strips. So for every there is at most one strip such that . That is an important property and will be implicitely used at many places.
As usual, we will prove boundedness by use of multilinear interpolation and restricted weak-type estimates. For any measureable subset of finite measure, we denote by
and its version (we keep the same notation for simplicity, the context will dictate the use)
In order to prove Theorem 1.1, we know that by multilinear interpolation, it is sufficient to prove some “restricted weak-type” estimates.
Definition 2.4.
For a triple satisfying with and , a trilinear form acting on the Schwartz spaces is said to be of restricted weak-type if for every measurable sets (of finite measure) , there exists a major subset (with ) such that for every functions , and one has
and we denote by the best implicit constant.
The multilinear interpolation (with a slight precaution due to the vector-valued context, see [1, Section 2.2] and [5, Section 2.3]) gives the following:
Theorem 2.5.
Let and such that . Then with if there exists a neighborhood around such that for every , the trilinear (or sublinear) form is of restricted weak-type , then is bounded (admits a countinous extension) from (if ) and
In the case that for some -valued bilinear operator then we have (even if ) that admits a continuous extension from into with
From all these previous reductions, we get that Theorem 1.1 will be a consequence of this one:
Theorem 2.6.
Fix arbitrarily small and consider a collection of well-distributed strips. Then, there exists a -neighborhood of the local range such that for every satisfying and for all finite collection of tri-tiles (and uniformly with respect to it) then the trilinear form is of restricted weak-type with the bound
3. The reshuffling of the collection of tiles
From now, we fix the collection of tri-tiles and we aim to study the trilinear form . Following [2], we re-shuffle the collection in terms of rows and columns, with the following definitions.
Definition 3.1 (Row/Column).
A sub-collection is a row of top if for every ,
We denote the top as .
A sub-collection is a column of top if for every ,
We denote the top as .
Remark 3.2.
Due to the geometry in the frequency plane, we observe that the tiles are mutually disjoint when varies along a row. Similarly, the tiles are mutually disjoint when varies along a column.
As expected (see [2, Definition 2.4]), we say that a sequence of columns is mutually disjoint if they are are disjoint sets of tri-tiles and if are disjoint as well. A sequence of rows is mutually disjoint if they are are disjoint sets of tri-tiles and if are disjoint as well.
Definition 3.3 (Tree/Forest).
A tree is a collection which is either a row or a column and we denote by the spatial interval of its top. A forest is an arbitrary finite collection of trees.
Then, to perform the time-frequency analysis, we need to define suitable quantities (see [2, Definition 3.1]).
Definition 3.4.
For a sub-collection , we define the size for by
For a sub-collection , we define the size for by
For the sequence of functions , we aim to keep a definition in terms of wave-packet coefficients. We refer the reader to the proof of [2, Proposition 2.5] which motivated the notion of size through a maximal function ([2, Definition 3.2]). Here we will keep the quantity appearing at the beginning of the proof and involving the wave-packet coefficients: through all the rest of the work we will use an extra exponent or a parameter jointly defined by which will be used in the technical estimates and will then be related to the parameter in the main statement.
Definition 3.5.
For a sub-collection , we define the size for , as
Remark 3.6.
Since , one has
We will also use the “modified” sizes, encoding only the spatial information: for a function
We now define the energy quantities. For we follow [2, Definition 3.3]:
Definition 3.7.
For a sub-collection , we define the energy for , as
where ranges over all collections of mutually disjoint columns so that
and whose tops satisfy
Similarly for the function , with rows instead of columns.
For the sequence of functions , we will have to modify slightly the energy with respect to [2] and so we set:
Definition 3.8.
For a sub-collection , we define the energy for , as
where ranges over all forests of mutually disjoint rows and mutually disjoint columns satisfying for every
As we will see later (Proposition 4.3), this definition allows to have a -control of the energy which was not the case in [2]. However this is only possible here because we allow a loss in terms of (as we will have in Proposition 4.3). In [2], the setting was simpler (a collection of squares instead of strips as here) but the result was stronger since there was no loss and for that it was necessary to consider the -energy introduced in [2].
To control the trilinear form , we will re-suffle the whole collection into rows and columns (as in [2]) and so we have first to estimate the trilinear form on these elementary sub-collections. That was already done in [2, Proposition 2.5] (so we do not repeat its proof which is relatively easy):
Proposition 3.9 (Column/Row estimate).
Let be a sub-collection of and be a column of . Then we have the following estimate:
If is a row of , then we have similarly
4. Control of the sizes and energies
As usual the size quantities are bounded by the norm and more precisely local -averages (or -averages for ):
Proposition 4.1 (Size estimates).
We have for an arbitrary collection the following estimates:
and with
Proof.
For and , there is nothing to prove since the wave-packets are adapted to their spatial interval.
For , we follow what was done for the proof of [2, Proposition 2.5]. So we fix a tree and we have (with beeing the Hardy-Littlewood maximal function)
Since , one has
We note that for fixed, then along any tree there is only one frequency square which meets and so the corresponding spatial intervals are disjoint (and included in ). So
where we used the -boundedness of the maximal function. Finally by doing a Hölder inequality along , one deduces
Taking the supremum over all trees in , allows us to conclude the estimate. ∎
For the functions , we have the standard energy estimate – see [2, Propositions 3.6 and 5.1]:
Proposition 4.2 (Energy estimates).
For every sub-collection of tri-tiles, one has
If the collection is localized on a spatial interval then we have the local estimates
We aim to have a similar result for the sequence of functions .
Proposition 4.3 (Energy estimates).
Let be any sub-collection of tri-tiles of and a sequence of functions. Then with , we have
If the collection is localized on a spatial interval then we have the local estimate
Proof.
Let us chose a maximiser in the definition of the energy: an integer and a mutually disjoint forest such that
and for every tree
With (where implicitly is the unique strip in intersecting ), we have
where we used Hölder inequality with and then that for beeing fixed, then the frequency tile is fixed when varies along a tree and so the spatial intervals are disjoint (and included in ). So we obtain (by Hölder inequality)
By easy orthogonality arguments (since for fixed, the tri-tiles such that have all the same scale, given by the strip )
with by convention . So we conclude to
which yields (since )
and so allows us to conclude to the (global) energy estimate.
For the localized statement, we just observe that if is localized on then all the previous arguments imply wave-packets also localized in and so one can keep and track the localization at every step. ∎
5. Decomposition lemmas and summation over columns/rows
Through all this section and the next one, we fix the functions and a sub-collection of tri-tiles and we will use the following notations
for the sizes and energies.
For and , we recall the following “selection algorythm” – see [2, Lemma 3.9]:
Lemma 5.1.
Let be a sub-collection of and an integer such that . Then one can extract a collection of columns such that
-
•
the remaining collection satisfies
-
•
the selected columns satisfy
We have a similar lemma for the function with extracting a collection of rows – see [2, Lemma 3.10]:
Lemma 5.2.
Let be a sub-collection of and an integer such that . Then one can extact a collection of rows such that
-
•
the remaining collection satisfies
-
•
the selected rows satisfy
We aim to have a similar lemma for the sequence – see [2, Lemma 3.11] (that we adapt to our new definition of energy in this current setting):
Lemma 5.3.
Let be a sub-collection of and an integer such that . Then one can extact a collection of rows and a collection of columns (both mutually disjoint) such that
-
•
the remaining collection satisfies
-
•
the selected rows and columns satisfy
By iterating these three previous “selection lemmas”, one has the following decomposition:
Proposition 5.4.
Let fix an arbitrary collection of tri-tiles. Then we have a decomposition
where is given by the union of a forest of rows and a forest of columns and satisfy
-
•
Structural decomposition: ;
-
•
Control of the size
-
•
Control of the forests
Moreover is empty if is such that
Similarly, is empty if is such that
6. Boundedness of the trilinear forms
We first prove the following generic estimate: we consider a fix sub-collection of tri-tiles , measurable subsets and functions , , . For each of them, as in the previous section, we denote the global sizes and energies (with respect to ) by , .
Proposition 6.1.
For a sub-collection of tri-tiles, we have: for every with then
Proof.
It is an application of the decomposition – Proposition 5.4:
and for every
For every column , Proposition 3.9 gives
and similarly for every row
Here we used (as in [2, Proposition 2.7]) that by orthogonality along a column or a row, we have
and similarly
So it suffices now to estimate the two components
and
Let us focus on , since the second one is symmetric. By the property given by the “selection algorythms” in Proposition 5.4, one has
and the summation is under the constraint
which can be written as
To compute the geometric sum in , we need to compare the three quantities , and . Aiming that, let us work under the assumption
| (1) |
and we let the reader to check the other situations (which can be dealt with in a very similar way). We will consider the sum in , split into several components (still denoted by ):
-
•
when , then
-
•
when , then
since . So
and we recover the same estimates as previously.
-
•
when , then
and we recover again the same estimate as previously.
From that estimate, as explained in [2, Sections 5 and 6], in order to get the widest (from such estimates) range, it is necessary to go through an extra localization step. This extra step, detailed in [2] could nowadays be explained through the sparse domination point of view (see [6]). It was introduced in [5] when it has been observed that up to a localization, the energy could be ’transformed’ into a power of size. We donot detail and we refer the reader to [2], we will only sketch the argument to track the exponents.
Theorem 6.2.
Let be fixed arbitrarily close to and denote . Then for all exponents and such that and
the trilinear form satisfies the restricted weak-type estimates with a control (uniform with respect to )
Proof.
So we fix arbitrary measurable subsets (of finite measure) and functions , and by homogeneity one can assume . Then we define the ’usual’ exceptional set
for a numerical constant , sufficient large such that and then we set a major subset of . Then we consider also functions and we decompose the initial collection defined as
We refer the reader to [2, section 6], to the following localization step. For integers , there exist three collections of disjoint dyadic intervals and for each of these intervals , there is a corresponding collection such that
-
(a)
Control of the averages:
and similarly for with and with ;
-
(b)
Control of the local sizes: for every
and similarly for with and for and every
-
(c)
Partitions of : for
The fact that we have
comes from the fact that can be estimated by maximal -averages (and not maximal -averages as for ) – see Proposition 4.1.
Then one has
where
and the integers are such that (because they have to be controlled by the size of )
where is as large as we want. Indeed it is standard that because of the definition of the exceptional subset and of then
For every , we apply Proposition 6.1 (with the fact that now the energies which are controlled by local averages are then bounded by for ):
That gives us (since )
Then we will have to sum over such that
| (2) |
because all the sizes are also bounded by a constant and so we get that as soon as , and we have
Then we have to sum over the intervals . Due to Property (a) above of the selected intervals , we have that
and similarly for , due to the disjointness. And indeed we also have
So for with , one has
Hence finally,
We can then sum over under the condition (2) with and in such a case we have
for some numerical exponent (depending of all the exponents). Since then
and so we deduce that
| (3) |
That corresponds to the desired restricted weak-type estimates for the exponents with .
The constraints (that are needed in the previous computations), are
and
with and
In particular, these contraints are satisfied if
Indeed for such exponents, one has
So we can find admissible exponents such that for
and since ,
Then by chosing , one has with and so there exists such that , , with . So we have found suitable exponents verifying all the conditions, in order to make the previous computations valid, which concludes the proof of the statement with , and . ∎
Remark 6.3.
If we follow [6] which explains how such localization algorythm can give a sparse domination (indeed for , the collection is sparse), we can then prove that the trilinear form satisfies the following sparse domination: for there exists a sparse collection of intervals such that
for exponents corresponding to
We know that such sparse domination implies boundedness from to for exponents such that and
which allows to recover the exact same range of boundedness (up to the use for a simplification of the conditionn that we also used in the previous proof).
Remark 6.4.
In the final statement, we put a loss of order and the comes from (3). If we do things a bit more carefully we could reach an exponent .
References
- [1] C. Benea, Vector-valued Extensions for Singular Bilinear Operators and Applications, Ph.D. thesis, Cornell University, https://ecommons.cornell.edu/handle/1813/40903, 2015.
- [2] C. Benea and F. Bernicot, A bilinear Rubio de Francia inequality for arbitrary squares, Forum of Mathematics, Sigma, 4, (2016), e26.
- [3] C. Benea, F. Bernicot, V. Lie and M. Vitturi, The non-resonant bilinear Hilbert-Carleson operator, Advances in Math. 458 (2024), 136pp.
- [4] C. Benea, F. Bernicot, V. Lie and M. Vitturi, The non-resonant bilinear Hilbert-Carleson operator, Unabbridged version, https://arxiv.org/abs/2106.09697.
- [5] C. Benea and C. Muscalu, Multiple vector valued inequalities via the helicoidal method, Anal. PDE, 9 (2016), no. 8, 1931–1988.
- [6] C. Benea and C. Muscalu, Sparse domination via the helicoidal method, Rev. Mat. Iberoam., 37 (2021), no. 6, 2037–2118.
- [7] F. Bernicot, boundedness for nonsmooth bilinear Littlewood-Paley square functions, Math. Ann. 351 (2011), no. 1, 1–49.
- [8] F. Bernicot and M. Vitturi, Bilinear Rubio de Francia inequalities for collections of non-smooth squares, Publ. Mat. 64 (2020), no. 1, 43–73.
- [9] F. Bernicot and M. Vitturi, A bilinear Rubio de Francia inequality for arbitrary rectangles, Int. Math. Res. Not. 17 (2021), 12925–12966.
- [10] J. R. de Francia, A Littlewood-Paley inequality for arbitrary intervals, Rev. Mat. Iberoam. 1 (1985), no. 2, 891–921.
- [11] L. Grafakos, P. Mohanty and S. Shrivastava, Multilinear square functions and multiple weights, Math. Scand. 124 (2019), no. 1, 149–160.
- [12] M. Lacey, The bilinear maximal functions map into for , Ann. Math.(2) 151 (2000), no. 1, 35–57.
- [13] M. Lacey and C. Thiele, estimates on the bilinear Hilbert transform for , Ann. of Math. (2) 146 (1997), no. 3, 693–724.
- [14] M. Lacey and C. Thiele, On Calderón’s conjecture, Ann. of Math. (2) 149 (1999), no. 2, 475–496.