Absolute continuity and $\alpha$-numbers on the real line
Tuomas Orponen

TL;DR
This paper studies the relationship between absolute continuity and $ ext{alpha}$-numbers on the real line, showing how a square function built from Wasserstein distances characterizes the Lebesgue decomposition of measures.
Contribution
It establishes that the square function based on $ ext{alpha}$-numbers is finite almost everywhere on the absolutely continuous part and infinite on the singular part of a measure's Lebesgue decomposition on $ ext{R}$.
Findings
The square function $ ext{S}_ u( extmu)$ is finite $ ext{ extmu}_a$-almost everywhere.
The square function $ ext{S}_ u( extmu)$ is infinite $ ext{ extmu}_s$-almost everywhere.
Results provide a solution to the $n=d=1$ case of a problem posed by Azzam, David, and Toro.
Abstract
Let be Radon measures on , with non-atomic and doubling, and write for the Lebesgue decomposition of relative to . For an interval , define , the Wasserstein distance of normalised blow-ups of and restricted to . Let be the square function where is the family of dyadic intervals of side-length at most one. I prove that is finite almost everywhere, and infinite almost everywhere. I also prove a version of the result for a non-dyadic variant of the square function . The results answer the simplest " case of a problem of J.…
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.
Absolute continuity and -numbers on the real line
Tuomas Orponen
University of Helsinki, Department of Mathematics and Statistics
Abstract.
Let be Radon measures on , with non-atomic and doubling, and write for the Lebesgue decomposition of relative to . For an interval , define , the Wasserstein distance of normalised blow-ups of and restricted to . Let be the square function
[TABLE]
where is the family of dyadic intervals of side-length at most one. I prove that is finite almost everywhere, and infinite almost everywhere. I also prove a version of the result for a non-dyadic variant of the square function . The results answer the simplest " case of a problem of J. Azzam, G. David and T. Toro.
2010 Mathematics Subject Classification:
42A99 (Primary)
The research was supported by the grants 274512 and 309365 of the Finnish Academy.
Contents
1. Introduction
1.1. Wasserstein distance and -numbers
In this paper, and are non-zero Radon measures on . The measure is generally assumed to be either dyadically doubling or globally doubling. Dyadically doubling means that
[TABLE]
where is the standard family of dyadic intervals, and is the parent of , that is, the smallest interval in strictly containing . Globally doubling means that for and ; in particular, this implies . The main example for is the Lebesgue measure , and the proofs in this particular case would differ little from the ones presented below. No a priori homogeneity is assumed of .
Definition 1.2** (Wasserstein distance).**
I will use the following definition of the (first) Wasserstein distance: given two Radon measures measures on , set
[TABLE]
where the is taken over all -Lipschitz functions , which are supported on . Such functions will be called test functions. A slightly different – and also quite common – definition would allow the to run over all -Lipschitz functions . To illustrate the difference, let and . Then , but the alternative definition, say , would give . The main reason for using instead of in this paper is to comply with the definitions in [1, 2].
As in the paper [1] of J. Azzam, G. David and T. Toro, I make the following definition:
Definition 1.3** (-numbers).**
Assume that is an interval. Define
[TABLE]
where and are normalised blow-ups of and restricted to . More precisely, let be the increasing affine mapping taking to , and define
[TABLE]
If (or ), define (or ).
The quantity defined above is somewhat awkward to work with, as it lacks (see Example 5.2) the following desirable stability property: if are intervals of comparable length, and , then . Chiefly for this reason, I also need to consider the following "smooth" -numbers; the definition below is essentially the same as the one given by Azzam, David and Toro in [2, Section 5]:
Definition 1.4** (Smooth -numbers).**
Let . For an interval , define , where
[TABLE]
Here is the map from Definition 1.3, , and . If (or ), set (or ).
The only difference between the numbers and is in the normalisation of the measures and : if is closed, the measures are probability measures on , while . The numbers enjoy the stability property alluded to above. Moreover, if either or is a doubling, one has . These facts are contained in Proposition 5.4 (or see [2, Section 5]).
Remark 1.5*.*
The -numbers were first introduced by X. Tolsa in [7], where he used them to characterise the uniform rectifiability of Ahlfors-David regular measures in . Tolsa’s original definition of the -numbers has a different, asymmetric, normalisation compared to either or above, see [7, p. 394].
1.2. Main results
Before explaining the results in Azzam, David and Toro’s paper [1], and their connection to the current manuscript, I emphasise that [1] treats "-dimensional" measures in , for any . For the current paper, only the case is relevant. So, to avoid digressing too much, I need to state the results of [1] in far smaller generality than they deserve.
With this proviso in mind, the main results of [1] imply the following. if is a doubling measure on , and the numbers satisfy a Carleson condition of the form
[TABLE]
then , or at least a large part of , is absolutely continuous with respect to , with quantitative upper and lower bounds on the density. As the authors of [1] point out, the main shortcoming of their result is that condition (1.6) imposes a hypothesis on the first powers of the numbers , whereas evidence suggests (see [1, Remark 1.6.1], the discussion after [1, Theorem 1.7], and [1, Example 4.6]) that the correct power should be two. More support for this belief comes from the following "converse" result of Tolsa [8, Lemma 2.2]: if is a finite Borel measure on then
[TABLE]
In particular, if , then (1.7) holds for almost every . I should again mention that this is only the easiest case of Tolsa’s result. Here is a variant of the -number (in fact the one discussed in Remark 1.5).
The purpose of this paper is to address the problem of Azzam, David and Toro in the simplest case . I show that control for the second powers of the -numbers does guarantee absolute continuity with respect to Lebesgue measure. In fact, the doubling assumption on can be dropped, the Carleson condition (1.6) can be relaxed considerably, and the results remain valid, if is replaced by any doubling measure . The results below also contain the "converse" statement, analogous to (1.7).
I prove two variants of the main result: one dyadic, and the other non-dyadic. Here is the dyadic version:
Theorem 1.8**.**
Let be the family of dyadic subintervals of , and let be Borel probability measures on . Assume that does not charge the boundaries of intervals in , and is dyadically doubling. Write for the Lebesgue decomposition of relative to , where and . Finally, let be the square function
[TABLE]
Then:
- (a)
* is finite almost surely, and*
- (b)
* is infinite almost surely.*
In particular,
[TABLE]
Heuristically, this corresponds to assuming (1.6) at the scale , but I could not found a way to reduce the continuous problem to the dyadic one; on the other hand, a reduction in the other direction does not appear straightforward, either, so perhaps one needs to treat the cases separately. A caveat of the dyadic set-up is the "non-atomicity" hypothesis on . It cannot be dispensed with: for instance, if for any , which only belongs to the interiors of finitely many dyadic intervals, then is uniformly bounded (for instance ), but .
Here is the non-dyadic version of the main theorem:
Theorem 1.9**.**
Assume that are Radon measures, and is globally doubling. Write , as in Theorem 1.8. Let be the square function
[TABLE]
defined via the smooth -numbers . Then,
- (a)
* is finite almost surely, and*
- (b)
* is infinite almost surely.*
Recall that whenever is doubling, such as , see Proposition 5.4. So, Theorem 1.9 has the following corollary:
Corollary 1.10**.**
If is a Radon measure on such that
[TABLE]
for almost every , then .
The following question remains open:
Question 1**.**
In the setting of Theorem 1.9, is the square function in (1.11) (with replaced by ) finite almost everywhere?
The difficulties arise from the non-stability of the numbers . See [2, Section 5], and in particular [2, Lemma 5.3], for related discussion.
Assuming the full Carleson condition (1.6), and that is globally doubling, the authors of [1] prove something more quantitative than ; see in particular [1, Theorem 1.9]. The same ought to be true for the second powers of the -numbers, and indeed the following result can be easily deduced with the method of the current paper:
Theorem 1.12**.**
Assume that are Borel probability measures on , both dyadically doubling, and assume that the Carleson condition
[TABLE]
holds for some . Then belongs to , the dyadic class relative to . Similarly, if are Radon measures on , both globally doubling, and the Carleson condition (1.6) holds for the second powers , then .
The a priori doubling assumptions cannot be omitted (that is, they are not implied by the Carleson condition): just consider . It is clear that the Carleson condition (1.13) holds for the numbers , but nevertheless .
1.3. Outline of the paper, and the main steps of the proofs
The main substance of the paper is proving the dyadic result, Theorem 1.8, and in particular part (b). This work takes up Sections 2-4. The proof of part (a) is simpler, and closely follows a previous argument of Tolsa – namely the one used to prove (1.7). The details (both in the dyadic and continuous settings) are given in Section 6. Modifications required to prove part (b) of the "continuous" Theorem 1.9 are outlined in Section 5.
The proof of Theorem 1.8(b) has three main steps. First, the numbers are used to control something analyst-friendlier, namely the following dyadic variants:
[TABLE]
Here stands for the left half of . This would be simple, if happened to be one of the admissible test functions in the definition of . It is not, however, and in fact there seems to be no direct (and sufficiently efficient) way to control by , or even . However, it turns out that the numbers are equivalent at the level of certain Carleson sums over trees; proving this statement is the main content of Section 2.
The numbers are well-known quantities: they are the (absolute values of the) coefficients in an orthogonal representation of in terms of -adapted Haar functions, and it is known that they can be used to characterise . The following theorem is due to S. Buckley [3] from 1993:
Theorem 1.15** (Theorem 2.2(iii) in [3]).**
Let be a dyadically doubling Borel probability measures on . Then , if and only if
[TABLE]
The result in [3] is only stated for , but the proof works in the greater generality. Note the similarity between the Carleson conditions (1.16) and (1.13): The dyadic part of Theorem 1.12 is, in fact, nothing but a corollary of Buckley’s result, assuming that one knows how to control the numbers by the numbers at the level of Carleson sums; consequently, the short proof of this half of Theorem 1.12 can be found in Section 2. The continuous version is discussed briefly in Remark 5.19.
Buckley’s result is not applicable for Theorem 1.8: the measure is not dyadically doubling, and the information available is much weaker than the Carleson condition (1.13). Handling these issues constitutes the remaining two steps in the proof: all dyadic intervals are split into trees, where is "tree-doubling" (Section 4), and the absolute continuity of with respect to is studied in each tree separately (Section 3).
1.4. Acknowledgements
I am grateful to Jonas Azzam, David Bate, and Antti Käenmaki and for useful discussions during the preparation of the manuscript. I would also like to thank the referees for good comments, and for asking me to prove parts (a) of Theorems 1.8 and 1.9.
2. Comparison of -numbers and -numbers
In this section, and are Borel probability measures on , does not charge the boundaries of dyadic intervals, and is dyadically doubling inside :
[TABLE]
This implies, in particular, that for all with . The main task of the section is to bound the numbers by the numbers , where was the quantity
[TABLE]
The task would be trivial, if were a -Lipschitz function vanishing at the boundary of . It is not: in fact, the difference between and can be rather large for a given interval .
Example 2.1**.**
If and , then , but . These measures do not satisfy the assumptions of the section, so consider also the following example. Let , where takes the value everywhere, except in the -neighbourhood of . Let on the interval , and on the interval . Then is dyadically -doubling probability measure on , , and .
Fortunately, "pointwise" estimates between and are not really needed in this paper, and it turns out that certain sums of these numbers are comparable, up to a manageable error. To state such results, I need to introduce some terminology. A family of dyadic intervals is called coherent, if the implication
[TABLE]
holds for all .
Definition 2.2** (Trees, leaves, boundary).**
A tree is any coherent family of dyadic intervals with a unique largest interval, , and with the property that
[TABLE]
For the tree , define the set family to consist of the minimal intervals in , in other words those with . Abusing notation, I often write also for the set . Finally, define the boundary of the tree by
[TABLE]
Then , if and only if , and all intervals with are contained .
Definition 2.3** (-doubling measures).**
A Borel probability measure on is called -doubling, if
[TABLE]
Here is the main result of this section:
Proposition 2.4**.**
Let be measures satisfying the assumptions of the section, and let be a tree. Moreover, assume that is -doubling for some constant . Then
[TABLE]
The "dyadic part" of Theorem 1.12 is an immediate corollary:
Proof of Theorem 1.12, dyadic part.
By hypothesis, both measures and are -doubling. Hence, by the Carleson condition (1.13), and Proposition 2.4 applied to the trees , one has
[TABLE]
This is precisely the condition in Buckley’s result, Theorem 1.15, so . ∎
I then begin the proof of Proposition 2.4. It would, in fact, suffice to assume that is also just -doubling, but checking this would result in some unnecessary book-keeping below. The proof is based on the observation that can be written as a series of Lipschitz functions, each supported on sub-intervals of . This motivates the following considerations.
Assume that
[TABLE]
is a bounded function such that each is an -Lipschitz function supported on some interval . Assume moreover that the intervals are nested: . Then, as a first step in proving Proposition 2.4, I claim that
[TABLE]
for any , where
[TABLE]
For , the symbol "" should be interpreted as the intersection of all the intervals . I will first verify that, for any ,
[TABLE]
from which it will be easy to derive (2.5). If , the corresponding term should be interpreted as "[math]" (recall that is never zero by the doubling assumption). The proof of (2.6) is straightforward. First, note that since is an -Lipschitz function supported on , and , one has
[TABLE]
(The mappings are familiar from Definition 1.3). This gives rise to the first term in (2.6). What remains is bounded by
[TABLE]
This is (2.6), observing that
[TABLE]
since either or , and both possibilities give the same number . Finally, (2.5) is obtained by repeated application of (2.6). By induction, one can check that iterations of (2.6) (starting from , and recalling that are probability measures on ) leads to
[TABLE]
This gives (2.5) immediately, observing that .
Now, it is time to specify the functions . I first define a hands-on Whitney decomposition for . Pick a small parameter , to be specified later, and let . Then, set and for . Let be a partition of unity subordinate to slightly enlarged versions of the sets , . By this, I first mean that each is non-negative and -Lipschitz with
[TABLE]
Second, the supports of the functions should satisfy ,
[TABLE]
for . Third,
[TABLE]
Let and . Then
[TABLE]
This is the only place in the paper, where the assumption of not charging the boundaries of dyadic intervals is used (however, the estimate (2.9) will eventually be applied to all the measures , , so the full strength of the hypothesis is needed). The function is precisely of the form treated above with , since clearly . Applying the inequality (2.5) with any yields
[TABLE]
Next, observe that each function , , is bounded by and vanishes outside
[TABLE]
It follows that
[TABLE]
where the implicit constants only depend on the dyadic doubling constant of . In the sequel, I assume that is so small that , where is another small constant, which will eventually depend on the -doubling constant for . Recalling also (2.8), the estimate (2.10) then becomes
[TABLE]
The last term simply vanishes, if , because . A heuristic point to observe is that the left hand side is roughly ; the right hand side also contains the same term, but multiplied by a small constant . This gain is "paid for" by the large constant .
Next, the estimate is replicated for . This time, the inequality (2.5) is applied to the sequence , , , and in general for (here is the right half of ). Then, if is small enough, it is again clear that . Thus, by inequality (2.5),
[TABLE]
for any . As before, the term vanishes for (because ), and one can ensure
[TABLE]
by choosing small enough. Consquently (recalling (2.9)), (2.11) and (2.12) together imply
[TABLE]
Here is the collection of all the intervals and . The intervals and arise a total of two times from (2.11) and (2.12), but this has no visible impact on the end result, (2.13).
The estimate (2.13) generalises in a simple way to other intervals , besides , but requires an additional piece of notation. Let , and write . For , define and . Now, for a fixed dyadic interval , and , let be the collection of subintervals of , which includes for all and for all , see Figure 1. Then, the generalisation of (2.13) reads
[TABLE]
where . If and , for instance, then . The proof is nothing but an application of (2.13) to the measures and . For minor technical reasons, I also wish to allow the choice and : by definition, this choice means that and . It is easy to see that (2.14) remains valid in this case, with "" replaced by "" (for , this follows by applying (2.11) and (2.12) with the choices ).
Now, the table is set to prove Proposition 2.4, which I recall here:
Proposition 2.15**.**
Let be measures satisfying the assumptions of the section, and let be a tree. Moreover, assume that is -doubling for some constant . Then
[TABLE]
Proof.
The sum over is evidently bounded by , so it suffices to consider
[TABLE]
Let , and define the number as the smallest index so that . If no such index exists, set . If , then , and I define : then , and . Otherwise, if , let be the smallest index such that . If no such index exists, let . Now and are defined as after (2.14). Start by the following combination of (2.14) and Cauchy-Schwarz:
[TABLE]
The factors are under control, thanks to the -doubling hypothesis on , and the fact that . Since consists of two "branches" of nested intervals inside , and the -doubling hypothesis implies that the -measures of intervals decay geometrically along these branches, one arrives at
[TABLE]
Thus, by (2.16),
[TABLE]
The constant will have to be chosen so small, eventually, that its product with the implicit constants above is notably less than one. From now on, the precise restriction can be replaced by the conditions and . With this in mind, observe first that
[TABLE]
The final inequality uses, again, the geometric decay of -measures of intervals in . A similar estimate can be performed for the second term in (2.17). As for the third term,
[TABLE]
relying once more on the geometric decay of in . Combining all the estimates gives
[TABLE]
If the left hand side is a priori finite, the proof of Proposition 2.4 is now completed by choosing small enough, depending on . If not, consider any finite sub-tree with . Then, the proof above gives (2.18) with in place of . Hence
[TABLE]
where the constants do not depend on the choice of . Now the proposition follows by letting . ∎
3. Absolute continuity of tree-adapted measures
Recall the concepts of tree, leaves and boundaries from Definition 2.2, and the notion of -doubling measures from Definition 2.3. In the present section, I assume that is a tree, and are two finite Borel measures, which satisfy the following two assumptions:
- (A)
, and
- (B)
are -doubling for some constant .
In particular, the assumptions imply that
[TABLE]
For reasons to become apparent soon, I define the -adaptation of ,
[TABLE]
where . Note that
[TABLE]
because is disjoint from the leaves, which are also pairwise disjoint. In particular, . The main result of the section is the following:
Proposition 3.2**.**
Assume (A) and (B), and that
[TABLE]
Then . In particular .
Remark 3.3*.*
By the definition of , it is obvious that . So, the main point of Proposition 3.2 is to show that .
Since and , one may assume without loss of generality that
[TABLE]
The proof of Proposition 3.2 is based on a "product representation" for , relative to , in the spirit of [4, Theorem 3.22] of Fefferman, Kenig and Pipher. Recall that every interval has exactly two children: and . Define the -adapted Haar functions
[TABLE]
where
[TABLE]
This ensures that for . Note that , because . Now, the plan is to define coefficients , for , so that the following requirement is met:
[TABLE]
The left hand side of (3.4) is certainly constant on , so the equation has some hope; if , then the product is empty, and the right hand side of (3.4) equals by the assumption . Now, assume that (3.4) holds for some interval . Then , so if (3.4) is supposed to hold for , one has
[TABLE]
and similarly
[TABLE]
From (3.5) one solves
[TABLE]
and (3.6) gives
[TABLE]
Using that (and three other similar formulae), it is easy to see that the numbers on the right hand sides of (3.7) and (3.8) agree. So, can be defined consistently, and (3.4) holds for . Moreover, the formulae for look quite familiar:
Observation 1**.**
* for .*
Now that the coefficients have been successfully defined for , let be the (at the moment) formal series
[TABLE]
Since the Haar functions are orthogonal in , and satisfy
[TABLE]
one arrives at
[TABLE]
by the assumption in Proposition 3.2. This means that the sequence
[TABLE]
converges in . In particular, one can pick a subsequence , which converges pointwise almost everywhere (in fact, the entire sequence converges by basic martingale theory, but this is not needed). Now, recall that the goal was to prove that . To this end, one has to verify that
[TABLE]
at almost every . This is clear for , since the ratios , , are eventually constant. So, it suffices to prove (3.9) at almost every point . Fix a point with the properties that sequence converges, and also
[TABLE]
These properties hold at almost every . Let be so small that , and note that
[TABLE]
Now, the plan is to use the estimate , valid as long as for some . Observe that , where
[TABLE]
Consequently, for with , one has
[TABLE]
where only depends on the constant in (3.11). Since the sequence converges and (3.10) holds, the right hand side of (3.12) has a uniform lower bound . This implies that
[TABLE]
which gives (3.9) at . The proof of Proposition 3.2 is complete.
4. Proof of Theorem 1.8(b)
In this section, Theorem 1.8(b) is proved via a simple tree construction, coupled with Propositions 2.4 and 3.2. Recall the statement of Theorem 1.8(b):
Theorem 4.1**.**
Assume that are Borel probability measures on , does not charge the boundaries of dyadic intervals, and is dyadically doubling. Write for the Lebesgue decomposition of relative to , and let for the square function
[TABLE]
Then, is infinite almost surely.
An equivalent statement is that the restriction of to the set
[TABLE]
is absolutely continuous with respect to ; this is the formulation proven below. For the rest of the section, fix the measures as in the statement above, and let be the doubling constant of . I record a simple lemma, which says that the doubling of implies the doubling of on intervals, where the -number is small enough.
Lemma 4.2**.**
There are constants and , depending only on , such that the following holds. For every interval , if , then
[TABLE]
Proof.
Let and be intervals, which lie at distance from the boundaries of and , respectively, and have length . Let and be -Lipschitz functions, which equal on and , respectively, and are supported on and . Then
[TABLE]
and the analogous inequality holds for . The ratio is at least , so if , then both and . This gives (4.3) with . ∎
In particular, if is a tree, and for all , then is -doubling. I will now describe, how such trees are constructed, starting with . Let , and assume that some interval . If
[TABLE]
add to . The children and become the tops of new trees. If (4.4) fails, add and to . The construction of is now complete. If a new top was created in the process of constructing , and , construct a new tree with by repeating the algorithm above, only replacing by in the stopping criterion (4.4). Continue this process until all intervals in belong to some tree, or all remaining tops satisfy . For all tops with , simply define , so there is no further stopping inside .
Remark 4.5*.*
Let be one of the trees constructed above, with . Then is -doubling by Lemma 4.2, since it is clear that for all . In particular for all .
The following observation is now rather immediate from the definitions:
Lemma 4.6**.**
Assume that are distinct trees such that for all . Then
[TABLE]
Proof.
For , Let with . Then
[TABLE]
as claimed. ∎
It follows that almost every point in belongs to for only finitely many trees . This is equivalent to saying that almost every point in belongs to for some tree . The converse is also true: if belongs to for some tree , then clearly . Consequently
[TABLE]
To prove Theorem 4.1, it now suffices to show that for every tree . This is clear, if , so I exclude the trivial case to begin with. In the opposite case, note that
[TABLE]
It then follows from Proposition 2.4 that
[TABLE]
and the claim is finally a consequence of Proposition 3.2. The proof of Theorem 1.8(b) is complete.
5. The non-dyadic square function
This section contains the proof of Theorem 1.9(b). The argument naturally contains many similarities to the one given above. The main novelty is that one needs to work with the smooth -numbers, introduced in Definition 1.4 (or [1, Section 5]).
5.1. Smooth -numbers, and their properties
I recall the definition of the smooth -numbers:
Definition 5.1** (Smooth -numbers).**
Write . For an interval , define , where
[TABLE]
Here , and . If (or ), set (or ). Unwrapping the definition, if , then
[TABLE]
where the is taken over test functions .
Recall that the main reason to prefer the smooth -numbers over the ones from Definition 1.3 is the following stability property: if are intervals of comparable length, then , whenever either or is doubling. This fact is essentially [2, Lemma 5.2], but I include a proof in Proposition 5.4 for completeness. Similar stability is not true for the numbers and , even for very nice measures and , as the following example demonstrates:
Example 5.2**.**
Fix , and let and . Let be the same measure as in Example 2.1:
[TABLE]
Let . It is clear that both and are doubling, with constants independent of . It is also easy to check that for any interval with length such that (this implies that ). However, , because , while
[TABLE]
So, for instance, it is clear that no inequality of the form can hold.
Without any doubling assumptions, even the smooth -numbers can behave badly:
Example 5.3**.**
Let , and . Then , but .
Proposition 5.4** (Basic properties of the smooth -numbers).**
Let be two Radon measures on , and let be an interval. Then
[TABLE]
Moreover, if is doubling with constant , the following holds. If are intervals with for some , then
[TABLE]
Proof.
For the duration of the proof, fix an interval with . The cases, where or always require a little case chase, which I omit. Recall that . Note that any -Lipschitz function supported on must satisfy . Consequently for any interval , and so
[TABLE]
This proves the first inequality. For the second inequality, one may assume that , since otherwise for some constant , and this also gives . After this observation, it is easy to reduce to the case and . Fix a test function . Using that , one obtains
[TABLE]
To prove the final claim, start with the following estimate for a test function :
[TABLE]
Then, recall that . Further, it follows from the doubling of that . Finally, notice that and , where both
[TABLE]
are -Lipschitz functions supported on . Consequently,
[TABLE]
and the estimate (5.5) follows. ∎
5.2. Proof of Theorem 1.9(b)
In this section, is a globally doubling measure with constant , say. As in Section 4, it suffices to show that , where
[TABLE]
Write
[TABLE]
Assume without loss of generality (or translate both measures and slightly) that for all . Also without loss of generality, one may assume that : the reason is that the finiteness is equivalent to the finiteness of for all , whenever is open. So, it suffices to prove for any bounded open set . Whenever I write in the sequel, I only mean the family .
I start with some standard discretisation arguments. For each , associate a somewhat larger interval as follows. First, for and , choose a radius such that
[TABLE]
Then
[TABLE]
For with and , let be some open interval of the form , , such that
[TABLE]
The number "" simply ensures that with , and
[TABLE]
This implication also uses the slight separation between the scales, provided by the factors "" and "" in (5.6). For with , define (although this definition will never be really used). Now, a tree decomposition of can be performed as in the previous section, replacing the stopping condition (4.4) by declaring to consist of the maximal intervals with
[TABLE]
where is a suitable small number; in particular, is chosen so small that implies (which is possible by a small modification of Lemma 4.2). If now for infinitely many different trees , then
[TABLE]
which implies that . Repeating the argument from Section 4, this gives
[TABLE]
The converse inequality could also be deduced from the stability of the smooth -numbers (Proposition 5.4), but it is not needed: the inequality already shows that it suffices to prove
[TABLE]
for any given tree . So, fix a tree . If was chosen small enough (again depending on ), then is -doubling for some in the usual sense:
[TABLE]
So, if one knew that
[TABLE]
then the familiar Proposition 3.2 would imply (5.7), completing the entire proof.
The proof of (5.8) is based on the following inequality:
[TABLE]
The right hand side is finite by the same estimate as in (4.7) (start with , using for ). So, (5.9) implies (5.8). I start the proof of (5.9) by noting that if , then
[TABLE]
Noting that , to prove (5.9), it suffices to control
[TABLE]
by the right hand side of (5.9). The main task it to find a suitable replacement for the "" inequality (2.14), which I replicate here for comparison:
[TABLE]
Glancing at (5.11), one sees that an analogue for the inequality above is actually needed for both the terms
[TABLE]
If , then the trivial estimate will suffice, so in the sequel I assume that
[TABLE]
The goal is inequality (5.18) below. Fix and . Assume for notational convenience that , and hence, also . In a familiar manner, start by writing
[TABLE]
where is a non-negative -Lipschitz function supported on either (for ), or (for negative ) or (for positive ). As in the proof of the original inequality, it suffices to first estimate
[TABLE]
where , and more generally for ; eventually one can just replicate the argument for the function , and summing the bounds gives control for . Start with the following estimate, which only uses the triangle inequality, and the fact that is a -Lipschitz function supported on :
[TABLE]
Here
[TABLE]
since is doubling and vanishes outside , and
[TABLE]
since , where is a -Lipschitz function supported on . Consequently,
[TABLE]
Here vanishes outside on , so the estimate can be iterated. After repetitions (the case was seen above), one ends up with
[TABLE]
where one needs to intepret (which is different from in case ). What is a good choice for ? Let be the smallest number such that . If there is no such number, let . In case , the term on line (5.17) vanishes, since decays rapidly as long as (using the doubling of , and the fact that for ). If , the term on line (5.17) is clearly bounded by , since vanishes outside , which is well inside . Observing that also , it follows that
[TABLE]
Finally, by symmetry, the same argument can be carried out for the series . If is the smallest number such that , this leads to the following analogue of the inequality:
[TABLE]
Here is the collection of dyadic intervals , and . Finally, in the excluded special case, where (recall (5.13)), the same estimate holds, if one defines and (noting that , so ).
Armed with the inequality (5.18), the proof of the main estimate (5.9) is a replica of the argument in the dyadic case, namely the proof of Proposition 2.4. I only sketch the details. For , and , start with
[TABLE]
The second inequality is trivial, and the first is proved with the same Cauchy-Schwarz argument as (2.17), using the fact that that , which follows from , and in particular the geometric decay of the measures for . Now, the inequality above can be summed for precisely as in the proof of (2.18). In particular, one should first use the estimate
[TABLE]
which follows from , if is small enough, depending on the doubling constant of . The conclusion is
[TABLE]
for . As observed in and around (5.11), this implies (5.9).
Remark 5.19*.*
In the proof of (5.9), the uniform bound , , was only used to guarantee that is sufficiently doubling along, and inside, the balls . If such properties are assumed a priori in some given tree , then (5.9) continues to hold for . In particular, if is doubling on the whole real line, and Carleson condition
[TABLE]
holds, then the dyadic Carleson condition of Theorem 1.12 holds for any dyadic system (a family of half-open intervals covering , where every interval has length of the form for some , and every interval is the union of two further intervals in the family; the proof of Theorem 1.12 seen in Section 2 works for any such system). It follows from this that for every dyadic system , and consequently . (To see this, pick a finite collection of dyadic systems so that the of the corresponding dyadic maximal functions ,
[TABLE]
bounds the usual Hardy-Littlewood maximal function , up to a constant depending only on the doubling of . The construction of such systems is well-known, and in as few as systems do the trick; for a reference, see for instance Section 5 in [6]. Then, for every , there exists such that , see [5, Theorem 9.33(f)]. In particular for , and hence for . It follows that , which is one possible definition for . For much more information, see [5, Section 9.11].) This proves the "continuous" part of Theorem 1.12.
6. Parts (a) of the main theorems
Parts (a) of Theorems 1.8 and 1.9 are proved in this section: and are finite almost everywhere, where is the absolutely continuous part of relative to . The strategy is to prove the statement first for the dyadic square function , but allow to be a slightly generalised system: a family , , of half-open intervals of length at most one such that
- (D1)
each is a partition of ,
- (D2)
each interval in has length , and
- (D3)
each interval has two children in , denoted by .
The added generality makes no difference in the proof, which closely follows previous arguments of Tolsa from [7] and [8]. The benefit is that the non-dyadic square function can, eventually, be bounded by a finite sum of dyadic square functions , so the non-dyadic problem easily reduces to the dyadic one.
With the strategy in mind, fix a dyadic system satisfying (D1)-(D3), and let be the associated square function.
Lemma 6.1**.**
Assume that are Radon measures on , with finite, and dyadically doubling (relative to ). Then is finite almost surely.
The proof of Lemma 6.1 is a combination of two arguments of Tolsa: the proofs of [7, Theorem 1.1] and [8, Lemma 2.2]. I start with an analogue of [7, Theorem 1.1]:
Lemma 6.2**.**
Assume that . Then
[TABLE]
Proof.
It suffices to sum over the intervals with and ; fix one of these , and a -Lipschitz function , supported on . Then, write
[TABLE]
where is the Radon-Nikodym derivative . Express in terms of standard (-adapted) martingale differences:
[TABLE]
where , the sum converges in , and
[TABLE]
Note that is supported on and has -mean zero. By (6.4),
[TABLE]
Since the first term on the right hand side of (6.5) cancels out the last term in (6.3), one can continue as follows:
[TABLE]
Above, is the midpoint of , and the mean zero property of was used. Finally, recalling that is -Lipschitz, one obtains
[TABLE]
Taking a over admissible functions gives
[TABLE]
Now, using (6.6) and Cauchy-Schwarz, we may sum over as follows (we suppress the requirement from the notation):
[TABLE]
Clearly,
[TABLE]
so
[TABLE]
as claimed. ∎
Corollary 6.7**.**
If , then is finite almost everywhere.
Proof.
By Lemma 6.2, and the Lebesgue differentiation theorem, the following conditions hold almost everywhere:
[TABLE]
Clearly for such . ∎
Now, we can prove Lemma 6.1 by an argument similar to [8, Lemma 2.2]:
Proof of Lemma 6.1.
Perform a Calderón-Zygmund decomposition of with respect to , at some level . More precisely, let be the family of maximal intervals with , and set , where
[TABLE]
and
[TABLE]
Then (the implicit constants depend on the doubling of ), and
[TABLE]
Since (recall that is a finite measure), it follows that as . Hence, it suffices to show that
[TABLE]
where . Let be the intervals, which are not contained in any interval in . Fix , and note that if , then . Observe that for , and consequently
[TABLE]
for any -Lipschitz function supported on . Using the zero-mean property of the measures , estimate further as follows:
[TABLE]
where , and is the midpoint of . Using the fact that is -Lipschitz, one has
[TABLE]
and finally
[TABLE]
Since is finite almost everywhere by Corollary 6.7, and in particular for almost every , it remains to prove that for almost every . First, note that
[TABLE]
as the intervals in are disjoint. Consequently,
[TABLE]
It follows that for almost every . This completes the proof of Lemma 6.1, and Theorem 1.8(a). ∎
6.1. Bounding the non-dyadic square function
It remains to prove Theorem 1.9(a). Assume that are Radon measures on , with doubling, and recall that is the square function
[TABLE]
The claim is that is finite almost everywhere; since this is a local problem, one may assume that is a finite measure. Now, as in Remark 5.19 (or see [6, Section 5]), pick a finite number of dyadic systems with the following property: for any interval , there exists , depending on , and an interval such that and . As a little technical point, we actually need to restrict to intervals of length at most one, so also the defining property above only holds for intervals of length , say.
Then, apply Lemma 6.1 to each of the corresponding square functions to infer the following:
[TABLE]
for almost every (note that is dyadically doubling relative to every ). So, it suffices to argue that dominates . Using the stability of the smooth -numbers, and the fact that they are dominated by the regular -numbers whenever is doubling (see Proposition 5.4), one has
[TABLE]
where , and is a dyadic interval of length at most one, satisfying and . The existence follows from the construction of the systems . It is now clear that , and the proof of Theorem 1.9(a) is complete.
Remark 6.8*.*
Lemma 5.4 in [2] implies that
[TABLE]
whenever is doubling, and , . So, at the level of -averages over scales, the smooth and regular -numbers are comparable. One would need a similar comparison at the level of -averages to answer Question 1.
The reference list from the paper itself. Each links out to its DOI / PubMed record.
- 1[1] J. Azzam, G. David, and T. Toro : Wasserstein Distance and the Rectifiability of Doubling Measures: Part I , Math. Ann. 364 (1-2) (2016), 151–224
- 2[2] J. Azzam, G. David, and T. Toro : Wasserstein Distance and the Rectifiability of Doubling Measures: Part II , to appear in Math. Z., available at ar Xiv:1411.2512.
- 3[3] S. Buckley : Summation conditions on weights , Michigan Math. J. 40 (1993) 153–170
- 4[4] R. Fefferman, C. Kenig, and J. Pipher : The Theory of Weights and the Dirichlet Problem for Elliptic Equations , Ann. of Math. 134 (1) (1991), 65–124
- 5[5] L. Grafakos : Modern Fourier Analysis , Second Edition, Graduate Texts in Mathematics, Springer 2014
- 6[6] C. Muscalu, T. Tao, and C. Thiele : Multi-linear operators given by singular multipliers , J. Amer. Math. Soc. 15 (2) (2002) 469–496
- 7[7] X. Tolsa : Uniform rectifiability, Calderón-Zygmund operators with odd kernel, and quasiorthogonality , Proc. London Math. Soc. 98 (2) (2009), 393–426
- 8[8] X. Tolsa : Characterization of n 𝑛 n -rectifiability in terms of Jones’ square function: part I , Calc. Var. PDE 54 (4) (2015), 3643–3665
