134 Chapter 3. Comparison principle
we may set
w(x, t, y, s)=u(x, t) − v(y, s) −
γ
T − t
−
γ
T − s
.
Indeed, M. Ohnuma and K. Sato (1997) established results of Theorem 3.1.1 when
F is independent of t, r by this choice of w; they also assumed that u
∗
and −v
∗
are bounded from above at t = T . However, they did not use the fact that u
∗
and
v
∗
are sub- and supersolutions of Q
∗
in the proof.
3.4.2 Proof for unbounded domains
We shall prove Theorem 3.1.4 by adjusting the proof of Theorem 3.1.1.
Proof of Theorem 3.1.4. As in the proof of Theorem 3.1.1 it suffices to prove the
case that u and v are, respectively, F-sub- and supersolutions of (3.1.1) in Q under
the assumptions (F1), (F2), (F3
) and (F4) with c
0
= 0. We suppress the symbol
F in the proof. We may also assume that u
∗
and v
∗
are, respectively, sub- and
supersolutions of (3.1.1) on Ω × (0,T] and that (3.1.4) holds for T
= T with the
property that u
∗
and v
∗
are left accessible at t = T . We shall denote u
∗
and v
∗
simply by u and v.
We set w
γ
and ϕ
αβ
as in (3.4.5). Assume that the conclusion was false so
that
M ≥ θ
0
:= lim
r↓0
sup{u(z) − v(ζ); (z,ζ) ∈ Z = Q × Q, |z − ζ| <r} > 0,
where M =sup{u(z) − v(ζ); (z,ζ) ∈ Z};sinceu and −v are bounded from above,
we see that M<∞. Then for sufficiently small γ>0weobservethat
µ
0
:= lim
r↓0
sup{w
γ
(z,ζ); (z, ζ)=(x, t, y, s) ∈ Z, |z − ζ| <r} > 0.
We shall fix γ such that µ
0
> 0 and suppress that subscript γ.Wedefine
Φ
σ
(x, t, y, s)=w(x, t, y, s) − ϕ
αβ
(x, t, y, s)withσ =(α, β),θ=sup
Z
Φ
σ
,
µ
1
(r):=sup{Φ
σ
(x, t, y, s); (x, t, y, s) ∈ Z, |x − y|≤r}≤θ
and observe that µ
1
(r)convergestoµ
0
uniformly in σ so that there is r
1
> 0
independent of σ such that
µ
1
(r) ≥ 3µ
0
/4 > 0forr ∈ (0,r
1
).
We shall argue as in Lemma 3.4.1. (Unfortunately, (3.4.1) may not hold when
Z
0
is unbounded, so Lemma 3.4.1 does not directly apply to our setting.) Since u
and −v are bounded from above on Q,Φ
σ
(x, t, y, s) > 0 implies
f(|x − y|) ≤
M
α
and (t − s)
2
≤
M
β
. (3.4.14)