Carleson operators on doubling metric measure spaces

11 Proof of The Classical Carleson Theorem

The convergence of partial Fourier sums is proved in Section 11.1 in two steps. In the first step, we establish convergence on a suitable dense subclass of functions. We choose smooth functions as subclass, the convergence is stated in Lemma 11.1.2 and proved in Section 11.2. In the second step, one controls the relevant error of approximating a general function by a function in the subclass. This is stated in Lemma 11.1.3 and proved in Section 11.6. The proof relies on a bound on the real Carleson maximal operator stated in Lemma 11.1.5 and proved in Section 11.7, which involves showing that the real line fits into the setting of Chapter 2. This latter proof refers to the two-sided variant of the Carleson Theorem 10.0.1. Two assumptions in Theorem 1.0.2 require more work. The boundedness of the operator Tr defined in 10.0.2 is established in 11.1.6. This lemma is proved in Section 11.3. The cancellative property is verified by Lemma 11.1.7, which is proved in Section 11.4. Several further auxiliary lemmas are stated and proved in Section 11.1, the proof of one of these auxiliary lemmas, Lemma 11.1.10, is done in Section 11.5.

All subsections past Section 11.1 are mutually independent.

11.1 The classical Carleson theorem

Let a uniformly continuous 2π-periodic function f:RC and ϵ>0 be given. Let

Ca,q:=2452a3(q1)6
11.1.1

denote the constant from Theorem 10.0.1. Define

ϵ:=ϵ4Cϵ,
11.1.2

where

Cϵ=(8πϵ)12C4,2+π.

Since f is continuous and periodic, f is uniformly continuous. Thus, there is a 0<δ<π such that for all x,xR with |xx|δ we have

|f(x)f(x)|ϵ.
11.1.3

Define

f0:=fϕδ,
11.1.4

where ϕδ is a nonnegative smooth bump function with supp(ϕδ)(δ,δ) and Rϕδ(x)dx=1.

Lemma 11.1.1 smooth approximation
#

The function f0 is 2π-periodic. The function f0 is smooth (and therefore measurable). The function f0 satisfies for all xR:

|f(x)f0(x)|ϵ,
11.1.5

Proof

We prove in Section 11.2:

Lemma 11.1.2 convergence for smooth
#

There exists some N0N such that for all N>N0 and x[0,2π] we have

|SNf0(x)f0(x)|ϵ4.
11.1.6

We prove in Section 11.6:

Lemma 11.1.3 control approximation effect
#

There is a set ER with Lebesgue measure |E|ϵ such that for all

x[0,2π)E
11.1.7

we have

supN0|SNf(x)SNf0(x)|ϵ4.
11.1.8

We are now ready to prove Theorem 1.0.1. We first prove a version with explicit exceptional sets.

Theorem 11.1.4 classical Carleson with exceptional sets

Let f be a 2π-periodic complex-valued continuous function on R. For all ϵ>0, there exists a Borel set E[0,2π] with Lebesgue measure |E|ϵ and a positive integer N0 such that for all x[0,2π]E and all integers N>N0, we have

|f(x)SNf(x)|ϵ.
11.1.9

Proof

Now we turn to the proof of the statement of Carleson theorem given in the introduction.

Proof of Theorem 1.0.1

Let κ:RC be the function defined by κ(0)=0 and for 0<|x|<1

κ(x)=1|x|1eix
11.1.13

and for |x|1,

κ(x)=0.
11.1.14

Note that this function is continuous at every point x with |x|>0.

The proof of Lemma 11.1.3 will use the following Lemma 11.1.5, which itself is proven in Section 11.7 as an application of Theorem 1.0.2.

Let F,G be Borel subsets of R with finite measure. Let f be a bounded measurable function on R with |f|1F. Then

|GTf(x)dx|C4,2|F|12|G|12,
11.1.15

where

Tf(x)=supnZsupr>0|r<|xy|<1f(y)κ(xy)einydy|.
11.1.16

One of the main assumptions of Theorem 10.0.1, concerning the operator Tr defined in 10.0.2, is verified by the following lemma, which is proved in Section 11.3.

Lemma 11.1.6 Hilbert strong 2 2

Let 0<r<1. Let f be a bounded, measurable function on R with bounded support. Then

Hrf2213f2,
11.1.17

where

Hrf(x):=Trf(x)=rρ(x,y)κ(xy)f(y)dy
11.1.18

The next lemma will be used to verify that the collection Θ of modulation functions in our application of Theorem 1.0.2 satisfies the condition 1.0.12. It is proved in Section 11.4.

Lemma 11.1.7 van der Corput
#

Let αβ be real numbers. Let g:RC be a measurable function and assume

gLip(α,β):=supαxβ|g(x)|+|βα|2supαx<yβ|g(y)g(x)||yx|<.
11.1.19

Then for any αβ and nZ we have

αβg(x)einxdx2π|βα|gLip(α,β)(1+|n||βα|)1.
11.1.20

We close this section with five lemmas that are used across the following subsections.

Lemma 11.1.8 Dirichlet kernel

We have for every 2π-periodic bounded measurable f and every N0

SNf(x)=12π02πf(y)KN(xy)dy
11.1.21

where KN is the 2π-periodic continuous function of R given by

n=NNeinx.
11.1.22

We have for eix1 that

KN(x)=eiNx1eix+eiNx1eix.
11.1.23

Proof
Lemma 11.1.9 lower secant bound
#

Let η>0 and 2π+ηx2πη with |x|η. Then

|1eix|2πη
11.1.27

Proof

The following lemma will be proved in Section 11.5.

Lemma 11.1.10 spectral projection bound
#

Let f be a bounded 2π-periodic measurable function. Then, for all N0

SNfL2[π,π]fL2[π,π].
11.1.28

Lemma 11.1.11 Hilbert kernel bound
#

For x,yR with xy we have

|κ(xy)|22(2|xy|)1.
11.1.29

Proof
Lemma 11.1.12 Hilbert kernel regularity
#

For x,y,yR with xy,y and

2|yy||xy|,
11.1.32

we have

|κ(xy)κ(xy)|281|xy||yy||xy|.
11.1.33

Proof

11.2 Smooth functions.

Lemma 11.2.1
#

Let f:RC be 2π-periodic and continuously differentiable, and let nZ{0}. Then

f^n=1inf^n.
11.2.1

Proof
Lemma 11.2.2
#

Let f:RC such that

nZ|f^n|<.
11.2.2

Then

supx[0,2π]|f(x)SNf(x)|0
11.2.3

as N.

Proof
Lemma 11.2.3

Let f:RC be 2π-periodic and twice continuously differentiable. Then

supx[0,2π]|f(x)SNf(x)|0
11.2.4

as N.

Proof
Proof of Lemma 11.1.2

11.3 The truncated Hilbert transform

Let Mn be the modulation operator acting on measurable 2π-periodic functions defined by

Mng(x)=g(x)einx.
11.3.1

Define the approximate Hilbert transform by

LNg=1Nn=0N1MnNSN+nMN+ng.
11.3.2

Lemma 11.3.1 modulated averaged projection
#

We have for every bounded measurable 2π-periodic function g

LNgL2[π,π]gL2[π,π].
11.3.3

Proof
Lemma 11.3.2 periodic domain shift

Let f be a bounded 2π-periodic function. We have for any 0x2π that

02πf(y)dy=x2πxf(y)dy=ππf(yx)dy.
11.3.6

Proof
Lemma 11.3.3 Young convolution
#

Let f and g be two bounded non-negative measurable 2π-periodic functions on R. Then

(ππ(ππf(y)g(xy)dy)2dx)12fL2[π,π]gL1[π,π].
11.3.9

Proof

For 0<r<1, Define the kernel kr to be the 2π-periodic function

kr(x):=min(r1,1+r|1eix|2),
11.3.11

where the minimum is understood to be r1 in case 1=eix.

Lemma 11.3.4 integrable bump convolution
#

Let g,f be bounded measurable 2π-periodic functions. Let 0<r<π. Assume we have for all 0x2π

|g(x)|kr(x).
11.3.12

Let

h(x)=ππf(y)g(xy)dy.
11.3.13

Then

hL2[π,π]25fL2[π,π].
11.3.14

Proof

Let 0<r<1. Let N be the smallest integer larger than 1r. There is a 2π-periodic continuous function L on R that satisfies for all πxπ and all 2π-periodic bounded measurable functions f on R

LNf(x)=12πππf(y)L(xy)dy
11.3.17

and

|L(x)1{y:r<|y|<1}κ(x)|25kr(x).
11.3.18

Proof

We now prove Lemma 11.1.6.

Proof of Lemma 11.1.6

11.4 The proof of the van der Corput Lemma

Proof of Lemma 11.1.7

11.5 Partial sums as orthogonal projections

This subsection proves Lemma 11.1.10

Proof of Lemma 11.1.10

11.6 The error bound

Lemma 11.6.1 Dirichlet kernel - Hilbert kernel relation
#

For all NZ and x[π,π]{0},

|KN(x)(eiNxκ(x)+eiNxκ(x))|π.
Proof
Lemma 11.6.2 partial Fourier sum bound
#

Let g:RC be a measurable 2π-periodic function such that for some δ>0 and every xR,

|g(x)|δ.
11.6.1

Then for every x[0,2π] and N>0,

|SNg(x)|12π(Tg(x)+Tg¯(x))+πδ.
Proof
Lemma 11.6.3 real Carleson operator measurable
#

Let f be a bounded measurable function on R. Then Tf as defined in 11.1.16 is measurable.

Proof
Lemma 11.6.4 partial Fourier sums of small

Let g:RC be a measurable 2π-periodic function such that for some δ>0 and every xR,

|g(x)|δ.
11.6.5

Then for every ϵ>0, there exists a measurable set E[0,2π] with |E|<ϵ such that for every x[0,2π]E and N>0,

|SNg(x)|Cϵδ,
11.6.6

where

Cϵ=(8πϵ)12C4,2+π.
11.6.7

Proof
Proof of Lemma 11.1.3

11.7 Carleson on the real line

We prove Lemma 11.1.5.

Consider the standard distance function

ρ(x,y)=|xy|
11.7.1

on the real line R.

Lemma 11.7.1 real line metric

The space (R,ρ) is a complete locally compact metric space.

Proof
Lemma 11.7.2 real line ball
#

For xR and R>0, the ball B(x,R) is the interval (xR,x+R)

Proof

We consider the Lebesgue measure μ on R.

Lemma 11.7.3 real line measure
#

The measure μ is a sigma-finite non-zero Radon-Borel measure on R.

Proof
Lemma 11.7.4 real line ball measure
#

We have for every xR and R>0

μ(B(x,R))=2R.
11.7.2

Proof
Lemma 11.7.5 real line doubling

We have for every xR and R>0

μ(B(x,2R))=2μ(B(x,R)).
11.7.4

Proof

The preceding four lemmas show that (R,ρ,μ,4) is a doubling metric measure space. Indeed, we even show that (R,ρ,μ,1) is a doubling metric measure space, but we may relax the estimate in Lemma 11.7.5 to conclude that (R,ρ,μ,4) is a doubling metric measure space.

For each nZ define ϑn:RR by

ϑn(x)=nx.
11.7.6

Let Θ be the collection {ϑn,nZ}. Note that for every nZ we have ϑn(0)=0. Define

dB(x,R)(ϑn,ϑm):=2R|nm|.
11.7.7

Lemma 11.7.6 frequency metric
#

For every R>0 and xX, the function dB(x,R) is a metric on Θ.

Proof
Lemma 11.7.7 oscillation control
#

For every R>0 and xX, and for all n,mZ, we have

supy,yB(x,R)|nynymy+my|2|nm|R.
11.7.8

Proof
Lemma 11.7.8 frequency monotone
#

For any x,xX and R,R>0 with B(x,R)B(x,R), and for any n,mZ

dB(x,R)(ϑn,ϑm)dB(x,R)(ϑn,ϑm).
Proof
Lemma 11.7.9 frequency ball doubling
#

For any x,xR and R>0 with xB(x,2R) and any n,mZ, we have

dB(x,2R)(ϑn,ϑm)2dB(x,R)(ϑn,ϑm).
11.7.9

Proof
Lemma 11.7.10 frequency ball growth
#

For any x,xR and R>0 with B(x,R)B(x,2R) and any n,mZ, we have

2dB(x,R)(ϑn,ϑm)dB(x,2R)(ϑn,ϑm).
11.7.10

Proof
Lemma 11.7.11 integer ball cover
#

For every xR and R>0 and every nZ and R>0, there exist m1,m2,m3Z such that

BB1B2B3,
11.7.11

where

B={ϑΘ:dB(x,R)(ϑ,ϑn)<2R}
11.7.12

and for j=1,2,3

Bj={ϑΘ:dB(x,R)(ϑ,ϑmj)<R}.
11.7.13

Proof
Lemma 11.7.12 real van der Corput
#

For any xR and R>0 and any function φ:XC supported on B=B(x,R) such that

φLip(B)=supxB|φ(x)|+Rsupx,yB,xy|φ(x)φ(y)|ρ(x,y)
11.7.17

is finite and for any n,mZ, we have

|Be(ϑn(x)ϑm(x))φ(x)dμ(x)|2πμ(B)φLip(B)1+dB(ϑn,ϑm).
11.7.18

Proof
Proof of Lemma 11.1.5