Carleson operators on doubling metric measure spaces

7 Proof of the Forest Operator Proposition

7.1 The pointwise tree estimate

Fix a forest (U,T). The main result of this subsection is Lemma 7.1.3, we begin this section with some definitions necessary to state the lemma.

For uU and xX, we define

σ(u,x):={s(p):pT(u),xE(p)}.

This is a subset of Z[S,S], so has a minimum and a maximum. We set

σ(u,x):=maxσ(T(u),x)
σ(u,x):=minσ(T(u),x).
Lemma 7.1.1 convex scales
#

For each uU, we have

σ(u,x)=Z[σ(u,x),σ(u,x)].
Proof

For a nonempty collection of tiles SP we define

J0(S)

to be the collection of all dyadic cubes JD such that s(J)=S or

I(p)B(c(J),100Ds(J)+1)

for all pS. We define J(S) to be the collection of inclusion maximal cubes in J0(S).

We further define

L0(S)

to be the collection of dyadic cubes LD such that s(L)=S, or there exists pS with LI(p) and there exists no pS with I(p)L. We define L(S) to be the collection of inclusion maximal cubes in L0(S).

For each SP, we have

IDI=JJ(S)˙J
7.1.1

and

IDI=LL(S)˙L.
7.1.2

Proof

For a finite collection of pairwise disjoint cubes C, define the projection operator

PCf(x):=JC1J(x)1μ(J)Jf(y)dμ(y).

Given a scale SsS and a point xID,s(I)=sI, there exists a unique cube in D of scale s containing x by 2.0.7. We denote it by Is(x). Define for ϑΘ the nontangential maximal operator

TNϑf(x):=supSs1<SsupxIs1(x)sups1s2SDs21RQ(ϑ,x)|s=s1s2Ks(x,y)f(y)dμ(y)|.
7.1.3

Define for each uU the auxiliary operator

S1,uf(x)

:=ID1I(x)JJ(T(u))JB(c(I),16Ds(I))s(J)s(I)D(s(J)s(I))/aμ(B(c(I),16Ds(I)))J|f(y)|dμ(y).
7.1.4

Define also the collection of balls

B={B(c(I),2sDs(I)+t) : ID,0sS+5,0t2S+3}.

The following pointwise estimate for operators associated to sets T(u) is the main result of this subsection.

Lemma 7.1.3 pointwise tree estimate

Let uU and LL(T(u)). Let x,xL. Then for all bounded functions f with bounded support

|pT(u)Tp[e(Q(u))f](x)|

2151a3(MB,1+S1,u)PJ(T(u))|f|(x)+|TNQ(u)PJ(T(u))f(x)|,
7.1.5

Proof
Lemma 7.1.4 first tree pointwise

For all uU, all LL(T(u)), all x,xL and all bounded f with bounded support, we have

(???)102104a3MB,1PJ(T(u))|f|(x).
Proof
Lemma 7.1.5 second tree pointwise

For all uU, all LL(T(u)), all x,xL and all bounded f with bounded support, we have

|sσ(u,x)Ks(x,y)PJ(T(u))f(y)dμ(y)|TNQ(u)PJ(T(u))f(x).
Proof
Lemma 7.1.6 third tree pointwise
#

For all uU, all LL(T(u)), all x,xL and all bounded f with bounded support, we have

|sσ(u,x)Ks(x,y)(f(y)PJ(T(u))f(y))dμ(y)|
2151a3S1,uPJ(T(u))|f|(x).
Proof

7.2 An auxiliary L2 tree estimate

In this subsection we prove the following estimate on L2 for operators associated to trees.

Lemma 7.2.1 tree projection estimate

Let uU. Then we have for all f,g bounded with bounded support

|XpT(u)g¯(y)Tpf(y)dμ(y)|

2152a3PJ(T(u))|f|2PL(T(u))|g|2.
7.2.1

Below, we deduce Lemma 7.2.1 from Lemma 7.1.3 and the following estimates for the operators in Lemma 7.1.3.

Lemma 7.2.2 nontangential operator bound

For all bounded f with bounded support and all ϑΘ

TNϑf22102a3f2.
Lemma 7.2.3 boundary operator bound

For all uU and all bounded functions f with bounded support

S1,uf2212af2.
7.2.2

Proof of Lemma 7.2.1

Now we prove the two auxiliary lemmas. We begin with the nontangential maximal operator TN.

Proof of Lemma 7.2.2

We need the following lemma to prepare the L2-estimate for the auxiliary operators S1,u.

Lemma 7.2.4 boundary overlap
#

For every cube ID, there exist at most 29a cubes JD with s(J)=s(I) and B(c(I),16Ds(I))B(c(J),16Ds(J)).

Proof

Now we can bound the operators S1,u.

Proof of Lemma 7.2.3

7.3 The quantitative L2 tree estimate

The main result of this subsection is the following quantitative bound for operators associated to trees, with decay in the densities dens1 and dens2.

Let uU. Then for all bounded f with bounded support and g with |g|1G we have

|Xg¯pT(u)Tpfdμ|2202.5a3dens1(T(u))1/2f2g2.
7.3.1

If additionally |f|1F, then we have

|Xg¯pT(u)Tpfdμ|2303a3dens1(T(u))1/2dens2(T(u))1/2f2g2.
7.3.2

Below, we deduce this lemma from Lemma 7.2.1 and the following two estimates controlling the size of support of the operator and its adjoint.

Lemma 7.3.2 local dens1 tree bound

Let uU and LL(T(u)). Then

μ(LGpT(u)E(p))2101a3dens1(T(u))μ(L).
7.3.3

Lemma 7.3.3 local dens2 tree bound

Let uU and JJ(T(u)). Then

μ(FJ)2201a3dens2(T(u))μ(J).
Proof of Lemma 7.3.1

Now we prove the two auxiliary estimates.

Proof of Lemma 7.3.2
Proof of Lemma 7.3.3

7.4 Almost orthogonality of separated trees

The main result of this subsection is the almost orthogonality estimate for operators associated to distinct trees in a forest in Lemma 7.4.4 below. We will deduce it from Lemmas 7.4.5 and 7.4.6, which are proven in Subsections 7.5 and 7.6, respectively. Before stating it, we introduce some relevant notation.

The adjoint of the operator Tp defined in 2.0.21 is given by

Tpg(x)=E(p)Ks(p)(y,x)e(Q(y)(x)+Q(y)(y))g(y)dμ(y).
7.4.1

Lemma 7.4.1 adjoint tile support

For each pP, we have

Tpg=1B(c(p),5Ds(p))Tp1I(p)g.

For each uU and each pT(u), we have

Tpg=1I(u)Tp1I(u)g.
Proof
Lemma 7.4.2 adjoint tree estimate

For all g with |g|1G, we have that

pT(u)Tpg22155a3dens1(T(u))1/2g2.
Proof

We define

S2,ug:=|pT(u)Tpg|+MB,1g+|g|.
Lemma 7.4.3 adjoint tree control

We have for all uU and g with |g|1G

S2,ug22156a3g2.
Proof

Now we are ready to state the main result of this subsection.

Lemma 7.4.4 correlation separated trees

For any u1u2U and all bounded g1,g2 with bounded support, we have

|Xp1T(u1)p2T(u2)Tp1g1Tp2g2dμ|
7.4.3

2550a33nj=12S2,ujgjL2(I(u1)I(u2)).
7.4.4

Proof of Lemma 7.4.4
Lemma 7.4.5 correlation distant tree parts

We have for all u1u2U with I(u1)I(u2) and all bounded g1,g2 with bounded support

|Xp1T(u1)p2T(u2)STp1g1Tp2g2dμ|
7.4.6

2541a32Zn/(4a2+2a3)j=12S2,ujgjL2(I(u1)).
7.4.7

Lemma 7.4.6 correlation near tree parts

We have for all u1u2U with I(u1)I(u2) and all bounded g1,g2 with bounded support

|Xp1T(u1)p2T(u2)STp1g1Tp2g2dμ|
7.4.8

2222a32Zn210aj=12S2,ujgjL2(I(u1)).
7.4.9

In the proofs of both lemmas, we will need the following observation.

Lemma 7.4.7 overlap implies distance

Let u1u2U with I(u1)I(u2). If pT(u1)T(u2) with I(p)I(u1), then pS. In particular, we have T(u1)S.

Proof

To simplify the notation, we will write at various places throughout the proof of Lemmas 7.4.5 and 7.4.6 for a subset CP

TCf:=pCTpf,TCg:=pCTpg.

7.5 Proof of the Tiles with large separation Lemma

Lemma 7.4.5 follows from the van der Corput estimate in Proposition 2.0.5. We apply this proposition in Section 7.5.3. To prepare this application, we first, in Section 7.5.1, construct a suitable partition of unity, and show then, in Section 7.5.2 the Hölder estimates needed to apply Proposition 2.0.5.

7.5.1 A partition of unity

Define

J={JJ(S) : JI(u1)}.
Lemma 7.5.1 dyadic partition 1

We have that

I(u1)=JJ˙J.
Proof

For cubes JD, denote

B(J):=B(c(J),8Ds(J)).
7.5.1

The main result of this subsubsection is the following.

Lemma 7.5.2 Lipschitz partition unity

There exists a family of functions χJ, JJ such that

1I(u1)=JJχJ,
7.5.2

and for all JJ and all y,yI(u1)

0χJ(y)1B(J)(y),
7.5.3

|χJ(y)χJ(y)|2226a3ρ(y,y)Ds(J).
7.5.4

In the proof, we will use the following auxiliary lemma.

Lemma 7.5.3 moderate scale change

If J,JJ with

B(J)B(J),

then |s(J)s(J)|1.

Proof of Lemma 7.5.2
Proof of Lemma 7.5.3

7.5.2 Hölder estimates for adjoint tree operators

Let g1,g2:XC be bounded with bounded support. Define for JJ

hJ(y):=χJ(y)(e(Q(u1)(y))TT(u1)g1(y))(e(Q(u2)(y))TT(u2)Sg2(y)).
7.5.7

The main result of this subsubsection is the following τ-Hölder estimate for hJ, where τ=1/a.

Lemma 7.5.4 Holder correlation tree

We have for all JJ that

hJCτ(B(c(J),8Ds(J)))2535a3j=1,2(infB(c(J),18Ds(J))|TT(uj)gj|+infJMB,1|gj|).
7.5.8

We will prove this lemma at the end of this section, after establishing several auxiliary results.

We begin with the following Hölder continuity estimate for adjoints of operators associated to tiles.

Lemma 7.5.5 Holder correlation tile

Let uU and pT(u). Then for all y,yX and all bounded g with bounded support, we have

|e(Q(u)(y))Tpg(y)e(Q(u)(y))Tpg(y)|

2151a3μ(B(c(p),4Ds(p)))(ρ(y,y)Ds(p))1/aE(p)|g(x)|dμ(x).
7.5.9

Proof

Recall that

B(J):=B(c(J),8Ds(J)).

We also denote

B(J):=B(c(J),18Ds(J)).
Lemma 7.5.6 limited scale impact

Let pT(u2)S, JJ and suppose that

B(I(p))B(J).

Then

s(J)s(p)s(J)+3.
Proof
Lemma 7.5.7 local tree control
#

For all JJ and all bounded g with bounded support

supB(J)|TT(u2)Sg|2104a3infJMB,1|g|
Proof
Lemma 7.5.8 scales impacting interval

Let C=T(u1) or C=T(u2)S. Then for each JJ and pC with B(I(p))B(J), we have s(p)s(J).

Proof

Let C1=T(u1) and C2=T(u2)S. Then for i=1,2 and each JJ and all bounded g with bounded support, we have

supB(J)|TCig|infB(J)|TCig|+2151a3+4a+2infJMB,1|g|

and for all y,yB(J)

|e(Q(ui)(y))TCig(y)e(Q(ui)(y))TCig(y)|

2151a3+4a+1(ρ(y,y)Ds(J))1/ainfJMB,1|g|.
7.5.18

Proof
Lemma 7.5.10 global tree control 2

We have for all JJ and all bounded g with bounded support

supB(J)|TT(u2)Sg|infB(J)|TT(u2)g|+2155a3infJMB,1|g|.
Proof
Proof of Lemma 7.5.4

7.5.3 The van der Corput estimate

Lemma 7.5.11 lower oscillation bound

For all JJ, we have that

dB(J)(Q(u1),Q(u2))2201a32Zn/2.
Proof

Now we are ready to prove Lemma 7.4.5.

Proof of Lemma 7.4.5

7.6 Proof of The Remaining Tiles Lemma

We define

J={JJ(T(u1)):JI(u1)},

note that this is different from the J defined in the previous subsection.

Lemma 7.6.1 dyadic partition 2

We have

I(u1)=JJ˙J.
Proof

Lemma 7.4.6 follows from the following key estimate.

Lemma 7.6.2 bound for tree projection

We have

PJ|TT(u2)Sg2|22118a32100202aZnκ1I(u1)MB,1|g2|2

We prove this lemma below. First, we deduce Lemma 7.4.6.

Proof of Lemma 7.4.6

We need two more auxiliary lemmas before we prove Lemma 7.6.2.

Lemma 7.6.3 thin scale impact
#

If pT(u2)S and JJ with B(I(p))B(J), then

s(p)s(J)+2Zn202a3.
Proof
Lemma 7.6.4 square function count

For each JJ and all s0, we have

1μ(J)J(ID,s(I)=s(J)sII(u1)=JB(I)1B(I))2dμ214a+1(8Ds)κ.
Proof
Proof of Lemma 7.6.2

7.7 Forests

In this subsection, we complete the proof of Proposition 2.0.4 from the results of the previous subsections.

Define an n-row to be an n-forest (U,T), i.e. satisfying conditions 2.0.32 - 2.0.37, such that in addition the sets I(u),uU are pairwise disjoint.

Let (U,T) be an n-forest. Then there exists a decomposition

U=1j2n˙Uj

such that for all j=1,,2n the pair (Uj,T|Uj) is an n-row.

Proof

We pick a decomposition of the forest (U,T) into 2n n-rows

(Uj,Tj):=(Uj,T|Uj)

as in Lemma 7.7.1.

For each 1j2n and each bounded g with bounded support with |g|1G, we have

uUjpT(u)Tpg22156a32n/2g2
7.7.1

and

uUjpT(u)1FTpg22257a32n/2dens2(uUT(u))1/2g2.
7.7.2

Proof
Lemma 7.7.3 row correlation

For all 1j<j2n and for all g1,g2 with |gi|1G, it holds that

|uUjuUjpTj(u)pTj(u)Tpg1Tpg2dμ|2862a33ng12g22.
Proof

Define for 1j2n

Ej:=uUjpT(u)E(p).
Lemma 7.7.4 disjoint row support

The sets Ej, 1j2n are pairwise disjoint.

Proof

Now we prove Proposition 2.0.4.

Proof of Proposition 2.0.4