42.9. AN EVOLUTION INCLUSION 1407

Proof: Since each φ (t, ·) is nonnegative and convex, it follows that Φ is also non-negative and convex. It remains to verify lower semicontinuity. Suppose, [xn]→ [x] inL2 (0,T ;H) and let

λ = lim infn→∞

Φ([xn]) .

Is λ ≥ Φ([x])? It suffices to assume λ < ∞, xn (t) ∈ D for all t, and xn (t)→ x(t) a.e. sayfor t /∈ N where N has measure zero. Let

x̃(t) ={

x(t) if t /∈ Nx1 (t) if t ∈ N

Then [x̃] = [x] and x̃(t) ∈ D for all t. Then by pointwise convergence and Fatou’s lemma,

Φ([x]) = Φ([x̃]) =∫ T

0φ (t, x̃(t))dt ≤

∫ T

0lim inf

n→∞φ (t,xn (t))dt

≤ lim infn→∞

∫ T

0φ (t,xn (t))dt = lim inf

n→∞Φ([xn])≡ λ .

This proves the lemma.Define

D(L)≡{[x] ∈ L2 (0,T ;H) : for some x ∈ [x] such that

x(t) = x0 +∫ t

0x′ (s)ds where

[x′]∈ L2 (0,T ;H)

}(42.9.62)

and for [x] ∈ D(L) ,L [x]≡

[x′].

The following lemma is easily obtained.

Lemma 42.9.4 L is maximal monotone and if [z]∈ L2 (0,T ;H) , then the equivalence class,[Jλ [z]] is determined by the function,

Jλ [z] (t)≡ (I +λL)−1 ([z]) (t) = e−tλ x0 +

e−tλ

∫ t

0e

sz(s)ds. (42.9.63)

The main theorem is the following.

Theorem 42.9.5 Let x0 ∈ D. Then L+ ∂Φ is maximal monotone so there exists a uniquesolution to

L [x]+ [x]+∂Φ([x]) ∋ [ f ] (42.9.64)

for every [ f ] ∈ L2 (0,T ;H).

Proof: This is from Theorem 42.8.2. Since x0 ∈D, it follows from 42.9.59 that φ (t,x0)is bounded.

Let [z] ∈ D(Φ) , the effective domain of Φ. Then there exists z ∈ [z] such that z(t) ∈ Dfor all t, and

∫ T0 φ (t,z(t))dt < ∞, so by convexity of φ (t, ·) and 42.9.63,

φ (t,Jλ [z] (t))≤ e−tλ φ (t,x0)+

e−tλ

∫ t

0e

sλ φ (t,z(s))ds. (42.9.65)

42.9. AN EVOLUTION INCLUSION 1407Proof: Since each @(t,-) is nonnegative and convex, it follows that ® is also non-negative and convex. It remains to verify lower semicontinuity. Suppose, [x,] — [x] inL? (0,T;H) and letA = lim inf ®([x,]}).n—s0oIs A > ®((x])? It suffices to assume A < 0, x, (t) € D for all t, and x, (t) > x(t) a.e. sayfor t ¢ N where N has measure zero. Letx={ x(t) ift ¢N~ | x(t) ift enThen [x] = [x] and x(t) € D for all t. Then by pointwise convergence and Fatou’s lemma,(bq) = (68) = [ o(ez)ars [tim int 9 (r-ra(o)atn—yoo n—soo< lim inf [oun (t)) dt =lim inf ®([x,]) =2.0This proves the lemma.DefineD(L) = {{x] € L’ (0,7;H) : for some x € [x] such thatx(t) =xo+ [ x’ ()ds where [x'] € L’ (0, T;H)} (42.9.62)0and for [x] € D(L),The following lemma is easily obtained.Lemma 42.9.4 L is maximal monotone and if |Z] € L? (0,T;H), then the equivalence class,(J, [z]] is determined by the function,Jy [z| (t) = (+ AL)! ((z]) (0) =e x0 + ret [rete: (s) ds. (42.9.63)The main theorem is the following.Theorem 42.9.5 Let x9 € D. Then L+ 0® is maximal monotone so there exists a uniquesolution toLx] + [x] + 9®([x}) 5 [7] (42.9.64)for every [f] € L? (0,T;H).Proof: This is from Theorem 42.8.2. Since xo € D, it follows from 42.9.59 that @ (t,.xo)is bounded.Let [z] € D(®), the effective domain of ®. Then there exists z € [z] such that z(t) € Dfor allt, and fj @ (t,z(t))dt < ©, so by convexity of @ (t,-) and 42.9.63,6 (t, [dl (t)) <e% 6 (t,x) + ze# [ "ot $(t,2(s))ds. (42.9.65)