Carleson operators on doubling metric measure spaces

2 Proof of Metric Space Carleson, overview

This section organizes the proof of Theorem 1.0.2 into sections 3, 4, 5, 6, 7, 8, and 9. These sections are mutually independent except for referring to the statements formulated in the present section. Chapter 3 proves the main Theorem 1.0.2, while sections 4, 5, 6, 7, 8, and 9 each prove one proposition that is stated in the present section. The present section also introduces all definitions used across these sections.

Section 2.1 proves some auxiliary lemmas that are used in more than one of the sections 3-9.

Let a,q be given as in Theorem 1.0.2.

Define

D:=2100a2,
2.0.1

κ:=210a,
2.0.2

and

Z:=212a.
2.0.3

Let ψ:RR be the unique compactly supported, piece-wise linear, continuous function with corners precisely at 14D, 12D, 14 and 12 which satisfies

sZψ(Dsx)=1
2.0.4

for all x>0. This function vanishes outside [14D,12], is constant one on [12D,14], and is Lipschitz with constant 4D.

Let a doubling metric measure space (X,ρ,μ,a) be given. Let a cancellative compatible collection Θ of functions on X be given. Let oX be a point such that ϑ(o)=0 for all ϑΘ.

Let a Borel measurable function Q:XΘ with finite range be given. Let a one-sided Calderón–Zygmund kernel K on X be given so that for every ϑΘ the operator TQϑ defined in 1.0.21 satisfies 1.0.23.

For sZ, we define

Ks(x,y):=K(x,y)ψ(Dsρ(x,y)),
2.0.5

so that for each x,yX with xy we have

K(x,y)=sZKs(x,y).

In Chapter 3, we prove Theorem 1.0.2 and Theorem 1.0.3 from the finitary version, Proposition 2.0.1 below. Recall that a function from a measure space to a finite set is measurable if the pre-image of each of the elements in the range is measurable.

Proposition 2.0.1 finitary Carleson

Let σ1,σ2:XZ be measurable functions with finite range and σ1σ2. Let F,G be bounded Borel sets in X. Then there is a Borel set G in X with 2μ(G)μ(G) such that for all Borel functions f:XC with |f|1F.

GG|s=σ1(x)σ2(x)Ks(x,y)f(y)e(Q(x)(y))dμ(y)|dμ(x)

2434a3(q1)5μ(G)11qμ(F)1q.
2.0.6

Let measurable functions σ1σ2:XZ with finite range be given. Let bounded Borel sets F,G in X be given. Let S be the smallest integer such that the ranges of σ1 and σ2 are contained in [S,S] and F and G are contained in the ball B(o,14DS).

In Chapter 4, we prove Proposition 2.0.1 using a bound for a dyadic model formulated in Proposition 2.0.2 below.

A grid structure (D,c,s) on X consists of a finite collection D of pairs (I,k) of Borel sets in X and integers k[S,S], the projection s:D[S,S],(I,k)k to the second component which is assumed to be surjective and called scale function, and a function c:DX called center function such that the five properties 2.0.7, 2.0.8, 2.0.9, 2.0.10, and 2.0.11 hold. We call the elements of D dyadic cubes. By abuse of notation, we will usually write just I for the cube (I,k), and we will write IJ to mean that for two cubes (I,k),(J,l)D we have IJ and kl.

For each dyadic cube I and each Sk<s(I) we have

IJD:s(J)=kJ.
2.0.7

Any two non-disjoint dyadic cubes I,J with s(I)s(J) satisfy

IJ.
2.0.8

There exists a I0D with s(I0)=S and c(I0)=o and for all cubes JD, we have

JI0.
2.0.9

For any dyadic cube I,

c(I)B(c(I),14Ds(I))IB(c(I),4Ds(I)).
2.0.10

For any dyadic cube I and any t with tDs(I)DS,

μ({xI : ρ(x,XI)tDs(I)})2tκμ(I).
2.0.11

A tile structure (P,I,Ω,Q,c,s) for a given grid structure (D,c,s) is a finite set P of elements called tiles with five maps

I:PDΩ:PP(Θ)Q:PQ(X)c:PXs:PZ

with I surjective and P(Θ) denoting the power set of Θ such that the five properties 2.0.13, 2.0.14, 2.0.15, 2.0.18, and 2.0.19 hold. For each dyadic cube I, the restriction of the map Ω to the set

P(I)={p:I(p)=I}
2.0.12

is injective and we have the disjoint covering property (we use the union symbol with dot on top to denote a disjoint union)

Q(X)˙pP(I)Ω(p).
2.0.13

For any tiles p,q with I(p)I(q) and Ω(p)Ω(q) we have

Ω(q)Ω(p).
2.0.14

For each tile p,

Q(p)Bp(Q(p),0.2)Ω(p)Bp(Q(p),1),
2.0.15

where

Bp(ϑ,R):={θΘ:dp(ϑ,θ)<R},
2.0.16

and

dp:=dB(c(p),14Ds(p)).
2.0.17

We have for each tile p

c(p)=c(I(p)),
2.0.18

s(p)=s(I(p)).
2.0.19

Proposition 2.0.2 discrete Carleson
#

Let (D,c,s) be a grid structure and

(P,I,Ω,Q,c,s)

a tile structure for this grid structure. Define for pP

E(p)={xI(p):Q(x)Ω(p),σ1(x)s(p)σ2(x)}
2.0.20

and

Tpf(x)=1E(p)(x)Ks(p)(x,y)f(y)e(Q(x)(y)Q(x)(x))dμ(y).
2.0.21

Then there exists a Borel set G with 2μ(G)μ(G) such that for all Borel functions f:XC with |f|1F we have

GG|pPTpf(x)|dμ(x)2434a3(q1)4μ(G)11qμ(F)1q.
2.0.22

The proof of Proposition 2.0.2 is done in Chapter 5 by a reduction to two further propositions that we state below.

Fix a grid structure (D,c,s) and a tile structure (P,I,Ω,Q,c,s) for this grid structure.

We define the relation

pp
2.0.23

on P×P meaning I(p)I(p) and Ω(p)Ω(p). We further define for λ,λ>0 the relation

λpλp
2.0.24

on P×P meaning I(p)I(p) and

Bp(Q(p),λ)Bp(Q(p),λ).
2.0.25

Define for a tile p and λ>0

E1(p):={xI(p)G:Q(x)Ω(p)},
2.0.26

E2(λ,p):={xI(p)G:Q(x)Bp(Q(p),λ)}.
2.0.27

Given a subset P of P, we define P(P) to be the set of all pP such that there exist pP with I(p)I(p). Define the densities

dens1(P):=suppPsupλ2λasuppP(P),λpλpμ(E2(λ,p))μ(I(p)),
2.0.28

dens2(P):=suppPsupr4Ds(p)μ(FB(c(p),r))μ(B(c(p),r)).
2.0.29

An antichain is a subset A of P such that for any distinct p,qA we do not have pq.

The following proposition is proved in Chapter 6.

Proposition 2.0.3 antichain operator
#

For any antichain A and for all f:XC with |f|1F and all g:XC with |g|1G

|g(x)pATpf(x)dμ(x)|
2.0.30

2150a3q1dens1(A)q18a4dens2(A)1q12f2g2.
2.0.31

Let n0. An n-forest is a pair (U,T) where U is a subset of P and T is a map assigning to each uU a nonempty set T(u)P called tree such that the following properties 2.0.32, 2.0.33, 2.0.34, 2.0.35, 2.0.36, and 2.0.37 hold.

For each uU and each pT(u) we have I(p)I(u) and

4pu.
2.0.32

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

p,pT(u),ppppT(u).
2.0.33

We have

uU1I(u)2n.
2.0.34

We have for every uU

dens1(T(u))24a+1n.
2.0.35

We have for u,uU with uu and pT(u) with I(p)I(u) that

dp(Q(p),Q(u))>2Z(n+1).
2.0.36

We have for every uU and pT(u) that

B(c(p),8Ds(p))I(u).
2.0.37

The following proposition is proved in Chapter 7.

Proposition 2.0.4 forest operator

For any n0 and any n-forest (U,T) we have for all f:XC with |f|1F and all bounded g with bounded support

|g(x)uUpT(u)Tpf(x)dμ(x)|
2432a32q1qndens2(uUT(u))1q12f2g2.

Theorem 1.0.2 is formulated at the level of generality for general kernels satisfying the mere Hölder regularity condition 1.0.15. On the other hand, the cancellative condition 1.0.12 is a testing condition against more regular, namely Lipschitz functions. To bridge the gap, we follow [ to observe a variant of 1.0.12 that we formulate in the following proposition proved in Chapter 8.

Define

τ:=1a.
2.0.38

Define for any open ball B of radius R in X the L-normalized τ-Hölder norm by

φCτ(B)=supxB|φ(x)|+Rτsupx,yB,xy|φ(x)φ(y)|ρ(x,y)τ.
2.0.39

Proposition 2.0.5 Holder van der Corput
#

Let zX and R>0 and set B=B(z,R). Let φ:XC by supported on B and satisfy φCτ(B)<. Let ϑ,θΘ. Then

|e(ϑ(x)θ(x))φ(x)dx|28aμ(B)φCτ(B)(1+dB(ϑ,θ))12a2+a3.
2.0.40

We further formulate a classical Vitali covering result and maximal function estimate that we need throughout several sections. This following proposition will typically be applied to the absolute value of a complex valued function and be proved in Chapter 9. By a ball B we mean a set B(x,r) with xX and r>0 as defined in 1.0.6. For a finite collection B of balls in X and 1p< define the measurable function MB,pu on X by

MB,pu(x):=(supBB1B(x)μ(B)B|u(y)|pdμ(y))1p.
2.0.41

Define further MB:=MB,1.

Let B be a finite collection of balls in X. If for some λ>0 and some measurable function u:X[0,) we have

Bu(x)dμ(x)λμ(B)
2.0.42

for each BB, then

λμ(B)22aXu(x)dμ(x).
2.0.43

For every measurable function v and 1p1<p2 we have

MB,p1vp222ap2p2p1vp2.
2.0.44

Moreover, given any measurable bounded function w:XC there exists a measurable function Mw:X[0,) such that the following 2.0.45 and 2.0.46 hold. For each ball BX and each xB

1μ(B)B|w(y)|dμ(y)Mw(x)
2.0.45

and for all 1p1<p2

M(wp1)1p1p224ap2p2p1wp2.
2.0.46

This completes the overview of the proof of Theorem 1.0.2.

2.1 Auxiliary lemmas

We close this section by recording some auxiliary lemmas about the objects defined in Chapter 2, which will be used in multiple sections to follow.

First, we record an estimate for the metrical entropy numbers of balls in the space Θ equipped with any of the metrics dB, following from the doubling property 1.0.11.

Lemma 2.1.1 ball metric entropy
#

Let BX be a ball. Let r>0, ϑΘ and kN. Suppose that ZBB(ϑ,r2k) satisfies that {BB(z,r)zZ} is a collection of pairwise disjoint sets. Then

|Z|2ka.
Proof

The next lemma concerns monotonicity of the metrics dB(c(I),14Ds(I)) with respect to inclusion of cubes I in a grid.

Lemma 2.1.2 monotone cube metrics
#

Let (D,c,s) be a grid structure. Denote for cubes ID

I:=B(c(I),14Ds(I)).

Let I,JD with IJ. Then for all ϑ,θΘ we have

dI(ϑ,θ)dJ(ϑ,θ),

and if IJ then we have

dI(ϑ,θ)295adJ(ϑ,θ).
Proof

We also record the following basic estimates for the kernels Ks.

Lemma 2.1.3 kernel summand

Let SsS and x,y,yX. If Ks(x,y)0, then we have

14Ds1ρ(x,y)12Ds.
2.1.2

We have

|Ks(x,y)|2102a3μ(B(x,Ds))
2.1.3

and

|Ks(x,y)Ks(x,y)|2150a3μ(B(x,Ds))(ρ(y,y)Ds)1a.
2.1.4

Proof