On Hardys and Caffarelli, Kohn, Nirenbergs inequalites. S eminaire - - PowerPoint PPT Presentation

on hardy s and caffarelli kohn nirenberg s inequalites
SMART_READER_LITE
LIVE PREVIEW

On Hardys and Caffarelli, Kohn, Nirenbergs inequalites. S eminaire - - PowerPoint PPT Presentation

On Hardys and Caffarelli, Kohn, Nirenbergs inequalites. S eminaire EDP-Analyse de lInstitut Camille Jordan, Lyon, April 2019 Hoai-Minh Nguyen Ecole Polytechnique F ed erale de Lausanne EPFL, Switzerland joint with Marco


slide-1
SLIDE 1

On Hardy’s and Caffarelli, Kohn, Nirenberg’s inequalites.

S´ eminaire EDP-Analyse de l’Institut Camille Jordan, Lyon, April 2019

Hoai-Minh Nguyen

´ Ecole Polytechnique F´ ed´ erale de Lausanne EPFL, Switzerland joint with Marco Squassina

slide-2
SLIDE 2

Outline

1 Known results related to Hardy’s and Caffarelli, Kohn,

Nirenberg’s (CKN’s) inequalities

2 CKN’s inequalities for fractional Sobolev spaces 3 New perspectives of Hardy’s and CKN’s inequalities in

Sobolev spaces.

slide-3
SLIDE 3

Section 1: Known results related to Hardy’s and CKN’s inequalities

slide-4
SLIDE 4

Hardy’s inequalities

1 For 1 p < d,

ˆ

Rd

|u|p |x|p dx C

ˆ

Rd |∇u|p dx

∀ u ∈ C1

c(Rd). 2 For p > d,

ˆ

Rd

|u|p |x|p dx C

ˆ

Rd |∇u|p dx

∀ u ∈ C1

c(Rd \ {0}). 3 For p = d > 1, ....

Standard proof is based on integration by parts.

slide-5
SLIDE 5

Hardy’s inequalities

1 For 1 p < d,

ˆ

Rd

|u|p |x|p dx C

ˆ

Rd |∇u|p dx

∀ u ∈ C1

c(Rd). 2 For p > d,

ˆ

Rd

|u|p |x|p dx C

ˆ

Rd |∇u|p dx

∀ u ∈ C1

c(Rd \ {0}). 3 For p = d > 1, ....

Standard proof is based on integration by parts.

slide-6
SLIDE 6

Hardy’s inequalities

1 For 1 p < d,

ˆ

Rd

|u|p |x|p dx C

ˆ

Rd |∇u|p dx

∀ u ∈ C1

c(Rd). 2 For p > d,

ˆ

Rd

|u|p |x|p dx C

ˆ

Rd |∇u|p dx

∀ u ∈ C1

c(Rd \ {0}). 3 For p = d > 1, ....

Standard proof is based on integration by parts.

slide-7
SLIDE 7

Hardy’s inequalities

1 For 1 p < d,

ˆ

Rd

|u|p |x|p dx C

ˆ

Rd |∇u|p dx

∀ u ∈ C1

c(Rd). 2 For p > d,

ˆ

Rd

|u|p |x|p dx C

ˆ

Rd |∇u|p dx

∀ u ∈ C1

c(Rd \ {0}). 3 For p = d > 1, ....

Standard proof is based on integration by parts.

slide-8
SLIDE 8

Caffarelli, Kohn, Nirenberg’s inequalities, CM 84

Let p 1, q 1, τ > 0, 0 < a 1, α, β, γ ∈ R. One has

|x|γuLτ(Rd) C|x|α∇ua

Lp(Rd)|x|βu(1−a) Lq(Rd)

∀ u ∈ C1

c(Rd)

under the following conditions 1

τ + γ d = a 1 p + α − 1 d

  • + (1 − a)

1 q + β d

  • ,

with γ = aσ + (1 − a)β, 0 α − σ and

  • α − σ 1

if 1

τ + γ d = 1 p + α − 1 d

  • ,

and 1

τ + γ d,

1

p + α d,

1

q + β d > 0.

slide-9
SLIDE 9

Comments on the CKN inequality

  • This inequality is related to Gagliardo-Nirenberg’s inequality

when α = β = γ = 0, Gagliardo RM 59, Nirenberg ASNSP 59.

  • A full story of Gagliardo-Nirenberg’s inequality for fractional

Sobolev spaces is due to Brezis and Mironescu AIHP 18.

  • The proof of CKN’s inequality is based on

Integration by parts and symmetrization in the case 0 α − σ 1. Interpolation & the application of the previous case when

α − σ > 1 and 1

τ + γ d = 1 p + α−1 d

  • CKN’s inequality generalizes Hardy’s inequality when 1 < p < d.
slide-10
SLIDE 10

Comments on the CKN inequality

  • This inequality is related to Gagliardo-Nirenberg’s inequality

when α = β = γ = 0, Gagliardo RM 59, Nirenberg ASNSP 59.

  • A full story of Gagliardo-Nirenberg’s inequality for fractional

Sobolev spaces is due to Brezis and Mironescu AIHP 18.

  • The proof of CKN’s inequality is based on

Integration by parts and symmetrization in the case 0 α − σ 1. Interpolation & the application of the previous case when

α − σ > 1 and 1

τ + γ d = 1 p + α−1 d

  • CKN’s inequality generalizes Hardy’s inequality when 1 < p < d.
slide-11
SLIDE 11

Comments on the CKN inequality

  • This inequality is related to Gagliardo-Nirenberg’s inequality

when α = β = γ = 0, Gagliardo RM 59, Nirenberg ASNSP 59.

  • A full story of Gagliardo-Nirenberg’s inequality for fractional

Sobolev spaces is due to Brezis and Mironescu AIHP 18.

  • The proof of CKN’s inequality is based on

Integration by parts and symmetrization in the case 0 α − σ 1. Interpolation & the application of the previous case when

α − σ > 1 and 1

τ + γ d = 1 p + α−1 d

  • CKN’s inequality generalizes Hardy’s inequality when 1 < p < d.
slide-12
SLIDE 12

Comments on the CKN inequality

  • This inequality is related to Gagliardo-Nirenberg’s inequality

when α = β = γ = 0, Gagliardo RM 59, Nirenberg ASNSP 59.

  • A full story of Gagliardo-Nirenberg’s inequality for fractional

Sobolev spaces is due to Brezis and Mironescu AIHP 18.

  • The proof of CKN’s inequality is based on

Integration by parts and symmetrization in the case 0 α − σ 1. Interpolation & the application of the previous case when

α − σ > 1 and 1

τ + γ d = 1 p + α−1 d

  • CKN’s inequality generalizes Hardy’s inequality when 1 < p < d.
slide-13
SLIDE 13

Comments on the CKN inequality

  • This inequality is related to Gagliardo-Nirenberg’s inequality

when α = β = γ = 0, Gagliardo RM 59, Nirenberg ASNSP 59.

  • A full story of Gagliardo-Nirenberg’s inequality for fractional

Sobolev spaces is due to Brezis and Mironescu AIHP 18.

  • The proof of CKN’s inequality is based on

Integration by parts and symmetrization in the case 0 α − σ 1. Interpolation & the application of the previous case when

α − σ > 1 and 1

τ + γ d = 1 p + α−1 d

  • CKN’s inequality generalizes Hardy’s inequality when 1 < p < d.
slide-14
SLIDE 14

Comments on the CKN inequality

  • This inequality is related to Gagliardo-Nirenberg’s inequality

when α = β = γ = 0, Gagliardo RM 59, Nirenberg ASNSP 59.

  • A full story of Gagliardo-Nirenberg’s inequality for fractional

Sobolev spaces is due to Brezis and Mironescu AIHP 18.

  • The proof of CKN’s inequality is based on

Integration by parts and symmetrization in the case 0 α − σ 1. Interpolation & the application of the previous case when

α − σ > 1 and 1

τ + γ d = 1 p + α−1 d

  • CKN’s inequality generalizes Hardy’s inequality when 1 < p < d.
slide-15
SLIDE 15

Section 2: CKN’s inequality for fractional Sobolev spaces

slide-16
SLIDE 16

CKN’s inequality for fractional Sobolev spaces

  • Goals: extending CKN’s inequality for fractional Sobolev spaces

and searching for variants of Hardy’s inequality when p > d. Recall

|u|p

Ws,p :=

ˆ

Rd

ˆ

Rd

|u(x) − u(y)|p |x − y|d+sp dx dy for u ∈ Lp(Rd).

  • Known results: (Hardy’s type-inequalities):

Mazya & Shaposhnikova JFA 02 (harmonic analysis, extension technique), Frank & Seiringer JFA 08 (ground state representation formula): a = 1, τ = p, α = 0 and γ = −s. Abdellaoui & Bentifour JFA 17 (Picone’s inequality): a = 1,

τ = pd/(d − sp), −(d − sp)/p < α = γ < 0, and 1 < p < d/s.

Sharp constant and the remainder are considered by Frank & Seiringer and Abdellaoui & Bentifour.

  • Notation:

|u|p

Ws,p,α(Rd) =

ˆ

Rd

ˆ

Rd

|x|

αp 2 |y| αp 2 |u(x) − u(y)|p

|x − y|d+sp dx dy.

slide-17
SLIDE 17

CKN’s inequality for fractional Sobolev spaces

  • Goals: extending CKN’s inequality for fractional Sobolev spaces

and searching for variants of Hardy’s inequality when p > d. Recall

|u|p

Ws,p :=

ˆ

Rd

ˆ

Rd

|u(x) − u(y)|p |x − y|d+sp dx dy for u ∈ Lp(Rd).

  • Known results: (Hardy’s type-inequalities):

Mazya & Shaposhnikova JFA 02 (harmonic analysis, extension technique), Frank & Seiringer JFA 08 (ground state representation formula): a = 1, τ = p, α = 0 and γ = −s. Abdellaoui & Bentifour JFA 17 (Picone’s inequality): a = 1,

τ = pd/(d − sp), −(d − sp)/p < α = γ < 0, and 1 < p < d/s.

Sharp constant and the remainder are considered by Frank & Seiringer and Abdellaoui & Bentifour.

  • Notation:

|u|p

Ws,p,α(Rd) =

ˆ

Rd

ˆ

Rd

|x|

αp 2 |y| αp 2 |u(x) − u(y)|p

|x − y|d+sp dx dy.

slide-18
SLIDE 18

CKN’s inequality for fractional Sobolev spaces

  • Goals: extending CKN’s inequality for fractional Sobolev spaces

and searching for variants of Hardy’s inequality when p > d. Recall

|u|p

Ws,p :=

ˆ

Rd

ˆ

Rd

|u(x) − u(y)|p |x − y|d+sp dx dy for u ∈ Lp(Rd).

  • Known results: (Hardy’s type-inequalities):

Mazya & Shaposhnikova JFA 02 (harmonic analysis, extension technique), Frank & Seiringer JFA 08 (ground state representation formula): a = 1, τ = p, α = 0 and γ = −s. Abdellaoui & Bentifour JFA 17 (Picone’s inequality): a = 1,

τ = pd/(d − sp), −(d − sp)/p < α = γ < 0, and 1 < p < d/s.

Sharp constant and the remainder are considered by Frank & Seiringer and Abdellaoui & Bentifour.

  • Notation:

|u|p

Ws,p,α(Rd) =

ˆ

Rd

ˆ

Rd

|x|

αp 2 |y| αp 2 |u(x) − u(y)|p

|x − y|d+sp dx dy.

slide-19
SLIDE 19

CKN’s inequality for fractional Sobolev spaces

  • Goals: extending CKN’s inequality for fractional Sobolev spaces

and searching for variants of Hardy’s inequality when p > d. Recall

|u|p

Ws,p :=

ˆ

Rd

ˆ

Rd

|u(x) − u(y)|p |x − y|d+sp dx dy for u ∈ Lp(Rd).

  • Known results: (Hardy’s type-inequalities):

Mazya & Shaposhnikova JFA 02 (harmonic analysis, extension technique), Frank & Seiringer JFA 08 (ground state representation formula): a = 1, τ = p, α = 0 and γ = −s. Abdellaoui & Bentifour JFA 17 (Picone’s inequality): a = 1,

τ = pd/(d − sp), −(d − sp)/p < α = γ < 0, and 1 < p < d/s.

Sharp constant and the remainder are considered by Frank & Seiringer and Abdellaoui & Bentifour.

  • Notation:

|u|p

Ws,p,α(Rd) =

ˆ

Rd

ˆ

Rd

|x|

αp 2 |y| αp 2 |u(x) − u(y)|p

|x − y|d+sp dx dy.

slide-20
SLIDE 20

CKN’s inequality for fractional Sobolev spaces

  • Goals: extending CKN’s inequality for fractional Sobolev spaces

and searching for variants of Hardy’s inequality when p > d. Recall

|u|p

Ws,p :=

ˆ

Rd

ˆ

Rd

|u(x) − u(y)|p |x − y|d+sp dx dy for u ∈ Lp(Rd).

  • Known results: (Hardy’s type-inequalities):

Mazya & Shaposhnikova JFA 02 (harmonic analysis, extension technique), Frank & Seiringer JFA 08 (ground state representation formula): a = 1, τ = p, α = 0 and γ = −s. Abdellaoui & Bentifour JFA 17 (Picone’s inequality): a = 1,

τ = pd/(d − sp), −(d − sp)/p < α = γ < 0, and 1 < p < d/s.

Sharp constant and the remainder are considered by Frank & Seiringer and Abdellaoui & Bentifour.

  • Notation:

|u|p

Ws,p,α(Rd) =

ˆ

Rd

ˆ

Rd

|x|

αp 2 |y| αp 2 |u(x) − u(y)|p

|x − y|d+sp dx dy.

slide-21
SLIDE 21

Statement of the results

Let p > 1, q 1, τ > 0, 0 < s < 1, 0 < a 1, α, β, γ ∈ R be s.t. 1

τ + γ d = a 1 p + α − s d

  • + (1 − a)

1 q + β d

  • ,

(2.1) and, with γ = aσ + (1 − a)β, 0 α − σ and

  • α − σ s if 1

τ + γ d = 1 p + α − s d

  • .

(2.2) Theorem (Ng. & Squassina JFA 17) Assume (2.1) and (2.2). If 1/τ + γ/d > 0 then

|x|γuLτ(Rd) C|u|a

Ws,p,α(Rd)|x|βu(1−a) Lq(Rd)

∀ u ∈ C1

c(Rd),

and if 1/τ + γ/d < 0 then

|x|γuLτ(Rd) C|u|a

Ws,p,α(Rd)|x|βu(1−a) Lq(Rd)

∀ u ∈ C1

c(Rd \ {0}).

slide-22
SLIDE 22

Statement of the results

Let p > 1, q 1, τ > 0, 0 < s < 1, 0 < a 1, α, β, γ ∈ R be s.t. 1

τ + γ d = a 1 p + α − s d

  • + (1 − a)

1 q + β d

  • ,

(2.1) and, with γ = aσ + (1 − a)β, 0 α − σ and

  • α − σ s if 1

τ + γ d = 1 p + α − s d

  • .

(2.2) Theorem (Ng. & Squassina JFA 17) Assume (2.1) and (2.2). If 1/τ + γ/d > 0 then

|x|γuLτ(Rd) C|u|a

Ws,p,α(Rd)|x|βu(1−a) Lq(Rd)

∀ u ∈ C1

c(Rd),

and if 1/τ + γ/d < 0 then

|x|γuLτ(Rd) C|u|a

Ws,p,α(Rd)|x|βu(1−a) Lq(Rd)

∀ u ∈ C1

c(Rd \ {0}).

slide-23
SLIDE 23

Statement of the results

Let p > 1, q 1, τ > 0, 0 < s < 1, 0 < a 1, α, β, γ ∈ R be s.t. 1

τ + γ d = a 1 p + α − s d

  • + (1 − a)

1 q + β d

  • ,

(2.1) and, with γ = aσ + (1 − a)β, 0 α − σ and

  • α − σ s if 1

τ + γ d = 1 p + α − s d

  • .

(2.2) Theorem (Ng. & Squassina JFA 17) Assume (2.1) and (2.2). If 1/τ + γ/d > 0 then

|x|γuLτ(Rd) C|u|a

Ws,p,α(Rd)|x|βu(1−a) Lq(Rd)

∀ u ∈ C1

c(Rd),

and if 1/τ + γ/d < 0 then

|x|γuLτ(Rd) C|u|a

Ws,p,α(Rd)|x|βu(1−a) Lq(Rd)

∀ u ∈ C1

c(Rd \ {0}).

slide-24
SLIDE 24

Statement of the results

Let p > 1, q 1, τ > 0, 0 < s < 1, 0 < a 1, α, β, γ ∈ R be s.t. 1

τ + γ d = a 1 p + α − s d

  • + (1 − a)

1 q + β d

  • ,

(2.1) and, with γ = aσ + (1 − a)β, 0 α − σ and

  • α − σ s if 1

τ + γ d = 1 p + α − s d

  • .

(2.2) Theorem (Ng. & Squassina JFA 17) Assume (2.1) and (2.2). If 1/τ + γ/d > 0 then

|x|γuLτ(Rd) C|u|a

Ws,p,α(Rd)|x|βu(1−a) Lq(Rd)

∀ u ∈ C1

c(Rd),

and if 1/τ + γ/d < 0 then

|x|γuLτ(Rd) C|u|a

Ws,p,α(Rd)|x|βu(1−a) Lq(Rd)

∀ u ∈ C1

c(Rd \ {0}).

slide-25
SLIDE 25

Statement of the results

Let p > 1, q 1, τ > 0, 0 < s < 1, 0 < a 1, α, β, γ ∈ R be s.t. 1

τ + γ d = a 1 p + α − s d

  • + (1 − a)

1 q + β d

  • ,

(2.1) and, with γ = aσ + (1 − a)β, 0 α − σ and

  • α − σ s if 1

τ + γ d = 1 p + α − s d

  • .

(2.2) Theorem (Ng. & Squassina JFA 17) Assume (2.1) and (2.2). If 1/τ + γ/d > 0 then

|x|γuLτ(Rd) C|u|a

Ws,p,α(Rd)|x|βu(1−a) Lq(Rd)

∀ u ∈ C1

c(Rd),

and if 1/τ + γ/d < 0 then

|x|γuLτ(Rd) C|u|a

Ws,p,α(Rd)|x|βu(1−a) Lq(Rd)

∀ u ∈ C1

c(Rd \ {0}).

slide-26
SLIDE 26

Statement of the results

Let p > 1, q 1, τ > 0, 0 < s < 1, 0 < a 1, α, β, γ ∈ R be s.t. 1

τ + γ d = a 1 p + α − s d

  • + (1 − a)

1 q + β d

  • ,

(2.1) and, with γ = aσ + (1 − a)β, 0 α − σ and

  • α − σ s if 1

τ + γ d = 1 p + α − s d

  • .

(2.2) Theorem (Ng. & Squassina JFA 17) Assume (2.1) and (2.2). If 1/τ + γ/d > 0 then

|x|γuLτ(Rd) C|u|a

Ws,p,α(Rd)|x|βu(1−a) Lq(Rd)

∀ u ∈ C1

c(Rd),

and if 1/τ + γ/d < 0 then

|x|γuLτ(Rd) C|u|a

Ws,p,α(Rd)|x|βu(1−a) Lq(Rd)

∀ u ∈ C1

c(Rd \ {0}).

slide-27
SLIDE 27

Our approach

Starting point: Sobolev’s and Poincare’s inequalities; NO integration by parts. Inspiration: harmonic analysis; however, instead of localizing frequency, we localize space variables. The interpolation part is inspired from the proof of CKN’s inequality.

slide-28
SLIDE 28

Our approach

Starting point: Sobolev’s and Poincare’s inequalities; NO integration by parts. Inspiration: harmonic analysis; however, instead of localizing frequency, we localize space variables. The interpolation part is inspired from the proof of CKN’s inequality.

slide-29
SLIDE 29

Our approach

Starting point: Sobolev’s and Poincare’s inequalities; NO integration by parts. Inspiration: harmonic analysis; however, instead of localizing frequency, we localize space variables. The interpolation part is inspired from the proof of CKN’s inequality.

slide-30
SLIDE 30

Our approach

Starting point: Sobolev’s and Poincare’s inequalities; NO integration by parts. Inspiration: harmonic analysis; however, instead of localizing frequency, we localize space variables. The interpolation part is inspired from the proof of CKN’s inequality.

slide-31
SLIDE 31

A new proof of Hardy’s inequality

Recall Hardy’s inequality, for 1 p < d, ˆ

Rd

|u|p |x|p dx C

ˆ

Rd |∇u|p dx

for u ∈ C1

c(Rd).

Here is the proof. Set

Ck :=

  • x ∈ Rd : 2k |x| < 2k+1.

By Poincare’s inequality, we have

Ck

  • u −

Ck

u

  • p

dx C2kp

Ck

|∇u|p dx,

which yields ˆ

Ck

|u|p |x|p dx ∼ 2−kp

ˆ

Ck

|u|p C

ˆ

Ck

|∇u|p dx + C2k(d−p)

  • Ck

u

  • p

. By Poincare’s inequality, we also have

  • Ck+1

u −

Ck

u

  • p

dx C2kp

Ck∪Ck+1

|∇u|p dx.

slide-32
SLIDE 32

A new proof of Hardy’s inequality

Recall Hardy’s inequality, for 1 p < d, ˆ

Rd

|u|p |x|p dx C

ˆ

Rd |∇u|p dx

for u ∈ C1

c(Rd).

Here is the proof. Set

Ck :=

  • x ∈ Rd : 2k |x| < 2k+1.

By Poincare’s inequality, we have

Ck

  • u −

Ck

u

  • p

dx C2kp

Ck

|∇u|p dx,

which yields ˆ

Ck

|u|p |x|p dx ∼ 2−kp

ˆ

Ck

|u|p C

ˆ

Ck

|∇u|p dx + C2k(d−p)

  • Ck

u

  • p

. By Poincare’s inequality, we also have

  • Ck+1

u −

Ck

u

  • p

dx C2kp

Ck∪Ck+1

|∇u|p dx.

slide-33
SLIDE 33

A new proof of Hardy’s inequality

Recall Hardy’s inequality, for 1 p < d, ˆ

Rd

|u|p |x|p dx C

ˆ

Rd |∇u|p dx

for u ∈ C1

c(Rd).

Here is the proof. Set

Ck :=

  • x ∈ Rd : 2k |x| < 2k+1.

By Poincare’s inequality, we have

Ck

  • u −

Ck

u

  • p

dx C2kp

Ck

|∇u|p dx,

which yields ˆ

Ck

|u|p |x|p dx ∼ 2−kp

ˆ

Ck

|u|p C

ˆ

Ck

|∇u|p dx + C2k(d−p)

  • Ck

u

  • p

. By Poincare’s inequality, we also have

  • Ck+1

u −

Ck

u

  • p

dx C2kp

Ck∪Ck+1

|∇u|p dx.

slide-34
SLIDE 34

A new proof of Hardy’s inequality

Recall Hardy’s inequality, for 1 p < d, ˆ

Rd

|u|p |x|p dx C

ˆ

Rd |∇u|p dx

for u ∈ C1

c(Rd).

Here is the proof. Set

Ck :=

  • x ∈ Rd : 2k |x| < 2k+1.

By Poincare’s inequality, we have

Ck

  • u −

Ck

u

  • p

dx C2kp

Ck

|∇u|p dx,

which yields ˆ

Ck

|u|p |x|p dx ∼ 2−kp

ˆ

Ck

|u|p C

ˆ

Ck

|∇u|p dx + C2k(d−p)

  • Ck

u

  • p

. By Poincare’s inequality, we also have

  • Ck+1

u −

Ck

u

  • p

dx C2kp

Ck∪Ck+1

|∇u|p dx.

slide-35
SLIDE 35

A new proof of Hardy’s inequality

Recall Hardy’s inequality, for 1 p < d, ˆ

Rd

|u|p |x|p dx C

ˆ

Rd |∇u|p dx

for u ∈ C1

c(Rd).

Here is the proof. Set

Ck :=

  • x ∈ Rd : 2k |x| < 2k+1.

By Poincare’s inequality, we have

Ck

  • u −

Ck

u

  • p

dx C2kp

Ck

|∇u|p dx,

which yields ˆ

Ck

|u|p |x|p dx ∼ 2−kp

ˆ

Ck

|u|p C

ˆ

Ck

|∇u|p dx + C2k(d−p)

  • Ck

u

  • p

. By Poincare’s inequality, we also have

  • Ck+1

u −

Ck

u

  • p

dx C2kp

Ck∪Ck+1

|∇u|p dx.

slide-36
SLIDE 36

A new proof of Hardy’s inequality

Recall Hardy’s inequality, for 1 p < d, ˆ

Rd

|u|p |x|p dx C

ˆ

Rd |∇u|p dx

for u ∈ C1

c(Rd).

Here is the proof. Set

Ck :=

  • x ∈ Rd : 2k |x| < 2k+1.

By Poincare’s inequality, we have

Ck

  • u −

Ck

u

  • p

dx C2kp

Ck

|∇u|p dx,

which yields ˆ

Ck

|u|p |x|p dx ∼ 2−kp

ˆ

Ck

|u|p C

ˆ

Ck

|∇u|p dx + C2k(d−p)

  • Ck

u

  • p

. By Poincare’s inequality, we also have

  • Ck+1

u −

Ck

u

  • p

dx C2kp

Ck∪Ck+1

|∇u|p dx.

slide-37
SLIDE 37

It follows that 2k(d−p)

  • Ck

u

  • p

Cc

ˆ

Ck∪Ck+1

|∇u|p dx+c2(k+1)(d−p)

  • Ck+1

u

  • p

. for c > 2p−d, in particular for c = (2p−d + 1)/2 < 1. This implies

  • k

2k(d−p)

  • Ck

u

  • p

C

  • k

ˆ

Ck∪Ck+1

|∇u|p dx C

ˆ

Rd |∇u|p.

We derive that

  • k

2−kp ˆ

Ck

|u|p C

  • k

ˆ

Ck

|∇u|p dx + C

  • k

2k(d−p)

  • Ck

u

  • p

C

ˆ

Rd |∇u|p.

The proof is complete.

slide-38
SLIDE 38

It follows that 2k(d−p)

  • Ck

u

  • p

Cc

ˆ

Ck∪Ck+1

|∇u|p dx+c2(k+1)(d−p)

  • Ck+1

u

  • p

. for c > 2p−d, in particular for c = (2p−d + 1)/2 < 1. This implies

  • k

2k(d−p)

  • Ck

u

  • p

C

  • k

ˆ

Ck∪Ck+1

|∇u|p dx C

ˆ

Rd |∇u|p.

We derive that

  • k

2−kp ˆ

Ck

|u|p C

  • k

ˆ

Ck

|∇u|p dx + C

  • k

2k(d−p)

  • Ck

u

  • p

C

ˆ

Rd |∇u|p.

The proof is complete.

slide-39
SLIDE 39

It follows that 2k(d−p)

  • Ck

u

  • p

Cc

ˆ

Ck∪Ck+1

|∇u|p dx+c2(k+1)(d−p)

  • Ck+1

u

  • p

. for c > 2p−d, in particular for c = (2p−d + 1)/2 < 1. This implies

  • k

2k(d−p)

  • Ck

u

  • p

C

  • k

ˆ

Ck∪Ck+1

|∇u|p dx C

ˆ

Rd |∇u|p.

We derive that

  • k

2−kp ˆ

Ck

|u|p C

  • k

ˆ

Ck

|∇u|p dx + C

  • k

2k(d−p)

  • Ck

u

  • p

C

ˆ

Rd |∇u|p.

The proof is complete.

slide-40
SLIDE 40

It follows that 2k(d−p)

  • Ck

u

  • p

Cc

ˆ

Ck∪Ck+1

|∇u|p dx+c2(k+1)(d−p)

  • Ck+1

u

  • p

. for c > 2p−d, in particular for c = (2p−d + 1)/2 < 1. This implies

  • k

2k(d−p)

  • Ck

u

  • p

C

  • k

ˆ

Ck∪Ck+1

|∇u|p dx C

ˆ

Rd |∇u|p.

We derive that

  • k

2−kp ˆ

Ck

|u|p C

  • k

ˆ

Ck

|∇u|p dx + C

  • k

2k(d−p)

  • Ck

u

  • p

C

ˆ

Rd |∇u|p.

The proof is complete.

slide-41
SLIDE 41

Proof of CKN’s inequality for the main case

Let p > 1, q 1, τ > 0, 0 < s < 1, 0 < a 1, α, β, γ ∈ R be s.t. 1

τ + γ d = a 1 p + α − s d

  • + (1 − a)

1 q + β d

  • ,

(2.3) and, with γ = aσ + (1 − a)β, 0 α − σ s (2.4) Theorem Assume (2.3) and (2.4). We have, for 1/τ + γ/d > 0,

|x|γuLτ(Rd) C|u|a

Ws,p,α(Rd)|x|βu(1−a) Lq(Rd)

∀ u ∈ C1

c(Rd),

|u|p

Ws,p,α(Rd) =

ˆ

Rd

ˆ

Rd

|x|

αp 2 |y| αp 2 |u(x) − u(y)|p

|x − y|d+sp dx dy.

slide-42
SLIDE 42

Lemma (Gagliardo-Nirenberg’s inequality) Let d 1, 0 < s < 1, p > 1, q 1, τ > 0, and 0 < a 1 be s.t. 1

τ = a 1 p − s d

  • + (1 − a)1

q.

We have

uLτ(Rd) C|u|a

Ws,p(Rd)u1−a Lq(Rd)

for u ∈ C1

c(Rd).

slide-43
SLIDE 43

Lemma (Gagliardo-Nirenberg’s inequality) Let d 1, 0 < s < 1, p > 1, q 1, τ > 0, and 0 < a 1 be s.t. 1

τ = a 1 p − s d

  • + (1 − a)1

q.

We have

uLτ(Rd) C|u|a

Ws,p(Rd)u1−a Lq(Rd)

for u ∈ C1

c(Rd).

slide-44
SLIDE 44

Lemma Let d 1, p > 1, 0 < s < 1, q 1, τ > 0, and 0 < a 1 be s.t. 1

τ a 1 p − s d

  • + (1 − a)1

q.

Let λ > 0, 0 < r < R, and set D :=

  • x ∈ Rd : λr < |x| < λR

. Then, ∀u ∈ C1(¯ D),

  • D
  • u −

D

u

  • τ

dx 1/τ C

  • λsp−d|u|p

Ws,p(D)

a/p

D

|u|q dx (1−a)/q

.

slide-45
SLIDE 45

Lemma Let d 1, p > 1, 0 < s < 1, q 1, τ > 0, and 0 < a 1 be s.t. 1

τ a 1 p − s d

  • + (1 − a)1

q.

Let λ > 0, 0 < r < R, and set D :=

  • x ∈ Rd : λr < |x| < λR

. Then, ∀u ∈ C1(¯ D),

  • D
  • u −

D

u

  • τ

dx 1/τ C

  • λsp−d|u|p

Ws,p(D)

a/p

D

|u|q dx (1−a)/q

.

slide-46
SLIDE 46

Lemma Let d 1, p > 1, 0 < s < 1, q 1, τ > 0, and 0 < a 1 be s.t. 1

τ a 1 p − s d

  • + (1 − a)1

q.

Let λ > 0, 0 < r < R, and set D :=

  • x ∈ Rd : λr < |x| < λR

. Then, ∀u ∈ C1(¯ D),

  • D
  • u −

D

u

  • τ

dx 1/τ C

  • λsp−d|u|p

Ws,p(D)

a/p

D

|u|q dx (1−a)/q

.

slide-47
SLIDE 47
  • Proof. By scaling, one can assume that λ = 1. Let 0 < s′ s and

τ′ τ be such that

1

τ′ = a 1 p − s′ d

  • + (1 − a)1

q.

From the previous lemma, we derive that

  • u −

D

u

  • Lτ′(D)

C |u|a

Ws′,p(D) u1−a Lq(D).

Since |u|Ws′,p(D) C |u|Ws,p(D), uLτ(D) CuLτ′(D), the conclusion follows.

slide-48
SLIDE 48
  • Proof. By scaling, one can assume that λ = 1. Let 0 < s′ s and

τ′ τ be such that

1

τ′ = a 1 p − s′ d

  • + (1 − a)1

q.

From the previous lemma, we derive that

  • u −

D

u

  • Lτ′(D)

C |u|a

Ws′,p(D) u1−a Lq(D).

Since |u|Ws′,p(D) C |u|Ws,p(D), uLτ(D) CuLτ′(D), the conclusion follows.

slide-49
SLIDE 49
  • Proof. By scaling, one can assume that λ = 1. Let 0 < s′ s and

τ′ τ be such that

1

τ′ = a 1 p − s′ d

  • + (1 − a)1

q.

From the previous lemma, we derive that

  • u −

D

u

  • Lτ′(D)

C |u|a

Ws′,p(D) u1−a Lq(D).

Since |u|Ws′,p(D) C |u|Ws,p(D), uLτ(D) CuLτ′(D), the conclusion follows.

slide-50
SLIDE 50
  • Proof. By scaling, one can assume that λ = 1. Let 0 < s′ s and

τ′ τ be such that

1

τ′ = a 1 p − s′ d

  • + (1 − a)1

q.

From the previous lemma, we derive that

  • u −

D

u

  • Lτ′(D)

C |u|a

Ws′,p(D) u1−a Lq(D).

Since |u|Ws′,p(D) C |u|Ws,p(D), uLτ(D) CuLτ′(D), the conclusion follows.

slide-51
SLIDE 51

Proof of CKN’s inequality

Recall Ck :=

  • x ∈ Rd : 2k |x| < 2k+1. We have,
  • α − σ 0 +

balance law

  • ,

1

τ a 1 p − s d

  • + (1 − a)1

q.

It follows that

  • Ck
  • u −

Ck

u

  • τ

dx 1/τ C

  • 2−(d−sp)k|u|p

Ws,p(Ck)

a/p

Ck

|u|q dx (1−a)/q

. Using the balance law, we derive that ˆ

Ck

|x|γτ|u|τ dx C|u|aτ

Ws,p,α(Ck)|x|βu(1−a)τ Lq(Ck) +C2(γτ+d)k

  • Ck

u

  • τ

, (2.5)

slide-52
SLIDE 52

Proof of CKN’s inequality

Recall Ck :=

  • x ∈ Rd : 2k |x| < 2k+1. We have,
  • α − σ 0 +

balance law

  • ,

1

τ a 1 p − s d

  • + (1 − a)1

q.

It follows that

  • Ck
  • u −

Ck

u

  • τ

dx 1/τ C

  • 2−(d−sp)k|u|p

Ws,p(Ck)

a/p

Ck

|u|q dx (1−a)/q

. Using the balance law, we derive that ˆ

Ck

|x|γτ|u|τ dx C|u|aτ

Ws,p,α(Ck)|x|βu(1−a)τ Lq(Ck) +C2(γτ+d)k

  • Ck

u

  • τ

, (2.5)

slide-53
SLIDE 53

Proof of CKN’s inequality

Recall Ck :=

  • x ∈ Rd : 2k |x| < 2k+1. We have,
  • α − σ 0 +

balance law

  • ,

1

τ a 1 p − s d

  • + (1 − a)1

q.

It follows that

  • Ck
  • u −

Ck

u

  • τ

dx 1/τ C

  • 2−(d−sp)k|u|p

Ws,p(Ck)

a/p

Ck

|u|q dx (1−a)/q

. Using the balance law, we derive that ˆ

Ck

|x|γτ|u|τ dx C|u|aτ

Ws,p,α(Ck)|x|βu(1−a)τ Lq(Ck) +C2(γτ+d)k

  • Ck

u

  • τ

, (2.5)

slide-54
SLIDE 54

Proof of CKN’s inequality

Recall Ck :=

  • x ∈ Rd : 2k |x| < 2k+1. We have,
  • α − σ 0 +

balance law

  • ,

1

τ a 1 p − s d

  • + (1 − a)1

q.

It follows that

  • Ck
  • u −

Ck

u

  • τ

dx 1/τ C

  • 2−(d−sp)k|u|p

Ws,p(Ck)

a/p

Ck

|u|q dx (1−a)/q

. Using the balance law, we derive that ˆ

Ck

|x|γτ|u|τ dx C|u|aτ

Ws,p,α(Ck)|x|βu(1−a)τ Lq(Ck) +C2(γτ+d)k

  • Ck

u

  • τ

, (2.5)

slide-55
SLIDE 55

Since

  • Ck

u −

Ck+1

u

  • τ

C

  • 2−(d−sp)k|u|p

Ws,p(Ck∪Ck+1)

aτ/p

Ck∪Ck+1

|u|q dx (1−a)τ/q

, we obtain, with c = 2/(1 + 2γτ+d) < 1, 2(γτ+d)k

  • Ck

u

  • τ

C|u|aτ

Ws,p,α(Ck∪Ck+1)|x|βu(1−a)τ Lq(Ck∪Ck+1)

+ c2(γτ+d)(k+1)

  • Ck+1

u

  • τ

. This yields

  • k

2(γτ+d)k

  • Ck

u

  • τ

C

  • k

|u|aτ

Ws,p,α(Ck∪Ck+1)|x|βu(1−a)τ Lq(Ck∪Ck+1).

(2.6)

slide-56
SLIDE 56

Since

  • Ck

u −

Ck+1

u

  • τ

C

  • 2−(d−sp)k|u|p

Ws,p(Ck∪Ck+1)

aτ/p

Ck∪Ck+1

|u|q dx (1−a)τ/q

, we obtain, with c = 2/(1 + 2γτ+d) < 1, 2(γτ+d)k

  • Ck

u

  • τ

C|u|aτ

Ws,p,α(Ck∪Ck+1)|x|βu(1−a)τ Lq(Ck∪Ck+1)

+ c2(γτ+d)(k+1)

  • Ck+1

u

  • τ

. This yields

  • k

2(γτ+d)k

  • Ck

u

  • τ

C

  • k

|u|aτ

Ws,p,α(Ck∪Ck+1)|x|βu(1−a)τ Lq(Ck∪Ck+1).

(2.6)

slide-57
SLIDE 57

Combining (2.5) and (2.6) yields ˆ

Rd |x|γτ|u|τ dx C

  • k

|u|aτ

Ws,p,α(Ck∪Ck+1)|x|βu(1−a)τ Lq(Ck∪Ck+1).

One has, for s 0, t 0 with s + t 1, and for xk 0 and

yk 0,

n

  • k=m

xs

kyt k

  • n
  • k=m

xk s

n

  • k=m

yk t

. Applying this inequality with s = aτ/p and t = (1 − a)τ/q, we

  • btain that

ˆ

Rd |x|γτ|u|τ dx C|u|aτ Ws,p,α(∞

k=m Ck)|x|βu(1−a)τ

Lq(∞

k=m Ck),

since a/p + (1 − a)/q 1/τ thanks to the fact α − σ s.

slide-58
SLIDE 58

Combining (2.5) and (2.6) yields ˆ

Rd |x|γτ|u|τ dx C

  • k

|u|aτ

Ws,p,α(Ck∪Ck+1)|x|βu(1−a)τ Lq(Ck∪Ck+1).

One has, for s 0, t 0 with s + t 1, and for xk 0 and

yk 0,

n

  • k=m

xs

kyt k

  • n
  • k=m

xk s

n

  • k=m

yk t

. Applying this inequality with s = aτ/p and t = (1 − a)τ/q, we

  • btain that

ˆ

Rd |x|γτ|u|τ dx C|u|aτ Ws,p,α(∞

k=m Ck)|x|βu(1−a)τ

Lq(∞

k=m Ck),

since a/p + (1 − a)/q 1/τ thanks to the fact α − σ s.

slide-59
SLIDE 59

Combining (2.5) and (2.6) yields ˆ

Rd |x|γτ|u|τ dx C

  • k

|u|aτ

Ws,p,α(Ck∪Ck+1)|x|βu(1−a)τ Lq(Ck∪Ck+1).

One has, for s 0, t 0 with s + t 1, and for xk 0 and

yk 0,

n

  • k=m

xs

kyt k

  • n
  • k=m

xk s

n

  • k=m

yk t

. Applying this inequality with s = aτ/p and t = (1 − a)τ/q, we

  • btain that

ˆ

Rd |x|γτ|u|τ dx C|u|aτ Ws,p,α(∞

k=m Ck)|x|βu(1−a)τ

Lq(∞

k=m Ck),

since a/p + (1 − a)/q 1/τ thanks to the fact α − σ s.

slide-60
SLIDE 60

Combining (2.5) and (2.6) yields ˆ

Rd |x|γτ|u|τ dx C

  • k

|u|aτ

Ws,p,α(Ck∪Ck+1)|x|βu(1−a)τ Lq(Ck∪Ck+1).

One has, for s 0, t 0 with s + t 1, and for xk 0 and

yk 0,

n

  • k=m

xs

kyt k

  • n
  • k=m

xk s

n

  • k=m

yk t

. Applying this inequality with s = aτ/p and t = (1 − a)τ/q, we

  • btain that

ˆ

Rd |x|γτ|u|τ dx C|u|aτ Ws,p,α(∞

k=m Ck)|x|βu(1−a)τ

Lq(∞

k=m Ck),

since a/p + (1 − a)/q 1/τ thanks to the fact α − σ s.

slide-61
SLIDE 61

On the limiting case

Theorem (Ng. & Squassina JFA 17) Let d 1, p > 1, 0 < s < 1, q 1, τ > 1, 0 < a 1, α, β, γ ∈ R be such that (2.3) holds and 0 a − σ s. Let u ∈ C1

c(Rd), and 0 < r < R. We have

i) if 1/τ + γ/d = 0 and supp u ⊂ BR, then

ˆ

Rd

|x|γτ

lnτ(2R/|x|)|u|τ dx

1/τ C|u|a

Ws,p,α(Rd)|x|βu(1−a) Lq(Rd),

ii) if 1/τ + γ/d = 0 and supp u ∩ Br = ∅, then

ˆ

Rd

|x|γτ

lnτ(2|x|/r)|u|τ dx

1/τ C|u|a

Ws,p,α(Rd)|x|βu(1−a) Lq(Rd).

slide-62
SLIDE 62

On the limiting case

Theorem (Ng. & Squassina JFA 17) Let d 1, p > 1, 0 < s < 1, q 1, τ > 1, 0 < a 1, α, β, γ ∈ R be such that (2.3) holds and 0 a − σ s. Let u ∈ C1

c(Rd), and 0 < r < R. We have

i) if 1/τ + γ/d = 0 and supp u ⊂ BR, then

ˆ

Rd

|x|γτ

lnτ(2R/|x|)|u|τ dx

1/τ C|u|a

Ws,p,α(Rd)|x|βu(1−a) Lq(Rd),

ii) if 1/τ + γ/d = 0 and supp u ∩ Br = ∅, then

ˆ

Rd

|x|γτ

lnτ(2|x|/r)|u|τ dx

1/τ C|u|a

Ws,p,α(Rd)|x|βu(1−a) Lq(Rd).

slide-63
SLIDE 63

On the limiting case

Theorem (Ng. & Squassina JFA 17) Let d 1, p > 1, 0 < s < 1, q 1, τ > 1, 0 < a 1, α, β, γ ∈ R be such that (2.3) holds and 0 a − σ s. Let u ∈ C1

c(Rd), and 0 < r < R. We have

i) if 1/τ + γ/d = 0 and supp u ⊂ BR, then

ˆ

Rd

|x|γτ

lnτ(2R/|x|)|u|τ dx

1/τ C|u|a

Ws,p,α(Rd)|x|βu(1−a) Lq(Rd),

ii) if 1/τ + γ/d = 0 and supp u ∩ Br = ∅, then

ˆ

Rd

|x|γτ

lnτ(2|x|/r)|u|τ dx

1/τ C|u|a

Ws,p,α(Rd)|x|βu(1−a) Lq(Rd).

slide-64
SLIDE 64

On the limiting case

Theorem (Ng. & Squassina JFA 17) Let d 1, p > 1, 0 < s < 1, q 1, τ > 1, 0 < a 1, α, β, γ ∈ R be such that (2.3) holds and 0 a − σ s. Let u ∈ C1

c(Rd), and 0 < r < R. We have

i) if 1/τ + γ/d = 0 and supp u ⊂ BR, then

ˆ

Rd

|x|γτ

lnτ(2R/|x|)|u|τ dx

1/τ C|u|a

Ws,p,α(Rd)|x|βu(1−a) Lq(Rd),

ii) if 1/τ + γ/d = 0 and supp u ∩ Br = ∅, then

ˆ

Rd

|x|γτ

lnτ(2|x|/r)|u|τ dx

1/τ C|u|a

Ws,p,α(Rd)|x|βu(1−a) Lq(Rd).

slide-65
SLIDE 65

Section 3: New perspectives of Hardy’s and Caffarelli, Kohn, Nirenberg’s inequalities

slide-66
SLIDE 66

Motivations

Define, for d 1 and p 1,

Iδ(u) :=

ˆ

Rd

ˆ

Rd |u(x)−u(y)|>δ

δp |x − y|d+p dx dy ∀ u ∈ Lp(Rd).

1 Iδ is related to the semi-norm of Ws,q(Rd):

|u|q

Ws,q(Rd) :=

ˆ

Rd

ˆ

Rd

|u(x) − u(y)|q |x − y|d+sq dx dy.

2 Iδ appears in an estimate for the topological degree due to

Bourgain, Brezis, & Ng., CRAS 05, and Ng. JAM 07

| deg u| Cd

ˆ

Sd

ˆ

Sd |u(x)−u(y)|ℓd

1

|x − y|2d dx dy, ∀ u ∈ C(Sd, Sd),

where ℓd =

  • 2 +

2 d+1.

slide-67
SLIDE 67

Motivations

Define, for d 1 and p 1,

Iδ(u) :=

ˆ

Rd

ˆ

Rd |u(x)−u(y)|>δ

δp |x − y|d+p dx dy ∀ u ∈ Lp(Rd).

1 Iδ is related to the semi-norm of Ws,q(Rd):

|u|q

Ws,q(Rd) :=

ˆ

Rd

ˆ

Rd

|u(x) − u(y)|q |x − y|d+sq dx dy.

2 Iδ appears in an estimate for the topological degree due to

Bourgain, Brezis, & Ng., CRAS 05, and Ng. JAM 07

| deg u| Cd

ˆ

Sd

ˆ

Sd |u(x)−u(y)|ℓd

1

|x − y|2d dx dy, ∀ u ∈ C(Sd, Sd),

where ℓd =

  • 2 +

2 d+1.

slide-68
SLIDE 68

Motivations

Define, for d 1 and p 1,

Iδ(u) :=

ˆ

Rd

ˆ

Rd |u(x)−u(y)|>δ

δp |x − y|d+p dx dy ∀ u ∈ Lp(Rd).

1 Iδ is related to the semi-norm of Ws,q(Rd):

|u|q

Ws,q(Rd) :=

ˆ

Rd

ˆ

Rd

|u(x) − u(y)|q |x − y|d+sq dx dy.

2 Iδ appears in an estimate for the topological degree due to

Bourgain, Brezis, & Ng., CRAS 05, and Ng. JAM 07

| deg u| Cd

ˆ

Sd

ˆ

Sd |u(x)−u(y)|ℓd

1

|x − y|2d dx dy, ∀ u ∈ C(Sd, Sd),

where ℓd =

  • 2 +

2 d+1.

slide-69
SLIDE 69

Motivations

Define, for d 1 and p 1,

Iδ(u) :=

ˆ

Rd

ˆ

Rd |u(x)−u(y)|>δ

δp |x − y|d+p dx dy ∀ u ∈ Lp(Rd).

1 Iδ is related to the semi-norm of Ws,q(Rd):

|u|q

Ws,q(Rd) :=

ˆ

Rd

ˆ

Rd

|u(x) − u(y)|q |x − y|d+sq dx dy.

2 Iδ appears in an estimate for the topological degree due to

Bourgain, Brezis, & Ng., CRAS 05, and Ng. JAM 07

| deg u| Cd

ˆ

Sd

ˆ

Sd |u(x)−u(y)|ℓd

1

|x − y|2d dx dy, ∀ u ∈ C(Sd, Sd),

where ℓd =

  • 2 +

2 d+1.

slide-70
SLIDE 70

Theorem (Ng. JFA 06, Bourgain & Ng. CRAS 06) Let d 1, 1 < p < +∞ and u ∈ Lp(Rd). Then

1

Iδ(u) Cd,p

ˆ

Rd |∇u|p

∀ u ∈ W1,p(Rd).

2

lim

δ→0 Iδ(u) = Kd,p

ˆ

Rd |∇u|p

∀ u ∈ W1,p(Rd).

3 If

lim inf

δ→0 Iδ(u) < +∞,

then u ∈ W1,p(Rd). Related works: Bourgain, Brezis, & Mironescu 01, Davila 02.

slide-71
SLIDE 71

Theorem (Ng. JFA 06, Bourgain & Ng. CRAS 06) Let d 1, 1 < p < +∞ and u ∈ Lp(Rd). Then

1

Iδ(u) Cd,p

ˆ

Rd |∇u|p

∀ u ∈ W1,p(Rd).

2

lim

δ→0 Iδ(u) = Kd,p

ˆ

Rd |∇u|p

∀ u ∈ W1,p(Rd).

3 If

lim inf

δ→0 Iδ(u) < +∞,

then u ∈ W1,p(Rd). Related works: Bourgain, Brezis, & Mironescu 01, Davila 02.

slide-72
SLIDE 72

Theorem (Ng. JFA 06, Bourgain & Ng. CRAS 06) Let d 1, 1 < p < +∞ and u ∈ Lp(Rd). Then

1

Iδ(u) Cd,p

ˆ

Rd |∇u|p

∀ u ∈ W1,p(Rd).

2

lim

δ→0 Iδ(u) = Kd,p

ˆ

Rd |∇u|p

∀ u ∈ W1,p(Rd).

3 If

lim inf

δ→0 Iδ(u) < +∞,

then u ∈ W1,p(Rd). Related works: Bourgain, Brezis, & Mironescu 01, Davila 02.

slide-73
SLIDE 73

Theorem (Ng. JFA 06, Bourgain & Ng. CRAS 06) Let d 1, 1 < p < +∞ and u ∈ Lp(Rd). Then

1

Iδ(u) Cd,p

ˆ

Rd |∇u|p

∀ u ∈ W1,p(Rd).

2

lim

δ→0 Iδ(u) = Kd,p

ˆ

Rd |∇u|p

∀ u ∈ W1,p(Rd).

3 If

lim inf

δ→0 Iδ(u) < +∞,

then u ∈ W1,p(Rd). Related works: Bourgain, Brezis, & Mironescu 01, Davila 02.

slide-74
SLIDE 74

Theorem (Ng. CVPDE, 11) Let p 1, Q be a cube or a ball of Rd. Then ∃C > 0 s.t. for all

δ > 0:

¨

Q2 |u(x) − u(y)|p dx dy

C

  • |Q|

d+p d

¨

Q2 |u(x)−u(y)|>δ

δp |x − y|d+p dx dy + δp|Q|2

. A variant of Sobolev’s inequality also holds for Iδ for 1 < p < d.

Question: How’s about Hardy’s and Caffarelli, Kohn, Nirenberg’s inequalities?

slide-75
SLIDE 75

Variants of Hardy’s inequalities

Theorem (Ng. & Squassina JAM, to appear) Let d 1, p 1, 0 < r < R, and u ∈ Lp(Rd). We have i) if 1 p < d and supp u ⊂ BR, then ˆ

Rd

|u(x)|p |x|p dx C

  • Iδ(u) + Rd−pδp,

ii) if p > d and supp u ⊂ Rd \ Br, then ˆ

Rd

|u(x)|p |x|p dx C

  • Iδ(u) + rd−pδp,

Similar results hold for the case p = d.

slide-76
SLIDE 76

Variants of Hardy’s inequalities

Theorem (Ng. & Squassina JAM, to appear) Let d 1, p 1, 0 < r < R, and u ∈ Lp(Rd). We have i) if 1 p < d and supp u ⊂ BR, then ˆ

Rd

|u(x)|p |x|p dx C

  • Iδ(u) + Rd−pδp,

ii) if p > d and supp u ⊂ Rd \ Br, then ˆ

Rd

|u(x)|p |x|p dx C

  • Iδ(u) + rd−pδp,

Similar results hold for the case p = d.

slide-77
SLIDE 77

Variants of Hardy’s inequalities

Theorem (Ng. & Squassina JAM, to appear) Let d 1, p 1, 0 < r < R, and u ∈ Lp(Rd). We have i) if 1 p < d and supp u ⊂ BR, then ˆ

Rd

|u(x)|p |x|p dx C

  • Iδ(u) + Rd−pδp,

ii) if p > d and supp u ⊂ Rd \ Br, then ˆ

Rd

|u(x)|p |x|p dx C

  • Iδ(u) + rd−pδp,

Similar results hold for the case p = d.

slide-78
SLIDE 78

Theorem (Ng. & Squassina JAM, to appear) Let d 2, 1 < p < d, τ > 0, 0 < r < R, and u ∈ Lp

loc(Rd). Assume

that 1

τ + γ d = 1 p + α − 1 d

and 0 α − γ 1. We have i) if d − p + pα > 0 and supp u ⊂ BR, then

ˆ

Rd |x|γτ|u(x)|τ dx

p/τ C

  • Iδ(u, α) + Rd−p+pαδp,

ii) if d − p + pα < 0 and supp u ⊂ Rd \ Br, then

ˆ

Rd |x|γτ|u(x)|τ dx

p/τ C

  • Iδ(u, α) + rd−p+pαδp.
  • Variants for p = d 2 and also for p = d = 1 hold.
  • Variants for 0 < a < 1 hold.
slide-79
SLIDE 79

Theorem (Ng. & Squassina JAM, to appear) Let d 2, 1 < p < d, τ > 0, 0 < r < R, and u ∈ Lp

loc(Rd). Assume

that 1

τ + γ d = 1 p + α − 1 d

and 0 α − γ 1. We have i) if d − p + pα > 0 and supp u ⊂ BR, then

ˆ

Rd |x|γτ|u(x)|τ dx

p/τ C

  • Iδ(u, α) + Rd−p+pαδp,

ii) if d − p + pα < 0 and supp u ⊂ Rd \ Br, then

ˆ

Rd |x|γτ|u(x)|τ dx

p/τ C

  • Iδ(u, α) + rd−p+pαδp.
  • Variants for p = d 2 and also for p = d = 1 hold.
  • Variants for 0 < a < 1 hold.
slide-80
SLIDE 80

Theorem (Ng. & Squassina JAM, to appear) Let d 2, 1 < p < d, τ > 0, 0 < r < R, and u ∈ Lp

loc(Rd). Assume

that 1

τ + γ d = 1 p + α − 1 d

and 0 α − γ 1. We have i) if d − p + pα > 0 and supp u ⊂ BR, then

ˆ

Rd |x|γτ|u(x)|τ dx

p/τ C

  • Iδ(u, α) + Rd−p+pαδp,

ii) if d − p + pα < 0 and supp u ⊂ Rd \ Br, then

ˆ

Rd |x|γτ|u(x)|τ dx

p/τ C

  • Iδ(u, α) + rd−p+pαδp.
  • Variants for p = d 2 and also for p = d = 1 hold.
  • Variants for 0 < a < 1 hold.
slide-81
SLIDE 81

Theorem (Ng. & Squassina JAM, to appear) Let d 2, 1 < p < d, τ > 0, 0 < r < R, and u ∈ Lp

loc(Rd). Assume

that 1

τ + γ d = 1 p + α − 1 d

and 0 α − γ 1. We have i) if d − p + pα > 0 and supp u ⊂ BR, then

ˆ

Rd |x|γτ|u(x)|τ dx

p/τ C

  • Iδ(u, α) + Rd−p+pαδp,

ii) if d − p + pα < 0 and supp u ⊂ Rd \ Br, then

ˆ

Rd |x|γτ|u(x)|τ dx

p/τ C

  • Iδ(u, α) + rd−p+pαδp.
  • Variants for p = d 2 and also for p = d = 1 hold.
  • Variants for 0 < a < 1 hold.
slide-82
SLIDE 82

Theorem (Ng. & Squassina JAM, to appear) Let d 2, 1 < p < d, τ > 0, 0 < r < R, and u ∈ Lp

loc(Rd). Assume

that 1

τ + γ d = 1 p + α − 1 d

and 0 α − γ 1. We have i) if d − p + pα > 0 and supp u ⊂ BR, then

ˆ

Rd |x|γτ|u(x)|τ dx

p/τ C

  • Iδ(u, α) + Rd−p+pαδp,

ii) if d − p + pα < 0 and supp u ⊂ Rd \ Br, then

ˆ

Rd |x|γτ|u(x)|τ dx

p/τ C

  • Iδ(u, α) + rd−p+pαδp.
  • Variants for p = d 2 and also for p = d = 1 hold.
  • Variants for 0 < a < 1 hold.
slide-83
SLIDE 83

Thank you for your attention!