Al Detalla Theory

INTRODUCTION
IMPROVED HARDY-SOBOLEV INEQUALITIES

IMPROVED RELLICH INEQUALITIES
MISSING TERMS IN CLASSICAL
INEQUALITIES
ALNAR L. DETALLA
Department of Mathematics
College of Arts and Sciences
Central Mindanao University
8710 Musuan, Bukidnon
May 21, 2010
A. L. Detalla Missing Terms in Classical Inequalities
INTRODUCTION
INRODUCTION
In 1920, G. H. Hardy proved the following:
INTRODUCTION
INRODUCTION
INTRODUCTION
INRODUCTION
Let 1 p 1
INTRODUCTION
INRODUCTION
F(t) :=
_
_
t
0
f(x)dx, for p 1
f : is a non-negative measurable function on (0, ). Then
INTRODUCTION
INRODUCTION
F(t) :=
_
_
t
0
f(x)dx, for p 1
_

0
F
p
(t)t
p
dt C
_

0
f
p
(t)t
dt (1)
INTRODUCTION
INRODUCTION
F(t) :=
_
_
t
0
f(x)dx, for p 1
_

0
F
p
(t)t
p
dt C
_

0
f
p
(t)t
dt (1)
where C > 0 independent of f.
INTRODUCTION
_

0
F
p
(t)t
p
dt C
_

0
f
p
(t)t
dt (1)
INTRODUCTION
_

0
F
p
(t)t
p
dt C
_

0
f
p
(t)t
dt (1)
INTRODUCTION
_

0
F
p
(t)t
p
dt C
_

0
f
p
(t)t
dt (1)
C =
_
p
|p+1|
_
p
by: E. Landau (1930)
INTRODUCTION
_

0
F
p
(t)t
p
dt C
_

0
f
p
(t)t
dt (1)
C =
_
p
|p+1|
_
p
NOTE: (1) can be written as
INTRODUCTION
_

0
F
p
(t)t
p
dt C
_

0
f
p
(t)t
dt (1)
C =
_
p
|p+1|
_
p
_

0
|u(t)|
p
t
p
dt
_
p
| p + 1|
_
p
_

0
|u
(t)|
p
t
dt (2)
INTRODUCTION
_

0
F
p
(t)t
p
dt C
_

0
f
p
(t)t
dt (1)
C =
_
p
|p+1|
_
p
_

0
|u(t)|
p
t
p
dt
_
p
| p + 1|
_
p
_

0
|u
(t)|
p
t
dt (2)
where u
(t) :=
du
dt
, u C
c
((0, )), p > 1, = p 1.
INTRODUCTION
_

0
F
p
(t)t
p
dt C
_

0
f
p
(t)t
dt (1)
C =
_
p
|p+1|
_
p
_

0
|u(t)|
p
t
p
dt
_
p
| p + 1|
_
p
_

0
|u
(t)|
p
t
dt (2)
where u
(t) :=
du
dt
, u C
c
((0, )), p > 1, = p 1.
We call (2) the classical Hardy inequality
INTRODUCTION
for = 0, (2) becomes
INTRODUCTION
INTRODUCTION
_

0
|u
(t)|
p
dt
_
p 1
p
_
p
_

0
|u(t)|
p
|t|
p
dt (3)
INTRODUCTION
_

0
|u
(t)|
p
dt
_
p 1
p
_
p
_

0
|u(t)|
p
|t|
p
dt (3)
from (3) a Hardy inequality of higher dimension can be
derived which is a classical Sobolev embedding inequality.
INTRODUCTION
_

0
|u
(t)|
p
dt
_
p 1
p
_
p
_

0
|u(t)|
p
|t|
p
dt (3)
For n > 2,
INTRODUCTION
_

0
|u
(t)|
p
dt
_
p 1
p
_
p
_

0
|u(t)|
p
|t|
p
dt (3)
For n > 2,
_
|u(x)|
2
dx
_
n 2
2
_
2
_
u(x)
2
|x|
2
dx, u W
1,2
0
(). (4)
INTRODUCTION
_

0
|u
(t)|
p
dt
_
p 1
p
_
p
_

0
|u(t)|
p
|t|
p
dt (3)
For n > 2,
_
|u(x)|
2
dx
_
n 2
2
_
2
_
u(x)
2
|x|
2
dx, u W
1,2
0
(). (4)
L
p
-version of (4) where 1 p < n is
INTRODUCTION
_

0
|u
(t)|
p
dt
_
p 1
p
_
p
_

0
|u(t)|
p
|t|
p
dt (3)
For n > 2,
_
|u(x)|
2
dx
_
n 2
2
_
2
_
u(x)
2
|x|
2
dx, u W
1,2
0
(). (4)
L
p
-version of (4) where 1 p < n is
_
|u(x)|
p
dx
_
n p
p
_
p
_
|u(x)|
p
|x|
p
dx, u W
1,p
0
().
(5)
INTRODUCTION
A higher order generalization of (4) was proven by Rellich
INTRODUCTION
INTRODUCTION
For n > 4,
INTRODUCTION
For n > 4,
_
|u(x)|
2
dx
n
2
(n 4)
2
16
_
|u(x)|
2
|x|
4
dx,
u W
2,2
0
().
(6)
INTRODUCTION
For n > 4,
_
|u(x)|
2
dx
n
2
(n 4)
2
16
_
|u(x)|
2
|x|
4
dx,
u W
2,2
0
().
(6)
L
p
-version of (6) is
INTRODUCTION
For n > 4,
_
|u(x)|
2
dx
n
2
(n 4)
2
16
_
|u(x)|
2
|x|
4
dx,
u W
2,2
0
().
(6)
L
p
-version of (6) is
_
|u(x)|
p
dx
_
n 2p
p
_
p
_
np n
p
_
p
_
|u(x)|
p
|x|
2p
dx,
u W
2,p
0
().
(7)
INTRODUCTION
W
l,p
():function space on whose generalized derivatives
u of order l satises
INTRODUCTION
W
l,p
INTRODUCTION
W
l,p
||u||
W
l,p
()
=
||l
__
u(x)|
p
dx
_1
p
<
INTRODUCTION
W
l,p
||u||
W
l,p
()
=
||l
__
u(x)|
p
dx
_1
p
<
W
l,p
0
() denotes the completion of C
0
() in W
l,p
().
INTRODUCTION
Hardy-Sobolev Inequalities
INTRODUCTION
INTRODUCTION
_
|u(x)|
2
dx
_
n 2
2
_
2
_
u(x)
2
|x|
2
dx, u W
1,2
0
() (4)
INTRODUCTION
_
|u(x)|
2
dx
_
n 2
2
_
2
_
u(x)
2
|x|
2
dx, u W
1,2
0
() (4)
_
|u(x)|
p
dx
_
n p
p
_
p
_
|u(x)|
p
|x|
p
dx, u W
1,p
0
() (5)
INTRODUCTION
_
|u(x)|
2
dx
_
n 2
2
_
2
_
u(x)
2
|x|
2
dx, u W
1,2
0
() (4)
_
|u(x)|
p
dx
_
n p
p
_
p
_
|u(x)|
p
|x|
p
dx, u W
1,p
0
() (5)
Hardy-Sobolev-Rellich Inequalities
INTRODUCTION
_
|u(x)|
2
dx
_
n 2
2
_
2
_
u(x)
2
|x|
2
dx, u W
1,2
0
() (4)
_
|u(x)|
p
dx
_
n p
p
_
p
_
|u(x)|
p
|x|
p
dx, u W
1,p
0
() (5)
INTRODUCTION
_
|u(x)|
2
dx
_
n 2
2
_
2
_
u(x)
2
|x|
2
dx, u W
1,2
0
() (4)
_
|u(x)|
p
dx
_
n p
p
_
p
_
|u(x)|
p
|x|
p
dx, u W
1,p
0
() (5)
_
|u(x)|
2
dx
n
2
(n 4)
2
16
_
|u(x)|
2
|x|
4
dx, u W
2,2
0
() (6)
INTRODUCTION
_
|u(x)|
2
dx
_
n 2
2
_
2
_
u(x)
2
|x|
2
dx, u W
1,2
0
() (4)
_
|u(x)|
p
dx
_
n p
p
_
p
_
|u(x)|
p
|x|
p
dx, u W
1,p
0
() (5)
_
|u(x)|
2
dx
n
2
(n 4)
2
16
_
|u(x)|
2
|x|
4
dx, u W
2,2
0
() (6)
_
|u(x)|
p
dx
_
n 2p
p
_
p
_
np n
p
_
p
_
|u(x)|
p
|x|
2p
dx (7)
INTRODUCTION
IMPROVEMENT OF INEQUALITY (4)
NOTATIONS
INTRODUCTION
NOTATIONS
INTRODUCTION
NOTATIONS
For t > 0 and 2,
INTRODUCTION
NOTATIONS
For t > 0 and 2,
A
1
(t) = log
R
t
, A
2
(t) = log A
1
(t), . . . A
(t) = log A
1
(t)
INTRODUCTION
NOTATIONS
For t > 0 and 2,
A
1
(t) = log
R
t
, A
2
(t) = log A
1
(t), . . . A
(t) = log A
1
(t)
and
INTRODUCTION
NOTATIONS
For t > 0 and 2,
A
1
(t) = log
R
t
, A
2
(t) = log A
1
(t), . . . A
(t) = log A
1
(t)
and
e
1
= e, e
2
= e
e
1
, . . . e
= e
e
1
INTRODUCTION
THEOREM 1 ( A. Detalla, T. Horiuchi and H. Ando
(2005))
INTRODUCTION
(2005))
INTRODUCTION
(2005))
Assume 2 and n 2. If R sup
|x|e
k
then there
exists sharp remainder terms such that
_
|u(x)|
2
dx
_
n 2
2
_
2
_
u(x)
2
|x|
2
dx +
1
4
_
u(x)
2
|x|
2
_
A
1
(|x|)
+
_
A
1
(|x|)A
2
(|x|)
_
+ +
_
A
1
(|x|)A
2
(|x|) . . . A
k
(|x|)
_
_
dx.
(8)
for any u W
1,2
0
().
INTRODUCTION
_
|u(x)|
2
dx
_
n 2
2
_
2
_
u(x)
2
|x|
2
dx +
1
4
_
u(x)
2
|x|
2
_
A
1
(|x|)
+
_
A
1
(|x|)A
2
(|x|)
_
+ +
_
A
1
(|x|)A
2
(|x|) . . . A
k
(|x|)
_
_
dx (8)
INTRODUCTION
_
|u(x)|
2
dx
_
n 2
2
_
2
_
u(x)
2
|x|
2
dx +
1
4
_
u(x)
2
|x|
2
_
A
1
(|x|)
+
_
A
1
(|x|)A
2
(|x|)
_
+ +
_
A
1
(|x|)A
2
(|x|) . . . A
k
(|x|)
_
_
dx (8)
INTRODUCTION
_
|u(x)|
2
dx
_
n 2
2
_
2
_
u(x)
2
|x|
2
dx +
1
4
_
u(x)
2
|x|
2
_
A
1
(|x|)
+
_
A
1
(|x|)A
2
(|x|)
_
+ +
_
A
1
(|x|)A
2
(|x|) . . . A
k
(|x|)
_
_
dx (8)
REMARK
In inequality (8),
1
4
is best constant for all k-missing terms
and 2 is sharp
INTRODUCTION
INTRODUCTION
THEOREM 2 ( Adimurthi, N. Chaudhuri and M.
Ramaswamy (2001))
Let be a bounded domain in R
n
with 0 and n 2.
INTRODUCTION
Ramaswamy (2001))
n
with 0 and n 2.
Noncritical Case(1 0 depending on
n, p, and R such that for any u W
1,p
0
() and 2
INTRODUCTION
Ramaswamy (2001))
n
with 0 and n 2.
Let R sup
_
|x|e
2
p
_
. Then there exist K > 0 depending on
n, p, and R such that for any u W
1,p
0
() and 2
_
|u(x)|
p
dx
_
n p
p
_
p
_
|u(x)|
p
|x|
p
dx+
K
_
|u(x)|
p
|x|
p
_
log
R
|x|
_
dx
(9)
INTRODUCTION
INTRODUCTION
Ramaswamy (2001))
n
with 0 and n 2.
INTRODUCTION
Ramaswamy (2001))
n
with 0 and n 2.
Critical Case (p = n)
INTRODUCTION
Ramaswamy (2001))
n
with 0 and n 2.
INTRODUCTION
Ramaswamy (2001))
n
with 0 and n 2.
Let R sup
_
|x|e
2
n
_
. Then for any u W
1,n
0
()
INTRODUCTION
Ramaswamy (2001))
n
with 0 and n 2.
Let R sup
_
|x|e
2
n
_
. Then for any u W
1,n
0
()
_
|u(x)|
n
dx
_
n 1
n
_
n
_
|u(x)|
n
|x|
n
_
log
R
|x|
_
n
dx
(10)
INTRODUCTION
Corollary
Let 1 < p < n, and let
F
p
=
_
f : R
+
|f L
loc
( \ {0}) with
limsup
|x|0
|x|
p
f(x)
_
log
1
|x|
_
2
<
_
INTRODUCTION
Corollary
F
p
=
_
f : R
+
|f L
loc
( \ {0}) with
limsup
|x|0
|x|
p
f(x)
_
log
1
|x|
_
2
<
_
INTRODUCTION
Corollary
F
p
=
_
f : R
+
|f L
loc
( \ {0}) with
limsup
|x|0
|x|
p
f(x)
_
log
1
|x|
_
2
<
_
If f F
p
, (f) > 0 such that for u W
1,p
0
()
_
|u|
p
dx
_
n p
p
_
p
_
|u(x)|
p
|x|
2p
dx+(f)
_
|u(x)|
p
f(x)dx
INTRODUCTION
Corollary
F
p
=
_
f : R
+
|f L
loc
( \ {0}) with
limsup
|x|0
|x|
p
f(x)
_
log
1
|x|
_
2
<
_
If f F
p
1,p
0
()
_
|u|
p
dx
_
n p
p
_
p
_
|u(x)|
p
|x|
2p
dx+(f)
_
|u(x)|
p
f(x)dx
If f / F
p
and if |x|
p
f(x)
_
log
1
|x|
_
2
tends to as |x| 0,
then no inequality of the above type can hold.
INTRODUCTION
INTRODUCTION
APPLICATION
The results will be used to analyze the behaviour of the
rst eigenvalue of the weighted eigenvalue problem for the
operator
INTRODUCTION
APPLICATION
operator
INTRODUCTION
APPLICATION
operator
L
u =
_
div
_
|u|
p2
u
_
+

|x|
p
|u|
p2
u
_
INTRODUCTION
APPLICATION
operator
L
u =
_
div
_
|u|
p2
u
_
+

|x|
p
|u|
p2
u
_
as
_
np
p
_
p
.
INTRODUCTION
L
u =
_
div
_
|u|
p2
u
_
+

|x|
p
|u|
p2
u
_
INTRODUCTION
L
u =
_
div
_
|u|
p2
u
_
+

|x|
p
|u|
p2
u
_
L
is related to the variational problem

INTRODUCTION
L
u =
_
div
_
|u|
p2
u
_
+

|x|
p
|u|
p2
u
_
L

INTRODUCTION
L
u =
_
div
_
|u|
p2
u
_
+

|x|
p
|u|
p2
u
_
L

inf
uK
_
_
|u|
p
|u|
p
|x|
p
_
dx
INTRODUCTION
L
u =
_
div
_
|u|
p2
u
_
+

|x|
p
|u|
p2
u
_
L

inf
uK
_
_
|u|
p
|u|
p
|x|
p
_
dx
where K is given by
INTRODUCTION
L
u =
_
div
_
|u|
p2
u
_
+

|x|
p
|u|
p2
u
_
L

inf
uK
_
_
|u|
p
|u|
p
|x|
p
_
dx
where K is given by
K =
_
u W
1,p
0
() :
_
|u(x)|
p
f(x)dx = 1
_
,
f: is a weight function.
INTRODUCTION
L
u =
_
div
_
|u|
p2
u
_
+

|x|
p
|u|
p2
u
_
INTRODUCTION
L
u =
_
div
_
|u|
p2
u
_
+

|x|
p
|u|
p2
u
_
Consider the weighted eigenvalue problem
L
u = |u|
p2
uf in
u = 0 on
INTRODUCTION
L
u =
_
div
_
|u|
p2
u
_
+

|x|
p
|u|
p2
u
_
L
u = |u|
p2
uf in
u = 0 on
INTRODUCTION
L
u =
_
div
_
|u|
p2
u
_
+

|x|
p
|u|
p2
u
_
L
u = |u|
p2
uf in
u = 0 on

_
np
p
_
p
INTRODUCTION
L
u =
_
div
_
|u|
p2
u
_
+

|x|
p
|u|
p2
u
_
L
u = |u|
p2
uf in
u = 0 on

_
np
p
_
p
The expression L
u = |u|
p2
uf is related to the
improved Hardy-Sobolev inequality.
INTRODUCTION
INTRODUCTION
_
|u(x)|
2
dx
n
2
(n 4)
2
16
_
|u(x)|
2
|x|
4
dx, u W
2,2
0
() (6)
INTRODUCTION
_
|u(x)|
2
dx
n
2
(n 4)
2
16
_
|u(x)|
2
|x|
4
dx, u W
2,2
0
() (6)
INTRODUCTION
_
|u(x)|
2
dx
n
2
(n 4)
2
16
_
|u(x)|
2
|x|
4
dx, u W
2,2
0
() (6)
ON GOING RESEARCH
INTRODUCTION
_
|u(x)|
p
dx
_
n 2p
p
_
p
_
np n
p
_
p
_
|u(x)|
p
|x|
2p
dx (7)
INTRODUCTION
_
|u(x)|
p
dx
_
n 2p
p
_
p
_
np n
p
_
p
_
|u(x)|
p
|x|
2p
dx (7)
Here the best constant
_
n2p
p
_
p
_
npn
p
_
p
is given by the
inmum of
INTRODUCTION
_
|u(x)|
p
dx
_
n 2p
p
_
p
_
np n
p
_
p
_
|u(x)|
p
|x|
2p
dx (7)
_
n2p
p
_
p
_
npn
p
_
p
is given by the
inmum of I(u) =
|u|
p
dx
|u(x)|
p
|x|
2p
dx
.
INTRODUCTION
_
|u(x)|
p
dx
_
n 2p
p
_
p
_
np n
p
_
p
_
|u(x)|
p
|x|
2p
dx (7)
_
n2p
p
_
p
_
npn
p
_
p
is given by the
inmum of I(u) =
|u|
p
dx
|u(x)|
p
|x|
2p
dx
.
No extremal function in W
2,p
0
() which attains the inmum
of I(u).
INTRODUCTION
_
|u(x)|
p
dx
_
n 2p
p
_
p
_
np n
p
_
p
_
|u(x)|
p
|x|
2p
dx (7)
_
n2p
p
_
p
_
npn
p
_
p
is given by the
inmum of I(u) =
|u|
p
dx
|u(x)|
p
|x|
2p
dx
.
2,p
0
of I(u).
INTRODUCTION
_
|u(x)|
p
dx
_
n 2p
p
_
p
_
np n
p
_
p
_
|u(x)|
p
|x|
2p
dx (7)
_
n2p
p
_
p
_
npn
p
_
p
is given by the
inmum of I(u) =
|u|
p
dx
|u(x)|
p
|x|
2p
dx
.
2,p
0
of I(u).
The candidates of the extremals are singular at the origin
which are not in W
2,p
0
().
INTRODUCTION
_
|u(x)|
p
dx
_
n 2p
p
_
p
_
np n
p
_
p
_
|u(x)|
p
|x|
2p
dx (7)
_
n2p
p
_
p
_
npn
p
_
p
is given by the
inmum of I(u) =
|u|
p
dx
|u(x)|
p
|x|
2p
dx
.
2,p
0
of I(u).
which are not in W
2,p
0
().
INTRODUCTION
_
|u(x)|
p
dx
_
n 2p
p
_
p
_
np n
p
_
p
_
|u(x)|
p
|x|
2p
dx (7)
_
n2p
p
_
p
_
npn
p
_
p
is given by the
inmum of I(u) =
|u|
p
dx
|u(x)|
p
|x|
2p
dx
.
2,p
0
of I(u).
which are not in W
2,p
0
().
Therefore it is natural to consider that there exists a
missing terms in the right hand side of (7).
INTRODUCTION
OBJECTIVE
INTRODUCTION
OBJECTIVE
To achieve an optimal improvement of inequality (7) by
adding sharp terms in the right hand side involving a
singular weight of type
_
log
1
|x|
_
2
INTRODUCTION
OBJECTIVE
_
log
1
|x|
_
2
INTRODUCTION
OBJECTIVE
_
log
1
|x|
_
2
Optimal in the sense that the improved inequality holds for
this weight function
_
log
1
|x|
_
2
but fails for any weight
more singular than this.
INTRODUCTION
MAIN RESULTS
INTRODUCTION
MAIN RESULTS
(2004))
Let n 3, 0 and is a bounded domain in R
n
.
INTRODUCTION
MAIN RESULTS
(2004))
n
.
Noncritical Case(1 0 such that if R > sup
|x| and
for any u W
2,p
0
(),
INTRODUCTION
MAIN RESULTS
(2004))
n
.
n
2
)
|x| and
for any u W
2,p
0
(),
_
|u|
p
dx
_
n 2p
p
_
p
_
np n
p
_
p
_
|u(x)|
p
|x|
2p
dx
+ C
_
|u(x)|
p
|x|
2p
_
log
R
|x|
_
2
dx
(11)
INTRODUCTION
MAIN RESULTS
INTRODUCTION
MAIN RESULTS
(2004))
n
.
INTRODUCTION
MAIN RESULTS
(2004))
n
.
Critical Case(p =
n
2
)
INTRODUCTION
MAIN RESULTS
(2004))
n
.
Critical Case(p =
n
2
)
INTRODUCTION
MAIN RESULTS
(2004))
n
.
Critical Case(p =
n
2
)
There exists K
= K
(n) > 0 and C
= C
(n) > 0 such

that if R > K
sup
|x| and for any u W

2,
n
2
0
(),
INTRODUCTION
MAIN RESULTS
(2004))
n
.
Critical Case(p =
n
2
)
There exists K
= K
(n) > 0 and C
= C
(n) > 0 such

that if R > K
sup
|x| and for any u W

2,
n
2
0
(),
_
|u|
n
2
dx
_
n 2
n
_
n
_
|u(x)|
n
2
|x|
n
_
log
R
|x|
_
n
2
dx
+ C
|u(x)|
n
2
|x|
n
_
log
R
|x|
_
n
2
1
dx
(12)
INTRODUCTION
_
|u|
p
dx
_
n 2p
p
_
p
_
np n
p
_
p
_
|u(x)|
p
|x|
2p
dx
+ C
_
|u(x)|
p
|x|
2p
_
log
R
|x|
_
2
dx (11)
INTRODUCTION
_
|u|
p
dx
_
n 2p
p
_
p
_
np n
p
_
p
_
|u(x)|
p
|x|
2p
dx
+ C
_
|u(x)|
p
|x|
2p
_
log
R
|x|
_
2
dx (11)
REMARK 1
In inequality (11) the exponent 2 of the weight function is
optimal.
INTRODUCTION
_
|u|
n
2
dx
_
n 2
n
_
n
_
|u(x)|
n
2
|x|
n
_
log
R
|x|
_
n
2
dx
+ C
|u(x)|
n
2
|x|
n
_
log
R
|x|
_
n
2
1
dx (12)
INTRODUCTION
_
|u|
n
2
dx
_
n 2
n
_
n
_
|u(x)|
n
2
|x|
n
_
log
R
|x|
_
n
2
dx
+ C
|u(x)|
n
2
|x|
n
_
log
R
|x|
_
n
2
1
dx (12)
REMARK 2
In inequality (12) the exponent
n
2
of the weight function is
optimal and the constant
_
n2
n
_
n
is sharp.
INTRODUCTION
_
|u|
p
dx
_
n 2p
p
_
p
_
np n
p
_
p
_
|u(x)|
p
|x|
2p
dx
+ C
_
|u(x)|
p
|x|
2p
_
log
R
|x|
_
2
dx (11)
_
|u|
n
2
dx
_
n 2
n
_
n
_
|u(x)|
n
2
|x|
n
_
log
R
|x|
_
n
2
dx
+ C
|u(x)|
n
2
|x|
n
_
log
R
|x|
_
n
2
1
dx (12)
INTRODUCTION
_
|u|
p
dx
_
n 2p
p
_
p
_
np n
p
_
p
_
|u(x)|
p
|x|
2p
dx
+ C
_
|u(x)|
p
|x|
2p
_
log
R
|x|
_
2
dx (11)
_
|u|
n
2
dx
_
n 2
n
_
n
_
|u(x)|
n
2
|x|
n
_
log
R
|x|
_
n
2
dx
+ C
|u(x)|
n
2
|x|
n
_
log
R
|x|
_
n
2
1
dx (12)
REMARK 3
C and C
depends on R in a weak sense since

_
log
R
|x|
_
2
and
_
log
R
|x|
_
n
2
1
tends to zero as R .
INTRODUCTION
n
2
)
|x| and
for any u W
2,p
0
(),
_
|u|
p
dx
_
n 2p
p
_
p
_
np n
p
_
p
_
|u(x)|
p
|x|
2p
dx
+ C
_
|u(x)|
p
|x|
2p
_
log
R
|x|
_
2
dx (11)
INTRODUCTION
n
2
)
|x| and
for any u W
2,p
0
(),
_
|u|
p
dx
_
n 2p
p
_
p
_
np n
p
_
p
_
|u(x)|
p
|x|
2p
dx
+ C
_
|u(x)|
p
|x|
2p
_
log
R
|x|
_
2
dx (11)
INTRODUCTION
n
2
)
|x| and
for any u W
2,p
0
(),
_
|u|
p
dx
_
n 2p
p
_
p
_
np n
p
_
p
_
|u(x)|
p
|x|
2p
dx
+ C
_
|u(x)|
p
|x|
2p
_
log
R
|x|
_
2
dx (11)
REMARK 4
At rst we prove inequality (11) assuming that
R > e
1
p
sup
|x| because of technical reason. Namely, the

weight function g(r) = r
2p
_
log
R
r
_
2
should be monotone
decreasing. Then we can extend (11) for any R > sup
|x|
INTRODUCTION
Critical Case(p =
n
2
): There exists K
= K
(n) > 0 and

C
= C
(n) > 0 such that if R > K
sup
|x|,
_
|u|
n
2
dx
_
n 2
n
_
n
_
|u(x)|
n
2
|x|
n
_
log
R
|x|
_
n
2
dx
+ C
|u(x)|
n
2
|x|
n
_
log
R
|x|
_
n
2
1
dx (12)
INTRODUCTION
Critical Case(p =
n
2
): There exists K
= K
(n) > 0 and

C
= C
sup
|x|,
_
|u|
n
2
dx
_
n 2
n
_
n
_
|u(x)|
n
2
|x|
n
_
log
R
|x|
_
n
2
dx
+ C
|u(x)|
n
2
|x|
n
_
log
R
|x|
_
n
2
1
dx (12)
INTRODUCTION
Critical Case(p =
n
2
): There exists K
= K
(n) > 0 and

C
= C
sup
|x|,
_
|u|
n
2
dx
_
n 2
n
_
n
_
|u(x)|
n
2
|x|
n
_
log
R
|x|
_
n
2
dx
+ C
|u(x)|
n
2
|x|
n
_
log
R
|x|
_
n
2
1
dx (12)
REMARK 4
In the proof of the critical case (12), we used decreasing
rearrangement argument, hence g
(r) = r
n
_
log
R
r
_
n
2
1
should be monotone decreasing and R re
1
2
+
1
n
.
INTRODUCTION
Critical Case(p =
n
2
): There exists K
= K
(n) > 0 and

C
= C
sup
|x|,
_
|u|
n
2
dx
_
n 2
n
_
n
_
|u(x)|
n
2
|x|
n
_
log
R
|x|
_
n
2
dx
+ C
|u(x)|
n
2
|x|
n
_
log
R
|x|
_
n
2
1
dx (12)
REMARK 4
(r) = r
n
_
log
R
r
_
n
2
1
1
2
+
1
n
.
INTRODUCTION
Critical Case(p =
n
2
): There exists K
= K
(n) > 0 and

C
= C
sup
|x|,
_
|u|
n
2
dx
_
n 2
n
_
n
_
|u(x)|
n
2
|x|
n
_
log
R
|x|
_
n
2
dx
+ C
|u(x)|
n
2
|x|
n
_
log
R
|x|
_
n
2
1
dx (12)
REMARK 4
(r) = r
n
_
log
R
r
_
n
2
1
1
2
+
1
n
.Moreover
we need the condition to absorb the error terms in the right
hand side of (12) with C
> 0, hence K
e
1
2
+
1
n
INTRODUCTION
Corollary
Let 1 < p <
n
2
, and let
F
p
=
_
f : R
+
|f L
loc
( \ {0}) with
limsup
|x|0
|x|
2p
f(x)
_
log
1
|x|
_
2
<
_
INTRODUCTION
Corollary
Let 1 < p <
n
2
, and let
F
p
=
_
f : R
+
|f L
loc
( \ {0}) with
limsup
|x|0
|x|
2p
f(x)
_
log
1
|x|
_
2
<
_
INTRODUCTION
Corollary
Let 1 < p <
n
2
, and let
F
p
=
_
f : R
+
|f L
loc
( \ {0}) with
limsup
|x|0
|x|
2p
f(x)
_
log
1
|x|
_
2
<
_
If f F
p
2,p
0
()
_
|u|
p
dx
n,p
_
|u(x)|
p
|x|
2p
dx + (f)
_
|u(x)|
p
f(x)dx
(13)
INTRODUCTION
Corollary
Let 1 < p <
n
2
, and let
F
p
=
_
f : R
+
|f L
loc
( \ {0}) with
limsup
|x|0
|x|
2p
f(x)
_
log
1
|x|
_
2
<
_
If f F
p
2,p
0
()
_
|u|
p
dx
n,p
_
|u(x)|
p
|x|
2p
dx + (f)
_
|u(x)|
p
f(x)dx
(13)
If f / F
p
and if |x|
2p
f(x)
_
log
1
|x|
_
2
tends to as |x| 0,
then no inequality of type (13) can hold.
INTRODUCTION
INTRODUCTION
APPLICATION
We use the results to determine exactly when the rst
eigenvalue of the weighted eigenvalue problem for the
operator
INTRODUCTION
APPLICATION
operator
INTRODUCTION
APPLICATION
operator
L
u =
_
|u|
p2
u
_

|x|
2p
|u|
p2
u
INTRODUCTION
APPLICATION
operator
L
u =
_
|u|
p2
u
_

|x|
2p
|u|
p2
u
will tend to 0 as
_
n2p
p
_
p
_
npn
p
_
p
.
INTRODUCTION
L
u =
_
|u|
p2
u
_

|x|
2p
|u|
p2
u
INTRODUCTION
L
u =
_
|u|
p2
u
_

|x|
2p
|u|
p2
u
L

INTRODUCTION
L
u =
_
|u|
p2
u
_

|x|
2p
|u|
p2
u
L

INTRODUCTION
L
u =
_
|u|
p2
u
_

|x|
2p
|u|
p2
u
L

inf
uK
_
_
|u|
p
|u|
p
|x|
2p
_
dx
INTRODUCTION
L
u =
_
|u|
p2
u
_

|x|
2p
|u|
p2
u
L

inf
uK
_
_
|u|
p
|u|
p
|x|
2p
_
dx
where K is given by
INTRODUCTION
L
u =
_
|u|
p2
u
_

|x|
2p
|u|
p2
u
L

inf
uK
_
_
|u|
p
|u|
p
|x|
2p
_
dx
where K is given by
K =
_
u W
2,p
() W
1,p
0
() :
_
|u(x)|
p
f(x)dx = 1
_
,
f: is a weight function which will be specied later.
INTRODUCTION
L
u =
_
|u|
p2
u
_

|x|
2p
|u|
p2
u
INTRODUCTION
L
u =
_
|u|
p2
u
_

|x|
2p
|u|
p2
u
L
u = |u|
p2
uf in
u = u = 0 on
INTRODUCTION
L
u =
_
|u|
p2
u
_

|x|
2p
|u|
p2
u
L
u = |u|
p2
uf in
u = u = 0 on
INTRODUCTION
L
u =
_
|u|
p2
u
_

|x|
2p
|u|
p2
u
L
u = |u|
p2
uf in
u = u = 0 on

_
n2p
p
_
p
_
npn
p
_
p
INTRODUCTION
L
u =
_
|u|
p2
u
_

|x|
2p
|u|
p2
u
L
u = |u|
p2
uf in
u = u = 0 on

_
n2p
p
_
p
_
npn
p
_
p
INTRODUCTION
L
u =
_
|u|
p2
u
_

|x|
2p
|u|
p2
u
L
u = |u|
p2
uf in
u = u = 0 on

_
n2p
p
_
p
_
npn
p
_
p
The expression L
u = |u|
p2
uf is related to the
improved Rellich inequality.
INTRODUCTION
REARRANGEMENT
For a domain we dene a ball
such that |
| = ||
with center at the origin.
INTRODUCTION
REARRANGEMENT
such that |
| = ||
INTRODUCTION
REARRANGEMENT
such that |
| = ||
u
(x) : spherically symmetric decreasing rearrangement of

function u(x)
INTRODUCTION
REARRANGEMENT
such that |
| = ||
u
(x) : spherically symmetric decreasing rearrangement of

function u(x)
u
(x) = inf
_
t 0 : (t) <

B|x|
n
_
in
(t) = |{x : |u(x)| > t}|
B: Volume of unit ball

INTRODUCTION
LEMMA (Talente)
Let f C
0
(). If u is a solution of
u = f in
u = 0 on
and v is a solution of
v = f
in
v = 0 on
v u
.
INTRODUCTION
From this lemma we can show that
_
|u|
p
dx =
_
|v|
p
dx
_
|u|
p
|x|
2p
dx
_
|v|
p
|x|
2p
dx
INTRODUCTION
_
|u|
p
dx =
_
|v|
p
dx
_
|u|
p
|x|
2p
dx
_
|v|
p
|x|
2p
dx
INTRODUCTION
_
|u|
p
dx =
_
|v|
p
dx
_
|u|
p
|x|
2p
dx
_
|v|
p
|x|
2p
dx
Hence we have
_
|u|
p
dx
_
|u|
p
|x|
2p
dx
|v|
p
dx
_
|v|
p
|x|
2p
dx
INTRODUCTION
_
|u|
p
dx =
_
|v|
p
dx
_
|u|
p
|x|
2p
dx
_
|v|
p
|x|
2p
dx
Hence we have
_
|u|
p
dx
_
|u|
p
|x|
2p
dx
|v|
p
dx
_
|v|
p
|x|
2p
dx
From this we can assume that u is radial and is a ball.
INTRODUCTION
ASSUMPTIONS
: unit ball B
1
u : radially nonincreasing,
u > 0
u > 0
INTRODUCTION
OUTLINE OF THE PROOF
1. Noncritical Case(1 < p <
n
2
)
INTRODUCTION
n
2
)
INTRODUCTION
n
2
)
1a) We prove inequality (11)
_
|u|
p
dx
_
n 2p
p
_
p
_
np n
p
_
p
_
|u(x)|
p
|x|
2p
dx
+ C
_
|u(x)|
p
|x|
2p
_
log
R
|x|
_
2
dx (11)
INTRODUCTION
n
2
)
_
|u|
p
dx
_
n 2p
p
_
p
_
np n
p
_
p
_
|u(x)|
p
|x|
2p
dx
+ C
_
|u(x)|
p
|x|
2p
_
log
R
|x|
_
2
dx (11)
1b) We show the sharpness of
_
n2p
p
_
p
_
npn
p
_
p
INTRODUCTION
n
2
)
_
|u|
p
dx
_
n 2p
p
_
p
_
np n
p
_
p
_
|u(x)|
p
|x|
2p
dx
+ C
_
|u(x)|
p
|x|
2p
_
log
R
|x|
_
2
dx (11)
_
n2p
p
_
p
_
npn
p
_
p
1c) We show the optimality of the exponent 2.
INTRODUCTION
2. Critical Case(p =
n
2
)
INTRODUCTION
n
2
)
INTRODUCTION
n
2
)
_
|u|
n
2
dx
_
n 2
n
_
n
_
|u(x)|
n
2
|x|
n
_
log
R
|x|
_
n
2
dx
+ C
|u(x)|
n
2
|x|
n
_
log
R
|x|
_
n
2
1
dx (12)
INTRODUCTION
n
2
)
_
|u|
n
2
dx
_
n 2
n
_
n
_
|u(x)|
n
2
|x|
n
_
log
R
|x|
_
n
2
dx
+ C
|u(x)|
n
2
|x|
n
_
log
R
|x|
_
n
2
1
dx (12)
_
n2
n
_
n
INTRODUCTION
n
2
)
_
|u|
n
2
dx
_
n 2
n
_
n
_
|u(x)|
n
2
|x|
n
_
log
R
|x|
_
n
2
dx
+ C
|u(x)|
n
2
|x|
n
_
log
R
|x|
_
n
2
1
dx (12)
_
n2
n
_
n
2c) We show the optimality of the exponent
n
2
.
INTRODUCTION
LEMMA 2
For any R > 1, q 0, (0, 1) satisfying 2 1 + q = 0
_
1
0
|h
(r)|
2
_
log
R
r
_
q
rdr
2
_
1
0
|h(r)|
2
_
log
R
r
_
q2
dr
r
(14)
holds for any h C([0, 1]) C
1
(0, 1), with h(0) = h(1) = 0.
INTRODUCTION
1a) PROOF OF INEQUALITY (11)
For u C
2
0
(B
1
), u > 0, radially nonincreasing , we dene
v(r) = u(r)r
n
p
2
r = |x|.
then apply this to
INTRODUCTION
For u C
2
0
(B
1
v(r) = u(r)r
n
p
2
r = |x|.
then apply this to
INTRODUCTION
For u C
2
0
(B
1
v(r) = u(r)r
n
p
2
r = |x|.
then apply this to
_
B
1
|u|
p
dx
_
n 2p
p
_
p
_
np n
p
_
p
_
B
1
|u(x)|
p
|x|
2p
dx
we get
INTRODUCTION
_
B
1
|u|
p
dx
_
n 2p
p
_
p
_
np n
p
_
p
_
B
1
|u(x)|
p
|x|
2p
dx
4
_
n 2p
p
_
p
_
np n
p
_
p
_
p 1
p
__
1
0
|
_
v
n
2
(r)
_
|
2
rdr
By Lemma 2
_
v =
1
2
, q = 0
_
INTRODUCTION
_
B
1
|u|
p
dx
_
n 2p
p
_
p
_
np n
p
_
p
_
B
1
|u(x)|
p
|x|
2p
dx
4
_
n 2p
p
_
p
_
np n
p
_
p
_
p 1
p
__
1
0
|
_
v
n
2
(r)
_
|
2
rdr
By Lemma 2
_
v =
1
2
, q = 0
_
INTRODUCTION
_
B
1
|u|
p
dx
_
n 2p
p
_
p
_
np n
p
_
p
_
B
1
|u(x)|
p
|x|
2p
dx
4
_
n 2p
p
_
p
_
np n
p
_
p
_
p 1
p
__
1
0
|
_
v
n
2
(r)
_
|
2
rdr
By Lemma 2
_
v =
1
2
, q = 0
_
LEMMA 2
_
1
0
|h
(r)|
2
_
log
R
r
_
q
rdr
2
_
1
0
|h(r)|
2
_
log
R
r
_
q2
dr
r
INTRODUCTION
we get
_
B
1
|u|
p
dx
_
n 2p
p
_
p
_
np n
p
_
p
_
B
1
|u(x)|
p
|x|
2p
dx
+ C
_
B
1
|u(x)|
p
|x|
2p
_
log
R
|x|
_
2
dx (11)
INTRODUCTION
we get
_
B
1
|u|
p
dx
_
n 2p
p
_
p
_
np n
p
_
p
_
B
1
|u(x)|
p
|x|
2p
dx
+ C
_
B
1
|u(x)|
p
|x|
2p
_
log
R
|x|
_
2
dx (11)
INTRODUCTION
we get
_
B
1
|u|
p
dx
_
n 2p
p
_
p
_
np n
p
_
p
_
B
1
|u(x)|
p
|x|
2p
dx
+ C
_
B
1
|u(x)|
p
|x|
2p
_
log
R
|x|
_
2
dx (11)
where C =
_
n2p
p
_
p
_
npn
p
_
p
_
p1
p
_
INTRODUCTION
For > 0 suciently small, let us dene
u
=
_
_
0, 0 < r <
2
log
r
2
r
np
p
log
1
,
2
< r <
log
1
r
r
np
p
log
1
, < r < 1
INTRODUCTION
Let w
=
_
1
r
u
()d. Direct calculation gives

INTRODUCTION
Let w
=
_
1
r
u

INTRODUCTION
Let w
=
_
1
r
u

w
=
_
_
_
p
n2p
_
2
12
2
n
p
+
2(2
n
p
)
log
1
, 0 < r <
2
p
n2p
r
2
n
p
log
r
2
log
1
+
_
p
n2p
_
2
12
2
n
p
+r
2
n
p
log
1
,
2
< r <
p
n2p
r
2
n
p
log
1
r
log
1
+
_
p
n2p
_
2
1r
2
n
p
log
1
, < r < 1
INTRODUCTION
w
=
_
_
0, 0 < r <
2
1
p
_
r
n
p
_
p + n(1 p) log
r
2
_
_
_
log
1
_
1
,
2
< r <
1
p
_
r
n
p
_
p + n(1 p) log
1
r
_
_
_
log
1
_
1
, < r < 1
INTRODUCTION
Direct calculation gives
INTRODUCTION
INTRODUCTION
_
B
1
|w
|
p
dx =
2
p + 1
_
n(p 1)
p
_
p
n
log
1
+O
_
_
log
1
_
1
_
_
B
1
|w
|
p
|x|
2p
dx
2
p + 1
_
p
n 2p
_
p
n
log
1
+ O
_
_
log
1
_
1
_
INTRODUCTION
_
B
1
|w
|
p
dx
_
n 2p
p
_
p
_
np n
p
_
p
_
B
|w
|
p
|x|
2p
dx
O
_
_
log
1
_
1
_
INTRODUCTION
_
B
1
|w
|
p
dx
_
n 2p
p
_
p
_
np n
p
_
p
_
B
|w
|
p
|x|
2p
dx
O
_
_
log
1
_
1
_
INTRODUCTION
_
B
1
|w
|
p
dx
_
n 2p
p
_
p
_
np n
p
_
p
_
B
|w
|
p
|x|
2p
dx
O
_
_
log
1
_
1
_
and
INTRODUCTION
_
B
1
|w
|
p
dx
_
n 2p
p
_
p
_
np n
p
_
p
_
B
|w
|
p
|x|
2p
dx
O
_
_
log
1
_
1
_
and
_
B
1
|w
|
p
|x|
2p
_
log
R
|x|
_
O
_
_
log
1
_
1
_
INTRODUCTION
1b. SHARPNESS OF
_
n2p
p
_
p
_
npn
p
_
p
lim
0
I(w
) = lim
0
_
B
1
|w
|
p
dx
_
B
1
|w
|
p
|x|
2p
dx
_
n 2p
p
_
p
_
np n
p
_
p
INTRODUCTION
1b. SHARPNESS OF
_
n2p
p
_
p
_
npn
p
_
p
lim
0
I(w
) = lim
0
_
B
1
|w
|
p
dx
_
B
1
|w
|
p
|x|
2p
dx
_
n 2p
p
_
p
_
np n
p
_
p
INTRODUCTION
1b. SHARPNESS OF
_
n2p
p
_
p
_
npn
p
_
p
lim
0
I(w
) = lim
0
_
B
1
|w
|
p
dx
_
B
1
|w
|
p
|x|
2p
dx
_
n 2p
p
_
p
_
np n
p
_
p
But by Rellich inequality
lim
0
I(w
)
_
n 2p
p
_
p
_
np n
p
_
p
INTRODUCTION
1b. SHARPNESS OF
_
n2p
p
_
p
_
npn
p
_
p
lim
0
I(w
) = lim
0
_
B
1
|w
|
p
dx
_
B
1
|w
|
p
|x|
2p
dx
_
n 2p
p
_
p
_
np n
p
_
p
But by Rellich inequality
lim
0
I(w
)
_
n 2p
p
_
p
_
np n
p
_
p
hence
lim
0
I(w
) =
_
n 2p
p
_
p
_
np n
p
_
p
INTRODUCTION
1c. OPTIMALITY OF THE EXPONENT 2
Assume 0 < < 2.
INTRODUCTION
Assume 0 < < 2.
INTRODUCTION
Assume 0 < < 2. Optimality will follow if we can show
for a unit ball B
1
that inf
uW
2,p
0
(B
1
)\{0}
I
(u) = 0
INTRODUCTION
for a unit ball B
1
that inf
uW
2,p
0
(B
1
)\{0}
I
(u) = 0 where
I
(u) =
_
B
1
|u|
p
dx
_
n2p
p
_
p
_
npn
p
_
p
_
B
1
|u|
p
|x|
2p
dx
_
B
1
|u|
p
|x|
2p
_
log
R
|x|
_
dx
INTRODUCTION
for a unit ball B
1
that inf
uW
2,p
0
(B
1
)\{0}
I
(u) = 0 where
I
(u) =
_
B
1
|u|
p
dx
_
n2p
p
_
p
_
npn
p
_
p
_
B
1
|u|
p
|x|
2p
dx
_
B
1
|u|
p
|x|
2p
_
log
R
|x|
_
dx
Hence using a family w
W
2,p
0
(B
1
)
INTRODUCTION
for a unit ball B
1
that inf
uW
2,p
0
(B
1
)\{0}
I
(u) = 0 where
I
(u) =
_
B
1
|u|
p
dx
_
n2p
p
_
p
_
npn
p
_
p
_
B
1
|u|
p
|x|
2p
dx
_
B
1
|u|
p
|x|
2p
_
log
R
|x|
_
dx
W
2,p
0
(B
1
) we have
lim
0
I
(w
) = 0.
INTRODUCTION
for a unit ball B
1
that inf
uW
2,p
0
(B
1
)\{0}
I
(u) = 0 where
I
(u) =
_
B
1
|u|
p
dx
_
n2p
p
_
p
_
npn
p
_
p
_
B
1
|u|
p
|x|
2p
dx
_
B
1
|u|
p
|x|
2p
_
log
R
|x|
_
dx
W
2,p
0
(B
1
) we have
lim
0
I
(w
) = 0. Thus optimality follow. i.e. 2.

INTRODUCTION
LEMMA 3
Assume f C
2
(B
1
) and u C
2
0
(B
1
) are radial satisfying
f(r) > 0, f(r) 0, u(r) > 0, and u > 0 where r = |x|.
Set u(r) = f(r)v(r), then for any u C
2
0
(B
1
)
INTRODUCTION
LEMMA 3
_
B
1
|u|
n
2
dx
n(n 2)
4

n
_
1
0
(v
(r))
2
v
n4
2
(r)r
n1
|f(r)|
n2
2
f(r)dr
+
n
_
1
0
v
n
2
(r)
_
r
n1
|f(r)|
n
2
+
r
_
r
n1
_
|f(r)|
n2
2
f
(r)
r
|f(r)|
n2
2
f(r)
___
dr
INTRODUCTION
2a. PROOF OF INEQUALITY (12)
From Lemma 3, we denote
S
1
=
n(n 2)
4

n
_
1
0
(v
(r))
2
v
n4
2
(r)r
n1
|f(r)|
n2
2
f(r)dr
and
S
2
=
n
_
1
0
v
n
2
(r)
_
r
n1
|f(r)|
n
2
+
r
_
r
n1
_
|f(r)|
n2
2
f
(r)
r
|f(r)|
n2
2
f(r)
___
dr
INTRODUCTION
Then
_
B
1
|u|
n
2
dx S
1
+ S
2
.
INTRODUCTION
Then
_
B
1
|u|
n
2
dx S
1
+ S
2
.
INTRODUCTION
Then
_
B
1
|u|
n
2
dx S
1
+ S
2
. For f(r) =
_
log
R
r
_
a
,
0 < a < 1
INTRODUCTION
Then
_
B
1
|u|
n
2
dx S
1
+ S
2
. For f(r) =
_
log
R
r
_
a
,
0 < a < 1
S
1

a
n2
2
(1 a)
2
(n 2)
n
2
4

n
_
1
0
u
n
2
_
log
R
r
_
n
2
1
dr
r
S
2

a
n2
2
(1 a)(n 2)
n
2
+1
2

n
_
1
0
u
n
2
_
log
R
r
_
n
2
_
1 + O
_
log
R
r
_
2
_
dr
r
INTRODUCTION
Then
_
B
1
|u|
n
2
dx S
1
+ S
2
. For f(r) =
_
log
R
r
_
a
,
0 < a < 1
S
1

a
n2
2
(1 a)
2
(n 2)
n
2
4

n
_
1
0
u
n
2
_
log
R
r
_
n
2
1
dr
r
S
2

a
n2
2
(1 a)(n 2)
n
2
+1
2

n
_
1
0
u
n
2
_
log
R
r
_
n
2
_
1 + O
_
log
R
r
_
2
_
dr
r
set Q(a) = a
n2
2
(1 a),
INTRODUCTION
Then
_
B
1
|u|
n
2
dx S
1
+ S
2
. For f(r) =
_
log
R
r
_
a
,
0 < a < 1
S
1

a
n2
2
(1 a)
2
(n 2)
n
2
4

n
_
1
0
u
n
2
_
log
R
r
_
n
2
1
dr
r
S
2

a
n2
2
(1 a)(n 2)
n
2
+1
2

n
_
1
0
u
n
2
_
log
R
r
_
n
2
_
1 + O
_
log
R
r
_
2
_
dr
r
set Q(a) = a
n2
2
(1 a), Q takes its maximum at a =
n2
2
INTRODUCTION
_
B
1
|u|
n
2
dx
_
n 2
n
_
n
_
B
1
|u(x)|
n
2
|x|
n
_
log
R
|x|
_
n
2
dx
+ C
_
B
1
|u(x)|
n
2
|x|
n
_
log
R
|x|
_
n
2
1
dx (12)
INTRODUCTION
_
B
1
|u|
n
2
dx
_
n 2
n
_
n
_
B
1
|u(x)|
n
2
|x|
n
_
log
R
|x|
_
n
2
dx
+ C
_
B
1
|u(x)|
n
2
|x|
n
_
log
R
|x|
_
n
2
1
dx (12)
INTRODUCTION
_
B
1
|u|
n
2
dx
_
n 2
n
_
n
_
B
1
|u(x)|
n
2
|x|
n
_
log
R
|x|
_
n
2
dx
+ C
_
B
1
|u(x)|
n
2
|x|
n
_
log
R
|x|
_
n
2
1
dx (12)
where C
=
_
n2
n
_
n
_
(n 2)
1
k(log R)
1
_
INTRODUCTION
_
B
1
|u|
n
2
dx
_
n 2
n
_
n
_
B
1
|u(x)|
n
2
|x|
n
_
log
R
|x|
_
n
2
dx
+ C
_
B
1
|u(x)|
n
2
|x|
n
_
log
R
|x|
_
n
2
1
dx (12)
where C
=
_
n2
n
_
n
_
(n 2)
1
k(log R)
1
_
> 0
INTRODUCTION
_
B
1
|u|
n
2
dx
_
n 2
n
_
n
_
B
1
|u(x)|
n
2
|x|
n
_
log
R
|x|
_
n
2
dx
+ C
_
B
1
|u(x)|
n
2
|x|
n
_
log
R
|x|
_
n
2
1
dx (12)
where C
=
_
n2
n
_
n
_
(n 2)
1
k(log R)
1
_
> 0 if
R > e
(n2)
k
,

k =

k(n)
INTRODUCTION
2b. SHARPNESS OF
_
n2
n
_
n
To show sharpness, we use the test function
z
=
_
log
1
r +
_
n2
n
_
log
1
1 +
_
n2
n
INTRODUCTION
2b. SHARPNESS OF
_
n2
n
_
n
z
=
_
log
1
r +
_
n2
n
_
log
1
1 +
_
n2
n
INTRODUCTION
2b. SHARPNESS OF
_
n2
n
_
n
z
=
_
log
1
r +
_
n2
n
_
log
1
1 +
_
n2
n
then we can show
lim
0
_
B
1
|z
|
n
2
dx
_
B
1
|z
|
n
2
|x|
n
_
log
R
|x|
_
n
2
dx
=
_
n 2
n
_
n
INTRODUCTION
2c. OPTIMALITY OF THE EXPONENT
n
2
We use the same test function u
with p =
n
2
, and
w
=
_
1
r
u
()d. Then for 0 < <

n
2
lim
0
_
B
1
|w
|
n
2
dx
_
B
1
|w
|
n
2
|x|
n
_
log
R
|x|
_
dx
= 0
Thus optimality follow. i.e.
n
2
INTRODUCTION
APPLICATION
Consider the weighted eigenvalue problem with a singular
weight
_
|u|
p2
u
_

|x|
2p
|u|
p2
u = |u|
p2
uf in
u = u = 0 on
(15)
Here f F
p
F
p
=
_
f : R
+
| lim
|x|0
|x|
2p
f(x) = 0, f L
loc
_
\ {0}
_
_
,
1 < p <
n
2
, 0 <
_
n2p
p
_
p
_
npn
p
_
p
and R.
INTRODUCTION
We look for a weak solution
u W = W
2,p
() W
1,p
0
()
of problem 15 and study the asymptotic behaviour of the
rst eigenvalues for dierent singular weights as increases
to
_
n2p
p
_
p
_
npn
p
_
p
.
INTRODUCTION
We look for a weak solution
u W = W
2,p
() W
1,p
0
()
of problem 15 and study the asymptotic behaviour of the
rst eigenvalues for dierent singular weights as increases
to
_
n2p
p
_
p
_
npn
p
_
p
.
Denition
u W is said to be a weak solution of (15) i for any
C
2
(
) with = 0 on
_
_
|u|
p2
u

|x|
2p
|u|
p2
u
_
dx =
_
|u|
p2
ufdx.
INTRODUCTION
LEMMA
For u W v W such that v > 0 and satises
_
|u|
p
dx
_
|u|
p
|x|
2p
dx
_
|u|
p
fdx

_
|v|
p
dx
_
|v|
p
|x|
2p
dx
_
|v|
p
fdx
.
INTRODUCTION
LEMMA
For u W v W such that v > 0 and satises
_
|u|
p
dx
_
|u|
p
|x|
2p
dx
_
|u|
p
fdx

_
|v|
p
dx
_
|v|
p
|x|
2p
dx
_
|v|
p
fdx
.
REMARK
Since is rst eigenvalue and u is the corresponding
eigenfunction, by using the above lemma, we can assume
u > 0 in . Then by the elliptic regularity theory, u is
smooth near the boundary. From the denition of weak
solution one can derive the boundary condition of (15) by
using integration by parts.
INTRODUCTION
THEOREM
For all 1 0.
INTRODUCTION
THEOREM
For all 1 0.
INTRODUCTION
THEOREM
For all 1 0.
Moreover, as
_
n2p
p
_
p
_
npn
p
_
p
,
INTRODUCTION
THEOREM
For all 1 0.
Moreover, as
_
n2p
p
_
p
_
npn
p
_
p
,
If limsup
|x|0
|x|
2p
f(x) = 0,
1
(f) (f) 0
INTRODUCTION
THEOREM
For all 1 0.
Moreover, as
_
n2p
p
_
p
_
npn
p
_
p
,
If limsup
|x|0
|x|
2p
f(x) = 0,
1
(f) (f) 0
If limsup
|x|0
|x|
2p
f(x)
_
log
1
|x|
_
2
< , (f) > 0
INTRODUCTION
THEOREM
For all 1 0.
Moreover, as
_
n2p
p
_
p
_
npn
p
_
p
,
If limsup
|x|0
|x|
2p
f(x) = 0,
1
(f) (f) 0
If limsup
|x|0
|x|
2p
f(x)
_
log
1
|x|
_
2
< , (f) > 0
If limsup
|x|0
|x|
2p
f(x)
_
log
1
|x|
_
2
= , (f) = 0
INTRODUCTION
REMARK
In the proof of the theorem u will be characterize as a
solution of variational problem dened by
J
(u) =
_
_
|u|
p
|u|
p
|x|
2p
_
dx
and the problem (15) stated earlier becomes Euler-
Lagrange equation of this variational problem.
INTRODUCTION
SKETCH OF THE PROOF OF THE THEOREM
INTRODUCTION
INTRODUCTION
We dene J
(u) =
_
_
|u|
p
|u|
p
|x|
2p
_
dx
INTRODUCTION
We dene J
(u) =
_
_
|u|
p
|u|
p
|x|
2p
_
dx
INTRODUCTION
We dene J
(u) =
_
_
|u|
p
|u|
p
|x|
2p
_
dx
We minimize J
over M = {u W|
_
|u(x)|
p
f(x)dx = 1}
and let
1
> 0 be the inmum.

INTRODUCTION
We dene J
(u) =
_
_
|u|
p
|u|
p
|x|
2p
_
dx
We minimize J
over M = {u W|
_
|u(x)|
p
f(x)dx = 1}
and let
1
> 0 be the inmum.

INTRODUCTION
We dene J
(u) =
_
_
|u|
p
|u|
p
|x|
2p
_
dx
We minimize J
over M = {u W|
_
|u(x)|
p
f(x)dx = 1}
and let
1
> 0 be the inmum.

We choose minimizing sequence (u
m
)
mN
M such that
J
(u
m
)
1
.
INTRODUCTION
INTRODUCTION
INTRODUCTION
For a subsequence u
m
k
of u
m
, u
m
k
u weakly in W where
u W M and
_
J
(u
m
k
)
1
=
J
(u
m
k
) 0
INTRODUCTION
For a subsequence u
m
k
of u
m
, u
m
k
u weakly in W where
u W M and
_
J
(u
m
k
)
1
=
J
(u
m
k
) 0
INTRODUCTION
For a subsequence u
m
k
of u
m
, u
m
k
u weakly in W where
u W M and
_
J
(u
m
k
)
1
=
J
(u
m
k
) 0
By Fatous lemma, we get
_
u
m
k
u strongly in W
u
m
k
u strongly in L
p
(, |x|
2p
)
INTRODUCTION
INTRODUCTION
INTRODUCTION
Hence
_
J
(u
m
k
) J
(u) =
1
=
J
(u
m
k
) = 0
INTRODUCTION
Hence
_
J
(u
m
k
) J
(u) =
1
=
J
(u
m
k
) = 0
INTRODUCTION
Hence
_
J
(u
m
k
) J
(u) =
1
=
J
(u
m
k
) = 0
u satises Euler- Lagrange equation in a distribution sense.
INTRODUCTION
Hence
_
J
(u
m
k
) J
(u) =
1
=
J
(u
m
k
) = 0
INTRODUCTION
Hence
_
J
(u
m
k
) J
(u) =
1
=
J
(u
m
k
) = 0
Since u W, it is a weak solution of problem (15).
INTRODUCTION
Hence
_
J
(u
m
k
) J
(u) =
1
=
J
(u
m
k
) = 0
INTRODUCTION
Hence
_
J
(u
m
k
) J
(u) =
1
=
J
(u
m
k
) = 0
The remaining part of the proof follows from the corollary
of the main theorem.
INTRODUCTION
Corollary
Let 1 < p <
n
2
, and let
F
p
=
_
f : R
+
|f L
loc
( \ {0}) with
limsup
|x|0
|x|
2p
f(x)
_
log
1
|x|
_
2
<
_
If f F
p
2,p
0
()
_
|u|
p
dx
n,p
_
|u(x)|
p
|x|
2p
dx+(f)
_
|u(x)|
p
f(x)dx (13)
If f / F
p
and if |x|
2p
f(x)
_
log
1
|x|
_
2
tends to as |x| 0,
then no inequality of type (13) can hold.
INTRODUCTION
As
_
n2p
p
_
p
_
npn
p
_
p
,
1
(f) where
INTRODUCTION
As
_
n2p
p
_
p
_
npn
p
_
p
,
1
(f) where
INTRODUCTION
As
_
n2p
p
_
p
_
npn
p
_
p
,
1
(f) where
(f) = inf
uW(\{0})
_
_
|u|
p
_
n2p
p
_
p
_
npn
p
_
p
|u|
p
|x|
2p
_
dx
_
|u|
p
fdx
0
INTRODUCTION
As
_
n2p
p
_
p
_
npn
p
_
p
,
1
(f) where
(f) = inf
uW(\{0})
_
_
|u|
p
_
n2p
p
_
p
_
npn
p
_
p
|u|
p
|x|
2p
_
dx
_
|u|
p
fdx
0
if f F
p
(f) > 0
INTRODUCTION
As
_
n2p
p
_
p
_
npn
p
_
p
,
1
(f) where
(f) = inf
uW(\{0})
_
_
|u|
p
_
n2p
p
_
p
_
npn
p
_
p
|u|
p
|x|
2p
_
dx
_
|u|
p
fdx
0
if f F
p
(f) > 0
if f = F
p
(f) = 0
INTRODUCTION
THANK YOU VERY MUCH!

Al Detalla Theory

Загружено:

Сведения о документе

Авторское право

Доступные форматы

Поделиться этим документом

Поделиться или встроить документ

Параметры публикации

Этот документ был вам полезен?

Это неприемлемый материал?

Авторское право:

Доступные форматы

Al Detalla Theory

Загружено:

Авторское право:

Доступные форматы

INTRODUCTION

IMPROVED HARDY-SOBOLEV INEQUALITIES

is related to the variational problem

is related to the variational problem

is related to the variational problem

is related to the variational problem

is related to the variational problem

(n) > 0 and C

(n) > 0 such

|x| and for any u W

(n) > 0 and C

(n) > 0 such

|x| and for any u W

depends on R in a weak sense since

|x| because of technical reason. Namely, the

(n) > 0 and

(n) > 0 such that if R > K

(n) > 0 and

(n) > 0 such that if R > K

(n) > 0 and

(n) > 0 such that if R > K

(n) > 0 and

(n) > 0 such that if R > K

(n) > 0 and

(n) > 0 such that if R > K

is related to the variational problem

is related to the variational problem

is related to the variational problem

is related to the variational problem

is related to the variational problem

(x) : spherically symmetric decreasing rearrangement of

(x) : spherically symmetric decreasing rearrangement of

(t) = |{x : |u(x)| > t}|

B: Volume of unit ball

()d. Direct calculation gives

()d. Direct calculation gives

()d. Direct calculation gives

) = 0. Thus optimality follow. i.e. 2.

()d. Then for 0 < <

> 0 be the inmum.

> 0 be the inmum.

> 0 be the inmum.

Вам также может понравиться