Carleson operators on doubling metric measure spaces

10 Two-sided Metric Space Carleson

We prove a variant of Theorem 1.0.2 for a two-sided Calderón–Zygmund kernel on the doubling metric measure space (X,ρ,μ,a), i.e. a one-sided Calderón–Zygmund kernel K which additionally satisfies for all x,x,yX with xy and 2ρ(x,x)ρ(x,y),

|K(x,y)K(x,y)|(ρ(x,x)ρ(x,y))1a2a3V(x,y).
10.0.1

By the additional regularity, we can weaken the assumption 1.0.18 to a family of operators that is easier to work with in applications. Namely, for r>0, xX, and a bounded, measurable function f:XC supported on a set of finite measure, we define

Trf(x):=rρ(x,y)K(x,y)f(y)dμ(y)=XB(x,r)K(x,y)f(y)dμ(y).
10.0.2

Theorem 10.0.1 two-sided metric space Carleson
#

For all integers a4 and real numbers 1<q2 the following holds. Let (X,ρ,μ,a) be a doubling metric measure space. Let Θ be a cancellative compatible collection of functions and let K be a two-sided Calderón–Zygmund kernel on (X,ρ,μ,a). Assume that for every bounded measurable function g on X supported on a set of finite measure and all r>0 we have

Trg22a3g2.
10.0.3

Then for all Borel sets F and G in X and all Borel functions f:XC with |f|1F, we have, with T defined in 1.0.17,

|GTfdμ|2452a3(q1)6μ(G)11qμ(F)1q.
10.0.4

For the remainder of this chapter, fix an integer a4, a doubling metric measure space (X,ρ,μ,a) and a two-sided Calderón–Zygmund kernel K as in Theorem 10.0.1.

The following lemma is proved in Section 10.1.

Lemma 10.0.2 nontangential-from-simple
#

Assume 10.0.3 holds. Then, for every bounded measurable function g:XC supported on a set of finite measure we have

Tg223a3g2.
10.0.5

Proof of Theorem 10.0.1

The proof of Lemma 10.0.2 relies on the following auxiliary lemma which is proved in Section 10.2.

Lemma 10.0.3 Calderon-Zygmund Weak (1, 1)

Let f:XC be a bounded measurable function supported on a set of finite measure and assume for some r>0 that for every bounded measurable function g:XC supported on a set of finite measure,

Trg22a3g2.
10.0.8

Then for all α>0, we have

μ({xX:|Trf(x)|>α})2a3+19aα|f(y)|dμ(y).
10.0.9

Throughout Section 10.2 and Section 10.1, for any measurable bounded function w:XC, let Mw:X[0,) denote the corresponding Hardy–Littlewood maximal function defined in Proposition 2.0.6. Apart from Proposition 2.0.6, Section 10.2 and Section 10.1 have no dependencies in the previous chapters.

10.1 Proof of Cotlar’s Inequality

Lemma 10.1.1 geometric series estimate
#

For all real numbers x4,

n=02nx2x.
Proof
Lemma 10.1.2 estimate x shift
#

Let 0<r and xX. Let g:XC be a bounded measurable function supported on a set of finite measure. Then for all x with ρ(x,x)r.

|Trg(x)Trg(x)|2a3+2a+2Mg(x).
Proof
Lemma 10.1.3 Cotlar control
#

Let 0<rR and xX. Let g:XC be a bounded measurable function supported on a set of finite measure. Then for all xX with ρ(x,x)R4 we have

|TRg(x)||Tr(gg1B(x,R2))(x)|+2a3+4a+1Mg(x).
10.1.15

Proof
Lemma 10.1.4 Cotlar sets
#

Assume that 10.0.3 holds. Let 0<rR and xX. Let g:XC be a bounded measurable function supported on a set of finite measure. Then the measure |F1| of the set F1 of all xB(x,R4) such that

|Trg(x)|>4M(Trg)(x)
10.1.21

is less than or equal to μ(B(x,R4))/4. Moreover, the measure |F2| of the set F2 of all xB(x,R4) such that

|Tr(g1B(x,R2))(x)|>2a3+20a+2Mg(x)
10.1.22

is less than or equal to μ(B(x,R4))/4.

Proof
Lemma 10.1.5 Cotlar estimate
#

Assume that 10.0.3 holds. Let 0<rR and xX. Let g:XC be a bounded measurable function supported on a set of finite measure. Then

|TRg(x)|22M(Trg)(x)+2a3+20a+3Mg(x).
10.1.28

Proof
Lemma 10.1.6 simple nontangential operator

Assume that 10.0.3 holds. For every r>0 and every bounded measurable function g supported on a set of finite measure we have

Trg22a3+24a+6g2,
10.1.30

where

Trg(x):=supr<RsupxB(x,R)|TR(g)(x)|.
10.1.31

Proof

In order to pass from the one-sided truncation in Tr and Tr to the two-sided truncation in T, we show in the following two lemmas that the integral in 1.0.16 can be exchanged for an integral over the difference of two balls.

Lemma 10.1.7 small annulus
#

Let f:XC be a bounded measurable function supported on a set of finite measure. Let xX and R>0. Then, for all ϵ>0, there exists some δ>0 such that

|R<ρ(x,y)<R+δK(x,y)f(y)dμ(y)|ϵ
10.1.37

and

|Rδ<ρ(x,y)<RK(x,y)f(y)dμ(y)|ϵ.
10.1.38

Proof
Lemma 10.1.8 nontangential operator boundary
#

Let f:XC be a bounded measurable function supported on a set of finite measure. For all xX,

Tf(x)=supR1<R2supxB(x,R1)|B(x,R2)B(x,R1)K(x,y)f(y)dμ(y)|
10.1.39

Proof
Proof of Lemma 10.0.2

10.2 Calderón-Zygmund Decomposition

Calderón-Zygmund decomposition is a tool to extend L2 bounds to Lp bounds with p<2 or to the so-called weak (1,1) type endpoint bound. It is classical and can be found in [ .

The following lemma is Theorem 3.1(b) in [ . The proof uses Proposition 2.0.6.

Lemma 10.2.1 Maximal theorem
#

Let f:XC be bounded, measurable, supported on a set of finite measure, and let α>0. Then

μ({xX:Mf(x)>α})22aα|f(y)|dμ(y).
10.2.1

Proof
Lemma 10.2.2 Lebesgue differentiation
#

Let f be a bounded measurable function supported on a set of finite measure. Then for μ almost every x, we have

limn1μ(Bn)Bnf(y)dy=f(x),

where {Bn}n1 is a sequence of balls with radii rn>0 such that xBn for each n1 and

limnrn=0.
Proof
Lemma 10.2.3 Disjoint family countable
#

In a doubling metric measure space (X,ρ,μ,a), every disjoint family of balls Bj=B(xj,rj), jJ, is countable.

Proof

The following lemma corresponds to Lemma 3.2 in [ with additional proof of the bounded intersection property taken from the proof of Proposition 7.1 .

Lemma 10.2.4 Ball covering
#

Given an open set OX, there exists a countable family of balls Bj=B(xj,rj) such that

BjBj= for jj
10.2.5

and for Bj:=B(xj,3rj),

jBj=O
10.2.6

and for Bj:=B(xj,7rj),

Bj(XO) for all j
10.2.7

and we have the bounded intersection property that each xO is contained in at most 26a of the Bj.

Proof

Most of the next lemma and its proof is taken from Theorem 4.2 in [ .

Let f be a bounded, measurable function supported on a set of finite measure and let α>1μ(X)|f|dμ. Then there exists a measurable function g, a countable family of balls Bj (where we allow B1=X in the special case that μ(X)<) such that each xX is contained in at most 26a of the Bj, and a countable family of measurable functions {bj}jJ such that for all xX

f(x)=g(x)+jbj(x)
10.2.16

and such that the following holds. For almost every xX,

|g(x)|23aα.
10.2.17

We have

|g(y)|dμ(y)|f(y)|dμ(y).
10.2.18

For every j

suppbjBj.
10.2.19

For every j

Bjbj(x)dμ(x)=0,
10.2.20

and

Bj|bj(x)|dμ(x)22a+1αμ(Bj).
10.2.21

We have

jμ(Bj)24aα|f(y)|dμ(y)
10.2.22

and

jBj|bj(y)|dμ(y)2|f(y)|dμ(y).
10.2.23

Proof

We use Lemma 10.2.5 to prove Lemma 10.0.3. For the remainder of this section, let f:XC, r>0 and α>0 as in the lemma. We define the constant

c:=2a312a4
10.2.37

and α:=cα. If α1μ(X)|f|dμ, then we directly have

μ({xX:|Trf(x)|>α})μ(X)1α|f(y)|dμ(y)2a3+19aα|f(y)|dμ(y),

which proves 10.0.9. So assume from now on that α>1μ(X)|f|dμ. Using Lemma 10.2.5 for f and α, we obtain the decomposition

f=g+b=g+jbj

such that the properties 10.2.16-10.2.23 are satisfied (with α replacing α). We rename Bj to Bj and let

Bj=B(xj,rj).
10.2.38

Define

Bj:=B(xj,2rj).
10.2.39

(In the special case Bj=X, we define Bj:=X.) Then Bj is a ball with the same center as Bj but with

μ(Bj)2aμ(Bj).
10.2.40

Let

Ω:=jBj.
10.2.41

We deal with Trg and Trb separately in the following lemmas.

Lemma 10.2.6 Estimate good
#
μ({xX:|Trg(x)|>α/2})22a3+3a+2cα|f(y)|dμ(y).
Proof
Lemma 10.2.7 Estimate bad partial
#

Let xXΩ. Then

|Trb(x)|3F(x)+α/8,

where

F(x):=2a3+2a+1cαjJ(rjρ(x,xj))1aμ(Bj)V(x,xj).
Proof
Lemma 10.2.8 Estimate F set
#

For F as defined in Lemma 10.2.7, we have

μ({xXΩ:F(x)>α/8})2a3+9a+4α|f(y)|dμ(y).
10.2.59

Proof
Lemma 10.2.9 Estimate bad
#

We have

μ({xX:|Trb(x)|>α/2})25ac+2a3+9a+4α|f(y)|dμ(y).
Proof
Proof of Lemma 10.0.3