Weighted estimates for maximal functions associated to skeletons
Andrea Olivo, Ezequiel Rela

TL;DR
This paper establishes quantitative weighted bounds for a maximal operator linked to cube skeletons in multi-dimensional space, using a novel combinatorial approach instead of traditional covering arguments.
Contribution
It introduces a new combinatorial method to derive weighted $L^p$ estimates for skeleton-based maximal functions, differing from classical techniques.
Findings
Established weighted $L^p$ bounds for skeleton maximal operators
Developed a combinatorial approach suitable for skeleton geometry
Connected intersection estimates with $k$-planes to maximal function bounds
Abstract
We provide quantitative weighted estimates for the norm of a maximal operator associated to cube skeletons in . The method of proof differs from the usual in the area of weighted inequalities since there are no covering arguments suitable for the geometry of skeletons. We use instead a combinatorial strategy that allows to obtain, after a linearization and discretization, bounds for the maximal operator from an estimate related to intersections between skeletons and -planes.
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.
Weighted estimates for maximal functions associated to skeletons
Andrea Olivo
Departamento de Matemática, Facultad de Ciencias Exactas y Naturales, Universidad de Buenos Aires, Ciudad Universitaria Pabellón I, Buenos Aires 1428 Capital Federal Argentina
and
Ezequiel Rela
Departamento de Matemática, Facultad de Ciencias Exactas y Naturales, Universidad de Buenos Aires, Ciudad Universitaria Pabellón I, Buenos Aires 1428 Capital Federal Argentina
Abstract.
We provide quantitative weighted estimates for the norm of a maximal operator associated to cube skeletons in . The method of proof differs from the usual in the area of weighted inequalities since there are no covering arguments suitable for the geometry of skeletons. We use instead a combinatorial strategy that allows to obtain, after a linearization and discretization, bounds for the maximal operator from an estimate related to intersections between skeletons and -planes.
Key words and phrases:
Maximal functions, weights, skeletons
1991 Mathematics Subject Classification:
Primary: 42B25. Secondary: 43A85.
Both authors are partially supported by grant PIP (CONICET) 11220110101018. Second author is also supported by granbt UBACyT 20020170200057BA
1. Introduction and main results
1.1. Averaging operators and packings
The purpose of this article is to study weighted estimates for a certain type of maximal operators related to a geometric problem of “packing objects”. The most famous example of this type of problems is the Kakeya needle problem: how small can be a set containing a unit line segment in every possible direction ? It is known that those sets can be of null Lebesgue measure, but the question regarding the smallest possible value for the dimension in remains open for . The best known results on Kakeya with respect to the Hausdorff dimension were obtained as a consequence of bounds for an appropriate maximal operator defined by averaging over thin tubes pointing in any possible direction. More precisely, the Kakeya maximal function is defined by
[TABLE]
where is a -tube (by this we mean a tube of length 1 and cross section of radius ) centered at in the direction of . Due to the existence of zero measure Kakeya sets, this operator can only be bounded on with a dependence on that blows up when . It is precisely this rate of blow up the key ingredient to derive dimension bounds for the Kakeya sets.
Other examples involving packing of circles of every possible radii or centered at any point of a prescribed set lead to the study of the corresponding maximal operators. For example, the problem of packing circles is related to the properties of the spherical maximal function
[TABLE]
where is the surface measure on the sphere and denotes the sphere centered on and with radius . Results for the boundedness of this operator can be found in [Ste76] for and in [Bou86] for the more difficult case of (see also [KW99] and [Wol97] for related problems involving similar maximal operators).
In this article we focus on the maximal operator that arises when studying configurations of cube skeletons. Roughly speaking, the -dimensional boundary of a cube with axes parallel sides in for . In , for example, the case consists in considering the faces of the cube, is for the set of edges of the cube and the case describes the vertices. The problem of finding minimal values of the size for sets in containing -skeletons centered at any point was recently studied by Keleti, Nagy and Shmerkin in [KNS18] and also by Thornton in [Tho17]. The main result in [KNS18] is that there exists a set containing a 1-skeleton centered at any point of the unit square having Lebesgue measure zero and, moreover, with zero Hausdorff dimension. The next natural step is to study how small can the dimension of such sets be for different notions of dimension. In [OS18] Shmerkin and the first author study the boundedness properties of the corresponding maximal averaging operator.
The naive analog of (1.1) for skeletons replacing the spherical surface by the surface of the cube is, as it was observed in [KNS18], inadequate. The operator introduced in [OS18] is the following version with a restricted range on the radius and averaging over a fattened -skeleton.
Definition 1.1**.**
Let and . For a given function , the -skeleton maximal function is defined by
[TABLE]
Here denotes, for , a -neighborhood of each one of the -faces of the -skeleton centered at with radius .
As in the case of the Kakeya problem, due to the example from [KNS18] cited above, this operator is bounded on (this is a consequence of the boundedness properties of the classical Hardy-Littlewood maximal operator) but with a blow up when . In this direction we mention the following result from [OS18].
Theorem 1.2** (Olivo-Shmerkin, 2018).**
Given , and , there exist positive constants such that
[TABLE]
for all .
From this theorem it is possible to recover the known values for the Box counting dimension of sets containing skeletons centered at any point of a prescribed set of centers under the condition of having full Box dimension. The lower bound relies on a specific construction and to obtain the upper bound there is in fact a result for a bigger (normwise) maximal type operator which is localized on a given cube and it is linear (see (1.6) and [OS18, Lemma 2.6] for the original source).
1.2. Weighted estimates for averaging operators
The main question on the subject of weighted estimates for a given operator bounded on for some is to characterize those non negative locally integrable functions such that maps boundedly to . We will denote this spaces by for short. The most famous problem in this direction is the celebrated Muckenhoupt’s theorem [Muc72] stating that the usual Hardy-Littlewood maximal function (over cubes, for example) defined by
[TABLE]
is bounded on if and only if the weight satisfies the so called condition given by
[TABLE]
Here, as usual, teh symbol \mathchoice{{\vbox{\hbox{\textstyle-}}\kern-4.86108pt}}{{\vbox{\hbox{\scriptstyle-}}\kern-3.25pt}}{{\vbox{\hbox{\scriptscriptstyle-}}\kern-2.29166pt}}{{\vbox{\hbox{\scriptscriptstyle-}}\kern-1.875pt}}\!\int_{E}fd\mu:=\frac{1}{\mu(E)}\int_{E}fd\mu denotes the average of the function with respect to the measure over the set . This condition also characterizes the boundedness on of other important operators in analysis such as the Hilbert transform, the Riesz transforms and very general Calderón-Zygmund operators. More recently, the interest was focused on obtaining precise quantitative estimates for the operator norm in weighted spaces. The first fundamental result on this direction is due to Buckley [Buc93] and is the following norm inequality. For , we have that
[TABLE]
Other important contribution to precise weighted estimates can be found in [Hyt12, HL12, HP13] (and the references therein) for the case of cubic weights and several classical operators.
It is then completely natural to ask for classes of weights characterizing the boundedness of the averaging operators discussed in the present paper. As an ideal result, one could expect to find a geometric condition similar to the from (1.3). This is in fact possible when dealing with euclidean or metric balls, rectangles or more general bases of convex sets.
However, the geometric nature of the Kakeya or spherical maximal operators is much more difficult to handle and such a clean condition is not known. For the Kakeya maximal operator, some results on weighted estimates can be found in [M90] where the author obtains a rather involved geometric condition.
Another related problem on weighted inequalities is the so called Fefferman-Stein type inequality. Given some (maximal) operator , the problem is to find the best possible range of exponent for which the following inequality is valid for any non negative weight :
[TABLE]
where the weight on the left hand side is different from the one on the right hand side, being the latter the one obtained by applying the operator itself. The results in [Var94, MS95, Tan01] are in this direction for the case of Kakeya. For the spherical maximal function, we refer the reader to [DV96] and [DS02] for several results concerning power weights of the form . Here, as in the case of Kakeya, there is no geometric condition as in the case of HL maximal function.
1.3. Our contribution
In this paper we will show that there is, for the skeleton maximal function defined in (1.2), a necessary condition that resembles the condition from (1.3). In addition, we also find a (different) sufficient condition for the boundedness that also provides a precise quantitative dependence on an -like constant. This latter result is obtained following some ideas from [OS18] introducing a discretization and linearization of the maximal operator.
Remark 1.3**.**
We choose to present our results in the setting of 1-skeletons in for the sake of clarity in the exposition. Many of the conclusions can be trivially extended to higher dimension but we will omit here the discussion of such extensions and only mention the results in Section 3.1.3.
We introduce here an type condition suited to our purposes.
Definition 1.4**.**
Let be a weight and . Let be the family of all 1-skeletons (boundaries of squares) with center in and sidelength . Each element of this family will be denoted as . Let be a fixed parameter and recall that denotes a -neighborhood of and , , each one of the four fattened sides. We say that belongs to the skeleton class if
[TABLE]
where is a square of sidelength centered at and denotes the side where the following minimum
[TABLE]
is attained. When finite, the above supremum will be denoted by .
Our first theorem is the following, regarding a necessary condition for the boundedness of defined in (1.2). From now on, we simply denote omitting the superscript.
Theorem 1.5**.**
Let be a weight in and suppose that the maximal operator , for some fixed is bounded on for . Then the weight belongs to .
Now, regarding the sufficiency, we need to introduce some extra notation to present an auxiliary operator which is a linearized and discretized version of the skeleton maximal operator. We start by recalling this lemma from [OS18] that chooses wisely one -face on each one of the member of a large family of skeletons avoiding large overlaps.
Lemma 1.6**.**
There is a constant , depending only on , such that the following holds. Let be a finite collection of -skeletons in . Then it is possible to choose one -face of each skeleton with the following property: If is an affine -plane which is a translate of a coordinate -plane, then contains at most
[TABLE]
of the chosen -faces.
We may now introduce a new maximal operator that controls at a local level. To that end, we consider the dyadic lattice and, given a fixed point , we shall use the notation from the following definition.
Definition 1.7**.**
Let be any point in the lattice . Associated to that point we define:
- (1)
will denote the square of sidelength 1 and lower left vertex . 2. (2)
will be the set of centers of the smaller squares of sidelength , , generated by the grid . We may assume from now on that is an integer and therefore . 3. (3)
is a function that assigns a number as sidelenght for building squares with centers in the points in . We denote by the family of all possible choices of . 4. (4)
is the family of 1-skeletons with center and sidelength . 5. (5)
will be a function given by the selection algorithm given by Lemma 1.6 that chooses one of the sides of each -skeleton:
[TABLE] 6. (6)
As the family of sides chosen by the previous algorithm depends on and we will denote it as
[TABLE] 7. (7)
Note that the main objects we are going to deal with are averages over -neighborhoods of these line segments. We will denote by the -neighborhood of . Since the eccentricity parameter is fixed from the beginning we will omit it in the above notation. 8. (8)
Given , we will denote by the center of the square containing . For notational convenience, we write , . This function maps each one of the squares to its center .
Definition 1.8**.**
Let be a fixed square given by a point in the lattice . Consider a function and , if we define the -skeleton maximal function with width as
[TABLE]
[TABLE]
where is the -neighborhood of .
By definition, is a linear operator, and from now on we will simple denote it by . Let denote the square with the same center as and side length . Since the function only take values in the interval , in the previous definition it is enough to consider functions supported on , because if then . The relevance of this operator comes from a pointwise inequality from [OS18, Lemma 2.6] involving and . More precisely, we have that
[TABLE]
Therefore, by obtaining a sufficient condition on the discrete maximal operator uniformly on , we will also obtain sufficiency result for , at least at a local level.
The appropriate definition of an type class for the discrete maximal operator is the following.
Definition 1.9**.**
Let be a fixed eccentricity parameter and let be a weight in and let . For a given and , we define the skeleton -like quantity (we omit the implicit in the following definition):
[TABLE]
where each is the -neighborhood of the edge chosen by the function from Definition 1.7, item (5). Taking into account that we need a uniform control over all and all , we define
[TABLE]
As usual, we say that if the above supremum is finite. Note that the geometry of the problem is reflected in the asymmetry on the averages.
Definition 1.10**.**
(The case ) Let a weight in . For a given and we define de skeleton -like quantity:
[TABLE]
To have a uniform control over all and all , we define
[TABLE]
We will prove in Proposition 2.2 that (as in the classical case) the limit when of the quantity for a weight is precisely .
We may now present the second main result in this article: a sufficient condition for the weighted boundedness of the maximal operator and therefore also for . The method of proof differs from the usual techniques from the theory of weights since there are no classical covering arguments, instead we use a duality argument that allows to pass from packing objects with good norm to an bound of the maximal operator (see [Mat15, Proposition 22.4]). This forces, as far as we know, to only obtain a discrete family of values of ’s for the bound (see the discussion in Section 3.1 for further observations on this problem).
We have the following theorem.
Theorem 1.11**.**
Let be a weight in . If and , then
[TABLE]
Note that this bound doesn’t blow up when goes to 1. This, together with the result in Proposition 2.2 mentioned above, allows us to use a limiting argument to extend the result to the endpoint, namely to .
Corollary 1.12**.**
Let be a weight in . If , then
[TABLE]
As a consequence of this theorem, by using inequality (1.6) and the bounded overlap of the family , we obtain the desired sufficient condition for the skeleton maximal function. We remark here that the proof provides, quite surprisingly, a precise quantitative dependence on the constant.
Theorem 1.13**.**
Let in for such that or . For any fixed , we have that
[TABLE]
1.4. Outline
The paper is organized as follows. In Section 2 we introduce some extra notation and a fundamental proposition on packing of thin tubes yielding norm bounds for our maximal operator. In Section 3 we present the proofs of our results.
2. Preliminaries
In this section we introduce some extra notation necessary to our proofs. Recall that the algorithm from Lemma 1.6 chooses some preferred sides on each square. So each one of the chosen sides is either a vertical line or an horizontal line. We define
[TABLE]
[TABLE]
By Definition 1.7 we have that , is a partition of .
The next proposition contains a key result that allows to reduce the problem of finding norm bounds for a maximal operator to the problem of proving an estimate for the sum of indicator functions. A version of this proposition for the Kakeya maximal operator can be found in [Mat15] and an adaptation of this argument to the unweighted skeleton maximal operator is presented in [OS18].
Proposition 2.1**.**
Let , , and consider the squares , from Definition 1.7. Fix and a weight on . Now consider only the sides such that ( are fixed) and denote . Let . Suppose that there exists some constant such that
[TABLE]
Then we have
[TABLE]
Proof.
For the sake of clarity, we relabel the cubes in as , and compute the integral
[TABLE]
Let us wirte instead of . By duality there is a choice of nonegative numbers , with , such that
[TABLE]
where we write .
Then, we obtain that
[TABLE]
since, by hypothesis, the last norm of the sum of indicator functions is bounded. The proof is complete.
∎
We include here some properties of the weights.
Proposition 2.2**.**
Let for some . Then
- (1)
The classes are increasing as increases; precisely, for we have
[TABLE] 2. (2)
.
Proof.
Let , we shall prove that . First, observe that: if , then and if , then . Then
[TABLE]
for every , and . Since , we have that
[TABLE]
For the case , we use that
[TABLE]
To prove the second item, using 1, we have for all . It is enough to prove that given there exists such that
[TABLE]
for any . Observe that
[TABLE]
where in the last line we write . It is known that if . Then, given , there exists such that if ,
[TABLE]
Or, we can say there exists such that
[TABLE]
if . Let as above, then there exists , and such that
[TABLE]
Since , taking supremum we obtain
[TABLE]
∎
3. Proofs of the main results
We start this section wit the proof of Theorem 1.5, that is, a necessary condition on the weight for the maximal operator to be bounded on .
Proof of Theorem 1.5.
Let us denote by the family of all boundaries of squares centered at any and sidelength , . Each element in will be denoted by . Now, given , lets consider .
Let be the square centered at with sidelength . Then, for any in we have that
[TABLE]
Then
[TABLE]
Using this estimate and the hypothesis on , we have that
[TABLE]
and therefore
[TABLE]
for any and .
Let us choose in the previous inequality. Then
[TABLE]
Let us denote by the side for which the minimum above is attained. Then, under the hypothesis of the weight being non trivial on (if not, a standard argument as in the classical case can be used to overcome this obstacle), we can write
[TABLE]
which is equivalent to
[TABLE]
Taking the supremum over , we obtain
[TABLE]
And this is precisely the condition (1.5) from Definition 1.4. ∎
Now we present the proofs of Theorem 1.11 and Theorem 1.13, namely the sufficiency of the condition for the boundedness of the operators and .
Proof of Theorem 1.11.
Consider . We will consider only , the other set can be treated in the same way. By proposition 2.1, it is sufficient to prove that
[TABLE]
where is the cardinality of and the ’s are defined by
[TABLE]
The condition will be satisfied if we can prove the following equivalent formulation:
[TABLE]
Recall that is a positive integer, so we have that
[TABLE]
In the last inequality we used the discrete Hölder’s inequality. Each of the factors obtained have the same bound, so we only look one of them. For example, take the first:
[TABLE]
Now, in the last sum, for each fixed , we only have to consider those terms where . We have a way to estimate the quantity of neighbors that each has from Lemma 1.6 . So, setting , where is the constant in the lemma, we can write
[TABLE]
Therefore,
[TABLE]
Finally, we obtain that
[TABLE]
Since the same estimate holds for all the other factors involving , we conclude that
[TABLE]
and we obtain the desired result. ∎
Now we are ready to conclude with the proof of Theorem 1.13 by an easy argument of decomposing into cubes.
Proof of Theorem 1.13.
Let us start with the case . We compute the norm as
[TABLE]
Now, using (1.6) we may control the maximal operator at a local level by the discretized version as follows
[TABLE]
since . We conclude that
[TABLE]
and then the proof for is complete. To include the case , we simply note that the bound above remains bounded when by Proposition 2.2. ∎
3.1. Some concluding remarks
Here we include some final observations and examples to illustrate our results.
3.1.1. Interpolation
The reader should note that, unlike the case of cubic Muckenhoupt weights, our result in Theorem 1.13 was obtained only for those values of such that is an integer. The reason behind that is the key combinatorial Proposition 2.1. More precisely, the use of that proposition in the proof of the main Theorem 1.13 can be carried out expanding the norm and that is possible for those selected values of . In the unweighted case, the remaining values of are obtained by interpolation. Here, one could try to interpolate with change of measure. This approach is indeed valid for example in the classical case of cubic weights as it is explained in [Jon80]. But, since it is a consequence of the factorization property of weights into weights, here we do not know if such a factorization is valid or not. The best result that can be obtained by interpolation is that, since is bounded in for all and also in for all , then is bounded in with
[TABLE]
The question here is how to prove that any weight can be written in that way without using factorization.
3.1.2. Examples
The following computation shows that classical cubic weights belong to the skeleton class . We have to bound the expression
[TABLE]
uniformly in . Let us note that, since a.e.,
[TABLE]
We now use the fact that both and are contained in the cube with center and sidelenght . Then,
[TABLE]
The last expression is precisely controlled by the condition for cubes, .
3.1.3. Higher dimensions
Every argument presented in this article can be extended to deal with general -skeletons of -dimensional cubes with axes parallel sides in . The proofs are technically involved but straightforward. We include in this last section the results that can be obtained following the same line of ideas.
Fix . Let be the family of all -skeletons with center in and sidelength , . Each element of this family will be denoted as . Let be a fixed parameter and recall that denotes the -fattened -skeleton and each one of the -faces of the fattened skeleton.
We can define the class as in Definition 1.4, just considering this new family . More precisely, we say that belongs to class if
[TABLE]
where is a -dimensional cube of sidelength centered at and denotes the -face where the following minimum
[TABLE]
is attained. When finite, the above supremum will be denoted by . The following result is the analogous of Theorem 1.5 in the case and the proof is similar.
Theorem 3.1**.**
Let be a weight in and suppose that the maximal operator , for some fixed , is bounded on for . Then the weight belongs to .
To obtain a sufficient condition, as in the -dimensional case with we introduce a linearized and discretized version of the -skeleton maximal operator given in (1.2). Note that Definition 1.7 holds if we replace by and the -skeletons by -skeletons.
Definition 3.2**.**
Let be a fixed square given by a point in the lattice . Consider a function and , if we define the -skeleton maximal function with width as
[TABLE]
[TABLE]
where is the -neighborhood of .
The appropriate definition of an type class for the discrete maximal operator in the case is the following.
Definition 3.3**.**
Let be a fixed eccentricity parameter and let be a weight in and let . For a given and , we define the -skeleton -like quantity (we omit the implicit in the following definition):
[TABLE]
Since we need and uniform control over all and all , we define
[TABLE]
We say that is the above supremum is finite.
For the case we have the following definition.
Definition 3.4**.**
Let a weight in . For a given and we define de skeleton -like quantity:
[TABLE]
To have a uniform control over all and all , we define
[TABLE]
In higher dimensions we have more than two orientations, not only vertical or horizontal. The canonical vectors in determine coordinate -planes. We will denote these -planes as
Each -face of a -skeleton of an -dimensional cube is contained in an affine -plane which is a translate of some , ; in this case we say that this -face is parallel to (in the case , the origin is the [math]-plane determined by the axes).
Definition 3.5**.**
Let and let , for a given . Consider the -skeletons , . We define the sets
[TABLE]
In the case , we just consider the whole space .
We will also define , . This function maps each one of the -cubes to its center . Therefore it is a constant on each one of the , , and , , is a partition of .
With this definition we can give the following generalized version of Proposition 2.1
Proposition 3.6**.**
Let , , and consider the -cubes , . Fix and a weight on . Now, let be one of the sets from Definition 3.5. We consider only the -faces such that ( are fixed) and denote . Let .
Suppose that there exists some constant such that
[TABLE]
Then we have
[TABLE]
Finally, we give the analogous results for Theorem 1.11 and Theorem 1.13
Theorem 3.7**.**
Let be a weight in . If and , then
[TABLE]
where is a constant depending on .
Theorem 3.8**.**
Let in for such that or . For any fixed , we have that
[TABLE]
Acknowledgments
We would like to thank Pablo Shmerkin for bringing this problem into our attention and for many valuables discussions.
The reference list from the paper itself. Each links out to its DOI / PubMed record.
- 1[Bou 86] J. Bourgain, Averages in the plane over convex curves and maximal operators , J. Analyse Math. 47 (1986), 69–85.
- 2[Buc 93] Stephen M. Buckley, Estimates for operator norms on weighted spaces and reverse Jensen inequalities , Trans. Amer. Math. Soc. 340 (1993), no. 1, 253–272.
- 3[DS 02] Javier Duoandikoetxea and Edurne Seijo, Weighted inequalities for some spherical maximal operators , Illinois J. Math. 46 (2002), no. 4, 1299–1312.
- 4[DV 96] Javier Duoandikoetxea and Luis Vega, Spherical means and weighted inequalities , J. London Math. Soc. (2) 53 (1996), no. 2, 343–353. MR 1373065
- 5[HL 12] Tuomas P. Hytönen and Michael T. Lacey, The A p subscript 𝐴 𝑝 A_{p} - A ∞ subscript 𝐴 A_{\infty} inequality for general Calderón-Zygmund operators , Indiana Univ. Math. J. 61 (2012), no. 6, 2041–2092.
- 6[HP 13] Tuomas Hytönen and Carlos Pérez, Sharp weighted bounds involving A ∞ subscript 𝐴 {A}_{\infty} , Anal. PDE 6 (2013), no. 4, 777–818.
- 7[Hyt 12] Tuomas Hytönen, The sharp weighted bound for general Calderón-Zygmund operators , Annals of Math. 175 (2012), no. 3, 1476–1506.
- 8[Jon 80] Peter W. Jones, Factorization of A p subscript 𝐴 𝑝 A_{p} weights , Ann. of Math. (2) 111 (1980), no. 3, 511–530.
