Sharp matrix weighted strong type inequalities for the dyadic square function
Joshua Isralowitz

TL;DR
This paper improves the understanding of matrix weighted dyadic square functions by establishing sharp inequalities and pointwise sparse domination, extending previous results to more general settings.
Contribution
It refines sparse domination techniques to prove sharp two matrix weighted inequalities for dyadic square functions for 1 < p ≤ 2.
Findings
Established sharp two matrix weighted strong type inequalities.
Proved pointwise sparse domination for general matrix weighted dyadic square functions.
Extended previous results to broader matrix weight classes.
Abstract
In this paper we refine the recent sparse domination of the integrated matrix weighted dyadic square function by T. Hytonen, S. Petermichl, and A. Volberg to prove a pointwise sparse domination of general matrix weighted dyadic square functions. We then use this to prove sharp two matrix weighted strong type inequalities for matrix weighted dyadic square functions when .
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 · Mathematical Inequalities and Applications
Sharp matrix weighted strong type inequalities for the dyadic square function
Joshua Isralowitz
and
Joshua Isralowitz
Department of Mathematics, University at Albany, SUNY, Albany, NY, 12159
Abstract.
In this paper we refine the recent sparse domination of the integrated matrix weighted dyadic square function by T. Hytonen, S. Petermichl, and A. Volberg to prove a pointwise sparse domination of general matrix weighted dyadic square functions. We then use this to prove sharp two matrix weighted strong type inequalities for matrix weighted dyadic square functions when .
1. Introduction
Let be an a.e. positive definite matrix valued function on (that is, a matrix weight), and for a measurable valued function on define
[TABLE]
where is the standard Euclidean norm on . We will say that a pair of matrix weights is matrix Ap if
[TABLE]
where \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_{I} refers to the unweighted average and is the standard matrix norm of an matrix . Clearly this is a condition that reduces to the classical Muckenhoupt two weight Ap condition in the scalar setting (when ). If then we will say is a matrix Ap weight if . While it is known that most “classical” operators from harmonic analysis (such as the maximal function, Calderón-Zygmund operators, paraproducts, martingale transforms, square functions, etc.) are bounded on for matrix Ap weights , it is difficult to determine the sharp dependence of such operators on .
In fact, the only two such operators where sharp one weighted matrix weighted norm inequalities for are known are for the dyadic square function, which was recently proved in [6] and the maximal function, which was proved in [7] by slightly modifying the ideas in [1]. Furthermore, among these two operators, sharp one matrix weighted Ap bounds for are only known for the maximal function, which were proved in [8] by slightly modifying the ideas in [4].
The purpose of this paper is to prove sharp strong type matrix weighted norm inequalities for the dyadic square function in the range , providing the first sharp estimates for a singular operator in the matrix weighted setting. Let be a dyadic grid and let for and be any Haar system on , meaning that is an orthonormal system of with supported on , and each is constant on dyadic subcubes of . Also, for a function let
[TABLE]
and define the matrix weighted dyadic square function by
[TABLE]
For notational ease we will omit the dependence of on and presume all sums involving Haar functions are taken over . Note that this operator is a natural substitute for the dyadic square function in the sense that if is the ordinary dyadic square function on scalar valued functions then
[TABLE]
To state our main result we need the following definition. We say that a matrix weight is matrix A if
[TABLE]
It is easy to show (see [4] for example) that a matrix Ap weight is also a matrix A weight with and clearly in the scalar setting we have . Our first result is the following.
Theorem 1.1**.**
If is a pair of matrix Ap weights, is a matrix A weight, and then the sharp estimate
[TABLE]
*holds.
Furthermore, if we have the following (most likely not sharp) estimate
[TABLE]
Note that this was proved when in [6] in the one weighted case and that sharpness when follows from the well known sharpness in the scalar setting (see [9, 5]). Also, note that while it is unlikely that Theorem 1.1 is sharp when , it is a natural bound and in fact we will recover from the proof of Theorem 1.1 the current best mixed matrix weighted Ap - A∞ bound for a positive sparse operator from [2] (and thus the current best bound for CZOs via the sparse convex body domination theorem from [11]), namely
[TABLE]
(see p. 9 for the definition of a positive Sparse operator ).
We will now outline the arguments used to prove our main result. In the next section, we will modify the stopping time ideas from [6] to prove a sparse domination of for all matrix weights and measurable. Note that unlike in [6] which proved the sparse domination of an integrated version of , we will actually prove a sparse pointwise domination of . In the third section we will prove Theorem 1.1 by “matrixizing” some of the ideas in [3] to prove a matrix weighted Carleson embedding type theorem. Of particular novelty here is that we will use a matrix weighted “stopping moment” decomposition, which to the author’s knowledge is the first time such an argument in the matrix weighted setting has appeared. Note that a similar matrix weighted parallel corona decomposition argument should be possible (which in fact was used to prove a sharp version of Theorem 1.1 in the scalar setting in [9]).
We will end this paper with an important point. First, as of the date of writing this paper, it is unknown whether the Rubio de Francia extrapolation theorem holds. Namely, it is not known whether the boundedness of an operator on for all matrix A2 weights implies the boundedness of on for all matrix Ap weights and all Thus, unlike in the scalar setting, sharp estimates (or even just boundedness) of operators for do not at this moment follow from sharp estimates of operators for .
2. Sparse domination of square functions
Before we state the main result of this section we will need to introduce some definitions and notation. First we will introduce the concept of a reducing matrix, whose importance was emphasized in [4] and which has since shown to be vital in the theory of matrix weighted norm inequalities. Namely, for a matrix weight , a cube , and there exists positive definite matricies where
[TABLE]
where the implicit constant depends only on . In particular, it is easy to see that
[TABLE]
Now let be any orthonormal basis of . We will then use the following simple estimate without further mention throughout the rest of the paper: If is any matrix then
[TABLE]
Let be a dyadic grid. A collection of dyadic cubes in is sparse if
[TABLE]
See [10] or [11] for more properties of sparse collections.
Given a sparse collection , define the “sparse positive operator” by
[TABLE]
where denotes the unweighted average over . Furthermore, for any define the localized sparse positive operator by
[TABLE]
and similarly define by
[TABLE]
Finally, for define
[TABLE]
where is the sidelength of , and define in an analogous way.
The main result of this section is the following.
Theorem 2.1**.**
Let denote the matrix weighted square function defined by (2.2). Then there exists a sparse collection of dyadic cubes where for a.e. we have with implicit constant independent of and .
Proof.
Let denote the unweighted dyadic square function with respect to . It is then enough to show that for each we can find a sparse collection of dyadic subcubes of where , since then we can apply this to each with . Let be the maximal dyadic subcubes of where
[TABLE]
We claim that for large enough . For that matter, if then
[TABLE]
so that using the fact that we get
[TABLE]
which clearly proves the claim.
Let denote the collection of all such that for any . Furthermore, abusing notation slightly, we will denote by . Fix such that is defined. Then
[TABLE]
We estimate by considering two cases. First assume Thus, if for some and then again by definition of we have so that
[TABLE]
On the other hand, if then we can pick a sequence of nested dyadic cubes . However, if
[TABLE]
then obviously for some we must have
[TABLE]
which means for some . Thus,
[TABLE]
Putting this together, we get
[TABLE]
Finally set and for set . If then is sparse, which by iteration completes the proof of Theorem 2.1 ∎
3. Proof of Theorem 1.1
In this section we will prove Theorem 1.1 by utilizing Theorem 2.1. Again fix to be determined momentarily. Given let denote the set of maximal such that either
[TABLE]
or
[TABLE]
We now prove that for large enough we have that
[TABLE]
Let and denote those maximal cubes in satisfying (3.1) and (3.2), respectively. Then, as usual,
[TABLE]
and furthermore
[TABLE]
This completes the proof for large enough, since .
Now for fixed let
[TABLE]
and inductively define
[TABLE]
If denotes the collection of all that are not contained in any and is the union
[TABLE]
then we clearly have
[TABLE]
for large enough since for any . Also clearly an iteration of (3.3) gives us that for any
[TABLE]
Furthermore, it is important to note that if then both (3.1) and (3.2) are false, so that
[TABLE]
We now state and prove a Carleson embedding type theorem for the type of operator used in the previous section, which will easily show Theorem 1.1. Given nonnegative measurable functions and , define by
[TABLE]
Theorem 3.1**.**
Let , let be a matrix A weight and let
[TABLE]
then
[TABLE]
Proof.
Let
[TABLE]
We first get a bound for . Note that
[TABLE]
by (3.6) since . Thus,
[TABLE]
However, if
[TABLE]
then (3.4) gives us that
[TABLE]
Then using the fact that ,
[TABLE]
By the sharp reverse Hölder inequality for A∞ weights, we can pick small enough where
[TABLE]
Now, for any nonnegative scalar Carleson sequence , if
[TABLE]
the standard proof of the (unweighted) dyadic Carleson embedding theorem and the well known “” Maximal function bound for small tells us that for
[TABLE]
Applying this to the exponent , (3.7) gives us
[TABLE]
Letting in conjunction with the monotone convergence theorem completes the proof. ∎
Finally, to see how this proves Theorem 1.1 when , set and let be a sparse collection. Set
[TABLE]
Then since
[TABLE]
where here is the collection of maximal with .
Thus, if is defined as in (2.1), then Theorem 3.1 gives us that for
[TABLE]
But Theorem 2.1 and the monotone convergence theorem then says for any , we have that
[TABLE]
To prove Theorem 1.1 when , we argue as in [2] and use a routine duality argument. In fact, we will prove a slightly stronger result. Given a sparse collection and , define the by
[TABLE]
Assume so that . Then
[TABLE]
However, as in the case, by the sharp reverse Hölder inequality for A∞ weights we can pick and where
[TABLE]
and
[TABLE]
If as usual
[TABLE]
then the sets are disjoint and . We then have
[TABLE]
where is the dyadic maximal function. This completes the proof.
Notice that when and we get that
[TABLE]
which as mentioned before coincides with the best known Ap - A∞ bound for sparse operators, since a sparse operator defined by
[TABLE]
can be trivially dominated by .
The reference list from the paper itself. Each links out to its DOI / PubMed record.
- 1[1] \bibname Christ, M., Goldberg, M., ’Vector A 2 weights and a Hardy-Littlewood maximal function.’ Trans. Amer. Math. Soc. 353 (2001), no. 5, 1995–2002.
- 2[2] \bibname Cruz-Uribe, D., Isralowitz, J., and Moen, K. ’Two weight bump conditions for matrix weights.’ Integral Equations Operator Theory 90 (2018), no. 3, Art. 36, 31 pp.
- 3[3] \bibname Culiuc, A., ’A note on two weight bounds for the generalized Hardy-Littlewood Maximal operator,’ preprint available at https://arxiv.org/abs/1506.07125 .
- 4[4] \bibname Goldberg, M. ’Matrix A p weights via maximal functions.’ Pacific J. Math. 211 (2003), no. 2, 201–220.
- 5[5] \bibname Hytönen, T and Li, K. ’Weak and strong A p -A ∞ estimates for square functions and related operators.’ J. Funct. Anal. 146 (2018), no. 6, 2497–2507.
- 6[6] \bibname Hytönen, T, Petermichl, S., and Volberg, A. ’The sharp square function estimate with matrix weight,’ preprint available at https://arxiv.org/abs/1702.04569 .
- 7[7] \bibname Isralowitz, J., Kwon, H. K., Pott, S, ’Matrix weighted norm inequalities for commutators and paraproducts with matrix symbols.’ J. Lond. Math. Soc. (2) 96 (2017), no. 1, 243–270.
- 8[8] \bibname Isralowitz, J., and Moen, K. ’Matrix weighted Poincaré inequalities and applications to degenerate elliptic systems.’ To appear in the Indiana Journal of Mathematics, https://arxiv.org/abs/1601.00111 .
