296 7 Interpolation and Monotonicity
For each α with |α|≤1, |D
α
u|
a−1,
*
Ω
δ
≤ C|u|
a,
*
Ω
δ
. Multiplying both sides by
δ
a+b
and taking the supremum over δ ∈ (0, 1), |D
α
u|
(b+1)
a−1,Ω
≤ C|u|
(b)
a,Ω
.By
summing over |α|≤1, the second inequality of (7.24) is obtained.
Definition 7.6.5 If O is a bounded open subset of R
n
with
*
O
2δ
0
= ∅ for
some δ
0
> 0, then O is stratifiable if there is a constant K>0withthe
property that for 0 <δ≤ δ
0
and x ∈
*
O
δ
,thereisay ∈
*
O
2δ
satisfying
|x − y|≤Kδ.
Example 7.6.6 Let ρ
0
> 0, let y be any point in R
n
with y
n
< 0and
|y
n
| <ρ
0
,letΩ = B
y,ρ
0
∩ R
n
+
,andletΣ = B
y,ρ
0
∩ R
n
0
. The latter is the
flat face of a spherical chip. Taking δ
0
=(ρ
0
+ y
n
)/4,
*
Ω
δ
= B
y,ρ
0
−δ
∩R
n
+
for
0 <δ≤ δ
0
. Note that each
*
Ω
δ
is a bounded, convex, open subset of Ω.For
each x ∈
*
Ω
δ
, 0 <δ<δ
0
,thereisay ∈
*
Ω
2δ
with |x − y|≤Kδ where
K =
ρ
0
((ρ
0
− 2δ
0
)
2
− y
2
n
)
1
2
;
thus, spherical chips are stratifiable.
Monotonicity of |u|
(b)
a,Ω
with respect to each of the parameters a and b will
be considered now. It is easy to see that
|u|
(b)
a,Ω
≤|u|
(b
)
a,Ω
whenever b>b
. (7.25)
The following theorem and its proof are adapted from the paper cited
below that deals with the Σ = ∅ case.
Theorem 7.6.7 (Gilbarg and H¨ormander[24]) If Ω is a stratifiable,
bounded, convex open subset of R
n
0
,each
*
Ω
δ
is convex, 0 ≤ a
<a,a
+ b ≥ 0
and b is not a negative integer or 0, then there is a constant C = C(a, b, d(Ω))
such that
|u|
(b)
a
,Ω
≤ C|u|
(b)
a,Ω
. (7.26)
Proof: Consider the a ≤ 1 case first. Suppose it has been shown that
|u|
(b)
0,Ω
≤ C|u|
(b)
a,Ω
if b>0 (7.27)
and
|u|
(b)
−b,Ω
≤ C|u|
(b)
a,Ω
if b<0,a
+ b ≥ 0. (7.28)
In the first case, a
= λ · 0+(1− λ)a for some λ ∈ (0, 1] and it follows from
Theorem 7.6.3 that
|u|
(b)
a
,Ω
≤ C
|u|
(b)
0,Ω
λ
|u|
(b)
a,Ω
1−λ
≤ C|u|
(b)
a,Ω
.