Off-diagonal estimates for cube skeletons maximal operators
Andrea Olivo

TL;DR
This paper develops off-diagonal estimates for a geometric maximal operator related to k-skeletons in Euclidean space, using interpolation and geometric analysis techniques.
Contribution
It introduces new off-diagonal bounds for skeleton-based maximal operators by combining geometric insights with interpolation methods.
Findings
Established off-diagonal estimates for skeleton maximal operators.
Connected geometric skeleton properties with harmonic analysis techniques.
Extended off-diagonal estimate methods from circular to skeleton configurations.
Abstract
We provide off-diagonal estimates for a maximal operator arising from a geometric problem of estimating the size of certain geometric configuration of k- skeletons in . This is achieved by interpolating a weak-type endpoint estimate with the known diagonal bounds. The endpoint estimate is proved by combining a geometric result about k-skeletons and adapting an argument used to prove off-diagonal estimates for the circular maximal function in the plane.
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
TopicsAdvanced Harmonic Analysis Research · Advanced Mathematical Physics Problems · Mathematical Analysis and Transform Methods
off-diagonal estimates for cube skeletons maximal operators
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
Abstract.
We provide off-diagonal estimates for a maximal operator arising from a geometric problem of estimating the size of certain geometric configuration of -skeletons in . This is achieved by interpolating a weak-type endpoint estimate with the known diagonal bounds. The endpoint estimate is proved by combining a geometric result about -skeletons and adapting an argument used to prove off-diagonal estimates for the circular maximal function in the plane.
2010 Mathematics Subject Classification. Primary: 42B25. Secondary: 43A85.
Key words and phrases:
averages over skeletons, maximal functions, off-diagonal estimates
The author is partially supported by grant PIP (CONICET) 11220110101018.
1. Introduction
In this work we present off-diagonal estimates for maximal operators associated to averaging over (neighborhoods of) squares in the plane and, more generally over -skeletons of cubes with arbitrary dimension. Roughly speaking, the -dimensional boundary of an -dimensional cube with axes-parallel sides in , for .
The interest in this type of operators emerges, on one hand, from a geometric problem about the size of a set containing re-scaled and translated copies of the -skeleton of the unit cube in around every point of a set of given size. On the other hand, it is a natural variant of the celebrated spherical maximal operator of Bourgain-Stein.
The problem of finding minimal values of the size for sets in containing -skeletons centered at any point of a given set was introduced by Keleti, Nagy and Shmerkin [2] for the case and by Thornton [5], for the case . Unlike the situation of spheres, where a set containing a sphere with center in every point of a set of positive Lebesgue measure must have positive Lebesgue measure, a set containing the -skeleton of an -dimensional cube with axes-parallel sides and center in every point of can have zero Lebesgue measure. Even more, it can have Hausdorff dimension (see [5]), the same as a single -skeleton. This result indicates that Hausdorff dimension does not fit well with this problem. For this reason, in [2, 5], the authors obtained estimates for other notions of fractal dimensions as for example box dimension and packing dimension. The arguments from [2, 5] are direct and do not involve any maximal operators. Regardless, in [2] the authors introduced the maximal operator associated with the aforementioned geometric problem. More precisely, for each , and , the -skeleton maximal operator with width is defined as
[TABLE]
where is a -neighborhood of the -skeleton of a cube with center and side length , and the index enumerates its faces. Here, as usual, the symbol denotes the average of the function with respect to the measure over the set .
As was pointed out in [2], it turns out necessary take the minimum over all the faces of the -skeleton to avoid natural and trivial results, analog to the ones for Hausdorff dimension. On the other hand, this operator cannot be bounded from to for any finite , for otherwise a set with a -skeleton centered at every point of would have positive measure. Following this line, Shmerkin and the present author studied in [3] discretized versions of , and proved nearly sharp bounds for the -skeleton maximal operator. Easily one can deduce that is bounded on , if , just by comparison with the Hardy-Littlewood maximal operator. Nonetheless, an interesting problem is to determine the rate at which the norm of increases as goes to zero.
Theorem 1.1**.**
[3, Theorem 1.2]** Given , and , there exist positive constants such that
[TABLE]
for all .
The lower bound relies on a specific construction due in [5] 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 Section 2 for more details). From this bound 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 (see [3, Corollary 3.5]).
Motivated by the previous result, the purpose of this article is to study the off-diagonal case. Since the -skeleton maximal operator is bounded on , , and is trivially bounded on and from , by the classical Marcinkiewicz interpolation theorem, applied to the bigger (normwise) linear maximal operator (see Definition 2.3), we can obtain the boundedness from , . Nevertheless, as we mentioned before, we are interested at the rate at which the norm of the -skeleton maximal operator from to increases as the parameter tends to 0, where as usual
[TABLE]
In the next, we say that if there exist two positive constants , not depending on , such that .
Our main result is the following:
Theorem 1.2**.**
Given and , there exist positive constants and such that,
[TABLE]
for all and .
The lower bound follows by applying to an appropriate function. For the upper bounds, we apply a combinatorial method used by Schlag in [4] for the circular maximal operator in the plane, combined with classical interpolation theorems and an estimate from the combinatorial Lemma 2.1, that we will present in the next section.
For the remaining case, , it is straightforward conclude that the -skeleton maximal operator is unbounded. In fact, given , let be the characteristic function of an -dimensional cube with side length and consider another cube, namely , with the same center and side length . By a simple calculation we obtain , for all . Therefore,
[TABLE]
which grows with
2. Preliminaries and notation
Most of the following definitions and results were introduced in [3], for completeness here we give a brief summary. In particular, we define the linear maximal operator that it turn out be the key to obtain upper bound estimates.
We denote the half-open unit cube by , i.e. . Let such that is an integer and consider the grid . We define , , the centers of the half-open -cubes, , with side length determined by the grid .
We define the function , , where denotes the center of the corresponding half-open -cube with center in and side length containing . Observe that is constant over each and the sets , , form a Borel partition of .
We use the letter C to denote positive constants, indicating any parameters they may depend on by subindices. Their values may change from line to line. For example, denotes a positive function of .
The next combinatorial lemma is crucial in our work. It states, roughly speaking, that given a finite family of -skeletons, we can extract one face from each skeleton and the overlap among them is controlled.
Lemma 2.1**.**
[3, Lemma 3.2]** 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.
Definition 2.2**.**
Let denote the family of all functions . Fix also . For simplicity, let us write S, where and .
For this family of -skeletons, we define the function :
[TABLE]
where denotes the face of chosen as in Lemma 2.1.
The -skeleton maximal operator defined in (1.1), unlike most other kinds maximal operators, is not sub-linear. To deal with this inconvenient we introduce a discretized and linearized version of the problem.
Definition 2.3**.**
Given a function and , if we define the -skeleton maximal function with width , by
[TABLE]
where is a -neighborhood of .
Remark 2.4**.**
By definition, is constant over each set , , and it is completely determined by its values over the set .
Let denote the -cube with the same center as and side length . Since is bounded by 2, in the previous definition it is enough to consider functions supported on , since for each , we have that .
The following result establishes the normwise relation between the -skeleton maximal operator and its linearized version.
Lemma 2.5**.**
[3, Lemma 2.6]** There exists a constant such that if ,
[TABLE]
In consequence, by obtaining estimates on the discrete maximal operator uniformly on , we will also obtain bounds for , at least at a local level.
3. the weak endpoint estimate
In the present section we shall prove a weak-type estimate, for the -skeleton maximal function, the linearized version of . To achieve this, we will follow some ideas used in [4] to treat the circular maximal operator.
Although we are interested on -skeletons, first we establish the setting for more general sets.
3.1. General setting
Let be a Borel set and an index set. For each , consider a family of sets with positive and finite Lebesgue measure in such that for some and . Intuitively, we can think that is a family of sets at -scale with measure equal to , for all .
In addition, suppose there exists a constant , not depending on , such that
[TABLE]
and for all consider the maximal operator defined by
[TABLE]
Let be a set with finite Lebesgue measure, , and , a maximal -separated sequence in
[TABLE]
Note that, by (3.1), is a bounded set. Pick such that
[TABLE]
To simplify the notation, in the next write instead of and instead of . Consider the multiplicity function
[TABLE]
and define to be the smallest integer for which there exist at least values of such that
[TABLE]
Observe that
[TABLE]
The following lemma characterizes the estimates on required to obtain restricted weak-type estimates for the maximal operator .
Recall that is said to be of weak-type with norm and write
[TABLE]
if for all and ,
[TABLE]
When the above inequality holds for characteristic functions of arbitrary sets in of finite measure, we say that is of restricted weak-type .
Lemma 3.1**.**
Let and . There exists a positive constant such that, if for every choice of a bounded set , and , then is of restricted weak-type with constant , where and .
Proof.
We need to prove that
[TABLE]
for every set of finite measure.
Let and be a maximal -separated sequence in , as in (3.2). Then,
[TABLE]
where denotes the measure of the -dimensional ball with radius 1. In view of (3.3), i.e. , and by the assumption on we conclude that
[TABLE]
Therefore, (3.4) follows with constant . ∎
3.2. The case of -skeletons
First, we introduce some notation and definitions.
- •
Given , , and , the canonical base in , we denote by the subspaces of dimension generated by vectors in the canonical base. From now on, we denote them as -planes. For example, if and , and are the usual coordinates axes in the plane. If , the [math]-plane will be the origin.
- •
Let and as in (2.1). We say that , , is parallel to if there exists a point such that it is contained in the affine subspace .
- •
For each , we define the sets
[TABLE]
Let be a set with finite measure, and consider the set
[TABLE]
where the index is fixed. By Remark 2.4, is the union of those half-open cubes with center . Note that it is enough just to consider those sets such that , otherwise .
The set is a maximal -separated set in and for each , we have
[TABLE]
For simplicity, we write instead of and instead of .
We define the multiplicity function associated to by
[TABLE]
and , as before, the smallest integer such that there exists at least values of such that
[TABLE]
Fix and consider . Since we have that
[TABLE]
The faces were chosen from a family of -skeletons using Lemma 2.1 and each one of them belongs to an affine -plane parallel to . Therefore, by means of the mentioned Lemma, we obtain an estimate for the number of faces containing . More precisely, for all we have,
[TABLE]
Since this holds for every , by the definition of , we obtain
[TABLE]
The following lemma provides us the weak-type estimate mentioned at the beginning of the section.
Lemma 3.2**.**
Given , , and , there exists a positive constant such that
[TABLE]
for every and .
Proof.
Consider the restricted maximal operator . By (3.5) we have
[TABLE]
Applying Lemma 3.1 with , , and , we obtain
[TABLE]
for every set of finite measure.
Since this holds for every , and the sets form a Borel partition of , we have
[TABLE]
and therefore, we can conclude that is of restricted weak type .
If ,
[TABLE]
and is of restricted weak type .
For the remaining case , take a constant such that . Trivially by (3.5),
[TABLE]
Invoking Lemma 3.1 with , and we obtain,
[TABLE]
Therefore,
[TABLE]
which implies that is of restricted weak type with .
Finally, by [1, Theorem 5.5.3], we can conclude that is of weak-type . ∎
4. Proof of the main theorem
In order to prove the upper bounds in Theorem 1.2, we first establish the following result.
Proposition 4.1**.**
For every , and , there exist positive constants and depending on such that,
[TABLE]
Proof.
Given with , by Lemma 3.2, the trivial bound
[TABLE]
and the Marcinkiewicz interpolation Theorem (See e.g.[1, Theorem 4.4.13 ]) we have the desire result. ∎
For each we denote
[TABLE]
By translation invariance, Proposition 4.1 continues to hold if we replace by .
Proof of Theorem 1.2.
: In both cases, the upper bounds follow from Lemma 2.5, Proposition 4.1 and the facts that and is finite.
If , to obtain the lower bound, we consider , where is the -skeleton of an -cube with side length one and center in some point . It is easy to see that for all in a -neighborhood of and . Since , we have
[TABLE]
For the remaining lower bound in the case , see [3, Proposition 2.2].
∎
Acknowledgments
I thank my supervisor Pablo Shmerkin for his guidance and for his extremely valuable comments and suggestions.
The reference list from the paper itself. Each links out to its DOI / PubMed record.
- 1[1] C. Bennett and R. Sharpley, Interpolation of operators , Academic Press Inc., Boston, 1988.
- 2[2] T. Keleti, D. Nagy, and P. Shmerkin, Squares and their centers , J. Anal. Math. 134 (2018), no. 2, 643–669.
- 3[3] A. Olivo and P. Shmerkin, Maximal operators for cube skeletons , Ann. Acad. Sci. Fenn. Math., 45 (2020), 467-478.
- 4[4] W. Schlag, A generalization of Bourgain’s circular maximal theorem , J. Amer. Math. Soc. , 10(1):103–122, (1997).
- 5[5] R. Thornton, Cubes and their centers , Acta Math. Hungar. , 152(2):291–313, (2017).
