Operators related to the Laplacian with drift in Euclidean space - - PowerPoint PPT Presentation

operators related to the laplacian with drift in
SMART_READER_LITE
LIVE PREVIEW

Operators related to the Laplacian with drift in Euclidean space - - PowerPoint PPT Presentation

Operators related to the Laplacian with drift in Euclidean space Peter Sjgren University of Gothenburg Joint work with Hong-Quan Li (Shanghai) 1 / 23 In R n we consider the Laplacian with drift 2 n v = + 2 v


slide-1
SLIDE 1

Operators related to the Laplacian with drift in Euclidean space

Peter Sjögren University of Gothenburg Joint work with Hong-Quan Li (Shanghai)

1 / 23

slide-2
SLIDE 2

In Rn we consider the Laplacian with drift ∆v = ∆ + 2v · ∇ =

n

  • i=1

∂2 ∂x2

i

+ 2vi ∂ ∂xi

  • ,

where v = 0 is a fixed vector.

2 / 23

slide-3
SLIDE 3

In Rn we consider the Laplacian with drift ∆v = ∆ + 2v · ∇ =

n

  • i=1

∂2 ∂x2

i

+ 2vi ∂ ∂xi

  • ,

where v = 0 is a fixed vector. To make this operator self-adjoint in L2, we use the measure dµ(x) = e2v,xdx and L2(µ).

2 / 23

slide-4
SLIDE 4

In Rn we consider the Laplacian with drift ∆v = ∆ + 2v · ∇ =

n

  • i=1

∂2 ∂x2

i

+ 2vi ∂ ∂xi

  • ,

where v = 0 is a fixed vector. To make this operator self-adjoint in L2, we use the measure dµ(x) = e2v,xdx and L2(µ). With ∆v there are associated Riesz transforms

2 / 23

slide-5
SLIDE 5

In Rn we consider the Laplacian with drift ∆v = ∆ + 2v · ∇ =

n

  • i=1

∂2 ∂x2

i

+ 2vi ∂ ∂xi

  • ,

where v = 0 is a fixed vector. To make this operator self-adjoint in L2, we use the measure dµ(x) = e2v,xdx and L2(µ). With ∆v there are associated Riesz transforms and Littlewood-Paley-Stein functions for the corresponding heat and Poisson semigroups.

2 / 23

slide-6
SLIDE 6

In Rn we consider the Laplacian with drift ∆v = ∆ + 2v · ∇ =

n

  • i=1

∂2 ∂x2

i

+ 2vi ∂ ∂xi

  • ,

where v = 0 is a fixed vector. To make this operator self-adjoint in L2, we use the measure dµ(x) = e2v,xdx and L2(µ). With ∆v there are associated Riesz transforms and Littlewood-Paley-Stein functions for the corresponding heat and Poisson semigroups. We will study the Lp and in particular the weak type (1, 1) boundedness properties of these operators.

2 / 23

slide-7
SLIDE 7

In Rn we consider the Laplacian with drift ∆v = ∆ + 2v · ∇ =

n

  • i=1

∂2 ∂x2

i

+ 2vi ∂ ∂xi

  • ,

where v = 0 is a fixed vector. To make this operator self-adjoint in L2, we use the measure dµ(x) = e2v,xdx and L2(µ). With ∆v there are associated Riesz transforms and Littlewood-Paley-Stein functions for the corresponding heat and Poisson semigroups. We will study the Lp and in particular the weak type (1, 1) boundedness properties of these operators. Here we always refer to the measure µ.

2 / 23

slide-8
SLIDE 8

In Rn we consider the Laplacian with drift ∆v = ∆ + 2v · ∇ =

n

  • i=1

∂2 ∂x2

i

+ 2vi ∂ ∂xi

  • ,

where v = 0 is a fixed vector. To make this operator self-adjoint in L2, we use the measure dµ(x) = e2v,xdx and L2(µ). With ∆v there are associated Riesz transforms and Littlewood-Paley-Stein functions for the corresponding heat and Poisson semigroups. We will study the Lp and in particular the weak type (1, 1) boundedness properties of these operators. Here we always refer to the measure µ. Observe that µ has exponential volume growth, i.e., the measure of large balls increase exponentially with the radius.

2 / 23

slide-9
SLIDE 9

In Rn we consider the Laplacian with drift ∆v = ∆ + 2v · ∇ =

n

  • i=1

∂2 ∂x2

i

+ 2vi ∂ ∂xi

  • ,

where v = 0 is a fixed vector. To make this operator self-adjoint in L2, we use the measure dµ(x) = e2v,xdx and L2(µ). With ∆v there are associated Riesz transforms and Littlewood-Paley-Stein functions for the corresponding heat and Poisson semigroups. We will study the Lp and in particular the weak type (1, 1) boundedness properties of these operators. Here we always refer to the measure µ. Observe that µ has exponential volume growth, i.e., the measure of large balls increase exponentially with the radius. This makes standard singular integral techniques hard to apply.

2 / 23

slide-10
SLIDE 10

These operators have been studied in many other settings such as Lie groups and symmetric spaces

3 / 23

slide-11
SLIDE 11

These operators have been studied in many other settings such as Lie groups and symmetric spaces with measures of exponential growth.

3 / 23

slide-12
SLIDE 12

These operators have been studied in many other settings such as Lie groups and symmetric spaces with measures of exponential growth. The Lp boundedness can often be verified for 1 < p < ∞, but the weak type (1, 1) is not known in many such settings.

3 / 23

slide-13
SLIDE 13

These operators have been studied in many other settings such as Lie groups and symmetric spaces with measures of exponential growth. The Lp boundedness can often be verified for 1 < p < ∞, but the weak type (1, 1) is not known in many such settings. The existing results hint that the first- and second-order Riesz transforms are better than those of higher order.

3 / 23

slide-14
SLIDE 14

These operators have been studied in many other settings such as Lie groups and symmetric spaces with measures of exponential growth. The Lp boundedness can often be verified for 1 < p < ∞, but the weak type (1, 1) is not known in many such settings. The existing results hint that the first- and second-order Riesz transforms are better than those of higher order. For instance, in the Ornstein-Uhlenbeck setting in Rn with the Gaussian measure,

3 / 23

slide-15
SLIDE 15

These operators have been studied in many other settings such as Lie groups and symmetric spaces with measures of exponential growth. The Lp boundedness can often be verified for 1 < p < ∞, but the weak type (1, 1) is not known in many such settings. The existing results hint that the first- and second-order Riesz transforms are better than those of higher order. For instance, in the Ornstein-Uhlenbeck setting in Rn with the Gaussian measure, it is known that the weak type (1, 1) holds for the Riesz transforms of order 1 and 2 but not higher order.

3 / 23

slide-16
SLIDE 16

These operators have been studied in many other settings such as Lie groups and symmetric spaces with measures of exponential growth. The Lp boundedness can often be verified for 1 < p < ∞, but the weak type (1, 1) is not known in many such settings. The existing results hint that the first- and second-order Riesz transforms are better than those of higher order. For instance, in the Ornstein-Uhlenbeck setting in Rn with the Gaussian measure, it is known that the weak type (1, 1) holds for the Riesz transforms of order 1 and 2 but not higher order. The authors proved in 2016 for the hyperbolic ball and the Laplacian with a radial drift

3 / 23

slide-17
SLIDE 17

These operators have been studied in many other settings such as Lie groups and symmetric spaces with measures of exponential growth. The Lp boundedness can often be verified for 1 < p < ∞, but the weak type (1, 1) is not known in many such settings. The existing results hint that the first- and second-order Riesz transforms are better than those of higher order. For instance, in the Ornstein-Uhlenbeck setting in Rn with the Gaussian measure, it is known that the weak type (1, 1) holds for the Riesz transforms of order 1 and 2 but not higher order. The authors proved in 2016 for the hyperbolic ball and the Laplacian with a radial drift that the first- and second-order Riesz transforms are

  • f weak type (1, 1).

3 / 23

slide-18
SLIDE 18

Back to our setting, ∆v in Rn.

4 / 23

slide-19
SLIDE 19

Back to our setting, ∆v in Rn. In 2004, Lohoué and Mustapha showed that the Riesz transforms ∇k(−∆v)−k/2 of any order k ≥ 1 are bounded on Lp(µ), 1 < p < ∞.

4 / 23

slide-20
SLIDE 20

Back to our setting, ∆v in Rn. In 2004, Lohoué and Mustapha showed that the Riesz transforms ∇k(−∆v)−k/2 of any order k ≥ 1 are bounded on Lp(µ), 1 < p < ∞. The authors, together with Y.-R. Wu, proved in 2016 that the first-order transform ∇(−∆v)−1/2 is of weak type (1, 1).

4 / 23

slide-21
SLIDE 21

Back to our setting, ∆v in Rn. In 2004, Lohoué and Mustapha showed that the Riesz transforms ∇k(−∆v)−k/2 of any order k ≥ 1 are bounded on Lp(µ), 1 < p < ∞. The authors, together with Y.-R. Wu, proved in 2016 that the first-order transform ∇(−∆v)−1/2 is of weak type (1, 1). We will consider a slightly more general Riesz transform of order k ≥ 1.

4 / 23

slide-22
SLIDE 22

Back to our setting, ∆v in Rn. In 2004, Lohoué and Mustapha showed that the Riesz transforms ∇k(−∆v)−k/2 of any order k ≥ 1 are bounded on Lp(µ), 1 < p < ∞. The authors, together with Y.-R. Wu, proved in 2016 that the first-order transform ∇(−∆v)−1/2 is of weak type (1, 1). We will consider a slightly more general Riesz transform of order k ≥ 1. Let D =

  • |α|=k

aα∂α be a homogeneous differential operator with constant coefficients, not all 0.

4 / 23

slide-23
SLIDE 23

Back to our setting, ∆v in Rn. In 2004, Lohoué and Mustapha showed that the Riesz transforms ∇k(−∆v)−k/2 of any order k ≥ 1 are bounded on Lp(µ), 1 < p < ∞. The authors, together with Y.-R. Wu, proved in 2016 that the first-order transform ∇(−∆v)−1/2 is of weak type (1, 1). We will consider a slightly more general Riesz transform of order k ≥ 1. Let D =

  • |α|=k

aα∂α be a homogeneous differential operator with constant coefficients, not all 0. Then define the Riesz transform RD = D(−∆v)− k

2 . 4 / 23

slide-24
SLIDE 24

In D it turns out that it matters how many derivatives are taken in the v direction:

5 / 23

slide-25
SLIDE 25

In D it turns out that it matters how many derivatives are taken in the v direction: Let ∂v denote differentiation along the vector v.

5 / 23

slide-26
SLIDE 26

In D it turns out that it matters how many derivatives are taken in the v direction: Let ∂v denote differentiation along the vector v. Then write D as a sum D =

k

  • i=0

∂i

v D′ k−i,

5 / 23

slide-27
SLIDE 27

In D it turns out that it matters how many derivatives are taken in the v direction: Let ∂v denote differentiation along the vector v. Then write D as a sum D =

k

  • i=0

∂i

v D′ k−i,

where D′

k−i is of order k − i and involves only differentiation in

directions orthogonal to v.

5 / 23

slide-28
SLIDE 28

In D it turns out that it matters how many derivatives are taken in the v direction: Let ∂v denote differentiation along the vector v. Then write D as a sum D =

k

  • i=0

∂i

v D′ k−i,

where D′

k−i is of order k − i and involves only differentiation in

directions orthogonal to v. The maximal order of differentiation along v is then q = max {i : D′

k−i = 0}

and 0 ≤ q ≤ k.

5 / 23

slide-29
SLIDE 29

In D it turns out that it matters how many derivatives are taken in the v direction: Let ∂v denote differentiation along the vector v. Then write D as a sum D =

k

  • i=0

∂i

v D′ k−i,

where D′

k−i is of order k − i and involves only differentiation in

directions orthogonal to v. The maximal order of differentiation along v is then q = max {i : D′

k−i = 0}

and 0 ≤ q ≤ k. This quantity turns out to be significant.

5 / 23

slide-30
SLIDE 30

Our result says that order 2 is maximal for weak type (1, 1),

6 / 23

slide-31
SLIDE 31

Our result says that order 2 is maximal for weak type (1, 1), but counting only differentiations along v:

6 / 23

slide-32
SLIDE 32

Our result says that order 2 is maximal for weak type (1, 1), but counting only differentiations along v:

Theorem

The Riesz transform RD = D(−∆v)−k/2 is of weak type (1, 1) if and only if q ≤ 2.

6 / 23

slide-33
SLIDE 33

Our result says that order 2 is maximal for weak type (1, 1), but counting only differentiations along v:

Theorem

The Riesz transform RD = D(−∆v)−k/2 is of weak type (1, 1) if and only if q ≤ 2. When q ≥ 3, RD is bounded from the Orlicz space L(1 + ln+ L)

q 2 −1(µ) into L1,∞(µ), 6 / 23

slide-34
SLIDE 34

Our result says that order 2 is maximal for weak type (1, 1), but counting only differentiations along v:

Theorem

The Riesz transform RD = D(−∆v)−k/2 is of weak type (1, 1) if and only if q ≤ 2. When q ≥ 3, RD is bounded from the Orlicz space L(1 + ln+ L)

q 2 −1(µ) into L1,∞(µ), in the sense that

µ {x; |RDf(x)| > λ} ≤ C |f| λ

  • 1 + ln+ |f|

λ q

2 −1

dµ, λ > 0, with C = C(v, D).

6 / 23

slide-35
SLIDE 35

Our result says that order 2 is maximal for weak type (1, 1), but counting only differentiations along v:

Theorem

The Riesz transform RD = D(−∆v)−k/2 is of weak type (1, 1) if and only if q ≤ 2. When q ≥ 3, RD is bounded from the Orlicz space L(1 + ln+ L)

q 2 −1(µ) into L1,∞(µ), in the sense that

µ {x; |RDf(x)| > λ} ≤ C |f| λ

  • 1 + ln+ |f|

λ q

2 −1

dµ, λ > 0, with C = C(v, D). This inequality is sharp in the sense that q cannot be replaced by any smaller number.

6 / 23

slide-36
SLIDE 36

We pass to the Littlewood-Paley-Stein functions.

7 / 23

slide-37
SLIDE 37

We pass to the Littlewood-Paley-Stein functions. They are based on the heat semigroup (et∆v)t>0

7 / 23

slide-38
SLIDE 38

We pass to the Littlewood-Paley-Stein functions. They are based on the heat semigroup (et∆v)t>0 and the Poisson semigroup (e−t√−∆v)t>0.

7 / 23

slide-39
SLIDE 39

We pass to the Littlewood-Paley-Stein functions. They are based on the heat semigroup (et∆v)t>0 and the Poisson semigroup (e−t√−∆v)t>0. For the heat semigroup, the vertical Littlewood-Paley-Stein function of

  • rder k is usually defined as

Hk(f)(x) = +∞

  • t

k 2 ∇ket∆vf(x)

  • 2 dt

t 1

2

, where ∇k means all derivatives of order k in the x variable.

7 / 23

slide-40
SLIDE 40

We pass to the Littlewood-Paley-Stein functions. They are based on the heat semigroup (et∆v)t>0 and the Poisson semigroup (e−t√−∆v)t>0. For the heat semigroup, the vertical Littlewood-Paley-Stein function of

  • rder k is usually defined as

Hk(f)(x) = +∞

  • t

k 2 ∇ket∆vf(x)

  • 2 dt

t 1

2

, where ∇k means all derivatives of order k in the x variable. They are known to be bounded on Lp for 1 < p < ∞.

7 / 23

slide-41
SLIDE 41

We pass to the Littlewood-Paley-Stein functions. They are based on the heat semigroup (et∆v)t>0 and the Poisson semigroup (e−t√−∆v)t>0. For the heat semigroup, the vertical Littlewood-Paley-Stein function of

  • rder k is usually defined as

Hk(f)(x) = +∞

  • t

k 2 ∇ket∆vf(x)

  • 2 dt

t 1

2

, where ∇k means all derivatives of order k in the x variable. They are known to be bounded on Lp for 1 < p < ∞. But to write a precise weak type (1, 1) result, we use the k:th order

  • perator D

7 / 23

slide-42
SLIDE 42

We pass to the Littlewood-Paley-Stein functions. They are based on the heat semigroup (et∆v)t>0 and the Poisson semigroup (e−t√−∆v)t>0. For the heat semigroup, the vertical Littlewood-Paley-Stein function of

  • rder k is usually defined as

Hk(f)(x) = +∞

  • t

k 2 ∇ket∆vf(x)

  • 2 dt

t 1

2

, where ∇k means all derivatives of order k in the x variable. They are known to be bounded on Lp for 1 < p < ∞. But to write a precise weak type (1, 1) result, we use the k:th order

  • perator D and define

HD(f)(x) = +∞

  • t

k 2 D et∆vf(x)

  • 2 dt

t 1

2

.

7 / 23

slide-43
SLIDE 43

Again, the number q matters, to indicate the maximal order of differentiation along v:

8 / 23

slide-44
SLIDE 44

Again, the number q matters, to indicate the maximal order of differentiation along v:

Theorem

The operator HD is of weak type (1, 1) if and only if q ≤ 1.

8 / 23

slide-45
SLIDE 45

Again, the number q matters, to indicate the maximal order of differentiation along v:

Theorem

The operator HD is of weak type (1, 1) if and only if q ≤ 1. When q > 1, HD is bounded from L(1 + ln+ L)

q 2 − 3 4 (µ) into

L1,∞(µ),

8 / 23

slide-46
SLIDE 46

Again, the number q matters, to indicate the maximal order of differentiation along v:

Theorem

The operator HD is of weak type (1, 1) if and only if q ≤ 1. When q > 1, HD is bounded from L(1 + ln+ L)

q 2 − 3 4 (µ) into

L1,∞(µ), i.e., µ {x; HD(f)(x) > λ} ≤ C |f| λ

  • 1 + ln+ |f|

λ q

2 − 3 4

dµ, λ > 0, with C = C(v, D).

8 / 23

slide-47
SLIDE 47

Again, the number q matters, to indicate the maximal order of differentiation along v:

Theorem

The operator HD is of weak type (1, 1) if and only if q ≤ 1. When q > 1, HD is bounded from L(1 + ln+ L)

q 2 − 3 4 (µ) into

L1,∞(µ), i.e., µ {x; HD(f)(x) > λ} ≤ C |f| λ

  • 1 + ln+ |f|

λ q

2 − 3 4

dµ, λ > 0, with C = C(v, D). Here q cannot be replaced by any smaller number.

8 / 23

slide-48
SLIDE 48

Using instead the Poisson semigroup, we define the Littlewood-Paley-Stein function similarly,

9 / 23

slide-49
SLIDE 49

Using instead the Poisson semigroup, we define the Littlewood-Paley-Stein function similarly, by GD(f)(x) = +∞

  • t

k 2 D e−t√−∆v f(x)

  • 2 dt

t 1

2

.

9 / 23

slide-50
SLIDE 50

Using instead the Poisson semigroup, we define the Littlewood-Paley-Stein function similarly, by GD(f)(x) = +∞

  • t

k 2 D e−t√−∆v f(x)

  • 2 dt

t 1

2

. It behaves a bit better than HD,

9 / 23

slide-51
SLIDE 51

Using instead the Poisson semigroup, we define the Littlewood-Paley-Stein function similarly, by GD(f)(x) = +∞

  • t

k 2 D e−t√−∆v f(x)

  • 2 dt

t 1

2

. It behaves a bit better than HD, indeed

Theorem

The operator GD is of weak type (1, 1) if and only if q ≤ 2.

9 / 23

slide-52
SLIDE 52

Using instead the Poisson semigroup, we define the Littlewood-Paley-Stein function similarly, by GD(f)(x) = +∞

  • t

k 2 D e−t√−∆v f(x)

  • 2 dt

t 1

2

. It behaves a bit better than HD, indeed

Theorem

The operator GD is of weak type (1, 1) if and only if q ≤ 2. When q > 2, GD is bounded from L(1 + ln+ L)

q 2 −1(µ) into

L1,∞(µ),

9 / 23

slide-53
SLIDE 53

Using instead the Poisson semigroup, we define the Littlewood-Paley-Stein function similarly, by GD(f)(x) = +∞

  • t

k 2 D e−t√−∆v f(x)

  • 2 dt

t 1

2

. It behaves a bit better than HD, indeed

Theorem

The operator GD is of weak type (1, 1) if and only if q ≤ 2. When q > 2, GD is bounded from L(1 + ln+ L)

q 2 −1(µ) into

L1,∞(µ), Here q cannot be replaced by any smaller number.

9 / 23

slide-54
SLIDE 54

The horizontal Littlewood-Paley-Stein functions are, for the heat semigroup,

10 / 23

slide-55
SLIDE 55

The horizontal Littlewood-Paley-Stein functions are, for the heat semigroup, hk(f)(x) = +∞

  • tk ∂k

∂tk et∆vf(x)

  • 2 dt

t 1

2

, k ≥ 1

10 / 23

slide-56
SLIDE 56

The horizontal Littlewood-Paley-Stein functions are, for the heat semigroup, hk(f)(x) = +∞

  • tk ∂k

∂tk et∆vf(x)

  • 2 dt

t 1

2

, k ≥ 1 and also Hk(f)(x) = sup

t>0

  • tk ∂k

∂tk et∆vf(x)

  • ,

k ≥ 0.

10 / 23

slide-57
SLIDE 57

The horizontal Littlewood-Paley-Stein functions are, for the heat semigroup, hk(f)(x) = +∞

  • tk ∂k

∂tk et∆vf(x)

  • 2 dt

t 1

2

, k ≥ 1 and also Hk(f)(x) = sup

t>0

  • tk ∂k

∂tk et∆vf(x)

  • ,

k ≥ 0. They are known to be bounded on Lp, 1 < p < ∞, by general Littlewood-Paley-Stein theory.

10 / 23

slide-58
SLIDE 58

As for weak type (1, 1), hk behaves like HD,

11 / 23

slide-59
SLIDE 59

As for weak type (1, 1), hk behaves like HD, with k replacing q:

11 / 23

slide-60
SLIDE 60

As for weak type (1, 1), hk behaves like HD, with k replacing q:

Theorem

The operator hk is of weak type (1, 1) if and only if k ≤ 1.

11 / 23

slide-61
SLIDE 61

As for weak type (1, 1), hk behaves like HD, with k replacing q:

Theorem

The operator hk is of weak type (1, 1) if and only if k ≤ 1. When k > 1, hk is bounded from L(1 + ln+ L)

k 2 − 3 4 (µ) into

L1,∞(µ),

11 / 23

slide-62
SLIDE 62

As for weak type (1, 1), hk behaves like HD, with k replacing q:

Theorem

The operator hk is of weak type (1, 1) if and only if k ≤ 1. When k > 1, hk is bounded from L(1 + ln+ L)

k 2 − 3 4 (µ) into

L1,∞(µ), and this is optimal.

11 / 23

slide-63
SLIDE 63

As for weak type (1, 1), hk behaves like HD, with k replacing q:

Theorem

The operator hk is of weak type (1, 1) if and only if k ≤ 1. When k > 1, hk is bounded from L(1 + ln+ L)

k 2 − 3 4 (µ) into

L1,∞(µ), and this is optimal. The “maximal operator” Hk is a bit better:

11 / 23

slide-64
SLIDE 64

As for weak type (1, 1), hk behaves like HD, with k replacing q:

Theorem

The operator hk is of weak type (1, 1) if and only if k ≤ 1. When k > 1, hk is bounded from L(1 + ln+ L)

k 2 − 3 4 (µ) into

L1,∞(µ), and this is optimal. The “maximal operator” Hk is a bit better:

Theorem

The operator Hk is of weak type (1, 1) if and only if k ≤ 2.

11 / 23

slide-65
SLIDE 65

As for weak type (1, 1), hk behaves like HD, with k replacing q:

Theorem

The operator hk is of weak type (1, 1) if and only if k ≤ 1. When k > 1, hk is bounded from L(1 + ln+ L)

k 2 − 3 4 (µ) into

L1,∞(µ), and this is optimal. The “maximal operator” Hk is a bit better:

Theorem

The operator Hk is of weak type (1, 1) if and only if k ≤ 2. When k > 2, Hk is bounded from L(1 + ln+ L)

k 2 −1(µ) into

L1,∞(µ),

11 / 23

slide-66
SLIDE 66

As for weak type (1, 1), hk behaves like HD, with k replacing q:

Theorem

The operator hk is of weak type (1, 1) if and only if k ≤ 1. When k > 1, hk is bounded from L(1 + ln+ L)

k 2 − 3 4 (µ) into

L1,∞(µ), and this is optimal. The “maximal operator” Hk is a bit better:

Theorem

The operator Hk is of weak type (1, 1) if and only if k ≤ 2. When k > 2, Hk is bounded from L(1 + ln+ L)

k 2 −1(µ) into

L1,∞(µ), and this is optimal.

11 / 23

slide-67
SLIDE 67

As for weak type (1, 1), hk behaves like HD, with k replacing q:

Theorem

The operator hk is of weak type (1, 1) if and only if k ≤ 1. When k > 1, hk is bounded from L(1 + ln+ L)

k 2 − 3 4 (µ) into

L1,∞(µ), and this is optimal. The “maximal operator” Hk is a bit better:

Theorem

The operator Hk is of weak type (1, 1) if and only if k ≤ 2. When k > 2, Hk is bounded from L(1 + ln+ L)

k 2 −1(µ) into

L1,∞(µ), and this is optimal. The analogous operators defined with the Poisson semigroup are of weak type (1, 1) for all values of k.

11 / 23

slide-68
SLIDE 68

Sketches of proofs It is no restriction to assume that v = e1 = (1, . . . , 0),

12 / 23

slide-69
SLIDE 69

Sketches of proofs It is no restriction to assume that v = e1 = (1, . . . , 0), Then we write x = (x1, x′).

12 / 23

slide-70
SLIDE 70

Sketches of proofs It is no restriction to assume that v = e1 = (1, . . . , 0), Then we write x = (x1, x′). The kernels of the operators considered can be computed, via that of the heat semigroup et∆e1,

12 / 23

slide-71
SLIDE 71

Sketches of proofs It is no restriction to assume that v = e1 = (1, . . . , 0), Then we write x = (x1, x′). The kernels of the operators considered can be computed, via that of the heat semigroup et∆e1, which is pt(x, y) = (4πt)− n

2 e−x1−y1 e−t e− |x−y|2 4t

.

12 / 23

slide-72
SLIDE 72

Sketches of proofs It is no restriction to assume that v = e1 = (1, . . . , 0), Then we write x = (x1, x′). The kernels of the operators considered can be computed, via that of the heat semigroup et∆e1, which is pt(x, y) = (4πt)− n

2 e−x1−y1 e−t e− |x−y|2 4t

. For instance, the kernel of the Riesz transform RD = D(−∆e1)−k/2

12 / 23

slide-73
SLIDE 73

Sketches of proofs It is no restriction to assume that v = e1 = (1, . . . , 0), Then we write x = (x1, x′). The kernels of the operators considered can be computed, via that of the heat semigroup et∆e1, which is pt(x, y) = (4πt)− n

2 e−x1−y1 e−t e− |x−y|2 4t

. For instance, the kernel of the Riesz transform RD = D(−∆e1)−k/2 is RD(x, y) = 1 Γ(k/2) +∞ t

k 2 Dx pt(x, y) dt

t .

12 / 23

slide-74
SLIDE 74

Sketches of proofs It is no restriction to assume that v = e1 = (1, . . . , 0), Then we write x = (x1, x′). The kernels of the operators considered can be computed, via that of the heat semigroup et∆e1, which is pt(x, y) = (4πt)− n

2 e−x1−y1 e−t e− |x−y|2 4t

. For instance, the kernel of the Riesz transform RD = D(−∆e1)−k/2 is RD(x, y) = 1 Γ(k/2) +∞ t

k 2 Dx pt(x, y) dt

t . Locally, the kernels of all our operators define singular integrals of standard Calderón-Zygmund type,

12 / 23

slide-75
SLIDE 75

Sketches of proofs It is no restriction to assume that v = e1 = (1, . . . , 0), Then we write x = (x1, x′). The kernels of the operators considered can be computed, via that of the heat semigroup et∆e1, which is pt(x, y) = (4πt)− n

2 e−x1−y1 e−t e− |x−y|2 4t

. For instance, the kernel of the Riesz transform RD = D(−∆e1)−k/2 is RD(x, y) = 1 Γ(k/2) +∞ t

k 2 Dx pt(x, y) dt

t . Locally, the kernels of all our operators define singular integrals of standard Calderón-Zygmund type, vector-valued in the Littlewood-Paley-Stein cases.

12 / 23

slide-76
SLIDE 76

Sketches of proofs It is no restriction to assume that v = e1 = (1, . . . , 0), Then we write x = (x1, x′). The kernels of the operators considered can be computed, via that of the heat semigroup et∆e1, which is pt(x, y) = (4πt)− n

2 e−x1−y1 e−t e− |x−y|2 4t

. For instance, the kernel of the Riesz transform RD = D(−∆e1)−k/2 is RD(x, y) = 1 Γ(k/2) +∞ t

k 2 Dx pt(x, y) dt

t . Locally, the kernels of all our operators define singular integrals of standard Calderón-Zygmund type, vector-valued in the Littlewood-Paley-Stein cases. So these parts are of weak type (1, 1).

12 / 23

slide-77
SLIDE 77

For the parts at infinity, it turns out to be enough to consider the absolute values of the kernels.

13 / 23

slide-78
SLIDE 78

For the parts at infinity, it turns out to be enough to consider the absolute values of the kernels. In the Riesz case, one has the following sharp estimate.

13 / 23

slide-79
SLIDE 79

For the parts at infinity, it turns out to be enough to consider the absolute values of the kernels. In the Riesz case, one has the following sharp estimate.

Proposition

For |x − y| > 1 |RD(x, y)| e−x1−y1−|x−y| |x − y|

q−n−1 2

 1 + |x′ − y′|2 |x − y| k

2

  .

13 / 23

slide-80
SLIDE 80

For the parts at infinity, it turns out to be enough to consider the absolute values of the kernels. In the Riesz case, one has the following sharp estimate.

Proposition

For |x − y| > 1 |RD(x, y)| e−x1−y1−|x−y| |x − y|

q−n−1 2

 1 + |x′ − y′|2 |x − y| k

2

  . The kernels of the Littlewood-Paley-Stein functions satisfy similar estimates.

13 / 23

slide-81
SLIDE 81

For the parts at infinity, it turns out to be enough to consider the absolute values of the kernels. In the Riesz case, one has the following sharp estimate.

Proposition

For |x − y| > 1 |RD(x, y)| e−x1−y1−|x−y| |x − y|

q−n−1 2

 1 + |x′ − y′|2 |x − y| k

2

  . The kernels of the Littlewood-Paley-Stein functions satisfy similar estimates. From this proposition, it can be proved that RD is of weak type (1, 1)

13 / 23

slide-82
SLIDE 82

For the parts at infinity, it turns out to be enough to consider the absolute values of the kernels. In the Riesz case, one has the following sharp estimate.

Proposition

For |x − y| > 1 |RD(x, y)| e−x1−y1−|x−y| |x − y|

q−n−1 2

 1 + |x′ − y′|2 |x − y| k

2

  . The kernels of the Littlewood-Paley-Stein functions satisfy similar estimates. From this proposition, it can be proved that RD is of weak type (1, 1) for q = 1 and 2.

13 / 23

slide-83
SLIDE 83

For the parts at infinity, it turns out to be enough to consider the absolute values of the kernels. In the Riesz case, one has the following sharp estimate.

Proposition

For |x − y| > 1 |RD(x, y)| e−x1−y1−|x−y| |x − y|

q−n−1 2

 1 + |x′ − y′|2 |x − y| k

2

  . The kernels of the Littlewood-Paley-Stein functions satisfy similar estimates. From this proposition, it can be proved that RD is of weak type (1, 1) for q = 1 and 2. We will focus on the simpler case q = 1,

13 / 23

slide-84
SLIDE 84

For the parts at infinity, it turns out to be enough to consider the absolute values of the kernels. In the Riesz case, one has the following sharp estimate.

Proposition

For |x − y| > 1 |RD(x, y)| e−x1−y1−|x−y| |x − y|

q−n−1 2

 1 + |x′ − y′|2 |x − y| k

2

  . The kernels of the Littlewood-Paley-Stein functions satisfy similar estimates. From this proposition, it can be proved that RD is of weak type (1, 1) for q = 1 and 2. We will focus on the simpler case q = 1, which was solved in a paper by Li, Sjögren and Wu.

13 / 23

slide-85
SLIDE 85

It is enough to consider points with x1 − y1 > 1, since the opposite case is trivial.

14 / 23

slide-86
SLIDE 86

It is enough to consider points with x1 − y1 > 1, since the opposite case is trivial. Some manipulations of the expression in the proposition show that for q = 1

14 / 23

slide-87
SLIDE 87

It is enough to consider points with x1 − y1 > 1, since the opposite case is trivial. Some manipulations of the expression in the proposition show that for q = 1 |RD(x, y)| e−2x1(x1 − y1)− n

2 exp

 −1 4

|x′−y′|2 x1−y1

1 + |x′−y′|

√x1−y1

  χ{x1−y1>1} + trivial term.

14 / 23

slide-88
SLIDE 88

It is enough to consider points with x1 − y1 > 1, since the opposite case is trivial. Some manipulations of the expression in the proposition show that for q = 1 |RD(x, y)| e−2x1(x1 − y1)− n

2 exp

 −1 4

|x′−y′|2 x1−y1

1 + |x′−y′|

√x1−y1

  χ{x1−y1>1} + trivial term. Here the main part is given by the parabolic region |x′ − y′| < √x1 − y1.

14 / 23

slide-89
SLIDE 89

this is the y plane

x

15 / 23

slide-90
SLIDE 90

this is the y plane

x 2 j 2 j-1

16 / 23

slide-91
SLIDE 91

We split this into parts given by 2j−1 < x1 − y1 ≤ 2j for j = 1, . . . .

17 / 23

slide-92
SLIDE 92

We split this into parts given by 2j−1 < x1 − y1 ≤ 2j for j = 1, . . . . Then we get a sum of kernels e−2x1 2− j

2 2− (n−1)j 2

exp

  • −1

8 2−j |x′ − y′|2 1 + 2− j

2 |x′ − y′|

  • 17 / 23
slide-93
SLIDE 93

We split this into parts given by 2j−1 < x1 − y1 ≤ 2j for j = 1, . . . . Then we get a sum of kernels e−2x1 2− j

2 2− (n−1)j 2

exp

  • −1

8 2−j |x′ − y′|2 1 + 2− j

2 |x′ − y′|

  • = e−2x1 2− j

2 ψj(x′ − y′), 17 / 23

slide-94
SLIDE 94

We split this into parts given by 2j−1 < x1 − y1 ≤ 2j for j = 1, . . . . Then we get a sum of kernels e−2x1 2− j

2 2− (n−1)j 2

exp

  • −1

8 2−j |x′ − y′|2 1 + 2− j

2 |x′ − y′|

  • = e−2x1 2− j

2 ψj(x′ − y′),

where ψj is the normalized dilation of the function ψ(z′) = exp

  • −1

8 |z′|2 1 + |z′|

  • ,

z′ ∈ Rn−1, by a factor 2j/2.

17 / 23

slide-95
SLIDE 95

We split this into parts given by 2j−1 < x1 − y1 ≤ 2j for j = 1, . . . . Then we get a sum of kernels e−2x1 2− j

2 2− (n−1)j 2

exp

  • −1

8 2−j |x′ − y′|2 1 + 2− j

2 |x′ − y′|

  • = e−2x1 2− j

2 ψj(x′ − y′),

where ψj is the normalized dilation of the function ψ(z′) = exp

  • −1

8 |z′|2 1 + |z′|

  • ,

z′ ∈ Rn−1, by a factor 2j/2. Clearly, ψ ∈ L1(Rn−1).

17 / 23

slide-96
SLIDE 96

Putting things together, we see that RD is controlled by the sum over j = 1, 2, . . .

  • f the operators

18 / 23

slide-97
SLIDE 97

Putting things together, we see that RD is controlled by the sum over j = 1, 2, . . .

  • f the operators

Tjf(x) = e−2x1 2− j

2

  • Rn−1 ψj(x′ − y′)
  • R

|f(y1, y′)| e2y1 dy1 dy′

18 / 23

slide-98
SLIDE 98

Putting things together, we see that RD is controlled by the sum over j = 1, 2, . . .

  • f the operators

Tjf(x) = e−2x1 2− j

2

  • Rn−1 ψj(x′ − y′)
  • R

|f(y1, y′)| e2y1 dy1 dy′ = e−2x1 2− j

2 ψj ∗ F(x′), 18 / 23

slide-99
SLIDE 99

Putting things together, we see that RD is controlled by the sum over j = 1, 2, . . .

  • f the operators

Tjf(x) = e−2x1 2− j

2

  • Rn−1 ψj(x′ − y′)
  • R

|f(y1, y′)| e2y1 dy1 dy′ = e−2x1 2− j

2 ψj ∗ F(x′),

where the convolution is taken in Rn−1

18 / 23

slide-100
SLIDE 100

Putting things together, we see that RD is controlled by the sum over j = 1, 2, . . .

  • f the operators

Tjf(x) = e−2x1 2− j

2

  • Rn−1 ψj(x′ − y′)
  • R

|f(y1, y′)| e2y1 dy1 dy′ = e−2x1 2− j

2 ψj ∗ F(x′),

where the convolution is taken in Rn−1 and F(y′) =

  • R

|f(y1, y′)| e2y1 dy1, y′ ∈ Rn−1.

18 / 23

slide-101
SLIDE 101

Putting things together, we see that RD is controlled by the sum over j = 1, 2, . . .

  • f the operators

Tjf(x) = e−2x1 2− j

2

  • Rn−1 ψj(x′ − y′)
  • R

|f(y1, y′)| e2y1 dy1 dy′ = e−2x1 2− j

2 ψj ∗ F(x′),

where the convolution is taken in Rn−1 and F(y′) =

  • R

|f(y1, y′)| e2y1 dy1, y′ ∈ Rn−1. Notice that FL1(Rn−1) = fL1(Rn,dµ).

18 / 23

slide-102
SLIDE 102

This allows us to estimate the level set of Tjf:

19 / 23

slide-103
SLIDE 103

This allows us to estimate the level set of Tjf: µ

  • x ∈ Rn : |Tjf(x)| > λ
  • ≤ µ
  • (x1, x′) : 2− j

2 e−2x1 ψj ∗ F(x′) > λ

  • 19 / 23
slide-104
SLIDE 104

This allows us to estimate the level set of Tjf: µ

  • x ∈ Rn : |Tjf(x)| > λ
  • ≤ µ
  • (x1, x′) : 2− j

2 e−2x1 ψj ∗ F(x′) > λ

  • =

−∞

e2x1 mn−1

  • x′ ∈ Rn−1 : ψj ∗ F(x′) > 2

j 2 λ e2x1

  • dx1.

19 / 23

slide-105
SLIDE 105

This allows us to estimate the level set of Tjf: µ

  • x ∈ Rn : |Tjf(x)| > λ
  • ≤ µ
  • (x1, x′) : 2− j

2 e−2x1 ψj ∗ F(x′) > λ

  • =

−∞

e2x1 mn−1

  • x′ ∈ Rn−1 : ψj ∗ F(x′) > 2

j 2 λ e2x1

  • dx1.

The change of variable s = 2

j 2 λ e2x1 shows that this equals 19 / 23

slide-106
SLIDE 106

This allows us to estimate the level set of Tjf: µ

  • x ∈ Rn : |Tjf(x)| > λ
  • ≤ µ
  • (x1, x′) : 2− j

2 e−2x1 ψj ∗ F(x′) > λ

  • =

−∞

e2x1 mn−1

  • x′ ∈ Rn−1 : ψj ∗ F(x′) > 2

j 2 λ e2x1

  • dx1.

The change of variable s = 2

j 2 λ e2x1 shows that this equals

2−j/2 λ ∞ mn−1{x′ : ψj ∗ F(x′) > s} ds

19 / 23

slide-107
SLIDE 107

This allows us to estimate the level set of Tjf: µ

  • x ∈ Rn : |Tjf(x)| > λ
  • ≤ µ
  • (x1, x′) : 2− j

2 e−2x1 ψj ∗ F(x′) > λ

  • =

−∞

e2x1 mn−1

  • x′ ∈ Rn−1 : ψj ∗ F(x′) > 2

j 2 λ e2x1

  • dx1.

The change of variable s = 2

j 2 λ e2x1 shows that this equals

2−j/2 λ ∞ mn−1{x′ : ψj ∗ F(x′) > s} ds = 2−j/2 λ ψj ∗ FL1(Rn−1)

19 / 23

slide-108
SLIDE 108

This allows us to estimate the level set of Tjf: µ

  • x ∈ Rn : |Tjf(x)| > λ
  • ≤ µ
  • (x1, x′) : 2− j

2 e−2x1 ψj ∗ F(x′) > λ

  • =

−∞

e2x1 mn−1

  • x′ ∈ Rn−1 : ψj ∗ F(x′) > 2

j 2 λ e2x1

  • dx1.

The change of variable s = 2

j 2 λ e2x1 shows that this equals

2−j/2 λ ∞ mn−1{x′ : ψj ∗ F(x′) > s} ds = 2−j/2 λ ψj ∗ FL1(Rn−1) ≤ 2−j/2 λ ψjL1(Rn−1) FL1(Rn−1) = 2−j/2 λ ψL1(Rn−1) fL1(Rn,dµ).

19 / 23

slide-109
SLIDE 109

This allows us to estimate the level set of Tjf: µ

  • x ∈ Rn : |Tjf(x)| > λ
  • ≤ µ
  • (x1, x′) : 2− j

2 e−2x1 ψj ∗ F(x′) > λ

  • =

−∞

e2x1 mn−1

  • x′ ∈ Rn−1 : ψj ∗ F(x′) > 2

j 2 λ e2x1

  • dx1.

The change of variable s = 2

j 2 λ e2x1 shows that this equals

2−j/2 λ ∞ mn−1{x′ : ψj ∗ F(x′) > s} ds = 2−j/2 λ ψj ∗ FL1(Rn−1) ≤ 2−j/2 λ ψjL1(Rn−1) FL1(Rn−1) = 2−j/2 λ ψL1(Rn−1) fL1(Rn,dµ). By summing in j, we get the weak type (1,1) of RD, for q = 1.

  • 19 / 23
slide-110
SLIDE 110

Some hints for the case q = 2

20 / 23

slide-111
SLIDE 111

Some hints for the case q = 2 We now have the kernel e−2x1(x1 − y1)

1−n 2 exp

 −1 4

|x′−y′|2 x1−y1

1 + |x′−y′|

√x1−y1

  χ{x1−y1>1},

20 / 23

slide-112
SLIDE 112

Some hints for the case q = 2 We now have the kernel e−2x1(x1 − y1)

1−n 2 exp

 −1 4

|x′−y′|2 x1−y1

1 + |x′−y′|

√x1−y1

  χ{x1−y1>1}, where the exponent of x1 − y1 is worse than before.

20 / 23

slide-113
SLIDE 113

Some hints for the case q = 2 We now have the kernel e−2x1(x1 − y1)

1−n 2 exp

 −1 4

|x′−y′|2 x1−y1

1 + |x′−y′|

√x1−y1

  χ{x1−y1>1}, where the exponent of x1 − y1 is worse than before. With a dyadic splitting, one shows that it is enough to consider the parabolic region |x′ − y′| < √x1 − y1.

20 / 23

slide-114
SLIDE 114

Some hints for the case q = 2 We now have the kernel e−2x1(x1 − y1)

1−n 2 exp

 −1 4

|x′−y′|2 x1−y1

1 + |x′−y′|

√x1−y1

  χ{x1−y1>1}, where the exponent of x1 − y1 is worse than before. With a dyadic splitting, one shows that it is enough to consider the parabolic region |x′ − y′| < √x1 − y1. Writing g(y) = e2y1 f(y) ∈ L1(dy),

20 / 23

slide-115
SLIDE 115

Some hints for the case q = 2 We now have the kernel e−2x1(x1 − y1)

1−n 2 exp

 −1 4

|x′−y′|2 x1−y1

1 + |x′−y′|

√x1−y1

  χ{x1−y1>1}, where the exponent of x1 − y1 is worse than before. With a dyadic splitting, one shows that it is enough to consider the parabolic region |x′ − y′| < √x1 − y1. Writing g(y) = e2y1 f(y) ∈ L1(dy), we get the operator Sg(x) = e−2x1

  • y1<x1−1

(x1 − y1)

1−n 2

  • |x′−y′|<√x1−y1

g(y1, y′) dy′ dy1.

20 / 23

slide-116
SLIDE 116

Some hints for the case q = 2 We now have the kernel e−2x1(x1 − y1)

1−n 2 exp

 −1 4

|x′−y′|2 x1−y1

1 + |x′−y′|

√x1−y1

  χ{x1−y1>1}, where the exponent of x1 − y1 is worse than before. With a dyadic splitting, one shows that it is enough to consider the parabolic region |x′ − y′| < √x1 − y1. Writing g(y) = e2y1 f(y) ∈ L1(dy), we get the operator Sg(x) = e−2x1

  • y1<x1−1

(x1 − y1)

1−n 2

  • |x′−y′|<√x1−y1

g(y1, y′) dy′ dy1. It must be proved that S is bounded from L1(dy) into L1(µ).

20 / 23

slide-117
SLIDE 117

x

21 / 23

slide-118
SLIDE 118

x

22 / 23

slide-119
SLIDE 119

THE END THANK YOU

23 / 23