This content was uploaded by our users and we assume good faith they have the permission to share this book. If you own the copyright to this book and it is wrongfully on our website, we offer a simple DMCA procedure to remove your content from our site. Start by pressing the button below!
0 such that \pao(x) -pao(xQ)\ - 0 0 for all x € X. The set ~Deff(ip) = {x € X I (p(x) < 00} is called the effective domain of . x. This implies tp(x) < liminfn^oo x. We set d = liminfn^oo (p(xn) and choose a subsequence (xnk)keN such that lhrifc.+oo ip(xnk) = d. For any e > 0 we have 0, i.e., (5 for all x G V{XQ). It is easy to see that epi(y) is a convex subset of X x R. Since ) ^ 0. Obviously V(xo) x (—00,/?) is a convex subset of X x R , which has interior points. Moreover, epi(?) does not contain any points of V(xo) x (-00,0). By the Eidelheit separation theorem for convex sets (see for instance [Lu, p. 133]) there exist an XQ G X* and a constant c G R such that H = {(x,r) e X x R | {x,x*0)+r = c} • (—oo, oo] be a proper, convex and lower semi-continuous functional. Then the restriction Lp |Deft(cz>) *s continuous on intreiDeff(?). Proof. We denote by Y the minimal closed affine subset of X containing Deff(3). Without restriction we can assume that 0 £ Y, i.e., Y is a Banach space with the norm inherited from X. Since tp \D,{(( 0 we have to show that N = {x \ \ —e} D {x | tp(x) < e} and the fact that {x | tp(x) > —e} = X \{x \ ip(x) < —e} is open (which follows from lower semi-continuity of —00 for all p G X*. In order to show that ip* ^ 00 we take p = x*, where a;* is an element in X* satisfying (1.62). Then we have {x,p) — tp(x) < —c for all x G X, i.e., • p. For e > 0 we choose x€ G X with {x€,p)-ip(x€) >ip*{p)-e. Then (x e ,p„) - ^(z,:) < <£*(?«) for all n = 1,2,... implies liminf ip*(pn) > lim ((xf,pn) 0. For this functional we have Deff(y) \ domdy — {0}. 1.49. Proposition. Let ip be a proper convex functional on X. Then the operator dtp C X x X* is monotone. If, in addition, 0 (zo))/2 = ((y0 X0)/2,XQ) = (y — xo,x%), a contradiction to XQ G dip(xo)- Therefore we have (y,w*) 0 there exists a y\ such that lim^o \y\\ = 0 and x + Ay + Ay* G # . (u — XQ,XQ — FXQ) for all u £ X, which proves XQ - Fx0 G dip(x0), i.e., XQ G {F + dip)x0. • 1.54. Proposition. Let 0 there exists a (3 > 0 such that [u,v] G dtp and \v\ < a imply \u\ < /3 (i.e. dom(dip)-1 = X* and (dtp)-1 maps bounded subsets of X* onto bounded subsets of X). Proof. Assume first that ip is radially unbounded and let [x„,x*] G dip, n = 1,2,..., be a sequence with limn-^oo |x„| = oo. By definition of dip we have 0, and h(0) = -y1/2 we get the estimate a < 0 + 7 1 / 2 . D 1.56. Example. Let Q, be a bounded open set in Rd with sufficiently smooth boundary. 7 We define the functional (—00,00] by is also lower semi-continuous we choose u G L 2 (0) and set a = liminf^_>.„ 0. We only need to consider the case a < 00. We choose a sequence (W„)„ 6 N with \u — UU\L2 —• 0 and 00. By definition of 00((^, un)Hi = (4>,v)Hi for all <j> G HQ(Q). Since (u„)„ e N i s bounded in HQ(Q) and HQ(£1) as a Hilbert space is uniformly convex, we get lim \v — un\Hi = 0. n—foo + DQIJ) G H. Thus (0,-0) G dom A and range(A7 - A) = X forAe(0,A 0 ]. D Observing that X as a Hilbert space is reflexive we get from the LumerPhillips theorem: 2.29. Theorem. The operator A defined by (2.46) is the infinitesimal generator of a contraction semigroup S(-) on X. If x(0) G domA and / G ^ ( [ O . o o ) ; ^ ) , i.e., / G W^([0, o o ) ; * ) , then x(t) = S(t)x(0) + J0S(t — T)f(r)dT, t > 0, is the unique strong solution of equation (2.47). For x{t) = (u(t),v(t))T equation (2.47) is equivalent to u'(t) = v(t) and v'(t) = - M 0 - 1 ( ^ 0 M ( * ) + Dov{t)) + M 0 _ 1 / W , t > 0. By Theorem 2.13, a), we have also x G C(0, oojdomA), i.e., x G C(0, oo;X) and Ac G C(0, oo; X). Therefore we have u G C^O, oo; V) n C 2 (0, oo; # ) and M0u"{t) + D0u'(t) + A0u(t) = f(t) 0 is fixed. We shall use the functional ip(xo) — e. Thus we have proved that liminf n ^oo^(x„) > (f(x0). For this example not only the level sets Da, a > 0, are closed and convex, but also D is. 6.2. Example. For a Banach space X let D be a closed subset and define 0 on I") -^ max J- a,fc(* + <*> t, Auo); e) = ipafii* + ^ l ' f(uo)) 0 with \wa,T0 < 1/2 and T + X < To there exist sequences (i^)i=o,...,jvx, x (^)*=O,...,JV A and {y )i=i,...,Nx such that 4 oo T+(S,XQ) + + and e (s,T,a;„ j0 ) > e (s,T,x0), n G N. Therefore the weak solutions u„(-) = u(-;s,xn,o) exist on [s,T]. We fix n, m G N. Corresponding to «„(•) and Um(-) we choose DS-approximations MA, 0 < A < A0, of EP(A(-),s,a;„ ) o) and Up, 0 < p, < p,o, of EP(A(-), s,xmfi) with associated sequences (t*, x£, y*, eif) and (i^,x^,y^,e^) in [0,T0] x D a x X x X such that limA4.0UA(£) = un(t) and limMj,owM(t) = um{t) uniformly on [s,T\. Moreover, we can assume that x% = xnfi, x% = ^rn.o and e\ =e^= 0. For any e G (0, eo] there exists a A = A(e) such that (see the estimate (6.41) in the proof of Proposition 6.16) (6.44) («o)) < a(t)ip(ux) + b(t), where a, b : [0, T"max) —> K are continuous functions, b being nonnegative. (!?_i)) < K are continuous functions, b > 0 on [0, T m a x ). Then the mild solutions u(-; s, XQ) of EP(A(-), s, x0) with XQ G Dndom A(s) and p{us) + °{t;g), where a(-; g),b(-;g) : [0, T max ) —> R are continuous in t with b(-;g) > 0 on [0, T m a x ). Moreover, for any T G (0,T m a x ) the mappings Ll{Q,T;X) -»• Ll{0,T;R) defined by g\%T] -»• a{-;g) | [0 ,r] and 9 |[0,r] —> b(-;g) \[O,T] are continuous. By continuity of a, b with respect to g we can also extend the definition of the functions a(-,g), b(-;g) for g G Llc([0,Tmax);X). For g G L ^ Q O , ! ^ ) ; * ) and (gn)nen C ^ ( [ 0 , ^ ^ ) ; X ) with l i m ^ ^ |g - 5nUi(o,T;X) = 0 for all by ip(x) = ip(x)~ip(x0)-(x-x0,y0)x, 0. By Theorem 6.17 there exists a unique integral solution u(t) = u(t\x) of problem (6.83) (where we can take ut = 0). Moreover, we have (6.86) («£_i) < (n* — «^_i,2/^)x (observe that yf £ d 0 for a; e X) a,T = WO,T for all a > 0 in conditions (CP1), (CP3) and (CP5). Moreover, we can set a(a) = a. Condition (CP4) is automatically satisfied for any choice of the functions a(-), &(•). If we observe that in this a C SnZ? Q C dom J CT(a)jA (i) for all £ e [0,T + d] we conclude that xk (and also yk) exists with x£ e dom A(tk) D Ar(<*)- From (CP4) we get |(*>(**) - ¥>(**-i)) < «(*iM**) + b(tj), ) = ll(t>lc 0, we shall use the following lemma: 9.1. Lemma. Assume that (RD1) is satisfied for F. a) For any T > 0 and any u 0 = (voi 0, \uo\x we get - again by Lemma 9.1, b) - that \ux\x = \vx\- For tjj > 0 we get using assumption (hi) 0 ) = \(p\c (according to Theorem 9.2) but not assumption (El) with respect to ) does not imply a bound for |<£(0)|, —r<9< 0). However we shall show that (R2) is also satisfied with respect to (p with (%, 0o) and liminf^oo ip(r)n, 0 n ) = a. We only need to consider the case a < 00. Without restriction we assume a = lim n) 'n\L°° < a + e, x\c = \vxW", \'\\L°° < | oo € Cg(]R d ;R d ) with |0|L°° < 1 be given. Then we have / ud\v(j)dx = lim / und\v4>dx < Miami \un\Bv < lim inf p(un) = a. This implies u G BV(Rd) .00 |W„|LI = |u|x,i imply that limn_>oo |u ra |L~ exists also. In view of limn_>.00 \un — u\Li = 0 we can also assume that un(x) —• u(x) a.e. on Md. This implies |w|z,«. < limre^oo I Thus we have shown that (f(u) = \u\Li < oo 0, denote the open ball with radius r and center at the origin. Then lim^^oo \un - u\Li = 0 implies that also liirin-Kx, \un - u\Li(Q,r) = 0. Considering r = 1,2,... and choosing consecutively subsequences we get a subsequence (unfc)fceN such that C2,U,R,T- Then the function w satisfies the following equation: d {x)), x G Rd, t > 0, ~fR:T, t 6 [0, T] and v > 0 a unique solution u G H2(Rd) n dom^4,/(t) Pi D satisfying ( l - A c r ) H t i < MLI+A|&T|LI> (9.83) )) < a*p(u) + b 0, implies l i m A , ^ ) ^ = -r(u-(j>) =v ))
. Then u = linv|.o w^. From Proposition 9.19, c), we get (9.125) ) - )) < a 0, any T > 0. • 0 be given and set a = liminfn^oo tp(un). We only need to consider a < 1 and (un)n^ c V. Without restriction of generality we may assume lim^-joo .oo \u„\v — ( 1 - Q ) _ 1 / , 2 - 1 . Consequently we have a > tp(u). D 9.39. Lemma. The family A(t), t > 0, satisfies (El) with a+ = 1 and Wa,T = ^ | ( ( l - a ) - 0, satisfies assumption (R2) for any T > 0 with 0 C C satisfying (10.37) we have (10.39) 0 t/iere exists at most one solution u(-) G ) £ X be given. Then the unique solution u(-) of (SL) satisfies a Lipschitz condition (as an X-valued function) on each compact subinterval [0, T] of its maximal interval of existence. Proof. Equation (SL) implies u(t) -> = S{t)(j> - <$> + f S(tJo +
<-
The last two inequalities and p(x) = mfa>opa(x) p(x) < Pa0(x)
< Pao(x0)
ior\x-x0\<8. imply
+ ~ < p(x0) + £ for \x - X0\ < 5,
which proves upper semi-continuity for (•, -)s on X. The result for (-, •), follows from (1.4). • 1.2. Remark. In case x ^ 0 or dimX > 2 statement c) of the lemma is equivalent to [(y,x)-, {y,x)+\ = {Re(i/,/> | / e l * with | / | = 1 and (x,f) = \x\}. For x = 0, y ^ 0 and dimX = 1 we have to replace | / | = 1 by | / | < 1. In this case (y, 0)± = ±|t/| and, for c with \c\ < \y\, the functional / £ X* is uniquely determined by (y, / ) = c. Note that | / | = j c | / | j / | < l . A useful result is given by the following proposition. 1.4. Proposition. For some interval I let f be a mapping I —> X. a) If, for a to £ I, the right-hand derivative /+(
^i/(«o)i = (/;(*o),/(*o))+. b) The analogous result is true for left-hand derivatives. In particular,
~\f(to)\ = (fL(t0)J(t0))-. Proof. The inequality
S(h) := |i(|/(to + h)\ - |/(t0)|) - i(|/(*o) + hf'+(t0)\ - \f(tQ)\)
<|£(/(*o + M-/(*o))-/;(*o)| implies lim/14.08(h) — 0, i.e., the right-hand derivative (d+ /dt)\f(to)\ exists and is given by (f+(to),f(to))+The result for the left-hand derivative follows analogously. •
1.2. Dissipative
9
operators
1.2.
Dissipative operators
Given Banach spaces X and Y we always identify possibly multivalued operators A : X —> y and subsets of I x 7 , because there is a one-to-one correspondence between these objects. Indeed, if A : X —>• Y is given, then its graph GA = {{x, y)eXxY\x€ dom A and y G Ax} is a subset of X x Y. Conversely, a subset G C X xY defines an operator AQ : X —> Y (which in general is multivalued) by (i) dom AG = {x G X | There exists a y G Y such that (a;, y) G G} and (ii) y G AGX if and only if (x, y) G G. Henceforth we shall always write [x, y] G A instead of (a;, y) G A in order to indicate that A C X x y is viewed as an operator. If A is an operator X —» Y, we define the domain of A by dom A = {x G X | Ax / 0} and the range of A by ranged = \JxedomAAx. The inverse operator A"1 : Y ->• X is denned by [a;, y] G A - 1 if and only if [y, x] G A. Obviously, we have ( A - 1 ) - 1 = A. For two operators A , B : X ->• F and A e R resp. G C we define XA = {[x,\y\ \ [x,y] G A} and A + B = {[a:, j/ + 2] | [x, 2/] G A and [a;, z] G 5 } . It is clear that domXA = dom A, dom(A + B) = dom A n domB and dom A - 1 = range A. 1.5. Definition. An operator A on X, i.e., A C X x X, is called dissipative if and only if, for any [XJ, j/i] G A, i = 1,2, there exists an a;* G -F(a;i — X2) such that (1.9)
Re(yi-y2,x*)<0.
For w e R , an operator A C X x X is called LJ-dissipative if and only if A — wJ is dissipative, i.e., for any [xi,yi] G A, i = 1,2, there exists an a;* G F(a;i - X2) such that
(1.10)
Re(yi-y2,x*)
The next result will allow one to characterize dissipativity of an operator in different ways. 1.6. Theorem. For x,y G X the following statements are equivalent: (i) Re(y, / ) < 0 for some f G -Fa;. (ii) \x — \y\ > \x\ for all A > 0. (iii) {y,x)_ < 0 . (iv) (y,x)i<0.
10
Chapter 1. Dissipative and Maximal Monotone
Operators
Proof. 1. (i) => (ii). Let x ^ 0 and choose / G Fx with Re(j/, / } < 0. Then, for any A > 0, \x\2 = {x, f) = Re{x -Xy + Xy, f) = Re(a; - Ay, / } + A Re(y, f) <\x-Xy\\f\
=
\x-Xy\\x\,
which implies (ii). 2. (ii) =* (hi). Prom (ii) we obtain the estimate -j(\x-Xy\-\x\)<0,
A > 0,
which implies (y, x)_ = lim^o A - 1 (|a;| — \x — Xy\) < 0. 3. (iii) =» (iv). This is trivial. 4. (iv) =» (i). According to Lemma 1.3, c), there exists an / (y,x)i<0.
G Fx with Re(y,f
) = D
The following corollary is an immediate consequence of Theorem 1.6: 1.7. Corollary. Let A be an operator on X. The following statements are equivalent: (i) A is dissipative. (ii) \xi-x2-X{y\-y2)\ > \x\—Xi\ for all A > 0 and[xi,yi] G A, i — 1,2. (ii') There exists a Ao > 0 suc/i i/iai |ari — x2 — A(yi — y 2 )| > |#i — £2! /<"" «^ A G (0, A0] and [XJ,y,] 6 A , t
=
l,2.
(iii) (?/i - 2/2,2:1 - z 2 ) - < 0 for all [xi,yi] eA,i
= l,2.
Proof. We only have to prove that (ii') implies (ii). For fixed [xi,yi] G A, i = 1,2, the function /(A) = \xi - x2 - X(yi - y2)\ - \xi - x2\ is convex on A > 0. We have /(0) = 0 and /(A) > 0 on (0,A0]. But then convexity of / implies /(A) > 0 also for A > Ao. • For an w-dissipative operator A statements (ii) and (iii) have to be true for A-LJI:
1.8. Proposition. Let X be an operator on X and u e l . Then the following statements are equivalent: (i) The operator A is u-dissipative. (ii) We have \xx - x
2
- X(yi -y2)\
> (1 - uX)\xi - x2\
for all [xi,yi] G A, i = 1,2, and 0 < A < l/|w|.
1.2. Dissipative operators
11
(ii') There exists a A0 > 0 such that
\xi -x2-
\{yi - i/2)| > (1 - Xu)\xi - x2\
for all A G (0, A0] and [xi, yt] G A, i — 1,2. (iii) (2/1 -yi,x\ -x2)
2
- A(zi - z2)\ > \xi - x2\
for all A > 0 and \xi, Zi] G A — oil, i = 1,2. Since z £ {A — ioI)x if and only if z = y — u)x with some y G Ar, the last inequality is equivalent to (1.11)
| ( 1 + A w ) ( x i - a : 2 ) - A ( j / i - 2 f c ) | > \xi - x2\
for A > 0, [xi, j/i] £ 4 , i = l,2. It is easily seen that this is equivalent to (1.12)
\xi -x2
-//(j/i - 2/2)1 > ll-jU^Hxi -x2\,
[xi,yi]£ A, i = 1,2,
where 0 < fi < 1/w in case w > 0 and fi G (0, CXD) (J (—00, l/o;) in case a; < 0. Therefore it is obvious that (ii) of Corollary 1.7 implies statement (ii). If statement (ii') is valid, we can assume that (1.12) is valid with a [i G (0, 1/|CJ|), which implies (1.11) for some Ao > 0. • If A is an w-dissipative operator on X, then in view of Proposition 1.8 we restrict ourselves to A G (0, l/|w|). A first important consequence from dissipativity is given in the following proposition: 1.9. Proposition. Let A be an UJ-dissipative operator on X. Then, for any A G (0, l/|w|), the operator (I — XA)_1 is single-valued and, for any x,y G range(7 - \A) and A G ( 0 , 1 / M ) ,
I(/ - \A)~lx - (I - \A)~ly\ < YZJ^\X ~ V\Proof. Choose x\,x2 G dom A, 0 < A < l/\u\ and Zi e (I - XA)xt, i = 1,2. Then we have zi = Xi — Xyt for some j/i G Axi, i = 1,2. By Corollary 1.7, (ii), we get \zi - z2\ = \xi - x
2
- A(j/i - ?/2)| > (1 - Xw)\xi - x2\.
For x\ ^ x2 this implies (i" - XA)x\ C\ (I — AA)a;2 = 0- Therefore, for any y G range(7 — XA), we have (I — \A)~ly = x, where x is the unique element with y G (7 - XA)x. •
12
Chapter 1. Dissipative
and Maximal Monotone
Operators
We define the resolvent J\ resp. the Yosida approximation A\ of an wdissipative operator A by J\x = (I - XA)~lx G dom A, A\x = A _1 ( J\x — x)
for all x G dom J\ — range(7 - XA).
For an operator A on X we define (1.14)
||AE|| =inf{|j/| | ye Ax},
a; G dom A
Some fundamental properties of J\ and A\ are summarized in the following theorem: 1.10. Theorem. Let A be an u>-dissipative operator on X. A,/i < l/|w|, the following is true:
Then, for 0 <
(i) \Jxx-Jxy\ < (1 - Aw) _ 1 |a;-t/|, x, j/ e dom J A . (ii) A\x e AJxx, x£domJ\. (iii) For x G dom JA fl dom A we have \Axx\ < (1 -
^-^AxW
and thus \J\x-x\
< X(l -
Xu^WAxl
(iv) For x G dom J\ we have ^_ MT T-Z H ,— J\x G dom J,,, A A V-
and
X- n \ T /// J\x = J^ hrx + — — JTA a;J.
(v) For x G dom JA n dom JM and 0 < /^ < A < l/|w| we /jave (1 - Aa;)!^^! < (1 - /MV^Af.xl. (vi) TTie operator A\ is w(l — Aw) - 1 -dissipative and \Axx - Axy\ < - [1 +
j \x-y\,
x, y G dom J A .
Proof. In order to prove (i) and (ii) we choose x,y G dom J\ and set u = J\x, v = Jxy. Furthermore, we define u = A _ 1 (« — x), v = X~l(v — y). Then it is easily seen that [u, u], [v,v] G A. Thus, from Proposition 1.8, (ii), we conclude \J\x — J\y\ = \u — v\ < (1 - A a j ) _ 1 | u - v - X(u — v)\ = (1 - Au/)_1|:r - y\. Next, by definition of A\ we have A\x = A_1(w — x) = u G Au = AJ\X for x G dom JA = range(7 — XA).
1.2. Dissipative
operators
13
For x £ dom Jx fl dom A we choose x € Ax arbitrarily. Then we have J\(x — Xx) = x, because x — Xx € (I — XA)x. Therefore we have \A\x\ = X~x\Jxx
— x\ = A -1 1 J\x - J\(x - Xx)\
< (1 - Xu))~lX'l\x
- (a; - Xx)\ = (1 - Aw) _ 1 |s|.
which implies (iii). For x € dom J^ we again set u = J^a; and u = X~1(u—x), so that [u, u] G A For 0 < p < l/|w| we have M ^ ~ MT M/ x-\ A —u „ -r-z H — J \ x = — (M — Aw) H — u — u — fiu e range(i — pA) = dom J^ A A A A and J
ATX
"I
\~JxX)
= J u
^
~ IJ-u) = u =
J\x.
Thus (iv) is established. From (i) and (iv) we get X\Axx\ = \Jxx - x\< \J\x - J^x\ + | J^x - x\ X — fi
J» (jx + —j-J\x) LL
- Jp
X— U,
+ IJfj.X - x\
T
—J\X- x 4- | J^x - x\ < (1 - pw)~l —x-\ A A = (1 - /tw) _1 (A - p)\Axx\ + ulApx], which by some easy computations implies (v). For p > 0 and x,y £ dom Jx it follows from (i) that \x- y - p(Axx - Axy)\ = (l + - ) ( x - y) - -r(J\x -
Jxy)
> (l + ^ ) | a : - » | - ^ | J A a ; - J A J / I
^((l + ^-fa-Aa;)- 1 )^-^ = (i-pw(i-Awr 1 )k-i/iThe estimate for yl^x — Axy is a straightforward consequence of the definition of Ax and statement (i). • 1.11. Definition. Let A C X x X be dissipative. a) The operator A is called maximal dissipative if and only if for any dissipative operator B C X x X with i c B w e have A = B.
14
Chapter 1. Dissipative
and Maximal Monotone
Operators
b) The operator A is called m-dissipative if and only if range(7 — Ao^4) = X for some Ao > 0. Concerning the relation between the notions "maximal dissipative" and "m-dissipative" we have the following results: 1.12. Theorem, a) A dissipative operator A C X x X is m-dissipative if and only if range(7 - \A) = X
for all A > 0.
b) If A C X x X is m-dissipative then A is also maximal dissipative. c) If X is a Hilbert space, then an operator A C X x X is m-dissipative if and only if A is maximal dissipative. Proof, a) Suppose that range(I —
(1.15)
AOJ4)
= X for a Ao > 0. For A > 0 we have
/-A^ = A(7_(1^^)jAo)(/_Ao^).
Ao For fixed x G X we define the operator T : X —> X by
Ty = x+(l--^)JXoy,
yeX.
Observing that J\0 is a contraction (see Theorem 1.10, (i), for LJ = 0) we get \Ty-Tz\<\l-±-\\V-z\,
y,zeX. Ao T is a contraction on X if and only if |1 — A/Ao| < 1, i.e., if and only if 0 < A < 2Ao. By the Banach fixed point theorem the operator T has a unique fixed point z G X, i.e., x = (/ — (1 — X/Xo)J\0)z for 0 < A < 2Ao- From range(7 — XoA) = X we have (see (1.15)) ^_ ( 1 - — ;)JAo)(^-Ao^4)dom J 4 = range(/-A J 4), 0 < A < 2A0. A0 Repeating the arguments from above for 3Ao/2 we get range(7 — XA) = X, 0 < A < 3AQ. Continuing we see that range(7 - XA) — X for all A > 0. € (i-
b) Assume that A is m-dissipative and that B is dissipative with B D A. Choose [x, y] G B. Since range(7 — XA) = X for A > 0, there exists a [x, y] G A such that x — Xy = x — Xy or, equivalently, x-x
— X(y -y),
A > 0.
From A c B we conclude that [x, y] 6 B. Then dissipativity of B implies \x-x\<\x-x-\(y-y)\=0,
A > 0.
1.2. Dissipative operators
15
Hence we have x = x and y = y, i.e., [a;, y] £ A which proves B c A. c) In view of part b) we have to show that a maximal dissipative operator A on a Hilbert space X is also m-dissipative. Let (•, •) denote the inner product on X. The proof is based on the following property of dissipative operators on a Hilbert space: 1.13. Lemma. Let X be a Hilbert space and A a dissipative operator on X. Then, for every y £ X, there exists an x £ X such that (1.16)
Re(v + y - x, u - x) < 0 for all [u, v] e A.
For the moment we assume that the lemma is already established. Then according to the lemma for any y £ X there exists an x £ X such that (1.16) holds. Since A is maximal dissipative, this implies x £ domA and x — y £ Ax, i.e., y £ {I - A)x. Thus we have range(7 - A) = X, which in view of Definition 1.11 proves that A is m-dissipative. • Proof of Lemma 1.13. Suppose (1.16) has already been proved for y = 0. Given y ^ 0 we define an operator B on X by domB = {x — y \ x £ domyl}, Bu = A(u + y),
uGdomB.
Since for [u, v] £ B we have v £ A(u + y), dissipativity of A implies Re(vi -V2,u\
- u2) = Re(ui - v2,u\ + y - (u 2 + y)) < 0
for all [uj,v»] £ B, i = 1,2, which proves that B is dissipative. According to our assumption there exists an x £ X such that Re(v — x, u - x) < 0,
[u, v] £ B.
If we set x — x + y, then we get Re(i> — x,u — x) = Ke(v + y — x,u + y — x) < 0, which proves (1.16) for y. Observe that v £ A(u + y) and that any element in dom A can be written as u + y with u £ dom B. We still have to prove (1.16) for y = 0. For \u, v] £ A we set X(u, v) = {x £ X | Re(-w + x, u - x) > 0}. Then (1.16) for y = 0 is equivalent to
(1.17)
P| X(u,v)^0. [u,v]£A
16
Chapter 1. Dissipative and Maximal Monotone
Operators
Obviously we have u G X(u, v), so that X(u, v) is not empty. The sets X(u, v) are also closed. From the representation (1.18)
R e ( - v + x, u - x) = - Re(ti, u) + Re(v, x) + Re(x, u) - |x| 2
and convexity of x —> \x\2 it is easily seen that the sets X{u, v) are also convex. From (1.18) we also obtain \x\2 < \u\ \v\ + (\u\ + \v\)\x\,
xe
X(u,v),
which implies boundedness of X(u, v). As a closed convex subset X(u,v) is also weakly closed (see [La, Theorem 9.2.2, p. 243]). A bounded and weakly closed set is weakly compact (see [La, Corollary 9.4.2, p. 258]). Since the sets X(u, v) are weakly compact, it suffices to show that for any finite number of elements [ui, Vi] G A, i = 1 , . . . , n, we have n
(1-19)
f\X(ui,Vi)^9 i=l
in order to prove that (1.17) is true. We set n
C = J Q G K " I on >0, i = l,...,n, ^ « i = l | . »=i
Then C is a compact convex subset of R™. We define the mapping ip : C x C —>• Eby n
ip(a, (3) = ^
Pi Re(x(a) - Vi,x(a) - u»),
a, (3 G C,
i=l
where x(a) = Y^j=iajujClearly ip is continuous on C x C. Moreover, for fixed (3 G C, the mapping a —> ip(a,f3) is convex on C, whereas, for fixed a G C, the mapping (3 —> ip(a,(3) is concave (in fact linear) on C. By the Minimax-Theorem (see [Ro2, Corollary 37.6.2]) there exist a0, (3° G C such that V>(a°,(3) < tp{a°,P°) < i>(a, 0°)
for all
a,/3eC.
0
Taking a = (3° we obtain ^{a°,/3) < i>((3 ,/3°) for all f3 G C. We next show that ip(a, a) < 0 for all a G C. Using repeatedly X]™=1 «i = 1 we obtain n
n
n
ip{a,a) = '^2aiRe(^2aj(uj i=l n
j=l
- u;)J
fe=l
n
= X] X] i=l
- vt),]Tak(uk n
aiQfc R e _
n
( ^ ' fc ~ i)+X^ X ] a J afc Re (%' ufe) fc=l
u
u
j = l fc=l
1.3. Properties of m-dissipative operators n
17
n
— 2_\ 2^ Q-iOij Re(uj,Ui) i=ij=i n n = ^ ^2 otiOLj Re(-Vi, i=i j = i n n 1
Uj - Ui)
=
W
2 5Z51
Qia
^
Re _
^ n
( ^> J ~ 0 ~ 2 5Z^2 a i O L i Re(vi>ui - ui)
»=1 j = l n n =
o 5> ^
i=l j = l QiQ: , R e
t=i j = i
n
w
•
^ J ~~ V i ' U j ~ Ui^'
Since A is dissipative and [«», t>i] G A, i = 1 , . . . , n, we have Re(uj — Uj, Mj — Uj) < 0,
i, j = 1 , . . . , n .
Thus we have shown that V>(a°,/3)<0,
/3eC.
Taking for 0 the vector with fa = 1 and /3j = 0 for j ^ i, we have Re(vi + x(a°),Ui - x(a°)) > 0,
i—
l,...,n.
This proves that x(a°) G X ^ . i ^ ) , i — 1 , . . . , n, i.e., (1.19) is true.
1.3.
•
Properties of m-dissipative operators
In this section we collect some of the most important properties of mdissipative operators. 1.14. Lemma. Assume that X* is strictly convex and that A C X x X is maximal dissipative. Then, for all x G dom A, Ax is a closed convex subset of X. Proof. By Proposition 1.1, a), we see that the duality mapping F is singlevalued. In order to show that Ax is convex we choose yt, j / 2 G Ax and a G [0,1]. Since A is dissipative we have, for all [x, y] G A, Re(m/! + (1 - a)j/ 2 -y,F(x-x))
= aRe(j/i - y,F(x - x)) +
{l-a){y2-y,F{x-x))<0.
Thus, if we define the subset A by ~
J Az, [Axil {ayi + (1 - a)y2},
if z G dom A and z ^ x, if z = x,
Chapter 1. Dissipative
18
and Maximal Monotone
Operators
then A is a dissipative extension of A with dom A = dom A. Since A is maximal dissipative, it follows that Ax = Ax and thus ay\ + (1 — a)j/2 S -Ax as desired. Next we show that Ax is closed. Choose yn G Ax, n = 1,2,..., with limn^oo yn = y. Since A is dissipative, we have Re(y„ — y, F(x — x))<0 for all [x, y] G A. For n - > o o w e obtain Re(y - y, F(x -x)) < 0, which shows that the extension A of A defined by Az = Az for z G dom A, z ^ x, and Ax = Ax U {y} is dissipative and hence coincides with A. This implies y G Ax. • 1.15. Definition. Let A be an operator on X. a) The operator A is called closed if and only if A is closed as a subset of X x X. b) The operator A is called demi-closed if and only if A is closed as a subset of X x .X™ (Xw denotes the space X endowed with the weak topology), i.e., \xn - x\ ->• 0, w-lim^oo y„ = y and [xn, yn] G A, n = 1,2,..., imply [a:, y] G A. 1.16. Theorem. Assume that A is an m-dissipative operator on X. Then the following is true: (i) The operator A is closed. (ii) If x\ —• x and A\X\ -> y as \ \.Q for a family [x, y] G A.
(XA)O
C X, then
Proof. Choose [xn, yn] G A, n = 1,2,..., with xn -> x and yn -> ?/ as n ->• oo. By dissipativity of A we have (compare Corollary 1.7) (yn — y,xn - x)- < 0 for all [x,y] G A. Since {•, •)_ is lower semi-continuous, we obtain
(y-V,x-x)-
< \immi(yn-y,xn
-x)_ <0
for all [x,y] G A. This shows that A — Au {(x,y)} is a dissipative extension of A. Since A is maximal dissipative we have A = A, i.e., [x, y] G A. Since (A\£A)O x G X as X | 0. Then we have x £ dom A. Moreover, if for some sequence (Xn) with Xn —>• 0 as n —• oo we have w-limn-^oo A\nx\n = y, then y G Ax. (iii) Assume that A is m-dissipative. Then limAj,o I^A^I = ||^4a;|| for all x G dom A.
1.3. Properties of m-dissipative
operators
19
Proof. Since X* is uniformly convex, Proposition 1.1, c), implies that Fx is single-valued and x —> Fx is continuous on X (in fact uniformly continuous on bounded subsets). Let [xn, yn] £ A, n = 1,2,..., with lim„_>.00 xn = x and w-lim„^oo yn = y be given. By dissipativity of A we have (1.20)
Re(yn-y,F(xn-x))<0,
n=l,2,...,
for all [x, y] £ A. The estimate | {yn - y,F(x„ - x)) - {y-y, F(x - x)) \ <\(Vn-
y,F(xn
- x)) - {yn - y,F(x ~ x)}\
+ \{yn- y, F(x - x)) - {y-y, F(x - x))\ < \Vn - y\ \F{xn -x)together with
F(x - x)\ + \{yn- y,F(x - x))\
and yn —^ y implies that
0 > lim Re(yn - y, F(xn - x)) = Re(y - y, F(x - x))
for all [x, y) e A.
n—>oo
By maximality of A we conclude that [x, y] G A. In order to prove (ii) we first conclude as in the proof of Theorem 1.16, (ii), that limA4,o J\%\ = x and A\X\ £ AJ\X\. Since |AXXA| is bounded, there exists & y £ X and a sequence (A„) such that A„ 4- 0 and A\nx\n —*• y as n —> oo. In view of demi-closedness of A this proves [x, y) G A. From Theorem 1.10, (v), we get (for w = 0) \A\x\ < \Ailx\,
0 < JJL < A, x £ dom A
This together with \A\x\ < \\Ax\\ (see Theorem 1.10, (hi)) implies that ao := limA^o I^A^I exists and ao < \\Ax\\. X* uniformly convex implies that X is reflexive. Therefore there exists a sequence (A„)„<=N with A„ 4- 0 as n —¥ oo and a y £ X such that w-lim„_>oo A\nx = y. Then statement (ii) implies that y £ Ax. If y = 0 then also ||J4X|| = 0 and consequently ao = 0. So we need only to consider the case y ^ 0. Since A\nx is weakly convergent, we have limn_).00{^A„a;,-F,2/) = (y,Fy) = \y\2. Taking n -s- oo in {AXnx,Fy)<\Ax„x\\y\ we get \y\ < ao, which proves ao > \\Ax\\. Thus we have ao = ||Ar||.
D
1.18. Definition. Let A be an operator on X. The operator A0 defined by domA 0 = { i e domA \ there exists a y £ Ax with \y\ — ||Aa;||}, A°x = {y£ Ax\ \y\ = \\Ax\\},
x £ domA0,
is called the minimal section of A. First results on minimal sections are contained in the following lemma:
20
Chapter 1. Dissipative and Maximal Monotone
Operators
1.19. Lemma. Assume that X* is strictly convex and that A is a maximal dissipative operator on X. Then the following is true: a) If X is strictly convex, then A0 is single-valued. b) If X is reflexive, then domA 0 = dom A Proof, a) Let x G domA 0 be given. By Lemma 1.14 Ax is a closed convex subset of X. We choose 2/1,2/2 £ A°x, which implies \yi\ = \y%\ = infzeAx \z\. For any a G (0,1) we have ay\ + (1 - a)2/2 G Ax and \ay\ + (1 - a)y^\ < \yi\. By minimality of \yi\ we conclude that \ay\ + (1 — 0)2/2! = |j/i| = I2/2j- Since X is strictly convex, this implies 2/1 = 2/2b) We choose a; G dom A As in part a) of the proof we see that Ax is closed and convex. Let (yn)ne^ D e a minimizing sequence in Ax, i.e., we have lim \y„\ = \\Ax\\. n~+oo
The sequence (yn) is bounded and by reflexivity of X weakly relatively sequentially compact, so that there exists a weakly convergent subsequence (ynk), w- lim ynk = y G X. k—i-oo
By Mazur's theorem Ax is weakly closed, which implies y G Ax. For any e > 0 we can choose x* € X* such that (observe that \y\ = sup| a .,r =1 \(y, x*}\) (\V\ - e)|a:*| < |(2/,<)| = lim \(ynk,x*e)\ < ||Ac|| \x*e\, k—>oo
which implies |j/| < ||Ar||. By definition of ||Ar|| we have \y\ = \\Ax\\, so that xGdomA0. U 1.20. Theorem. Assume that X* is uniformly convex and that the operator A on X is m-dissipative. Then the following is true: a) For each x G domA, FA°x is single-valued and limxi.0FA\x = FA°x. b) If we assume in addition that X is uniformly convex, then we have UmA\x = A°x,
x G domA
AJ.0
Proof, a) Since X* is uniformly convex, X* is reflexive and so is X. Therefore by Lemma 1.19 we have domA 0 = domA. From Lemma 1.14 we see that Ax is a closed convex subset of X for any x G domA. We choose y G A°x, i.e., |2/| = min z£j 4 x \z\. For any z G Ax and a G [0,1] we have \y\ < \(l-a)y
+ az\.
By definition of (•, •)+ this implies (z-y,y)+
>o,
ZGAX,
1.3. Properties of m-dissipative
operators
21
and consequently also (z - y,y)s > 0. Since F is single-valued (see Proposition 1.1, b)), we have (z-y,y)i = (z-y)s = Re(z-y,Fy) = Re(z,Fy) - \y\2. This implies Re(z,Fy)>\y\2,
(1.21)
z £ Ax.
We choose 2/1>2/2 £ A°x. Then, for 2 = 2/2 and y = yi, (1.21) implies |2/i|2 < ReOfc.ify) < 1(2/2,^2/1)1 < |l/i| I2/2I = |2/i|2, so that we have (2/2,-^2/1) = I2/1P = I2/2I2 and |Fj/i| = (3/21 - This shows Fj/2 = Fj/i, i.e., FA°x is single-valued. By Theorem 1.10, (iii), for w = 0 we have I-AA^I < ||Ar||,
A>0, sedomA.
Since (AA:E)A>O is bounded and X is reflexive, for any sequence (A„) with A„ J, 0 there exists a subsequence, which we denote again by (A„), such that ( ^ A , , ^ ) is weakly convergent, y = w-limn^^ A\nx. By Theorem 1.10, (ii) and (iii), we have A\nx 6 AJ\nx and lim„^.oo JXnx = x. Therefore Theorem 1.17, (i), implies that [x,y] 6 A. From AXnx —»• y and y € Ax we get \\Ax\\ < \y\ < liminf \AXnx\ < limsup|AA„3;| < ||j4.a;||, so that \y\ = \\Ax\\ = limn^oo | 4 A „ Z | , i.e., y e A°x. Since \FA\nx\ = |A\ n a?| < \\Ax\\, we see that FAXnx is bounded in the reflexive Banach space X*. Therefore it has a weakly convergent subsequence, which we again denote by FAXnx. We set y* = w-limn^oo FAXrlx. Dissipativity of A implies (note that A\nx 6 AJXnx) Re(AXnx
- y, FAXnx)
= — Re(AXnx
and consequently |ylAna;|2 < Re(y,FAXnx). R-e(2/>2/*). Combining this with (1.22)
- y, F{JXnx - x)) < 0 For n -> 00 we obtain \y\2 <
|2/*| < lim \FAXnx\ = lim \AXnx\ = \y\
we get \y\2
= Fy.
n—too
Since y G A°x and FA°x is single-valued, we have Fy = FA°x. Thus we have shown that for any sequence (A„) with An 4, 0 as n —> 00 there exists a subsequence which converges to FA°x. This implies limAj.o FAxx = FA°x.
Chapter 1. Dissipative and Maximal Monotone
22
Operators
b) Assume now that X is also uniformly convex and choose x € dom A Under a) we have shown that, for any sequence (A„) with An 4- 0, there exists a subsequence (which we again denote by (A„)) such that (A\nx) is weakly convergent, y = w-lim„_>.00 A\nx. Moreover, we have shown that [x,y] E A and \y\ = \imn->00\A\nx\. Since X is uniformly convex, A0 is single-valued (see Lemma 1.19, b)). Thus we have y = A°x and l i m ^ ^ |AAn:r| = \A°x\. Uniform convexity of X implies (1.23)
lim AXnx = A°x. n—>oo
Thus we have proved that, for any sequence (A„) with A„ 4- 0, there exists a subsequence such that (1.23) holds. This proves limA4.0A.A2: = A°x. • The question if an m-dissipative operator is uniquely determined by its minimal section has an affirmative answer in spaces with uniformly convex dual. 1.21. Theorem. Assume that X* is uniformly convex and A, B are m-dissipative operators on X. Then the following is true: a) 7/dom A = domB and A°x n B°x =£ 0 for all x e AomA, then A = B. b) IfA° = B°, thenA = B. Proof. Statement b) follows immediately from a). Indeed, by uniform convexity of X* we have that X* is reflexive, which in turn implies reflexivity of X. Then Lemma 1.19, b), shows that dom^l 0 = dom A and d o m B 0 = domB. In order to prove statement a) we define a single-valued operator C on X such that domC = dom A = domB and Cu G A°u n B°u for u G domC. It is clear that (1.24)
\Cu\ = \\Au\\,
uedomC.
For a fixed x £ dom 2? = dom A we choose y £ Bx. Since we have Cu e B°u c Bu, dissipativity of B implies (note that F is single-valued) (1.25)
Re{y - Cu, F(x -u))
<0,
u£ dom C.
We consider first the case y = 0. Then inequality (1.25) becomes (1.26)
Re{Cu, F{x-u))>0,
u£ dom C.
Let J\ = ( 7 - A J 4 ) _ 1 and set u — J\x. Observing F(x—J\x) —X~1FA\x inequality (1.26) can be written as (1.27)
Re(CJxx,FAxx)
< 0,
= F(—\~1A\x)
A > 0.
From Theorem 1.10, (ii) and (iii), and (1.24) we get the estimate (1.28)
\CJxx\ = \\AJxx\\ < \Axx\ < \\Ax\\,
A > 0.
—
1.3. Properties of m-dissipative
operators
23
This shows that the set {CJ\x | 0 < A < 1} is bounded. Since X is reflexive, there exists a sequence (An) C (0,1] with limn^oo A„ = 0 and a v G X such that w-lim„_>oo CJ\nx = v. From Theorem 1.10, (hi), we see also that limA4.o J\x = x. Demi-closedness of A (see Theorem 1.17) implies v G Ax. According to Theorem 1.20, a), FA°x is single-valued and limAio FA\x = FA°x. This together with w-limn-x^ CJ\nx = x and (1.27) implies (1.29)
Re(v,FA°x)
< 0.
We choose z £ A°x. Then Fz = FA°x. By Lemma 1.14 the set Ax is convex, so that, for 0 < a < 1, we have z + a(v — z) — (1 — a)z + av G Ax and therefore \z + a(v-z)\
> \\Ax\\ = \z\,
0 < a < 1.
This implies
\z\) > 0.
all) (X
By Lemma 1.3, c), we have (note that F is single-valued) Re(^ — z,Fz) (v — z,z)+\z\. This and the last inequality imply
=
0 < Re(v - z, Fz) = Re(v, Fz) - \z\2. This and (1.29) give \z\2 < Re(v,Fz) < 0, i.e., z = 0. Thus we have shown that A°x = {0}, i.e., 0 e A i . If y ^ 0, we define the operators A, C by Au = Au — y,
Cu = Cu — y,
u € dom A = dom A = dom C\
It is easy to see that A is also m-dissipative. By definition of A and C we have (1.30)
| C u | < | C u | + |i/| = ||Au||-l-|i/|<||i«||-l-2|y|,
uedomA.
Instead of (1.28) we get for u = J\x the estimate ICJA^I < ||Ar|| + 2\y\, A > 0, where we have set J\ = {I — A^4)_1. Observing Re(y — Cu, F(x — u)) = — Re(Cu, F(x — u)) we get from (1.25) the inequality Re(Cu,F(x-u))
> 0.
Starting with this inequality instead of (1.26), taking A, C instead of A, C and using (1.30) instead of (1.24) we conclude that 0 G A, i.e., y G Ax. Since y G Bx was arbitrary, we have shown that Bx C Ax. Analogously we have Ax c Bx, so that Ax = Bx for all x G dom A = dom B. Thus we have A = B. a 1.22. Theorem. Assume that X is uniformly convex and that the operator A is m-dissipative. Then dom A is convex.
24
Chapter 1. Dissipative and Maximal Monotone Operators
Proof. We set Q = {x G X | J\x —»• x as A 4- 0}. For all x G X we have J\x G domA, which proves Q C domA. By Theorem 1.10, (hi), we have \J\x — x\ < A||Azj| for x G domA, which implies J\x -t x as A | 0, i.e., domA C Q. We next prove that Q is closed. Let (xn) C Q with xn —• a; be given. Using Theorem 1.10, (i), we get \J\x -x\<
\J\x - J\xn\ + \J\xn - xn\ + \xn - x\ < 2\x - xn\ + \J\xn - xn\,
n = 1, 2 , . . . , A > 0,
which implies J\X —» a; as A | 0, i.e., x £ Q. From closedness of Q and dom A C <3 C dom A we get dom A = {a; G X \ J\x -t x as A 4- 0}. In order to prove convexity of dom A we choose X\,X2 G dom A, 0 < a < 1 and set x = ax\ + (1 — a)a;2. Then we have (using Theorem 1.10, (i)) \J\X - Xi\ < \X - Xi\ + \JXX! -
Xt\,
\J\X - X?\ < \X - X2\ + \J\X2 — X2\,
A > 0.
Each of these estimates implies that (JA^)A>O is bounded. As a uniformly convex space, X is also reflexive. Therefore there exists a sequence (An) with Are 4- 0 s u c n that {J\nx) is weakly convergent, z = •w-\\m.n^,00 J\nx. From (1.31) for A = An we obtain, taking n —> oo, \z — xi\ < liminf \J\x
- xi\ < \x — x\\ = (1 - a)\x\ - x2\,
n—•oo
\z — x2\ < liminf \J\nx - x2\ < \x — x2\ = a\x\ — x2\ n—•oo
and consequently \x\— x2\ < \z — Xi\ + \z — x2\ < \xi — x2\- This together with the previous two inequalities prove \z — X\\ = \x — xi\ and \z — x2\ — \x — X2\If we set n = (1 — a)\xi — x2\, r2 = a\x\ — x2\, then we have shown that
i,ze B(xi,n) n B(x2,r2). Assume that x ^ z and set x$ = (x + z)/2. Then by strict convexity of X we see that \XQ — X \ \
= \xi - x2\ < \xi - xQ\ + \x2 - x0\ < ri + r2,
a contradiction, which proves x = z and w-lim J\nx = x. n—*-oo
From w-lim„_+00(JAna; - J\nx\)
= x — x\ and Theorem 1.10, (i), we get
\x - X\\ < liminf \J\nx — J\nX\\ < limsup|JA n a: - J A ^ I I < \x - xi\, i.e., we have l i m , ^ ^ \J\nx — J\nx\\ = \x — X\\. Since X is uniformly convex, we obtain linin^oo(J\ n x — J\„x\) = x — x\, so that in view of J\nx\ -> X\ we have linin-yoo J\nx = x, which proves x G domA. •
1.4. Perturbation
1.4.
results for m-dissipative
operators
25
Perturbation results for m-dissipative operators
In many cases the operator under consideration can be viewed as a perturbation of an m-dissipative operator. Therefore it is important to know whether the sum of an m-dissipative operator and another operator is again m-dissipative. We start with a result on A + Bx, where Bx as usual denotes the Yosida approximation of B. 1.23. Lemma. Let A and B be m-dissipative operators on X. Then for every y G X and X > 0 the equation (1.32)
yexx-Axx-
Bxxx
has a unique solution xx G domvl. Proof, Equation (1.32) is equivalent to y = x\—w\—B\x\ The last equation in turn is equivalent to
Xx
- xTTWx = xT~iy + xh{xx = xl~iy +
for some wx G Axx.
+ XBxXx)
-xTi{I-XBrlxx-
Since A is m-dissipative, we conclude that (1.32) is equivalent to the fixed point equation
(i.33)
* - (' - TTSY1 =: T\xx,
(XTT»+ITT<' -
iB
>^»)
A > 0.
By m-dissipativity of the operators A and B their resolvents are contractions on X. This implies \FxXi -F\x2\
< T——-\xi -x2\, A+ 1
xi,x2
&X, A > 0,
i.e., the fixed point equation (1.33) has a unique solution x\ for any x e X and A > 0. From (1.33) it is also clear that xx £ dom A. • 1.24. Theorem. Assume that X* is uniformly convex and that A, B are mdissipative operators on X with dom A n dom B ^ 0. For y € X let xx denote the unique solution of (1.32), A > 0. Then the following is true: a) xx is bounded for A > 0. b) If B\xx (1.34)
is bounded as A J, 0, then the equation y £ x - Ax - Bx
has a unique solution x G dom An dom B and x = Iim^ox^. If for any y G X the corresponding family Bxxx is bounded as X 10, then A+B is m-dissipative.
Chapter 1. Dissipative and Maximal Monotone
26
Operators
Proof. Since X* is uniformly convex, the duality mapping F on X is singlevalued (cf. Proposition 1.1, c)). We choose u G dom A n dornB, z G Au and set v\ = u — z — Bxu. For some yx G AXA we have (1.35)
y = xx-yx-
Bxxx.
Dissipativity of A and Bx (cf. Theorem 1.10, (vi)) implies \y-v\\
\x\ -u\>
Re(y - vx, F(xx - u)} = Re(xx - u, F(xx - u)) - Re(yx - z, F(xx - u)) - Re(Bxxx
- Bxu, F(xx - u)}
2
>
\xx-u\ .
Hence we have by Theorem 1.10, (Hi), the estimate \xX - u\ < \y - vx\ < \y - u + z\ + \Bxu\ < \y - u + z\ + \\Bu\\, i.e., \xx\ is bounded on A > 0. Using (1.35) and dissipativity of A we get 0 < Re(j/M - yx,F(xx = -\xx
- zM))
- xrf + Re{Bxxx
+ Re{Bxxx
- Bfa,
- Blix)jnF{xx
F{J^xx
-
- xM) - F ( j f xA - J*x M )),
where we have set Jx — (I — A S ) - 1 . Using [J^xx,Bxxx] dissipativity of B we obtain \xx - z M | 2 < \Bxxx - B^Xfi\ \F{xx - xj
J^x^))
- F(J^xx
G B for A > 0 and
- J,f x M )|,
A, /x > 0.
By assumption we have \Bxxx\ < c, 0 < A < Ao, for some positive constants c, Ao- For A,/i G (0, A0] we get \Jxxx — xx\ < cX and consequently \xx — tfxjl < c(X + fi). Observing | j f z A | < \xx\ + \J*xx - xx\ < Xfl - (jj?xx \xx\ + c\ < \xx\ +c\o and boundedness of xx we see that Jxxx is also bounded on (0,Ao]. By uniform continuity of F on bounded sets (see Proposition 1.1, c)) we have lim \xx -xJ
A,A40
=0,
i.e., (xx) is a Cauchy family as A ! 0. We set x = limAj.o^A- This and boundedness of Bxxx as A J. 0 imply (see Theorem 1.17, (ii)) x G domB. Moreover, by reflexivity of X there exists a, w £ X and a sequence Xn ], 0 such that w-limn-^oo BXnxXn = w. By Theorem 1.17, (ii), this implies w G Bx. From equation (1.35) we see that yx G Axx is bounded as A J. 0. As above we conclude that there exist a z e X and a subsequence of (A n ) n£ N, which we again denote by ( A „ ) „ € N , such that w-linin^oo yXn = z. Since A is demi-closed
1.4. Perturbation
results for m-dissipative
operators
27
(see Theorem 1.17, (i)), this implies x G dom A and z G Ax. Taking in (1.35) with A = A„ the weak limit as n —> oo we obtain y = x — z — w, i.e., y G x — Ax — Bx. If x\,X2 are two solutions of (1.34), i.e., Xi = y + Zi + wi with z* G Axi, Wi G Bxi, i — 1,2, then dissipativity of A, B implies \%i ~ %2\2 = Re(zi - z2, F(xi - xi)) + Re(w\ - w2, F(x\ - x2)) < 0, which shows x\ = x2. If for any y G X and the corresponding family xx, A > 0, of solutions of (1.32) the family B\X\ is bounded as A \. 0, then range(I - (A + B)) = X. Dissipativity of A + B follows from dissipativity of A, B and the fact that the duality mapping F is single-valued (see Proposition 1.1, c)). • 1.25. Corollary. Assume that X* is uniformly convex and that the operators A, B are m-dissipative onX with dom Andom B ^ 0. Furthermore, we assume that Re(v, FBxu)
> 0 for all [u, v} 6 A and A > 0.
Then A + B is m-dissipative. Proof. For y G X let x\ be the unique solution of (1.32), so that B\X\ x\— y — y\ for some y\ G Ax\. From this equation we get \Bxxx\2
= Re(xx - y, FBxxx) < \xx - y\ \FBxxx\
This and Theorem 1.24, a), prove that Bxxx follows from Theorem 1.24, b).
- Re(yx, < (\xx\ +
=
FBxxx) \y\)\Bxxx\.
is bounded as A J, 0 and the result •
1.26. Corollary. Assume thatX* is uniformly convex and that A,BcXxX are m-dissipative operators with dom A C dom B. Moreover, we assume that for any r > 0 there exist constants cr G [0,1) and dr > 0 such that (1.36)
||Bx|| < c r ||Ac|| + dr
for all x € dom A with \x\ < r.
Then the operator A + B is m-dissipative. Proof. We choose y G X. According to Lemma 1.23 and Theorem 1.24, a), there exist, for any A > 0, elements [xx,y\] € A such that \xx\ < r, A > 0, for some r > 0. Since we have range(7 — XB) = X, it follows from Theorem 1.10, (iii), that \Bxx\ < \\Bx\\
for all x G domB.
28
Chapter 1. Dissipative and Maximal Monotone
Operators
This together with xx € dom A c domJS and (1.36) imply (1.37)
\Bxxx\
< \\Bxx\\ < cr\\Axx\\ + dr < cr\yx\ +dr,
From Bxxx = xx — y — yx we conclude that together with (1.37) give (l-cr)\yx\
|I?A£A|
> \yx\ — \xx — y\, which
< \xx - y\ + dr < r + \y\ + dr,
This shows that yx and, in view of (1.37), also Bxxx Then the result follows from Theorem 1.24.
A > 0.
A > 0.
are bounded on A > 0. •
The next results are concerned with continuous perturbations of dissipative operators. We shall need some preparatory results and also some results on nonlinear semigroups which are special cases of results on general evolution problems and are stated in Chapter 6. 1.27. Lemma. Assume that A is a dissipative operator on X and let x € dom A. Furthermore, let (\n)neN be a sequence with Xn I 0 and ( X „ ) „ € N be a sequence with xn £ range(7 — XnA) and lim,!-,.,^ xn = x. Then we have also lim JXnxn
— x.
n—¥oo
Proof. We choose elements [uk,Vk] G A, k = 1,2,..., with limfc_>00Mfc = x. By Theorem 1.10, (ii), we have A~ 1 (J A „x„ - xn) € AJXnxn. Consequently dissipativity of A implies -Uk\< J\nXn
\J\nxn
= \xn -Uk
-Uk+
\n(-T-{J\nXn
- Xn)
-
Vk)
\„Vk\-
From this we get IJ\„x n - x\< \JXnxn - uk\ + \uk -x\<
\xn -uk
+ \nVk\ + \uk - x\.
For fixed k this implies (taking n —¥ oo) 0 <\im.sup\JXnxn-x\
<2\x-Uk\,
A; = 1,2,... .
The result follows if we take k —> oo. 1.28. Proposition. Assume that A is a dissipative operator on X and that B is an operator with domB z> dom A. Furthermore, let B be continuous on dom A and assume that A+B is dissipative. Then the following two statements are equivalent: 1 (i) liminf - dist(range(7 - X(A + B)), x) = 0 for all x G dom(A + B). A.J.0
A
(ii) liminf — dist(range(J - \A), x + XBx) = 0 for all x £ dom A. A4-0
A
•
1.4. Perturbation
results for m-dissipative
operators
29
Proof. We first note that dom A = dom(A + B), which follows from dom(A + B) = dom A n dom B = dom A n dom B. a) In order to prove that (i) implies (ii) we choose x e dom A and a sequence 1 ( A „ ) „ € N with A„ I 0 and l i m ^ o o A" dist(range(7 - Xn(A + B)),x) = 0. For any n = 1,2,... there exists a pair [un, vn] € A such that (1.38)
\un - Xn(vn + Bun) -x\<
dist(range(7 - \n(A + B)),x)
1
We set zn = A~ (w„ - Xnvn - XnBun (1.38) that (1.39)
+ X\.
- x), n = 1,2,..., and conclude from
lim zn = 0 n—foo
and Xn\zn\ = |u n - \nvn - x - XnBx - \n(Bun
- Bx)\
> \un - Xnvn - (x + AnBa;)| - \n\Bun
- Bx\.
The last inequality implies (1.40)
dist(range(J - \nA),x
+ XnBx) < An|2n| + Xn\Bx
— Bun\.
The definition of zn implies (1.41)
x + Xnzn = un - Xnvn - XnBun
£ (I - Xn(A + B))un.
Since A + B is dissipative, this gives un = (I - Xn(A + B))~1(x + Xnzn). From (1.39) and (1.41) we see that WG C8LI1 tcLKG X-n — X ~\~
^n%n
in Lemma 1.27 (for A + B instead of A), which implies linin-Kx, un = x. By continuity of B we have lim„_>oo \Bun — Bx\ = 0, which together with (1.39) and (1.40) imply (ii). b) In order to prove that (ii) implies (i) we choose x e dom(A + B). According to (ii) there exists a sequence ( A „ ) „ € N with A„ 10 and liminf — dist(range(7 — XnA), x + XnBx) = 0. n-»oo A n
For n — 1,2,... we choose [un, vn] e A such that (1.42)
|a; + XnBx - (u„ - Xnvn)\
< dist(range(7 - XnA),x + XnBx) + Xn.
We set zn = A" 1 (a; + XnBx — un + Xnvn). From (1.42) and (ii) we conclude that limn^oo zn = 0 and, as in part a) of this proof, that (1.43)
dist(range(7- Xn(A + B)),x)
< Xn\zn\ + Xn\Bun
- Bx\.
30
Chapter 1. Dissipative and Maximal Monotone
Operators
For xn — x — Xnzn + \nBx, n = 1,2,..., we get linin^oo xn — x and xn — un — Xnvn G (I — XnA)un. From Lemma 1.27 we see that lim un = lim (I — XnA)~1xn
= x,
which by continuity of B implies lim n ^oo Bun = Bx. (1.43).
Thus we get (i) from •
The following perturbation theorem is due to Y. Kobayashi (see [Kb]) and the proof we give here needs the generation Theorem 6.27 for nonlinear semigroups. 1.29. Theorem. Assume that the operator A is m-dissipative on X and let B be an operator with dom A C d o m 3 which is continuous on domA. If A + B is dissipative, then it is m-dissipative. Proof. We choose y G X and define the operator C by Cx = Ax — x + y,
x £ dom A.
Since A is dissipative, the operator C + I is also dissipative, i.e., C is wdissipative with w — — 1. The operator C is also m-dissipative. Indeed, the equation z € (/ — C)x is equivalent to 2 _ 1 (z + y) g (7 — 2~lA)x, which by m-dissipativity of A has a solution x e dom A. The operator C + B = A + B — I + y is w-dissipative with to = — 1, because A + B is dissipative. Since C is m-dissipative, it follows that (ii) of Proposition 1.28 holds for C (and any B). This implies (1.44)
l i m i n f - d i s t ( r a n g e ( J - X(C + B)),x)
=0
for all x G dom(C + B) = dom A. From Theorem 6.27 we conclude that C + B generates a Co-semigroup S(-) of type —1 on dom A. Since S(-) is of type — 1, there exist for any t > 0 a unique xt G dom A with S(t)xt = xt. From S(s)xt — S{s)S(t)xt = S(t)S(s)xt and uniqueness of xt we get xt = S(s)xt, which in turn implies xs — xt, t, s > 0. Thus there exists a unique element z G dom A with S(t)z = z, t > 0. Since u(t) = S{t)z = z is the unique integral solution of (d/dt)u G Au, u(0) = z (see Theorem 6.27), we have for all [u, v] G C + B and all t > 0 the inequality (see (6.45) with r — 0 and fp = 0) 0 < / ((v, z - u)+ - \z - u\) da — t((v,z - u}+ - \z - u\), Jo which implies (v, z - u)+ > 0 for all [u, v] eC + B.
1.4. Perturbation
results for m-dissipative
operators
31
Since v = w — u + y + Bu for some w £ Au, we get (1.45)
(w + Bu - u + y, z - u)+ > 0 for all [u, w] € A.
From (1.44) with i = zwe see that there exist a sequence (A„)neN with An l 0 and elements [x„,y„] G A such that zn •=
T— (xn
- Xn (yn + Bx„ - xn + y) - z) -J> 0 as n -J- oo.
From a;„ - z - A„zn = A„(y„ + Bxn -xn (Xy,x)+ = X(y,x)+ for A > 0) U fi (^n — Z — \nZn,
+ y) and (1.45) we obtain (using also
Z — £ n / 4 - = — |z — Xn\ + ( — A n Z n , Z — Xn) +
< -\z-xn\
+ \n\zn\,
n=l,2,....
This and limn^oo zn = 0 imply lim — | z - Z n | = 0. n->oo Are 1
Observing yn = X~ (xn ~ z) + xn — y — zn — Bxn and continuity of B we get lim t/n = z - y -
Bz.
Closedness of yl (see Theorem 1.16, (i)) implies z G dom A
and
z -y - Bz e As.
Thus we have y e (I-(A + B))z, i.e., range(7 - (A + B)) = X . D 1.30. Corollary. Assume that the operator A C XxX is m-dissipative and let B C XxX be a dissipative continuous operator with dom B = dom B D dom A satisfying liminf — dist (range(/ — XB), x) = 0 for all x e domB. Then A + B is m-dissipative. Proof. According to Theorem 6.28 the operator B is strictly dissipative, which together with dissipativity of A implies that A + B is also dissipative. Then the result follows from Theorem 1.29. • The following two corollaries contain results given by R. H. Martin, Jr., and V. Barbu (see [Ma] resp. [Bbl]): 1.31. Corollary. Assume that B is a continuous dissipative operator with dornB = X. Then B is m-dissipative and strictly dissipative.
Chapter 1. Dissipative and Maximal Monotone Operators
32
Proof. The operator A = X x {0} is evidently m-dissipative. Then Theorem 1.29 implies that B = A + B is m-dissipative. That B is also strictly dissipative follows from Theorem 6.28. • Using Corollary 1.31 we get the following variant of the perturbation result given in Corollary 1.30: 1.32. Corollary. Assume that the operator A C X x X is m-dissipative and that B is a continuous dissipative operator with domB = X. Then A + B is m-dissipative. Proof. By Corollary 1.31 the operator B is strictly dissipative. Hence A + B is dissipative. Then the result follows from Theorem 1.29. • 1.5.
Maximal monotone operators
For our investigations of the Cauchy problem (8.1) in Chapter 8 we shall use results on maximal monotone operators. Throughout this section X will be a real Banach space. 1.33. Definition. Let the operator A C X x X* be given. a) The operator A is called monotone if and only if (xi - x2,y\ - 2/2> > 0
for all [xi,yi], [22,2/2] G A.
A monotone operator A is called maximal monotone if and only if any monotone extension of A coincides with A. b) The operator A is called coercive if and only if there exists an xo e X such that for all sequences ([xn,yn]) C A with linin^oo \xn\ = oo we have (1.46)
hm
1—;
n->oo
\xn\
= oo.
c) Assume that A is single-valued with dom A = X. The operator A is called hemi-continuous on X if and only if, for all x\, X2, x G X, the function R - + 1 defined by A —> (a;, A{x\ + A22)) is continuous on K. 1.34. Example. Let F be the duality mapping of X. Then F is monotone and coercive. Indeed, for [21,2/1], [22,3/2] £ F we have (1.47)
(Xi - 2 2 , 2 / 1 - t / 2 ) = | 2 i | 2 - (21,2/2) - (22,2/l) + | 2 2 | 2
„
>(|2l|-|22|)2>0,
which proves monotonicity of F. Coercivity is obvious. In order to prove the analogue to Theorem 1.12, c), we need some properties of monotone operators which are also of independent interest.
1.5. Maximal monotone
operators
33
1.35. Lemma. Let X be a real reflexive Banach space. a) Assume that M C X is bounded and that A C M x X* is monotone. for each x* G X* there exists an x G co M such that
Then
(u - x,v — x*} > 0 for all [u, v] G A. b) Let A C X x X* be monotone and assume that range A is bounded. Then, for each i £ l , there exists an x* G co(rangeA) with (u — x, v — x*) > 0 for all [u,v] G A. Proof, a) Let a;* G X* be fixed. For each [u, v] G A we define X(u,v)
= {x e c o M | (u-x,v
-x*)
> 0}.
Since we have dom A c M, we see that u G X(u, v), i.e., X(u, u) is not empty. It is also easy to see that X(u, v) is convex and closed, which implies that X(u, v) is weakly closed. This together with boundedness proves that X(u, v) is weakly compact. Therfore in order to prove f],u ,eA X(u, v) ^ 0 it is sufficient to show that n i=l
for any finite number of elements [iii,v»] G A, i = l , . . . , n . We define the convex and compact subset C C M.n by n
C = {a G K" | Qi > 0, i = l,...,n,
^ a
t
= l}
»=i
and the continuous bilinear functional ip : C x C —> R by n
V>(a,/?) = J3Pi{x{a) -Ui,Vi-x*),
a,(5 G C,
where a;(a) = S ? = i ajuj- As on page 16 in the proof of Lemma 1.13 we see that there exists an a0,0° G C such that rp(a°, (3) < V>(/3°, /3°)
for all /3 G C.
Monotonicity of A implies n
n
»=1 J = l ~ n n
-
= 2*52^
aiaj Uj
(
u
v x
n
n
~ i> i- *) ~ 2^l2Ylaiai(ui
-Ui,Vj -x*)
34
Chapter 1. Dissipative and Maximal Monotone
»=1
Operators
j=l
which proves V>(a°,/?)<0
forall/3eC.
Taking (3 with fij = 0 for j ^ i and ft = 1 we get (x(a°) — ui, Vi — x*) < 0,
i = 1 , . . . , n,
i.e., z(a°) G HiLi -X"(Mi,Ui). b) We identify X** and X and consider A~l C X* x X as monotone operator in X* x X**. Obviously we have d o m A - 1 = ranged so that we can apply statement a) for A - 1 . This proves that for any x G X**, there exists an x* G co(rangeA) with 0 < (u — x)(v — x*) = (u — x,v — x*). U 1.36. Theorem. Let X be a real reflexive Banach space and K c X be non-empty, convex and closed. Assume that A c K x X* is monotone with 0 G domA and that B : K —» X* is monotone, hemi-continuous, bounded on bounded sets and coercive with XQ = 0 in (1.46). Then there exists an x G X such that (u — x,v + Bx) > 0 for all [u, v] 6 A. Proof. The proof of this theorem follows the one given in [Pavl, pp. 45ff.]. a) We first assume that A is a finite set and define P = co(domA),
Q = co(rangeA).
The sets P and Q are compact with P C K. By Zorn's lemma we can prove that there exists a monotone extension A of A which is maximal among all monotone extensions of A in P x Q, A c A C P x Q. Since we have range A c Q, we can apply Lemma 1.35, b), to A and see that, for any x G P, there exists an x* e co(range A) = Q such that (u - x, v - x*) > 0 for all [it, v] G A. By maximality of A we conclude that [a;, a;*] G A. Since x G P was arbitrary we have shown that dom A — P.
1.5. Maximal monotone
operators
35
The set A\ = {[#, y + Bx] \ [x, y] £ A} is monotone and we have dom A\ — domA = P. According to Lemma 1.35, a), with M = P and x* = 0 there exists a n i E P such that (u - x, w) > 0
for all [u, w] £ Ax
or, equivalently, (1.48)
{u-x,v
+ Bu)>0
for all [u, v] £ i .
We fix [u, v] e A From u,x £ P and convexity of P we see that wt = x + £(M — x) £ P = domA for all t G [0,1]. Moreover, for any t e [0,1] there exists a i>t such that [ut,vt} £ A. Inequality (1.48) implies 0 < {ut - x,vt + But) = t(u-
x,vt + But),
t e [0,1],
and consequently (1.49)
(u-x,vt
+ But)>0,
<€(0,l].
By monotonicity of A we have 0 < (u-ut,v-vt)
= (1 -t)(u-x,v-vt),
te [0,1],
which implies (u-x,v-vt)>0,
iG[0,l).
This inequality and (1.49) show that {u-x,v
+ B(x + t(u -x)))
>0,
te (0,1).
Hemi-continuity of B implies, for t J. 0, (u — x, v + Bx) > 0 for all [u, v] £ A, which proves the result for finite A. Note that this part of the proof did not use the assumption 0 £ domA. b) Let A satisfy the assumptions of the theorem and denote by A? a monotone extension of A which is maximal in K x X*, A C A-z C K x X*. We define Q = {G C AI I G is monotone and finite with 0 £ domG}. For each G £ Q we set BG = {[x,Bx] \x£
K, (u-x,v
+ Bx) > 0 for all [u,v] £ G}.
Part a) of the proof shows that BQ is not empty. For x £ dom BQ we have (x,Bx)
< {u,Bx) - (x,v),
[u,v] £ G.
We choose u = 0 and v £ GO, which implies —Ax,Bx)
< \v\
for all x £ dom Be-
36
Chapter 1. Dissipative and Maximal Monotone
Operators
From (1.46) with xo = 0 we see that domBc is bounded. This implies that BG is bounded, because B maps bounded sets onto bounded sets. Since X is reflexive, boundedness of BQ implies that the weak closure BQ of BQ is weakly compact. From BQX n BQ2 = BQ1UG2, GI,G% G Q, we see that for any finite number G\,..., Gn of sets in Q we have pl?=i BGi =£ 0- Note that, for G\,G2 G Q, the finite operator G\ U Gi is monotone, because G\ U G
bo.zoie n ^w-
Gee Convexity and closedness of K implies K = K, so that B Q c i f x X*. Thus we have xo G if. Our next goal is to prove that (1.50)
(u - x 0 , v + Bx0) > 0 for all [u, v] G A 2 .
We claim that [xo, — XQ] € ^ 2 - To this end we remind the reader that [x, Bx] G Bg if and only if (1.51)
(u -x,-v-
Bx) < 0 for all [u, v] G G.
For [xi, Bxi] G BG, i = l,...,n, and Xi > 0, i = 1 , . . . , n, with JZ™=1 A* = 1 we set [x,y] = Yl7=i ^i[xi,Bxi\. Then easy computations show that n
n
- ^jAjXj, - v — } i=l 1
n
XjBxj)
j=l n n
n
— ^ ^ A i A j ( w - x^ —v - BXJ) i—1 j=l
= r 5Z 5Z ^^' ((u ~ xi' ~v ~ Bx^
+
(xi ~ Xi>Bxi ~ Bx^
+ (u — Xi, —v - Bxi) J < 0. Here we have used (1.51) and monotonicity of B. Thus we have shown that (u — x, -v - y) < 0 for all [x, y] G co .BG and [u, v] G G. It is clear that this inequality is also true for all [x,y] G COBQ- Since [XO,XQ] G BQ C c o B G — coBG, we have proved that (1.52)
{u - x 0 , -v - XQ) < 0 for all [u, v] G G.
Obviously (1.52) is true for all G G Q. Therefore A2 = \JGeg G implies (u — xo, v + XQ) > 0 for all [u, v] G A%. This implies [xo, —x^] G A^, because A-z is maximal monotone in K x X* and x 0 G K. We choose w G A2O and define, for any [u, v] G A2, the set Go G Q by Go = {[0,U/],[M,U],[X 0 ,-XO"]}.
1.5. Maximal monotone
operators
37
For any x G dom BG0 we have in particular (1.53)
(u - x, v + Bx) > 0,
(x0 - x, -x*0 + Bx) > 0.
We set ut = Xo + t(u — xo) G K, t G (0,1). Observing monotonicity of B and ut - x = (1 — t)(x0 — x) + t(u — x) we get, for t 6 (0,1), 0 < {ut - x, But - Bx) = t(u - x, But - Bx) + (1 - t)(x0 - x, But -
Bx).
This together with (1.53) implies 0 < t(u-x,v
+ But) + (1 -t)(x0-x,
-xl + But),
i G (0,1), x £
domBGo.
For ar = xo this gives (w-a;o,w + B(a;o + t(u-a;o))) > 0,
i € (0,1), [u,v] <= A2.
Hemi-continuity of B implies, for t 4- 0, (u -
XQ,
v + Bxo) > 0 for all [u, v] e A^,
which is (1.50).
•
The next theorem characterizes maximal monotone operators in real Banach spaces4 by a range condition (see [Min] for the Hilbert space case which is Theorem 1.12, c), and [Bro] for the general case): 1.37. Theorem. Assume that X, X* are reflexive and strictly convex. Let F denote the duality mapping of X and assume that A c X x X* is monotone. Then A is maximal monotone if and only if (1.54)
range(AF + A) = X*
for all A > 0 (or, equivalently, for some A > 0). Proof, a) Assume that (1.54) is satisfied for some A > 0 and let [a:o,2/o] € X x X* be such that (1.55)
(x - xo, y - yo) > 0 for all [x, y] G A.
From (1.54) we see that there exists an element [xi,yi] G A with (1.56)
AFm + yi = XFx0 + y0.
From (1.55) and (1.56) we obtain, for [x, y] = [xi,yi], (Xi - X0, FX0 - Fxi) > 0. By monotonicity of F we have also the converse inequality, so that (xi - x0, Fxi - Fx0) = 0. 4
Note that throughout this section we assume that X is real.
38
Chapter 1. Dissipative and Maximal Monotone
In view of (1.47) this implies t h a t |Xo| = | x i | a n d (xi,Fxo) | ceo j 2 - The last two equations imply FXQ = Fx\ and (xuFx0}
= (x0,Fx0}
— \xi\2,
Operators
{XQ,FX\)
—
= \x0\2 = \Fx0\2.
If we denote by F* the duality mapping of X* (which is also single-valued), then the last equation implies XQ = x\ = F*(Fxo). This and (1.56) imply that [£0)2/0] = [xi)2/i] ^ A, which proves that A is maximal monotone, b) Assume that A is maximal monotone and that 0 G dom A. We fix x* G X*, A > 0 and set K — X. The operator B defined by Bx = \Fx — x*, x G X, satisfies the assumptions of Theorem 1.36. Note that demi-continuity implies hemi-continuity. Therefore this theorem implies that there exists an x G X such that (1.57)
(u - x, XFx - x* + v) > 0 for all [u, v] G A.
Since A is maximal monotone, this implies [x,x* — XFx] G A, i.e., x G domj4 and x* G Ax + XFx. Thus we have range(A + XF) — X*. If 0 ^ dom A, we choose tin G dom A and define the operators A= {[u,v] 6 l x l *
[u + Uo,v]
GA}
and Bx — XF(x + «n) — x*, x G X. It is easy to see that A and B satisfy the assumptions of Theorem 1.36 for K = X. Consequently there exists an x G X with (u - x, XF(x + UQ) - x* + v) > 0 for all [u, v] G A, which is equivalent to (1.57) with x = x + UQ.
D
A consequence of Theorems 1.36 and 1.37 is the following corollary: 1.38. Corollary. LetX be a reflexive Banach space and A c 1 x 1 * be a maximal monotone operator. Furthermore assume that the operator B : X —> X* is monotone, hemi-continuous and bounded (i.e., rangeB is bounded). Then A + B is maximal monotone. Proof. By Asplund's renorming theorem 5 we can assume that X and X* are strictly convex. Obviously monotonicity and maximality are invariant with respect to changes to equivalent norms. We can also assume that 0 G dom A. Otherwise we choose UQ G dom A and introduce the operators A = {[u, v] G X x X* | [u + u0, V] G A} and Bx = B(x + u0), x G X, which satisfy also the 5 See [Asp, Theorem 2], where it is stated that on a reflexive Banach space there exists an equivalent norm which is rotund (i.e., strictly convex) and smooth (i.e., the dual norm on X* is strictly convex). Another reference is [Die, Corollary 2 on p. 148], where it is proved that any weakly completely generated Banach space - reflexive Banach spaces are such spaces - has an equivalent norm such that X and X* are strictly convex.
1.5. Maximal monotone
operators
39
assumptions of the theorem. Moreover, A + B is maximal monotone if A + B is. We choose x* £ X* and define the operator B : X —» X* by Bx = Bx + Fx - x*,
x £ X.
It is easy to see that B satisfies the assumptions of Theorem 1.36 for B. We set K = co(dom A) and get from Theorem 1.36 that there exists an x G K such that (u - x, Fx + Bx - x* + v) > 0 for all [u, v] £ A. Since A is maximal monotone, this implies that x* £ Ax + Bx + Fx — (A + B)x + Fx, i.e., we have range(A + B + F) = X*. By Theorem 1.37 the result follows. • Since A = {[u, 0] G X x X* | u € X} is maximal monotone, we get from Corollary 1.38 that a bounded, monotone and hemi-continuous operator is maximal monotone. The next result shows that boundedness is not necessary. 1.39. Theorem. Let X be reflexive. a) / / the operator A : X -* X* is monotone and hemi-continuous, then A is maximal monotone. b) If A
(x - £o, Ax - yo) > 0 for all x G X.
We choose x G X and set xt = txo + (1 — t)x, 0 < t < 1. Then we have 0< {xt- x0, Axt - y0) -(l-t)(xx0, Axt - y0) so that (x - x0, Axt - y0) > 0
for all x £ X, 0 < t < 1.
Hemi-continuity of A implies, for 111, (1.59)
(x - x0, Ax0 - yo) > 0 for all x G X.
This implies AXQ = yo> which contradicts the assumption that A is not maximal monotone. b) We choose XQ G X*. By Asplund's renorming theorem we can assume that X and X* are strictly convex. Prom Theorem 1.37, for any A > 0, there exist an x\ £ dom A and & y\ £ Ax\ with (1.60)
x*0 = yx + XFxx.
40
Chapter 1. Dissipative and Maximal Monotone
Operators
Let XQ £ X be an element such that (1.46) is true. Then we get from (1.60) that {x\ - X0,XQ) = {x\ - x0,yx) + X\xx\2 - X(x0,Fxx) resp. (x\-x0,y\)
, .. , (x\ -X0,XQ) + X\xx\ = ; i \xx\
\x\\
x
(x0,Fx\) h Ax
\x\\
x
^ \ o\ + I—i\ o\ \ o\ + A|z 0 |.
\xx\
Coercivity of A implies that \x\\ is bounded as A 4- 0. Therefore there exists a subsequence {x\n) and an XQ € X such that x0 = w- lim
x\n.
n—too
From (1.60) and boundedness of |:EA| as A 4- 0 we get, taking A = An and n —> oo, XQ
= lim yx„. n—too
Using monotonicity of A we have, for any [u, v] G A, (xXtl -u,yXn
-v)
> 0,
n=l,2,....
Taking n —^ oo we have (£o — u, xl — v) > 0 for all [u, v] e A, which implies [io^o]
e
A i-e-' ^o
G
range A, because A is maximal monotone.
• 1.40. Corollary. Let X be reflexive. Then the duality mapping is maximal monotone and range F = X*.
1.6.
Convex functionals and subdifferentials
Important examples of maximal monotone operators are subdifferentials of lower semi-continuous convex functionals. Therefore we present in this section the basic properties of such functionals. As in the previous section we assume also for this section that the Banach spaces considered are real. 1.41. Definition. Let
1.6. Convex functionals
and
subdifferentials
41
b)
for all x G X
resp. if and only if (p(x) < liminf ip(xn) for all x G -X" and all sequences (:rn)„6N with w-limn_»oo x„ = x. c) 99 is convex on X if and only if ip((l - X)x1 + Xx2) < (1 - \)
c G K,
are closed. b) Assume that
which proves that
42
Chapter 1. Dissipative
and Maximal Monotone
Operators
the level sets Dc, c e R, are convex and closed or, equivalently, convex and weakly closed (see for instance [La, Theorem 9.2.2, p. 243]). Let (xn)neN be a sequence with w-limn-j.oo xn — x and set d = liminf„^.oo tp{xn). As under part a) of this proof we see that there exists a subsequence (a^jJfceN such that, for any e > 0, we have xnk G Dd+e for k sufficiently large. Since Dd+e are weakly closed, we get x £ Dd+e for all e > 0, so that ip(x) < d — liminf
p(xn). D
1.43. Theorem. Assume that X is reflexive and that ip is a proper, convex and lower semi-continuous functional on X satisfying (1.61)
lim ip(x) = oo.
Then ip has a minimum on X, i.e., there exists an XQ 6 X such that ip(x0) = inf tp(x). Proof. Set rj = inf x e x *p{x) and choose a minimizing sequence (xn)nef$ so that lim„^.oo f(xn) = V- Since
k—*oo
i.e.,
D
The next lemma provides a fundamental property of lower semi-continuous convex functional. 1.44. Lemma. Let (p be a proper, convex and lower semi-continuous functional on X. Then ip is bounded below by an affine functional, i.e., there exist an x* G X* and a constant c G R such that (1.62)
ip{x) > (x, x*) + c for all
x€X.
Proof. Choose XQ £ X and then 0 G R such that (3 <
1.6. Convex functionais
and
subdifferentials
43
is a separating hyperplane for epi(>) and V{x$) x (-co, /?). Since (x0, x^)+r -» —oo a s r - > —oo, we must have (x, XQ) +r > c for all (x, r) £ epi(y>). In particular we have if(x)
> C - (X, XQ),
X £
X,
which proves the result with x* = —XQ.
O
For the next result we need the following concept: 1.45. Definition. Let M be a subset of a Banach space X. Then the relative interior intrei M of M is the interior of M in the minimal closed affine subset Y of X containing M. 1.46. Proposition. Let
< e}.
The set R is convex and balanced (i.e., x £ R and \a\ < 1 imply ax G R). Moreover, R is also absorbing, i.e., for every x £ X there exists an a > 0 such that ax € R. The latter fact follows from the fact that the scalar convex function g(t) = ip(tx) is finite in a neighborhood of 0 and thus also continuous at 0. The properties of R imply that it is a neighborhood of 0 (see for instance [Wi, p. 32]) satisfying R c N\. For the convenience of the reader we give the short proof that g is continuous at 0. For sufficiently small e > 0 the function g is defined, real valued and convex on U = (—e, e). Let (i„)„gN be a sequence in U with tn ^ 0, n = 1,2,..., and linin^oo tn = 0. From 0 £ (tn,e) for tn < 0 and 0 £ (-e,tn) for tn > 0 we get g(0) < Xng(tn) + (1 - Xn)g(e) resp.
44
Chapter 1. Dissipative and Maximal Monotone Operators
g{0) < Kg{tn) + (1 - A„)c?(-e), where (A„)„ eN C (0,1) with lim„^ 0 0 An = 1. This implies g(0) < liminf #(*„). n—>oo
Using tn G (0, e) for tn > 0 and tn G (—e, 0) for tn < 0 we see analogously that limsup9(i„) < g(0). n—>oo
This proves l i m ^ o o #(*„) = 5(0).
D
1.47. Definition. Let ip be a proper, convex functional on X. a) The subdifferential dip(x) of 9? at x G X is the set dip(x) = {x* € X* I ¥>(y) - ip(x) > (y- x, x*) for all y G X}. b) The functional tp* : X* ->• (-00,00] defined by V?*(p) = sup((x,p)-
peX*,
is called the conjugate of (^ or the Fenchel transform of ip. If y> = 00 or ip = —00 then we would have dip(x) — X* for all x G X, a case which is of no interest to us. 1.48. Theorem. The conjugate functional ip* of a proper, convex and lower semi-continuous functional ip is again proper, convex and lower semi-continuous. Proof. Convexity of (p* is an easy consequence of the definition of ip*. Since
- ip(xe))
= (z e ,p) - ip(xt) > ip*(p) - e, which proves ip*(p) < liminfn^oo ip*(pn).
D
If ip is a proper, convex functional on X, then dip(x) = 0 for any x with <£>(#) = 00. Therefore we have (1.63)
domdip cDef[(
1.6. Convex Junctionals
and subdifferentials
45
for the operator x -> dtp(x). That in general we do not have equality in (1.63) is shown by the functional ip(x) — — \x\x/2 for x < 0 and
for all Xi G domdtp, x* G dip(xi), i = 1,2, with x\ /
x2.
Proof. Let x* G dtp(xi) with Xi G domdtp, i = 1,2. Then we have ip(xi)-tp{x2)>{xi-x2,x*2)
and
y ^ ) - ip{xi) > (x2 - x1,x*1)
which implies 0 < (x± — x2, x\ — x2). Assume now that
x0,xl).
We set y = (x0 + y0)/2 and get
for x, y G X with x ^ y and x* G dip(x).
Then strict monotonicity of dtp follows analogously as above monotonicity.
•
1.50. Example. Let tp be a proper convex functional on X which is Gateaux differentiate at some x G domcV, i.e., there exists a w* G X* such that (1.64)
l i m
t|0
^ +
fa)-^)=
i o r a l l v £ X
.
t
Of course, w* is uniquely determined and is called the Gateaux differential of ip at x, w* =
^ + ^ 7 ) ) - ^ ) < ^ ) - ^ ) , o
(y-x^'(x)},
which proves ip'(x) G dtp(x). Conversely choose w* G dip(x). Then we get, for any y G X and t > 0,
46
Chapter 1. Dissipative
and Maximal Monotone
Operators
Again using Gateaux differentiability of ip at x we get, for t \, 0, (y,
for all y G X,
which implies w* =
tp(x) = -\x\2,
xeX.
Then
where F denotes the duality mapping on X. Indeed, choose first x* G Fx. Then we have (y - x, x*) = (y, x*) - \x\2 < \y\ \x\ - \x\2
<\\y\2-\\x\2,
v ex,
which proves x* G d
+ ty\2-\x\2)<\x\\y\
+ ^\y\2,
y G X, t > 0.
This, for 11 0, implies (y,x*) < \x\ \y\, y & X, i.e., we have |x*| < |x|. On the other hand we get (-2t + t2)\x\2 = \x - tx\2 - \x\2 > 2t(-x,x*), t > 0, resp. 2(x,x*) > (2 - i)|a;|2, t > 0, which for 11 0 implies |a;|2 < (x,x*) < \x\ \x*\, i.e., we have also \x\ < \x*\. Thus we have shown |x*| = |x| and (x,x*) = |x| 2 i.e., x* G Fx. 1.52. Example. Let K be a closed convex set in X and set
, .
IK(X)
(1.65)
dIK(x)
= {x* G X* | (x - t/,x*) > 0 for all y e A"}.
We have dom9/K — K = Defr(/K')- From (1.65) we conclude d/*r(z) = {0}
for x £ K, o
which coincides with the fact that
1.6. Convex functionals
and subdifferentials
47
Then for any x* G (9ix(x) we have (v + V\,x*)<0,
A>0,
which for A 4.0 implies (y,x*)
Note that for x G K the set of all tangential directions is X, so that x* = 0. Since K is convex, for any z G K the direction y = z — x is a tangential direction at x. Therefore we can also characterize dlx(x) as dIK{x)
= {x* G X* \(y,x*) < 0 for all tangential directions for AT at a;}.
In geometrical terms this means that at a point x G dK (= boundary of K) the subdifferential 8IK(X) is the cone of outer normals to K at x. The main theorem of this section is: 1.53. Theorem (Rockafellar). Let if be a proper, convex and lower semicontinuous functional on X. Then dip is a maximal monotone operator. Proof. We shall give the proof under the additional assumptions that X is reflexive and that X and X* are strictly convex. For the general case we refer to [Rol]. By Theorem 1.37 it suffices to prove that range(i ? + dip) = X*. We fix XQ G X* and define the functional / by f(x) = -\x\2+
xeX.
It is easy to see that / is proper, convex and lower semi-continuous. Moreover, by Lemma 1.44 there exist an x* G X* and a c G K with ip(x) > {x, x*) + c for all x G X. This implies lim^i^oo f(x) = 00. By Theorem 1.43 there exists an XQ G Deff (/) = Deff(>) with f(x0) = inf xeX f{x). This implies f(x)-f(x0) >0 for all x G X or, equivalently, (1 66)
^
~ ^X^
" ^ ~ X °' X o) + 21 210 ' 2 ~ 2 ^ > (x — x0,XQ) — (x — xo,Fx),
x G X,
where we have also used the fact that F is the subdifferential of x —» \x\2/2 (see Example 1.51). For arbitrary u G X let xt = x0 + t(u — Xo), 0 < t < 1. Then we get from (1.66) and convexity of ip p{u)
-P(XQ)
> -(p(xt)-p(x0)) = (u -
XQ, XQ)
> -(xt-xo,x*0) - (u - X 0 ,
Fxt).
- -{xt
-x0,Fxt)
Chapter 1. Dissipative and Maximal Monotone
48
Operators
Observing that F is demi-continuous (see Proposition 1.1, b)) we get, for 11 0, the inequality
i
ip(xn) -^
i
i
ip(y0) i
ii
n
—
l,
z,....
which implies rim„_>.oo(^n - yo,x*n)/\xn\ = oo. Assume now that dip is coercive and choose a > 0. Since dip is maximal monotone (see Theorem 1.53) we get from Theorem 1.39, b), that range dip = X*. Assume that there exist [u n ;^n] G dip such that \vn\ < a for all n and linin^oo \un\ = oo. Then the estimate (un - x0,vn) i—j \un\
\un - x 0 | < —;—:—a —> a \un\
as n -4 oo
gives a contradiction to (1.46). Therefore (iii) holds. Finally we assume that (iii) is true. Let (j/n)neN C X be a sequence with lim„_4.oo \yn\ = oo- For fixed a > 0 we define the elements vn = a|j/„| _ 1 Fyn, n = 1,2,..., where F is the duality map X -> X*. Then for any n there exists a un G X with [un,vn] G dip. Since \vn\ — a, we get |u n | < (3, n — 1,2,... . For j/o G X we have ip(y0) - ip(un) > (y0 - un, vn), which implies ip(un) < ip(y0) + a(3+ \yo\a, n = 1,2,... . This and Lemma 1.44 together with |u„| < (3, n = 1,2,..., prove that the sequence (ip(un)) N is bounded. From the definition of dip we get tp(yn) - ip(un) > {yn - un, vn) = a\yn\ - (un, vn) > <x\Vn\ ~ a0, which implies jg(jfa) ^ ip(u) - a/3 + |j/n|
n =
1 2
|j/n|
For n -> oo we obtain liminfn_+00 v?(y n )/|j/ n | > a. Since a was arbitrary, we get the result. •
1.6. Convex junctionals
and
subdifferentials
49
1.55. Theorem. Assume that X is a real Hilbert space with inner product (•, •) and that A is a maximal monotone operator on X. Let if be a proper, convex and lower semi-continuous functional on X satisfying dom ACidomdip ^ 0 and (1.67)
< ip(x) + AM,
A > 0, x e D eff (p),
where M is some non-negative constant. Then the operator A + dip is maximal monotone and6 \A°x\ < \(A + dip)°x\ + M1/2,
Z € dom,4 nDeff(>)•
Proof. According to Theorem 1.53 the operator dp is maximal monotone on X, so that —A and — dip are m-dissipative. By Lemma 1.19 the minimal section A0 of A is single-valued and dom A 0 = dom A (note that dom A0 = dom(-A) 0 and (—A)°x = — A°x, x £ dom A 0 ). According to Lemma 1.23 there exists, for any A > 0 and any y £ X, an element xx £ domdip such that y£xx-
(-A)xxx
+ dip{xx).
Moreover, \xx\ is bounded on A > 0 by Theorem 1.24, a). Observing y — xx + {-A}xXx £ dip(xx) we obtain, for any z £ X, (1.68)
ip{z) - ip(xx) >(z-xx,y-xx l
We take z — (I + \A)~ Xx, (1.68) \({-A)xxx,
y-xx
+
(~A)xxx).
so that z — xx = A(—A)xXx-
+ {-A)xxx)
< ip{{I + XA^xx)
Then we get from
- ip(xx) < AM,
A > 0,
and 1(-A)xxx\2
< \(-A)xxx\
\y - xx\ + M.
Since \xx\ is bounded on A > 0, the last estimate shows that |(—A)xXx\ is also bounded on A > 0. According to Theorem 1.24 the operator —A - dip is m-dissipative or, equivalently, A + dip is maximal monotone. For x € Deff(
= ( ( / + XA^x < AM,
i.e., ((-A)xx,p) (-A)°x = -A°x, (1.69)
< M. so that
- x,p) <
-
A > 0,
By Theorem 1.20, b), we have \imx\.a(-A)xx
(A°x,p) > - M
=
for all p £ dip{x).
If we set y — (A + dip)°x, then y = y\ + yi with y1 £ Ax and y-2 £ dip(x). Let t/i = A°x + u. Then {A°x, u) > 0, because |^4°ar| = inf ze ^ x \z\ and Ax is 6
Recall that A0 denotes the minimal section of A (see Definition 1.18).
50
Chapter 1. Dissipative
and Maximal Monotone
convex (see Lemma 1.14). Therefore we have (A°x,yi) we get
Operators
> |yl0a;|2. Using (1.69)
(A°x, y) = (A°x, yi) + (A°x, y2) > \A°x\2 - M and |,4°:r| 2 < \A°x\\(A + d
(1.70)
= \jaW<*)\l
I 00
for u e
^o(n),
otherwise.
1.57. Lemma. The functional ip defined by (1.70) is proper, convex and lower semi-continuous. Proof. It is obvious that ip is proper and convex. In order to prove that
° 2
By the continuous embedding HQ(Q.) Q L (Q) this implies l i m ^ o o \v — un\i,2 = 0, so that we have v = u. From p(u) - ip(un) = ((u,u)Hi - {un,un)Hi)/2 = ((u,u- un)Hi + (uun,u„)Hi)/2 < \u - u n | H i ( | u | H i + M)/2 -> 0 as n -> 00 we see that a — limn^oo ip(un) =
1.6. Convex functionals
and subdifferentials
51
1.58. Lemma. The duality mapping F : -ffo(fi) -> # _ 1 ( 0 ) is given by Fu = -Au1
uG^(fi),
where derivatives are taken in the distributional sense. Proof. By Proposition 1.1, c), the duality mapping F is single-valued and continuous. In view of the dense and continuous embeddings 8
Hl(p) Q L2{Q) Q H-\fy the bounded linear functionals on H$ (Q) are represented by the L 2 -inner product: For / G L 2 (fi) we have {u, f) = (u,f) for all u G HQ(Q) and, for arbitrary (u,f) = lim (u,fn) = lim (u,fn),
u e #o(fi),
where (/ n ) n eN C L2{Q) is any sequence with | / - fn\H-i -» 0. From Lemma 1.3, c), we obtain, for f,g G Co°(fi), / / 0, 1
-<<7^/> = (5,/)+ = (9J)-
= il\f
= ^ ( _ / IV/ + tWg\lddx)
+ t9\m ' |t=Q=
j^—Jjyf(x),Vg(x))Kddx.
This implies by Green's first identity (2,*7> = [(Vg(x),Vf(x)h*dx
= - fg(x)Af(x)dx
for f,g£ Cg°(n). By density of C£°(fi) i n # o ( n ) t h i s Therefore we have Ff = -Af For / e flo(fi) of .F we have
w e choos
(g,Ff)=
8
i s t r u e for a11
e (/«) C C£°(fi) with \f - fn\Hi
lim f
/(V$(ar), V/(a;))H-da:,
i.e., the spaces i?o(fi), L2(Q) and if
9 G #d( f i )-
for / G C0°°(n).
lim (g,Ffn)= -
= -(g, A / )
1
-> 0. By continuity
(Vg{x),Vfn{x))%ddx G ^ ( f i ) .
(SJ) form a Gelfand triple (see page 90).
52
Chapter 1. Dissipative and Maximal Monotone
Operators
On the other hand we have, for g G Cg°(fi), d
3=1
J
j=l
= iljjtJ{x)ltj{x)dX
=
Jjy9(x),Vf(x))Rddx = {g,Ff).
This proves F / = - A / for / e i ^ ( f i ) .
D 2
2
1.59. Proposition. The subdifferential dip C L (Cl) x L (Q) of the functional ip on L2(Q) defined by (1.70) is given by H2(tl),
domdtp = H^(Q) n d
uGdomdip,
i.e., —d
H^(n)r)H2(n).
From (u, Au) = (u,Fu) = |«|^i > 0, u G dom A, we see that A is monotone as an operator C L2(Q) x L 2 (0). By Corollary 1.40, rangeF = H~1(fl) and consequently range A = L2(Q). We choose u G dom A Then, for any w € HQ(£1), we get (observing also -Au = F u and \Fu\H-i = \u\Hi) 0 '
(w — u, —Au) = (w, Fu) — (u,Fu) < \w\Hi \u\Hi — \u\2Rl
o
1,
,
1,
i.e., Au = -Au G dip(u). Thus we have shown that A c dip. Assume that, for some uo, WQ G L2{Q), we have {U — UQ, AU — WQ) > 0 for all u G dom A Since ranged = L2(il), there exists a i i i G dom A with w0 = At«iTherefore we have (U-UQ, A(u-U\)) = {u—uo, F(u—ui)) > 0 for all u G dom A F o r u = (uo + ui)/2 we get (tii-u 0 ,-F(wo-wi)) > 0. Monotonicity of F implies the converse inequality, i.e., we have {uo — UI,F(UQ - u\)) = |w0 - wil^i = 0.
1.6. Convex junctionals
and subdifferentials
53
Thus we have wo = u\ G domA and WQ = AUQ. Thus A is maximal monotone. Since dip is a monotone extension of A, we have A = dip. O 1.60. E x a m p l e . Let fi C Rd be bounded and assume that j : RN -> (-oo, oo] is a proper, convex and lower semi-continuous functional. We define the functional i>: L 2 (ft; RN) -> (-oo, oo] by Deff(^) = { n e L2(ii;RN)
(i.72) U X
^/ u \ = \JsiJ( ( ))
dx
1 oo
| w(a;) G DeffG0 a.e. on fi and
jM-M^ai)}, D e f f (VO,
fOT U G
otherwise.
According to Lemma 1.44 there exist a vector a G M^ and a constant c G K with j{£) > (a,f)Kjv + c for all f G R w . This implies
V>(w•) >
/ ((a,u(x))Kjv + c) da;
> cmeasfi — |a| R jv(measfi)
1/2,
M£2(Q.ajv) > —oo
for all u G L 2 (fi;K w ). It is easy to see that ip ^ oo and that ij) is convex. In order to prove lower semi-continuity of tp we choose u G L2(Cl; RN) and set a = liminf w _y u ^(t;). Only the case a < oo needs to be considered. We choose a sequence (w„)„eN such that \u — Mn|z,2(n;RJV) ~* 0 a n d ip(un) —>• a. We can also assume that u n (x) —>• u(a;) a.e. on 0. From \u — un\L2^.^N^ —>• 0 we get (1.73) n
lim / ((a, u„(a;))Hjv + c) da; = / ((a, u(a;))Rjv + c) dx. ->°° Ju Jn
Since j( u n(£)) - ((a,un(x))^N (using also (1.73)) a-
+ c) > 0 a.e. on ft, we get by Fatou's lemma
/ ((a, U(X))UN +c) dx = lim inf / (j(un{x)) n Jn ->°° JnK > / (liminf j(un(x)) JoV n—*oo
> / j(u(x)) dx-
Jn
- ((a, un{x))RN + c)) dx ' - lim ((a,un(x))RN n—*-oo
I ((a, U(X))RN
Jn
which implies a > ip(u), i.e., ip is lower semi-continuous.
+ c) ) dx ' /
+ c) dx,
54
Chapter 1. Dissipative and Maximal Monotone Operators
1.61. Lemma. The subdifferential dtp of the functional ip defined by (1.72) is given by dtp = {[u,v] G L2{Q;RN)
x L2{n-,RN)
\u(x) G domdj a.e. on Q, j{u{-)) G L\n)
and
v{x) G dj(u(x))
a.e. on f2}.
Proof. Let first u,v G L2(£l;RN) satisfy the conditions given in the lemma and choose w G L2(Q;RN). Then j(w(x)) — j(u(x)) > (w(x) — u(x))v(x) a.e. on 0 . This implies tp(w) — tp(u) = / j(w(x))dx
(1.74)
-
j(u(x))dx ,/n
^J?
> / (w{x) — u(x)Jv(x) dx = (w — u,v), which proves [u, v] G dtp. Conversely let [u, v] G dtp be given. Since we have &om dip C Deff (xp), we see that u(x) G Deff(j) a.e. on ft and j(u(-)) G L x (fi). For arbitrary iu0 G RN and any measurable set Z C 0 we define . I w0 una;) v ; = <
for x G Z,
[u(x)
Since (1.74) is true for any w G L2(Q;RN),
foix£tt\Z. we conclude that
/.<{j(wo) - j(u(x)) - (w0 - w(a;))t;(a;)) dx > 0. >z This implies that for any w G M^ there exists a set Z(w) of measure zero such that j(w) - j(u(x)) >(w-
u(x))v(x)
for all x G ft \ (£(«;) U Z0),
where ZQ is a set of measure zero with u{x) G Deff (j) for all x G H \ ZQ. It is clear that Z(w) = 0 for w <£ Deff(j). Let (w„)ragF} be a sequence comprising all rational vectors in int re iD e ff(j). We set Z = Z0 U U^Li Z{wn). Then measZ = 0 and j{wn) - j{u{x)) > (wn — u(x))v(x) for all n = 1,2,... and all x G fi \ Z. By continuity of j on intrei Deff(j) (see Proposition 1.46) this implies (1.75)
j(w) - j(u(x)) > (w -
u(x))v(x)
for all w G int re i Deff(j) and all x G 0. \ Z. For u>0 G D eff (j) \ int re iD e ff(j) we choose w\ G intrei Deff(j). Then \WQ + (1 - X)wi G int re i Defr(j) for 0 < A < 1 and limsup A | 1 J(\WQ + (1 — A)wi) < j(wo). By lower semi-continuity of j we have liminfAti j(Au;o + (1 — A)u?i) > j(wo). Thus we have limA-fi j(\wo + (1 — A)u>i) = i(^o). Then (1.75) implies j(wo) - j{u{x)) > (wo - u(x))v{x) for all
1.6. Convex junctionals
and
subdifferentials
55
wo e Deff(j) \ int re iD e ff(j) and all x € fl \ Z. Since (1.75) is trivially true for all w £ DeffO), we have shown that it is true for all w G RN. This implies u(x) € domdj and v(x) € dj(u(x)) a.e. on fi. D 1.62. Example. Let Q be a bounded open subset of Md with sufficiently smooth boundary and set A = dip, where dip is given by (1.71). Furthermore, we set B = dip, where dip is given by Lemma 1.61 for AT = 1. The operator A + B = dip + dip = —A + dip is a semilinear elliptic operator. As an application of Corollary 1.25 we have: 1.63. Proposition. The operator A + B = dip + dip is maximal monotone on L2(Q). In particular we have d(ip + tp) = dip + dtp. Moreover, [u,v] e d{
uei/01(«)nff2(n), u(x) € domdj a.e. on 0,, j{u(-)) e Ll(tt) and v(x) + Au(x) € dj(u(x)) a.e. on fl. Proof. Since the operators A and B are maximal monotone, the operators —A and — B are m-dissipative. We have to investigate (—Au, (—B)\u) for u e d o m A We fix u e dom^l and set v = (I + XB)~1u e d o m £ . From Lemma 1.61 we see that v(x) = ( / + Xdj)~1(u(x)) a.e. on $X This and = A- 1 ((/ + XB^u
{-B)xu
- u)
imply ((~B)xu)(x)
= (-dj)x(u(x))
a.e. on ft.
From Theorem 1.10, (i), we get, for T\ < r 2 and A > 0, {-djhfo)
- (-dj)x(n)
= ! ( ( / + Xdj)~lT2 - (I + Xdj)-1^ < -r
(T2
- ri - |r 2 -
TI|)
- (r 2 - n ) )
= 0,
i.e., (-dj)x is decreasing on M. Moreover, by Theorem 1.10, (vi), (-dj)x is globally Lipschitzian. Therefore (-dj)'x exists a.e. on K and (—dj)'x < 0 a.e. For u € domA = H$(n) D # 2 (ft) we get, for A > 0, {-Au,{-B)xu)
=
Ja
iAu{x){-dj)x{u(x))dx
= ~ J{-dj)'x{u{x))\Vu{x)\lddx
> 0.
By Corollary 1.25 we conclude that —A — B is m-dissipative, i.e., A + B = dip + dip is maximal monotone on L2(Q). This implies also d(ip + ip) = dip + dip,
56
Chapter 1. Dissipative
and Maximal Monotone
Operators
because d
CHAPTER 2
Linear Semigroups In this chapter we present some of the essential facts on linear Co-semigroups and linear abstract Cauchy problems. The main purpose of this chapter is to provide basic notions in the conceptually much simpler linear context which will later be generalized to nonlinear situations. The core of this chapter consists of a thorough investigation of the connection between Co-semigroups and mild resp. strong solutions of linear abstract Cauchy problems including Ball's theorem (Section 2.2) as well as of complete proofs for the Hille—Yosida theorem (Section 2.3) and the Lumer-Phillips theorem (Section 2.4). In Section 2.5 we present an application of the Lumer-Phillips theorem to a variational formulation of a second order equation. Concerning the general theory of linear Co-semigroups we refer to [Hi-Ph], [Pal] and [Go]. Naturally, many important aspects of the theory for linear Co-semigroups are neglected in our presentation. In addition to the books already quoted above we refer to [C-H-A-D-P] for adjoint semigroups, to [Fa] for cosine operators and to [DP-Gr] for maximal regularity results. In this chapter X denotes a real or complex Banach space, when not otherwise stated.
2.1.
Examples and basic definitions
We start with some simple and well-known examples in order to motivate some of the fundamental definitions which we introduce in the following and to illustrate also the wide range of applicability of the abstract theory. 2.1. Example. Consider the following initial value problem for a first order partial differential equation on (0,1): (2 1)
glw(t,x)
+ -^w(t,x)=0,
0<x
2
w(0,x)=
58
Chapter 2. Linear
Semigroups
We define the linear operators S(t), t > 0, on X = £ 2 (0,1) by
Note that S(t)(j) = 0 for t > 1. The following properties of the operators S(-) are obvious: (a) \\S(t)\\ < 1,
£ > 0 (boundedness).
(b) 5(0) = / and S(t)S(s) = S(t + s), t,s > 0 (semigroup property). (c) \S(t)(f> —
as 110.
For (/. G -fiT^O.1) with <£(0) = 0 we see that also S(t)<j) G ^ ( 0 , 1 ) and (5(t)^)(0) = 0. Moreover, we have {d/dt)(S{t)
4>£domA.
Then, for any (j> G dom A, the function u(t) = S(t)
kr)=l° V ;
forT<0
'
|<£(r) for 0 < T < 1, is in Hl(—co, 1) and S'(i) is just the left-shift. Moreover we see that, for <j> £ dom A,
(2.3)
! « ( * ) = Atf),
*><>,
u(0) = <j>. Thus we have seen that for smooth initial data, namely <j> G dom A, the partial differential equation (2.1) is equivalent to the abstract Cauchy problem (2.3).
2.1. Examples and basic definitions
59
Since dom^l is dense in X, for any <> / G X, there exists a sequence ((j>n)neN with \4> — 4>n\x —> 0 as n -> oo. According to (a) from above we have lim S{t)
(-)
x),
T(t,0) = T ( * , l ) = 0 ,
t>Q,0<x
T(0, x) = 4>{x), 0 < x < 1, <j> G L 2 (0,1). Here we assume that the quotient of mass density and heat conductivity is normalized to one. If (2.4) has a solution T(t, x) which is in C 2 (0,1; K) then it is given by T(t,x) — (S(t)4>){x), where the solution operators S(t), t > 0, are given by oo
(2.5)
Y,e-{k7l)2tfaek,
S(t)<j> = fc=i
where the orthonormal basis (ek)k=i,2,... of X = L2(0,1) is defined by ek(x) = V2smkTrx,
0 < x < 1, A; = 1,2,... .
Moreover,
A; = 1,2,...,
oo
0 = ^ ^ e * in X. fc=i
Note that the definition in (2.5) makes sense for all
A(f> = >" = - ^2(kir)2(f>kek
OO
for <j> = ^
0 fc e fc G X ,
fc=i fc=i 1
where Ho (0,1) = {<j> G ff^O.l) | 0(0) = 0(1) = 0} and H2(0,1) = {<j> = XlfcLi^fcefc I Efcli(fc7r)2(^fcefe e x } - Using .Aefc = -(kir)2ek we see that, for
60
Chapter 2. Linear
Semigroups
i>0,
i.e., the function u{t) = S(t)(f>, t > 0, is a solution of —u(t)=Au(t),
t>0,
u(0) = 4>. Let
< (£/e)M J - ,
t
> o, s > 0, I = 1,2,...,
we can prove that, for any <j> G X, we have S(t)<j> G d o m ^ , I = 1,2,..., and 1^5(4)^ < i ^ l | 0 | x ,
t>0, £=l)2)... .
The examples given above motivate the following definitions: 2.3. Definition, a) Let S(t), t > 0, be a family of bounded linear operators X —> X. The family S(-) is called a Co-semigroup on X (also strongly continuous semigroup) if and only if the following properties hold: 5(0) = I, S(t)S(s)
= S(t + s),
t, s > 0,
(semigroup property)
lim \S(t)x — x\x = 0 for all x G X (strong continuity at 0). b) Let £(•) be a Co-semigroup on X. The linear operator A defined by dom A = \x G X | lim-(S(t)x Ax = lim-(S(£)a; — x),
— x) exists},
x G dom A,
is called the infinitesimal generator of S(-). The following proposition shows that we always have an exponential bound for a Co-semigroup.
2.1. Examples and basic definitions
61
2.4. Proposition. Let S(-) be a Co-semigroup on X. stants M > 1 and w £ R such that ||S(t)|| < M e u t ,
(2.6)
Then there exist con-
i>0.
Proof. We first prove that there exists a to > 0 such that ||S(i)|| is bounded on [0, to]- Assume this is not true. Then there exists a sequence (t„) n€ N of positive reals such that \imn-+ootn = 0 and limn^oo ||5(t„)|| = oo. By the uniform boundedness principle there exists an x € X with linin-^oo \S(tn)x\ = oo, a contradiction to strong continuity of S(-) at t = 0. Thus we can choose M > 1 and to > 0 such that \\S(t)\\<M,
0
For arbitrary t > 0 we choose k G No and T G [0, to) such that t = fct0 + T. Then by the semigroup property we get ||5(t)|| <
\\S(T)\\
\\S(t0)\\k < Mekln^s(-tM
< Mtoewt,
where u = to" 1 In ||5(t 0 )|| and M to = Mmax 0 < T < t o e -(r/to)in||S(to)|| ( = 1
||S(t 0 )|| > 1 and = MH^to)!!" if ||5(t 0 )|| < 1)-
M
if
•
2.1. Remark. By Proposition 2.4 we see that ||5(t)|| is bounded on any compact t-interval. The proof of Proposition 2.4 shows that, for any T > 0, we have ||S(f)|| < MTeUrt, t > 0, where u)T = T~1 In ||5(r)|| and MT > 1. 2.5. Corollary. Let S(-) be a Co-semigroup. Then, for any x £ X, we have S{-)xeC{0,oo;X). Proof. The result follows from S(t + h)x - S(t)x = S(t)(S{h)x h>0, resp. from S(t - h)x - S(t)x = -S(t - h)(S{h)x -x),t>0,h£ together with Proposition 2.4 and strong continuity at t = 0.
-x),t>0, (0,t), D
Proposition 2.4 motivates the following definition: 2.6. Definition. Let S(-) be a Co-semigroup on X. a) The number Q = inf {u> e R |there exists an M > 1 such that \\S(t)\\ < Me"\
t > 0}
is called the (exponential) growth rate of S(-). b) The semigroup S(-) is of class G(M,u)
if and only if \\S(t)\\ < Me"*, t > 0.
Since (2.6) implies limsupt^^ t _ 1 In ||5(t)|[ < w, we see that limsupt _ 1 ln||5(t)|| < Q. t—fOO
62
Chapter 2. Linear
Semigroups
Let u> = inftxji-MnllS^)!!. Then Q < lim n a V ^ r " 1 In ||5(t)||. For e > 0 there exists a te > 0 such that t~l In ||5(t £ )|| < to + e. In view of Remark 2.1 from above there exists an Me > 1 such that ||5(i)||<M£e^+£)*,
t>0.
_1
This implies Q < cD and limt->oo£ In IIS'C*)!! = u>. Thus we have proved the following result: 2.7. Proposition. Let S(-) be a Co-semigroup on X. S(-) is given by
The growth rate w of
Q=limUn\\S(t)\\=}nd\n\\S(t)l t—>-oo t
t>0 t
2.8. Example. Let A be a bounded linear operator on a Banach space X and set 00
(2.7)
fk
S(t) = £ - A f c ,
*^°-
fc=0
Then it is clear that S(-) satisfies properties (b) and (c) listed under Example 2.1. Instead of (a) we have \\S(t)\\ < ell*"*,
i>0.
The family S(-) of operators defined by (2.7) is norm continuous on t > 0, i.e., S(-) G C(0, oo; C(X)), which is not true for the families defined in Examples 2.1 and 2.2. We can also recover the operator A from S(-) by Ax = lim - v(S(t)x -x), t|o t '
x e X.
The next theorems contain some important facts about Co-semigroups: 2.9. Theorem. Let S(-) be a Co-semigroup on X with infinitesimal generator A. Then, for any x e dom A, we have S(-)x 6 C(0, oo; dom A) n C^O, oo; X) and -rS(t)x = AS(t)x = S(t)Ax, t > 0. at Proof. Let x e dom A be given. For t > 0 and h > 0 we have i (5(t + /i)z - S(t)x) = S(t) ( i ( S ( h ) x - a:)) = ~(S(h)S(t)x For ft 4- 0 this implies S'(t)a: G dom A and —S(t)x = S(t)Ax =
AS(t)x.
S(t)x).
2.1. Examples and basic definitions
63
This proves that t -> AS(t)x is continuous, which together with continuity of t ->• 5(t)a; proves S(-) G C(0, cojdom^). For t > 0 and ft G (0, t) we have -Us(t
- h)x - S(t)x) - S(t)Ax\ < S(t - h) (j- (S(h)x - x) < Me^lUsityx
- x) -
S{h)Ax)
S{h)Ax
as h \. 0, where we assume without restriction that u > 0. This proves -rS(t)x at
= S(t)Ax,
t > 0.
a 2.10. Theorem. Let S(-) be a Co-semigroup on X with infinitesimal generator A. a) The operator A is closed and densely defined (i.e., domj4 = X). for any x G dom A and t > 0 we have jQS(s)xds G dom A and (2.8)
Moreover,
A f S{s)x ds = S(t)x - x. Jo
b) For any f G ^ ' ^ ( [ O , o o ) ; ^ ) 1 we have / S(t - s)f(s) ds e dom ^4, (2-9)
t > 0,
J
°
A
t
t
S(t~
S(t- s)f'(s) ds, t > 0. Jo Jo Proof, a) Let (a;n)n6N be a sequence in dom A with xn —>• x and Axn —• y as n —> oo. From Theorem 2.9 we get (2.10)
s)f{s) ds = S(t)f{0) - f{t) +
S'(i)x„ -xn=
[ S(s)Axn ds, t > 0. Jo Using |5(s)^4a; n -5(s)j/| < M\Axn~-y\, 0 < s < t, for some M > 1 we conclude that S(t)x-x=
I Jo
S{s)yds.
Continuity of s —> S(s)y implies lim^(S(t)x-x) lw
= S(0)y = y,
ioc([°.°°); x ) = { / e L ioc([°-°°);*) l t h e r e e x i s t s a s e ^ l o c U 0 . ° ° ) ; * ) w i t h /(*) =
/(0)+/oS(s) t>0.
rfs f o r
t > 0 } . In particular f'(t) exists a.e. on t > 0 and /(*) = / ( 0 ) + / 0 ' / ' ( r ) dr,
64
Chapter 2. Linear
Semigroups
i.e., x £ domA and y = Ax. Thus A is closed. From (2.10) and a standard result on Bochner integrals we get S(t)xn - xn = A / S(s)xn ds, Jo
t > 0.
Closedness of A implies JQS(s)xds £ domA and (2.8). In order to prove that dom A is dense we choose x £ X and set, for h > 0, 1 [h Xh = -r S(s)xds
£ domA.
For h I 0 we get Xh —> £• b) For /i > 0 we have i (S(fc) - J) /" S(i - s)f(s) ds = ^ f S(t + h- s)f{s) ds - - /
+
S(t + h-
s)f(s)ds
£s(t-8)(±(f(8+h)-f(s)))d8,
which for h | 0 implies (2.9). Here we have used that / ' is Bochner-integrable on any interval [0, T], T > t. Therefore Theorem A.5 for p = 1 and g = f implies l i m H 0 \f - fh\Ll(o,t;X) = 0. Observe that f'h(s) = h"1 j*+hf'(s) ds h-1(f(s + h)-f(s)),s£\0,t}. D For a linear operator A on X we define the powers An, n = 0 , 1 , . . . , recursively by A 0 = i" and domA™ = {x£ domA™"1 | An~1x £ domA}, Anx = A(An-1x),
xedomA™,
for n = 1,2,... . Concerning powers of infinitesimal generators we have the following results: 2.11. Proposition. Let A be the infinitesimal generator of the Co-semigroup S(-). Then the following is true: oo
a) ( | domA™ is dense in X. n=l
b) For all n = 1,2,... we have 5(t)domA™ c domA™, t > 0. Moreover, for all x £ domA™, the mapping t —»• S(t)x is in Cn(0,oo;X) D C(0, oo;domA") with (2.11)
T ^ * ) * = AnS(t)x
= S(t)Anx,
t > 0.
2.1. Examples and basic definitions
65
c) An is closed, n = 1,2,... . Proof, a) Let T> be the set of all scalar C°°-functions on [0, oo) with compact support in (0,oo). Then the integral f^°<j>(s)S(s)xds exists for all x G X and <j> G V. We set M = {f™(/){s)S{s)xds \ x G X, 0 G V}. For y = f^°(f)(s)S(s)xds G .M it is easy to see that /»oo
2/G domA
(j)'(s)S(s)xds. Jo Since $ G X>, we can continue by induction and get 2/GdomA"
and
Ay = -
Any = ( - 1 ) " /
and
^ ( n ) (s)5(s)a;ds,
ra=l,2,...,
which proves yVf c ( ~ d i domA™. Assume that M is not dense in X. Then, by the Hahn-Banach theorem, there exists a n i o G X \ M. and an XQ G X* such that (x 0 , XQ) = 1 and
(y, x%) = 0 for all y G .M.
Consequently we get for all 0 G V 0 = ([
4>{s)S(s)x,ds,x*0\= f <j)(s)(S{s)x,x*0)ds.
The function g(s) = (S(S)XQ, XQ) is continuous on [0, oo) with #(0) = 1. Therefore there exists an SQ > 0 with g(s) > 0 on [0,So]. We choose a non-negative 4>o G V with supp(/>o C (0, So). For 4>0 we have J^°(J)O(S)(S(S)XO,XQ) ds > 0, a contradiction. Thus statement a) is proved. b) Statement b) of the theorem is already established for n — 1 by Theorem 2.9. Assume that we have proved the result for k = 1 , . . . ,n and choose x G dom A™+1. Then we have Anx G domA, which by Theorem 2.9 implies jS{t)Anx
= AS{t)Anx
= S{t)An+1x,
t > 0.
n
In particular we have S(t)A x G domA, t > 0. Using x G domAn we get (dn/dtn)S(t)x = S(t)Anx = AnS(t)x G d o m A This shows S(t)x G dom A™+1, t > 0, and ^-—rS(t)x = ^-S(t)Anx dtn+L dt Observing AS{t)Anx = AAnS(t)x finished. c) We assume that A71-1 is closed Xj —> x and AnXj —> y as j —> j^~iS{t)xj
- An-xXj
= AS(t)Anx
= S(t)An+1x,
= An+1S(t)x
the proof for statement b) is
t > 0.
and choose a sequence (XJ) C domA™ with oo. Integrating (2.11) with x = Xj we obtain
= An-lS{t)Xj
- An-1xj
= f S(s)AnXjds,
t > 0.
66
Chapter 2. Linear
Semigroups
This implies An~1(S(t)xj — Xj) —> fQS(s)yds as j —• oo. Together with S(t)xj - Xj -+ 5(t)x - x and closedness of An~x we get 5(£)x — x G domA™ -1 and 5(t)i4 n _ 1 a: - An~1x = An-l(S{i)x - x) = JQtS{s)yds. This implies n 1 n 1 \imti.0(l/t)(S(t)A ~ x - A ~ x) = y, which proves An~1x G domA and AAn-lx = y. U
2.2.
Cauchy problems and mild solutions
In this section we discuss the following non-homogeneous linear Cauchy problem: (2.12)
| « ( t ) = A n ( t ) + /(*),
t>0,
w(0) = x0, where the operator A on X and the function / : [0, oo) -» X are given. 2.12. Definition. We assume that / G i, 1 oc ([0,oo);X). A continuous function u : [0, oo) —» X is called a strong solution of (2.12) if and only if (i) u(t) G domA a.e. on [0, oo). (ii)
Au(.)€Llc([0,oo);X).
(in) u(t) =x0+
Jo
Au(s) ds+
Jo
f(s) ds,
t > 0.
Instead of (ii) and (iii) we can equivalently require that (ii') «(•)€ < £ ( [ ( ) , oo); X), (iii') u(0) = x0 and -ru(t) = Au(t) + f(t) a.e. on t > 0. 2.13. Theorem. Let A be infinitesimal generator of a Co-semigroup S(-) and assume f G L^oc([0, oo);X). a) Let x0 G domA be given and assume that f G W££ ([0, oo); X). function u defined by (2.13)
u(t) = S(t)x0+
I S(t-s)f(s)ds, Jo
Then the
t>0,
is a strong solution of (2.12). Moreover, we have u G C(0,oo;domA). b) Assume that u is a strong solution of (2.12). Then u is given by (2.13).
2.2. Cauchy problems and mild solutions
67
Proof, a) Let u be defined by (2.13). From Theorems 2.9 and 2.10, b), we conclude that u € C(0, oo; dom A) and Au{t) + f{t) = Sit) iAx0 + /(0)) + / Sit - s)f'is) ds,
t > 0.
Jo
Integrating from 0 to t we get f
(AU(T)
+ fir)) dr=
Vo
f
S(T)(AC0
+ /(0)) dr + [ f
Jo
S{T
- s)/'(s) d s d r
v/o Jo
= I ^ (S(T)SO) dr + y 5(r)/(0) dr + /" 5(s) /
f'(T-s)dTda
= Sit)x0-xQ+
/S(r)/(0)dr Jo
+ [
Sis)ifit-s)-fiO))ds
Jo
= S(t)x0 -x0+
/ S{tJo
s)fis) ds = u(t) -x0,
t> 0,
i.e., u is a strong solution of (2.12). b) Let u be a strong solution of (2.12). For fixed t > 0 we set v(s) = 0 < s
Sit—s)uis),
Sit - «)«(«))
= -i(5(i - (s + A))(u(s + ft) - «(«)) + j-S(t - a - h))[u(s) -
S(h)u(s)).
For h 4- 0 this implies - u ( i ) = S(* - s) (u'(s) - Au(s)) ds Analogously we get, for s e (0,t] and h £ (0,s),
a.e. on [0, i).
-—vis) = S(t - s) (u'(s) - Auis)) ds
a.e. on (0, t],
so that v'(s) = Sit - s) (u'{s) - Auis)) = Sit - s)fis) Integrating from 0 to t we get (2.13).
a.e. on (0, t). •
Chapter 2. Linear
68
Semigroups
Theorem 2.13, b), shows that strong solutions of (2.12) are unique, provided A is infinitesimal generator of a Co-semigroup and / € L,1oc([0, oo); X). Since J0S(t - s)f(s)ds is well-defined for / G .LI1oc([0,oo);.X"), the question arises about the connection between u given by (2.13) and the Cauchy problem (2.12). For xQ e X and / £ Ljoc([Q,oo);X) we can find sequences (x„)ne^ C dom.A and (/„)„ e N C W^([0,oo);X) with xn -> x0 and | / - / „ | z , i ( o , r ; x ) -> 0 for all T > 0 as TL —)• oo. The problems {djdt)un — Aun -f- fni un{0^ — xn have unique strong solutions (Theorem 2.13). This motivates the following definition. 2.14. Definition. Let A be a linear operator on X and / e £^([0,00);-X"). A continuous function u : [0,00) —¥ X is called a mi/d solution of (2.12) if and only if u(0) = £0 and there exist sequences ( / „ ) „ £ N C Lj oc ([0,oo);X), («„)„ e N C C(0, 00; X) such that un is a strong solution of (d/dt)un(t) = Aun(t) + fn(t) and lim | / - fn\mo,T;X) lim u«(£) = u(t)
= 0 for all T > 0, uniformly on [0, T\ for any T > 0.
u—•oo
The following theorem gives a characterization of mild solutions if the operator A is closed: 2.15. Theorem. Assume that A is a closed operator on X and that f £ Lloc([0, 00); X). Then a continuous function u : [0, 00) —• X is mild solution of (2.12) if and only if t
(2.14)
/ u(s) ds £ dom A, Jo
t > 0,
and (2.15)
u{t) = x0 + A / u(s) ds+ f(s) ds, Jo Jo
t > 0.
Proof, a) Assume first that u is a mild solution of (2.12) and choose sequences (/n)neN, (un)neN according to Definition 2.14. Since the un are strong solutions, we have JQun(s) ds € dom A, t > 0, and A / un(s)ds+ JO
/ fn(s)ds= io
/ (4u n (s) + /n(s))ds ./o = / u'n(s)ds = un(t)-un(0), Jo
t>0,
2.2. Cauchy problems and mild solutions
69
which implies lim A / un(s) ds = u(t) - xo - / f(s)ds,
™-+°°
Jo
t>0.
Jo
Obviously we have lim„_yoo J0un{s) ds = JQu(s)ds. Closedness of A implies J0u(s)ds G domA and AjQu(s)ds = u{t) - Xo — f0f(s)ds, t > 0, i.e., u satisfies (2.14) and (2.15). b) Assume that u satisfies (2.14) and (2.15). For ft > 0 we define uh(t) = -
u(s)ds
and
fh(t) - - /
f(s)ds,
t > 0.
The functions Uh are continuously differentiable on [0, oo) with (2.16)
^-uh{t) = ^(u(t + h)-u(t)), t>0. at n By standard results on Steklov means (see Theorem A.5 for p = 1) we have also, for any T > 0, ljm|/-/ft|ii(0,T;X) = 0 . From (2.14) we conclude that Uh G domA, t > 0. Using (2.15) and (2.16) we obtain rt+h
Auh{t) = — (A / = -(u(t
u(s) ds - A
u(s) ds)
+ h)-u(t))--J
= jtuh{t)
- fh(t),
f(s)ds t > 0,
i.e., Uh is a strong solution of (d/dt)u — Au + fh on [0, oo). The estimate \u(t) - Uh{t)\ < — /
)u(t) - u(s)\ ds <
max
\u(t) - u(s)\
proves limhio Uh(t) = u(t) uniformly on intervals [0,T], T > 0. Thus we have shown that u is a mild solution of (2.12). • 2.16. Theorem. Let A be the infinitesimal generator of a Co-semigroup S(-) and assume that f 6 L11oc([0, oo);X). Then u{t) = S(t)x0 +
S(tJo is the unique mild solution of (2.12).
s)f(s) ds,
t > 0,
70
Chapter 2. Linear
Semigroups
Proof. Let u be defined by the variation of constants formula. Then we have pt
rt
pt
I u(s)ds = / S(s)xods+ Jo Jo = [ S(s)x0ds+ Jo
i<s
/ / S{s Jo Jo f f Jo Jo
-T)f(T)d.Tds S(T)f(s)dsdr.
Using Theorem 2.10, a), we obtain J0u(s) ds £ dom A for all t £ [0, oo) and A f u{s) ds = S(t)x0 -x0+
[ (S(t - T)J(T)
Jo
= u{t)-x0-
- / ( r ) ) ds
Jo / Jo
f{r)dT,
which is (2.15). If «i, i«2 are two mild solutions of (2.12), then u = u\ — «2 is a mild solution of the homogeneous problem —u(t) = Au(t), t > 0, w(0) = 0. at According to the definition of mild solutions there exist a sequence (/„) C Lloc([0,oo);X) with l/nlL^o.T;*) -> 0 for all T > 0 and a sequence («n)neN of strong solutions of (d/dt)un = Aun + fn with lim„_>oo un(t) = u(t) uniformly on intervals [0,T], T > 0. Theorem 2.13, b), implies that un(t) = S(t)un(0) + J0S(t — s)fn(s)ds, t > 0, n = 1,2,... . Since we have u(0) = 0, we get lim„_>oo un(0) = 0, which implies u(t) = lim„_+0o un(t) = 0, t > 0. D Mild solutions can also be characterized as weak solutions. We recall that for a densely defined linear operator A on X and any element x* G X* there exists at most one element y* £ X* such that (Ax, x*) = (x, y*) for all x £ dom A. This justifies the following definition of the adjoint operator A* corresponding to a linear operator A with dom A = X: dom A* = [x* £ X* |there exists ay* G X* such that (Ax,x*) — (x,y*) for all x £ dom A], A*x*=y*,
x*edomA*,
where y* £ X* is the unique element with (Ax,x*) — (x,y*) for all x £ dom A. We shall need the following lemma: 2.17. Lemma. Let A be a closed operator on X with dom A = X and Xo,yo £ X such that (yo,x*) = (x0,A*x*)
for all x* £ dom A*.
Then we have xQ £ dom A and y 0 = Axo-
2.2. Cauchy problems and mild solutions
71
Proof. Let GA denote the graph of A, GA '•= {{x, Ax) e l x X j x G dom A}, and assume that (xo, yo) $. GA- Since GA is a closed subspace of X x X, the Hahn-Banach theorem assures the existence of two bounded linear functionals X-t , X X G X* such that (2.17)
{x, x\) + {Ax, x^) = 0 for all x G dom A,
and (2.18)
(x0,xl)
+
{y0,x*2}^0.
By definition of A* equation (2.17) implies x\ G dom A* and A*x% = —x\. Using this in equation (2.18) we get {XQ,A*XX) ^ (Uo,^), a contradiction. D 2.18. Theorem. Let A be a closed operator on X with dense domain and assume f G L11oc([0, oo);X). Then a continuous function u : [0, 00) —» X is a mild solution of (2.12) if and only if u is a weak solution of (2.12), i.e., u is continuous on [0,00) with the following properties: (i) w(0) = x0. (ii) For allx* G dom A* the function t —» (u(t),x*) is absolutely continuous on all intervals [0,T], T > 0, and (2.19)
j{u{t),x*)
= (u{t),A*x*) + {f{t),x*)
a.e. on [0,oo).
Proof, a) Let u be a mild solution of (2.12). For any x* G dom A* we get from (2.14) (A J*u(s) ds,x*) = (f*u(s)ds,A*x*), t > 0. Then (2.15) implies that, for all x* G dom A*, (u(t),x*) = {x0,x*) + (f
u{s)ds,A*x*\
+ (f
f(s)ds,x
= (x0, x*) + [ {(u(s), A*x*) + (f(s), x*)) ds, t > 0. Jo This implies that t —> (u(t),x*) is absolutely continuous on intervals [0,T], T > 0, and (2.19) holds. b) If u is a weak solution, then (2.19) implies u(t)-x0-
/ f(s)ds,x*\
= /
u(s)ds,A*x*
for all i > 0 and all a;* G dom A*. According to Lemma 2.17 we have J0 u(s) ds G dom A and A jQ u(s) ds = u(t) - x0 — J0 f(s) ds. • The following theorem shows that existence and uniqueness of mild solutions is also sufficient for a closed operator to be infinitesimal generator of a Co-semigroup.
72
Chapter 2. Linear
Semigroups
2.19. Theorem (Ball). Let A be a closed operator A on X and assume f G Lioc([0, oo);X). The operator A is the infinitesimal generator of a Co-semigroup S(-) if and only if the abstract Cauchy problem (2.12) has for any XQ G X a unique mild solution U(-\XQ). In this case u{t; x0) = S(t)x0 +
S(t- s)f(s) ds, t>0. Jo Proof. In view of Theorem 2.16 we have to prove that existence and uniqueness of mild solutions imply that A is infinitesimal generator. The assumptions imply that the homogeneous problem (d/dt)v(t) = Av(t),
(2.20) V ;
t > 0,
v(0) = x0
has a unique mild solution for any XQ G X, which we denote by v(t;xo). define the operators S(t), t > 0, by S(t)x0=v(t;x0),
We
t>0.
It is clear that 5(0) = / . In order to prove the semigroup property we choose xo € X and t > s > 0 and define ui(t) = v(t + s;xo) = S(t + s)xo and u-i(t) = v(t;v(s;xo)) = S(t)S(s)xo. Obviously, u
I Jo
v(T;xo)dr—
/ Jo
V(T;XQ)
dr G d o m A
Using (2.15) we get also /•t+s
Ui(t) = X0 + A
v(T;X0)dT Jo
— XQ + A / v(T;x0)dT Jo
+ A / v(T + s;x0)dT Jo
= v(s;xo) + A
ui(r)dT, t>0. Jo Theorem 2.15 implies that U\ is a mild solution of (2.20) with initial value v(s;xo)- By uniqueness of mild solutions we have U\ = U2, i.e., S(t + s) = S(t)S(s). Obviously, the function t —• S(t)x0 is continuous on [0, oo) for any x0 G X. In order to prove that the operators S(t) are bounded, we define for any T > 0 the mapping $ T : X ->• C(0, T; X) by ($Tx)(t) = v(t; x) = S{t)x,
t e [0,T],
xeX.
2.2. Cauchy problems and mild solutions
73
Let (xn)nen be a sequence in X with xn -> x and $T%n -> w G C(0, T; X) as n —>• oo. For any n there exists a unique mild solution v(-;xn) of (2.20) with initial value xn. By Theorem 2.15 we have f0($TXn)(s) ds G dom A and A I (
($Txn)(t)
t>0,
n = 1,2,...,
which implies limn_>.oo Af0($TXn)(s) ds — w(t) — x, 0
lim ~ (S(h)x - x) = Bx.
On the other hand v(-) = S(-)x is the unique mild solution of (2.20) with i/(0) = x. By Theorem 2.15 this implies j - (S(h)x -x)=Aj-
f S(s)x ds,
h>0.
This together with (2.21) implies limhi0 A^h-1 JQ S(s)xds) = Bx. Furthermore, we have lim/40 h~1 JQ S(s)xds = x. Thus closedness of A implies x G dom A and Ax = Bx, i.e., A is an extension of B. Let now x G dom A. Then S(t)x and S(t)Ax are mild solutions of (2.20) and consequently, by Theorem 2.15, (2.22)
A
S(s)xds
= S(t)x-x
and
A / S(s)Axds
Jo
for all t > 0. Since s —> JQS S{r)Axdr A is closed, we have
n
is a continuous mapping into dom A and pz
s
(2.23)
= S(t)Ax - Ax
Jo
S(T)Axdrds=
ps
A S{r)AxdTds Jo Jo = / (S(s)Ax - Ax) ds, Jo
t > 0.
74
Chapter 2. Linear
Semigroups
We define pt
ft
nt
z{t):=
/ S(s)Axds-A / S(s)xds = / S(s)Axds - S(t)x + x, t > 0. 7o Jo Jo Obviously, z{t) is continuous on t > 0 with z(0) = 0. Using (2.22) and (2.23) we get ft
rt
pS
rt
A I z(s)ds = A / / S{r)AxdTds-A Jo Jo Jo
Jo
= f (S(s)Ax -Ax)ds-A Jo
ps
A
Jo
S(r)xdTds
f (S(s)x - x) ds Jo
= / S{s)AxdsA I S{s)xds = z(t), t>0. Jo Jo According to Theorem 2.15 this proves that z(t) is a generalized solution of (2.20) with initial value z(0) = 0. By uniqueness of generalized solutions we have z(t) = 0 on t > 0 and consequently -(S(t)x-x)=t For 11 0 we get x € dom B.
2.3.
f S(s)Axds, t Jo
t>0. D
The Hille-Yosida theorem
In view of the results of the previous section it is important to give a characterization of infinitesimal generators of Co-semigroups. We first consider necessary conditions. 2.20. Proposition. Assume that A is the infinitesimal generator of a Cosemigroup S(-) of class G(M,UJ). Then Re A > u implies A € p(A) and /»oo
( A 7 - ^ l ) - 1 a ; = / e~xtS{t)xdt, x G X. Jo Proof. Let Re A > w and define the bounded linear operator R on X by (2.24)
/»oo
e~xtS{t)xdt,
Rx=
i £ l
Jo Then, for any x G dom A, rOO
t>00
xt
R(\I-A)x=
e- S{t)(\I-A)xdt = x-
lim e~xtS(t)x t—VOO
= - I = x.
1
—(e-XtS{t)x\dt
2.3. The Hille-Yosida theorem
75
On the other hand, for any t > 0, we define Rtx = I e~XrS(T)xdT, xeX. Jo It is easy to see that e~x'S(-) is also a Co-semigroup and its infinitesimal generator is A — XI. Therefore we have (using Theorem 2.10, a)) (XI - A)Rtx = (XI -A)f Jo = x- e~xtS(t)x,
e'XTS(r)xdT xeX.
This implies \imt-i.oc(XI—A)Rtx = x. On the other hand we have lim^oo Rt% = Rx, so that by closedness oi XI - A we obtain Rx e dom(A7 - A) = domA and (XI - A)Rx = x, x e X. This finishes the proof of R = (XI - A)~l. D 2.21. Corollary. Let S(-) be a Co-semigroup of class G(M,w) with infinitesimal generator A. Then {X 6 C | Re A > u>} C p(A) and
(2.25)
|| ( A / _ J r l <_JL_
for Re A > w and n = 1,2,... . Proof. From (2.24) we get, for any x £ X and any A with Re A > w, /»oo
(XI-A)-2x=
/»oo
e~XtS(t) Jo
e~XTS(T)xdTdt Jo
x( t+T
= / / e- - ^S(t Jo Jo
+ T)xdTdt=
/ / Jo Jt
e-XsS(s)xdsdt
xt
te~ S(t)xdt. I By induction we arrive at 10
Jo
(XI - A)~nx =
1
f°°
/ tn-le~xtS(t)x dt (n-l)l J0 for Re A > u>, n = 1, 2 , . . . . Repeated integration by parts gives \(XI-A)-nx\
Irl
f°°
< . ' ' ., / (n-iy. Jo M\x\ (ReA-w)n
tn-1e-tReXMeutdt for Re A > w.
The main result of this section is the following theorem: 2.22. Theorem (Hille—Yosida). Let A be a linear operator on X and M > 1, u> £ R be constants. Then the following two statements are equivalent:
76
Chapter 2. Linear Semigroups
(i) A is the infinitesimal generator of a Co-semigroup of class
G(M,u).
(ii) A is a closed, densely defined operator with (w, oo) C p(A) and (2.26)
\\{\I-AYn\\<
^
^
forX>w,n
= l,2,...
.
Proof. That (i) implies (ii) is clear from Theorem 2.10, a), and Corollary 2.21. The proof that (ii) implies (i) will be carried out in several steps. Step 1 (Resolvent): As in Chapter 1 we define the resolvent Jh of A by (compare (1.13)) Jh = {I-hA)-1,
Q
For x S dom A we have Jhx - x = (I - hA)~x(x -x + hAx) = (—1 ~ A)
Ax.
This together with (2.26) for n = 1 implies, for 0 < h < l/\u\, \JhX-x\<—
\Ax\ = \Ax\, xedomA, l/n — u> 1 — nu> and consequently lim/40 JhX = x for all x € dom A. Using (2.26) again we see that, for 0 < h < l/(2|u>|),
Thus we have shown (using dom A = X) (2.27)
lim Jhx = x
for all x e X.
hlO
Step 2 (Yosida approximation): The Yosida approximation A^ of A is defined by (compare (1.13)) Ah=AJh
= -(Jh-l),
Q
For x £ dom A we have AJ^x = JhAx. This and (2.27) imply (2.28)
lilim AhX = lim JhAx = Ax, h
HO
x e dom A.
HO
From (2.26) we get M
^(1
+
T^)'
4 f c ll
o
2.3. The Hille-Yosida
theorem
77
Using the last inequality in eAht = e~%lh exp f | Jh j , t > 0, we have the estimate
(*»)
|| e -|| S Me-./«f;I(i)*( T ^-)'.Me,p( r ^- t )
for 0 < h<
1/\LJ\, t > 0.
Step 3 {Convergence of exp(Aht)): From the representation eAnt
_ eAht
fd^s^t-s^
=
ds
Jo ds
= f e A f c 3 e y l ^ t ->(A h - Ah) ds,
t > 0, 0 < h, h< l/|w|,
and (2.29) we get the estimate \eAhtx - e^'a;| < MHe^^AhX
- A^x]
for t > 0, 0 < h, h < l/(2|w|). This estimate together with (2.28) shows that, for any T > 0, there exists a constant CT such that, for all x e X, \eAhtx - eA^x\
< cT\Ahx - A~hx\,
0
0
l/(2|w|).
For arbitrary i £ l w e choose (xn) C domA with \x — xn\ —>• 0 as n —• oo. Then we get using also (2.29) l e ^ ' z - e^'a:| < (||e Afct || + ||e^<||)|z - xn\ + \eA^xn < 2 M e 2 M 7 > - xn\ + cT\Ahxn for all t£[0,T\,h,h£ for all x £ X
-
-
eA^xn\
Ahxn\
(0, l/(2|w|)) and n = 1,2... . This estimate shows that
(2.30)
limeAhtx
S(t)x =
exists uniformly on [0,T] for any T > 0. From this it is also evident that S(-) is a Co-semigroup. The estimate (2.29) shows that S(-) is of class G(M,w). Step 4 (A is infinitesimal generator): Let B denote the infinitesimal generator of S(-). For any A > w, T > 0 and x e X we obtain, using also the estimates (2.29) and ||5(t)|| < Me"', t > 0,
\{\I-Ah)-lx-{\I-B)-1x\
= /
e~xt[eAht -
S(t))xdt
Jo
fT < / Jo
e-xt\eAhtx-S{t)x\dt
+ M W /T°°(exP(-(A - ^
t
)
+ c-^-)* ]A
78
Chapter 2. Linear
Semigroups
for h sufficiently small (i.e., h € (0, l/|u;|) such that A > w(l — hw)~l). and (2.30) immediately imply lim(A7 - Ah)~lx
(2.31)
This
B)~lx
= (XI -
for all x G X and A > w. On the other hand we have (2.32)
(XI - Ah)-lx
- (XI - A)'lx
= (XI - Ah)-l(Ah
- A)(XI -
A)^x
for all x € X, A > u and h sufficiently small. The representation (XI — Ah)-1 — f0°°e~xteAhtdt together with the estimate (2.29) implies ||(AJ - Ah)-l\\
w < M(X ) \ 1 — flu )
for h sufficiently small.
Therefore we get from (2.32) and (2.28) lim(AJ - Ah)-lx
= (XI - A)~xx,
This and (2.31) prove (XI - A)'1 A = B.
X > u, x e X.
= (XI - B)"1 for all A > w which shows D
2.23. Theorem (Exponential Formula). Let A be the infinitesimal generator of the Co-semigroup S(-) on X. Then we have for all x € X S(t)x = lim (I - -A) n
H
x,
t > 0,
the limit being uniform with respect to t in bounded intervals. Proof. For some constants M > 1 and w £ M we have S(-) € G(M,u>). Without restriction we can assume u > 0. For t > 0 and x e dom A we have S(t)x - { i - -A) ~nx = S(t/n)nx
(2.33)
J2 S(jt/n)
( / - -Aj
U J
- J2 S(jt/n)(l--A)~n
- ( i - -A) (s(t/n)x
~nx - ( / - -AJ
' ( 2 ( S ( t / n ) x - x) -
a)
S(t/n)Ax),
3=0
where we have also used that S(t) and (XI —A) From (2.26) we get /
7
t
A
\~n
x
commute for t > 0, A G p(A).
M
l( -n ) hjl^Jnr^
-1,2,....
2.4. Lumer-Phillips
theorem
79
Using this in (2.33) we have -n+j
S(jt/n)(l-±A)
<M2ejtbJ/n{l-ojt/n)-n+j
(2.34)
< M ^ ( l - ^ ) " "
forO
Theorem 2.9 implies n -(S{t/n)x-x)-S(t/n)Ax t n rt/n < -
/
t Jo < 2 max
n /"*/" = - / S(T)AndT t Jo
\S{T)AX
- Ax\ dr + \S{t/n)Ax
\S(T)AX-AX\,
X
-
S(t/n)Ax
Ax\
G d o m A 0 < t < T.
0
i
-
-
From this and (2.33), (2.34) we conclude S(t)x-
(^--^)
l 1 "a < 2M Te"
(1 - ojT/n)-n
max
|5(r)Ac - Ax\
0
for ar G dom^l and 0 < t < T. This proves that, for x G dom.4, we have
(
lim I
t n
\ ~n A) x = S(t)3 J
uniformly on [0,T]. Since ||(7 - {t/n)A)-n\\ < M{1 - LoT/n)-n < Me2"T t G [0, T] and n > 2wT, a standard density argument finishes the proof.
2.4.
for •
The Lumer-Phillips theorem
We recall the definition of a dissipative operator on X given for the general case in Definition 1.5. A linear operator A on X is dissipative if and only if for all x G &omA there exists an x* G Fx such that Re(Ar,a;*) < 0 or, equivalently (see Corollary 1.7), if and only if \(I — XA)x\ > \x\ for all A > 0 and x G domA, which in turn is equivalent to \(XI — A)x\ > \\x\ for all A > 0 and x G d o m A If X is a Hilbert space with inner product (•,•), then A dissipative means Re( Ax, x) < 0 for all x G dom A Let u g l b e given. Then it is easy to see that A — wl is dissipative if and only if for any x G dom A there exists an x* G Fx such that Re(Ax,x*) < u\x\2 which is equivalent to |(A7 - A)x\ > (A - u)\x\ for all A > u> and x G d o m A In a Hilbert space this is equivalent to Re(Ar, x) < w\x\2. It is also easy to see that m-dissipativity of A — ail is equivalent to m-dissipativity of A
80
Chapter 2. Linear Semigroups
2.24. Example. Consider the linear operator A defined by dom A = {0 G X |0 is absolutely continuous on (0,1) (2.35)
with 0(0) = 0 and 0' G X} A
0 £ d o m A,
where X = L p (0,1), 1 < p < oo, or X = C(0,1). Case i : X = L p (0,1), 1 < p < oo. Given 0 G X it is easy to see that
A > 0.
Finally, for | 0 | c = |0(O)| we have 0 = 0. Thus also in this case A is dissipative onX. Case 3: X = L 1 (0,1). For 0 G X we set 0* = |0| L i sign0 G L°°(0,1). It is easy to see that 0* G F<j>. For e > 0 we define ^
signr 1 / I r/e
if \T\ > e, -fi 1 ^ it \T\ < e.
For 0 G dom A we get / V,(<MzM(z) <*x = / JO
Ve(r) dr = # £ (0(1)) > 0,
J(t>(0) '0(0)
where r|-e/2
* « M = < i , T\,22 2e
if|r|>e, if |r| < e.
2.4. Lumer-Phillips
theorem
81
By Lebesgue's dominated convergence theorem we have / t/je((j)(x))(t)'(x)dx -» / sigii(f>(x)(f)'(x)dx Jo Jo
as e 4. 0,
so that
( A ^ * ) = H^|L1limtfe(
Therefore yl is also dissipative on X in this case. The equation (XI - A)(f> = v), ip e X, <j> e domA, A > 0, is equivalent to 0' = -A> + >,
0(0) = 0,
resp. to (2.36)
-F
0 < x < 1.
Jo by (2.36) is in dom A tor X = Lp(0,1), 1 < p < 00, It is easy to see that <> / given and also for X = C'o(0,1). Thus A is m-dissipative.
2.25. Theorem (Lumer-Phillips). Let A be an operator on X and w € R. TTien i/ie following statements are equivalent: (i) yl JS i/ie infinitesimal generator of a Co-semigroup of class G(1,OJ) on X. (ii) A is densely defined and A — ul is m-dissipative. If X is reflexive, then (ii) can be replaced by (ii') A — UJI is m-dissipative. If (i) or equivalently (ii) is satisfied, then A — wI is strictly dissipative, i.e., we have Re(Ax,x*) < w\x\2 for all x e dom A and all x* G Fx. Proof. Without restriction we can assume that w = 0 (otherwise we replace A by A — ul). Note that A generates a semigroup of class G(l, u>) if and only if A — u)I generates a semigroup of class G{\, 0). a) Assume that (ii) is true. Dissipativity of A implies (2.37)
\{XI-A)x\
> X\x\,
xedomA,A>0.
For A > 0 we have range(A7 — A) = X. By the Open Mapping Theorem we conclude that (XI - A)'1 e C(X), A > 0. Then (2.37) implies
IKAJ-ii)-1!!^, A > O . The operator A is closed, because XI — A = ((XI — A ) - 1 ) - 1 is closed. By the Hille-Yosida theorem we see that A is infinitesimal generator of a Co-semigroup 5(-) of class G( 1,0).
82
Chapter 2. Linear
Semigroups
b) Conversely let A be the infinitesimal generator of a Co-semigroup of contractions. Then dom A = X by Theorem 2.22. For x* G Fx we have \{S{t)x,x*)
< \S(t)x\ \x*\ < \x\ \x*\ = \x\2,
t > 0.
This implies R e / i ( S ( t ) x - x), x*\ = -(Re(S{t)x,x*) - \x\2) < 0,
t > 0,
and by taking t 4- 0 Re(Ax, a;*) < 0 for all x G dom A, x* G Fa;. This proves that A is strictly dissipative. c) Assume that X is reflexive and A is m-dissipative. Let xJ5 G X* be such that (a;,a;J) = 0 for all x G dom A For the Yosida approximations Ah we get (2.38)
{Ahx,Xo) = - ( ( 7 - f t A ) _ 1 x - x , x 5 ) = 0,
x G dom A, ft > 0.
From Theorem 1.10, (hi), we conclude that (2.39)
lim(J - hA)~lx
= x,
|_Ahx| < \Ax\,
x G dom A, ft > 0.
x e dom A,
and
Since X is reflexive, it is weakly sequentially compact (see for instance [Yo, p. 126]), i.e., for any x G dom A there exist a sequence (ftn)neN with hn I 0 and a z € X such that (2.40)
w- lim Ahnx = w- lim A(I - hnA)~lx
= z.
As under part b) of this proof we see that A is closed. By Lemma 2.26 from below the operator A is also weakly closed (i.e., A is closed in Xw x Xw). Consequently, from (2.39) and (2.40) we conclude z — Ax, i.e., w-linin^oo Ahnx = Ax which together with equations (2.38) and (2.40) implies (AX,XQ)
— lim (Ah„x,XQ) — 0. n—>oo
By choice of XQ this implies (x — Ax,
ZQ)
= 0 for all x G dom A
or, equivalently, (y, XQ) = 0 for all y G range(7 - A) = X. This proves xg = 0, i.e., dom A = X. • 2.26. Lemma. Let A be a closed linear operator on A. Then A is also weakly closed.
2.5. A second order equation
83
Proof. The graph GA of A is a linear subspace of X x X. Then the result follows from a standard result on convex sets in Banach spaces (more generally in locally convex linear topological spaces; see for instance [La, p. 243]). • 2.27. Theorem. Let A be a closed densely defined operator on X. If A and A* are dissipative, then A is m-dissipative and thus the infinitesimal generator of a Co-semigroup of contractions. Proof. Let y G range(7 — A) be given. Then there exists a sequence (xn)nepi c dom A such that yn := xn - Axn ->• y as n -» oo. By dissipativity of A we get \x„\ < \yn\, n = 1,2,..., and \Xn
Xm\
S
\\Xn
XJJI)
J\\Xn
XTnJ\
— 12/TT.
2/m|)
771, 71 =
1, 2, . . .
.
Hence (xn)n^n is a Cauchy sequence in X. We set x = limn-^oo xn. From xn —> x and yn -» y we infer that also lim„_>.00 Axn — x — y. Since A is closed, we see that x G dom A and Ax = x — y, i.e., y G range(7 — A). Thus range(7 — A) is closed. Assume that range(7 — A) C X. Then there exists an x* G X*, x* ^ 0, such that ((/ - A)x, x*) = 0
for all x e dom A.
By definition of the adjoint operator this implies x* e domvl* and (I—A)*x* = x* - A*x* = 0. Dissipativity of A* implies \x*\ < \x* -A*x*\
=0.
This contradicts x* ^ 0 and proves range(7 — A) = X, i.e., A is m-dissipative. The result follows now from Theorem 2.25. •
2.5.
A second order equation
Let V C> H Q V* be a Gelfand triple as explained in Section 3.1. We shall apply the Lumer-Phillips theorem to the following second order equation in variational form: (2.41)
p(,«'(*)) +a(
H
a.e. on t > 0 for all 4> G V. Here / is a function [0, oo) ->• H and p : H x H —^ C, /i,CT: y x y —>• C are sesquilinear forms2, where p and a are hermitean. 2
We follow here the convention that sesquilinear forms are linear in the first argument and conjugate linear in the second argument.
84
Chapter 2. Linear
Semigroups
Moreover, we assume that, for non-negative constants Mi, M2, M3 and mi, 1713, we have \P(,II>)\<MI\\H\II>\H, (2
(
0e#>
P(^^)>"»I|0IH.
'
'
Reti(4>,4>)>0,
(2.42c) V
W ^ ,
From (2.42a) and (2.42c) it follows that (2.43)
({h,A),{h,ip2))x
:=
PWi,ih)
for ((j>i, ijji) G V x H, i = 1,2, defines an inner product on X = V x if such that •I try
the associated norm \(, <j>)+p(tp, ip)) , ((/), ip) G X, is equivalent to the standard norm on X (i.e., to |(<£,VOI = (l^lv + M J J ) )• The given sesquilinear forms p, /J, resp. a define bounded linear operators Mo : H —> H, Do : V ->• V* resp. A0 : V ->• F* by (compare Theorem 3.2) {4>, MoV) = {4>, M o V k = />(& V0> (2.44)
4>,^eH,
<& Anfr) = i*{4>, */>), >, 1> e V,
The operators Mo and A0 are invertible by (2.42a) and (2.42c). For a function u : [0, oo) -> V with «'(i) G V and «"(<) € if a.e. on i > 0 equation (2.41) is equivalent to (2.45)
M0u"(t) + D0u'(t) + A0u(t) = /(*)
a.e. on i > 0.
This equation implies also Aou(t) + Dou'(t) G if a.e. on t > 0. We define the operator A on X by d o m A = {(>,ip) GX I V G V and AO^ + AJV' G i f } , (2-46)
,
=
f
0
\-M^Ao We set a;(i) = (u(t), u'(t))J, (2.47)
Hi?
-MoXD0,
i G [0, oo). Then equation (2.45) is equivalent to
—x{t) = Ax(t) + f(t)
where / > ) - (0, M 0 _ 1 /(*)) T , t > 0.
a.e. on t > 0,
2.5. A second order equation
85
2.28. Lemma. Let the operator Abe given by (2.46). Then A is m-dissipative on X (equipped with the inner product (2.43)). Proof. We choose x = (>, VO G d o m A Using (2.44) we get (a:, Ax)x = a{4>, V>) + p(V>, -M o _ 1 (i4o0 + A)V0) =
- (>, A)V>> = -2ilm(tP,A04,)
- (V, A)V>>,
which in view of (2.42b) implies Re(x,Ax)x
= -Re(ip,D0ilj}
— -Re/i(V>,V0 < 0,
i.e., A is dissipative. In order to prove that range(A7 — A) — X for some A > 0 we consider the equation (2.48)
(A/-A)(W) = (s,/i)6l,
(^,V)GdomA
This equation is equivalent to Ac/> — tp — g and Xtp + MQ1(AQ4> + DQIJJ) = h resp. to ( A }
\{X, M0tf>) + (X, A0> + D0i>) = (X, M0h)
for all X € V.
The second equation can be written as
Ap(x. V>) + ^(x, 4>) + M(X, VO =
P(X> &),
x e V.
Using the first equation of (2.49) we get (2.50)
MxA)=p(x,h)+\p{x,9)+v(x,9),
X^V,
where the sesquilinear form v> : V x V —• C is defined by v\ (x, <£) = A2p(x,
X,
The sesquilinear form v\ is bounded and satisfies the estimate K ( X , X ) | > mslxlv " A ' M i l x ^ - AM 2 | X |^ > ™M2v ~ {\2c2M1 + \M2)\x\2v,
X&V,
where c is the embedding constant for the embedding V C> H. This shows that, for some Ao > 0, we have
K(x,x)l> 2TO3lxlv, x e v ,
O
According to the Lax-Milgram theorem (see Theorem 3.2) there exists a bijective bounded operator B : V —• V* with bounded inverse such that v\(x, 4>) = (X,B4>), xA^V- This and (2.50) imply (j> = B-1(Moh
+ \M0g + D0g) € V,
0 < A < A0.
86
Chapter 2. Linear
Semigroups
Since g and
a.e. on * > 0.
This is equivalent to p((j), u"{t)) + n{4>, u'(t)) + a(<)>,u{t)) = {
a.e. on t > 0
for all 4> G V. If o;(0) G V x H and / G £^.([0, oo); # ) , then x{t) = S{t)x{0) + J*S(t T ) / ( r ) dr, t > 0, is the unique mild solution of (2.47). From Theorem 2.15 we get, for x{t) = (u(t),v(t))T and t > 0, u{t) = u(0) + / (2.51)
V(T)
dr,
t t t v(t) = v{0) - MQ1 (A0 f U{T) dr + DO f V(T) d r ) + f M^f{r)
dr.
The first equation implies u G C(0, oo; V)nC 1 (0, oo;H). Using A0 JQU(T) dr = J0Aou(r)dT and J0v(T)dr = u(t) — u(0) we obtain from the second equation of (2.51) (X,M0u'(t))
= (x,Mov(0))
- (X, f
A0u(r)dT)
Jo
-(X,Do(u(t)-u(0)))
+ (x, [
f(r)dr)
Jo
= {x, M0v(0)) - f (x, A0U(T)) Jo
dr - (X, D0u(t))
+ (X,D0u(0))+ f (x,f(T))dr Jo
2.5. A second order equation
87
a.e. on [0, oo) for all x £ V. This equation is equivalent to p(X, A*)) + M(X, u{t)) + / a(X,
«(T))
dr
Jo
= P(X, «'(0)) + M(X, «(0)) + / (x, /(r)> dr Jo a.e. on [0, oo) for all x € V. Differentiating we get - (p( X , «'(*)) + M(X, «(*))) + *(x, «(<)) = (X, /(*)> a.e. on [0, oo) for all x £ ^ , which is a weak form of (2.41).
This page is intentionally left blank
CHAPTER 3
Analytic Semigroups In this chapter we present the basic facts on analytic semigroups resp. on linear Co-semigroups on Eg which can be extended analytically to a cone in C containing RQ~. In particular we prove that an operator is the infinitesimal generator of an analytic semigroup if and only if it is sectorial (Section 3.2). In Section 3.1 we describe the construction of sectorial operators based on the concepts of Gelfand triples and F-coercive sesquilinear forms together with an application of the Lax-Milgram theorem. Our presentation follows [Pal] resp. [Ta].
3.1.
Dissipative operators and sesquilinear forms
In this section we present a construction for a special class of m-dissipative linear operators on Hilbert spaces, the so-called sectorial operators. These operators play an important role in the context of parabolic partial differential equations. For a complex Banach or Hilbert space Y we denote by Y* the antidual space of all bounded antilinear functional (called also conjugate linear junctionals) on Y1. If Y is a complex Hilbert space with inner product (•, -)y then, according to Riesz' theorem, we can identify Y* with Y by associating with x € Y the antilinear functional y —¥ (x,y}y, y sY, which gives a linear isometry Y —»• Y*. If we associate with x £ Y the linear functional y —> (y,x)y, y G Y, then we get an antilinear isometry between Y and the dual space of all bounded linear functionals on Y. We shall use also that a complex Hilbert space Y is antireflexive, i.e., for any x** € Y** there exists a unique x € Y such that x**(y*) — y*(x) for all y* € Y*. The mapping defined by x** —>• x is a linear isometry Y** -¥ Y. Let if be a complex Hilbert space and V C H be a complex antireflexive Banach space. 1 f G Y" satisfies | / ( y ) | < const. |j/|y for all y G Y and f{ay1+f3y2) for all a, /? €C and 3/1, y2 G Y.
89
=
af(y1)+Pf(y2)
Chapter 3. Analytic
90
Semigroups
3.1. Lemma. If the embedding V C» H is dense and continuous, then this is also true for the embedding H Q V*. Proof. Let M 0 be the embedding constant for V Q H, i.e., \V\H < MQ\V\V, v € V. Then for any h G H we have \{h,v)H\
< \h\H\v\H < M0\h\H\v\v,
v€V,
i.e., \h\v < Mo\h\n- Thus the embedding H Q V* is continuous and Mo can also be chosen as embedding constant for the embedding H Q V*. Assume that H is not dense in V*. By the Hahn-Banach theorem there exists a « £ V** = V, v ^ 0, with v(h) = {h,v)H = 0 for all he H. This implies v = 0, a contradiction. O We call the triple (V, H, V*) a Gelfand triple with pivoting space H. In a Gelfand triple the anti-duality pairing x*(v), v € V, x* G V*, is the continuous extension of (-,-)// restricted to i? x V. In particular, for any x* G V* there exists a sequence (hn) C if with x*(v)=
lim (hn,v)H,
veV,
the limit being uniform for w in bounded subsets of V. We already assumed V C H. By the identification H — H* the elements of H represent bounded antilinear functionals on H (to h G H there corresponds the functional w —> (h,w)). In view of the continuous embedding V Q H the restriction of such a functional to V is a bounded antilinear functional on V. In this sense we consider H as a subspace of V*. Therefore the embeddings V Q H, V Q V* resp. H Q V* are given by the restriction of the identity mapping to the corresponding subspace. If the Hilbert space H is real, then we have the same construction as above. We only have to delete the prefix 'anti' everywhere. A mapping b : HxH —^ C is called a sesquilinear form on H if y -> b(x, y), y G H, is antilinear for all fixed x G H and x —> b(x,y), x G H, is linear for all fixed y G H. A sesquilinear form &(•, •) is called bounded (or continuous) if there exists a constant 7 > 0 such that (3.1)
\b(x, y)\ < i\x\H\y\H,
x,y G H.
The norm of &(•, •) is defined as 111.11
\\b\\ =
SU
Kxiv) P
I ,
1 ,1
•
The following theorem is of central importance when solving Dirichlet problems for elliptic equations.
3.1. Dissipative operators and sesquilinear forms
91
3.2. Theorem (Lax-Milgram). Let b : H x H -» C be a sesquilinear form satisfying (3.1) and (3.2)
\b(x,x)\>6\x\2H,
x£H,6>0.
Then there exists a unique linear bijective operator B : H —• H* which is continuous in both directions such that b(x, y) = {Bx){y),
x,y G H.
l
Moreover, we have ||B|| < 7 and \\B~ \\ < 1/8. Proof. For fixed x G H the mapping y —> b(x,y) is antilinear and bounded (by (3.1)). Therefore there exists a unique w 6 H* such that b(x,y) = w(y), y £ H. We define Bx — w. It is easy to see that B is linear. From (3.1) we obtain \{Bx){y)\ = \b(x,y)\ < -y\x\H\y\H,
x,y G H,
which implies \BX\H* < 7|a;|if, i.e., B is continuous with ||B|| < 7. Assume that Bx = 0. Then (3.2) implies 0 = |(5a;)(a;)| = \b{x,x)\ > 8\x\2H, i.e., x = 0. Thus B is injective. The estimate 6\x\*H < \b{x,x)\ = \(Bx)(x)\ < \x\H\Bx\H.,
X G H,
1
implies <5|a;|^ < \BX\H*, X G H, or equivalently \B~ W\H < (1/S)\W\H*, W G range B, i.e., B^1 is continuous with ||JB_1]| < 1/8. It remains to prove surjectivity of B. Continuity of B~l and B implies that range B is closed. Suppose that range B ^ H*. By the Hahn-Banach theorem there exists a yQ G H, yQ ^ 0, such that (Bx)(y0) = 0 for all x G H. This implies for x — yo 0 = \(By0)(yo)\ =
\b(y0,yo)\>S\y0\2H
and consequently yo = 0. This contradiction proves range B = H*.
•
For the rest of this section we denote the norm and inner product on H by || • || and (-, •), respectively, and assume that V C H C V* is a Gelfand triple. 3.3. Definition. A sesquilinear form a : V x V —> C is called V-coercive if there exist constants 7,8 > 0 and K £ R such that (3.3)
|o(a;,|/)|<7|a;|v|»|v,
x,y€V,
and (3.4)
Rea(x,x)>6\x\lr-K\\X\\2,
X G V.
The inequality (3.4) is usually called Gdrding's inequality. If (3.3) and (3.4) hold with K = 0, then a(-, •) is also-called V-elliptic.
92
Chapter 3. Analytic
Semigroups
3.4. Theorem. Let a(-, •) be a V-coercive sesquilinear form. Then the following is true: a) There exists a unique linear operator A on V* with dom^4 = V such that, for any w E V, (3.5)
a(v,w) = -(Av)(w),
w£V.
Moreover, \\A\\c(v,v) < 1> where 7 is the constant in (3.3), and A — KI is a bijective mapping V - J F * with \\(A — Kl)~1\\crv,v) < V^> where 5,K are the constants in (3.4). Moreover, \\(A—KI)~1\\C(V,V-) ^ MQ/5, i.e., K G p{A), where M0 is the embedding constant for V c> H. b) Let A be the part of A in H, i.e., domyl = {x £ V \ Ax G H} and Ax = Ax for x G dom A Then the following is true: (i) a(v,w) = —(Av,w), v G dom A, w EV and dom A = {v G V I there exists an a > 0 such that \a(v,w)\ < a\\w\\ for allw G V}. (ii) dom A is dense in H. (iii) K G p{A). (iv) A — KI is m-dissipative. Proof, a) For fixed v G V the mapping w —» a(v,w), w G V, is a bounded antilinear functional / G V*. We put Av = —f. Then A satisfies (3.5) and obviously is a linear operator V —> V*. Using (3.3) we get ,T , \Av\v
\a(v,w)\ , , sup , < j\v\v, v G V, ™ev\{o} \w\v which proves boundedness of A as an operator V —> V* and ||^4||£(v,y) < 7If we define aK(t;, w) = a(u,w) + K(V,W), v,w,e V, then we see (with M 0 being the embedding constant for V C\ H) that =
|aK(w,tu)| < ( 7 + |K|MO)|V|V/|W|V,
(3.6)
ReaK(i>,u) > ^|w|y,
V,W
£ V,
v G V.
Therefore the sesquilinear form aK(-, •) defines an operator AK : V —• V*. The definition of aK implies that (—-AK)(iu) = (—A)(W) + K{V,W), W GV. Therefore we have AK = A — KI. Using (3.4) we obtain the estimate \AKv\v*\v\v
> \{AKv)(v)\ = \aK{v,v)\ > ReaK{v,v)
> 6\v\l,
VGV,
which implies that AK is injective and H^Ml^rangeA^v) - V^- I*1 order to prove surjectivity of AK we choose / G V*. Then, according to the LaxMilgram theorem (Theorem 3.2), there exists a unique v GV such that f(w) =
3.1. Dissipative operators and sesquilinear
forms
93
aK(v,w) = -(AKv)(w), w G V. This proves AK(~v) = / . Thus H A " 1 ^ ^ . ^ ) < 1/5 and, observing |u>|y. < MQ\W\V, W G V, also H A " 1 ! ! ^ . ^ . ) < M$/6, which in particular implies K G p(A). b) Let Av G H. Then by the identification H* = H and the fact that the embedding H Q V* means restriction of functionals on H to V we obtain (3.7)
a{v,w) — -{Av){w)
= -{Av,w),
w G V,
and, consequently, |a(v,«;)| < \\Av\\ \\w\\, w £V. If on the other hand |(Av)(u>)| = \a(v,w)\ < a||ty||, w G V, for some a > 0, then, by density of V in H, Av is the restriction to V of a bounded antilinear functional h G H* = H. This implies Av = h G H. Thus the characterization of dom A given in the theorem is verified. It is easy to see that the part AK of AK in H is given by AK = A — KI and that domA* = dom A. Since H is dense in V*, A~x is continuous and dom A — A^H, we see that dom A is dense in V with respect to the topology of V and consequently also with respect to the topology of H. Finally, by density of V in H, dom A is dense in H. Obviously AK is injective with range AK = H. Moreover, we have (using (3.4)) for v G dom A | | A ^ | | H | > \(AKv)(v)\ = \aK(v,v)\ > ReaK(v,v)
> S\v\l >
~^\\vf,
which proves HA^ftH < (Mg/6)\\h\\, h<= H, i.e., K G p(A). Dissipativity of AK = A — KI follows from Re(AKv,v)
= -ReaK(v,v)
< -S\v\y
< -—^ \\v\\2 < 0,
» e dom A.
If (3.4) is satisfied for some K £ R , then it is also true for some K0 > 0. This implies that range AKQ — H. This and dissipativity of AK show that A is m-dissipative (see Definition 1.11, b)). • The final part of the proof for Theorem 3.4 shows that in fact the operator A — (K — 8/MQ)I is dissipative. 3.5. Corollary. The operator A defined in Theorem 3.4, b), is the infinitesimal generator of a Co-semigroup S(-) G G(l,n). Proof. The result follows immediately from the Lumer-Phillips theorem and Theorem 3.4, b). • The following estimates for the resolvent of A resp. A will be important in the next section. For 6 G (0,7r/2] and K G R the sector T,QtK is denned by (see
Chapter 3. Analytic Semigroups
94
Figure 3.1) S e , K = { A e C | A ^ K , | a r g ( A - / < ) | < - + 0}. ~2 Instead of £# o we shall write T,g.
V
V*
se
/Figure 3.1
Figure 3.2
For later use we observe that (see Figure 3.2) (3.8)
|ImA| > |A|cos0
for A e E e , ReA < 0.
3.6. Theorem. Let a(-, •) be V-coercive. Then there exist a 9 £ (0,7r/2] with He,K U {«} C p(A) n /J(J4) and, /or any e G (0,0), positive constants 7$ = 7i(e), i = 1,2,3, swc/i £/ia£ /or A G £ £ , K , A ^ K , (3.9)
||(i-A/)-1||z;(y,!V)<71(e),
(3.10)
IKi-A/m^.,^
(3.11)
IKi-A/)- 1 !!^.^.)^
(3.12)
IKA-A/)-1!!^^)^
(3.13)
IKA-A/)-1!!^,^^
72(e) |A-K|V2'
73(e) |A-K|' 73(e)
|A-«|' 72(e)
IA-
1/2-
Proof. It is sufficient to consider the case K — 0. Otherwise we replace a(-, •) by aK(-,•) and accordingly A resp. A by A - KI resp. A- KI (compare (3.6)). We first establish the estimates for ReA > 0, A ^ 0. a) For u G V we set / = (A - \I)u G V*. Then, for any v G V, (3.14)
/(u) = - a ( u , w ) - A ( u , t ; ) .
3.1. Dissipative
operators and sesquilinear forms
95
For u = v and Re A > 0 we obtain \f\v\u\v
> |/(w)| > - R e / ( u ) = Rea(u,u)
which implies \(A — XI)u\v (3.15)
+
\\u\\2ReX>6\u\2/,
> <S|«|v, u £ V, or, equivalently,
WiA-Xir'Wav^v)^],
ReA>0, A ^ 0.
b) Formula (3.14) for v = u gives (3.16)
|A| \\uf < | / H | + |a(u,«)| < \f\vMv
+ l\u\2v.
This and (3.15) imply |A|H2<72W., where 7I — (1 + j/6)/6.
The last inequality is equivalent to
Mi-AJ)u|v.
^IAHIUII,
«6V,
which proves (3.17)
||(A-AJ)-l£(v.,ff)<^_,
R e A > 0 , A ^ 0.
c) Equations (3.14) and (3.15) imply |A||(u,v)| < | / | v M v + 7 M v M v
v e V,
-1
where 73 := 1 + j/S. For u = (A — A I ) / considered as an element in V* we have u(v) = (u, v), v € V. Therefore the last estimate gives
\((A-\I)-1f)(v)\
| | ( i - Xir'Wavy)
V€V,
< (73/|A|)|/|y*> which implies < 7^,
ReA > 0, A ^ 0.
d) If u G dom A, then f = (A- XI)u e H and f(v) = (/, v), v € V. For v = u we obtain, for Re A > 0, A ^ 0, 11/11 l|«|| > | / ( « ) | = | ( ( 4 - A J ) u ) ( « ) | = \a(u,u) + X{u,u)\ > Rea(u,u) + ||u|| 2 ReA > 6\u\2v. This and (3.16) imply
|A| \\u\\2 < |/(«)| + |a(«,«)| < 11/11 ||U|| + 7 H 2 , < 73II/II H , resp. ||(4 - A/)" 1 /!! < (73/IADH/ll, i.e., we have established (3.20)
\\{A-)J)-1\\c(H,H)^l[ty
ReA>0, A^0.
96
Chapter 3. Analytic
Semigroups
e) Inequalities (3.19) and (3.20) imply, for u G domA,
s\u\l< H/ll N| 0, A ^ 0, (3.21)
IK^-AJ)-
1
!^)^-^)
In a second step we establish the estimates (3.9) - (3.14) for Re A < 0, A in sectors E £ with e G {0,9) for some 0 G (0, TT/2]. We first prove a result in a more general setting (for later use) than needed here: 3.7. Lemma. Let A be a densely defined operator on a Banach space X and assume that { A | R e A > 0 , A ^ 0 } C p{A) and that there exists a constant 7 > 0 with (3.22)
\\{A-\I)-l\\C{x,x)
R e A > 0 , A ^ 0.
Then there exist a constant 9 G (0,7r/2] with T,g C p{A) and, for any e 6 (0,9), a constant 7(e) > 0 with (3.23)
11(^4-AJ)-1!!^,^^^,
A G E e , A ^ 0.
Proof. For A — /x + IT we have {A - XI)'1 (3.24)
= {A- irl)-1
{I ~ n{A -
= {A- iTl)-l^pi{A
-
irl)-1)"1
iriyi,
j=o
provided |/z| \\{A - irl)
(3.25)
1
\\c(x,x) < 1- We choose c G (0,1). Then T\
1
Ul-KA-*I)-rX[x^)<-^
for \fi\ < C | T | / 7 . If we define e = arctan(c/7), then \H\/\T\ = tan(|argA| 7r/2) < tane = c/7 and consequently (3.24) is true for A G S e , Re A < 0. Since c G (0,1) was arbitrary, this proves also Y,g C p{A), where 9 = a r c t a n l / 7 . Moreover, (3.8), (3.22), (3.24) and (3.25) imply \\{A- Xir'Wc^^
< -^7^— < jz ^ 7^7, A G S £ , R e A < 0 , \T\ 1 - c (1 - cjcose |A| which together with (3.22) proves the result.
•
3.2. Analytic semigroups
97
Proof of Theorem 3.6, continued. The estimate (3.12) follows immediately if we apply Lemma 3.7 using (3.20). In order to prove (3.13) we use (3.24), (3.25) for X = H and (3.21), (3.8). We get
\\{A-\I)-1\\C{H,V)
< <
MA-iTiy'Wc^Wil-^A-iTiry'l ^
1
<
C(H,H)
72
IV2 1 - C - (1 - c)Vcose |A|V2 for A G %, ReA < 0. This together with (3.21) proves (3.13). The proof for (3.9) - (3.11) is completely analogous. One has to use the estimate
ll(/^(i-^rr'll A V ,., l ,,< F Ji R < T ^ for \fi\ < c|rI/73 and the estimates (3.15), (3.17), (3.18).
•
The most important properties of the operators A and A are the estimates (3.11) and (3.12), respectively. This gives rise to the following definition. 3.8. Definition. A densely defined operator A on a Banach space X is called a sectorial operator on X if there exist numbers 6 G (0,7r/2] and K G R such that (i) E 9)K C p(A) and (ii) for any e G (0,6) there exists a constant 7 = 7(e) > 0 with (3.26)
IKA-A/)-
1
!!^,^-^-,
A€S£,
M
A^.
\A - K\
Lemma 3.7 implies that we only need to establish the estimate (3.26) in a half-plane, i.e., for e = 0, in order to verify that an operator is sectorial. A straightforward consequence of Theorem 3.6 is the following result: 3.9. Proposition. Under the assumptions of Theorem 3.4 the operators A and A defined in that theorem are sectorial operators on V* resp. on H. In addition we have K G p(A) n p{A) (K the constant in (3.4)). 3.2.
Analytic semigroups
Throughout this section X will be a complex Banach space. For a bounded linear operator A on X the mapping z -> eAz, z G C, is analytic on C and satisfies the semigroup property eA(Zl+Z2^ = eAzieAz2, zi,z% G C. In this section we investigate semigroups of bounded linear operators on X which are analytic on some subdomain of C. Furthermore, we deal with the question, when a Co-semigroup can be extended to an analytic semigroup. Since the
Chapter 3. Analytic
98
Semigroups
subdomain C of C, where such a semigroup is defined, has to be an additive subsemigroup of C, there are two possibilities, C = C or C is a cone in the right half plane with vertex at 0. For simplicity we restrict ourselves to symmetric cones around the real axis, Ca := {z G C | z =£ 0 and | arg z\ < a} U {0}, where a € (0,7r/2]. 3.10. Definition. Let either C = Ca with 0 < a < n/2 or C = C and assume that (5(z)) „ is a family of bounded linear operators on X. S(-) is called an analytic semigroup (or holomorphic semigroup) on X if and only if (i) 5(0) = / and 5(zi + z 2 ) = 5(zi)5(z 2 ) for all z 1; z2 G C, (ii) for any x G X and x* e X*, the mapping z-> (x*,S(z)x),
z eC,
o
is analytic in C and (hi) for any x £ X and e G (0,1), lim_ S{z)x = x resp. z->0, 2 6 C e Q
lim S(z)x = x if C = C z
->0
From basic results on analytic vector valued resp. operator valued functions (cf. for instance [H-P]) it follows that condition (ii) is equivalent to o
(ii') for any x € X the mapping z -¥ S(z)x is analytic in C or to o
(ii") the mapping z —> S(z) is analytic in C. The following observations are an immediate consequence of (ii"): 3.11. Proposition. Let {S(z))zeC be an analytic semigroup onX. a) The mapping z —» S(z) has continuous derivatives of arbitrary order in C with respect to the uniform operator topology. b) IfC — C then there exists a bounded linear operator A on X such that S(z) = eAz,
zeC.
Proof. Statement a) is obvious from (ii"). If C = C then z —> S(z) is an analytic function C -> C(X). We set A = S'(0) G C(X). Then we have S'(z) = \imw^0(l/w)(S(z + w)- S(z)) = S(z)limw^0{l/w)(S{w) - I) = S{z)A and consequently 5"(0) = Yimz^0{\ / z){S'{z) - A) = limz^0(l/z){S(z)-I)A = A2. By induction we see that 5 ^ ( 0 ) = A>, j = 0 , 1 , . . . . The Taylor expansion of S(z) gives the result. • Of course, the restriction of an analytic semigroup on X to R is a Cosemigroup on X. Next we want to address the question when a Co-semigroup
3.2. Analytic semigroups
99
on X can be extended to an analytic semigroup on X. Necessarily such a semigroup has to have continuous derivatives of arbitrary order on t > 0 with respect to the uniform operator topology. The next proposition characterizes this property. 3.12. Proposition. Let S(-) be a Co-semigroup on X with infinitesimal generator A. Then the following statements are equivalent: (i) S{t)X C domA for all t > 0. (ii) The mapping t —>• S(t), t > 0, is differentiable on t > 0. / / (i) or, equivalently, (ii) is true, then t ->• S(t) has derivatives of arbitrary order for t > 0 and S{k\t)=AkS(t),
(3.27)
t > 0, Jfe = 1,2
Proof, a) Assume that (i) is true. We first prove that (i) implies S(t)X cdomAh,
(3.28)
t > 0, k = 1,2,... .
Fix k € N and assume that, for any x e X and i = 1 , . . . , k - 1, we have S(t)x € domA 1 , t > 0. Then using also Proposition 2.11, b), we get Ak~1S(t)x
= S'(i/fc)(A5(i/fc))fc"1a; G domA,
t > 0,
fe
i.e., S(t)x G domA , t > 0 , i £ l Since Afc, fc = 1,2,..., is closed (cf. Proposition 2.11, c)), k A S(t), t > 0, k = 1, 2 , . . . , are bounded linear operators on X graph theorem. From (3.28) and Proposition 2.11, b), we see to > 0 and i f X , the mapping t -> (dk/dtk)S(t)x is continuous £s{t)x
= £-kS(t0
+ r)x =
= AkS(r)S(t0)x
the operators by the closed that, for any for t > t 0 and
£-S(r)S(to)x
= AkS{t)x,
t > t0, k = 1,2,... .
Integration yields rt+h r-t-re
AkS(r)xdT
/ V»)
,t+h = /
S(T-t0)AkS(t0)xdT
for any t > to, x e X and \h\ < t — to- This implies the estimate \(Ak-1S(t
+ h)-Ak-1S(t))x\<\h\\x\\\AkS(t0)\\
sup 0
and, consequently, ||A fc - 1 5(t + h) - Ak-lS{t)\\
= 0{\h\)
ash^O
||5(r)||
Chapter 3. Analytic
100
Semigroups
for t > to and k = 1,2,... . This proves that the mappings t —> AkS(t) are continuous for t > 0 with respect to the uniform operator topology. Therefore (3.29) implies A^Stf
+ h)- A"-1S(t)
ft+h = / AkS{r) dr
for k = 1,2,..., t > 0 and |ft| < £, i.e., the mappings t ->• AkS(t), k = 0 , 1 , . . . , are continuously differentiable on t > 0 with respect to the uniform operator topology and (d/dt)Ak-1S(t) = AkS(t), t > 0, k = 1,2,... . For fc = 1 this shows that t -> 5(i) is differentiable on t > 0 and S"(t) = AS(t), t > 0. An induction argument completes the proof for (3.27). b) If (ii) is true, then we get, for any x G X and t > 0, lim | (S(t + fc)i - 5(t)a:) = flim | (S(t + h) - 5 ( t ) ) ) x = S'(t)a:, i.e., we have S(t)x & domA.
D
A Co-semigroup 5(-) on X satisfying (i) resp. (ii) of Proposition 3.12 is called a differentiable semigroup on X. Of course, a differentiable semigroup S(-) in general does not have an analytic continuation. As we shall see in the next theorem the behavior of S(-) as t \. 0 is crucial. 3.13. Theorem. Let S(-) be a Co-semigroup on X with infinitesimal generator A. Then S(-) can be extended to an analytic semigroup on X if and only if S(-) has the following two properties: (i) S(t)X C domA for all t > 0 (i.e., S(-) is a differentiable semigroup) and (ii) b := limsupmt\\AS(t)\\ < oo. Moreover, b < 1/e implies that A is bounded and hence the extension of S(-) is given by S(z) = eAz, z G C. For b > 1/e the extension ofS(-) is defined at least on the sector CQ, where 0 < a = arcsin(6e) _1 < 7r/2. If (i) and (ii) are satisfied, then we have, for any x G X, (3.30)
limtkAkS(t)x
= 0,
k = l,2,...
.
Proof, a) We first assume that S(-) has properties (i) and (ii). From Proposition 3.12 we see that t —>• S(i) has derivatives of arbitrary order on t > 0. Hence, for any £Q > 0, Taylor's formula implies the representation (note that
3.2. Analytic semigroups
101
£<*>(*) = 4*S(<), t > 0) n-l fc=0
(3.31) fl»(i) =
r
4rw
(_n
ij. j
/ (* - i-) n _ 1 A n S(T) dr,
t > 0.
t o
For arbitrary K > 0 there exists a J > 0 such that t\\AS(t) || < 6 + K for t G (0, (5]. Using this and also Stirling's formula we obtain the estimate
(3.32)
h.llAks{T)^ - h ) l A S { T / m k * h b + K ) k { k / T ) k <(e{b + K)/t0)k,
t0
provided k is sufficiently large, e.g. k > t/S. This implies the estimate i(b + K) i ||J*»(t)|| < ( ^ - ^ ( t - to))", n > t/S. to Since K > 0 was arbitrary we see that lim.Rn(t)=0
for0
n-*oo
e6
Therefore we get from (3.31) the expansion 00
1 S(t) = £ - ( t - t 0 ) fc A fc S(t 0 ),
t o
fc=0
Consequently this power series converges for \z—
5(z) = J ] - ( z - t o ) f e A f c 5 ( t o ) ,
|z-t0|<^.
fe=0
The family of functions defined by the series (3.33) for all to > 0 gives an analytic continuation of the original semigroup S(t), t > 0, on C = \Jto>0{z G C | \z — to| < to(e&) -1 } U {0}. In case eb < 1 we have to(e6) - 1 > t 0 , which implies C = C. By Proposition 3.11, b), A is bounded and S(z) = eAz, z G C. If e& > 1 then C — Ca with a = arcsin(efc)-1. It remains to prove that (S(z))z c satisfies conditions (i) and (hi) of Definition 3.10. For fixed f > 0 the mappings z -» S(t + z) and z —>• S{t)S(z) are analytic o
in Ca and coincide for z G R, z > 0. This proves S(t + z) = S(t)S(z) for all t > 0 and z G Ca- Then, for fixed z0 G Ca, the mappings z -4 5(z -f zo) and o
z ->• S(z)S(zo) are analytic in CQ and coincide for z G R, z > 0. This proves S(z + z0) = S(z)S(zo) for all z, z0 G Ca.
Chapter 3. Analytic
102
Semigroups
t0/eb t
to
Figure 3.3
Z P
p/ COS2 ea
Figure 3.4
In order to verify property (iii) of Definition 3.10 we set, for 0 < e < 1 and p>0, Cea,p = {z€C€a
| 0 < R e Z < p}
and choose the unique e G (0,1) such that sinea = e(e&)_1. For z £ CeatP we choose t > 0 such that £sin|argz| = \z — t\ (see Figure 3.4). Note that t < p/cos 2 ea for z € Cea>p. The choice oft implies \z — t\ < isineo: = ie(e&) _1 . Using this and the estimate (3.32) (with r = t = to) we get
for k > k0 > p(S cos2 e a ) - 1 . For k < k0 we see from the choice of S that \\AkS(t)\\ < \\AS(t/k0)\\k k
||5((fco -
k
<(b+K) (k0/t)
k)t/k0)\\
SUP 0
\\S(t)\\
and therefore jJ f ||A f c 5(t)|||z-t| f e
fc!
V e 0 /
< \
eo
/
™p 0
0
||5(t)||
3.2. Analytic semigroups
103
We choose K > 0 such that e(b + K,)/b < 1. Then we get from the power series expansion for S(z) 00
I
+ 1^
\\s{z)\\<\\sm^Y^r\\Aks^\\ fc=l
(3.34)
<
sup ||5(0|| (l + ^ E ^ ^ r ) * ) o
For a: G X and 77 > 0 we choose s > 0 such that |x - 5(s)a;| < 77. Since lim2_j.o S(z)S(s)x = limz_».o 5'(2: + s)a; = S(s)x, we can choose 5 > 0 such that \S(z)S(s)x — S(s)x\ < 77 for \z\ < 6, z G C£QjP. Hence we get for these z the estimate \S{z)x -x\<
\\S(z)\\ \S{s)x -x\ + \S(z)S(s)x
- S(s)x\ + \S(s)x - x\
< (M £iP + 2)7?, which proves limz_j.o, zec€a S(z)x = x. b) Assume that S(-) can be extended to an analytic semigroup on X. Then property (i) is true by Proposition 3.12. In order to verify property (ii) we can assume that S(z) is defined on some sector Ca with 0 < a < TT/2. We choose e G (0,1) and set p = 1 + sinea. By continuity of S(-) there exists a constant Mo > 1 such that \\S{z)\\<M0,
zeCea,
\z\
Using Cauchy's integral formula we obtain
A*S(t) = SW(t) = ±-.
l {c_ t)k+1S(C)dt,
J
0
|£—£|=£ sinea
and consequently Mo_ 1 < —jr--^, 0 < * < 1 , fe = l , 2 0 sin'" sin ea ea 1tK which in particular proves (ii). This implies also that for any k > 1 there exists a constant 7fc > 0 such that ||rjfc^4fc5(t)|| < 7fc for 0 < £ < 1. For x G domA k we get (see also Proposition 2.11, b)) \AkS(t)\\
\imtkAkS(t)x «|0
Since domAk ment.
= limtkS(t)Akx
= 0.
UO
is dense in X, the proof is finished by a standard density argu•
104
Chapter 3. Analytic
Semigroups
3.14. Corollary. Under the assumptions of Theorem 3.13 the derivatives of S(z) are given by S(k){z)
= AkS(z),
z£Ca, fc = l , 2 , . . . .
Proof. From (3.33) we see that oo sU)
1
= E !?(* - t0)kAk+JS(t0),
W
k=o
\z - to| <
t0(eb)-\
'
By closedness of Aj we have CO
^
OO
- ( z - io) f c A f c +^( i o ) = ^ £
£ fc=0
'
1
- ( 2 - io)fc^5(i0)
fc=0 j
= A S(z),
\z-to\Ktoieb)-1.
Since io > 0 is arbitrary, this proves the result.
•
Let (S(z))zeC , 0 < a < n/2, be an analytic semigroup on X. For any 6 G {—a, a) the operators Se(t) = S(tel9), t > 0, constitute a Co-semigroup. Let Ag denote the infinitesimal generator of Sg(-). 3.15. Lemma. For any 0 G (—a, a) we have dom Ag = dom^o and Agx = el6Aox for x G dom^lo- Moreover, for any e G (0,1) we have (3.35)
lim_
- (S(z)x - x) = A0x,
x£domA0.
z-t-0, z g C 6 Q Z
Proof. For z G Cea we set t = \z\. Obviously z ->• 0, z G Cea, implies t 4- 0. Then we get for x G dom J4 0 - (S(z)x -x)~
A0x = ^—^ (—!— (S(z)x - S(t)x) -
A0x)
+ t(l(S(t)x-x)-A0x)=:Z—±I1
+
il2.
Obviously we have lim^ 0 I2 = 0. For I\ we get (see also Corollary 3.14 for k = 1 and A = A0) \h\
\z-t\
[(S(C)~l)A0xd{
<
sup _ ICI
\(S(Q-l)Aox\,
where i, z denotes the line segment from t to z. In view of property (iii) in Definition 3.10 this proves lim 2 ^ 0 ze^ ij = 0. This finishes the proof of (3.35).
3.2. Analytic semigroups
105
Using (3.35) we get , for x € dom An, 1 eie - (Se(t)x - x) = —r (S{tel9)x - x) -> e'eA0x ast|0, t re 1 i.e., we have x G domA0 and A^a; = el9A0x. On the other hand we have, for x G dom Ag (3.36)
Aoz = lim i-S9(t)x *4.o at = eielim
= ei0 lim 5'(te i e )x tio
A0S{tei6)x,
where we have used Theorem 2.9 for Se(-) and Corollary 3.14 for S(-). Frcrtn (3.36) we see that limt_|_o AoS(tel6)x = e~x9Aox. Closedness of AQ implies x G dom AQ and AQX = e~l6Aex. D" In view of Lemma 3.15 we call AQ the infinitesimal generator of the analytic semigroup (S(*)) z e C a .
Figure 3.6
Figure 3.5
The Hille-Yosida theorem characterizes those operators which are infinitesimal generators of Co-semigroups. In the following we characterize infinitesimal generators of analytic semigroups. 3.16. Proposition. Let (S(z)) c , 0 < a < n/2, be an analytic semigroup with infinitesimal generator A. Then for any e G (0, a) there exist constants Ke G R and Me > 1 such that S a _ e , K e \ K } C p{A)
106
Chapter 3. Analytic
Semigroups
(see Figure 3.5) and \\(\I - A)-1]] < - ^ - , |A -
AeEa_e,Ks,A^,
Ke\
In particular, A is a sectorial operator. Proof. We choose e <E (0,a). Since Sa-€(-) and 5_ Q+£ (-) are Co-semigroups, there exist constants M£ > 1 and a ) e e M with \\Sa-e(t)\\
< Mte^1
||S_ Q + £ (t)|| < M£ew'*,
and
t > 0.
For A G C with | arg(A - w£)| < (n - e)/2 we have |A — u;£| sine/2 < ReA — u>e. This and the Hille-Yosida theorem imply ||(A7 - A , - , ) " 1 ! ! <
|A
_J^£sine/2,
I arg(A - w £ )| < (TT - e)/2, A ^ c*.
Using A a _ e = e ^ " - 6 ) ^ (see Lemma 3.15) we obtain for \i = Ae _ i ( a _ e ) the estimate (3.37)
W^I-Ar'WK*?\ , //— w£e ^ a ^ | sin e/2
jxe/C, / x ^ e - ^ ) ,
where /C={
M
eC|-a-| + |<arg(/,-a;
£
e^-))<|-a +|}.
We define K£ = w£ cos(a — e) (l + tan(a - e) tan(a - e/2)) = u)e cos e/2 / cos(a - e/2) (compare Figure 3.7). Then the cone C_ defined by C_ = {n e C | - Q - | + y < arg(/i - «£) < 0} is a subset of the cone K. Since ute~%^a~^ exists a constant C£ such that
-,—^~Ke}
is bounded away from C_, there
,,
HGC.
This and (3.37) imply
Analogously, starting with the estimate for the resolvent of J 4 _ Q + £ we obtain the same estimate for \x with 0 < a r g ( / i - « e ) < a + 7r/2-3e/2. Altogether we have £a-3£/2,K£ \ { K J
C
Z9^)
3.2. Analytic
semigroups
107
Figure 3.7
and
Kfil-AY
Me
<
/i G £ Q _ 3 e / 2 , K e , M 7^ Ke>
with an appropriately defined constant Me > 1.
•
In order to state a result converse to Proposition 3.16 we need some notation. For any S > 0 and 7 G (0, TT/2) we define the contour Ts^ by
(3-38)
r,,7 = r+ 7 ur,; 7 ur° 7 ,
where (see Figure 3.8) (3.39)
6,-y
r°
{A G C I IA| > S, arg A = ±(TT/2 + 7)}, {AGC||A|=<S,
<S,7
|argA|<7r/2 + 7 } .
The orientation of this contour is such that Im A is increasing along Tf Furthermore we set r,5 i7 + {K} = {A + K | A G r,j ) 7 }. The following lemma will be useful: 3.17. Lemma. Let 0<9<e
and
TT/2 and z, A G C with — + a — 9 < arg A < —
a +9
108
Chapter 3. Analytic
Semigroups
be given. Then we have ReXz < -\X\ \z\ sin(e - 9) < 0. Proof. By assumption on A and z we get — + e-9
< arg \z = arg A + arg z < —— (e - 9).
This implies cos(arg Xz) < cos(7r/2 + e - 9) = - sin(e - 9).
a
Figure 3.8
Figure 3.9
3.18. Proposition. Let A be a sectorial operator on X, i.e., domA = X and there exist constants K 6 M., a G (0,7r/2] and for any e G (0, a) a constant Mt > 1 such that (see Figure 3.6) £a, K C p(A) and (3.40)
KAJ-A)-1!! <
M( \\-K
,
A G Lja—(K,
A f K.
T/ien A is the infinitesimal generator of a Co-semigroup which can be extended to an analytic semigroup (S{z))z . Moreover, for any z G Ca, z ^ 0, and k — 0 , 1 , 2 , . . . the derivative S^(z) (3.41)
SW(z) = AkS(z)
is given by
= -^ / 2i"
XkeXz{XI - A)~ldX,
./IY^-KK}
3.2. Analytic semigroups
109
where 5 > 0 and0 < 0 <
a—\argz\•
Proof. It suffices to consider the case K = 0. Otherwise we replace A by AK = A — KI which satisfies the assumptions with K = 0. If AK generates a Co-semigroup SK(-) which can be extended analytically into the sector Ca, then A itself generates S(t) — e Kt 5 K (t) which obviously can also be extended analytically into Ca. For z e C a , z ^ 0, we set e = a — | argz| and define (3.42)
S{z) = —
eXz{XI - A)~xdX,
f
where (5 > 0 and 0 € (0, e). Then, for A G r £ Q _ e , Lemma 3.17 and (3.40) (with K — 0) imply ||e A *(A7- A)" 1 1| < e ^ ^ ^ f
< e-W W ' ^ - ' ) ^ ,
I'M
A G T±a_e.
1^1
This estimate and continuity of A —> eXz(XI — A)"1 on T*Q_^ prove that the integral along Ffa_e exists. Existence of the integral along T" a_e is trivial. An application of Cauchy's theorem implies that Ts,a-9 in (3.42) can be replaced by any Fs',a-ff' with 5' > 0 and 0' G (0, e). This shows also that S(z) is defined on Ca \ {0} by (3.42). For z = 0 we set 5(0) = 7. We first prove that S(z), z € Ca, is a semigroup on X. For 2 , i « 6 C a \ {0} we set e = min(a - | a r g z | , a - | argK;|) and choose 0 < 6\ < 02 < e and 0 < Si < S2- Then we have with Tj = Tsua-9i, i = 1,2, (see Figure 3.9) S(z)S(«>) = T ^ T T /
/
e ^ e ^ A J - A)-\nI
= [2-Kiy 7T^ J I J I Tl
= 7^—xo/
r2
e^iXI-A)'1
2
(27rt) 7 ri
-
A^dfidX
e'^-l—UXI-Ar'-^I-AT^dndX fj, - X /
-dftdX
7r2M-A
" 7(2m) 5 ^ 22 7/ e * " 0 ^ / - ^ ) - 1 y/ r2
ri
/x - -^rdXd», A
where we have used the resolvent identity, Fubini's theorem and the fact that /i ^ A for A G Ti, /x G rY Simple computations show that 1 f e^w (3.43) — / r dji = eAtu for A G Tj 27n J r 2 /i - A and (3.44)
- ^ f -^dX 2™ y F l n - X
=0
forMGr2.
110
Chapter 3. Analytic
Semigroups
Therefore we get (observe | arg(z + w) \ < a — e) S{z)S(w) = ^-.
2-KI
f ex(-z+w\XI-A)-1d\ JTi
= S(z + w),
which establishes the semigroup property for S(z), z G Ca. Standard results on functions of complex variables show that, for arbitrary x £ X and x* G X*, eXz((XI - A)~lx, x*) d\
z -> (S{z)x, x*) = -^-. [
is analytic on Ca-c for any e G (0, a), where S > 0 and 6 G (0, e) are fixed. This proves that property (ii) of Definition 3.10 is satisfied on Ca. Before we prove property (iii) of Definition 3.10 we show that for any e G (0,a) there exists a constant Ke > 1 such that ||5'(2)|| < Ke for z G C a _ £ . We fix 5 > 0 and 6 G (0, e). Then we have, for z G C Q _ € , z^Q, S(z) = —
f
eXz{\I-A)-1d\
= ^~
Let z = \z\eiTl. For /i G Tja_g we have // = aei^/2+a-e\ estimates (using (3.40) and Lemma 3.17) give m
K z
Jvin_a
J
\\
\z\
2w
eXz{\I-A)-xd\
(
6 < a < oo. Simple
Js
o
The same estimate holds for the integral along Fs a_9. Along r%a_0 we obtain (H = SeiT, \T\ < TT/2 + a - 9) the bound eScoB<~T+^M9dT =: K0.
— / Altogether we have shown that (3.45)
\\S(z)\\<2K1
+ K0,
z £CQ_,
For x G dom A and z G Ca_<:, z ^ 0, we obtain (with 5 > 0 and # G (0, e))
S(z)x-x
= -^-. f 1
/"
e^dxi-A^-^-AxdX pAz
= — / 2Wr,„_„ A
-rr-iXI-A^AxdX.
3.2. Analytic semigroups Here we have used
1
(3.46)
eXz
I
d\ = l.
For each A e r^ ) a _e we have 0 Az
i
— (A/ - A)'1 Ax -> y (AJ - A ) _ 1 A r
a s z - > 0 , z £ CQ_£
and the estimates M9l |A|
— (XI-A)-1
Ax
— {XI-A)'1
Ax <
Aer±Q,
Ax\, AerL_ e .
A
Therefore by the dominated convergence theorem we have
lim
(3.47)
Here
(S(z)x-x)=—
v ec„_. z->o, zec Q
I^Q-S^,
f
2mJT
X
^(XI-A^AxdX
= lim - i r / |(A/-^)_Ma:dA *->«> 2TT* ./r,,„_ SiR A R> 6, denotes the contour depicted in Figure 3.10.
r,5,a-0,H
Figuree 3.10
112
Chapter 3. Analytic
Semigroups
For arbitrary x G X we choose a sequence (xn) C dom A with xn —> x as n —>• oo. Then, for z £ C a - e , \S(z)x -x\<
\\S(z)\\ \x - xn\ + \S(z)xn - xn\ + \x-
xn\.
Using (3.45) and (3.47) we obtain lim_ \S{z)x - x\ = 0, z^-o, zeca-e
xeX.
We want to prove next that the infinitesimal generator of (S(z))zeca indeed is A. Let B denote the infinitesimal generator of S(-) and assume that we have established the following result: For any x £ domA we have (3.48)
^S(t)x = S(t)Ax, t > 0. at Of course this would be trivial, if we already knew that A is the infinitesimal generator of S(-). Equation (3.48) implies that 1 1 fh lim —v (S(h)x — x) = lim — / S(s)Axds Ho h ' ' hio h J0
= Ax,
i.e., x G dom B and Bx = Ax. Thus B is an extension of A. Obviously we have p(A)Hp(B) ^ 0, which shows that for any x G domB there exists a y G domA such that (A0J - B)x — (X0I - A)y = (X0I - B)y. By injectivity of A 0 / - B we get x — y £ domvl, i.e., A = B. In order to prove (3.48) we shall first verify the formula (3.41) for the derivatives of S(z). For z G Ca, z ^ 0, choose S > 0 and 0 < 6 < a — | argz|. Then Lemma 3.17 with e = a — \ arg z\ and the estimate (3.40) imply (for some constant M > 1) ||A*e A *(AJ-A) - 1 !! < M | A | f c - 1 e - | A | | z | s i n ( Q - | a r g z l - ^ for A G Tfa_e. This estimate proves that the integrals J r \keXz(XI — A)~ld\ exist for all k = 0 , 1 , 2 , . . . . Formula (3.41) is trivially true for k = 0 by definition of S(z) in (3.42). Assume now that (3.41) is already established for k. Then we have
hs^(z h
+ h)-S^(z))=^-:
\{eXh~l)\keXz{\I-A)-ld\.
[ l-Kl JYs
For any A G Ts,a-6 the integrand converges to Xk+1eXz(XI — A)~l as h —• 0. Moreover, we have the estimate (cf. Lemma 3.17 and (3.40)) i(eA,l-l)AfceA2(A/-J4)-1 h
< |A| e l A H' l l|A| f c e- | A | | z | s i n ( a - | a r s 2 l- 9 ) — |A| Isz\-0)) M|A|fckJ\\(\h\-\z\sm(a-\i e
3.2. Analytic semigroups
113
Therefore we get by the dominated convergence theorem S<*+1>(z) = — f Xk+1eXz(XI 2 ™ Jr,,a-,
- A)"1^.
For z = t > 0 and a; G dom A we obtain (3.49)
S'(t)x = ^ - f
Xe^iXI-A^xdX.
Observing A (A/ - A ) - 1 x — x-\-{XI-A)~lAx 0 we obtain from (3.49) and (3.42) that -rS{t)x
= S'(t)x = S(t)Ax,
for x G dom A and/ r5Q _e At 2;eL\ =
x £ dom A, t > 0,
i.e., (3.48) holds. Now we know that A is the infinitesimal generator of S(-), so that S^(z) = AS(k~l\z) = AkS(z), zeCa,z^0 (see Corollary 3.14). Thus the proposition is completely proved in case K = 0. For general K everything follows by standard arguments (considering A — KI instead of A) with the exception of formula (3.41). Assume now K ^ 0 and let SK(-) denote the semigroup generated by AK = A - KI. We have SK(z) = e~KZS(z), z G Ca. For the derivatives of SK(-) we have the representations SW
J-/"
XkeXz(XI-AK)~1dX
= ^— /
(/* - *)k^z{»i
=
- A)~ld^
fc
= o, l , 2 , . . . .
For k = 0 we get S(z) = eKZSK(z) = - L /
e"*(MJ - A ) - 1 ^ .
Assume now that (3.41) is already established for j = 0 , . . . , k — 1. Then we get z ( k) S K (z)
= ~
f
= ^~.i 'Ts ,-g 2j,
^e^ifil
- A)'1 dpi
M l k A *(/rf Ar d» + £ ( ) (-Kys^\z) + {K} j
ir, aiC_. + {4
= 1
t^\3J
114
Chapter 3. Analytic
Semigroups
or, equivalently, (3.50)
^- f
^/"(fil-A)-^
= e^W(z)-tP)(-^SM(4 j=iVJ'
On the other hand we get from SK(z) = e~KZS{z) the equation eKZSJtHz) = S ( % ) + J2 Using this and (3.50) we obtain (3.41) for k.
(k){-K)SS{k-j)(z). •
Combining Propositions 3.16 and 3.18 we obtain the main theorem for analytic semigroups: 3.19. Theorem. A linear operator A on X is the infinitesimal generator of an analytic semigroup on X if and only if it is sectorial.
CHAPTER 4
A p p r o x i m a t i o n of Co-Semigroups The goal of this chapter is to provide a rather complete discussion of approximation results for linear Co-semigroups. The only omission is that no results on time discretizations are given. See however the presentation of Chernoff's theorem in Section 10.2 for general evolution problems. The fundamental approximation result for linear Co-semigroups is the Trotter-Kato theorem (see [Tr]) which is presented in Section 4.1 in several versions. Our approach is the one given in [I-K-S] which is based on the one by T. Kato (see [Kal]) resp. the one given in [Ki] for the version which assures also existence of the limiting semigroup. Motivated by the fact that Co-semigroups frequently appear as solution semigroups for abstract Cauchy problems stated in variational form we present in Section 4.3 also variational formulations of the TrotterKato theorem (see [I-K2] and [I-K-S]). Approximation of nonhomogeneous problems is based on a product space formulation (see for instance [Bb3] resp. [Daf-Sl]) which reduces the problem to a homogeneous problem (Section 4.2). In Section 4.4 we show that we can get sharp rate estimates in case of almost selfadjoint parabolic problems using Nitsche's trick.
4.1.
The Trotter-Kato theorem
In this section we consider approximation of Co-semigroups and present the basic versions of the Trotter-Kato approximation theorem. Let Z, Xn, n = 1,2,..., be Banach spaces with norm | • | resp. | • \n and X be a closed linear subspace of Z. We assume that for every n = 1,2,... there exist bounded linear operators Pn : Z —> Xn and En : Xn —> Z satisfying the following conditions: (al)
There exist positive constants Mi, M 2 such that \\Pn\\ < Mx
and
\\En\\ < M2 115
for all n e N.
Chapter 4. Approximation
116
(a2)
of
Co-Semigroups
For all x £ X we have lim \EnPnx - x\ = 0. Tl—fOO
(a3)
PnEn = In (= identity operator on Xn), n = 1,2,... .
As we shall see, (a2) is a consequence of the assumptions made in the Trotter-Kato theorem. However, since in practice one usually starts with the definition of the spaces Xn and the operators P„, En, one has to guarantee that assumptions (al) - (a3) are satisfied. We can equivalently use a setup where we consider subspaces of Z instead of the spaces Xn. Set Zn = rangeE n
and 7r„ = EnPn,
n = 1,2,... .
The subspaces Zn C Z are endowed with the norm induced from Z. It is easy to see that the Zn are closed subspaces of Z and that the 7r„ are projections Z —» Zn (i.e., we have -K\ = 7r„ and rangeir n = Zn). Assumption (al) implies (al)
K||<M,
n = l,2,...,
for some positive constant M, whereas assumption (a2) implies (52)
limn^oo irnz = z
for all z £ X.
If (52) is true for all z £ Z, then (51) follows by the uniform boundedness principle. In general the Zn will not be subspaces of X. There are situations where it is of advantage to consider the approximations in subspaces of a larger space Z than the state space X for the problem to be approximated. For an example see [I-K2], where an approximation scheme for Stokes' equation is investigated. Conversely let Zn, n = 1,2,..., be a sequence of subspaces of Z with projections nn : Z ~> Zn and assume that (al) and (52) are satisfied. We set Xn = Zn, Pn = -Kn and define En to be the canonical injection Zn -> Z, Then (al) - (a3) are satisfied. The most frequent situation, where the setting on which assumptions (al) - (a3) are based occurs, is given when we start with a sequence of finite dimensional subspaces Zn C Z, dimZ„ = kn, and corresponding projections 7r„ : Z -> Zn such that (al) and (52) hold. For each subspace we choose a basis 2™,..., z% and define the linear isomorphisms pn : Zn —> Xn = Rkn (or Cfcn) by pnz — (ai,..., afcn)T for z — X]j=i o-iZ^ £ Zn. The canonical injection Zn ->• Z is denoted by i„ and the norm | • |„ on Xn is given by \x\n — [p^x].
4.1. The Trotter-Kato
theorem
117
If we define the mappings Pn : Z -* Xn and En : X„ -*• Z by -PnZ = PnTTn-2,
Z £ Z,
then assumptions (al) - (a3) are satisfied. The concept of convergence used in connection with Co-semigroups is that of uniform convergence on bounded i-mtervals. This has some important consequences as can be seen from the following lemma: 4 . 1 . L e m m a . Assume that conditions (al) - (a3) hold and let Sn(-), 1,2,..., be Co-semigroups on Xn with infinitesimal generators An. If S0{t)x := lim
n =
EnSn{t)Pnx
exists in X for all x € X and t > 0 and is uniform for t in bounded intervals, then the operators So(t) constitute a Co-semigroup on X. Moreover, there exist constants M > 1 and u £ R such that Sn(-)<EG(M,w), Let
AQ
n = l,2,...,
and S0{-) £
G{M,u).
denote the infinitesimal generator of SQ{-)- Then we have lim \En(XIn - A^PnX
- (XI - Ao^xl
=0
for all x & X and A with Re A > iv. Proof. It is clear that t -» So(t)x is a continuous function [0, oo) —> X for all x £ X. From (a2) we get 5o(0)a; = lim EnSn(0)Pnx
= lim EnPnx
n—voo
= x,
x £ X.
n—>oo
We define the operators Sn : X ->• C(0,1; X) by (Snx) (t) = EnSn(t)Pnx,
xeX,
0 < t < 1.
Uniform convergence of Sn(t)x on bounded intervals implies that for any x £ X there exists a constant M(x) such that \S„x\C(0,l;X)<M(x),
71 = 1,2, . . . .
By the uniform boundedness principle there exists a constant M > 1 such that sup max. \EnSn{t)Pnx\
= \\Sn\\ < M,
n = l,2,... .
|Z|<1°<*<1
This implies \\EnSn(t)Pn\\ < M for all t £ [0,1] and n = 1,2,... . Consequently, we have for any xn £ Xn < M1MM2\x„\n, where we have also used (al) and (a3). This proves \\Sn(t))\<M,
0
0 < t < 1,
118
Chapter 4. Approximation of Co-Semigroups
with M = MiMM2- Any t > 0 can be written as t = k + s with s G [0,1) and k G No- Therefore we have \\Sn{t)\\
\\Sn{l)\\k\\Sn{s)\\
= \\Sn{k + S)\\ =
<MMl
= MetlogM,
i > 0 , n = l,2,... .
In order to prove that SQ(-) has the semigroup property we observe that, for all x € X and t, s > 0, lim EnSn(t)PnEnSn(s)Pnx
= lim EnSn(t
n—• oo
+ s)Pnx = S0(t + s)x
n—^oo
and use the estimate \So(t)So(s)x —
EnSn(t)Pn
< \S0(t)S0(s)x
-
EnSn(t)PnS0(s)x\
+ \EnSn{t)PnS0(s)x < \S0(t)S0(s)x
-
EnSn(t)PnEnSn(s)Pnx\ + Me w t |5 0 (s)x -
- EnSn(t)PnS0(s)x\
EnSn(s)Pnx\.
For all A with Re A > LJ, we have (see Proposition 2.20) I(XI - Ao)'^
- En(\In
- An)-lPnx\
< /
e-KeXt\S0(t)x
- EnSn{t)Pnx\
dt.
Jo
Using Re A > w and Lebesgue's dominated convergence theorem we conclude that lim„_>oo |(A7 — A0)~1x — En(\In — An)~1Pnx\ = 0 for all x G X and all A with Re A > u. D The last part of Lemma 4.1 suggests that convergence of Co-semigroups is connected with convergence of the resolvents of the corresponding infinitesimal generators. This is essentially the content of the Trotter-Kato approximation theorem. We first state a version which stresses this point and is very convenient for applications. 4.2. Theorem (Trotter—Kato). Suppose that assumptions (al) and (a3) are satisfied. Let S(-) and Sn(-), n = 1,2,..., be Co-semigroups on X resp. Xn of class G(M,u) with infinitesimal generators A resp. An. Then the following two statements are equivalent: (i) There exists a A0 G p(A) n H^Li p ( A 0 such that, for all x G X, \En(X0In - An)~lPnx
- ( A 0 7 - ^4)—1ar| ->• 0
as
n^-oo.
(ii) For every x G X and t > 0 we have lim \EnSn{t)Pnx
- S(t)x\ = 0
where the convergence is uniform for t in bounded intervals. If (i) or (ii) is true, then (i) holds for all A with Re A > u.
4.1. The Trotter-Kato
theorem
119
Proof, a) We first prove that (i) implies (ii). Without restriction of generality we can assume that Ao = 0 (otherwise we take A — A-Xol and An = An - XQI„ which generate the semigroups S(t) = e~XotS(t) and Sn(t) = e~XotSn(t)). For x € X we define the error en(t)x = Sn{t)Pnx
- PnS(t)x,
n = 1,2,..., t > 0.
We fix T > 0. The operators e„(i) are uniformly bounded for t G [0,T] and n = 1,2,... . For x e dom A the functions « n (-) defined by un(t) =A-len{t)x,
n= 1,2,..., t > 0,
1
are in C (0, oo;X„) and satisfy (t) + (4.1) v
PnAnAS(t)x,
, ,
;
« B (o) = o,
where A n — A - 1 - E n A ~ 1 P n . Indeed, J 4~ 1 S„(i)P n a; = S n ^ A ^ P n a ; is continuously differentiable on [0, oo), because A~ : P„x is in dom An, whereas PnS(t)x is differentiable, because x G dom A and A~ 1 P„ is bounded. Equation (4.1) follows by simple computations. By the variation of parameters formula we get from (4.1) the representation un(t) = / Sn{t-T)PnAnAS(r)xdT, t > 0, xedomA. Jo If we assume x G dom A2 then r —> A 5 ( T ) X is differentiable and integration by parts gives (using also Sn(t — r ) = A~ 1 A„5„(t - r ) = —A~1(d/dt)Sn(t - r)) un{t) = -A-lPnAnS(t)Ax
+
A^Sn^PnAnAx
+ A*1 I Sn(t - T)PnAnS(T)A2xdr, Jo
t > 0, xe dom A 2 .
This implies en(t)x = -PnAnS{t)Ax (4.2)
+
Sn{t)PnAnAx
Sn{t-T)PnAnS(T)A2xdT
+ / Jo
:= Dln + D2n + D3n, For any T > 0 the set {S(t)Ax strongly as n —> oo implies
t>0,
x£ dom A 2 .
| 0 < t < T} is compact. Therefore A„ -> 0
lim £>i„ = 0 uniformly on [0, T]. n—>oo
Since the operators Sn(t)Pn 1,2,..., we have also
are uniformly bounded for t G [0, T] and n =
lim Z?2« = 0 uniformly on [0,T\.
Chapter 4. Approximation
120
of
Co-Semigroups
For D3n we observe that {S{t)A2x | 0 < t < T} is compact and Sn(t — r)Pn are uniformly bounded for 0 < r < t < T and n = 1, 2 , . . . . Therefore An —> 0 strongly as n —> oo implies also in this case lim £>3„ = 0 uniformly on [0, T]. n—>oo
This finishes the proof that lim„_ >00 e„(i)a; = 0 uniformly on [0,T] for all x G dom A 2 . Since the operators en(t) are uniformly bounded for t G [0,T] and n = 1,2,..., we get by a standard density argument lim en(t)x = 0 uniformly on [0,T] n—voo
for all a; G X. It remains to prove lim \(EnPn - I)S(t)x\
= 0 uniformly on [0, T].
Since the operators Sn-P™ — I are uniformly bounded for n = 1,2,..., it is enough to prove that lim„_>.00(.E„P„ - I)x = 0 for all x G d o m A For an x G domA we have (observe that (EnPn — I)Enyn = 0 for yn G Xn) (EnPn - I)x = (EnPn - I)AnAx
->• 0 as n ->• CXD.
b) Assume now that (ii) holds. Then Lemma 4.1 immediately implies that (i) is true for all A with Re A > u>. • The approximation scheme given by the spaces Xn and the generators An is called stable if there exist constants M > 1 and to G K such that Sn(-) G G(M, w) for all n = 1,2,... . The approximation scheme is called consistent if condition (i) of Theorem 4.2 is satisfied and convergent if condition (ii) of that theorem holds. The Trotter-Kato theorem as stated above tells us that for a stable approximation scheme consistency of the scheme is equivalent with convergence of the scheme. However, Lemma 4.1 tells us that the Trotter-Kato theorem can be stated in a stronger form: For an approximation scheme convergence is equivalent to stability and consistency. In applications of Theorem 4.2 one encounters two major difficulties: a) In general it is very difficult to establish stability of the approximation scheme in cases, where M > 1 is required. The Hille-Yosida theorem (Theorem 2.22) tells us that ||5„(<)|| < Meut, t > 0, n = 1,2,..., if and only if A G p{An), n — 1,2,..., for Re A > w and _. M \\{An-\In) fe|| < —— - , R e A > o ; , n = l , 2 , . . . and fc = 1,2,... . (Re A — w)K To establish these estimates is in general very difficult if not impossible. A convenient way to verify stability of an approximation scheme is to use the
4.1. The Trotter-Kato
theorem
121
Lumer-Phillips theorem (Theorem 2.25) and to establish dissipativity estimates possibly after renorming the spaces Xn with uniformly equivalent norms. b) In order to prove consistency of an approximation scheme one in general tries to avoid computation of the operators (\In — An)~x in order to verify condition (i) of Theorem 4.2 directly. However it is rather easy to compute explicit representations of the approximating operators Ara. Therefore one would like to replace condition (i) by a condition involving convergence of the operators An to A in some sense. 4.3. Proposition. Let assumptions (al) and (a3) be satisfied and assume that the semigroups Sn(-) generated by the operators An are of class G(M,OJ) for some fixed constants M > 1, w 6 1 . Then condition (i) of Theorem 4.2 holds if and only if (a2) and the following two conditions are satisfied: (cl)
There exists a subset D c domA such that D — X and (X0I - A)D = X for a A0 > w.
(c2)
For all x € D there exists a sequence ~xn € dom A n , n = 1,2,..., such that lim EnXn = x
and
lim J5„A„:z?„ = Ax.
Proof. Without restriction of generality we can assume that Ao = 0. a) We first prove that condition (i) in Theorem 4.2 implies (a2), (cl) and (c2). We choose D = domA, which implies AD = X, i.e., (cl) is satisfied. In the proof of Theorem 4.2 we have already shown that (i) implies (a2). We next fix a; £ domA, choose y € X with x = A~ly and set ~xn = A^PnAx. Then we have En'Xn — x = EnA~ Pny — A~1y —• 0 as n —> oo by (i). Furthermore, we have using (a2) EnAnTn-
Ax = EnAnA^Pny
- AA~xy = EnPny ~y -» 0 as n -> oo,
which shows that (c2) is also true. b) In order to show that (a2), (cl) and (c2) imply condition (i) of Theorem 4.2 we use the identity (4.3)
EnA~lPn
- A'1 = En{A-xPnA
- Pn)A~l
+ (EnPn -
For x 6 AD we choose a y € D with x — Ay and set yn = A^-Pnx Let ~xn be a sequence for y according to (c2). Then we have \x„ - Pny\n = \Pn(Enxn
- y)\n < Mi\Enxn
I)A~\ =
A^xPnAy.
- y\ -» 0 as n -» oo
122
Chapter 4. Approximation
of
Co-Semigroups
and \%n
Vnln 5: \\An II \-™n%n ~
rnAy\n
1
<
\\A- \\\\Pn\\\EnAnxn-Ay\
which tends also to 0 as n -»• oo. Note that (||A~ 1 ||)„ = i :2 ,... is uniformly bounded. The last two estimates prove that \Pny-yn\n
<\PnV-xn\n
+ \xn-yn\n-+0
as n ->• oo.
This estimate together with (4.3) and (a2) implies \EnA-xPnx
- A - ^ l < \En(yn - P n B ) | + |B n F n ? / - y\ <M2\
+ \EnPny — y\ ->• 0 as n -> oo
for all x G AD. A simple density argument finishes the proof (note that ||S n i4~ 1 P„|| is uniformly bounded with respect t o n ) . • Lemma 4.1 suggests the conjecture that in the Trotter-Kato theorem one only needs to have strong convergence of the resolvent operators (XIn — An)^1 to a bounded linear operator in order to conclude the existence of a limiting semigroup. That this is really the case is the objective of the considerations below. The approach we follow goes back to J. Kisyhski (see [Ki]) and can be extended to nonlinear semigroups (see [Le-Rei]). A basic element in this approach is the following characterization of strong convergence of bounded linear operators as boundedness of a linear operator in an appropriately defined product space. We assume that (al) - (a3) are satisfied. Let X°° be the linear space of all sequences x = (xn)ne^ with xn G Xn, n = 1,2,..., such that XQ := linin-yoo Enxn exists with XQ G X.1 With the norm | x | x ~ =sup|a; n |„. X°° is a Banach space (note that X is a closed subspace of Z). For linear operators Cn : domC re —> Xn on Xn, n — l,2,...,we linear operator C : dom C —>• X°° on X°° by
define the
dom C = {x G X°° | xn G domC n ,ji = 1,2,... ,and (4.4) v
'
lim EnCnxn n->oo
exists in X\, '
r x e
Cu — (Cnxn)neH f° dom C. 4.4. Lemma. The following two statements are equivalent: (i) The operators Cn are bounded on Xn, n = 1,2,..., and limn-voo EnCnPnx exists in X for all x G X. 1 For elements x, y, ... in X°° we shall denote the corresponding sequences by (xn)n6Ni (?/n)neN> • • • a n d t n e limits limji-Kx, E„xn, limn^oo Enyn, . . . by x0,yo, ••• •
4.1. The Trotter-Kato theorem
123
(ii) The operator C defined by (4.4) is bounded on X°°. If (i) or, equivalently, (ii) is true, then CQX = \im.n^00EnCnPnx, defines a bounded linear operator on X.
x £ X,
Proof, a) Assume first that (i) is true and define Co as above in the lemma. Obviously Co is bounded on X. By the uniform boundedness principle we see that ||E n C n P n || < a, n = 1,2,... for some constant a > 0. For any x £ X°° we get the estimate \EnCnXn
— Co^ol < \EnCnPnEnXn
< a\Enxn
— EnCnPnXo\
- %o\ + \EnCnPnxo
+ \EnCnPnXo
- C0x0\ -» 0
— CQXQ\
as
n->• oo,
which proves x £ dom C, i.e., we have dom C — X°°. The estimate |C„a;„| = \PnEnC„PnEnxn\n < MiM2a\xn\n < M 1 M 2 a|cc|x~ for x £ X°° shows that C is bounded (with ||C|| < MiM2a). b) Let (ii) be true. For fixed t i e N and arbitrary xn G Xn we set Xk = 0 for A; G N \ n . Then we have x = {xk)ken G X°° = dom C. By definition of dom C we get xn G d o m d . Furthermore we have |C n a; n | n = \Cx\x°° < \\C\\ \xn\n, i.e., Cn is bounded on Xn, n = 1, 2 , . . . . For arbitrary x £ X we set a;„ = P„a;, n = 1,2,..., which by (a2) implies (x„)neN G X°° = dom C. By definition of dom C, lim„_>oo EnCnPnx exists in X. • 4.5. Proposition. Assume that (al) - (a3) hold. Let An be infinitesimal generators of Co-semigroups Sn{-) on Xn, n = 1,2,... . Then the following two statements are equivalent: (i) So(t)x := lim„_+00 EnSn(t)Pnx exists in X for all x £ X and t>0, the convergence being uniform on bounded t-intervals. (ii) The operator A defined by (4.4) corresponding to the operators An, n — 1,2,..., is the infinitesimal generator of a Co-semigroup on X°°. If (i) or equivalently (ii) holds, then So(-) is a Co-semigroup on X and its infinitesimal generator Ao is given by dom Ac = { i € X | there exists an x £ dom A with xo = x}, AQX = lim EnAnxn
for x G dom Ao, where x is any element
n—»oo
in dom A with XQ = x. Proof, a) Suppose first that (i) is true. By Lemma 4.1, 5o(-) is a Co-semigroup on X and we have Sn(-) £ G(M,UJ), n = 0 , 1 , . . . , for some constants M > 1, w e l . Let A denote the infinitesimal generator of SQ(-). Moreover, we have (4.5)
lim En(XIn - A^PnX
= (XI-
A)'lx,
x G X, Re A > UJ.
The operators S(t), t > 0, defined by (4.6)
S(t)x = (Sn(t)xn)neN,
t > 0, x £ X°°,
Chapter 4. Approximation of Co-Semigroups
124
are bounded on X°° according to Lemma 4.4. The semigroup property follows easily from (4.6). It remains to prove strong continuity of S(-) at zero. We set M = MXM2M (i.e., \\EnSn{t)Pn\\ < M e " ' , t > 0) and fix x € X°°. Next we choose N G N such that \Enxn - xQ\ < -^—(1 + Me")'1
and
oN±\
\EnSn{t)Pnx0
- S0{t)x0\ < -^— oNl\
for n > TV and 0 < t < 1. Then we choose S G (0,1] with \S0(t)x0 - x0\ < TTT
and
\S„(t)xn - xn\n < e
for 0 < t < 6 and n = 1 , . . . , N - 1. For n> N and 0 < t < S we get \Dn[t)Xn
%n\n S \*n£Jnd
-* n-^n^n\,*J-* n ^ 0 | n
+ \PnEnSn(t)PnX0 + \PnS0(t)x0
-
PnSo(t)x0\n
< Mj(l + Me w *)|£ n a: n - x 0 | + | + | < e. Thus we have shown that \S(t)x — x\ < e for 0 < t < S. Let B denote the infinitesimal generator of the semigroup S(-). We choose x G d o m B and set y = Bx. From y — lim/40 h~1(S(h)x — x) we conclude lim^o h~1(Sn(t)xn — xn) = yn for n = 1,2,... . This implies xn G domj4„ and Anxn = yn, n = 1,2,... . From y G X°° we get y0 = l i m ^ ^ Enyn = lim„^oo EnAnxn G X. This shows x G domj4 and y = Ax, i.e., A is an extension of B. Let x G dom A be given and choose A with Re A > u>. We set y — Ax = {Anxn)neN- For z„ = (A7n - An)xn, n — 1,2,..., we get l i m ^ o o E n z n = lim„_>00(AJ5„a;„ - EnAnxn) = \x0 - yo G X. This shows that z = (zn)n€^ G X°°. From Proposition 2.20 we get / e~xtS{t)z dt = (XI-B^ze dom B. Jo Using strong continuity of S(•) at 0 it is easy to see that (4.7)
(4.8)
/
e~xtS(t)zdt=
Jo
lim wN, JV->oo
where
wN = («,W) BeN = 1 £ AT
e -^
fe 1
- )/ JV 5((fc - 1)/AT),.
fe=i
We have AT
1 £ e-^-^NSn((k N
k=i
- l)/N)zn,
n = 1,2,...,
4.1. The Trotter-Kato
125
theorem
and /«oo
lim wnN) = / JV-s-oo
e-xtSn{t)zndt
= (XIn - A„)~ 1 z„ = xn,
n = 1,2,... .
70
This together with (4.7) and (4.8) implies x = (A/-J5)_1z GdomB and Bx = Xx — z == (Aa;„ — 2:n)raeN = {Anxn)ne^ = Ax by definition of zn. Thus we have shown that A — B, i.e., >1 is an infinitesimal generator. b) For arbitrary x G X we choose x G dom .A with XQ = x and set y = Az, z = (XI - B)x. Observing \\En(XIn - A„)- 1 P„|| < M1M2M(ReX - w)" 1 , n = 1,2,..., we get (using also (4.5)) \En(XIn - An^Zn
- (XI - Ao) _1 ^o|
< \En(XIn — An) + \En(XIn
PnEnzn
- An^PnZO
< ^ 2 M \ E n Z n Re A — w
— En(XIn — An) ~ (XI - Ao)'1
- Z 0 | + \En(XIn '
- A ^ '
Pnzo\
Zo\ 1
PnZ0
- (XI - Ao)^
On the other hand we have lim„_>oo En(XIn — An)~1zn so that xo = (XI -
AQ)~1ZQ
Z0\ - > 0. '
= rim„_).00 Enxn = xo,
G domAo
resp. XXO — AXQ = z0 = XxQ — yo. This implies Axo = yo = limn-joo EnAnxn for any x G dom A with XQ = x. This proves that the definition of the operator Ao in the proposition makes sense and that the infinitesimal generator A of So(-) is an extension of AQ . In order to prove A = Ao we choose an xo G dom A and set yo = (XI—A)xo, xn = (XIn - An)~1Pny0 G d o m ^ „ . By Lemma 4.1 we have l i m ^ o o Enxn = (XI - A)-xyo = x0, i.e., ( X „ ) „ € N G X°°. From E „ A n x n = EnAn(XIn
- An)"lPnVQ = En(X(XIn
- An)'1
= XEnxn - EnPnyo,
-
In)P„y0 n = l,2,...,
we obtain (using also (a2)) lim EnAnxn
= Xx0 - yo = Ax0.
n—too
This proves that x G dom^4, XQ G dom^o a n d ^0^0 = AXQ. Consequently we have A — AQ. c) Assume that (ii) holds and denote by S(-) the Co-semigroup on X°° generated by A. For some constants M > 1 and UJ € R we have ||S(i)|| < M e u t , t > 0. Moreover, (J - / i A ) _ 1 exists for 0 < ]i < l/|w|. For x G X°° we set y = (yn,k)neN = {I — fiA)~kx, k = 1,2,... . It is easy to see that
126
Chapter 4. Approximation
Vn,k = (In — nAn)~kxn, rem 2.23) we have (4.9)
Co-Semigroups
n = 1,2,... . By the exponential formula (see Theo-
S(t)x = lim (i - 7 A ) " x,
We set S(t)x = (yn(t))neN yn,k = (In - (t/k)An)~kxn.
of
x G X°°.
and (/ - (t/k)A) x = (yn,k)nefi- Then we have This and (4.9) imply for k -> oo
yn(t) = Sn(t)xn,
t > 0, n= 1,2,... .
We define y0(t) = lim^oo Enyn(t) = lim^oo EnSn(t)xn and fix a T > 0. Continuity of S(-)x implies equicontinuity of the sequence (£'Tlo7l(*)icn)ri^^. Since (EnSn(t)xn)nen is a convergent sequence for any t e [0, T], it is precompact. By Ascoli's theorem (see for instance [Di, p. 137]) we get a subsequence which is uniformly convergent on [0,T]. Since the limit function necessarily is yo(-), we see that yo(-) is continuous on [0,T]. Given e > 0 we choose 6 > 0 such that fA-,^ (4.10)
\S(h)x-Sfo)x\x°°
and
\y0(ti) - y0(t2)\
o for t 1 , i 2 £ [0,T] with \ti
< | 3
-t2\<S.
For any r e [0, T] there exists an NT G N with |j/o(r) - £ , n 5 n (r)a; n | < - for n > NT. We set U = iS for i = 1 , . . . ,k — 1 and £*, = T, where fc is determined by (k — 1)6
- y0(t)\ < |
(t)xn -
EnSn{tj)
+ \EnSn(tj)xn ^ e ^3
e +
- y0{tj)\ + \y0(tj) -
y0(t)\
e
3+ 3
= £
'
where we have also used (4.10). This proves lim„_>.00 EnSn(t)xn = y0(t) uniformly on [0,T]. From \\EnSn(t)Pn\\ < MxM2Mew\ t > 0, n = 1,2,..., we obtain \EnSn(t)Pnx0
- EnSn{t)xn\
< M1M2Meu,t\Enxn
- x0\,
from which we conclude that also lmin^oo EnSn(t)PnXQ
[0,71.
n = 1,2,...,
= yo(t) uniformly on
•
We are now in a position to prove the version of the Trotter-Kato theorem which assures also existence of a limiting semigroup.
4.1.
The Trotter-Kato
theorem
127
4.6. Theorem. Assume that (al) - (a3) hold and let An, n = 1 , 2 , . . . , be the infinitesimal generators of the Co-semigroups Sn(-) on Xn. The following two statements are equivalent: (i) So(t)x := limn^oo EnSn{t)Pnx exists in X for all x e X and t > 0, the convergence being uniform for t in bounded intervals. (ii) a) There exist constants M > 1 andw G R such that Sn(-) G G(M,w). b) R(X)x := lim„_>oo En(XIn — An)~1Pnx exists in X for allx G X and all X with Re A > w. c) range R(X) is dense in X for all X with Re A > w. If (i) or, equivalently, (ii) is true, then R(X) = (XI — AQ)-1, ReA > AQ is the infinitesimal generator of the Co-semigroup So(-) on X.
LO,
where
Proof, a) First assume that (i) holds. Then Lemma 4.1 implies that So(-) is a Co-semigroup on X with infinitesimal generator AQ. Moreover, (ii) is true with R(X)x = (XI - Ao)~lx. b) Let (ii) be satisfied. We want to show that the operator A as defined in (4.4) is the infinitesimal generator of a Co-semigroup on X°°. For arbitrary x G X°° and A with Re A > LJ we consider the equation
(XI — A)y = x, This is equivalent to (A/„ — An)yn
yedomA.
— xn, n— 1,2,..., and by (ii), a) to
Vn = (XIn - An)~1xn,
n = l,2,....
1
Using || J E„(A/„-A r l )- P„|| < M 1 M 2 M ( R e A - w ) - 1 , n = 1,2,..., and (ii), b), we have lim Enyn = lim En(XIn - A„) _1 a;„ = lim En(XIn - An)~lPnxo n—>oo
n—foo
= R(X)x0,
n—>-oo
i.e., yo = R(X)xo and consequently y G X°°. The equation lim EnAnyn
= lim En(X(XIn
- A„) _1 a;„ - xn)
= lim (XEnyn - Enxn)
= Xy0 - x0
n—foo
proves that y G dom.4. Thus we have shown that {A | ReA > w} C p(A) and (A7 — A)~^x = ((XIn — An)~1Xn)neN for x G X°°. It is easy to see that
"^-^"^(dSb)'
ReA>w
-
This implies also that A is closed. By induction we see that H ( A J - A ) - f c | | < ( R e A M ^ , fc = l , 2 , . . . , R e A > W .
Chapter 4. Approximation
128
of
Co-Semigroups
In view of the Hille-Yosida theorem it remains to prove that dom A is dense in X°°. For x G X°° and e > 0 we choose an Ni G N such that \Enxn -x0\
< ——
forn>iVi.
By condition (ii), c), we can choose yo € range-R(A), y0 = R(\)a, e \Vo ~ x0\ < 3Mi We set yn = (A7n — An)~lPna lim Enyn n—KXJ
with
and see from condition (ii), b), that
lim En(XIn - A~lPna
= R(X)a - y0,
n—• oo
which shows (j/n)neN G X°°. From a = l i m ^ o o EnPna = lim„^. 00 £„(A7„ An)yn and lim^^co i?n?/„ = yo w e conclude that linin^oo EnAnyn exists (and equals Aj/o — o). Consequently we have (yn)neN e dom .A. We choose ^ e N such that l-Bnj/n - j/ol < TTT-
for n > AT2.
The estimates given above show that, for n > N := max(iVi, .W2), we have the estimate \Xn
yn\n ~ \i-n\-^n^n
< Mx(\Enxn
^nVn^n
- xQ\ + |x 0 - y0\ + |j/o - Enyn\)
< e.
For n = 1 , . . . , N — 1 we choose y„ € dom An such that |?/„ — xn\n < e and set y-a = 2/n for n> N. Then we have y = {yn)nefi € dom .A and |sc — y\x<*> < e. According to the Hille-Yosida theorem A is the infinitesimal generator of a Co-semigroup on X°°. Then Proposition 4.5 implies (i). • The following lemma shows that condition (ii) in Theorem 4.6 needs only to hold for some A with Re A > UJ (compare also condition (i) in Theorem 4.2). 4.7. Lemma. Assume that (al) - (a3) hold and let An, n = 1,2,..., be the infinitesimal generators of the CQ - semigroups Sn(-) on Xn. Moreover, assume that there exist constants M > 1 and UJ G R with 5„(-) G G(M,UJ), n = 1,2,... . Then the following two statements are equivalent: (a) limn^oo En(XIn — An)~1Pnx exists in X for all x G X and all A with Re A > UJ. (b) There exists a Ao with Re Ao > UJ such that limn^oo En(XIn — An)~1Pnx exists in X for all x G X. If (a) or, equivalently, (b) is satisfied, we set R(X)x = limn^oo En(XIn — An)~1Pnx, x G X, Re A > w. Then range R{X) = X for all X with Re A > w if and only if range R(XQ) = X for some AQ with ReAo > UJ.
4.1. The Trotter-Kato theorem
129
Proof, a) Assume that (b) is satisfied. We set A = { A e C | R e A > w and lim EJXIn
-
AnylPnx
n~>oo
exists in X for all x £ X } . We fix A € A. Then using ||(AJ„ - A n )- f c || < M(ReA - w)~fc, k = 1,2,..., we have (/*/„ - A^-1
= (XIn - An)~l
(J„ + (,x - A)(A7„ - A , , ) - 1 ) *
OO
(4.11)
k=0
for /i with | A — n\ < Re A — w. We fix e > 0 and x € X. Then there exists an N € N such that
(A - /x)fc(A/„ - A J - * - 1
I £
<
fc=AT+l
for all n — 1,2,
AMiM2\x
This implies En\ixln~
An)
PnX — him\ll,lm
— Am)
PmX
TV
< E iA - ^ife ^ ( A / « - ^ r f e - 1 P n z
(4.12)
fe=0 +
2 l
for all n, m G N. Since we have A e A, it follows that \En{\In — An)~ Pnz Em(XIm ~ Am)~1Pmz\ —> 0 for all z e X as m, n -4 oo. Assume that y = limn^oo En(XIn - A„) _ f c P„x exists in X. Then we get \J^n{Xln — An) < \\Bn(XIn
*n%
- A „ ) - 1 P „ | | \En(XIn
Am)
~ An)-lPn\\
\Em{XIm
+ \En(XIn
- An^Pny
- Em(XIm
MXM2M,
1
PmX\
- An)-kPnx
+ \\En(XIn
+ \\Em(XIm
<
&m\Xlm
- Em(XIm
-
- A m ) ~ * P m X - y\ - Am)'1
- A m ) - P m | | \y - Em(XIm
-
Pmy\ Am)~kPmx\
En(XIn — An) Pnx — Em\Xlm — Am) Pmx\ ReA-w 2MiM 2 M V — Em{XIm — Am) Pmx\ Re A — u + \En{XIn ~ A n ) - 1 F „ y - Em{XIm - A ™ ) " 1 / ^ ! -»• 0
Am)-kPmx\
Chapter 4. Approximation
130
for m,n —> oo. By induction we see that lim„_>oo En(\In in X for all fceN. We choose N0 G N such that \En(XIn — An)
Pnx — Em{Xlm
of
Co-Semigroups k
— An)
Pnx exists
Pmx\
— Am)
e 2(A + 1) max fc=0 ,..., w (Re A - u)k r
for k = 0 , . . . , N and n,m, > No. Using this in (4.12) we get, for |A — /i| < Re A — u>, \En(fj,In - An)~ Pnx - Em(^Im
- Am)" Pmx\ < - + - — e,
n,m>
N0.
This implies that lim^^co En(fj,In — A „ ) _ 1 Pnx exists in X for \X~n\ < Re A - w and x e X, i.e., // G A for |A - fi\ < Re A - w. This proves that A is open. Let \i € {A G C | Re A > w} n A, i.e., /i is a cluster point of A relative to the open right-half plane Re A > w. Consequently there exists a A G A with |A-/x| < ( R e / i - u ; ) / 2 . This implies Re A — o> = Re /i - w - Re(// - A) > |/x — A| and consequently / i e A i n view of the considerations given above. Thus A is also relatively closed in Re A > u, which finishes the proof of A = {A G C | Re A > <JJ}.
b) Assume that (a) or, equivalently, (b) holds. In order to prove the last part of the lemma it suffices to prove that for any A with Re A > UJ and range 72(A) = X there exists a neighborhood U with range R(n) = X for all fi G U. Assume that range R(X) = X for a A with Re A > w. For |/J - A| < Re A - u; we have oo
En(ln
+ (IM - A)(A/„- J 4 T l )- 1 )- 1 P„ = ]T(A - n)k(En{XIn
An)-lPnf
-
k=0
-I
+ EnPn
= (I + (H- X)En(XIn - An)-xPn)~l
-1 + EnPn
and consequently (note that PnEn — In) En(nln
- An)-lPn
= En(ln
+ (/x - A)(A7„ - A„)- 1 )" 1 (A7„ -
An)~1Pn
= (l + (fi- X)En(XIn - J 4„)- 1 P„)" 1 E„(A/„ + (7 - EnPn)En{XIn
An)-lPn
- A„)" 1 P„
= (I + (/i - A)£„(A7„ - A„)- 1 P„)" 1 E n (A7„ -
An)~lPn.
4.2. Approximation of nonhomogeneous problems
131
This and the estimate || (J + (M - A)£„(A/„ - A „ ) - 1 P „ ) " 1 |
/ + J2(X - ii)kEn{\In - An)~kPn k=\
fc=l
for | A — /i| < Re A — ui, n = 1,2,..., imply fl(A) (/ + (/i - A)JJ(A)) _1 a; - £„(/*/„ - A x J - ^ n i < cA,„| ( ( / + (/i - A)E n (A/ n - A n )- x P n )i?(A) - E n (A/„ - A n ) - 1 P „ ( 7 + (^ - A)fl(A))) (/ + (/i - A)i?(A)) _1 x for x 6 X and \fi — A| < Re A — w. The right-hand side tends to 0 as n —> oo. Thus we have shown that lim £„(/x/n - An)'lPnx
= i?(A)(J + (/i - A)P(A)) _1 a;.
On the other hand we have limjj-yoo En{^iln — An)~lPnx 1
R(fi) = R{X)(I + (fj,- X)R{\))" ,
= R(fi)x. This proves
\n - A| < ReA - w.
It is clear that range(7 + (/* — \)R(X))~1 = X for |/x — A| < Re A — w. Then we get immediately from range R(X) = X that also range i?(/i) = X for |/x — A| < ReA-w. •
4.2.
Approximation of nonhomogeneous problems
In this section we consider approximation of the nonhomogeneous problem u(t) = Au(t) + f(t),
(4.13)
t > 0,
u(0) — x, 1
where x 6 X and / € i ( 0 , oo; X) are given and A is the infinitesimal generator of a Co-semigroup S(-). As in Section 4.1 we assume that X is a closed subspace of a Banach space Z and that a sequence Xn, n = 1,2,..., of Banach spaces together with bounded linear operators Pn : Z —> Xn and E„ : Xn —• Z are given. We assume that (al) - (a3) hold. Together with (4.13) we consider the approximating problems Un(t) = AnU„(t) + /„(*), 4.14 un(0) = xn,
t> 0,
132
Chapter 4. Approximation
of
Co-Semigroups
where xn G Xn, fn £ L 1 (0, oo;X ra ) are given and the An are infinitesimal generators of C o-semigroups *S'n(*) on Xn, n — 1,2,... . The mild solutions to problems (4.13) and (4.14) are given by u(t) = S(t)x + un{t) = Sn(t)xn
Jo
S(t-
T)f(r) dr,
+ f Sn(tJo
t > 0,
T)fn(r) dr,
resp. by
t > 0.
If we assume that condition (i) of Theorem 4.2 holds and \Enfn — /|LI(O,OO;JV) ~• 0 as n ->• oo, then it is easy to show that, for xn — Pnx, we have Enun{t) -¥ u(t) as n —^ oo for any t > 0. One only has to use Lebesgue's dominated convergence theorem. However, we want to prove that this convergence is uniform for t in bounded intervals. In the following we show that this can be accomplished by converting the nonhomogeneous Cauchy problem (4.13) into a homogeneous problem in some product space. Set Z = Z x L^O.oojZ) and X = X x V-(Q,oo;X) with the norm \(x,f)\z = \x\ + | / | i i , (x,f) G Z. We define the operators <S(-) by S(t)(x,f)=(s(t)x
+ Js(t-T)f(T)dT,ft),
i>0,
(x,f)eX,
where we define / ' by / ' ( r ) = f(t + r ) , r > 0. 4.8. L e m m a , a) The operators S(t), t>0,
constitute a Co-semigroup on X.
b) If S(-) is in G{M,w), then we have S(-) £ G(M, max(w,0)). c) Let A denote the infinitesimal generator of S(-). Then A is given by dom A = dom A x W1'1 (0, oo; X), A{x, f) = (Ax + /(0), / ' ) ,
(x, f) e dom A.
Proof. It is very easy to see that <S(-) is a Co-semigroup on X, which satisfies statement b). Therefore we shall only give the proof for statement c). We choose (x,f) G dom .4 and fix A > max(w,0). Then we have, for some {V, 9) G X, /•OO
(x,f) 4
( -!5)
= (XI-A)-1(y,g)= , ,oc , j™e~xt(S(t)y
/
xt
e-
S(t)(y,g)dt
Jo
+ JQS(t-
r)g(r) dr) dt, J^e^g'dt)
.
4.2. Approximation
of nonhomogeneous
problems
133
This implies /•oo
(A
/*00
e-Mgt{T)dt=
f(r)= JO
1 R \
(4-16)
e-xtg(t
+ T)dt
JO
oo = e A r / e~xtg{t) dt,
r > 0,
which proves / G VF1'1(0, oo;X). From (4.15) we get also x=
/ e- A t 5(t)?/di+ / e~At / Jo Jo Jo /•oo
={\I-A)-1y+
(4.17)
S(t~T)g(T)dTdt
/»oo
e~XtS{t) e~Xr g{r) dr dt Jo Jo
= (\I-A)-l(y+
J e~XTg{r) d r ) £ dom A.
This together with (4.15) and (4.16) proves {x,f)£domAxW1'1{0,oo;X)
and ^ ( i , / ) = {Ax + / ( 0 ) , / ' ) -
This proves that the operator B defined by dom 2? = dom A x VF1'1(0, oo;X) and B{x, f) = {Ax + /(0), / ' ) for {x, / ) G dom 6 is an extension of A. In order to prove B — A we fix A > max(w, 0) and assume that, for some {x, / ) G dom B, we have {XI — B){x,f) = 0. This is equivalent to (4.18a)
{XI-A)x-f{0)=0,
(4.18b)
Xf - f = 0.
Equation (4.18b) is equivalent to / ( r ) = e A r /(0), r > 0. In view of A > 0 we can have / G L 1 (0,oo;X) if and only if /(0) = 0. Consequently (4.18b) is equivalent to / = 0. Then (4.18a) is equivalent to {XI — A)x = 0 respectively to x = 0, because we have X > u>. Thus we have shown that XI — B is injective. Let (x, f) £ dom 23 be given. Since we have range(A/ — A) = X, there exists an {x, f) G dom.4 with {XI - B){x, / ) = (A7 - A){x, / ) = {XI - B){£, / ) . By injectivity of A J - B we get {x, f) = {x, / ) G dom A and B{x, f) ~ A{x, / ) . • From (4.15) - (4.17) we get the following representation of the resolvent operator (A — A)-1, Re A > max(w, 0): (4.19)
{XI-Ar'^g) = {{XI - A)'1 (y + y ° ° e - A ^ ( T ) dr), eA' J°°e-X'g{a)
for
da)
(y,g)eX. We can now state and prove the approximation result for nonhomogeneous Cauchy problems:
134
Chapter 4. Approximation
of
Co-Semigroups
4.9. Theorem. Assume that conditions (al) - (a3) hold and that A resp. An, n = 1,2,..., are infinitesimal generators of Co-semigroups S(-) on X resp. Sn(-) onXn. Furthermore, assume that the following assumptions are satisfied: (a) There exist constants M > 1 and ui G R such that S(-) G G(M,w) and Sn(-) £ G(M,to), n = 1,2,... . (b) The functions fn G L1 (0, oo; Xn), n = 1,2,..., satisfy lim \Enfn - f\Li = 0. (c) For any x 6 X and some A iw£/i Re A > max(u;, 0) we have lim \En(\In
- (XI - A)~lx\
- A^PnX
= 0.
TTien we have, for any x € X, lim Enun(t)
= u(t),
t>0,
wftere ifte convergence is uniform for t in bounded intervals andu(-) resp. un(-) denotes the mild solution of (4.13) resp. of (4.14) with xn = Pnx. Proof. The inequality f EnSn{t Jo
- T ) / „ ( T ) dr - f EnSn{t Jo
- T)Pnf{r)
dr
<
[\EnSn(t-T)Pn(Enfn(r)-f(T))\dr Jo < MiM^Me^lEnU - f\Li
together with condition (b) of the theorem shows that we can restrict ourselves to the case / „ — Pnf. Let the semigroups <£«(•) and their infinitesimal generators An be defined analogously as <S(-) and A. Then we have Sn(-) G G(M, max(w,0)), n = 1,2,..., from Lemma 4.8. We define the operators Vn : Z —>• Xn and £n : Xn^Zby Vn(x,f)
= (PnX,Pnf),
^ny^Wi Jn) ™ x^n^ni
•&njn))
(x,f)eZ \%ni Jn) t ™ni
where (Pnf)(T) = P „ / „ ( r ) and ( £ „ / „ ) (T) = Enfn{r), r > 0. Obviously we have ||P„|| < Mu \\Sn\\ < M2 and Vn£n = / . From \EnPnf - f\Li = J0\EnPnf{T) — f(r)\dT and Lebesgue's dominated convergence theorem we get also limn^oo £„Vn{x, f) = (x,f). Thus conditions (al) - (a3) hold for Vn and Sn. In order to verify condition (i) of Theorem 4.2 we use (4.19) (for A and An) and the estimate
|(A7 - A)-\x, f) - 8n(XIn - A O " 1 ? ^ , / ) !
4.3. Variational formulations
of the Trotter-Kato
(\I-A)~l(x
- A^-1
e - A T P „ / ( r ) dr)
(pnx + f
oo
poo
/
e-Xsf(s)ds-EnexA^x - En(XIn -
<\(\I-
135
f°°e-XTf{T)dr)
+ - En(\In
theorem
e-XsPnf(s)ds
J An)-lPnx\
poo
+ / e~XT\(XI - A)-lf(r) Jo /»oo
/»oo
eXr
+ /
An)-lPnf{T)\dr
- En(XIn -
e-Xs\f(s)
- EnPnf(s)\dsdr
=: I + II + III.
By assumption (c) we have limn-too I = 0. Again by assumption (c), the estimate |(A/ - A)~'f{r)
- En(\In
- An)-'Pnf(r)\
<
ffi±-^l^|/(T)|, IXB A — UJ
n = 1,2,..., r G [0, T), and by Lebesgue's dominated convergence theorem we prove that also limn-too II = 0. For III we get /•OO
m<
J
pOO
J
e-x{s-r)\f{s)-EnPnf{s)\dsdT
poo ps
/ / e- A < s " T W \f{s) - EnPnf(s) Jo Jo
| ds
< jJ°°\f(3)-EnPnf(8)\da. From lim„^oc EnPnf(s) = f(s) for s > 0 and \f(s) - EnPnf{s)\ < (1 + M\M2)\f(s)\ w e get that also limn->oo III = 0. Thus we have shown that condition (i) of Theorem 4.2 is satisfied. By this theorem we get that, for any
(x,f)ex, lira £nS„(t)Vn(x,
/ ) = S{t){x,f),
t > 0,
n—>oo
where the convergence is uniform for t in bounded intervals. Looking at the X-components we get the desired result. •
4.3.
Variational formulations of the Trotter—Kato theorem
In many applications the infinitesimal generator A of a Co-semigroup is defined via a sesquilinear form a defined on a dense subspace of X. In such a case it is natural to define the approximating operators by sesquilinear forms
Chapter 4. Approximation
136
of
Co-Semigroups
an approximating er. Therefore it is of interest to formulate stability and consistency of such an approximation scheme in terms of the sesquilinear forms a and an. Let A be the infinitesimal generator of the Co-semigroup S(-) on X and assume that (4.20)
Xn
is reflexive, n—1,2...
.
Whenever the approximation scheme given by the spaces Xn and the operators An represent a numerical approximation scheme for an abstract Cauchy problem, the spaces Xn will be finite dimensional and assumption (4.20) is trivially satisfied. Define a continuous sesquilinear form a on dom Ax Z* by (4.21)
a{x,x*) = (Ax,x*),
x G domA,
x* G Z*,
and let <7„, n = 1,2,..., be a sequence of continuous sesquilinear forms on Xn x Xn. The duality set of xn G Xn will be denoted by Fnxn. For each n let Dn be a Banach space isomorphic to Xn and in be a bounded isomorphism Dn ~* Xn. For the sequence (Xn,Dn,o-n,in)neN we formulate the following stability assumption: (Sv)
There exists a constant u> G K such that for every n G N and yn G Dn there exists an xn G Fn(inyn) with Rean(yn,xn)
< uj\i
The existence of approximating operators is assured by the following lemma: 4.10. Lemma. Assume that (4.20) and condition (Sv) are satisfied. Then, for each n G N, there exists a continuous linear operator An on Xn such that (4.22)
(Aninyn,
x*n) = an{yn, x*n) for all yn G Dn and xn G X*.
Moreover, An — wln is strictly dissipative. Proof. Since Xn is reflexive, there exists a continuous linear operator An : Dn -> Xn such that {Anyn, x*n) = o-n{yn, xn)
for all yn G Dn and x*n G X*.
Since in is bijective, it is continuously invertible. We define the operator An on Xn by An — Ani~l. Then it is clear that An satisfies (4.22). Condition (Sv) implies that for every xn = inyn G Xn there exists an x* G Fnxn with Re(Ana;„,a;*) < w|a;n|^, i.e., An — wln is dissipative. Since An is continuous, it is the infinitesimal generator of the Co-semigroup Sn(t) = exp(Ant) and therefore also strictly dissipative (see Theorem 2.25). •
4.3. Variational formulations of the Trotter-Kato theorem
137
For A > OJ and x G X we set y = (XI — A)~1x. From (4.21) we get (4.23)
\(y, x*) - a(y, x*) = {x, x*)
for all i ' e Z * .
Dissipativity of An — XIn implies (see Proposition 1.9) that (XIn — An)~l exists for A > OJ and \\(XIn - yl„) _ 1 || < (A — OJ)-1. The element yn = i~l(XIn — An)~lPnx satisfies HinVn,x*n) - a„{yn,xn)
= (Pnx,x*n)
for all x*n G X*.
This together with (4.23) implies that for arbitrary yn G D„, a;* G X£ and x* GZ* (4.24)
X(in(yn - yn),x*n) - an(yn - yn,x*n) = {Pnx,xn) -X((inyn,x*n)
-
(x,x*)
- {y,x*)) + an(yn,x*n) -
a(y,x*).
We introduce the following consistency hypotheses: (Cvl) There exists a dense subset D C domA such that (X0I - A)D — X for some Ao > w. (Cv2) For any y £ D there exist yn € Dn with lim \Eninyn
-y\=0
n—too
and, for any xn £ Xn, elements xn G Fnxn, lim
1
x*n G Z* with
(Pnx,x*n)-{x,x*n) - A o ( ( M / n , < > - (y,X*n))
+0-n(yn,Xn)-a(y,X*n)
= 0,
where x = (XQI — A)y. 4.11. Theorem. Assume that A is infinitesimal generator of a Co-semigroup S(-) onX and that Xn,Dn,in,an,En,Pn,n— 1,2,..., satisfy (al), (a3), (Sv) and (Cvl), (Cv2). Then, for every x e X, lim \EnSn(t)Pnx
- S(t)x\ = 0
n—too
uniformly for t in bounded intervals, where An is given by Lemma 4.10 and S„(-) denotes the Co-semigroup on Xn generated by the operator An. Proof. By Lemma 4.10 the operators An — wln are dissipative on Xn, which implies that Sn(-) is of class G(l,u>), n = 1,2,... . We choose y G D and set
138
Chapter 4. Approximation
x = (X0I - A)y and yn = C ^ W n - An)-lPnx. x = x^ we obtain ((X0In - An)in(yn
of
Co-Semigroups
From (4.22) and (4.24) with
- yn),x*n) = (Pnx,x*n) - {x,x*n) - X0{{inyn,x*n) + crn(yn,x*n)
-<j(y,x*n)
for all A0 > u>, yn G Dn, x*n G X* and x*n G Z*. Strict dissipativity implies (Ao - w)|i„(j/„ - j/„)£ < Re((A 0 i„ - An)in(yn <
- (y,x*n))
-
oiAn-u>In
yn),x*n)
\({XoIn-An)in(yn-yn),x*n)\
for all Ao > a; and a;J^ G Fn(in(yn - yn)). We choose yn G D n according to (Cv2). Then we get (setting xn = in(yn - yn) in (Cv2)) (4.25)
lim \in(yn - yn)\n = 0
Using inyn = (XoI„ - An)~lPnx \En{X0In - AnyYPnx
and
lim \Eninyn
- y\ = 0.
and (4.25) we have
- {X0I - A)~1x\ = \Eninyn
- y\
< \Enin(yn
- yn)\ + \Eninyn
- y\
< M2\in(yn
- yn)\n + \Eninyn - !/| -> 0 as n ->• oo
for all x G (Ao/ - A)D. Since (Ao/ — -A)£> is dense in X and \\En(XoIn A„) _ 1 P„ - (A 0 / - A)" 1 1| is uniformly bounded (by (MiM 2 + 1)(A0 - w)" 1 ), we get |-En(Ao/ra - An)~1Pnx
- (Ao/ - A) -1 ar| —• 0 as n ->• oo
for all x G X. The result follows now from Theorem 4.2.
•
4.12. Example. We consider the first order hyperbolic problem (4.26)
^u(t,x)
+ ^u(t,x)=0,
u(t,0) = 0,
0<x
t>0.
We study this problem in X = Z — Co(0,1), where Co(0,1) denotes the space of continuous functions on [0,1] vanishing at x = 0. The norm on X is the sup-norm. We first prove that the operator A defined by domA ={<j)£X\
and
(f>£dom.A,
is the infinitesimal generator of a contraction semigroup S(-) on X. Set Y = {<j> G X | (j> = 0 on [0,6] for some 6 G (0,1]}, which obviously is a dense subspace of X. We choose
4.3. Variational formulations
of the Trotter-Kato
theorem
139
For a sequence of mollifiers pn2, n = 1,2,..., we set >n{x) = f_unPn{% ~ T)(J)(T)(1T, 0 < x < 1. It is easy to see that (/>„(0) = 0 for n > 1/8, i.e., <j>n G domA for n > 1/8, and that l i m ^ o o \<j> - ^„|oo = 0. Therefore domA is dense in Y and consequently also in X. In Example 2.24 we have shown that A is m-dissipative. By the Lumer-Phillips theorem we get the result. The numerical method analyzed here is the following first order finite difference scheme: (4 27)
Jtuk{t) = -£c{uk-i{i)-uk(t)),
fc
= l,...,n, t > 0,
«o(t) = 0, where uk(t) represents an approximation for u(t,xk) with a^ = fcAa:, Aa; = 1/n. We choose Xn = R n , n = 1, 2 , . . . , with norm |«| n = maxfc=i n |ufe|, u = ( u i , . . . , Wfc)T. Then the dual space is X* = Rn with norm |v|n>* = Ylt=i l^fcli i> G Mn. It is easy to see that, for u G X, we have w = ( i ^ , . . . , u„) G F n («) if and only if (4.28)
vk = ( H n S i g n Wi 10
f
°rfc = i' forfc^ i,
where i is an index with \uA = luL. We define n(x-Xk-i) Bk(x) = { n(xk+i - x) 0
for x G [xk-i,xk], for x G [xk, xk+1], elsewhere
and, for u = ( u i , . . . , un)T e X n resp. <j> € X, n
Enu = 'Y^ukBk,
Pn
*=i
It is easy to see that PnEn = In and ||P„|| = ||i? n || = 1, i.e., assumptions (al) and (a3) are satisfied. In order to show that (a2) also holds we observe that EnPn(j) is the first order spline interpolating <j> at the mesh points xk, k = 0,...,n (see [Schu, Theorem 2.6]; note that C 2 (0,1) n C 0 (0,1) is dense in Co(0,1) and \\EnPn\\ = 1, n = 1,2,...). We define the sesquilinear forms crn : Xn x X* —• R by 1 ™ CT„(U, V) = — J ^ ( « f e - l - Wfc)Vfc, x fc=i 2
p n is in <7g°(—1/n, 1/n) and satisfies pn > 0, f_\)
W G X „ , D G X*,
Pn{T)dr = 1.
140
Chapter 4. Approximation
of
Co-Semigroups
where uo = 0. For this example we can set Dn = Xn and in = /„. For u G Xn and v G Fn(u) (see (4.28)) we get 1 <Jn{u,v)
™
1
= -T—^iUk-l
-Uk)vk
= —
(m-!
-Ui)\u\n
s i g n Ui
fc=l
= -r-\u\n{ui-i
signui - \ui\) < 0,
i.e., the stability assumption (Sv) holds (with w = 0). In order to establish the consistency hypotheses we choose D = dom A, so that (Cvl) is automatically satisfied. For u G domA we define un G Xn by un = (u(xi),..., u(xn))J. Then Enun is the interpolating first order spline for u and we have \Enun — w|oo —» 0 as n —• oo. For ij)n G X n we set V>n = IV'nlnCi, where ej is the i-th vector of the canonical basis for Xn and i is chosen such that |("0n)i| = IV'nU- By the mean value theorem there exists a ( 6 {xi-\,xi) with
- u(xi))\ipn\n
=
-\ipn\nu'(£).
With such a £ we define Vn = IV'nln^ € X*, where 6% is the delta distribution with support at £. This implies (4.29)
* ( « , & ) = -lV»n|n«'(0 -
^n(Sn,C).
Simple computations show that (4.30)
\(un,rn)
and, for (f> = (4.31)
(\QI
\(Pn<j>,rn)
- ( « , C ) | = \u(xi)-u({)\
\tpn\n <
pUtl(l/n)\ipn\n
— A)u = \0u + u', - <
where pU]i resp. p ^ i denote the modulus of continuity for u resp. (f> on the interval [0,1] (see Appendix A.l). From (4.29) - (4.31) we see that (Cv2) holds. Therefore Theorem 4.11 implies lim 71—>0O
i{t,-)~Y,uk(t)Bk
0
fc=i
uniformly for t in bounded intervals, where u(t) = («i(£),... ,un(t)) solution of (4.26).
is the
4.4. An approximation
4.4.
result for analytic
semigroups
141
A n approximation result for analytic semigroups
In this section we show how sharp rate estimates for the approximations can be obtained in case of an analytic semigroup with almost selfadjoint infinitesimal generator. Let V and H be Hilbert spaces with dense and continuous embedding V C> H and a(-, •) a V-coercive sesquilinear form o n ^ x F (see Definition 3.3). In the following the constants 7, 6 and K are those appearing in (3.3) and (3.4). According to Theorem 3.4, b), there exists a linear operator A on H with dom A = {y G V |there exists an a > 0 such that \a(v,w)\ < a\w\u for all w G V} and (4.32)
a(v,w) =
-{AV,W)H,
V
G domA, t i i e K
According to Corollary 3.5, A is infinitesimal generator of a Co-semigroup S(-) G G(l, K) on H, which is analytic because A is sectorial (see Proposition 3.9 and Theorem 3.19). Corresponding to the sesquilinear form a(-, •) we define a(u, v) = a(v,u),
u, v, e V.
It is easy to see that a is also a coercive sesquilinear form o n ^ x V , where (3.3) and (3.4) hold with the same constants 7, 6 and K. Let A* be the operator on H defined by a according to Theorem 3.4, b). Then we have, for v £ dom A*, w G dom A, (4.33)
(A*V,W)H
= —a(v,w) = —a(w,v) — (Aw,v)H
=
(V,AW)H,
i.e., A* is indeed the adjoint operator of A. Let Vn, n = 1,2,..., be subspaces of V endowed with the | • |v-norm and set Hn — {Vn,\ • \H)- Obviously we have Vn Q Hn densely and continuously. We define the sesquilinear forms an on Vn by restriction, a
n = a \vnxvn,
n = 1,2,... .
Trivially, these sesquilinear forms are coercive and (3.3), (3.4) hold with 7, 6, K for all n. Therefore, according to Theorem 3.4, b), there exist operators An on Hn, which are sectorial and thus infinitesimal generators of analytic semigroups Sn(-) on Hn. These operators satisfy (4.34)
a(v,w) — -(Anv,w)n,
v edomAn,
w eVn,
where domj4„ = {v G Vn |there exists an an > 0 such that \a(v, w)\ < an\w\u for all w G Vn}. Since the angle 6 G (0,7r/2) characterizing the sector Y,$tK and the constants in the estimates (3.9) - (3.13) in Theorem 3.6 depend only on 7, S and K, we
142
Chapter 4. Approximation
of
Co-Semigroups
can choose a fixed 9 e (0,TT/2) such that S9>K C p(A) fi /o(^*) n f\Z=iP(An)Moreover, the estimates (3.9) - (3.13) are valid for A, A* and An, n= 1,2,..., with the same constants. Proposition 3.18 implies that, for k = 0 , 1 , . . . , we have S ( *'(t)u = - i - / (4.35)
2
y
Xkext(XI - A^udX,
ueH,
t > 0,
+
" ;y <»> ^fc)(*K = — / AfceAt(AJn - A ^ ) - 1 ^ dX,
un €Hn,
t> 0,
where we can choose 77 = 1 and ^ € (0,0). The curve Titg is given by (3.38) and (3.39) (for S = 1 and 7 = ^ ) . Let P„ be the orthogonal projection H —• ff„ and _E„ the canonical injection Hn ^ H, n — 1,2,... . Then we have ||P„|| = \\En\\ = 1 and PnEn = In, n = 1,2,... . We impose the following assumptions: (Nl)
dom A* = dom A =: D.
We consider D a s a Hilbert space with the graph norm of A, \u\n = (|i*S ?r + #) 1 / / 2 , u e D. We could use also the graph norm \u\*D of A*, because these two norms are equivalent. This can easily be seen as follows. Let t: (D, \-\D) —> (D, I • |Jj) be defined by tu = u, u £ D. Then one can prove that 1 and i~x are closed operators, which by the closed graph theorem implies that they are continuous. (N2)
There exists a sequence (e(ra))„eN with e(n) > 0, n = 1,2,..., and liniji-xx, e(n) = 0 such that for all u G D there exist elements un €E Ku 7i = 1,2,..., iw'i/i |M — Wn,|ij < £(72)1^1^
and |w — un\y < e(n)|w|u,
n=l,2,... .
We can now prove the following convergence result for the resolvent operators of A and An: 4.13. Proposition. Assume that conditions (Nl) and (N2) are satisfied. Then for any 77 > 0 there exists a constant c > 0 such that \{XI - Aj^u
- (XIn - An)-lPnu\H
< ce(nf\u\H,
n = 1,2,...,
for all u e H and X £ T,gtK with \X — K\ > 77. Proof. We fix u £ H, X e £#,* with |A - «| > n and set v = (XI — A)~lu, vn = [XI„ - An)-lPnu, n = 1,2,... . Using (4.32) and (4.34) we get X(v,w)H
+ a(v,w) = (u, w}H,
W e V,
X(vn, wn)H + a(vn, wn) = (Pnu, wn)H = (u, wn)H,
wn £ Vn, n 6 N .
4.4. An approximation result for analytic semigroups
143
We set e„ = v — vn E V and get (for w = wn) (4.36)
\(en,wn)H
+ a(en,wn) 1
For zn — (XI - A*)~ en (4.37)
= 0,
i»„EKi,n=l,2
e D we have (using also (4.33))
\(zn,en)H
= \en\2H,
+ a(en,zn)
n = l,2,
This together with (4.36) implies (4.38)
A(zn - wn,en)H
+ a(en,zn-
wn) = \en\2H,
wn£Vn.
According to assumption (N2) we can choose wn € Vn such that (4.39)
\zn ~wn\H
< e(n)\zn\v
\zn-wn\v
<e(n)\zn\D,
and n=l,2,....
This implies (4.40) \a(en,zn-wn)\<je(n)\zn\D\en\v, n=l,2,.... In the following 'const.' will always denote a non-negative constant which does not depend on n and on A G T,g,K with |A — K\ > r). The estimates (3.13) resp. (3.12) imply \en\v < \{XI - A) lu\v + \{XIn-An)
1
Pnu\v
< i^l/aHg,
(4.41) \en\n < |(AJ - A ) -
1
^ + |(A/„ - An)-1Pnu\H
<
^^-\u\H |A - K\
and \zn\v = \{\I -A*) (4.42)
1
en\v
const. <———^\en\H,
i i , T , ,.,^_i i const. . . \zn\H = \{XI - A*) i e „ | < r|e„| H , |A l
|^*^n|ff = |A(A7- A*)- en-en\H
K|
< ( l +const. . J .Wig. \ \X - K\/
The last two estimates show that (4.43)
\zn\D < const, ( l +
_
) \en\H,
n = l,2,....
From (4.40), (4.41) and (4.43) we obtain (4.44)
\a(en,Zn-w )\< \a(e„,z n-wnn)\
<—
^2e(n)\en\H\u\H•
Using (4.39), (4.41) and (4.42) we get \X{zn-wn,en)H\
< |A|e(n)|z n |y|e n | g < const.
^ A —K
\l'z
n/0\en\H\u\H.
144
Chapter 4. Approximation of Co-Semigroups
The last estimate together with (4.38) and (4.44) gives , , e(n) , , \en\H < const.-TTE\U\HI —^ Observing that e„ + wn - v = wn - vn € Vn for any wn G Vn we get from (4.36) the equation (4.45)
+ wn- v)H + «(e
+ wn — + a(en,en
V)H
+wn - v) = 0,
u)„ € V„,
which implies K\en\2H +
a(en,en) = -(A - K)\en\2H - X(en,wn
- v)H - a(en,wn
- v),
wn G Vn.
Using coercivity of a we get (4-46)
S\en\y < K\en\2H + Rea(e . , , . , , . 2,2 <\\K\ \en\ H + \X\ \en\H\wn - v\H + ~/\en\v\wn -
v\v.
According to (N2) we choose wn G Vn such that \v — wn\H < e(n)|v|v and \v — wn\v < t(n)\v\i). This and the estimates (3.12), (3.13) imply i -
i
e n
()
\Wn ~ V\H < COnst
i i
|i/2lM|g'
\wn — v\v < const. e(n)\u\jj. Using these estimates and (4.45) in (4.46) we have S\en\v < |A - K\ \en\2H + const.--
rrj5€(n)le"[ff Mff
A — K \Ll *
+ const. e(n)|e„|v|u|if < const.\e(n)2\u\2H +
e(n)\en\v\u\H\
< const. e(n) 2 |u|^ + -|e„|^> which implies (4.47)
|e n |v < const.e(n)|u|#.
4.4. An approximation
result for analytic semigroups
145
From (4.38) we get, using (4.39), (4.42), (4.43), (4.45) and (4.47), the estimate \en\2H < |A| |e„|tf|z n - wn\H + j\en\v\zn
-
wn\v
< |A|e(n)|e„|#|z„|v + 7e(n)|e„|y|2:„|£> < const
,y2e{n)\en\2H
+ const.e(ra)(l +
J|e n ly|e n |ff
< const. e(n)2|e„|jff|u|ff. The last estimate implies the desired result |e„|fr < const. e(n)2\u\H,
n = 1,2,..., AG E 0iK , |A - n\ > rj. D
4.1. Remark. Assumption (Nl) tells us that in some sense the operator A is not far from being selfadjoint. For a second order differential operator the first order terms can be different, for instance. Assumption (N2) characterizes the quality of approximation for elements in D by elements of the subspaces Vn. The basic idea for the proof of Proposition 4.13 is frequently called Nitsche's trick (see [Brae, p. 88] resp. [Au] and [Ni]). It is also clear that (N2) together with (al) implies (a2). Since the semigroups Sn(-) are of class G(l, K), it is clear that the stability hypothesis is satisfied for the approximations. According to Proposition 4.13 the consistency hypothesis holds also. Therefore the Trotter-Kato theorem assures that lim Sn{t)Pnu
= S(t)u,
u£ H,
uniformly for t in bounded intervals. However, the rate estimate in Proposition 4.13 together with the representation (4.35) allows a rate estimate for the approximations of all solutions and their derivatives for t > 0. 4.14. Theorem. Let assumptions (Nl) and (N2) be satisfied. Then for any T > 0 and k = 0 , 1 , . . . , there exists a constant jT,k > 0 such that \SW(t)u - S^(t)Pnu\H
< ^€(n)2\u\H,
u&H,0
Proof. The representation (4.35) and Proposition 4.13 imply \Sw{t)u
- S{nk){t)Pnu\H
< ce{nf\u\H
f
\Xkextd\\,
t > 0.
JTi^ + iK,}
Standard computations using (3.38) and (3.39) prove the result.
•
146
Chapter 4. Approximation
of
Co-Semigroups
4.2. Remark. Of course, the resolvent estimate of Proposition 4.13 allows also a rate estimate for the uniform convergence Sn{t)Pnu —> S(t)u on bounded tintervals including 0 provided u is smooth enough. Sufficient is for instance u £ domA 1 + e with e > 0 (see [I-K2]).
CHAPTER 5
Nonlinear Semigroups of Contractions The first section of this chapter is devoted to the Crandall-Liggett theorem, the basic generation theorem for nonlinear semigroups of contractions (see [Cr-L]). We also consider generation of nonlinear semigroups in Section 6.6. For approximation results see Theorem 10.10, which is a nonlinear version of the Trotter-Kato theorem, and Section 10.3, where discretization with respect to time is considered. In Section 5.2 we relate the generation theory for nonlinear semigroups with the existence of strong and integral solutions of abstract nonlinear Cauchy problems. The concepts of weak and strong infinitesimal generators are introduced in Section 5.3, where we investigate also to what extend nonlinear versions of the Hille-Yosida theorem can be established. Our presentation is strongly influenced by [Miy], which we quote also for further results in this context. See also [Cr-L], [Ka2], [Ka3], [Kom] and [Brl]. In Section 5.4 we give an application to an abstract Cauchy problem which is a model for nonlinear diffusion (see [Bb4, Section 4.3.3]).
5.1.
G e n e r a t i o n of nonlinear semigroups
In this section we present the basic generation theorem for nonlinear semigroups of contractions by Crandall and Liggett. 5.1. Definition. Let XQ be a subset o f l , w g R and S(t), t > 0, be a family of operators XQ —• XQ- The family S(t), t > 0, is called a strongly continuous semigroup of type UJ on Xo if and only if the following is true: (i) S(t + s)x = S(t)S(s)x for all t, s > 0 and x £ X0. (ii) S(0)x = x for all x G X0. (iii) For any x 6 Xo, the function [0, oo) —>• Xo defined by t ->• S(t)x, t>0, is continuous. (iv) For all x, y £ XQ and t > 0 we have \S(t)x-S(t)y\<eut\x-y\. If W = 0, we call S(t), t > 0, a strongly continuous semigroup of contractions on XQ. 147
148
Chapter 5. Nonlinear Semigroups
of
Contractions
For the proof of the Crandall-Liggett theorem the following estimate will play a crucial role: 5.2. L e m m a . Let (aTO,ra)m,neN0 be a double sequence of positive real numbers and \,fi positive real numbers satisfying 0 < /i < A. We set a = fj,/X and assume that (5.1)
am,n < a a m - i , n - i + (1 - a ) a m - i , u ,
m,n = 1,2,...,
and (5.2)
ao,n < An,
n = 0,1,...,
amfi < ^m,
m = 0,1,...
.
Then we have the estimate (5.3)
am,n < ((An — / i m f + A2n)
+ ((An — fim)2 + Xfim)
for m,n = 0 , 1 , . . . . Proof. Assumption (5.2) immediately implies that (5.3) is true for ao, n , n = 0 , 1 , . . . , and for a m ,o, m = 0 , 1 , . . . . The lemma is proved if we can show that (5.3) holds for (m + l,n) if it is true for (m,n) and (m,n — 1). We set f3 = 1 — a. By Cauchy-Schwarz we have, for non-negative numbers a, f3, x, y, the inequality + j3f'2{ax2
ax + f3y<(a
+ f3y2)1'2.
Using this inequality, assumption (5.1) and a + fl = 1 we get
+ A2(n - 1))*
< a((A(n - 1) - timf /
(5.4)
-.1/2
2
+ a ( (A(n - 1) — urn) + A/xmj
+ ^((An - fim)2 + A 2 n ) V 2 /
-.1/2
+ 0((An - um) 2 + Xfim)
< (a((A(n - 1) - urn)2 + X2(n - 1)) + @((Xn - /um)2 + A 2 n)) + (a((A(n - 1) - pm)2 + X/im) + (3((Xn - \im)2 + Aum)) Using aX = n and a + (3 = 1 we have a((A(n - 1) - nm)2 + X2(n - 1)) + /?((An - fim)2 + X2n)
.
= (An - u(m + l ) ) 2 + A2n - u 2 < (An - fi{m + l ) ) 2 + A2n, and a((A(n — 1) — fim)2 + Xfim) + /3((An — fim)2 + Xfim) O
n
9
2
= ( A n - n ( m + l)) + A/i(m + 1) - u < (An - / i ( m + 1)) + Au(m + 1). Using this in (5.4) we get the inequality (5.3) for (m + 1, n).
•
5.1. Generation of nonlinear semigroups
149
5.3. Theorem (Crandall—Liggett). Assume that A is a dissipative operator on X, which satisfies the range condition (5.5)
dom A c range(J — \A)
for sufficiently small A > 0.
Then there exists a strongly continuous semigroup S(t), t > 0, of contractions on dom A. Moreover, for x G dom A we have the exponential formula (5.6)
S(t)x = lim(7 — XA)~^'
'x
uniformly on bounded t-intervals
and, for x G dom A, the estimate (5.7)
\S(t)x-S{s)x\<\t-s\\\Ax\\,
t,s>0.
Proof. From (5.5) we see that dom J\ D dom A. Choose x G dom A, 0 < // < A and set am,n = \J™x- J"x|,
m,n = 0 , l , . . . .
Using Theorem 1.10, (i) and (iii), we get o-o,n = \x- J™x\ <\x - J\x\ + \J\x - J\x\ + • +
ur'x - j?x\
n = 0,1,... .
Of course, we have also am,o < mfi\\Ax\\, ra = 0 , 1 , . From Theorem 1.10, (iv), we get \J™x - J^x\ = J™x — Jp \T^x <
•T^-f-T1*-
_1 < -U,? "A I - M
= aam-i
t/\
-A
^
X \ ~T~
-i •
x
^
7
J\x)
. ;
A
+ (1 - a)a m _ 1 ) T l ,
I u,,
re
X
J \ X|
m, n = 1,2,...,
where we have set a — fi/X. For m = [i//i] and n = [i/A], £ > 0, we have An — [im < t — (t — fi) = fj,,
X2n < Xt
and
Xfim < Xt.
Using Lemma 5.2 we get the estimate \jWrix - 4/X]x\
(5.8) This implies that jf We set (5.9)
< 2(ti2 + Xt)V2\\Ax\\.
x converges uniformly on bounded t-intervals as A 4- 0.
S{t)x = \imJlZ/X]x,
t>Q,x€domA.
150
C h a p t e r 5. Nonlinear
Semigroups
of
Contractions
Now we choose x G domyl and (xn) c dom A with xn —> x as n —• oo. Then the estimate (note that J\ is a contraction, see Theorem 1.10)
< I rl'/A] — A 2^ "\X
_
7 l*/A]
A Xn | T
,L
n\
J^
I , I 7 [t/A] _ 7[t/M] I , | 7[t/M] _ i 1"^ ^n ^*u ^n] ~ |"u ^n Xn
J„
7[t/M]Ti
"M
^\
^-71 j
shows that J^'x'x converges uniformly as A | 0. Thus (5.9) defines S(t)x also for x G dom A It is obvious that S^O)^ = x for all x G dom A. Choose t, s > 0 and x € dom A. From (5.8) we get for ix \. 0 the estimate \S(t)x - J[{/X]x\
<2X1/2t1/2\\Ax\\.
For z G dom A we set x = j | s ' 'z G dom A. This and the last estimate imply (5.10)
\S(t)j[s/x]z
- Jlf/X]j]?/X]z\
< 2\1l2tl'2\\AJ^IX]z\\
< 2A 1 /2 t V 2 ||Az||.
The estimate ||AJ"z|| < \\Az\\ for z G dom A and n = 1,2,..., follows from A\J"~xz G AJ£z (see Theorem 1.10, (ii)), which implies
HA/MI < lA.J^zl, and (see Theorem 1.10, (i) and (iii))
Wr'A
= \\Jnx* - JrlA < \\J^ -A< WMY
Since [{t + s)/X] — ([t/X] + [s/X]) equals either 0 or 1, we have (5.11)
| j f + s ) / A I z - j f X ] j]?/x]z\ < \Jxz -z\<
X\\Az\\.
From (5.10) and (5.11) we get \S{t + s)z - S{t)S{s)z\
< \S(t + s)z -
jf+s)/X]z\
+
\^t+s^Z-4/X]j{s/X]z\
+
\j[f/X]J[;/x]z-S(t)jMx]z\
+
\S{t)j[s/x]z-S(t)S(s)z\
< \S(t + s)z - 4t+s)/x]z\
+ X\\Az\\ +
+ \j)?/X]z-S(s)z\->0
asA|0.
2X1/2t1'2\\Az\\
This proves S(t + s)z = S(t)S(s)z for z G dom A. Since the operators S(t) are contractions on dom A, the semigroup property follows by a density argument.
5.1. Generation
of nonlinear semigroups
151
In order to prove strong continuity we first choose x € d o m A Theorem 1.10, (in), we see that \J[x/X,]x -x\<
[t/X\\Jxx -x\<
From
t\\Ax\\
so that \S{t)x-x\
t>0,
xedomA.
Using this and the contraction property of the operators S(t) we get for 0 < s < t and x e dom A the estimate \S(t)x - S{s)x\ < \S(t - s)x -x\<(t-
s)\\Ax\\,
which proves (5.7). For x £ domA we choose (xn)nen C domA. satisfying limn_>.oc, xn = x. Given e > 0 we choose no € N such that \x — xno | < e/4 and then 5 > 0 such that £||Az no || < e/2. This implies \S(t)x - S(s)x\ < \S(t)x - S(t)xno\
+ \S(t)xno - S{s)xno\ + \S(s)xno - S{s)x\
< 2\x - xno\ + \t - s\ \\Axno\\ < e/2 + e/2 + e, i.e., the mapping t —> S(t)x is continuous on [0, oo).
D
In view of the exponential formula (5.6) we say that A generates the semigroup S(t), t > 0. For general w-dissipative operators we have the following generation result: 5.4. Corollary. Let, for some u 6 R, A be an w-dissipative operator on X satisfying the range condition (5.5). Then there exists a strongly continuous semigroup S(t), t > 0, of type u on domA, which is given by the exponential formula (5.6). For x € domA and 0 < s < t we have the estimate
Proof. We first observe that A — LOI is dissipative and satisfies also (5.5). Therefore A — col generates a strongly continuous semigroup S(t), t > 0, of contractions on dom(A — u>I) = domA. Moreover, we have S{t)x = lim(J - A(A - col))
-[t/A] [/
*x,
t>0,
x e dom A.
A4-0
From limA4.0(l + Aw)"[*/AJ = lim A i 0 (l + Aw)-
= (1 + Au;)-1*/Al (i - — ^ — V
1 - j - ALU
AY^^X,
x e dSnlA,
/
we see that /
(5.13) v
y
lim [I Aio V
\
\-[t/A]
1+
\LO
_
x = ebjtS(t)x,
—A )
w
t>0,x£domA. ~
Chapter 5. Nonlinear Semigroups of Contractions
152
We set S(t) = ewtS{t), t > 0. Then S(t), t > 0, is a strongly continuous semigroup of type w on dom A For /i = A/(l + Aw) we have t/X = t/fi — wi. Using the fact that [a — (3} equals either [a] — \(3] or [a] — [/?] — ! we get V
-[t/X]
A 1 + Aw
= (I - fiA)m{I - tiA)- •WiA.
x = (I- iiA^^-^x
or, equivalently, I
X
A \ - V[t/X]
-\t/iA,
where m is either [ujt] or [wt] + 1. From Theorem 1.10, (iii), we see that limA,j.o Jxx = x for all x £ dom A For x £ dom A we choose {xn) C dom A with limn-^oo Using Theorem 1.10, (i), we have the estimate \J\x~x\ < \Jxx-J\xn\ + \J\xn-xn\ + \xn-x\ < {\ + (l-\w)-x)\x-xn\-\-\Jxxn-xn\, which shows that (5.14)
lim J\x = x
for all x £ dom A
AJ.0
The estimate (/-MA)-m(/
-[t/x] 1 +Aw ' )
x - S{t)x
A < (7-^A)- m (7- T ^-Aj
[t/x\
x - (I -
nA)-mS{t)x
\{I-nA)-mS{t)x-~S\t)x\
+
(
A
\ -[*/A]
< (1 - M 771 — 1
+ X ) (1 - l>u)~k\(I - nA)-lS{t)x
- S{t)i
fe=0
together with (5.13) and (5.14) shows that lim(J - iiA)-[t/^x
= S(t)x,
t > 0,
x
£ domA
In order to prove (5.12) for x € dom A and 0 < s < t we proceed as in the proof of Theorem 5.3. For x e dom A we get using Theorem 1.10, (i) and (iii), J
[t/X]
X —X
<
(1 - Aw)!*/*) I Aril. w(l - Aw)[*/A]
This implies, for A 4- 0, |S(*)a: — ar| < — (e4"* — l)||yla;||.
5.2. Cauchy problems with dissipative operators
153
From this we get \S(t)x - S(s)x\ = e*"\S(t - s)x ~x\<
-(e'" -
e"s)\\Ax\\.
The result follows if we observe that uj~1(eu}t — e ws ) < (t — s)e"" in case w > 0 and <{t — s)e"s in case to < 0. •
5.2.
Cauchy problems with dissipative operators
In this section we investigate the connection between semigroups of contractions and abstract Cauchy problems with dissipative operators. Let A be an operator on X and choose io £ I . We consider the following abstract Cauchy problem: (5.15)
Jtu(t)
e Au(t),
t>0,
u(0) = x0. The following two solution concepts will be important: 5.5. Definition. Let T > 0 be given. a) A continuous function u : [0, T] —> X is called a strong solution of (5.15) on [0, T] if and only if the following is true: (i) u(0) = x0. (ii) The function u is Lipschitz continuous on [0, T] and strongly differentiable a.e. on [0,T]. (iii) We have u(t) £ domA a.e. on [0,1] and (d/dt)u(t) G Au{t) a.e. on [0,T]. b) Let w € l b e given. A continuous function u : [0, T] -> X with u(0) = XQ is called an integral solution of type w of (5.15) on [0, T\ if and only if u satisfies (5.16)
\u(t) - x\ - \U(T) - x\ < I (<*>|w(s) - x\ + (y,u(s) - x)+) ds
for all [x, y]<=A and r, t G [0, T] with r < i. 5.6. Theorem. Let A be a dissipative operator on X. Then strong solutions of (5.15) are unique. If A satisfies also the range condition (5.5), then every strong solution u : [0,oo) -> X of (5.15) with x0 G domA is given by u{t) = S{t)x0,
t > 0,
where S{t), t > 0, is the strongly continuous semigroup of contractions generated by A.
Chapter 5. Nonlinear Semigroups
154
of
Contractions
Proof. We first prove uniqueness of strong solutions of (5.15) provided the operator A is dissipative. Let U\,U2 be two strong solutions of (5.15) on t > 0. Lipschitz-continuity of u\, u2 implies that also the scalar function \ui{t)—u2(t)\ is Lipschitz-continuous on t > 0 and hence is differentiable a.e. on t > 0. By Proposition 1.4 we have — \uAt) - u2{t)\ = (u[{t) - u'2{t),Ui(t) - u2{t))at
a.e. on t > 0.
Dissipativity of A and u'^t) £ Aui{t) a.e. on t > 0 implies (d/dt)\u1(t)—u2(t)\ < 0 a.e. on t > 0 and consequently \u\(t) — u2{t)\ = 0. We fix T > 0 and set ux(t) = Jl{/X]x0, 0<\
>XQ, t > 0, XQ G domA,
the limit being uniform for t in bounded intervals. We have to show that S{T)x0 = limxi.o'U'A(r) = u(T). For the function 9\(t) = j (u(t) - u(t - A)) - u'(t)
a.e. on [A, T]
we have lim^o 3A {t) — 0 a.e. on t > 0. Let M be a Lipschitz constant for u on [0, T]. Then we have also |<7A(*)| < 2M a.e. on [A,T]. Therefore Lebesgue's dominated convergence theorem implies (5.17)
lim /
\gx(t)\dt = 0.
•M-0 J\
From u(t - A) + \g\(t) = u{t) - \u'{t) £ (I - \A)u(t) u(t) = Jx(u(t-\)
a.e. on [A, T] we get
+ Xgx(t)).
This gives (using also the fact that J\ is a contraction and that [t/X\ — 1 [(i-A)/A]) |u A (t) - u(t)\ = \j[t/x]x0
- Jx{u(t - A) + Xgx(t))\
< \ux(t -X)-u(t-X)\
+ X\gx(t)\
a.e. on [A, T\.
5.2. Cauchy problems with dissipative operators
155
Integrating from A to T gives i-T
\ f A A
\ux(t)-u(t)\dt<\
_ _ JT-X
f \ux{t)-u(t)\dt+
A
„
I
JO
\gx{t)\dt
Jx
< j [ \ux{t) -
S(t)x0\dt
(5.18) + - / |5(t)a;o-a;o|dt A Jo +
^A ,/" \x0-u(t)\dt + J \gx{t)\dt.
Since u.\(i) ->• S(t)xo uniformly on [0,T] as A 4- 0, we see that the first integral on the right-hand side of (5.18) tends to zero as A J, 0. The estimate (1/A) J0 |S(£)a:o — a?o| dt < max0
rT
iA / (5.20)
•,
\ux{t) - u{t)\dt > \ux{T) - u(T)\ - \
A
JT-X
- \A f
rT
f
\ux(t) - ux{T)\ dt
JT-X
\u(T)-u(t)\dt.
JT-X
Using Lipschitz continuity of u we get for the third term on the right-hand side of (5.20) the estimate i rT M \u{T)-u{t)\dt<—X^0 as A | 0 . 2 A JT-X For the second term on the right-hand side of (5.20) we have \A [
JT-X
\ux(t) - ux{T)\dt <\
A
I
\ux{t) - S(t)x0\dt
+ \ux(T) -
S(T)x0\
JT~X
+
max
\S(t)xQ -
S(T)x0\.
T-X
Since we have ux(t) = Jx XQ -» S(t)xo uniformly on [0,T] as A 4- 0 and t -» S(t)xo is continuous on [0, T], we conclude that limi / \ux{t)-ux{T)\dt Ho A JT-X
= 0.
156
Chapter 5. Nonlinear Semigroups
of
Contractions
Therefore we get from (5.19) and (5.20) the desired result limux(T)
= u(T).
• If the semigroup S(t), t > 0, is generated by A on dom A, then the functions t —> S(t)xo are in general not strongly differentiable. There exist examples of dissipative operators A satisfying the range condition (5.5) such that the functions t —> S(t)xo are not differentiable for any XQ G dom A (see [Cr-L, Section 4]). This means also that in general the Cauchy problem (5.15) does not have a strong solution for any XQ G dom A. However, it will be shown that S(t)xo is the unique integral solution of (5.15). In order to prove such a result we need the following lemma. 5.7. Lemma. Let A be an u>-dissipative operator on X satisfying the range condition (5.5) and S(t), t > 0, the semigroup on dom A generated by A. Then, for any XQ € dom A, [x,y] G A and t > r > 0, we have (5.21)
\S{t)x0 - x\2 - \S{T)X0 - x\2 < 2 / (w\S(s)x0 - x\2 + (y, S(s)x0 - x)s) ds
or, equivalently, (5.22)
\S{t)x0 -x\-
\S{T)X0 - x\ < / (w\S{s)x0 -x\ + (y, S(s)x0 - x}+) ds.
In addition we have, for any f G F(xo — x), limsupRe(5(*)a:°~Xo,/\ < tio \ t I Proof. According to Corollary 5.4 we have (5.23)
S(t)xo = lim J[' A|0
J
a;0,
CJ\X0 -
x\2 + (y,x0 - x}s.
XQ € dom A,
t>0.
For x0 G dom A, A G (0, l/|w|) and k = 1,2,... we have (see Theorem 1.10, (5.24)
yXtk := - (j£x0 -
J^XQ)
=
AXJ^XQ
€
AJ^x0.
We choose [x, y] G A. Since A is w-dissipative, there exists an / G F(J^xo - x) such that (5.25)
Re(yx,k
-y,f)<
^ x
0
- x\2.
5.2. Cauchy problems with dissipative operators Using / G F(Jfao
157
- x) and t h e definition of y\^ we get
Re(2/A,fc, f) = J Re( Jjfco - a; - ( J * _ 1 z 0 - i ) , / ) = i R e ( | JAfcx0 - * | 2 - ( J ' - ^ O - x, / ) ) > T - d J ^ O -X\2 A
- \J*X0 -X\ |JI~XXQ - X\)
y^jfro-xf-lJ^xo-xf). This together with (5.25) implies | J * x 0 - * | 2 - \Jkx-xx0
- x\2 < 2ARe( 2A , fc - j / , / ) + 2ARe< 2 / ,/} < 2 A ^ | J ^ 0 - a ; | 2 + (y, J J ^ o - z ) s ) ,
where we have also used Lemma 1.3, c). Since we have j | t / A ] = j £ for t e [fcA, (fc + 1)A), t h e last estimate can also be written as | JxX0 - x\2 - | J^xo
- x\2 /•(fc+l)A < 2 / (w| j| t / A 1 a;o - z | 2 + (y, j | ' / A ] a : o - z ) ) dt.
Summing up these inequalities for k = [r/A] + 1 , . . . , [t/X] we obtain \Jl*/x]x0-x\2-\4/x]x0-x\2 r([t/\]+l)X MLVAJ + iJA < 2 / (w| J r
(5.26)
A)
x 0 - a f + (y, J[s/*]x0
- x).) ds.
'([T/A] + + 1)X 1)A J(\T/X]
Since l i m ^ o J\ XQ = S(s)xo uniformly on bounded s-intervals (see Corollary 5.4), there exist positive constants Ao, M such t h a t | j | s ' JXo| < M for 0 < A < Ao a n d 0 < s < t + 1. We can take M = maxo< s
+ \x\),
0 < A < Ao, 0<s
+ l.
It is obvious t h a t t h e left-hand side of (5.26) has t h e limit |<S'(t)a;o - x\2 \S(T)XO — X \ 2 as A I 0. Observing also t h a t ]im\io[t/\]\ = t and limAj.o[7"/A]A = r we get f({t/\]+i)\
lim / AJ
-° -/([T/A] + 1)A
v\J[s/
(t x0 - x\2ds = I w\S(s)x0
l
A-
-
x\2ds.
158
Chapter 5. Nonlinear Semigroups
of
Contractions
In view of the bound (5.27) we can apply Lebesgue's dominated convergence theorem to the second term on the right-hand side of (5.26). This and upper semi-continuity of (•, -)s imply ,([t/A] + l)A
limsup / A|0
,t
(ViJ\
xo - x) ds <
l)> 7/([r/A] ([T/A] + + 1)A
S
\imsup(y,J^' JT
< /
'xo — x) ds S
A|0
(y,S(s)x0-x)sds.
Thus taking the limsup as A I 0 in (5.26) we get the desired inequality (5.21). In order to prove equivalence of (5.21) and (5.22) we first assume that XQ € d o m A According to Corollary 5.4 the function t -> \S(t)x0 - x\ is Lipschitz continuous on t > 0. Then by Lemma A.2, a), for r(t) = \S(t)xo — x\ and g(t) — u>\S{t)xo - x\ + (y,S(t)x0 — x}+, we see that (5.21) implies (5.22). Note that g(t) = \y\ > 0 if r(t) = 0. For xo € dom A we choose a sequence (xn) C dom A with lim„_>00 xn = XQ. Since (5.21) is true for all n, we have also (5.22) for all n. Taking n - > o o w e get (5.22) for x0. If on the other hand (5.22) is true, then (5.21) follows immediately by Lemma A.2, b). In order to prove (5.23) we choose / £ F{xo — x) and get Re(S{t)x0
- xo, f) = Re{S(t)x0
- * , / ) - \x0 - x\2
< \S(t)xo — x\ \xo — x\ — \XQ — x\2 <
2
h\S(t)x0-x\2-\x0-x\2).
This and (5.21) for r = 0 imply (5.28)
Re(S(t)x0
- x0, f) < f (u>\S(s)x0 - x\2 + (y, S{s)x0 - x) ) ds. s
Jo
By continuity of s —^ S(s)xo we have l i m - / w\S(s)xo - x\2ds = ulxn - x\2. 40 t J0 We choose e > 0. Since (•,•)« is upper semi-continuous, there exists a to = £o(e) > 0 such that (y, S(s)x0 - x)s < (y, x0-x)s+e,
0 < s < t0(e).
This implies T1 / (y, S{s)x0 - x)sds <- I ((y, x0 - x)s + e) ds = (y, x0 -x)s Jo t Jo
+e
5.2. Conchy problems with dissipative operators
159
for 0 < t < to(e) and consequently 1 f* l i m s u p - / {y,S(s)x0
-x)sds
< {y,x0
-x)s.
Therefore (5.23) follows from (5.28).
•
5.8. Theorem. Assume that A is an w-dissipative operator on X satisfying the range condition (5.5). Let S(t), t > 0, be the strongly continuous semigroup of type u> on dom^l generated by A. Then the following is true: a) For any XQ G AomA, the function u(t) = S(t)xo, t > 0, is an integral solution of (5.15) of type w. b) Any integral solution v(-) of (5.15) is of type CJ and \u{t) - v(t)\ < e^luifi) - v(0)\, where u(t) = S(t)u(0), t>0,
t>0,
u(0) G dom A
c) For any XQ G domyl, there exists a unique integral solution. solution is of type u and is given by u(t) = S(t)xo, t > 0.
This integral
Proof. Statement c) is a straightforward consequence of statements a) and b). Statement a) follows from Lemma 5.7. In order to prove statement b) we set XQ = u(0) and define yx,k G AJ^xo, A G ( 0 , 1 / M ) , k = 1,2,..., by (5.24). Let v be an integral solution of (5.15) of some type w and set wo = max(w,w). Then u and v are also integral solutions of type UJQ. From (5.16) with [x, y] = [Jxxo,V\,k] ( a n d v(-), o/o instead of «(•), w) we get, for 0 < r < t,
(5.29)
\v(t) - j£x0\ - \V{T) - j£x0\ ft
< / FromAt/A,fc = -(v(s)-Jxcx0) we get (\y\,k,v{s)
- Jxx0)+
(LJO\V(S)
+ (v(s)-Jx*
- j£x0\ + (y\,k,v(s) 1
a;0) and (-x+y,x)+
= -\v{s) - J^x0\ + (v{s) - J^xo^is) < -\v(s)
- Jxx0)+J
ds.
= -\x\ + (y,x)+ -
J£x0)+
- J£x0\ + \v{s) - J j ^ z o l -
This and (5.29) imply X(\v(t) - J£x0\ - \V(T) < / (\w0\v(s)
J*x0\) - JxX0\ - \v(s) - JxX0\ + \v(s) - J^ _1 a;o|) ds.
160
Chapter 5. Nonlinear Semigroups of Contractions
We choose t > f > 0. Summing up the above inequalities for k = [f/A] + 1 , . . . , [i/X] we get flt/X\\v(t) ./[f/A]
- j]T/A1Xo| - \V(T) - Jl:/X]xQ\)
V
da J
ct
- J[Z/X]x0\ + \v(s) -
< f (-\v(s)
4/X]x0\
f[i/X] k/AI \ /' f / A ] u>o\v(s) — J-f' xo\do-)ds. J\t/X\ ' .[a/A] Using J}CT/ ->• S{O)XQ = u(a) uniformly on bounded intervals and [f/A] -> f, [f/A] —> i as A 4- 0 the last inequality implies
+
j\\v(t)-u(a)\-\v(r)-u(a)\)da (5.30)
+ /" (\v(s) - u{t)\ - \v{s) - u(f)|) ds <w0
/ |u(s) — u(cr)|dcr(is.
For /i > 0 and i > 0 w e define Fh(t) by -i
ft-\-h
Fh(t) = -jpl
pt-\~h
I
\v(s) -
u(a)\dads.
Then (5.30) shows that (d/dt)Fh(t) < uj0Fh(t), t > 0, i.e., we have Fh{t) < eWotF/j(0). Since v(-) and u(-) are continuous, we obtain, for h 1 0 the estimate (5.31)
\v(t)-u{t)\
<e w o t |w(0)~t<(0)|,
t > 0.
If we take u(t) = S(t)v(0), then w(i) is an integral solution of (5.15) of type ui and (5.31) implies v(t) = u(t), i.e., v is also of type u>. Consequently we have UQ = UJ in (5.31). D 5.9. Theorem. Assume isfies the range condition semigroup of contractions and to > 0, the function t
that A is a closed dissipative operator on X and sat(5.5). Let S(t), t > 0, be the strongly continuous on domA generated by A. If, for some x G domA —> S(t)x is differentiable at to, then
S(t0)x €domA
and
—S(t)x
\t=toe
and
— S(t)x \t=toe
AS(t0)x.
Moreover, we have S(t0)x£domA°
A°S(t0)x.
5.2. Cauchy problems with dissipative operators
161
Proof. We set y = (d/dt)S(t)x | t==to and, for A e (0, t0), a(A) - Xy + S(to — A)x — S(to)x. According to our assumption we have lim^o Q ( A ) / A = 0. The range condition (5.5) and S(*o - A)a; e dom A imply that there exists [£A,2/A] G -A such that S(to — A)a; = xx — \y\ and consequently (5.32)
X{y - yx) = S(t0)x -xx+
a(X).
From (5.23) with [xx,yx] instead of [x,y] and S(to)x instead of xo we obtain (note that ]imtio(l/t)(S(t)S(t0)x - S(t0)x) = y) (5.33)
Re(y, f) < w\S(t0)x - xx\2 + (yx, S(t0)x -
xx)s
for all / € F(S(to)x — xx). According to Lemma 1.3, c), we can choose / G F(S(to)x - xx) such that in addition Re(yx,f) = (yx,S(t0)x - xx)s. This and (5.33) give
Re^-t/A,/) which together with (5.32) implies \S(t0)x - xx\2 = (S(t0)x -xx,f)<
Xw\S(tQ)x -xx\2-
Re(a(A), / ) .
From this we get (observe | / | = \S(to)x — xx\) {1 - Xw)\S(t0)x - xx\ < \a(X)\, which implies limA^o^A = S(to)x and also
lim-(s(t0)x-xx)
=0.
This and (5.32) show that lim^o yx = y. Since A is closed, we have [S(to)x, y] € A, which proves the first assertion of the theorem. By Theorem 5.3 we have \S(t0 + X)x - S(t0)x\ < A||AS(t0)a:||,
A > 0,
which shows that \y\ < \\AS(to)x\\. Since y e AS(to)x, it follows that S(to)x e dom A 0 and y £ A°S(t0) x (see Definition 1.18). • 5.10. Proposition. Let A be a dissipative operator on X satisfying the range condition (5.5) and S(t), t > 0, be the strongly continuous semigroup of contractions on dom A generated by A. Then the following is true: a) For any x € dom A we have lim \A\x\ = liminf -\S(t)x AJ.0
(|0
- x\.
t
b) For x G dom A we have lim^o \Axx\ < oo if and only if there exists a sequence (xn) c dom A such that lim„_+00 xn = x and supra | | A E „ | | < oo.
162
Chapter 5. Nonlinear Semigroups of
Contractions
Proof, a) Choose x G dom A. According to Theorem 1.10, (v), the function A —> \A\x\ is monotonically decreasing on A > 0, so that lim^o \Axx\ exists (possibly being oo). Prom Theorem 1.10, (i), and the definition of A\ we get I J[xt/X]x -X\<
[t/\]\\Axx\
< t\Axx\.
t > 0.
This implies (for A I 0) \S(t)x-x\
< tlim\Axx\,
t>0,
and consequently liminf — \S(t)x — x\ tio
t'
w
<\im\A\x\.
' ~ A4.0 '
'
In order to prove the converse inequality we conclude from Lemma 5.7 that, for [u, v] <E A and / € F(x — u), l i m s u p ( - - | 5 ( i ) a ; - x\ \x - u\) < limsupRe(-(5(t)a; - x),f) If we choose u = J\x and v = A\x G AJ\x, -XAxx)
we get (observe that x — u =
limsupf—-|5(t)a; - x|)A|AAa;| < -X\Axx\2, t|0
V
*
< (v,x - u)s.
A > 0,
'
which implies \A\x\ < - l i m s u p ( - - | 5 ( t ) a ; - a ; | ) = liminf -\S(t)x tio ^ * ' '4-0 t
- x\,
A > 0,
so that lim^o \Axx\ < liminiV|,o(l/i)|S'(£)a; ~ x\b) Choose x G dom A and assume first that limA4.o \Axx\ < oo. By definition of Ax (see (1.13)) we have \JXx - x\ < \\Axx\
->• 0 as A | 0 .
We set xn = J\/nX, n — 1,2,... . Then xn e dom A, n = 1,2,..., and lim„^oo xn = x. From Theorem 1.10, (iii), we see that Ai/nx G AJi/nx = AxnTherefore we have ||Ax„|| < |j4i/ n a;| and consequently sup || Ac„|| < sup |Ai/„x| < oo. n
n
Next we assume that there exists a sequence (xn) C dom A such that lim„_y
oo xn — 2- and M — sup n ||j4a;n|| < oo. From Theorem 5.3 we get \S{t)xn-xn\ so that (l/t)\S(i)x
<Mt,
t > 0 , n = l,2,... ,
- x\ — lim n _ >00 (l/t)|5(t)a; n -xn\<M,t> lim|A A x| — liminf -\S(t)x - x\ < M. AJ.0
t|0
(
0. This implies D
5.3. The infinitesimal
generator
163
The following theorem in some sense is a converse to Theorem 5.6. 5.11. Theorem. Let A be a dissipative operator on X satisfying the range condition (5.5) and S(t), t > 0, be the strongly continuous semigroup of contractions on domA generated by A. a) If xo £ domA and t —> S(t)xo is differentiable a.e. on t > 0, then u(t) = S(t)xQ, t>0, is the unique strong solution of (5.15) on t > 0. b) Assume in addition that X is reflexive. Then u(t) = S(t)xo, t>0, xo G domA is the unique strong solution of (5.15) on t > 0.
for any
Proof. Uniqueness of strong solutions is clear by Theorem 5.6. In order to prove statement a) of the theorem we set u(t) = S(t)xo, t>0. Then u is differentiable a.e. on t > 0 by assumption and Lipschitz-continuous by Theorem 5.3. From Theorem 5.9 we see that u'(t) £ Au(t) a.e. on t > 0. Thus u is a strong solution of (5.15) on t > 0. If X is in addition reflexive and XQ € domA, then u(t) = S(t)x0 is Lipschitz-continuous on t > 0 by Theorem 5.3 and thus differentiable a.e. on t > 0. Then the result follows from statement a). •
5.3.
The infinitesimal generator
In the following let X0 be a closed subset of X and S(t), t > 0, be a strongly continuous semigroup of type u> on Xo- We set
A(h) = ^-(S(h)-l),
h>0.
The following properties of the operators A(h) will be required below: 5.12. Lemma. Let Xo be a closed convex subset in X and S{t), t > 0, be a strongly continuous semigroup of contractions on XQ. Then the following is true: a) The operators A{h), h > 0, are dissipative with range(I - XA(h)) D X0 - dom A(h),
A > 0.
b) The resolvent operators J\,h = (I—AA(/i))_1, A > 0, h > 0, are contractions on Xo and satisfy limxi.o J\,h% = x for h > 0 and x € X0. Moreover, we have (5.34)
Jx,hx = -j—rx
+ ——j-S(h)Jx,hx,
x £ X0, A > 0, h > 0.
164
Chapter 5. Nonlinear Semigroups
of
Contractions
Proof, a) Let x,y G XQ and choose / G F(x — y). Then we have (using also the contraction property of S{h)) Re(A(h)x - A(h)y, f) = ± (Re(S(h)x
- S(h)y, f)-\x-
y\2)
2 < \(\S{h)x-S{h)y\\x-y\-\x-y\ )
1 <-ji{\x~y\2-\x-y\2)=Q, which proves dissipativity of A(h). Fix x £ Xo and A > 0. We define the operators U : X0 —>• X0 by Uz = —-S{h)z + ——x, ZGX0. \ +n A+ a Note that Uz G XQ for z G XQ by convexity of XQ. The estimate \Uz — Uw\ < A(A + h)~1\z — w\, z,w £ XQ, shows that U is a contraction on the complete metric space XQ and therefore has a unique fixed point ZQ 6 XQ. This fixed point satisfies (A + h)zo = \S(h)zo + hx or, equivalently, (/ — XA(h))zo = x, which proves x G range(7 — \A(h)). b) The properties of J\th follow immediately from Theorem 1.10 applied to A(h). Equation (5.34) is just a restatement of the fixed point equation for J\,h.x• 5.13. Definition. The strong resp. weak infinitesimal generator As resp. Aw of S(t), t > 0, is defined by domj4 s = {x G XQ I lim A(h)x exists}, /iiO
Asx = lim A(h)x, no '
a; 6 d o m i .
resp. by domAw = {x G XQ I w4im A(h)x exists}, Awx = w-iim A(h)x,
x & domAw.
hiO
Furthermore, we define D = { i £ X 0 | Hminf \A(h)x\ < oo}. It is obvious that A w is an extension of As. 5.14. T h e o r e m . Let S(t), t > 0, be a strongly continuous semigroup of contractions on XQ . Then the following is true: a) For all x\,X2 G dom Aw and all x* G F(x\ — X2) we have Re(yl w xi - Awx2,x*)
< 0.
5.3. The infinitesimal
generator
165
In particular this means that the generators A w and As are strictly dissipative. b) If X is reflexive, then dom As = domA w = D. c) If X is reflexive and strictly convex, then dom A w = D. If, in addition, X is uniformly convex, then dom A w = dom As = D
and
Aw = As.
Proof, a) For x\, x2 G XQ and x* G F(x\ — X2) we have Re(A{h)xi-A(h)x2,x*) (5.35)
= -r\Re{S{h)xi
- S{h)x2,x*)
- \xi - a;2|2J
< I (\S(h)xi - S{h)x2\ \xi - x2\ - \xt - x2f)
< 0.
If x\, x2 G dom A w , then the result follows by taking h l 0. b) It is clear that domA s C domA w c D. Let x G D be given. It suffices to show that x G dom A s . In view of the definition of D there exists a monotonically decreasing sequence (tk) with tk —> 0 as k -4 00 and a constant L > 0 such that \S{tk)x - x\ < Ltk, fc = l , 2 , . . . . For h > 0 we set nk — [h/tk], which implies 0 < h — nktk
= \S(h - nktk + nktk)x
< \S{h - nktk)x
-x\ + \S(nktk)x
< \S(h — nktk)x
- x\ +
< \S{h - nktk)x
~x\ + hL,
= l,2,...
.
- x\
- x\
nktkL h > 0, k = 1,2,... .
If we take k —> 00 we see that the function t —> S(t)x is Lipschitz-continuous on t > 0 and, by reflexivity of X, also differentiable a.e. on t > 0. But S(t)x G domA s whenever (d/dt)S(t)x exists. Hence we have S(t)x G domA s a.e. on t > 0 and x G dom As by strong continuity of S(t). c) Assume that X is reflexive and strictly convex. Choose XQ G D and let Y" be the set of all y G X such that there exists a sequence (tn) of positive numbers such that limn-xx, tn = 0 and y = w-lim n _ +00 (l/i n )(5(£ n );ro - a;0). We define the subset A C X x X by A = AsU{{x0,y)
\y<=coY}.
166
Chapter 5. Nonlinear Semigroups of Contractions
From statement a) we get Re(AsXi — Asx2,x*}
< 0,
Xi,x2 G domvl s , x* e F(xi — a;2).
Using (5.35) we see also that, for x\ G dom As, y EY and x* G -F(xi — zo), we have (5.36)
Re(AsX!-y,x*)<0.
For j / S c o F w e have the representation y = YlT=i ajVj' Vj EY, 0 < a>j < 1, X^=i ai = *' s o t ^ i a t (5-36) for 2/j, j = 1 , . . . , m, implies 771
( A ^ i - y,x*) = ^2OLJ{ASXI
- yj,x*) < 0
j=i
for all ^i G domA s and a;* G F(X\-XQ). A density argument shows that (5.36) is also true for y G coY. This proves that A is dissipative. Since XQ G D, the proof of statement b) shows that t —> S(t)xo is Lipschitz-continuous and therefore by reflexivity of X differentiable a.e. on t > 0. By definition of As this implies (5.37)
-ftS^Xa
= A S t x
^ () o
e
AS(t)x0
a.e. on t > 0.
Since t -* S(t)x0 is Lipschitz-continuous on t > 0, the same is true for the scalar function t -4 \S(t)xo — XQ\- Hence (d/dt)\S(t)xo — #o| exists a.e. on t > 0. By dissipativity of A we have a.e. on t > 0 the estimate Re(-jT(5(i)a;o - x0),x*^
< Re(y,x*},
y G Ax0, x* G F(5(vi)a;o - x0)
(note that (d/dt)S(t)x0 G AS(t)x0 a.e. on f > 0 by (5.37)). From Proposition 1.4 and Lemma 1.3, c), we conclude that a.e. on t > 0 \S(t)x0 - x0\ — \S(t)x0 - x0\ = / — (S(t)xQ - x0), S(t)x0 - x0 < Re(jt(S(t)x0 - so), **) < Mv, O < \y\\S(t)x0
-xQ\
for y G Aaro, £* G F(S(t)xo - x0). This implies — \S(t)xo — XQ\ < ||AEO||
a.e. on t > 0
and consequently (5.38)
|5(t)i 0 -a:o|<*||ABoll,
* > 0-
Since Azo = c o F is a closed convex set and X is strictly convex and reflexive, there exists a unique yo G AXQ such that |j/o| = H-A^oll- For any
5.3. The infinitesimal
generator
167
y £ Y there exists a sequence (tn) of positive numbers with tn ->• 0 and wlimn_>oo(l/*n)(S,(t„)a;o - x0) = y. This and (5.38) imply \y\ < liminf — \S(tn)x0
- x0\ < \\Ax0\\.
Thus we have shown that AXQ = {yo}, i.e., xo G dom Aw and yo = Awx0. This proves D = dom Aw. Assume now that X is also uniformly convex and choose x$ G dom Aw = D. We set 2/o = w4im -{S(t)x0 tio t This implies |j/o| < ]im'mitio(l/t)\S(t)xo
- a;0).
- x0\. From (5.38) we get
limsup(l/i)|5(t)a; 0 - x0\ < \\Ax0\\ = \y0\t]fi
Thus we have |j/o| = limtj.o(l/*)|5'(t)a;o — a;o|. By uniform convexity we get yo = limt4.o(l/*)(5(*)a;o - xo), i.e., x0 & d o m 4 s and y0 = Asx0. • 5.15. Theorem. Assume that X and X* are uniformly convex. Let Xo be a closed subset of X and S(t), t > 0, be a strongly continuous semigroup of contractions on Xo. Denote by As the infinitesimal generator of S(t), t > 0. For any x £ dom As the following is true: a) S(t)x € dom As for all t > 0, the function t —> S(t)x is Lipschitz-continuous on [0,oo) and the function t —> AsS(t)x is right-hand continuous on [0, oo). b) (d+ /dt)S(i)x exists for allt>0 and d+ —S(t)x
= AsS{t)x,
t > 0.
c) The derivative (d/dt)S(t)x exists and is continuous on [0, oo) with the exception of at most a countable subset. Proof. By Theorem 5.14, c), we have domA s = D. We choose x G domA s , i.e., we have lim^o A(h)x = Asx. This and the contraction property of the operators S(t) imply that, for any t > 0, liminf \A(h)S(t)x\ h-10
< lim \A(h)x\ = \ABx\. h\.0
Consequently we have S(t)x G D = domAs for any t > 0. We set y(t) = (d+/dt)S{t)x. Then it is clear that (d+/dt)S(t)x = AsS{t)x, t > 0. Thus we already have shown that statement b) is true.
168
Chapter 5. Nonlinear Semigroups
of Contractions
In order to complete the proof for statement a) we have to show that t —*• y(t) is right-hand continuous on [0,oo). The estimate i | 5 ( t 2 + h)x - S{t2)x\ = i | S ( t 2 - ti)S(ti + h)x - S{t2 - ti)S(*i)s| < -r\S(ti + h)x - S(t!)x\,
h>0, 0 < tx < t2,
implies |2/(*2)| < |j/(*i)l> i-e-j \y(t)\ is monotonically decreasing on [0, oo) and thus has at most countably many points of discontinuity. Let A be a maximal dissipative extension of A. According to Theorem 1.17, (i), the operator A is demi-closed. In the proof for Theorem 5.14, b), we have shown that t —> S(t)x is Lipschitz-continuous on t > 0. Therefore (d/dt)S(t)x exists a.e. on t > 0 (because X is reflexive) and we have -rS(t)x
= AsS{t)x
6 AS{t)x
a.e. on t > 0.
The same arguments as in the proof for (5.38) imply (5.39)
\S(t)x-x\
t>0.
For fixed to > 0 let (£„) be a sequence with tn > to, n = 1,2,..., and limn^oo^n — to- Since (y(tn)) is bounded (a bound being |y(£o)|), we can assume that yo = w4im„_KX>2/(i„) exists. Since y(tn) = AsS(tn)x e A5(t n )a; and S(tn)x —• S(to)x, we have «/o 6 A>S(£o)£, because A is demi-closed. Using (5.39) we obtain the estimate |l/o| < liminf |y(t n )| < limsup|i/(t„)| < |y(t 0 )| < \\AS{t0)x\\ < \y0\, which implies yo = 2/(^o) (note that (A)0 is single-valued by Lemma 1.19, a), and y(t0) = AsS{t0)x G AS{t0)x) and lim^oo \y(tn)\ = \y0\ =• \y(t0)\. By uniform convexity of X we get lim y(tn) = y(t0). n—±oo
Since the sequence (tn) was arbitrary, we have shown that limtj.t0 y(t) — y(to). Thus right-hand continuity of t ->• (d+/dt)S(t)x = AsS(t)x on £ > 0 is proved. Let t0 > 0 be a point of continuity for £ -» |j/(£)|. Since t -» 5(£)a; is differentiable a.e. on t > 0 we have, for any h G (—£o> 00)5 ft0+h
5(t 0 +tya:- 5(£ 0 )x = / •/t0
J
ft0+h >+
—S(s)zds = / dt J t0
^-S(s)zds. at
5.3. The infinitesimal generator
169
This implies 1 d+ - (S(t0 + h)x - S{to)x) -^S{t0)x < \h\
<
max t0-\h\<s
f
d+
a l
,
d+
Cll
-S(s)x--S(t0)x
x
ds
J t
d+_
dt
t0+h
S{s)x -
d+ 0 -^S(t0)x
0 as h ->• 0.
Thus we have shown that (d/dt)S(t)x exists and equals (d+/dt)S(t)x = for all i > 0 with the exception of at most countably many values.
AsS(t)x •
5.16. Theorem. Assume that X and X* are uniformly convex and let A be an m-dissipative operator on X. Then A is demi-closed, dom A is convex and A generates a strongly continuous semigroup S(t), t > 0, of contractions on dom A. The minimal section A0 of A is single-valued with dom A0 — domA and is the infinitesimal generator of S(t), £ > 0. Proof. By Theorem 1.17, A is demi-closed. Convexity of domA follows from Theorem 1.22. Furthermore, Lemma 1.19 implies that A0 is single-valued and that dom A0 = dom A. Choose x G dom A — domA 0 . Then we get from (5.7) in Theorem 5.3 (5.40)
\A(h)x\ = j-\S{h)x-x\<\A°x\,
h>0.
This shows that x G D = domAs (by Theorem 5.14, c)). Thus we have domA 0 C domA s . Next choose x G domA s , i.e., lim/40 A(h)x = Asx. From inequality (5.23) in Lemma 5.7 we get Re(Asa;, / ) < (v, x - u)s
for all [u, v] G A, f G F(x - u).
According to Lemma 1.3, c), / G F(x — u) can be chosen such that Re(v, f) — (v,x — u)s. This gives Re{Asx
-v,f}<
0,
[u, v] G A,
for some / G F(x — u). This implies that the operator A D A defined by (we set Ax = 0 if x $. dom A) Az
Az for z G dom A \ {x}, Ax U {As2;} for z = x,
is dissipative. But A is maximal dissipative, so that A = A and consequently [x, Asx] G A. The inequality (5.21) for x0 = x and r = 0 implies \S{t)x -x\2
<2 [ (y, S{s)x - x)sds < 2\y\ [ \S{s)x - x\ ds Jo Jo
170
Chapter 5. Nonlinear Semigroups
of
Contractions
for any y G Ax, t > 0. It follows that \S(t)x - x\2 < 2\\Ax\\ I \S(s)x - x\ ds, Jo
t > 0.
Prom Lemma A.2 for r = 0, r(t) = \S(t)x - x\ and g(t) = \\Ax\\ we get \S(h)x-x\
h>0.
Using this inequality we get the estimate |A,2;| =lim\A(h)x\
< \\Ax\\,
which together with Asx G Ax implies Asx G A°x. Since A0 is single-valued (see Lemma 1.19), we get Asx = A°x, which finishes the proof of As — A°. D The previous theorem shows that in a uniformly convex Banach space with uniformly convex dual the infinitesimal generator of a strongly continuous semigroup of contractions generated by an m-dissipative operator has dense domain (in the domain of definition for the semigroup). The question remains under what conditions on the state space X the infinitesimal generator of any strongly continuous semigroup of contractions has dense domain (in the domain of definition for the semigroup). We shall prove that this is true if X is a Hilbert space. In order to prove this we need the following preparatory result: 5.17. Proposition. Assume that Xo is a closed convex subset of the Hilbert space X and let S(t), t > 0, be a strongly continuous semigroup of contractions on Xo with infinitesimal generator As. Then, for any A > 0, the limit J\x := lim J\,hx,
x G X0,
exists and defines a contraction J\ : -X"o -* XQ. Moreover, we have J\x G dom^s, A > 0,
and
lim J\x = x
for x G Xo-
Proof. We choose x G XQ, A > 0 and set yT = J\,Tx,
r > 0.
Let (•, -)x denote the inner product in X. For h > 0 we get from (5.34) S{h)yh = Vh + -r(yh
~x).
Then we have for any z G XQ the estimate z c m . . - S(h)z\ o/».\.i2 \yh - z\.zi 2>N i\S(h)y = yhh
h — S{h)z + -
2h > \yh - S(h)z\2 + — Re(yh ~x,yhA
2
-(yh-x) S{h)z):
5.3. The infinitesimal
generator
171
Summing up this estimate and the estimates, where z is replaced by . . . , S((n — l)h)z, we get 2h Vh ~ z\2 > \Vh ~ S(nh)z\2 + —- ^2Re(yh
-x,yh-
S(h)z,...
S{ih)z)x.
»=i
This inequality for z = ynh is 1h n + — ^ R e ( j / f e -x,yh-
\Vh - Vnh\2 > \Vh - S(nh)ynh\2
S(ih)ynh):
i=\
( 5 - 41 )
> \Vh ~ Vnh? + —r- R.e(ynh - x, ynh - yh) n
1h n R e / 1 x + -7"X! 0 > ~ ,Vh-
S(ih)ynh)x.
i=l
Here we have also used that S{nh)ynh = ynh + (nh/\)(ynh inequality implies (using ynh-x = ynh - yh + yh - x)
— x).
The last
n
n\ynh-yh\2
+nRe(yh
- x,ynh
- j / / i ) x + ^ R e ( ? / / l - x,yh - S(ih)ynh)x i=\
Consequently we have \Vnh ~ Vh\2 < Re(yh -x,yh1 ™
+ - ^
Re
ynh)x
{Wi ~ x' s(ih)Vnh
- Vh)x
i=1
(5-42)
" = Re(yh -x,x ynh)x 1 " + - ^ R e ( j / f t -x,S(ih)ynh 71
~x)x-
i=\
For e > 0 we choose 6 € (0,1] such that \S(h)x-x\<e
forO
If 0 < nh < 8, then we have \S(ih)ynh
- x\ < \S{ih)ynh - S(ih)x\ + \S(ih)x - x\ < \Vnh~x\ +e,
i=
l,...,n.
< 0.
172
Chapter 5. Nonlinear Semigroups
of
Contractions
This and (5.42) imply \ynh ~ Vh? < Re(yh ~x,xynh)x + \Vh ~ x\ (\ynh - x\ + e) 1 1 < 7,\Vh -x\2 + Re(yh-x,x-ynh)x +-\x - ynh\2 = o 1(3"* ~x) + (x-
+ \yh - x\e
Vnh)? + \Vh - x\e
= -^\Vh -Vnh? + \Vh
-x\e,
i.e., we have \yh - ynh\2
(5.43)
< 2e\yh - x\
for 0 < nh < S.
The next goal is to show that the set {\yh — x\ \ 0 < h < 1} is bounded. Inequality (5.41) implies that for any positive integer n there exists an integer *, 1 < i < n, such that (5.44)
Re((ynh
- x,ynh
-yh)x
+ {yh -x,yh-
S(ih)ynh)xj
< 0.
Using the inequalities Re(ynh - x, ynh - Vh)x > -\ynh - x\ (\ynh -x\ + \yh - x\) and Re(yh - x,yh - S(ih)ynh)x
= \yh -
S{ih)ynh\2
+ Re(S(ih)ynh
-x,yh-
S{ih)ynh)x 2
> {\Vh -x\-\x-
S{ih)ynh\)
- \S(ih)ynh
- x\ (\yh -x\ + \x-
S{ih)ynh\)
in (5.44) we have 0>\Vh-
x\2 - \yh - x\ (31a; - S(ih)ynh\
+ \ynh - a;|) - \ynh - x\2
> \yh - x\2 - \yh - x\ (3|a; - S(ih)x\ + 4\ynh - x\) - \ynh - x\2, where we have also used \x - S(ih)ynh\ < \x — S(ih)x\ + \ynh - x\. Let /x = max(|a; — S(ih)x\, \ynh — x\). Then we have \yh - x\2 - 7/i\yh - x\ - fj2 < 0. This implies (with K0 = (7 + \/53)/2) \Vh ~ x\ < K0[i. Using \ynh - x\ = \J\nh% - x\< \\A(nh)x\ get (5.45)
\J\,hX - x\< K0max(\S(ih)x
— A(n/i) _1 |5(n/i)x - x\ we finally
— x\, —\S(nh)x
- x\\
5.3. The infinitesimal
generator
173
for any n — 1,2,..., and some i G { l , . . . , n } . Let 0 < h < 5/2 and set n = [S/h]. Then we have 5/2 < nh < 5, which together with 0 < ih < nh < 5 and (5.45) implies (5.46)
\Jxihx-x\<eK0max(l,
— ),
0 < h<
-.
For h e [5/2,1] we have \J\ hX-x\
— X\A(h)x\ = —\S(h)x - x\
5 47
( - )
2A 2A < — \S(h)x-x\ < — max \S(h)x - x\. 5 5 6/2
0
Consequently we get from (5.43) the estimate \yh ~ ynh\2
(5.48)
< 2Me
iov0
For rational s, t G (0,5] we have s = mh and t = nh for some real h > 0 and positive integers m, n. Using (5.48) we get (5.49)
\ys - yt\ < \ymh - Vh\ + \yh - Vnh\ < 2V2Me.
For t, t0 > 0 we have \J\,tX - J\,t0x\ = \J\,tX - J\,t{I -
\A(t))J\tt0x\
< \x - (I - \A(t))JXttox\
= X\A(t)Jx,tox
-
A(t0)Jx,tox\,
which proves that lim t ^t 0 Jx,tX = Jx,tQx. Thus the estimate (5.49) is valid for all s,t e (0,6]. This implies that lim^o J\,tx exists. It is clear that Jx is a contraction on XQ. In order to prove that Jxx G domvl s for A > 0 it suffices to prove that Jxx G D, A > 0 (see Theorem 5.14). From A(h)Jx,hX = {l/X)(J\,hX - x) we get -\S(h)Jx,h,x tl
- Jx,h.x\ = -r\J*,hx - a:| -> ~r\Jxx - x\ A
A
Therefore there exists a positive constant K such that \\S(h)Jx,hx-Jx,hx\
0
as h | 0.
174
Chapter 5. Nonlinear Semigroups
of
Contractions
This and the contraction property of the operators S(t) imply that, for 0 < h < 1, we have \S{t)Jx,hx
- Jx,hx\
< \S{t)Jx,hx
- S(h[t/h])JXihx\
< \S(t - h[t/h})Jx,hx
+ \S(h[t/h])J\ihx
-
Jx>hx\
- Jx,hx\ + [t/h)\S(h)Jx,hx
-
Jx,hx\
< \S(t - h[t/h})Jx,hx - Jx,hx\ + h[t/h]K
- S(t -
h[t/h))Jxx\
- Jxx\ + \Jxx - Jx,hx\ + \S(t - h[t/h])Jxx -
Jxx\.
For h 4- 0 we get \S(t)Jxx - Jxx\ < Kt, i.e., Jxx € D = domA s . Finally, we have from (5.46) for h J. 0 that \J\x-
/ 2X\ x\ < eiiTomaxfl, — J
and consequently limsup | Jxx — x\< KQ€. Since e > 0 was arbitrary, we get lim^o Jxx — x.
D
5.18. Theorem. Assume that X is a Hilbert space and XQ is a closed convex subset of X. Then the following is true: a) Let S(t), t > 0, be a strongly continuous semigroup of contractions on Xo with infinitesimal generator As. Then dom J4S is dense in Xo and there exists a unique maximal dissipative operator A on X such that A° = As. b) If A is a maximal dissipative operator on X, then dom ^4 is convex and A0 is the infinitesimal generator of the strongly continuous semigroup of contractions S(t), t > 0, on dom A which is generated by A. Proof. Since A is also m-dissipative by Theorem 1.12, statement b) follows immediately from Theorem 5.16. Density of dom As in Xo is obvious from Proposition 5.17. By Zorn's lemma there exists a maximal dissipative operator A with dom A C X0 and As C A. From Theorem 5.16 we conclude that A generates a strongly continuous semigroup U(t), t > 0, of contractions on dom A = XQ. Moreover, the minimal section .A0 of A is the infinitesimal generator of U(t), t>0.
5.4. Nonlinear
diffusion
175
In order to prove U(t) = S(t), t > 0, we choose x G domA s C domA = domA 0 (see Lemma 1.19, b)). From Theorem 5.15 we get that — S{t)x = AsS(t)x
G AS{t)x
a.e. on t > 0
and that t -t S(t)x is Lipschitz-continuous on t > 0. Therefore u(t) = S(t)x is a strong solution of (d/dt)u(t) G Au(f), w(0) = a;. On the other hand Theorem 5.11, b), implies that v(t) = U(t)x is also a strong solution of (d/dt)u(t) G Au(t), u(0) = x. By uniqueness of strong solutions (see Theorem 5.6) we get S(t)x = U(t)x,
t > 0, x G dom,4 S .
Density of domj4 s in XQ implies S(t) = U(t), t > 0. In particular we have A0 = As. If B is also a maximal dissipative operator with domB C XQ and As C B, the same arguments as given above prove that B° = As, so that we have A0 = B°. Then Theorem 1.21, b), implies A = B. •
5.4.
Nonlinear diffusion
As an application of the theory developed in this chapter we consider an abstract Cauchy problem of type (5.15) describing nonlinear diffusion. Let Q C M.d, d > 2, be a bounded open domain with sufficiently smooth boundary dd and j : R -4 R be a proper, lower semi-continuous and convex functional which is radially unbounded, i.e., we have hm — - — co. |r|->oo
r
We set 0 = dj and define the operator A on X = L1(f2) by domA = { n e L1^)
| there exists & v £ W0' (0) such that v(x) G 0{u(x)) a.e. on ft and At; G ^ ( f t ) } ,
(5-5°)
.
,.
.
_ „ r i , 1i
Au = {Av | v G Wo' (ft) with v(x) G (3{u{x)) a.e. on 0 and Aw G L1 (ft)},
uGdomA
In order to prove that A is m-dissipative we shall use the following result which is of its own interest. 5.19. Proposition. Define the operator A\ on L*(ft) by domAi = {u G Wo' 1 (ft) | AM G ^ ( f t ) } 1 and A-iu = Au, u G domAi. Then A\ is mdissipative and densely defined. ' A s usual the derivatives are taken in the distributional sense.
176
Chapter 5. Nonlinear Semigroups
of
Contractions
Proof. We choose u G dom^x and define the function cj> G L°°(Q) by 4>(x) = sign«(a;), x G ft. Let p G C2(M) be an increasing function with p(0) = 0 and p(r) = signr for \r\ > 1 (for instance p(r) — (3r 5 — 10r 3 + 15r)/8 for \r\ < 1). For e G (0,1) we set pe(r) = p(r/e). Then lim e | 0 p€(u(x)) = signu(a;), x G ft, and lim£j.o / n Au(x)p e (u(a;)) da; = JnAw(a;) sign w(a;) dx = (Aiu,
Jn
= - / Vu(a:) T Vu(x)/^(u(a:))da: < 0.
Jn
This proves {A\u,<j>) < 0 for all u € domyli, i.e., ^4i is dissipative. Note that Mii^eF(u). In order to verify the range condition we first observe that A\ can be viewed as an extension of the operator A? defined by d o m ^ = HQ(Q) n if2 (ft) and A%u — AM, U G d o m ^ . By Proposition 1.59 and Theorem 1.53 the operator A(a;) = sign(?ira(a;) — u m (aj)), a; G ft, and get \U„ -Um\Ll
= ( / „ - fm,
-Um),
< \fn ~
fm]^-
Thus (u„)ngN is a Cauchy sequence in L 1 (ft) and therefore there exists a u G L J (ft) such that lim un = u
and
lim
AM„
= u — f.
In order to proceed with the proof we shall use the following lemma: 5.20. Lemma. Let (vn)nef$ c HQ(Q) D if 2 (ft) 6e given and suppose that limn^ooVn = v, limTl_+00 Avn = w in L 1 (ft). Then we have v G W 0 ' 9 (ft), 1 < q < d/(d— 1), and Av — w. Proof. Given h0 G L p (ft) and h G L p (ft;M d ) with p > d we conclude from [Da-JLi, Corollary 1 on p. 462] that the equation (5.51)
- Acf) = h0 + div h
has a unique 'quasi-classical' solution > G W 0 ' p (ft) satisfying |0lwi.P(Q\ < C(|/io|ip + N £,*>)• Using the continuous embedding W01,p(ft) Q L°°(ft) (see [Ad, p. 108]) we conclude that (5.52)
\
+
\h\LP),
5.4. Nonlinear diffusion
177
where M is some positive constant. Multiplying equation (5.51) by ip £ we get / V<j?Vij)dx = / hoipdx-
/ S^
HQ($1)
hi-—ipdx.
For ip = vn we obtain / hovndx - / hJVvndx Jn Jo. This and (5.52) imply / h0vndx-
= / V>TVu„da; — — I <j)Avndx. Jsi Jn
/ hTVvndx
< M\Avn\Li(\hQ\LP
+ \h\Lv).
Since (h0,h) is arbitrary in LP{Q.) x L p (Q;]R d ), we get Klw^cn) <M|Av„|L1, where 1 < q = p/(p - 1) < d/(d — 1). This shows that the sequence (vn)neN is bounded in W0,q(Q) which is compactly embedded into L 1 (H). Thus there exist a v € Wo' 9 (fi) and a subsequence (which we again denote by (vn)nept) such that w-lim vn=v
in W0'9(il)
and
lim vn = v
in
L1^).
This immediately implies v = v. Any V £ W - 1 ' P (Q) = Wo'9(f2)* can be written as (see [Ad, Theorem 3.8]) V = V'o + ]£,-=i -DjV'j with T/>0, • • • ,ipd £ L p (fi). For arbitrary <> / 6 Co°(fi) we define ^0 = 0 and xpj = Dj<j>, j — 1 , . . . , d. Then we get d
{Vn,i>) = ^
1,9
(n) we conclude that
lim (Avn, <j>) = (Av,<j>) for all 0 £ C^°(Q). On the other hand, \Avn — W\L^ -> 0 implies {Avn,(f>) -> (w,>) for all 0 G n Co°(f2). T h u s w e h a v e Av = wContinuation of t h e proof of Proposition 5.19. Lemma 5.20 for vn = un and w = u — / implies Au = u- f, i.e., (I - Ai)« = / .
Chapter 5. Nonlinear Semigroups of Contractions
178
Note that we already know that un —>• u in L 1 (ft). Density of dom^li follows from dom ^2 C dom A\ and density of d o m ^ in L 2 (ft) (see Theorem 2.25) and of L 2 (ft) in L1^). D 5.21. Theorem. The operator A defined in (5.50) is m-dissipative on L 1 (ft) and thus generator of a nonlinear semigroup of contractions on dom A. Proof. From Theorem 1.53 and Proposition 1.54 we see that P is maximal monotone and coercive. By Theorem 1.39, b), we have also range(3 = R. We first prove that A is dissipative. Let [u,, Aw,] e A,i = 1,2. From (5.50) we see that Vi G W01,:L(ft), Vi(x) G (3{iii{x)) a.e. on ft and Avt G £ x (ft). We have ft = fti U ft2 U ft3 with fti = {x G ft | ui(x) / U2(x)}, 0,2 — {x G ft | ui{x) — U2{x) and Vi(x) = V2(x)}, fls — {x G ft | ui(x) = U2(x) and vi(x) j= v2(x)} and define <j> £ L°° (ft) by
(5.53)
4>(x)
sign(ui(a;) — 112(2;)) for x G fti, <0 for x G ft2, signal(x) — 1*2(2;))
for x G ft3.
Then it is easy to see that (wi -u2,4>) = \ui - U 2 | L I and (vi - ^ , 0 ) = | v i - v 2 | i , i Here we have to observe that by monotonicity of j3 we have «i (x) > V2 (x) if ui(x) > U2(x) and «i(a;) < V2(x) if Wi(a;) < U2{x) for a; G ft. Since Ai is infinitesimal generator (see Proposition 5.19 together with Theorems 5.18 and 5.14), it is strictly dissipative by Theorem 2.25. This implies (Aut - Au2,
- v2),<j>) < 0,
i.e., A is dissipative. Next we show that range(7 — A) = £ x (ft), i.e., that A is also m-dissipative. We set 7 = /3~ x . Then 7 is maximal monotone with dom 7 = R. Moreover we have 7 = dj*, where j * is the conjugate of j (see [Ro2, Corollary 23.5.2]). For / G L x (ft) the equation f £ (I — A)u, u G dom A, is equivalent to (5.54)
f(x) G 7(^(2;)) - Av(x)
a.e. on ft
for some v G W 0 M (ft) with 7 « ) ) € L1^) and Av G L^ft). We first consider equation (5.54) in L 2 (ft) and define the operator C on L 2 (ft) by C={[u,v]
G L 2 (ft) x L 2 (ft) I «(a;) G 7(«(z)) a.e. on ft},
i.e., domC = {u G L 2 (ft) |there exists a v G L 2 (ft) such that w(:c) G 7(u(x)) a.e. on ft}. From dom7 = R and 7 = dj* we get -DeffCT) = K (see (1.63)). Therefore u(a;) G -Deff(i*) a.e. on ft for any u G L 2 (ft). By definition of dj* we have, for [u, v] G C, j*(u>) — j*(u(a;)) > (w — u(x))v(x)
a.e. on ft for all u G l .
5.4. Nonlinear diffusion
179
For a w0 G K we get (5.55)
j*(u(x))
< j*(u>o) — wov(x) + u(x)v(x)
a.e. on 0.
By Lemma 1.44 there exist a , c £ l such that (5.56)
j*(u(x)
> au(x) + c a.e. on ft.
Boundedness of £1 together with (5.55) and (5.56) implies j*(u(-)) Thus we have shown that C can also be characterized as
G i1(0).
C = {[«,«] G L 2 (0) x L 2 (ft) |«(ar) G domflj* a.e. on 0, j*(u(-)) G L 1 ^ ) and v(x) G 7(w(a;)) a.e. on ft}. Lemma 1.61 for N = 1 shows that C = dtp with DeS(ip) = { « £ L 2 (fi) | u(z) G -DeffO'*) a.e. on 0 and j*(u(-) G L 1 ^ ) } and
1 oo
otherwise.
According to Proposition 1.63 the operator A
L\Q)). For / G L 1 (fi) let (/ n ) n eN C L 2 (fi) be a sequence with | / - fn\Li ?z -4 oo. For any n G N there exists a t;„ G HQ (£1) D H2(Sl) with (5.57)
fn{x) G 7(wn(a;)) - Avn(x)
a.e. on ft.
We set u„ = / „ + Au„ G 7(vn(-))> n = 1,2,... . For define <j> as in (5.53). This implies | « n - MmU 1 =
/ (Un(x)
- Um(x))(f>(x)
-> 0 as
and f n , u m we
d,X
Ja = / (/n(z) - fm(x))(f>{x) dx+
A(vn - vm)(x)4>(x) dx
1
< |/n - /mli This shows that there exists a w € X1(f}) such that lim un = u
and
lim Aw„ = u — /
in L 1 (fi).
Lemma 5.20 implies that there exists a t £ W 0 ' 9 (Q), 1 < q < d/(d — 1), such that limra_+00 vn = v in . L 1 ^ ) and At; = u — f. Since 7 is maximal monotone on R, the operator - 7 is m-dissipative on R and hence closed by Theorem 1.16, (i). Taking appropriate subsequences {unk)k€N and {vnk)keN we have vnk{x) —v v(x) and w„t(a;) —>• u{x) a.e. on ft. By closedness of 7 we get
180
Chapter 5. Nonlinear Semigroups
of
Contractions
u(x) £ 7(u(a;)) resp. v(x) 6 (3(u(x)) a.e. on 0. This finishes the proof that u 6 dom A and u — Au — / . D
CHAPTER 6
Locally Quasi-Dissipative Evolution Equations In this chapter we consider evolution problems with time dependent, locally quasi-dissipative operators. Applications to concrete classes of problems will be presented in Chapter 9. We discuss the theory developed by K. Kobayashi, Y. Kobayashi and S. Oharu (see [Ko-Kb-O], [Kb-Ol], [Kb]) with some minor modifications. Our presentation is strongly influenced by the one given in [Pav2]. As already mentioned in the Preface the crucial step forward in order to include many important concrete dynamical systems into the abstract theory of evolution equations was the idea to localize the concept of dissipativity. This was achieved by demanding dissipativity estimates on level sets of lower semi-continuous functionals and letting the dissipativity constant depend on the level sets. In concrete situations these functionals can be stronger norms on subspaces or Liapunov-like functionals. Some slight modifications in comparison to the original theory were motivated by the applications presented in Chapter 9. We do not study infinitesimal generators for these general evolution problems and refer the interested reader to [Kb-Ol]. In Section 6.1 we define the concept of a locally quasi-dissipative operator and provide the basic estimate for solutions of linear, time dependent difference equations which will be used in the sequel in order to obtain estimates for the value of the lower semi-continuous functional used in the definition of quasi-dissipativity (resp. the assumptions to be made in Section 6.2) 'along' DS-approximations. In Section 6.2 we state the assumptions on the operators A(t) (local quasi-dissipativity together with some requirements on the time dependence) which will be fundamental for the theory. The assumptions (El) resp. (E2) introduced in Section 6.2 allow the introduction of the concept of a DS-approximation for the evolution problem, which essentially is a sequence of step functions obtained by Euler's implicit scheme. In Section 6.3 we prove the estimates which are essential for the further developments. Of central importance is the estimate in Lemma 6.13 which gives a comparison between two DS-approximations. Section 6.4 provides the range conditions needed in order to establish existence of DS-approximations. The central existence and uniqueness results for mild solutions (which are defined as uniform limits of the step functions corresponding to DS-approximations) are given in Section 6.5. 181
Chapter 6. Locally Quasi-Dissipative
182
Evolution
Equations
For the uniqueness results we make also use of the concept of integral solutions introduced by Ph. Benilan. Under additional assumptions existence of an evolution operator is established. In Section 6.6 we recover the CrandallLiggett theorem from the general theory and give a generation theorem for strongly continuous semigroups of nonlinear operators using a tangential condition. Since the assumptions on the time dependence of the operators A{t) result in the requirement that forcing functions have to be continuous (when they are included in the definition of A(t)), we deal in Section 6.7 with forcing functions directly. Strong solutions of evolution problems are investigated in Section 6.8. Using a 'sampling' result for L1-functions by L. C. Evans it is shown that strong solutions are also mild solutions. Furthermore, we give conditions under which mild solutions are strong solutions. In Section 6.9 we show that by slightly modifying the general theory we can also cover well-posedness for quasi-linear problems (see also [Ka4] and [Cr-S]). Finally we show that the approach using DS-approximations can also be applied to a problem of 'parabolic' type in order to recover a results given in [Br2] (see also [Bb4]). For a family i ( f ) C I x I , 0 < k T m a x , T m a x G (0, oo], of operators on X and initial data s G [0,T max ), x$ G X, we consider evolution problems of the form EPM),s,*o)
Jt
s
u(s) = x0. We shall write EP(A(-)) resp. EP(A(-), s) if we do not want to specify the initial data s,xo resp. xo. The proof for existence of solutions for EP(A(-),s,xo) is based on the implicit Euler scheme, i.e., on a specified grid s — to < t\ < ... we define approximations ui to u(U) by solving (6.1)
"* ~ "*-* g A(U)ui,
1 = 1,2,...,
exactly resp. approximately. In the latter case we have *
/~
ei£A(ti)ui,
i = 1,2,...,
where e, G X are the errors which have to be controlled in an appropriate way. Writing (6.1) as Ui-i G (/ - (t, - ti-1)A{ti))ui,
i = 1,2,...,
we see that invertibility of the operators / — \A(t) and conditions on the range of these operators (for A sufficiently small) will play an essential role in denning the approximations u^. It is also clear that further conditions will be needed in order to guarantee convergence of the step functions u(t) = Ui, t G (ii-i,ij],
6.1. Locally quasi-dissipative
operators
183
i = 1,2,..., to a continuous function as the mesh size tends to zero. This continuous function, if it exists, will be called a mild solution of EP(A(-), s, XQ).
6.1.
Locally quasi-dissipative operators
An important idea used in the approach by Kobayashi and Oharu is to localize the concept of dissipativity. Let (X, | • |) be a Banach space and assume that ip is an extended real valued non-negative, lower semi-continuous functional on X which is not necessarily convex. We denote by D the effective domain Deg(
a> 0.
Since ip is lower semi-continuous, the level sets Da, a > 0, are closed in X (compare Lemma 1.42, a)). 6.1. Example. For delay equations we shall consider in Section 9.1.1 the state space I = l x C(-r, 0;R") with the norm [(77, <j>)\x = max(|T/|, \
V
\\\C
= \(T},)\X,
if »? = 0 ( O ) .
The effective domain D for this functional is given by £>={(77, 0 we choose n(e) £ N such that \xo — xn\x < e for n > n(e). For xn £ D we have
> \x0\x - \xn ~ x0\x > f{xo) - c,
n> n{e),
which implies lim inf^-^
fo
if xeD,
I 00
11 x <£ D.
184
Chapter 6. Locally Quasi-Dissipative
Evolution
Equations
It is easily seen that ip is lower semi-continuous on X. Note that closedness of D is necessary in this case. 6.3. Definition. A subset A C X x X is said to be locally quasi-dissipative with respect to the functional (p if and only if there exists an a+ E (0, oo] such that for all a G [0, a+) there exists an uja 6 R with (6.2)
( 1 - Xuja)\xi -x2\ < \xi-x2-
X(yi - m)\,
0 < A < l/|w a |,
for all [xi, j/j] € A with xt G Da, i = 1,2. By arguments completely analogous to those in the proof of Proposition 1.9 we see that, for any a € [0, a+), the operator / — XA restricted to d o m A n Da for 0 < A < l/|w Q | has a single-valued inverse defined on (I — XA)(domAnDa), which for simplicity we denote also by (J — A ^ ) - 1 . We have the estimate
|(7- A ^ Z - (i- xAy'yl < for 0 < A < l/\uJa\ and x,y e (I - XA)(domAn
YZ^T\X
- v\
Da).
It will be important to bound the approximations ut obtained by the implicit Euler scheme in terms of the functional
i = l,2,... .
Given T m a x > 0, continuous functions a,b : [0,T max ) -> R, b being nonnegative, and a monotonically increasing sequence (ti)i^f^0 in [0, T max ) we study inequalities of the type
7— (zk ~ Zk-i) < a(tk)zk + b(tk), hk
k =1,2,...,
where hk = tk - tk-i- For t € [0,T max ) we set ama.x{t) = max |a(r)|. 0
Obviously the function a m a x ( ) is non-negative, continuous and increasing on [0,T max ). We have the following lemma: 6.4. Lemma. Let T € (io.^max), e > 0 6e given and assume that
^-* : = 4^ibHi i M £ / 2 U # ) )
6.1. Locally quasi-dissipative
operators
185
for all k with tk < T. Then (6.3) has a solution Zk for all k with tk
+ e)da)
eea°^ (6(T) + e) exp ( /
(a{a) + e) da) dr,
where a0(r) = min(l, l/a m a x ("r)). Proof. In the following we only consider indices k with tk < T. If a(tk) is positive, we see from the definition of So that a(tk)T < e(2a max (T) + e ) _ 1 < 1 for 0 < r < 8$. Thus Zk can be estimated using (6.3) (which is trivial in case a(tk) < 0). Moreover, it is easy to see that (1 - a{tk)T)-1
< e(«(*»)+«/a)r
for o <
r
< 60
regardless of the sign of a{tk). We define the step functions a, b by a(a) — a{ti), b(a) = b{t{) for a € (U-i, ti], i = 1,2,... . By induction we get from (6.3) zk < r0exp(^2a(ti)hi
+ e(tk - t0)/2) + ^ 6 ( i i ) / i i e x p ^ ( a ( t J ) +
e/2)hj)
i-tk
ro exp f /
(a(a) + e/2) da)
+ ] T b{ti)hieh^a^+^
exp( f \a(a) + e/2) da).
If a(tk) < 0 we get hi{a(ti) + e/2) < hie/2 < e/2. In case a{U) > 0 we have hi{a(ti) + e/2) < <50(2amax(T) + e)/2 < e(2a m a x (T))" 1 < e(2a m a x (t i ))- 1 . Combining both cases we have hi(a{U) + e/2) < eao(U). Continuing the estimate for Zk we have zk = r0 exp /to
+ ^ »=i
hib(ti)e£ao^
exp( ( \a(a) + e/2) da) ^fi
r 0 exp + f "eea°W (6(T) + e) exp( /" *(a(ff) + e) da) dr,
186
Chapter 6. Locally Quasi-Dissipative
Evolution
Equations
where we have used \a(a) - a(a)\ < e/2, \b(a) - b(a)\ < e/2 for a G [t0,T\.
D
For given functions a, b and e > 0 we define the function ipa,b(-, •, •', e) by il)a,b{t,s,l3;e) = (3expU
(a(a) + e)daj
(6.4) + / e eao( r ) (6(T) + e) exp ( f (a(CT) + e) do) dr for s < t < T m a x and f3 G R. For later use we state the following composition property: (6.5)
i>a,b{t2,ti,ipatb{ti,s,
(3;e);e) = i/)a,b(t2,s,(3;e)
for s < h < t2, P G R and e > 0. In case of e = 0 we write ipa,b(t, s, (3) instead of i/ja,b(t, s, 0; 0). If a(t) = a and b(t) = b > 0, then we have „emin(l,l/|o|)
^b{t,
s, 0; e) = pe^^-^
+
Q+ e
.
.
(6 + e) (>+ £ )(*- 5 ) - l j
for s < t, (3 G R. Whenever there is no doubt about the functions a and b we write ip(t,s,0;e) resp. ij){t,s,0). It is also clear that (6.6)
il)a,b{t, s, 13; e) = ipai{t, s, (3),
where a(r) = a(r) + e and 6(r) = (b(r) + e)exp(emin(l, l/a max (''")))-
6.2.
Assumptions on the operators A(t)
In this section we state the assumptions on the operators A(t), 0 < t < Tma.x, which will be needed in the sequel. Let the lower semi-continuous functional if : X —>• R be given. (El)
There exists an a+ £ (0, oo] such that for any a 6 [0,a + ) there exist a continuous function fa : [0, T max ) -> X and, for any T G (0,T m a x ), an increasing function La
-y2)\ + X\fa{ti)
for all [xi,yi] G A(U) with Xi G Da, i = 1,2.
-
fa(t2)\La,T{\x2\)
6.2. Assumptions
(E2)
on the operators
A(t)
187
There exists an a+ G (0, oo] such that for any a G [0, a+) there exist a continuous function fa : [0, T max ) ->• X which is of bounded variation on compact subintervals of [0,T max ) and, for any T G (0,T ma x), an increasing function La,T '• Ro~ —• R j and a constant ua,T G K such that, for 0 < A < 1/|O; Q ) T| and 0 < t\,t2 < T, (1 - AwQiT) |xi - x2\ < \xi - x2 - A (j/i - j/2)I + A |/ a (*l) - fa(t2)\La,T(\X2\)(l /or a// [xi, yi] G
wii/i xt G
J4(£J)
JD QJ
+ |z/2|)
i = 1,2.
(E3)
Let (xn) C X anc/ (tn) C [0, Tmax) 6e sequences such that xn G d o m A ^ ) f]D, tn < t < jfmax) n — 1,2,..., and tn —> t, xn —> x as n —> 00. Then we have x G dom A(t). Assumption (El) resp. (E2) for s = t implies that the family A(t) is uniformly locally quasi-dissipative on compact subintervals of [0, T m a x ). If we define the function K : R j -4 R^ by K(r) = 1, r > 0, in case of assumption (El) and by K(r) — 1 + r in case of assumption (E2), then both conditions can be written as (6.7)
( 1 - AwQ,T)|a;i - x2\ < | n - x2 - A (Vl - y2)\ + A lUh)
for A G (0, l/|w„, T |), 0 < ti,t2 i = l,2.
-
fa(t2)\La,T()x2))K(\y2\)
< T and all [xi,yt] G A(U), with Xi G Da,
In the following proposition we give an equivalent form for condition (El) resp. (E2) and a consequence, which will be of importance below. 6.5. Proposition, a) Condition (6.7) is equivalent to {Vl-y2,X1-X2)i
'
}
+ |/a(*i) - fa(h)\
|xi -
x2\La,T(\x2\)K(\y2\)
for all 0 < ti,t2 < T and all [xi,yi] G A(U) with Xi G Da, i = 1,2. b) Moreover (6.7) implies (X +n-XfuvatT)\x\-x2\< (6 9)
'
/or all A,/x G (0, l / | w a , r | ) , 0 < ti,t2
X\x2-fiy2-x1\+fj,\x!-Xy\~x2\ + AM |/a(*l) - /a(*2)| W ( W ) * ( | l / 2 | )
188
Chapter 6. Locally Quasi-Dissipative
Evolution
Equations
Proof. We fix a 6 [0,a+) and T £ (0,T m a x ). First we show that (6.7) is equivalent to (6.8). From (6.7) we get, for A G (0, l/\uaiT\), \xi - x2\ - \xi - x2 - A fai - y2)\ A < WQ,T \xi - x2\ + \fa{h)
- fa(t2)\
La,T{\x2\)K(\y2\).
Thus, (6.8) follows from the definition of (•, •){ (see Definition 1.2). Conversely, according to Lemma 1.3, c), we choose x* e F{x\ — x2) such that (6.10)
(?/i -y2,xi
-x2)i
= Rex*(yi - y2).
Then we get from (6.8) \xi - x2\2 — x*(xi - x2) = Rex*(x1 - x2 - \(yt - y2)) + A Rex*(yx - y2) < \x\ -x2\\\xi
-x2
- X(yi - 2/2)|+ Awa,T|a;i - x2\
+
Mfa(t1)-fa(t2)\La,T(\x2\)K(\y2\))
for 0 < A < l/|a>Q|, which implies (6.7). In order to prove (6.9) we observe (A + fi)\xi - x2\2 = Xx*(xi - x2) + nx*(xi = [iRex*(xi
- x2)
- x2 - Xyi) — A R e a ; * ^ - x\ - ny2) + XfiRex*(yi
Hence (6.9) follows from (6.8) and (6.10).
- y2). •
Since a»a,T < 0 can always be replaced by wa,T = 0, we shall in the following without restriction of generality assume that uja,T > 0 in order to simplify the presentation.
6.3.
DS-approximations and fundamental estimates
In order to discuss convergence of sequences (Xi)te^ obtained by an implicit Euler scheme for the evolution equation we introduce the following concept: 6.6. Definition. Assume that either (El) or (E2) is satisfied for the family A(t), 0 < t < T m a x . Given s,T £ (0,T m a x ) with s < T and x0 e Dndoin~A(s), a family of functions u\ : [s, T] -4 D, 0 < A < Ao, is called a DS-approximation of EP(A(-), s, XQ) on [s, T] if and only if there exists an a e [0, a+) such that,
6.3. DS-approximations and fundamental estimates
189
for any A G (0, A0], there exist finite sequences (^)i=o and (e^)i=i;...)ArA C X satisfying s = t0 < ij < • • • < tNx_1 ^
/~ Ti
nr*A ™* r- A^™
NX> {xi)i=o,...,Nx
c
X
< T < tNx < T m a x ,
Af+X\
XQ G Da and xf G dom A ( # ) n D Q , x ->• #0 as A 4- 0, XQ o
i = 1 , . . . , N\,
(6.11) ^
:=
' " ei
fA_^
€
^(**)^'
i = 1, • • • , iVA, Nx
dA : = m a x ( ^ - ^ _ 1 ) - ^ 0
and
] T ( i f - t^_ 1 )je^| -> 0 as A 4-0 i=l
and «A(*)
XQ
for £ = s,
x\
for t G (i A _i, *A] n [0,T], « = 1 , . . . , Nx.
We call (^)i=o,...,jv>, (a£)i=o,...,jv>, (Vi)i=i,...,Nx a n d (e*)»=i,...,A^ the sequences associated with the DS-approximation (WA)O X is called a mi/d solution of EP(j4(-),s,a;o) on [s, T] if and only if there exists a DS-approximation U\(-), 0 < A < Ao, of EP(A(-), s, xo) such that limu\(t)
= u(t)
A|0
uniformly on [s,T]. For any a G [0,Q + ) with ux(t) G Da for A G (0, Ao] and t G [s, T] we say that the mild solution u(-) is confined to Da. Note that - by definition of DS-approximations - for any mild solution u(-) there always exists an a G [0,a + ) such that «(•) is confined to Da. This terminology is justified, because u\(t) G Da for A G (0, Ao] and t G [s, T] together with u\ —>• u(t) uniformly on [s,T] and lower semi-continuity of
190
Chapter 6. Locally Quasi-Dissipative
(ti,Xi,yi,ei)i=it2,...
Evolution
Equations
be a sequence in [s, To] x Da x X x X satisfying s=:t0
Xi G doraA(ti),
i=
Vi =
e-i G -A(*i)a:«,
*_ t-i
'~
1,2,..., i = 1, 2 , . . . .
W—1
W^e sei hi = ti — i»_i, i = 1,2,... . Tften, /or any r G [0,T0] and [u,v] G A(r) wtfi u G I3 a we Ziawe the estimate1 i
\Xi ~U\
J J (1 - hnU)a>To) n=k+l i
<\xk-u\
+ {U-tk)\v\+
J2
hn(\en\ +
\fa(tn)-fa(r)\La,To(\u\)K(\v\)')
n=k+l
for i > k > 0, provided u)a,T0 max»=i,2,... ^« < 1Proof. We set w = wa,T0. From (6.7) we get, for any r G [0,To] and [u,v] G A(r) with u e Da, (1 — hjU))\xj — u\ < \XJ — hjijj — u\ + hj\v\ + Hfa{tj)
~ fa(r)\La,To(\u\)K(\v\),
Observing Xj — hjyj = Xj-i + hjej we obtain, for j =
j = l,2,... 1,2,...,
(1 — hjU))\xj — u\ < \XJ-I — u\ + hj(\v\ + \ej\ + \fa(tj) ~
fa(r)\La,To(M)K(\v\)).
Multiplying both sides by r i n = i + i ( 1 ~ hnU) < 1 we conclude that j'-i
j
x
u
\ 3~ \ n
1
h w
i - n ) ^ kj-i
_ u
\ n
n—k+1
^ ~ /i™w)
n=k+l
+ hj(\v\ + \ej\ + \fa(tj) -
fa(r)\La,To(\u\)K(\v\)"j
for j = k + 1,..., i. Summing up these inequalities gives Xi~u\
(6.12)
Y[ {l-hnU)<\xk-u\ n=k+l n=h+1 i
+ J2
h
n(K\
+
+
n=k+l U s usual we put £n=fc+i = 0 and IlJUfc+i = *•
(ti-tk)\v\
\fa(tn)-fa(r)\La!To(\u\)K(\v\))
.
6.3. DS-approximations
and fundamental
estimates
191
for i = k, k + 1,... .
•
6.9. Lemma, a) Assume that either (El) or (E2) is satisfied for the family A(t), t G [0,T max ). Given s,T0 G [0,T max ) with s < T0, a G [0,a+) and Xo € X , iei (tj, i j , t/i, 61)4=1,2,... be a sequence in [s, To] x Da x X x X satisfying s =: to < h < h < • • • < To, (613)
Xi edomA(U), Vi — "7 *i
i= e
7
l,2,...,
i ^ A(ti)Xi,
i=
1,2,...,
ti—i
and (we set hi = U — ti_i, « = 1,2,...) 00
(6.14)
^/i„|e„|<7o n=l
/or some positive constant 70. Then exists a positive constant M — M(xo,To,a,io) \xi\ < M,
such that
i = 0,1,...,
provided that u>a,T0 m a x i=i,2,... hi < 1/2. b) Assume that (E2) is satisfied for the family A(t), t G [0, T m a x ). Given s, T0 G [0,T max ) with s < T0, a £ [0,a + ) and x0 G dom A(s), let {ti,^uyi,e.i)i^\,i,... be a sequence in [S,TQ] X Da x X x X satisfying (6.13) and 00
(6-15)
£>„i<7i n=l
for some positive constant 71. Then there exist positive constants2 Mi = Mi(x 0 ,T 0 ,a,71)
and M 2 = M 2 (xo,2o,a,7i, ||A(s)a;o||)
suc/i that \xi\ < Mi, i = 0 , 1 , . . . ,
and |y*| < Af2,
provided ua,T0 max»=i,2,...ft»< 1/2. Proof. We set u = WQ,T0 2
an
d d = maxi=i,2,... ft»-
Recall that ||A(s)x 0 || = inf{|j/| | 3/ e A(S)XQ} (see (1.14)).
i = 1,2,...,
192
Chapter 6. Locally Quasi-Dissipative
Evolution
Equations
a) From Lemma 6.8 for k = 0, r e [0, To] and [u, v] 6 A(r), u € Da, we obtain the estimate i x
u
\ i ~ \ Yli1
~ hnu)) < \x0 -u\ + (ti - s)\v\
n=l
% + Y. ^ ( l e » l + !/«(*») - /a(r)|La,r 0 (l«l)^(l«l))n=l
From wd < 1/2 we get
(l-hnu)-1
<e2"h",
n=l,2,... .
The last estimate implies (J. -
U\
<
e2-(To-3)
^
Q
_
u
|
+
(T()
_
a)
|v|
i
+ X ] fc„(|e„| + \fa(tn)
- fa(r)\
La,To(\u\)K(\v\)))
for i = 1, 2 , . . . . By assumption (6.14) we have ]Cn=i M e " l ^ Z)^=i ^n|e n | < 7o, i = 1, 2 , . . . . Moreover, continuity of fa implies i
oo
Yl hn\fa(tn) - fa{r)\ < Y hnpfa,T0{\tn - r\) <(T0-s)pfa,To(T0-s),
z = 1,2,... .
This proves \xi\ < \u\ + e2"^-*)
(\x0 -u\ + (To - s)\v\ +
7o
+ (To - s)pfa,To(T0
-
s)La,To(\u\)K(\v\))
< M := |u| + e2wT° (|x 0 - u| + T0|t;| + 7o + ToPfa,T0(To)La,To(\u\)K(\v\)),
i = 1,2,...,
where [w, f] G ^4(r) with u £ Da for some r £ [0,To]. b) Since (6.15) implies YlnLi ^«le™| ^ 7i max„ /i„ = ^ j , we see that |ar«| < M{x0, T0, a, 7i/(2w)) =: M,
» = 1,2,...,
provided u)d < 1/2. We pick 2/0 G A(s)z 0 and set x1 = Xj, z 2 = Zi-i, J/i = J/i, J/2 = J/i-i, A = /ij, ii = tj and £2 = U-\ in (6.7). Observing Xi - Xj_i = /ijj/j + hiei this gives (1 - hiw)\vi + e»| < |e;| + |j/i_i| + |/ Q (ii) - / a ( i j - i ) | L Q ,r 0 (|a;i-i|)(l + |j/«-i|)
6.3. DS-approximations
and fundamental
estimates
193
and consequently to , « (6.16)
^ - ^Vil
^
2
^
+
(1 + l / a ^ ) -
fc.(ti-l)\La,T0(M))\Vi-l\
+ \fa(ti)-fa(U-i)\La,To(M), i = 1,2,... . We set ai = \yi\ FlUiC 1 ~ M - * = 1,2,..., and multiply (6.16) by Y&Jii1 ~ hnw). This gives the recursion ai < (l + 6i)ai_i+6i + 2|ei| < e b i ai_! + bi + 2|e»|,
t = l,2,...,
where 6* = L Q ) T 0 (M)|/ a (tj) - / Q (£j_i)|. Observing ebi > 1 we get by induction i
i
^ < ( a 0 + ][](&«+2|e„|))exp(^&„),
i = 1,2,... .
The estimate 5 3 fe" ^ La,To(M) var[0|7b] / Q ,
« = 1,2,...,
n=l
and wd < 1/2 imply |j/«| < (|2/o| + La,To(M) var[0,7b] / « + 271) exp(2wT 0 + X Q , To (M) var[0,r0] / « ) for « = 1,2,... . Since j/o w a s chosen arbitrary in A{S)XQ, we can replace |j/o| in the above estimate by ||j4(s)a:o||, which proves the result. D 6.1. Remark. 1. It is easy to see that Lemma 6.9, b), holds also if instead of (E2) assumption (El) holds, xo € domyl(s) and the functions fa are of bounded variation on compact subintervals of [0, Tmax). In this case we have \Vi\ < e ^ - ^ f l l ^ x o l l + L Q ,T 0 (M) var[0,Toi fa + 2 7 l ) ,
i = 1,2,... .
2. It is obvious that Lemma 6.9 is also true for finite sequences. 3. The constants M, Mi and M2 depend also on the choice of r G [0, To] and of [u, v] G A(r) with u G Da. But this choice can be done a priori for all s G [0, T 0 ], xo € X and all sequences (U,xt, yi, et)i=i,2,... C [s, T0] x Da x X x X with the specified properties. The next estimates will be useful when we compare two DS-approximations of EP(^4(-)). We first prove an important estimate for sequences more general than those corresponding to DS-approximations. 6.10. Lemma. Assume that either (El) or (E2) is satisfied for the family A{t), t € [0,T m a x ). Given s,s,T0 G [0,T max ) with s < T0, s < T0, a G [0,a+)
194
Chapter 6. Locally Quasi-Dissipative
and XQ,XQ € X, let (ti,Xi,yi,ei)i=it2,... in [0, To] x Da x X x X satisfying
and (tj,Xj,yj,ej)j=i^,...
s =: to < t\ < t2 < • • • <
(6 17)
Xi edomA(ti), J/i = ~
i =
Equations
be sequences
T0,
l,2,...,
e
7
Evolution
i ^ -".{tijXi,
1=
1,2,...,
resp. s=:io
(6.18)
T0, j = 1,2,...,
X J
? ~ ; 3 - 1 - e,- e i4(t,-)*j,
fe =
tj
i = i,2,... .
tj—i
Then, for k > 0 and i > k + 1, j > k + 1, we have T
i!j\Xi
~ fjl -
a
i,j{Ti-\,j\xi-l
~ Xi\ + M e * l )
+ & J \TiJ-l
\xi ~ Xj-11 + ^J |ej |)
+ 7i,il/a(*i) " / a ( * > ) | i a , 7 b ( l * i l ) ^ ( l f o l )
provided u)a,T0 max n= i )2 ,... /i« < 1 and WQ,T0 max„ =1]2 ,... n„ < 1, where *t% — H
t%—\,
flj — tj
Zj—\,
i
j
n=fe+l
«=fe+l
1,2 — L, 2,. . . ,
and (6.19)
aij =
% ,
/ii +
ftj
ftj
= -—4~, «i + hj
7ij =
*i ,
hi + hj
i,j = 1,2,... .
Proof. We set u = wa,T0, ai,j = \xi ~ xj\i M = 1,2,..., and take A = hi, H = hj, xi = Xi, X2 — &j, yi — yi, y2 = yj, h = U and i 2 = ij in (6.9). This gives {hi + hj — u)hihj)ciitj < hi\xj — hjyj — Xi\ + hj\xt - / i ^ - Xj\ + hihj\fa(ti)
-
fa(ij)\La,To(\xj\)K(\yj\).
Using Xi - hiyt = ajj_i + /i^e*, Xj - hjfjj = Xj-\ + hjij, i,j = 1,2,..., and dividing by hi + hj we obtain (1 - u)jij)a,ij
< ctijdi-ij
+
fiijaij-i
+ 7 « ( h | + \ej\ + \fa{U) -
fa{ij)\La,To{\xj\)K{\yj\j).
6.3. DS-approximations
and fundamental
estimates
195
Multiplying both sides of this inequality by T\• • we get (1 - wiij)^
< (1 - whi^ljUijai-u + rSli,j{\ei\
+ (1 -
uhjy^pijaij-!
+ \ej\ + \fa(U) -
f*(ij)\La,To(\xj\)K(\yj\))
for i, j > k. Dividing both sides of this inequality by 1 — oJ^ij yields the result, because we have 0 < T> • < max(l — ujhi, 1 — whj) < 1 — oJ^fij and 7 i j = hiOtij = hjPij.
•
Let (tj)j=o,i,... and (*j)j=o,i,... be increasing sequences in [0, To], To > 0, and set hi = ti — tf_i, hj = tj — tj-i, i, j — 1,2,..., d = maxj /ij, d = maxj /ij and /
(6.20)
„
2
x
1/2
Cij(ff) = (jt; - ^ - a) + d(t* - t0) + d{t5 - t 0 )J
for t,_7, = 0 , 1 , . . . . Then the following estimate is valid: 6.11. Lemma. We have aijCi-ij(a)
+ PijCij-i(a)
< citj(a)
for i,j = 1,2,... and cr € R. Proof. Observing a j j + f3itj — 1 we get by Cauchy-Schwarz K := ai,jCi_i,j(
+
Pij(aj-i{a))2\
From tj_i = U — hi and tj_i = tj — hj we get (U-i -ij
- a)
(U - ij-x -af
= (^ -ij = (ti-
- a) - 2hi(ti - ij - a) + (hi)2, ij -af
- 2hj (U - ij - a) + (hj)2.
Using this and hi < d, hj < d we get after some straightforward computations the estimate K2
<
— (hj ((U-i - ij - a)2 + d(U-i - t 0 ) + d(ij - t 0 )) hi + hj v + hi ({U - ij-x - af + d(U - t 0 ) + d(£,-_i - t 0 ) ) )
= {U - ij - a)2 + d(U - t 0 ) + d{ij - t 0 ) + 7i,j (ht-d
+ hj - d)
2
< {ci,j{a)) .
D
196
Chapter 6. Locally Quasi-Dissipative
Evolution
Equations
When proving existence of DS-approximations we shall use the following lemma: 6.12. Lemma. Assume that either (El) or (E2) is satisfied for the family A(t), t G [ 0 , r m a x ) . Given s,T0 G [0,T max ) with s < T0, a e [0,a+) and XQ G D n d o m i ( s ) , let (ti,Xi,yi,ei)i=ii2,... be a sequence in[0,T0]xDaxXxX satisfying s =: t0 < ti < t2 < • • • < tl>i '
=
ti
ti— 1 \ K,
Xi £ dom A(ti)
T0,
% = 1, Z, . . . ,
and
yi G A(ti)xi,
I^t - z . - i - (U -U-i)yi\
i=
< K(U - * i _ i ) ,
1,2,..., i = 1,2,...,
/or some positive K satisfying KU)a,T0 < 1/2- /n case of assumption (E2) we in addition assume that xo G dom A(s) and \xi — Xi-\ — (ti — tj_i)j/j| = 0. Then we have, for some constant M > 0, (6 22)
T
v\Xi
~Xjl~
'** ~ i j l ^ f c | + n(ti-tk)
+ 2
MPU,T0(T0 - tk)) + K(tj -tk), i,j>k,
where k > 1 in case of assumption (El) and k > 0 in case of (E2). Proof. The estimate (6.22) follows immediately from (hi := U — i i _ 1 , i = 1,2,...) T
if\xi
- xj\ ^ l*« ~ tj\ \Vk\ + K(U - tk) + K(tj ~ tk)
+ M Yl hMa(tn) ~ fa(tk)
(6.23)
n=k+l J
+ M J2 ht\fM - fa(tk)\ e=k+i
for i,j > k. Thus we have to prove (6.23). From Lemma 6.8 with u — xk, v = Uk and r = tk we obtain (observing that je» | < K, % = 1,2...) i
\xi - xk\ Y\ (1 - hnva,T0)
< (U - tk)\yk\ + (k -
tk)n
n=k+l +
i Yl n=k+l
h
n\fa(tn)-fa(tk)\La,T0(\xk\)K(\yk\)
for i > k > 1 in case of (El) resp. for i > k > 0 in case of (E2). By Lemma 6.9, a) resp. b), the sequence (xi)i=i^,... is bounded in case (El) or (E2) holds, whereas (yi)i=i,2,... is bounded in case (E2) holds. Note that
6.3. DS-approximations and fundamental estimates
197
Y^=i hn\en\ < K127=i h"- - KTO i n c a s e o f assumption (El) and Y^i \en\ = 0 in case of assumption (E2). Therefore we can choose M > 0 such that La,To{\xk\)K{\yk\) < M. This gives
\Xi-Xk\
Yl ( ! - ^ n w a , T o ) < {U ~ tk)\yk\ n=fc+l i
+ (U ~ tk)n
+ M ^ /lnl/a(*n)-/a(tfc)|, n=fe+l
* > k,
where A; > 1 in case of (El) and k > 0 in case of (E2). This shows that (6.23) is true for j = k and i > k. Obviously (6.23) is also true for i = k, j > k. If we can show that (6.23) is true for (i,j) provided it holds for (i — l,j) and (i, j — 1), then the result follows by induction. We set a,ij = \xi — Xj\ and get from Lemma 6.10 (for Xi = Xi and Xj = Xj) the estimate
T$aid
< aitj ( T ^ j O i - i j + Mei|) + Pij[Ti^-iOij-i
+ HAUU) -
+ M e jl)
fa{tj)\La,T^\xj\)K{\yi\)
ffc)
(k)
+ li,jM{\fa{ti)
- /«(**)! + \fa(tj) - /«(**)!)•
Substituting in this inequality the estimates for a i - i j and a^j-i according to the induction hypothesis and observing a i j + /3ij = 1, 7 i j = hidtij = hjf3ij we obtain after some computations (6.23). Note that we only need to consider the case i ^ j . •
For A,/x G (0,A0] and s,s,T0 £ [0,T max ) with s < T0, s < T0 and a € [0,a + ) let (#)i=o,...,jv*, (^) i=0 ,...,jv A , (^)i=i,...,jvA and ( e ^ i , . . . , ^ resp. (**),-=o,...,V (*£)J=O,...,JV a%)j=i,...,fr„ a n d ( ^ ) i = i , . . . , ^ be sequences satisfying s
(6.24)
= t* < ^ < • • • < txNx < To,
xf e domA(ti)r\Da, ..A
K=X
i = l,...,Nx,
x% € Da,
Xi
r-<£A(ti)xl
*?-*?-!
i = l,...,Nx,
Chapter 6. Locally Quasi-Dissipative
198
Evolution
Equations
for 0 < A < Ao resp. *= #<#<"-
(6.25)
0 )
j = l,...,Nlt,
xt - xf_ ^ = •ft1^_ - f ^ - ^ 6 ^ ) * ? . for 0 < \i <
AQ.
x%£Da,
J = l.-.^..
We set ft* =
tf-t*_i,
^ = # - £>
t = l,...,iV A , 0 < A < A o , j = i , . . . , jVM, 0 < /i < Ao,
and C/A
=
max
h$, 0 < A < Ao,
and
eL =
max
hf, 0 <
/J. < Ao-
Then we have the following fundamental estimate: 6.13. Lemma. Assume that either (El) or (E2) is satisfied for the family A(t), t G [0,T m a x ). For the sequences (t$, x$, y£, e$) resp. (if, x$, y?, e$) we assume (6.24) resp. (6.25), lim\i0d\ = 0, lim M j,o^ = 0 and s < s. Moreover, let for some constant 70 > 0 (6.26)
l^ol^7o
and
5 3 ^ 1 ^ 1 < 7o,
0
7n case of assumption (E2) we assume that in addition (6.27)
| # | < M,
j = 1 , . . . , TV,,, 0 < ft < Ao,
/or some M > 0. Then, for any r G [0, To] and [w, i>] G ^4(r) wi£/i u G Z) Q , i/iere exists a
constant M > 0 suc/i iftoi /or ant/ positive constants a, 5 and c with 0 < a < 6 < T0, 0 < c < S — a we have, for A, \i sufficiently small, n,j\Xi - x$\ < \XQ - u| + \a% -u\+ (6.28)
+
cid(s - s)(\v\ +
MpfatTo(T0))
£ M + X > M
+ M $ - 5) ( ^ T o W c ^ a ) + P/Q,T0(<*)) /or i = 0 , . . . , N\, j = 0 , . . . , Nfi, where i
3
n,j = I I 0 - - hn"a,T0) l[(l n=l
1=1
- h%watTo),
i = 1 , . . . , Nx, j = 1 , . . . , TV
6.3. DS-approximations and fundamental estimates
199
Proof. By choosing a smaller Ao > 0 we can without restriction of generality assume that ^a,T0dx < 1 and ua,T0dM < -
for 0 < A, n < A0.
We set •*'£|,
x ("i.i * i J — **-'»
i = 0,...,Nx,j
=
0,...,Nll.
The estimate (6.28) is trivial for i — j — 0. From Lemma 6.8 with k = 0 we get, for i = 1,...,N\ (observing also that r^o < 1) Ti,oai<0 < Tifi(\x$ -u\ + \x£ - u\) < \x% -u\ + \x£ -u\ + (t$ - s)\v\ (6 29)
» + J2hn{\en\ n=l
+ \f*ti)
-U(r)\La,To(\u\)K(\v\)),
where r £ [0,7b] and [u, v] G ^4(^), « € Z>Q- For the moment we set Af = ^a,T 0 (|w|)/i"(|v|). Using the estimate \fa(tXn) - fa(r)\
< pfa,T0(\t*
- r\) <
Pfa,T0(T0)
we obtain Tifiaifi
< \x$ -u\ + \3% - u\ + (t$ - s)(\v\ +
Mpfa,T0(T0))
i
+ Ylhn^nl
0
n=l
Observing
Ci,0(s - S) = ((tf - Sf + dxtf - s)) V 2
>t}-8
we see that the estimate (6.28) is satisfied for i = 0 , . . . , N\ and j = 0, 0 < A,/i
< 7P/ 0 ,To(r 0 )|^ J - s - a\ + Pfa,T0(S) + c < -cPfa,T0(T0)coj(a)
+ pu,T0(S)
Pfa,T0(To)
+ Pfa,T0(T0)
200
Chapter 6. Locally Quasi-Dissipative
Evolution
Equations
and consequently
£^|/ a (i>)-/ a (r)|M 71 = 1
< M $ - S)(\pfa,T0(To)coA*)
+ Pf«,T0{5) + P/a,T0{To)).
From this we see that (6.28) is also true for i — 0, j = 0 , . . . , N^ and 0 < A, \i < A0. Next we prove that (6.28) is true for the pair (i,j) if it is true for the pairs (i — l,j) and (i, j — 1). Then (6.28) follows for all pairs (i,j) by induction. To this end we use Lemma 6.10 for k — 0 and get (note that T> • = TJJ) the estimate ,
.
n,jaij
< aij(n--i.jai-ltj
+ h$\e£\) +/3 i , J (r i , J _ 1 a i J _ 1 + hf\ef\)
+ 7i,il/a(^)-/a(^)|La,T 0 (|^|)A-(|^|) foii = l,...,Nx,j = l,...,Nli,0<\,iJ,< \Q. Lemma 6.9, a), applied to the sequences (i^,Xj,yj,e^) exists a positive constant M such that \x$\<M,
j = 0,...,Nfl,
0<M
implies that there
O
.
In case of assumption (E2) we can choose M such that also |#|<M,
j = l,...,Nfl,
We set M = max(LatTo(\u\)K(\v\),LatTo(M)K(M)) njaij
< aij^i-tjai-u
0<M
O
.
and get from (6.30)
+ h$\e$\) + /?i ii (T iij _ 1 a» J _i + hf\ef\)
+ 7i,il/a(t?)-/a(^)|M for i = 1 , . . . , N\, j = 1 , . . . , N^, 0 < A, fi < A0. Substituting the estimates for cii-ij and (hj-i according to the induction hypothesis into (6.31) and
6.3. DS-approximations
and fundamental
estimates
201
observing otij + flij = 1 we have the estimate TijClij
< \XQ -U\
+ \X^ - U\
+ (aijCi-ijis
(6.32)
«=i
-s)+
pitjati-i{s
- s)) (\v\ +
MpfatTo(T0))
t=i
+ M(% - s)(-p/ a ,ro(To)a i jCi_i, i (CT) +
aitjPfatTo{8))
i = 1 , . . . , N\, j = 1 , . . . , Npt, 0 < A, p < Ao, for any positive constants a, <5, c with 0 < a < S < T0 and 0 < c < S — a. This estimate together with Lemma 6.11 implies that njdij
< |a$ - «| + |£g - u| +
CiJ(s
- s)(|«| + Mp / o , T o (T 0 ))
+ £ ^ l + £/>M 71=1
(6 33)
-
^= 1
+ M(% ~ $) (Ipf^ToPoM*)
+ pfa,T0(S))
+ M^-hpij^pf^iTo^j^ia)
+
P/a,To(6))
+ 7Ml/a(tf)-/a(#)l) for i = 1 , . . . , JV\, j = 1 , . . . , iV^, 0 < A, p < Ao- We are done with the proof if we can show that the last term on the right-hand side of (6.33) is non-positive. We choose Ao so that in addition we have also dp < 6 — a — c
for
0 < p < Ao
and set f = \t$ - if\, r' = \a - hf\. This implies f'
and
\r-r'\
<\t$-if+
h$ - a\ <
atj-i(a).
Using also Lemma A.3 we get
HjlUti)
- f«(%)\ = %0ij\Uti)
- fa(%)\ < hffrjPf^Qt*
- tf\)
< hfPij y~pfa,T0 (T0)Cij-i (
•
202
Chapter 6. Locally Quasi-Dissipative
Evolution
Equations
6.2. Remark. Let assumption (E2) be satisfied for the family A(t), 0 < t < Tmax- According to Lemma 6.9, b), the elements y?, j = 0 , . . . , N^, 0 < \x < Ao, are uniformly bounded if cja,T0dfi < 1/2, XQ = XQ G domA(s), 0 < /i < AQ, and ^N, X)j=i \£j\ < 7i, 0 < /x < A0, for some constant 71 > 0. Of course, the latter property holds if e^ = 0. Note that the constant M does not depend on the sequences (t$, xf,y^,e^), but only on u,v and on the uniform bound M for the elements \xf\ and, in case of assumption (E2), also for the elements |y?|,
M =
6.4.
maX(La,To(\u\)K(\v\),LatTo(M)K(M)).
Existence of DS-approximations
For the proof of existence of DS-approximations for EP(A(-),S,XQ) we in addition have to impose range conditions. For families A(t), 0 < t < T m a x , satisfying (El) or (E2) we shall use the following two assumptions: (Rl)
There exist continuous functions a,b : [0, T max ) —> M. with 6 > 0 on [0, T max ) such that for each /3 G [0, a+) and all t G [0, T m a x ), x G Dp n dom A(t) we have liminf - dist (x, (I - 6A(t + 6)) (dom A(t + 6)D Z>v(*+<M,/3))) = °-
We recall that, for given integrable functions a, b, we have 4>(t,s,f3) = (3exp( / a(a)da)
(R2)
+ / b(r)exp(
a (a) da J dr.
For any (3 G [0,a + ) and T G (0,T m a x ) there exists a lower semicontinuous function \^T • Dp -» R+ such that for all u0 G Dp, t G [0,T] and 6 G (0, A/3,T(WO)] ihene exists a us G D C\ domA(i) satisfying -(us -uo)
G A(t)us,
^ (v(u«) - p(«o)) < a(i)
6.4. Existence of DS-approximations
203
6.3. Remark. Lower semi-continuity of \p^ on Dp is only sufficient for the property of Xptr which is really needed: For any x G Dp and any sequence (xn) C Dp we cannot have xn -¥ x and \ptT(xn) -> 0 as n -> oo. The connection between these two range conditions is given in the following lemma: 6.14. Lemma. Condition (R2) implies condition (Rl). Proof. Let t G [0, T m a x ), (3 6 [0, a+) and x G Dp n domj4.(i) be given. Choose p G (0, T m a x - £) and set T — t + p, UQ — x. We set Ao = min(p, \ptT(uo)), where \p,r is the function in (R2). According to assumption (R2) there exists for all i G [0, T] and <5 G (0, A0] a us G D n dom ^ ( i ) satisfying (6.34)
-(u,5 - u 0 ) G A(t)w*,
(6.35)
-(
For £ = t + 6 we have u$ £ D n dom A(t + 6). Equation (6.34) implies uo G (/ — 5A(t + 6))us- We fix e > 0 and get from (6.35) that (see Lemma 6.4), for S sufficiently small,
< V'a.&C* + ^. *>0)>
where 5(*) = a(i) + e,
6(*) = (6(t)4-e)exp(emin(l,l/a m a x (t))),
This shows us G D^_^t+Stt,p),
0 < t < Tmax.
i.e.,
a; = « 0 e (/ - (L4(i + (5)) (A/,. s(t+5,t,/3) n dom A(t + 5)) for 6 sufficiently small. This implies that (Rl) holds with the functions a, b.
D
Whenever the family A(t), 0 < t < T m a x , satisfies (El) resp. (E2) we shall use the following notations: Given s G [0,T max ) and x0 G D with f(xo) < a+ we set T+(s,x0)
= s u p { T € (s,Tmstx)
For any T G [0,T+(s,x0)) +
e (s,T,x0)
| mffi^M,^)) <
a+}.
we set
= sup{e G R + | max ip(fi,s,(p(x0);e) < a+}.
Note that Q + = oo implies T+(s,xo) = Tmax and e+(s,T,XQ) = oo for any s G [0, T m a x ), xo G D and T G [s,T m a x ). As we shall see, mild solutions u(t) of EP(yl(-), S, XO) under appropriate assumptions will exist at least on the interval [s,T+(s,x0)) and satisfy
204
Chapter 6. Locally Quasi-Dissipative
Evolution
Equations
{x G X |
on [s,T] satisfying u\(0) = Xo for all A G (0, A0]. For any
(T, T+(S,XO)), AO can be chosen such that the DS-approximation u\, 0 < A < Ao, is confined to Da, where a = ma,xs
Proof. We choose a To G (T,T + (s, xo)) and set a = maxs
s=
t$
(6.36b)
tf-tf_i
(6.36c)
\x$-x$_i-{ti-tti)Vi\
i=
l,...,Nx, i = l,...,Nx.
Wefixa A > 0 with Xwa>To < 1/2 and T + A < T 0 . From condition (Rl) we conclude that, for each t G [s,T] and each x G D 0 n domA(i) we can choose a S G (0, A] such that there exist x$ G I?v(t+<5,t,a) ^ dom A(t + S) and 2/5 G A(t + (J)^ such that (6.37)
\xs - x - 6ys\ < \5.
For each a; G Da and < € [s, T] we define S(x,t, A) = sup{<5 G (0,A] |(6.37) is true for some xs G -Dv(t+«-t,«) n dom A(t + 5) and 2M G A(i + ^ l a }. For to = s and XQ G -D^XO) n domA(s) we can choose h± G (6(xo,s,\)/2,\] n domA s h such that and a^ G ^(s+hJ.s.vCao)) ( + i), Vi € ^0* + ^1)^1 | i i - a r o - ^ i l / i l < A/iiContinuing in this way we can construct sequences tf = t$_x + hf, xf e A Dwx+hxttxMxx i ) } n dom A{t$) and y* G A ( ^ ) ^ , i = 1,2,..., such that
|a£-a£_i-fciVl
i = l,2... .
6.4. Existence of DS-approximations
205
Observing that ip is increasing with respect to the third argument and that (6.5) holds we obtain
i.e., the sequences (tx), (xx) and (yx) have the properties required in (6.36b) and (6.36c). It remains to prove that, for some N\ we have t^ > T. To this end we suppose that lim^oo tx = To < T. In order to get a contradiction we shall use the following estimate which follows from Lemma 6.12 for (ti,Xi,yi,ei) = (tx,xx,yx,ex) and To = To: For A sufficiently small, i.e., \u)a,T0 < 1/2, there exists a constant M > 0 such that T kj>lX
(6 38)
*
* ~ XjA| " (t> ~ ^ ) ( l ^ ' + 2^pf^aiTo + X(tx-tx) + \(tx-tx),
~ **>) i>j>k.
From this we obtain, for A sufficiently small, l i m s u p | ^ - ^ | < 2 A ( T 0 - ^ ) e 4 w ° ' T o ( r o ^ ) , fe = 1,2,... . i,j—too x ~r \jv w^ o c c that LIXOJU (x \J* ) is a Cauchy sequence in X. Taking k —• oo we see x limj_>oo x . Since ip is lower semi-continuous on X, we have
ip(xx) < liminf ip(xx) < lim ^AM**))
=
Let x
^QAM^))
for k = 1,2,... . According to condition (Rl) there exists an r? £ (0, A/2] and [a;,, yv] £ A(T0 + rj) satisfying \xv -xx - T]yv\ < -rj
(6.39)
and tp(xv) < ip(r0 + r},r0,
We choose k so large that OO
ti+i < \,
>
x
E h < -, i=fc+l
h Then we have rj + YlZk+i A=k+1 i ^
oo
x
^-x k-
OO
x
h
\yv\ Y, i < -^
•.
and
A - A < 4»7-
i=k+l Aa n d
( 6 - 39 )
x (ri+ J2 hi)yri < \xn-x
im
Plies
~r)yr,\ + \xx,-xx\
i=k+l
+ \yr,\ ^ i=k+l
OO
i=k+l
h: r \
206
Chapter 6. Locally Quasi-Dissipative
Evolution
Equations
and tp(Xri) < 4>{T0 + n,TQ,ip{xX))
< I/J(T0
+7],To,1p(To,t£,ip(Xk))) oo i—k-\-l
oo h
Yl
<($+TI+
i>&<*)•
i=k+l
Hence, by definition of 5(xx,tk,
A) we see that
V+ X )
hx<6(xx,tx,X).
»=fc+i
On the other hand, by construction of the sequence hx, we have
so that i] + Yl^Lk+i hX < V, a contradiction, which proves that i^ x > T for some Nx G N. • Our next existence result for DS-approximations assumes the stronger range condition (R2). 6.16. Proposition. Assume that (E2) and (R2) hold for the family A{t), 0 < t < T m a x . Then for any s G [0,T max ), zo G Dndomvl(s) wii/i
= xo,
xx G dom A(^A) n A M ^ ^ X O ) ; , ) >
^€i4(tf)a£, s= tx-tx_x<X,
i = l,...,JV A , tx
l,...,Nx,
*i - xLi ~ (ti - *Li)Vi = 0 ,
i=
l,...,Nx.
6.4. Existence
of DS-approximations
207
We choose the constant 60 = 60(e) according to Lemma 6.4. Assume that we have already constructed xx,...,xx G Da with the properties listed above. Then assumption (R2) with u0 = xx, T = T0 and (3 = a implies that, for hx+1 =
(6.40) and tx+1 = tx+hx+1, such that
mm(\aiTo(xx),X,6o)
there exist xx+l G Dndom A(tx+1) and y£+1 G „A Ui+l
_
X
X
»+l
»
x
~
A(tx+1)xx+1
h
'
"•i+1
hx n i+l
(
< a(tx+1)
From Lemma 6.4 and the choice of So(e) we get ¥>(**+i) < V»(*i A +i,^,v(^);e) <
i>(tx+1,tx,iP(tx,s,
6 41
( - )
= <M^+i> s,y(x 0 );e),
where ^ is denned as in (6.4). We can continue this construction as long as tx + X < To. The proof is complete if we can show that there exists a N\ € N such that ^Nx-l
<
tNx.
As in the proof of Proposition 6.15 we assume that this is not the case, i.e., we have lim^oo tx = TQ < T. Then (6.22) implies - as in the proof of Proposition 6.15 - that (a^)i=i,2,... is a Cauchy sequence. Note that also in this case Lemma 6.12 is applicable. We set xx = Hindoo £*. From (6.41) and lower semi-continuity of ip we get f{xx)
< liminf
< a,
i—>oo
i.e., xx G Da. From tx —• To we conclude that hx —)• 0, which by (6.40) implies that lim \a,T0{Xi)
=0.
Lower semi-continuity of AQjTo(-) on -Dv(^o,«,v(^o);e) c ^ « implies \a,T0(xx) = 0, a contradiction to the fact that Xa,T0 is positive on Da. The constant Ao can be denned as min(l/(2w Q ; r), T0 - T). O 6.4. Remark. The proofs for Propositions 6.15 and 6.16 show that under assumptions (El) and (R2), for any xo G D n domj4(s) with
208
Chapter 6. Locally Quasi-Dissipative
6.5.
Evolution
Equations
Existence and uniqueness of mild solutions
The next question which has to be addressed is concerned with convergence of DS-approximations for EP(A(-), s, XQ), i.e., with existence of mild solutions. 6.17. Theorem. Let s G [0,T max ) be given. a) Assume that the family A(t), 0 < t < T m a x , satisfies (El) and (Rl). Then for any XQ G D n domA(s) with
(6.42)
= Xo
and
u(t; s, x0) G A/,(t,s,v>(*o))>
s
Moreover, U(-;S,XQ) is the unique mild solution of EP(V1(.),S,;EO) on [s,T] and all DS-approximations u\, 0 < A < Ao, of EP(A(-),S,XQ) on [s,T] converge uniformly on [s,T] to u(-;s,xo)- If, in addition, assumption (E3) holds, then u(t; s,x0) e dom A(t) n D,
s
b) Assume that the family A(t), 0 < t < Tmax, satisfies (E2) and (R2). Then for any xo G D n domA(s) with
G dom,4(t)nD,
s
c) Assume that the family A(t), 0 < t < T m a x , satisfies (E2) and (R2). Then, for any XQ G D n dom A(s) with ip(xo) < a+ and any T G (*, T+(s, XQ)), there exists a continuous function u(-\ s, Xo) on [s, T] such that u(s; s, XQ) — XQ, u(t;s,xo) G D$(t,s,v(x0)) J s — t — T, and, provided that in addition assumption (E3) is satisfied, also u(t;s,x0) G dom A(t) n D, s < t < T. The function u(-;s,Xo) is a mild solution of EP(A(-),s,xo)Moreover, for any sequence (xn) C Dp n dom A(s) for some j3 G [0, a + ) with xn ->• x0 as n ^ oo, we have lim
u(t;s,xn)=u(t;s,xo)
n—>oo
uniformly on [s,T], where u(-;s,xn) existing according to statement b).
is the mild solution of EP(A(-),s,x n )
d) //, in addition to (El) and (Rl), dom A(t) is independent oft€ [0, T m a x ), D = dom A(t), then, for any xo G D n D with y(xo) < a+, any T G (S,T+(S,XQ)) and any t G (0,T], the mapping defined by s —^ u(t;s,xo) is
6.5. Existence and uniqueness of mild solutions
209
continuous on [0, t]. If in case of conditions (E2) and (R2) we, in addition, assume that dom A(t) is independent oft G [0, T m a x ), D = dom A(t), then the same conclusion is true for any XQ G D n £> witt y(a;o) < a + . Proof. Throughout the proof we fix T G (s,T+(s,x0)), T0 G (T,T + (s,a;o)), + e0 G (0,e (s,T 0 ,a;o)) and set a = max.s
For A, p 4- 0 we have £fex ->• £,
t^ ->• t, rfA -> 0
and rfM ->• 0.
By definition of Cij(a) in (6.20) we get (observing i 0 = £0 = s) C f e „ i » = ((tl
~ tl - of + dx(txkx ~s) + d ^
- a))
and consequently }™Ckxjli{o-)
= <J.
By definition of ux and uM we have UA(*) —wM(i) = xkx -x^ . From Lemma 6.13 (in case of assumption (E2) see also Remark 6.2 on page 202) we get, for XQ = XQ, s — s, the estimate a£J < \4 -u\ + \x% -u\ + ckx^(0)(\v\ (6.43)
+ i > M n=l
+ M(tl
+
+
Mpfa,To(T0))
X > M i=l
- s)(-cPfa,To(T0)ckx^(a)
+
Pfa,To(6J)
for any a, 6 and c satisfying 0 < < 7 < < 5 < T o , 0 < c < 6—a and any [u, v] G A(s), u G -DQ. For A sufficiently small we have T
kU
^
ex
P( 4w «,To(^o - s)) =: C.
Taking A, /i 4- 0 in (6.43) we get limsup \ux(t) - « M (t)| < C(2|x 0 - u\ + M(T - s)(-pfatTo(T0)a
+
pfa,To(S)))
210
Chapter 6. Locally Quasi-Dissipative
Evolution
Equations
iovs
t£[s,T].
b) We next prove that u(-) is continuous on [0,T}. For t,r G (0,T] we choose feA, jx G { 1 , . . . , NA} such that This implies i£, -> t
and
ft-A
i ^ ->• r
as A 1 0 . T
JA
From (6.20) we get limcfc. ,-. (a) — \t-r
- a\.
AJ.0
Lemma 6.13, for /x = A, s = s, if = tj and xf = x*, gives the estimate \ux{t) - UX{T)\ = \xl
- x$3\<
2\x% -u\+
c f c ^(0)(|t;| + Mpfa,To(T0))
+ 2 J2
ti\e*\
n=l
+ M(t$x - s){-cPfa,To(To)ckx,jx(cr)
+ p/„,To(
fox 0 < a < 5, 0 < c < S — a and [u, v] G A(s), u G Da. This implies, for A 4 0, |«(t) - « ( T ) | < C(2\x0 - u| + \t - T\(\V\ + + M(T - s)(±pfatTo(T0)\t
Mpfa,T0(T0)) -T-
Note that |e*| < A resp. ef = 0 according to Proposition 6.15 resp. 6.16. First taking a —> 0 and setting c = J/2 we obtain |u(t) - U(T)\ < C(2\x0 -u\ + \t- T\(\V\ + +
Mpfa,T0(To))
M(T-s)(lpfa,To(To)\t-T\+pfa,T0{8J))-
Given e > 0 we take u G Da n domyl(s) and J > 0 such that 2C|x 0 - «| < e/3
and
C M ( T - s)p/a,r0(<*) < e/3.
6.5. Existence and uniqueness of mild solutions Then, for fixed v G A(s)u, we define <5i by e Si 3C(\v\ + MpfatTo(T0)(l
211
+ 2(T - s)/S))
'
This implies \u(t) -
U(T)\
< e for \t -
T\
<
SI,
i.e., u is continuous on [s,T]. In order to prove continuity at t = s we choose i G {s,T} and fcA G {1,...,NX} such that t G (t^ A _ 1 ,*^]. By Lemma 6.13 we get fcx ^ , o ! < " 4 1 < 2|x^ - «| + c fc „o(0)(|«| + MPu,To(T0)) +£ ti\e*\ 71=1
for any [u, v] G A(s), u G Da, which, for A 4- 0 gives |u(t) - x 0 | = Hmjx£A - x£| < d ( 2 | x 0 - u\ + (t - s)(\v\ +
MP/QITO(T0))),
where C\ = exp(2u)azT0{T — s)). Choosing u such that 2Ci|xo — u\ < e/2 and
I
s = 1
2Cl(\v\+Mpu,To(T0))
implies that \u(t) — xo\ < e for t — s < Si. c) Let tip, 0 < \i < /io, be another DS-approximation for EP(A(-),s,xo) on [s,T]. For the associated sequences [i^,x^,y^, ij) (with XQ = XQ and e£ = 0, j = 1 , . . . , N^, in case of assumption (E2)), 0 < fi < /xo, we can again assume that they are in [s,Tb] x Da x X x X. Analogously as above, for i e (s,T], we choose k\ G {i = 1 , . . . , iV^} and j M G { 1 , . . . , iVM} with and
<6(
so that t%x -> t as A | 0 and # ((*** " *£ ~ ff)2 + Lemma 6.13
d A
*e(*£.-i>*£J
-4 t as /J | 0. Observing 0^^(17) =
^ ~ s) + ^ ^ X "
S
) ) V 2 -> ^
as A
>/U 0 we get from
limsup \xlx - %J < C(2|x 0 - «| + M ( T - S )(ip/ Q ,T 0 (T 0 ) CT + p / a i T o (<*))) for u G Z?Q n dom A(s) and
0<
0 < c < < 5 —CT,which implies
lim \xxkx - £ £ | = lim |«A(*) - 6„(*)l = 0Since lim^o U A(*) = u(t), this implies that also limM4.o u^(t) = u{t). The DS-approximation constructed in Proposition 6.15 resp. in Proposition 6.16 satisfies
212
Chapter 6. Locally Quasi-Dissipative
Evolution
Equations
t G (s, T] we choose k\ G { 1 , . . . , N\\ as above and get using also lower semicontinuity of ip
= ip(t,s,
resp. for any e e (0,e + (s,T o ,:Eo)),
Thus the result on (p(u(t)) is estab-
d) Next we prove that u(t) G dom A(i) n D for £ G (s,T] provided (E3) holds also. For t G (s, T] we choose againfc>,G {1,. • •, AT*} such that i G (t^ x, ife ]It is clear that t£ _ j - 4 t from the left as A 4- 0 and x£ _x G dom74(i£ _ 1 )fl£) a . The estimate \u(t) - x ^ _ j | < \u(t) - u ^ . J I + |«(^ A _x) -
«A(*^_I)|
together with continuity of u and uniform convergence u\ —>• w on [s, T] show that «(£) = lim^|o x\x-\- Then assumption (E3) implies u(t) G d o m A ( i ) n D Q . Note that Da is closed. e) We next prove Lipschitz-continuity of u(-;s,x0) if assumptions (E2), (R2) hold and XQ G D n domA(s) with ?(^o) < ®+. Let MA, 0 < A < Ao, be a DSapproximation with associated sequences (£*,x*,y*,e*), 0 < A < Ao, converging uniformly to u(-; s, xo) and satisfying XQ = xo and e\ = 0, i = 1 , . . . , N\, 0 < A < Ao- Again we assume that the associated sequences (tf,x^,y^,ef), 0 < A < Ao, are in [s, To] x Da x X x X. Under these assumptions Lemma 6.9, b), implies that there exists a constant M > 0 such that \yl\<M, where y$ = yo G A(S)XQ. { 1 , . . . , N\} such that
i = 0,...,Nx,
0
For t,T G (s, J1] with t < r we choose k\,j\
te(<-i.tkj
and
G
r e (*£_!,£].
For A sufficiently small we have fcA < JA- We apply Lemma 6.13 to the sequences *fcA.*fc>+i'-" a n d f t » ' I * » + i > - - - and get, for s = § = t%x, x$ = x% = u = xxkx, v = yxx, £* = ^ , i^ = tfx, x1* = xxx, the estimate (note that ex = 0) Tkxjx\ux(t)
- U A (T)| = fkxJx\xlx
- xxJ
<^,i,(o)(li/fcJ + Mp/a,To(r0)) + ^
" ^)(^/ Q ,To(To)c f c A j ,( C T ) + p / o , r o ( 5 ) ) ,
6.5. Existence and uniqueness of mild solutions
where fkxJx
= lft=kx+1(l
~ Kua,To)
213
and ckxJx{a)
= {{txkx - i £ - a)2 +
1 In
dx(tjx - t%x))
. Taking A J, 0 first and then a I 0 we get the estimate
|«(*)-«(T)|
< e 2 - - o ( ^ - » ) ( M + Mpfa,To(T0)(l
+ ~ ^ ) + MPfa,T0(S))(r
- t).
Note that M does not depend on r, t. For t G (s,T] we choose k\ G { 1 , . . . , Nx} with t G (*Jt A _i,^J- For j = 0, XQ = u = XQ = £o, ^ = ?/o, « = s, x$ = x%x, t$ = t ^ we get from (6.28) ^ , o | < - *o| < cfcAjO(0)(|yo| +
Mpfa,To(T0)),
which, for A 4- 0, gives \u(t) - xo\ < e2"^T-s\M
+ MPfaiTo{T0)){t
- s).
Thus U(-;S,XQ) is Lipschitz-continuous on [s,T]. f) In order to prove statement c) of the theorem we first observe that XQ G D^t^xo) n d o m i ( s ) = -D^xo) ndomA(s). We choose a sequence (xn>0) C n D
i=
l,...,Nx,
i=
l,...,N^,
for X,(j,e (0,A(e)]. For t G (s, T] we choose k\ G { 1 , . . . , N\} and j ^ G { 1 , . . . , N^} with
Equation (6.28) with XQ = u = xmfi, XQ = xn$ and s — s gives the estimate T
kx,jjux(t)
- ?v00l < \xn,o - xm,o\ + Ckx,jli(0)(\\A(s)xmfi\\
+
MpfatTo(T0))
214
Chapter 6. Locally Quasi-Dissipative
Evolution
Equations
for 0 < a < 6, 0 < c < 6 — a. This implies, for A, \x \. 0, \un(t)
-um(t)\
< e 4 w - T ° ( T ° - s ) ( K o - zm,ol + M ( * - s)(-cPfa,To(To)a
+
pfa
and, taking first er 4 0 and then <5 4- 0, \un(t) - um(t)\ < exp(4wQ,T0(T0 - s))\xn,o - xmfi\,
s
This implies that (u„(-))neN is uniformly convergent on [s,T]. We set u(t) = lim
un{t).
The function u(-) obviously is continuous and satisfies u(s) = XQ. From x£ —• u n (t) as A 4- 0, lower semi-continuity of ip and (6.44) we conclude that
< a,
which for n —> oo gives
s
If assumption (E3) is satisfied, then we have un{t) G domA(t) n Da, s < t < T, n = 1,2,..., by statement b) of the theorem. This implies also that u(t) G dom^(t) n Da, s < t < T. Let (znfi) C Dg n dom^4(s) with 0 G [0, a + ) be another sequence with Zn,o -> xo as n —>• CXD. Analogously as above we get the estimate \u(t;s,xnfi)
-u(t;s,zmfi)\
< exp(4w aiTo (T 0 - s))\xnfi +
-
zmfi\,
where without restriction we have assumed that a G [0, a ) is chosen such that a > max s <(< To]0 < e <e 0 ip(t, s, (3; e). This implies l i m , , - ^ u(t; s, znfi) = u(t) uniformly on [s,T]. In order to prove that u(-;s,xo) is a mild solution of EP(A(-),s,xo) we choose, for each n = 1,2,..., a DS-approximation u^ , 0 < A < Ao(n), of EP(A(-),s,x„ ) o) which converges uniformly on [ s ^ ] to «(•; S, £ra,o) as A 4- 0. The sequences associated with u\" are denoted by (£"' ,x™'A,y™' ,e™'A). We can assume that XQ' = ^n,o and e™' = 0. The associated sequences are again assumed to be in [0,To] x Da x X x X. We choose Ai £ (0, Ao(l)] such that \u^\t) - u(t;s,xh0)\ < 1, s < £ < T, and max;(t]' A - t]'^) < 1 for A G (0,Ai]. Suppose that we already have defined A„_i. We choose A„ G (0,min(A„_!/2, Ao(n))] such that \u^]{t)-u(t-s,xnfi)\ max(V -ti-i)
< -, < Z
s
6.5. Existence
and uniqueness
of mild
solutions
215
for A G (0, An]. We define, for fi G (0, Ai], the step functions u^ by ull = u{£)
for / J G (A n+ i,A„], n = 1,2,... .
It is obvious that u^(0) = xn,o f° r P € (A n +i,A n ], which implies that «M(0) —• xo as /x 4- 0. From d^ = max;(£™'M -i™!^) < 1/n for ^ e (A„ +1 , A„] we conclude that d^ —• 0 as n 4- 0. It is clear that e^ = 0. Therefore wM, 0 < /z < Ai, is a DS-approximation for EP(A(-),S,XQ). For i € [s, T], we have \u^(t) - u(t; s, x0)\ < \itM(t) - u(t; s, xnfi)\ < - + \u(t; s, xnfi)
+ ]u(t; s, xnfi) - u(t; s, x0)\
- u(t; s,x0)\,
This shows %(£) —> u(t;s,xo) uniformly on [s,T] as mild solution ofEP(A(-),s,xo) on [s,T].
0 < p < \n. /J
4- 0, i.e.,
U(-;S,XQ)
is a
g) Assume first that (El), (Rl) are satisfied and that domA(i) = D. We fix t G (0, T]. It is clear that XQ G D n D with (p(xo) < a+ is an admissible initial value for any s,s G [0,t). Without restriction of generality we can assume that s < s. Let u\, 0 < A < Ao, and wM, 0 < p < fio, be DS-approximations for EP(A(-), s,x0) on [s,T] resp. for EP(A(-), s,xo) on [s,T] which converge to u(-) = u(-;s,xo) resp. u(-) = U(-;S,XQ). Furthermore, let (tf,xf,y^e^) resp. (ij,x^,yj',e^) be the associated sequences in [s,To] x Da x X x X resp. in [s, To] x Da x X x X. Once more we choose k\ G { 1 , . . . ,N\} and j M G { 1 , . . . , N^} such that
f
e(«ti.'*Jn(ti^J'
Lemma 6.13 implies the estimate (note that MA(*) = x^x and uM(t) = Xj ) Tk^jM^t)
- ^ ( i ) | < | 4 - u| + |x£ - u| + ckxJXs
n=\
+ M(t^
~ s)i\v\ +
Mpfo,TB{Tv))
(=1
- s)(-cPfa,T0(T0)ckx^(a)
+
pfa,T0(6))
for any [u,v] G A(r), u G Da: r G [0,T], and 0 <
< C2{2\x0 -u\ + (s- s)(\v\ +
Mpfa,T0(T0))^
for any [u,v] G A(r), u G £>a, r G [0,T]. We fix r G [0, T] and choose [u,v] G -A(r), M G Da, such that (here we use that d o m ^ i ) is not dependent on t) 2C2\x0-u\
<e/2.
216
Chapter 6. Locally Quasi-Dissipative
Next we define Si = e( 2Ci {\v\ + Mpfa,r0(To))
J
Evolution
Equations
• Then we have, for \s — s\ <
6\, the estimate \u(t;s,xo)
— u(t;s,xo)\
< £•
For s = t and s G [0, t) we have (again from Lemma 6.13) the estimate kx
rkxfiWx{t)
- 4 | < 2|z0A -u\
+ ckxfi(s
- t)(\v\ + MpfatTo(T0))
+ £
fc*|e*|,
which for A \. 0 gives (with C% := exp(2u; Qi T 0 To)) \u(t;s,x0)
- x0\ < C3(2\x0
- u\ + (t - s)(\v\ +
Mpfa!To(To))^
for any [u,v] G A(r), u G Da, r G [0,T]. Then the result follows as above. T h e proof for t h e case where (E2), (R2) hold and dom A(t) is constant is completely analogous. • 6.5. R e m a r k , a) For parts a) and b) of the proof for Theorem 6.17 (i.e., for the proof of existence of a mild solution) - in case of assumption (E2) it is sufficient t h a t there exists a DS-approximation satisfying XQ = x$ and X)i=*i \ei\ — 7i> 0 < ^ — -^0i for some constant 71 > 0. By Lemma 6.9, b), this guarantees uniform boundedness of \y£\, i — 1 , . . . , N \ , 0 < A < Ao, which - in case of assumption (E2) - is one of the conditions required in Lemma 6.13. b) If assumptions ( E l ) and (R2) are satisfied and the functions fa in ( E l ) in addition are of bounded variation on compact intervals, then, for any XQ & Dpi dom^4(s) with
6.5. Existence
and uniqueness
of mild solutions
217
those with XQ = Xo and ef = 0 ) . There is still the possibility that a more general DS-approximation for EP(A(-), s, xo) converges to a different mild solution of EP(A(-), s, x 0 ). In order to prove that this cannot happen we introduce the concept of integral solutions of EP(A(-),s,Xo). The following considerations provide some motivation for this concept. We assume that (El) or (E2) is satisfied for the operators A(t), 0
We choose r G [s,T] and [x,y] G A(r), x G Dp. According to Lemma 1.3, c), for almost all t G [s, T], there exists an x* G F{u{t) - x) such that Rex*(u(t) -y)
= {u(t) -y,u(t)
-x),
and (see Proposition 1.4) \u(t) ~ x\-r\u(t)
~ x\ =Rex*(u(t))
= Rex*(u(t)
- y)
< (u(t) - y, u(t) - x)i + (y, u(t) -
+Rex*(y) x)s.
This implies — \u(t) — x\ < {u(t) — y,u(t) — x)_ + (y,u(t) — x)+
a.e. on \s,T}.
Since [w(i),u(t)] G A(t) and u(t) G -D/3 a.e. on [s,T], we obtain, using (El) resp. (E2) (see Proposition 6.5, a)), jt\u(t)
-x\<
(y,u(t) ~ x)+ + "0,rHt)
~x\ + L0,T(\x\)K(\y\)\f0(t)
-
f0(r)\
a.e. on [s,T\. Integrating from r to t, s < r < t < T, gives \u(t) — x\ — \U(T) - x\ < I ((y, u(a) - x}+ + u)0,T\u(a) - x\) da (6.45)
Jr
+ L0,T(\x\)K(\y\)
Jr\fp{
This motivates the following definition which goes back to Benilan (see [Ben]): 6.18. Definition. Assume that either assumption (El) or assumption (E2) is satisfied for the operators A(t), 0 < t < T m a x , and let s,T with 0 < s < T < T m a x be given. A continuous function u : [s,T] -t X is called an integral
218
Chapter 6. Locally Quasi-Dissipative
Evolution
Equations
solution of ¥JP(A{-), s, Xo) if and only if u(s) = XQ and there exists a constant /3 G [0, a+) such that (6.45) holds for s < r < t < T, r G [s, T] and [x, y] G A(r) with x G Dp. The next result is concerned with the connection between mild and integral solutions for EP(A(-),s,x0). 6.19. Theorem. Assume that either (El) or (E2) holds for the operators A(t), 0 < t < T m a x , and let s G [0,T max ), x0 G DndomA(s) with
on [s,T] and we can choose any
b) In case of assumption (E2) we assume in addition that for the DS-approximation which converges to u the associated sequences (y^)i=i,...,jvA; 0 < A < Ao, are uniformly bounded. Ifv is an integral solution of EP(A(-), s, v(s)) on [s, T], then there exists a (3 G [0, a+) such that (6.46)
\v{t) - u{t)\ < e^' r ( t " s ) |t>(s) - u(s)|,
s < t < T.
Proof, a) We first prove that u is an integral solution. Let {t^,xf, yf, ef) be the sequences associated with a DS-approximation which converges to u uniformly on [s,T]. We fix j3 G (a,a+). From Lemma 1.3, b), and (1.4) we see that (y,x}--(z,x)+<(y-z,x)-,
x,y,zeX.
This together with (6.8) implies that for any [x,y] G A(r) with x G D0 we have, for i = 1 , . . . , N\ — 1 and A sufficiently small,
(Vi,Xi -x)--
(y,^A-x)+
< {yf
-y,4-x)-
This gives
< (y,x}-x)+
+
Using h^y* = x\ - x— {x\_x — x) — h$e$ and Lemma 1.3, a), we get h$(y?,x$ - x)_ = {h$y?,x$ - x)- = {xxt - x - (a£_i - x) - h}e?,x$ - x)_ = \x? -x\ + ( - ( < _ ! - x) - h$e$, a£ - x)_ > <- \x? \^i -x\~ A ~ |a£_i \xi-\ -x\-
hflefl
6.5. Existence and uniqueness
of mild solutions
219
and consequently k A -x\-
\x$_i -x\<
{h$y*,x$ - x)- + h*\e?\
< h*(uPtT\x$
-x\ + (y,xf - x)+ + Clfptf)
- f0(r)\
+ |e?|).
Taking the sum from j + 1 to k, where 1 < j < k < N\, we get k x
\x k-x\-\x$-x\<
k h
Y,
(6.48)
i^\
+C £
i=j+1
i=j+1
+ /
{UJ3,T\U\{<J) -X\
~ ff>(r)\
tiWi)
+ {y,ux(cr) - x)+)
da.
Given T, t G [s,T), r < t, we choose j\,k\ G { 1 , . . . ,N\} such that r G ( ^ _ i , * j j a n d i £ ( ^ - l ^ i t j ( m c a s e r = s we take j A = 0, i.e., i ^ = s). Note that fcA < N\ — 1 for A sufficiently small. Then we obviously have x
)\
= U
^(T) ~^ U(T)
an
d
^\x — u\{t) —> u(t)
as A 1 0 .
Moreover, we have t]x ->• r, t^ -> t and X ^ + i ^ A |e*| < E ^ i ^ 1 ^ 1 ^ 0 as A J, 0. Continuity of / implies £
ti\Mti)
- //3WI -> / \f0W) - //J(r)|
as A | 0.
JT
i=jx + l
Since u\(a)—x —> u(a)—x as A \. 0 uniformly on [5, T] and (•, -} + is upper semicontinuous (Lemma 1.3, d)), we see that, for any e > 0, there exists a A(e) > 0 such that (y,u\{o) - x)+ < (y,u(cr) - x)+ + e for A G (0, A(e)], a G [s,T], so that we have limsup / AJ.0
Jt*
(y,u\(a)
— x)+da
< I {y,u(a) — x) + da. JT
Taking on both sides of (6.48) the limsup as A J. 0 we obtain (6.45) for s < T < t
-- fa(r)\) f0(r)\) da
220
Chapter 6. Locally Quasi-Dissipative
Evolution
Equations
for s < T < t < T, r G [s,T] and [x, y\ G A(r) with x G Dp. Since [x$, y*} G A(tf) and x$ G Dp (for /3 appropriately chosen), we obtain (6.49)
\v(t) - x$\ - \V{T) - x$\ < J (U>0,T\V(
~ xi)+ + C\M
- fp(t})\)
da
for i = 1,...,N\ - 1, where C is chosen such that C > Lg:T{\Xi\)K(\yx\), i = 1 , . . . , Nx - 1, 0 < A < A0. From h$y£ = x$ - v(a) - (x^ - v(a)) - h^ef we get h${y?,v(
tf(K*)-^|-Kr)-^|) < J (W
~ \v(
+ j\}{C\fp(a)-fp(t})\
+ \e*\)da.
Summing up both sides from i = j + 1 to i = k, j < k, gives
/fc(w*)-«A(oi-Wr)-«A(oi)de < J (\v(a) - ux(t$)\ - \v(a) - ux(txk)\) da
(6.50)
+
I
U0,T\v(a) -
ux(Q\d£da
j
+ C [{it hx\fp(o)-fp{tx)\)da JT
i=3 =3+ + l1 k
i=j+l
For arbitrary rj, p with s < rj < p < T and A sufficiently small we choose jx, kx G { 1 , . . . , Nx - 1} such that txx -+ rj and txx -+ p as A \. 0. Taking A \. 0
6.5. Existence
and uniqueness
of mild solutions
221
in (6.50) gives (by analogous arguments which led from (6.48) to (6.45)) P
/
(M*)-«(0I-KT)-«(0IK
Jri
(6.51)
+ j < l Jr
{\v(a) - u(p)\ - \v(a) - u(n)\) da
l (u0tT\v{o)
- « ( 0 | + C\f0(a) - f0(i)\)
dadi.
J 7]
For he (0, T - s) we define the function Fh : [s, T - h] —> [0, oo) by -i
Taking r-tt,
t-tt
pt-\-h
pt-\-h
+ h, r)->t and p -» i + ft in (6.51) we see that
d
C
JtFh{t)
ft+h
+— J
Pt+h J
\ff>{o)-m)\tedZ,
s
which by Gronwall's inequality implies Fh(t) < e^^~^Fh{s)
+ -^j
^T{t-r)
J
j
]f0{a)
_
m ) ]
d(jdidT
From this we get for ft \, 0 (observe that u, v and fp are continuous) \v{t) - u{t)\ < ew"-T(t-<,)|r;(s) - u(s)\,
s
Concerning uniqueness (and existence) of mild solutions we have the following result: 6.20. Theorem. Assume that assumptions (El) and (Rl) resp. (E2) and (R2) hold for the operators A{t), 0 < t < T m a x . Let s € [0,T max ), x0 € D n d o m A ( s ) wiift
- v(s)\,
s
Proof, a) Assume that (El) and (Rl) hold. According to Theorem 6.17, a), there exists a mild solution u{-;s, XQ) on [s,T] satisfying
s
Theorem 6.19 implies that U(-;S,XQ) is an integral solution and for any integral solution v on [s, T] there exists a (3 e [0, a+) such that (6.46) holds. This implies that mild and integral solutions of EP(A(-),s,x0) coincide and are unique.
222
Chapter 6. Locally Quasi-Dissipative
Evolution
Equations
b) Assume now that (E2) and (R2) hold. Choose a sequence (xn) C Da f] dom A(s) with a = ip(xo) such that xn —> Xo as n —t oo. By Theorem 6.17, b) and c), there exist mild solutions un of EP(A(-),s,xn) on [s,T] such that un(t) —> u(t) uniformly on [s, T], where u is a mild solution of EP(^4(-), s, xo). According to Theorem 6.17, b) resp. c), we have ip(un(t)) < tp{t, s, ip(xn)) < max ip(t, s,a),
s
s
resp. tp(u{t)) < ijj(t, s, ip(xo)) < max ip(t, s ; a),
s < t < T.
s
From Theorem 6.19, a), we conclude that u and un, n = 1,2,..., are integral solutions of EP(^4(-),s,xo) resp. EP(A(-),s,xn), n = 1,2,..., on [s,T]. Moreover, we can assume that the DS-approximations u™ which converge to un satisfy u^(s) = xn and e™' = 0 (see Proposition 6.16). According to Lemma 6.9, b), the sequences (j/™' ), for each fixed n, are uniformly bounded with respect to i and A. Therefore we can use Theorem 6.19, b), which implies, that for any integral solutions v of EP(A(-)) on [s, T] there exists a f3 G [0, a+) such that K(t)
- v(t)\ < e^-T{t~s)\xn
- v(s)l
0
For n —¥ CXD this gives
\u{t) - v(t)\ < e^^-'^s)
- v{s)\,
s
This implies again that mild and integral solutions of EP(A(-),s,x0) coincide and are unique. Moreover, for any two mild solutions u,v of EP(A(-),s) on [s, T] there exists a /3 e [0, a+) such that (6.46) holds. • 6.21. Definition. Let G(t), 0 < t < T m a x , be a family of subsets of X. A family U(t, s) : G(s) ->• G(t), 0 < s < t < T m a x , of operators is called an evolution operator if and only if the following is true: (i) U(t, s)x = U{t, r)U(r, s)x for x G G(s) and 0 < s < r < t < T m a x , (ii) U(t, t)x = x for x e G(t) and 0 < t < T m a x and (hi) for each s G [0, T max ) and x G G(s) the mapping t —>• f/(i, s)x is continuous on [s,T m a x ). Let the operators A(t), 0 < t < T m a x , satisfy assumptions (El), (E3) and (Rl) resp. (E2), (E3) and (R2) with a+ = oo. In this case we have T+(s,x0) = T m a x for all s G [0,Tmax), x0 G D. We define the operators U(t, s ) : J ) f l d o m i ( s ) - 4 i ) n dom~A(t) by (6.52)
U{t,s)x = u(t;s,x),
x£ DndomAjs),
0<s
6.5. Existence
and uniqueness
of mild solutions
223
where u(t; s, x) is the unique mild solution of E P ( J 4 ( - ) , S, X) on [s, T max ) according to Theorem 6.20 (for a+ = oo). We have the following theorem: 6.22. Theorem. Assume that (El), (E3) and (Rl) resp. (E2), (E3) and (R2) are satisfied for the operators A(t), 0 < t < T m a x , with a+ = oo. Then the family of operators U(t, s), 0 < s < t < T m a x , defined in (6.52) is an evolution operator. For any (5 > 0 and T G (0,T max ) we have the estimate (6.53)
1*7(4, s)x - t/(i, s)x\ < eUa-T^-s) \x - x\
for 0 < s < t < T and x, x G Dp n dom ^4(s), w/zere a = maxo
\U(t + s,s)x-U(t < e^^\x
+ s,s)x\ -x\ + C f e u - T ( t - T >|/ 0 (T + s) - / Q ( r + s)\dr
for s,s G [0,T), 0 < t < T - max(s, s) and £ e Dp n domA(s), i e fl^fl domyl(s) m case assumptions (El), (E3) and (Rl) /20/d wiift a + = oo resp. x G Dp n domA(s), £ G DR n domA(s) in case assumptions (E2), (E3) and (R2) hold with a+ = oo. As before a = max0<£
= u(t;s,x),
r
This proves U(t,r)U(r,s)x = U(t,s)x. Thus the family U{t,s) is an evolution operator. Let j3 > 0 be given and choose x G Dp n dom^4(s). Then Theorem 6.17 gives U(t,s)x
G A/>(M,VO)) C A/<(M,/3)>
0 < s < t < T.
This implies that, for any x £ Dp n dom A(s), the mild or, equivalently, integral solution U(-,s)x is confined to D Q with a = maxo<*
224
Chapter 6. Locally Quasi-Dissipative
Evolution
Equations
In order to finish the proof we set To — T — max(s, s) and define, for h £ (0, T 0 ), the function Gh : [0, T0 - h) -> [0, oo) by -i
pt-\-h
G
h{t) = -j^j
pt-\-h
I
\u(a + s;s,x)-u(£
+
s;s,x)\dad£,.
The functions «(•; s, x) = U(-, s)x and u(-; s, x) = U(-, s)x are integral solutions of EP(A(-),s,x) on [s,T] resp. of EP{A(-),s,x) on [s,T\. Without loss of generality we assume that s < s. By Definition 6.18 we have \u(i; s, x) - x\ - \u(f; s, x) — x\ /g
55 x
< / (u>aiT\u(a; s, x)-x\ + {y, u(a; s, x) - x)+) da + La,T(\x\)K(\y\)
J\fa(a)
-
fa(r)\da
for s < f < i < T, r £ [s,T] and [x, y\ £ A(r) with x £ Da. Let ux, 0 < A < A0, be a DS-approximation of EP(A(-), s, x) on [s, T] which converges uniformly on [s,T] to u(-;s,x) with associated sequences (t^,xf,y^, e*) (satisfying Zo = 0 and e\ = 0 in case of assumption (E2)). Since we can take [x,y] = [x*,y*], i = 1, 2 , . . . , N\ — l, in (6.55), we see analogously as in the proof of Theorem 6.19 that, for s < r\ < p < T, / (\u(i;s,x) -u(£;s,x)\ J-n (6.56)
- \u(f;s,x)
+ / (ju(a;s,x) < /
/
-u(£;s,x)\)d£
—u(p;s,x)\
— \u(a;s,x)
-
u(r);s,x)\)da
(va,T\u(v-,s,x)-u(£;s,x)\+C\fa(a)-fa(£)\)dad£,
where C is defined as in the proof of Theorem 6.19. We introduce the functions v(a) = u(a + s;s,x),
0 < a < T0,
u{i)=u{^
0<£
+ s;s,x),
and take i = t + h + s, p — t + h + s, f = t + s and TJ = t + s with t £ [0,TQ — h], h£ (0,T 0 ). Then we get t+h
/
rt+h
(\v(t+h)-u(Z)\-\v(t)-u(Z)\) rt+h <
/
Jt
dt+J
(\v(a)-u(t+h)\-\v(a)-u(t)\)
rt + h / (u>a,TH(T)-u{$)\ + C\fa(a + 8)-fa(Z
Jt
da
+ s)\)d
6.5. Existence
and uniqueness
of mild solutions
225
This and the definition of Gh{t) imply
JtGh(t)<Wa,TGh(t) + -^ J
J
\fa{
+ 8)\d(TdZ
for 0 < t < To — h, so that e^TtGh{<S)
Gh(t) < +
WJ
eUJaMt T)
~
f
f
\U
for 0 < t < To — h. Since u and / are continuous, we get for h I 0 \u(t + s;s,x)-u(t
e"a'rt\x - x\
+ s;s,x)\<
+ C f e""^t-^\fa(T Jo
+ s)-fa(T
+ s)\dT
for t € [0, T 0 ], which proves (6.54).
•
We strengthen the range condition (R2) by demanding that A ^ T O in (R2) depends only on T. Moreover, we shall use assumption (R2') from below only (R2') For all T G (0,T m a x ) there exists a X0 = A0(T) > 0 such that for all UQ £ D, all A € (0, Ao] and all t E [0, T] there exists a u\ e D n dom A(t) with 1 -(ux
(6.57)
- u0) e A(t)ux
and (6.58)
- (
The range condition (R2') in particular implies that (I - XA(t))(D n dom A(t)) D D
for A € (0,A o (T)], t£ [0,T].
The following lemma shows that a more detailed result can be given. 6.23. Lemma. LetT e (0,T max ) be given and assume that (El) or (E2) with a+ = oo together with (R2') are satisfied for the operators A(t), 0 < t < T m a x . For a > 0, we set AQ = min(l, A 0 (T), l/(2a m a x (T)), l / | w a , r | ) . Then there exists an increasing function 0 : K j —» E j with 0(a) > a for a > 0, such that Dac{I~
XA(t)){D0{a)
n dom A(t))
226
Chapter 6. Locally Quasi-Dissipative
Evolution
Equations
for 0 < A < \p(a) and 0 < t < T. Moreover, for 0 < A < \p(a) and 0
with dom J(xa)(t) D Da and \j[a\t)x
- j[a\t)y\
< ——-
\x - y\,
x,y€
Da.
Proof. Let u0 G Da and A G (0,min(l, A 0 (T), l/(2a m a x (T)))) be given. We choose MA according to condition (R2'). Inequality (6.58) and A < l/(2a m a x (T)) imply in case a(t) > 0 that f{ux) < Muo) + 2A6 max (T) <2a + 26 max (T), where bmixx(T) = maxo
[/(*, s)a:0 = lim
]7
\
J A a ) (s + jA)
x0,
s
Proof. We choose To G (71, T max ) and set a = max s < t
i=
0,...,N;A,
where ATA = [(T - s)/A] + 1 if (T - s)/X is not an integer and Nx = (T - s)/X otherwise. Furthermore, we define the sequences (x*)i = o JVA, A G (0, AJg(Q)), by
X0-
6.5. Existence and uniqueness
of mild solutions
227
The sequences ( x ^ ^ o , . . . , ^ exist for all A G (0, Ao] for Ao sufficiently small. This can be seen as follows: according to (6.58) we have -(
i=
l,...,Nx.
We set e = 1 in Lemma 6.4 and choose A G (0, min(A0, \p(a))) • Then Lemma 6.4 implies that
= a
S
for A = 1 , . . . , N\. This proves xf G Da, i = 0 , . . . , N\, so that «7A (s + ityxi is defined tor i = 0,... ,N\. By construction of the sequences (xf) we have Vi =
'
i-1 A
e 4(a + iA)a£,
i = 1 , . . . , Nx, 0 < A < A0.
This shows that the sequences (i\)i=o,...,N^, (a^)i=o,...,j\r*, (Vi)i=i,...,Nx and e\ = 0 are the sequences associated with a DS-approximation u\, 0 < A < A0, forEP(A(-),s,i0). • 6.25. Theorem. £ei C be a closed subset of X and assume that the operators A(t), 0 < t < T m a x , satisfy (E3) and the following conditions: (i) For any T G (0, T max ) i/iere exists a constant LOT G K sucft £/ia£, /or aZZ T)|a:i - x 2 |
< |n - x2 - A(yi - y2)| + A|/(tx) - /(t2)|ir(k21)^(|2/21) /or 0 < A < 1/\UIT\, where LT • Mo" —• RQ" *S increasing, f : [0,T max ) —>• X zs continuous and either K(r) = 1 or -ftT(r) = 1 + r. In case K{r) = I + r we assume that f in addition is of bounded variation on compact subintervals of [0, T m a x ). (ii) For any T G (0,T max ) there exists a constant AT > 0 such that, for A <E (0,AT] andte [0,T], C C (/ - A,4(i))(dom A(t) n C). Furthermore, we assume thats,T G [0,T max ) with s < T andxo G CndomA(s) are given. Then the unique mild solution U(-;S,XQ) of EP(^4(-), s, xo) is given by [(t- S )/A] M(£;S,X 0 ) = lim
JJ
(/ - A^4(s + jA))
^o,
s < t < T.
Chapter 6. Locally Quasi-Dissipative
228
Evolution
Equations
The evolution operator U(t,s) : C fl dom A(s) —> C fl dom A(t) (as defined by (6.52)) satisfies \U{t,s)x -U(t,s)y\
< eUT{t~s)\x
- y\,
s
x,y £ C
ndomA(s).
Proof. We define the lower semi-continuous function ip on X by (compare Example 6.2) . ,
[o I oo
for x e C, lor x f C.
Consequently we have Da = D = C for all a > 0. Then assumption (i) implies that assumption (El) resp. (E2) is satisfied for the operators A(t), 0 < t < T m a x , with a+ = oo. Assumption (ii) implies that, for all T E (0,T m a x ), uo £ C, t e [0, T] and A e (0, AT], there exists a «A G dom A(f) n C with u0 Q (I - \A(t))u\, i.e., - ( « A - « o ) e A(i)wABy definition of ip we see that (6.58) is satisfied with a = b = 0. Thus the range condition (R2') is satisfied. Assumption (i) implies also that I — \A(t) restricted to CC\domA(t) has an inverse for 0 < A < l/|a>r| (compare Proposition 1.9). Then the result follows from Proposition 6.24 together with Theorem 6.22. • 6.6. Remark. It is clear from the proofs for the results presented in this chapter that in assumptions (El) resp. (E2) we can replace the term \fa{t) — fa(s)\LatT(\x2\)K(\y2\) by m
( E !/<.«(*) " fUs)\xe)La,T(\^\)K(\y2\), where for a fixedTO€ N and normed spaces Xg the functions ft
6.6. Autonomous
problems
229
Moreover, we assume that for the elements u$ existing according to assumption (R2) we have -jj(
s
x0),
6(r)expf/
a{a)da\dT.
where ${h,ti,[3)
= 0exp(
6.6.
/
d(a)da)+
Autonomous problems
If in Theorem 6.25 we assume that the operators A(t) do not depend on t, i.e., A(t) = A on [0, oo), then assumption (E3) is automatically satisfied. Assumption (i) resp. (ii) of Theorem 6.25 reduces to w-dissipativity of A for some u! € K resp. to the range condition (5.5) if we take C = d o m A Then Theorem 6.25 reduces to the Crandall-Liggett theorem (Theorem 5.3 resp. Corollary 5.4). From Theorem 6.22 we get the following generation theorem for nonlinear Co-semigroups: 6.27. Theorem. Assume that A C X x X is co-dissipative and satisfies the tangential condition (6.59)
liminf — dist(range(i - XA),x) = 0 for all x G dom A. AJ,0
A
Then the problem (d/dt)u 6 Au, w(0) = x, has for any x G domA a unique mild (or, equivalently, integral) solution u(t;x) on t > 0. The family S(t), t>0, of operators defined by S[t)x = u(t;x),
t > 0,
xedomA,
is a strongly continuous semigroup of type ui on d o m A Proof. We choose D = domA and define ip as in Example 6.2. Then, for A(t) = A, assumption (El) with a+ — oo reduces to w-dissipativity, (E3) is automatically satisfied and (Rl) reduces to (6.59). Note that we can choose a = b = 0 in the definition of ip, i.e., we have I/J(T,0) = f3, and that Dg = D for all j3 > 0. •
230
Chapter 6. Locally Quasi-Dissipative
Evolution
Equations
6.28. Theorem. Assume that A C X x X is a single-valued continuous and dissipative operator with domA — dom A If A satisfies in addition liminf — dist(range(i" — XA),x) = 0 for all x £ domA, A4-0
A
then A is the infinitesimal generator of a Co-semigroup S(-) of contractions on domA. Moreover, A is strictly dissipative and, for any x £ domA, u{t;x) = S(t)x, t > 0, is the unique strong solution of (d/dt)u = Au, u(0) = x. Proof. Strict dissipativity of A follows from Theorem 5.14, a), once we have shown that A is an infinitesimal generator. Existence of a Co-semigroup S(-) of contractions on domA follows from Theorem 6.27. This semigroup is given by S(t)x = u(t;x), t > 0, x 6 domA, where u(-;x) is the unique mild solution of {d/dt)u = Au, u(0) — x. In order to prove that A is the infinitesimal generator of S(-) we choose T > 0 and a DS-approximation (ux)o<X<Xo f° r the evolution problem with operator A satisfying limu\(t)
= u(t;x)
uniformly on [0,T].
Let (tx,xx, Axx,ex) be the sequences associated with this DS-approximation (compare Definition 6.6). Note that yx = Ax*, because A is single-valued. From j^(xx
- xti)
~ ex = Axx,
i=
l,...,Nx,
we get by induction k
k
x
k = 4 + ^hxAxx
+ Y,hxex,
i=l
Given t 6 (0, T] we choose kx such that tx
ux it) = 4 + /
k=
l,...,Nx.
i=l
i
Au
\ (T) dT+Y\ hiei
Jo
(6.60) x
+ / AUX{T) dr + (txkx - t)Aux{t) + V
hxex.
From limA4.o u\(i) = u(t) and continuity of A we see that Au\(t) is bounded as A 4. 0, so that limA;o(ifcA - t)Aux(t) x
= 0. Using this and lim Ai0 Yli=i hiei
x
lim Ai0 E j ^ i h \e \ = 0 in (6.60) we get (taking A | 0) (6.61)
u(t) = x + lira / MO J0
AUX(T)
dr.
<
6.7. "Nonhomogeneous"
problems
231
Given e > 0 and t £ [0,T] we choose St > 0 such that |Ay - Aw(t)| < e/2 for |y - u(t)\ < St. Since the set M = {Au(t) | 0 < t < T} is compact, there exist * i , . . . , tm G [0,T] with M C U7=i B{u{tj),8tj/2). We set * = min i=1 ,..., TO £ t ./2 and choose Ai > 0 such that \U\(T)—U(T)\ < S for all A € (0, Xi) and r £ [0, T]. For £ e [0,T] we choose j £ { 1 , . . . ,m} such that |u(t) - u(tj)\ < Stj/2. Then we have, for 0 < A < A1; \ux(t) - u{tj)\ < \ux{t) - u{t)\ + \u{t) - u{tj)\ <S + St./2 < 8tj. By choice of 6tj we get \Au\(t) - Au(tj)\ < e/2 and consequently \Au\(t) Au{t)\ < \Aux\t) - Au{tj)\ + \Au{tj) - Au(t)\ < e/2 + e/2 = e for A G (0, Ai). This proves limA^o Au\(t) = Au(t) uniformly on [0,T]. Then equation (6.61) implies u(t)=x+
/ Au(r)dT, te[0,T], Jo From this we see that u(t) is a strong solution and lim - v (S(t)x — x); — Ax no t
xedomA.
for all x £ dom A,
which proves that A is the infinitesimal generator of S(-). 6.7.
D
"Nonhomogeneous" problems
In this section we consider Cauchy problems of the form EP{A{-),g,s,xo)
max 7
at u(s) =
XQ,
where A(t) cXxX,0
B{t) = {[x,y + g{t)]\[x,y}£A{t)},
0 < t < Tmax,
then EP(A(-),g,s,xo) is equivalent to the Cauchy problem EP(f?(-), S,XQ). However, the assumptions on the time dependence of the operators A(-) we imposed in this chapter (see assumptions (El) resp. (E2)) would imply that we have to assume g continuous resp. continuous and of bounded variation. In order to admit g G L 1 (0, T; X) for any T G (0, T max ) we would have to allow that the functions fa in assumptions (El) resp. (E2) are integrable only. Existence and uniqueness results under these weaker conditions exist (see for instance [Ev]) in case of m-dissipative operators. To extend the theory developed in [Ev] to the case of locally quasi-dissipative operators at least would involve a
Chapter 6. Locally Quasi-Dissipative
232
Evolution
Equations
lot more technicalities as already present in the theory. Therefore we treat the problem EP(A(-),g,s,xo) directly. As in the other sections of this chapter
\U(T)
— x\
(6.63) < I
({V + 9(
+ L0tT(\x\)K(\y\) J for all r,t,r
- x\) da
\f(,(*)-ff,{r)\dv
E [s, T] with r < t and [x, y] G A(r) with x € Dp.3
We have the following result analogous to Theorem 6.19: 6.30. Theorem. Assume that either (El) or (E2) is satisfied for the operators A(t), 0 < t < T m a x . Let s,T G [0,T max ) with s
- v{s)\ + f e^^^lg^r)
-
52(r)|
dr
If u is an integral solution of EP(B(-), s, XQ) we have g(r) instead of g{a) in the first integral on the right-hand side of (6.63).
6.7. "Nonhomogeneous"
for all te
problems
233
[s,T\.
Proof, a) Let u\, 0 < A < Ao, be a DS-approximation of EP(B(-),S,XQ) on [s, T] which converges to u with the associated sequences (t^, x*, y£, ef). From yl € A($)xf + g{tf), i = 1 , . . . , Nx, we get, for y$ := y* - g(t$),
v* = XA
S " 1 " e " ~9(ti)
e A(tf )a£,
i = i,...,iV A .
We choose /3 e (a,a+), r £ [s,T] and [x,y] e A(r). Since [x*,j/*] 6 ^(i*) and x* G Dp, i = 1 , . . . , iV\, for A sufficiently small, we get {Vi + g(*i), ^ ~ x)- -(y + g(t$), a£ - x)+ < (Vi ~ V,x$ - *>- <
LU0,T\X}
- x\ + C\f0$)
-
fp(r)\,
where C = Lp
+ /
{U0,T\U\{
da
for 1 < j < k < Nx - 1, where #A is denned by #A(CT) = g{t$) for a € ( ^ „ j , t£]. Note that g\ ^ g uniformly on [s,T] as A i 0. Exactly the same arguments as in the proof of Theorem 6.19 lead to inequality (6.63). b) Let u be a mild solution of 'EP(A{-),g\,s, xo) and v be an integral solution of EP(A(-),g2,s,v(s)) on [s,T]. As in part b) of the proof for Theorem 6.19 we obtain (for /3 sufficiently large and A sufficiently small) the estimate \v{t) - a£| - \V{T) - x}\ < J (UJ0,TH(T)
- x$\ + (y? + 52(a), v(a) - x$)+) da
+ C'J*\ffi(
234
Chapter 6. Locally Quasi-Dissipative
Evolution
Equations
we get as in the proof of Theorem 6.19 the inequality J\\v{t) < f
- « ( 0 | - \V(T) - u ( 0 | ) d£ + J (\v(a) - u(p)\ - \v(a) - «(r,)|) da !\U0,T\V{O)
- « ( 0 | + C\f0(a) - fp(Z)\
+ |92(a) -
9l(Q\)
d<7d£.
From this we get for the function F& : [s,T —ft]—>• [0,oo) defined by -i
F t
pt-\-h
pt-\-h
^ )=tf]
J
H
the estimate
^F f t (i) < up,TFh{t) + -^J ~i
pt-\-h
+ JjiJ
J
\f0(a) ~ JMOI dad*
pt-\-h
J
\92(o)-9i(0\dadt
for s < t < T — h. Using Gronwall's inequality and then taking /i J O we get (6.64). • In order to prove existence of mild solutions for EP(A(-), g, s, x$) we shall also need the following range condition (as in case of the range conditions (Rl) and (R2) it will only be imposed for families A(t), 0 < t < T m a x , satisfying (El) or (E2)): (R2g) For any (3 G [0, a+), T G (0,T m a x ) and any continuous function g : [0, T max ) -* X there exists a lower semi-continuous function Xp,T,g '• Dp —» R+ such that for all UQ G Dp, t G [0,T] and 5 G (0, A/3,T,g(tio)) there exists a us G DndomA(t) satisfying -(us
-MO) 6
A(t)us+g(t),
- (
6.7. "Nonhomogeneous"
problems
235
T £ (0, T max ) we have also
uniformly with respect to t £ [s, T] for all T £ (s, T max ) and (3 £ M. 6.31. Lemma. Assume i/iai (El) resp. (E2) is true for the family A(t), 0 < t < T m a x , and that g : [0,T max ) -^ X is continuous in case of (El) resp. continuous and of bounded variation on compact intervals in case of (E2). Moreover, assume that in addition (R2g) is satisfied. Then the operators B(t), 0 < t < T m a x , defined by (6.62) satisfy (El) resp. (E2) (with the same a+) and in addition (R2). Proof. Let a £ [0, a+), T £ [0,T max ), [XJ,J/J] £ B(ti) with x* £ £>Q and *i,*2 £ [0,T], i = 1,2, be given. We define Zi = jji — g(U) and get from (6.9) the estimate (2/1 -2/2,2:1 - x 2 ) _ < (21 -z2,xi -x2)+ \g{h) - g(t2)\ < u>a,T\Xl -x2\+ L Q , T (|x 2 |)K(| 2 2 |)|/ a (i 1 ) + \g(h) -
fa(t2)\
g(h)\.
Here we have used (u — v,w)- < (u,w)- + (v,w) + , u,v,w £ X, which follows from Lemma 1.3, b), with y = u — v, z = v, x = w and (1.4). In case of (El) we have i ^ d ^ j ) = K(\y2\) = 1, whereas in case of (E2) we have K(\z2\) = 1 + M < l + \g{t2)\ + \y2\ < c T ( l + |2/2|), where c T = max t € [ 0 j T 1 (l + | ff (t)|). Thus we have condition (El) resp. (E2) satisfied in the version given in Remark 6.6 on page 228 with m = 2, / i j Q = fa, f2,a = 9 and max(l, CXL Q ,T(O")) instead of L Q ) T (CT).
The statement concerning condition (R2) is trivial in view of dom A(t) = dom£(i) and A(t)us + g(t) = B(i)us. O We have the following existence and uniqueness theorem for mild solutions otEP(A(-),g,8,x0): 6.32. Theorem. Assume that (El) resp. (E2) is true for the family A(t), 0 < t < r m a x , and that g : [0,T max ) —> X is continuous in case of (El) resp. continuous and of bounded variation on compact intervals in case of (E2). Moreover, assume that (R2g) is also satisfied. Let s £ [0,T max ), xo £ DC\ dom A(s) with ip(xo) < ct+ and T £ (s,T + (s,xo)) be given. Then there exists a unique mild solution u(-;s,xo,g) of EP(A(-),g,s,xo) on [s,T], which is confined to Da, a = max s
Chapter 6. Locally Quasi-Dissipative
236
Ui(-) = u(-;s,Xi,gi), (6.66)
M i ) -u2(t)\
Evolution
Equations
i = 1,2, satisfy, for some (3 £ [0, a+), the inequality < e^^t-s^\xl-x2\
+ f e<^'-«)|5l(0 -
52(0I
<%
JS
for
s
Proof. According to Lemma 6.31 the family B(t), 0 < t < T m a x , defined by (6.62) satisfies assumptions (El) resp. (E2) and (R2). In case of (El) existence and uniqueness of the mild solution u(-;s,xo,g) follow from Theorem 6.17, a). Note that assumption (R2) implies (Rl) (see Lemma 6.14). In case of (E2) we get existence of «(•; s, xo, g) from Theorem 6.17, c). In both cases we get also
< ip(t, s,
i.e., u(t;s,xo,g) & Da with a = maxs
\vn(t)-u2(t)\<e^t-^\x1,n-x2\+
/ e-"- 1 -^-*)| 5l (0-32(01 de Js
for all t £ [s,T], where we assume without restriction that u2 is also confined to Dp. Then (6.66) follows for n —> 00. • In the next theorem we establish existence of integral solutions of the problem EP{A(-),s,x0,g) with g e L ^ U O . o o ) , * ) . 6.33. Theorem. Assume that the operators A(t), 0 < t < T m a x , satisfy condition (El) resp. (E2) together with (R2g). Let g G Lloc([0,Tma,x);X), s G [0,T max ), xo £ D n d o m A ( s ) with ?(x0) < a+ and T 6 (s,T+(s,x 0 )) 4 be given. Then there exists an integral solution u(-) of EP(A(-),s, XQ,g) on [s,T]. 4
T 9 + ( s , x 0 ) := sup{T 6 (s,T m a x) I max s < t < T ^ 0 (.. 9 ) i i > (.. 9 )(t,s,¥>(xo)) < a + } .
6.7. "Nonhomogeneous"
problems
237
Proof. Choose a sequence („)„=i,2,... C C(0,Tmax;X) with l i m ^ o o | 5nUi(o,T;x) = 0 f° r all T" G (0,T max )- In case of (E2) we assume in addition that the functions gn are of bounded variation on bounded intervals. From (6.65) we conclude that lim
T+i{8,x0)=T+{s,x0).
We fix T G (s,Tg+(s,a;o)). Then there exists an no G N such that T G (s,!Z]+(s,a;o)) for n > n 0 . Let u n , n = n0,n0 + 1 , . . . , denote the unique mild solution of EP( J 4(-), s, XQ,gn) on [s, T] which exists by Theorem 6.32. The solution un is confined to Dpn with (5n = max s < t
Prom (6.65) we obtain lim f3n = max ipa{.;g)M.g\(t,s,(p(x0)) n—>oo
< a+.
s
This and /3„ < a+ for n > no imply j3 := sup /3„ < a+. n>rlQ
This proves that all solutions un are confined to Dp. From Theorem 6.32 we get the estimate \un(t) ~ um(t)\ < j
e - ^ - ^ O
-Sm(OI#
< e"^ T |„ - gm\mo,T;X),
s
which proves that u{t) = lim un(t),
s
exists, the limit being uniform on [s, T]. With the same arguments as given above we can prove that u(-) is independent of the special choice of the sequence (gn)- According to Theorem 6.30, a), the functions un(-), n = no, no + 1 , . . . , are integral solutions and satisfy \un(t) -x\/ 6 67\
\un(r) - x\ <
{(V + 9n(v), un(a) - x)+ + ujpiT\un(a) - x\) da Lp,T(\x\)K(\y\)
£\fp(o)
-
fp(r)\da
for r,r,t e [s,T] with r < t and [x,y] € A(r) with x G Dp. Using Lemma 1.3, b) and d), we see that for every e > 0 we can choose no G N such that, for
238
Chapter 6. Locally Quasi-Dissipative
Evolution
Equations
n > no, in addition (y + 9n{o), un{a) - x)+ = (y + g(o),un(o)
- x)+
+ {gn{) - g{
n0,
{y + 9n(
x)+da
9n\mo,T;X) +
(y + 9(a)^u(a)
~ x)+da + e(t ~ T)
and consequently limsup / {y + gn{o),un{a) n—>CXD JT
- x)+da < / (y + g(a),u(a)
-
x)+da.
JT
Note that integrability of a —• (y + g{a),u{o) — x)+ follows from the definition of (•,-) + • Taking limsup,,^.^ in (6.67) we get (6.63), i.e., u is an integral solution. • 6.8.
Strong solutions
We already have defined the concept of a strong solution in the context of linear Co-semigroups (see Definition 2.12) and of nonlinear semigroups (see Definition 5.5). For the evolution problems considered in this chapter we use Definition 5.5. For convenience of the reader we state it again in a slightly modified fashion: 6.34. Definition. Let the family A(t), 0 < t < T m a x , of operators on X and s € [0,T max ), xo £ X be given. A continuous function u : [S,TQ) —• X with To G (s, T max ] is called a strong solution of EP(A(-), s, x0) on [s, To) if and only if the following is true: (i) u(s) = xo(ii) u is locally Lipschitzian5 and a.e. differentiable on [s, To). (iii) u(t) G dom A(t) and —u(t) G A(t)u(t) a.e. on [s,T0). dt If X is reflexive, then the requirement (ii) can be reduced to the assumption that u is locally Lipschitzian on [s,To) (see [Kom]). In order to prove a result on the relation between the notions 'strong solution' and 'mild solution' we introduce the following assumption, which requires the operators A(t) to be locally quasi-dissipative uniformly for t in compact intervals (see Definition 6.3): 5
i.e., for any T € (S,TQ),
U satisfies a Lipschitz condition on [s, T].
6.8. Strong
(E)
solutions
239
There exists an a+ > 0 such that for any a G [ 0 , Q + ) and any T G (0,T max ) there exists a constant u>a,T £ K such that (1 - AwQ,T)|xi -X2\<\X1-X2/or any £ £ [0,T] and any
X(yi - y2)\, [XJ,J/J]
0 < A < l/\wQ,T\,
G A(t) with Xj G _DQ, i = 1,2.
It is obvious that (E) follows from (El) resp. (E2). For the proof that strong solutions are also mild solutions we shall need the following lemma by Evans (see [Ev, Lemma 4.1]), which proves existence of a specific sequence of step functions converging to a given L1 -function on a bounded interval. 6.35. Lemma (Evans). Let h € Lloc([0,Tmax);X), T G (0,T max ) and a subset K of [0, T max ) with meas([0,T max ) \ K) = 0 be given. Then there exists a Ao > 0 such that for any A G (0, Ao] and any representation h of h there exists a partition 0 = to < t\ < • • • < tpfx with ijv*-i < T < txx and tk G K, k = 1 , . . . , N\, such that (i) maxk=i,...,Nx{tk ~ tk-i) < A and (ii) the step functions g\ : [0, T] —> X defined by
f°rt
a(t)=f° \h(tk)
= 0
>
fortG{tk-1,tk]n[0,T\,k
=
l,...,NX)
satisfy I5A - h\Li(0}T.X)
< A.
Proof. We choose Ao > 0 such that T0 = T + X0 < T m a x . In case h |[o,r0]= 0 the result is obviously true, because any representation h of h is zero a.e. on [0,2b]. Let /I|[O,T0]7^ 0, fix A G (0, Ao], define e = Amin(l/3, (2 +To)" 1 ) and choose a S > 0 such that JA\h\dr < e for any measurable set A C [0, To] with meas A < 6. Furthermore we choose n G N such that - < min(e,o", — n
K
l'*lL1(0,To;A')
,-r-
).
\n\L1(0,To;X)<'
We define the sets L:=\te >•
[0,T0] |lim / \h(T)-h(t)\dT
A^ := [0,T0] \L,
E:={tG
= o\, J
[0, T0] \ \h(t)\ > n}.
Since almost all points in [0, T0] are left Lebesgue points of h (see [He-Str, p. 276]) we have measN = 0. By definition of E we get measi? < \h\iJitQ,T0;X)/n-
240
Chapter 6. Locally Quasi-Dissipative
Evolution
Equations
We set C= ([Q,To}nK)\(NuE)
=
[0,To}r)KnLnGE,
i.e., C is the set of all left Lebesgue points t of h in [0,To] with t e K and h(t) < n. Let V be the set of all intervals [s, t] where t £ C, t — e < s < t and (t - s)-1 f*\h(r) - h(t)\d.T < e. Then V is a Vitalli cover for C and by Vitalli's covering theorem (see [He-Str, p. 262]) there exists a finite number of disjoint intervals Ik = [sfc, tk] G V, k = 1 , . . . , N0, with Wo
meas c n ?Ci
v
1
(fc=iU ^ ) ) ^ I—1
^
We may assume that 0 < st < U < s2 < t2 < • • • < sNo
< tNo
< T0.
We set to = 0 and take as the partition of [0,To] the points tk, k = Then we have max
(tk - tk-\)
k=l,...,N0
=
max
(tk - sk + sk -
0,...,NQ.
tk-i)
fc=l,...,jV0
< e + meas/ ( C n C ( ( J h)) ^
= e + J_ +
nz < 3e < A.
UNuE
fc=i
meas(ArUjE)
< e +I
+
n
l^kWoin n
Analogously we get
To - tNn < -r + meas(N U E) < 2e < A.
We set Nx = minjfc e { 1 , . . . , JV0} | 4 > T } . Note that ^ > T0 - 2e > To — A > T. Then obviously we have ma,Xk=i,...,Nx(tk — ifc-i) < A, i.e., (i) is true.
6.8. Strong solutions
241
In order to prove that (ii) also holds we shall use the estimate N
*
rmm{tk,T)
\h{tk) K=I
N\
-sk
< J2 (6.68)
Nx
Nx
\h{tk)-h{T)\dT
\h(tk)-h(r)\dr Nx
(\htk)\ + \h(T)\)dT +
No
N0
tk
+ YJ
fSk
< £ /
h{r)\dr
-fc-i
eY,(tk-Sk)
Sk
+ ^2
\h\dT + eT0.
Jt
k=l
k-l
We set Y = U*=i(*k-i» sk) and observe that Y = [0, T0) f~l C(lJ^=i h) = (C U
EuAru([o,T 0 ]\^))nc(u£i4) c (<7nc(u^=i4))u(£;uivu([o,ro]\^)). This implies meas Y < l / n 2 + |/i|ii( 0 l r o ; x)/ n < min(e, S). This and (6.68) imply \9\ - h\Li{0,T;X) < eT0 + e + J \h\ dr < e(2 + T0) < A.
D 6.36. Theorem. Assume that the operators A(t), 0 < t < T m a x , satisfy (E) and that s G [0,T max ), To G (s,T m a x ], xo G X are given. Then the following is true: a) There exists at most one strong solution of EP(A(-),S,XQ) with the property that on any interval [s,T], s < T < To, it is confined to Da for some a G [0,o+). b) If u is a strong solution of EP(A(-),s,xo), which on any interval [s,T], s < T < To, is confined to DQ for some a G [0,a + ), then u is also a mild solution of
EP(A(-),S,XQ).
Proof, a) Choose T G (s,To) and let Ui(-), i = 1,2, be two strong solutions of EP(A(-),s,x0) confined to Da on the interval [s,T]. Then the mapping t —> \ui(t) — u2(t)\, t e [s,T], satisfies a Lipschitz condition on [s,T] and hence is differentiable a.e. on [s,T]. Using u'^t) G A{t)ui(t) a.e. on [s,T] and Proposition 1.4, a), we obtain 3 T M * ) ~Mt)\2 = 2(u[{t) - u'2(t),Ul(t) at From Proposition 6.5, a), we get -jl\ui{t) -u2(t)\2
- u2(t)}i
< Ua:T\ui(t) -u2{t)\2
a.e. on \s,T}.
a.e. on [s,T],
Chapter 6. Locally Quasi-Dissipative
242
Evolution
Equations
which implies u\ =u^. b) Let u be a strong solution of E P ( J 4 ( - ) , S, X). Then u'(t) exists a.e. on [s, To) and is the representation of a function in L
gxl^is^-x) = o,
lim \v!
(6.69)
AJ.0
where 0
9x(t)
for t = s,
x
hi t e ($_!,%],
k=
i,...,Nx.
x
t .j, choose t G (s,T] such that u'(t) exists and define We set hfc l kk\ G { 1 , . . . , N\} by the requirement t G (£fcx_i,%J- Then the estimate «(**,) -
«(*fc,-i)
«(*fcJ-«(*)
«'(*) <
At)
**\
+
t-ti hx
A*)
t-ti
shows that lim « «
)-«(*k-l)
«'(t).
W
AJ.0
Therefore the step functions
'o
for t = s,
3x(t) = { ^K) ~ hx
u
K-i
foit£(tx_1,tx],k
= l,
•,Nx,
converge a.e. on [s,T] to u'(t). Since we have \g\(t) — u'(t)\ < 2M a.e. on [s,T], where M is a Lipschitz constant for u on [s,T], we get by Lebesgue's dominated convergence theorem lim \gx
• u'\Ll(s,T;X)
=0.
This and (6.69) prove that AlS^ A ~ 9\\LHS,T;X)
=0-
6.8. Strong solutions
243
Foiexk = (hxkr1(u(txk)-u(txk_1))-u'(txk),k X
E
L A | „ A | _ Ih
e
k\ k\
i
=
,(.\
~ \9\ - 9\\L^s,T;X)
+ {tN),
^f^Nx) 1
~ ){
fe=l <
l,...,Nx,weget ~M(*ArA-l)
,(\ u
TA n "»
s\
(*JVJ)
|5A-5A|LI(S,T;X)+2MA,
which implies Nx
lim A|0 ^V- i^f cKl e' tKl = 0 . fc=l
This and tLXk
x
-tXbk-l
exk=u'{txk)£A{tl)u(txk),
k=
l,...,Nx
show that . . _ J a; UxU=
\u(tl)
for t — s,
iovte(tk-_vtk-],k = i,...,Nx,
0 < A < Ao, defines a DS-approximation for EP(A(-),s,x) on [s,T], which obviously is confined to Da. By continuity of u on [s,T] we have lim ux (t) = u(t)
uniformly on [s, T].
Thus u is also a mild solution of EP(A(-), s, x).
•
The next theorem gives conditions under which a mild solution is also a strong solution. 6.37. Theorem. Assume that X is a reflexive Banach space and that the family A{t), 0 < t < T m a x , satisfies (El) and (Rl) resp. (E2) and (R2), where in case of assumption (El) the functions fa are also assumed to be of bounded variation on compact intervals. Furthermore we assume that for alia G [0,a + ) andT G (0,T max ) the operators A(t)—watTl, t G [0,T], are maximal dissipative onDa.6 Let xo G D n domyl(s) with tp(xo) < a+ be given. Then the unique mild solution u(-;s,xo) of EP(A(-),s,xo) on [S,T+(S,XQ)) is also a strong solution. Proof. According to Theorem 6.17, b), resp. Remark 6.5, b), on page 216 there exists a unique mild solution u(-; s,xo) which satisfies a Lipschitz condition on any interval [s,T], T G (Q,T+(s,Xo)). Moreover, we have u(t;s,x0) 6 Da, t G [s,T], for some a G [0, a+). Since X is reflexive, the function u(t) = u(t;s,xo) 6 T h i s means that for the operator {[x, y — uiaiTx] I x G dom A(t)nDa, does not exist a non-trivial dissipative extension B with dom B C Da.
y € A(t)x}
there
244
Chapter 6. Locally Quasi-Dissipative
Evolution
Equations
is difFerentiable a.e. on [s, T1]. It remains to prove that u'(t) £ A(t)u(t) a.e. on [s,T]. Let t £ [s,T] be such that u'{t) exists. Using Lemma 1.3, a), and the fact that u is also the unique integral solution of EP(.A(-), s, x0) (see Theorem 6.19 and Definition 6.18) we get, for A sufficiently small and any [x,y] £ A(t) with x £ Da, ( - (u(H-A) - u{t)), u(t) -x) = (-{u{t
= ^ - (u(t + \)~x)~-
+ \)-x),u{t)-xj
< -(\u{t + A
(u(t) - x), u{t) - x^
--\u{t)-x\
\)-x\-\u(t)-x\)
1 ft+\ < -
/
\ {(y,u(a) -x}+ +wa,T\u(a)
- x\ + C\fa(a)
-fa(t)\)da,
where C = La,T(\x\)K{\y\). From Lemma 1.3, c), we conclude that Re(^{u(t + X)-u{t))j) 1 < j\u{t)-x\
ft+Xf / \{y,u{a) - x)+ + uatT\u{a)
\ - x\ + C\fa{a) - fa(t)\J
da
for all [x,y] £ A(t) with x £ Da and all / £ F(u(t) — x). Since (-, -) + is upper semi-continuous (see Lemma 1.3, d)), there exists for any e > 0 a 6 > 0 such that (y,u(a) — x)+ < (y,u(t) — x)+ + e for \a — i| < 6. Therefore we get for A 4 0 the estimate Re(u'(t), f) < \u{t) - x\ ((y, u(t) - x)+ + wa,T\u(t)
~ x\)
for all \x,y] £ A(t) with x £ Da and all / £ F(u(t) — x). Lemma 1.3, c), we have (u'(t),u(t)
-x)+
< (y,u(t) ~x)+
+u)a,T\u(t) 1
This together with (y + z, x}- < (y, x)+ + (z, x)-
Using again
-x\.
implies
(«'(«) - y, u(t) - x)_ < (u'(t), u{t) - x)+ + {-y, u{t) -
x)-
= (u'(t), u{t) - x)+ - (y, u(t) - x)+ < uaj\u(t)
- x\
for all [x, y] £ A(t) with x £ Da. Maximal dissipativity of A(t) — wa,rl on Da and u(t) £ Da imply u(t) £ dom A(t) n Da
and
u'(t) £ A{t)u{t). U
7 T h i s follows from (z,x)- = (z + y — y,x){y,x)+\ see Lemma 1.3, b), and (1.4).
> (y + z,x)_
+ (—y,x)-
— (y +
z,x).
6.8. Strong solutions
245
6.38. Theorem. Assume that the family A(i), 0 < t < Tmax, of operators on X satisfies (El) and (Rl) resp. (E2) and (R2). For s G [0,T max ), x0 G D n d o m A ( s ) with ip(xo) < a+ and T e (S,T+(S,XQ)) let U = U(-;S,XQ) be a strong solution of EP(A(-),s,Xo) on [s,T] which is confined to Da for some a G [0, a+). Then the following is true: a) The function u is also a strong solution of EP(A°(-),s,a;o) on [s,T] where A°(t) denotes the minimal section of A{t). b) If in addition the functions fa in assumption Wio'c ([O'^max);^); then we have the estimate
(El) resp. (E2) are in
\u'(t)\ < e^^t-^\\A(s)x0\\+La,T(\x0\)K(\\A(s)x0\\)
/ V . ^ > | / » | dr Js
a.e. on [s,T]. Proof, a) According to Theorems 6.36, b), and 6.20 u is also the unique integral solution of EP(yl(-), S, XQ)- This implies that for any t G [s, T), [x, y] G A(r) with r £ [s, T] and A > 0 sufficiently small we have (6.70)
\u(t + X)-x\\u(t) - x\ t+x ((y,u(a) - x)+ + u)a,T\u{o) ~x\+ /
where C = La
C\fa{a) - fa{r)\)
da,
Assume that u is differentiate at t0 G [s,T) with
(6.71)
u'(to) G
From (6.70) we get for t — r = to
an
A(t0)u(t0).
d x = M(*O) the estimate
— |t*(*0 +A) — «(*o)| ft0+X
- /
{\y\+toa,T\u(a)-u(t0)\
+
C\fa(a)-fa(t0)\)da
't0
which, for A J. 0, implies \u'(t0)\<\y\
iov all
yeA{t0)u(t0).
This together with (6.71) shows that (see Definition 1.18) u'(t0) G A°(tQ)u(t0). b) For t G [s,T) such that u'(t) exists and A, h > 0 sufficiently small we define •j
Gh{t) =
pt+X+h
K*J
rt+h
J
i«(*)-«(0i
246
Chapter 6. Locally Quasi-Dissipative
Evolution
Equations
This implies i / rt+h G'h(t) = ^ j ( / (|u(
+ /
(\u(t +
h)-u(0\-\u(t)~u(0\)dA.
Jt+X
'
For s = s, x = xo, p = t + X + h, TJ = t + X, i = t + h and f = £ we get from (6.56) the estimate 1
pt+X+h
G'h{t)<-^J
et+h
j it+\
{wa,T\u(a)-u(0\
+
C\fa(a)-fa(0\)d(Tdt
Jt ,-,
r-t+X+h
pt+h rt+h
oa,TGh{t) + —/•t+X+h J
J
\fa{a)-Ui)\dadti.
It+X
By Gronwall's inequality this implies + -Hi \ e^t-r)
/
/
I/T TA T+X
J s
\fa{a) -
fa(0\dad4dT,
JT
which for h J. 0 gives i(t u[
+ A) - u(t)| < e^Tit-s)\u(s
+ A) - u{s
+ C f e^^t-^\fa(r
+
X)-fa(r)\dT
Js rs+X s+X
<
gW„,T(t-*)
(\y\ + ua,T\u{
/
+ C f e^^t^\fa(r
+
da
X)-fa(T)\dT,
Js
where we have also used (6.70) with t = r = s and x = u(s). Since fa £ W1'1(s, T; X), we obtain dividing the last estimate by A and then taking A 4- 0 the estimate (observe that C = LatT(\xo\)K(\y\)) \u'(t)\<e"<"T<-t-%\+LaiT(\x0\)K(\y\)
/ V ^ - ) | / » j dr Js
for all y 6 A(S)XQ-
•
6.9.
Quasi-linear equations
In this section we show that the general approach using DS-approximations for proving existence of solutions can also be used for so-called quasi-linear equations. Let ip be a non-negative, lower semi-continuous functional on X
6.9. Quasi-linear
equations
247
with D = Defi(ip). Assume that for all u G D and t € [0,T max ) a linear operator A(t, u) on X is given. We shall use the following assumptions: (QL1) We have dom A(t,u) = D{t) for all u G D {i.e., Aora A(t,u) does not depend on u G D). Moreover, for all a > 0 and T G (0,T max ) there exists a constant u>a,T € R swc/i t/iai /or aZZ u G D a and t G [0, T] we ftaue (l~XA(t,u))(D(t)r\D)
D D,
0 < A < l/|w Q i T |.
(QL2) For any a > 0 i/iere exisis o continuous function fa : [0, T max ) ->• X and, for any T G (0, T m a x ), an increasing function La,T '• R(j~ "^ ^o~ suc/i t/iai /or w G Da and t%, t2 G [0, T] we Ziawe (A(ti,u)x\
(6.72)
- A(i2,M)x2,a;i - x 2 ) _ < +
UJU,T\XI
~ xt\
\fa(tl)-fa(t2)\La,T(\x2\)K(\A(h,u)x2\)
for Xi G D{ti), i = 1,2. // if(r) = 1 + r, we assume in addition that fa is of bounded variation on compact intervals. As in the proof of Proposition 6.5, a), we see that (6.72) is equivalent to (6.73)
(1 - \U)C,T)\XI ~ x2\ < |xi - x2 - \(A(ti,u)xi
-
+ A|/ a (*i) - fa(t2)\La,T(\x2\)K(\A(t2,u)x2\),
A(t2,u)x2)\ 0 < A < l/|w a > T |.
Assumption (QL2) in particular means that A(t, u) — 0Ja,Tl is dissipative for u G Da and t G [0,T]. Hence I — \A(t,u) has a single-valued inverse (compare Proposition 1.9) for A G (0, l/|o; Q) r|)- According to (QL1) we have (I - \A(t,
M)) _ 1 £> C D{t) n D,
0 < A < l/|w Q ; T |, 0 < t < T.
Concerning the w-dependence of A(t, u) we assume: (QL3) For any a > 0 and T G [0,T max ) there exists a constant CU}T > 0 such that \A{t, u)u — A(t, v)u\
forte
[0,T] andu,v
< CQ)T|M - v\
£D(t)nDa.
Finally we impose the following growth condition with respect to
0
248
Chapter 6. Locally Quasi-Dissipative
Evolution
Equations
for all6 G (0, l/|o; Q i r|) anduoEDa, where ug = [l—SA(t,uo)) «o and a(-), b(-) are continuous functions on [0, T max ) with b>0. Corresponding to the family A(t, u), 0 < t < T m a x , u G D, of linear operators we define the nonlinear operators A(t), 0 < t < T m a x , by dom^l(i) = D(t) n f l , A{t)u = A(t, u)u,
u G dom.A(i).
For s G [0,T max ) and Bo 6 D we shall consider the quasi-linear evolution problem
(6 74)
d*"W
= A
®u®
= A^ "(*))"(*)'
s
^ * < T—'
w(s) = «0The next lemma shows that the assumptions (QLl) - (QL3) imply (El) resp. a condition related to (E2) for the family A(-). 6.39. Lemma. Assume that assumptions (QLl) - (QL3) are satisfied. Then the following is true: a) The family A(t), 0 < t < T m a x , satisfies (6.75)
(l - \{u>a,T + c a ,r))|ui ~ u2\ < |«i - u2 - X(A(t1)u1 + MU(ti) ~
-
A{t2)u2)\
fa(t2)\La,T(\u2\)K{\A(t2,Ul)u2\)
/or AG (0, ( K , T | + Ca,r) _ 1 ), t j , ^ G [0,T] and «; G£>(ti)n£> Q , i = 1,2. b) There exists a constant K = n(a, T, M) > 0 such that (1 - AK)|UI - u2\ < \ui - u2 - X(A(t1)ui + A|/«(ti) -
-
A{t2)u2)\
fa(h)\La,T(\u2\)K(\A(t2)u2\)
for X G ( 0 , 1 / K ) , U G [0,T] anduj G D(U)nDa,
i = 1,2, witfi |u 2 | < M .
Proof, a) Assumptions (QL2), (QL3) imply (using also (1.5)) (A(ti)ui
- A{t2)u2, ui - u2)_ = (A{ti,ux)ui
- A(t2,ui)u2
< (A(t\,u\)ui
- A(t2,ui)u2,ui
< (ua,T + ca,T)\ui -u2\
+ A(t2,ui)u2 -u2)_
+ \fa(ti)
-
- A(t2ju2)u2,ui + \A(t2,ui)u2
-
- u2)_ A(t2,u2)u2\
fa(t2)\LatT(\u2\)K(\A(t2,ui)u2\)
for t\,t2 G [0,T] and Ui G D(ti)f]Da, i = 1,2. The last inequality is equivalent to inequality (6.75) (see Proposition 6.5, a)).
6.9. Quasi-linear
equations
249
b) We set K = w a ) T + c Q ) T (l + pfaiT(T)LatT(M)). Then the estimate (6.76) follows from (6.75) if we use assumption (QL3) in order to get estimate \A(t2,Ui)u2\
< \A(t2,Ui)u2
<
C Q ,T|WI
- A(t2,U2)u2\
- W2I +
+
\A(t2,U2)u2\
\A(t2)u2\. D
If we have K(r) = 1 in (QL2), then the family A(t), 0 < t < T m a x , satisfies (El) with a+ — 00. From Lemma 6.39 it is also clear that the operators A(t), 0 < t < T m a x , are locally quasi-dissipative (see Definition 6.3) uniformly with respect to t G [0,T], T G (0,T m a x ). We fix s,T G [0,T max ) with s < T, T0 G ( T , r m a x ) and choose u0 G £>. Furthermore we set (6.77)
a :— max xp(t, s,
where ^> = ^)aji, is given by (6.4) corresponding to the functions a, b of assumption (QL4). For Ao > 0 sufficiently small8 and A G (0, Ao] we choose tf, i = 0,...,N\, with s = t$
<•••<•&>
and ^ := tf - tf_a < A,
i=
l,...,Nx,
where N\ is determined by ijv^-i < T < t^ . We define the functions u A , 0 < A < Ao, by (6.78)
Mo for £ = s, « A ( t ) - , _ . A r _ , + A +A1 u} for t G ( # _ ! , # ] n [s,T], i = 1 , . . . ,iVA
where the u^ are defined by (6.79)
^(«i-«i-i)=^(ti,iii-i)tii,
t = l,...,JV A ,
tij=u0,
i.e., by (J - / i - A ^ . J i t i J J u - = u$_.j. We assume that Ao is also smaller than the constant 60 in Lemma 6.4 (corresponding to e — 1). From the considerations following assumption (QL2) and
e* = j4(tf,u£_i)«*-^(tf> «*)«*.
In particular Ao < min(l/| ai T 0 |,To — T).
» = 1,...,JVA.
250
Chapter 6. Locally Quasi-Dissipative
Evolution
Equations
Then we have y? = A(ti)v$
+ e$,
i=
l,...,Nx.
We first prove boundedness results for the families u$ and y£ analogous to those of Lemma 6.9. 6.40. Lemma. Let the families u$, y£, i = 1 , . . . ,NX, 0 < A < Ao, be given as above with uo € D. Then there exists a constant M > 0 such that |u*|<M,
i = Q,...,Nx,
0 < A < A0.
/ / in addition we have uo G D(s) C\ D, then M can be chosen such that also \Vi\<M,
i = l,...,Nx,
0 < A < A0.
Proof, a) We define a by (6.77) and choose r G [s,T0], u G D(r) l~l Da. Moreover, we set u = wa,T0i c = ca,T and v = A(r,u)u = A(r)u. From (6.73) with u = u^_x, xi = u* and xi — u we get (1 - h}io)\u} -u\<
\u$ - u - h*{A{ttuti)u*
+ Using u$ - hfA^t^u^)^ (1 - h\u)\u\
-u\<
-
A(r,uti)u)\
h}\fa(t})-fa(r)\La,To(\u\)K(\A(r,ul1)u\). = u£_x and (QL3) we get \u\_x - u\(\ + h}c(l + \fa(t$) -
+ h$(\v\ + \fa(t$) -
fa(r)\La:To(\u\)))
fa(r)\La
We set K = c(l + Pfa,T0(To - s)L a ,T 0 (M) and get (1 - h,*u;)|u? - u| < (1 + /tf«)|t£_i " "I hH\v\+Pfa,T0(T0-8)La,To(\u\)K(\v\))
+
for * = 1 , . . . , Nx. Multiplying by n j = i ( l " h$ UJ) we obtain i
i— 1
3= 1
3=1
n(i - /i,Mk - "i < n^1 - h ^ 1 + r t ^ i i - u\ +
h}(\v\+Pfa,T0(T0~S)La,To(\u\)K(\v\)).
By induction we get i
i
J ] ( l - h$u>)\u$ - u| < J ] ( l + h$n)\uo - u| 3=1
3=1 i
+ Y/h*(\v\ 3= 1
i
+ pfa,To(T0-s)La,To(\u\)K(\v\))
H (l + /tf«). (=3 + 1
6.9. Quasi-linear
equations
251
Observing (1 - hju)-1 < e2"h$ for 0 < h$ < \w\/2 < A 0 /2 and 1 + h]n < eh5K we obtain the estimate K A | < \u\ + \uf
-u\
T
<\u\+e^+^ °-^(\u0-u\ + (To - s)(\v\ + Pfa,T0(T0 -
8)La>To(\u\)K(\v\)))
for i = 1 , . . . , Nx and 0 < A < A 0 /2. b) Assume that u0 G D(s)C\D. We set y$ = A(s, u0)u0 = A(s)u0. of the y£ and (6.79) we get Vi+i ~ V? = ^
+
i,t^)
By definition
A{t$,u})u$
+ A(t},ul)u$-A(t},ul1)u},
i=l,...,Nx.
From (1.5) and Lemma 1.3, a), we get ( i / i + i - v l ^ + i - u i ) ~ > \Vi+i\-
\vi\-
This together with (6.81), (QL2) and (QL3) implies kA+il
+ c\u$ - u *_ilwA_1)«^| +
\A(t^,uf)uf~A(tf,
(1 - h$+1u)\y?+1\ < (1 + |/ a (t A + 1 ) - / Q (t A )|L Q ,T 0 (M))(l + /i A c)|y A | + l/a(iA+l)-/a(iA)|ia,T0(M). We set at = n j = i ( l " h$<j)\y>\ and 6, = |/ Q (i A +1 ) - / a (tf)|L Q , T o (M). Then the last inequality can be written as a,i+i < (1 + /i A c)(l + 6t+i)a» + bi+i i+1
< e^c+bi+lai
i+1
+ bi+l < exp((T 0 - s)c + j ^ - ) ( a o + E & i ) -
From this inequality the estimate for yA follows if we observe that t+i
XI b J ^
LatTo(M)vav[StTo]fa.
D
Chapter 6. Locally Quasi-Dissipative
252
Evolution
Equations
6.41. Corollary. The family u\, 0 < A < Ao, given by (6.78) is a DSapproximation for (6.74) satisfying
^2\e?\
(6.82)
=
0- From (6.80) we
= ^,75,^1^1
so that Nx
Y^ hi\ei\ i=l
Nx
< ca,T0MX ^2 h* < c Q , T o M(r 0 - s)\ -> 0 as A 1 0 , i=l
which in view of Definition 6.6 proves that the step functions u\, 0 < A < Ao, constitute a DS-approximation. The estimate for ]T\=i Iei1 follows from (6.82). • We can now prove an existence and uniqueness result for equation (6.74). 6.42. Theorem. Let assumptions (QLl) - (QL4) be satisfied and assume that s G [0,T max ), UQ G D(s)nD are given. Then the quasi-linear evolution problem (6.74) has a mild solution u(-) = u(-;s,«o) on [s,T m a x ), which is the unique integral solution of (6.74). Proof. We first prove that the DS-approximation given by (6.78) (see Corollary 6.41) converges uniformly to a continuous function on each interval [s,T] with T G (s, Tmax)- According to Lemma 6.40 the elements y£, i = 1 , . . . , N\, 0 < A < Ao, are uniformly bounded, |w^| < M. Moreover, there exists a constant a > 0 with u$ G Da, i = 1,...,JV\, 0 < A < Ao- With obvious modifications the results of Section 6.3 leading to Lemma 6.13 are true for sequences constructed according to (6.79). One has to replace the constant oJa,T0 by K(a,T0,M) (see Lemma 6.39, b)) and to impose the following additional requirements: \x2\ < M in Proposition 6.5, |u| < M in Lemma 6.8, \xf\ < M in Lemma 6.10 and, finally, \u\ < M, \xj\ < M in Lemma 6.13. In the proofs we only have to use the estimate (6.76) instead of (6.7). Compare also Remark 6.5 on page 216. Therefore we can use parts a) and b) of the proof for Theorem 6.17 in order to prove that
\imu\(t) = u(t) uniformly on any interval [s,T] with T G (s, T m a x ). Moreover, «(•) is continuous. This proves existence of a mild solution for problem (6.74).
6.10. A "parabolic" problem
253
We modify the Definition 6.18 of an integral solution slightly: in (6.45) the constant wptr has to be replaced by K(/3, T, M) and (6.45) has to be valid for all [x,y] £ A(r) with x £ Dp and \x\ < M. With these modification we can also prove Theorem 6.19 for the quasi-linear equations considered in this section. Then uniqueness of it(-; s, UQ) is an immediate consequence. •
6.10.
A "parabolic" problem
Assume that X is a real Hilbert space with inner product (-,-)x and let
/(*)e|«(*) + M«W), u(0) = x,
*>0,
which can also be written as -u{t)£-dp(u(t))
+ f{t),
t>0,
u(0) = x.
The Crandall-Liggett theorem implies that —A generates a contraction semigroup S(-) on dom .A. However, using the fact that A is a subdifferential we can prove a considerably stronger result on the solutions of (6.83) (see [Brl]). 6.43. Theorem. Assume that, for some T > 0, we have f £ L2(0,T;X) and that x £ domcV = Deff(
1/2
2
« ' £L (0,T;X)
forallde(0,T), a.e. on (0,T), and
*?(«(•)) £
Ll(Q,T;X),
u satisfies equation (6.83) a.e. on (0,T). Moreover, if x £ Deff(3), then u' £ L2(0, T; X)
and
Proof. We fix [a;o,j/o] S d
x£X.
254
Chapter 6. Locally Quasi-Dissipative
Evolution
Equations
Using (p(x)-(p(xo) > {x — Xo,yo)x, x € X, we see that min x e x
t>0,
u(0)=x.
Thus we can assume without restriction of generality that min x 6 x
i=
0,...,Nx,
where N\ is determined by tJvA-i < ^ — *JV • Since —dip is m-dissipative, there exist elements uA G domcfyj, i = 1 , . . . , N\, with w0 = 2:, 6 84
( - )
1 x
- K A - « t i ) e/(tf)-a^KA), Then the step functions
(WA)A>O
i=
i,...,Nx.
defined on [0,T] by
ux(0) =x, ux{t)=u^
fortG(tti,*?]n[0,r],
constitute a DS-approximation for equation (6.83) with associated sequences (i A , u A , £A, e A ), where eA = 0 and & = f(tf) - yA with (6.85)
yA = /(i A ) - i ( « A - uA_i) G 0*?K*)>
» = 1 , . . . , iVA.
Furthermore as the lower semi-continuous functional in the definition of local quasi-dissipativity we use the characteristic function J d o m 9 of dom dip9. Then it is easy to see that assumption (El) is satisfied with wa = 0 and fa = f, a > 0. Since dom(—d
limux(t)
= u(t)
uniformly on [0,T].
Corresponding to u\ we define the piecewise linear function u\ by u\{t) = «A_i + j(t - tti)(u*
- «*_!),
t G [it!,iA], i =
l,...,Nx.
'For a subset G C X we define IG by IG(X) = 0 for x 6 G and = oo for i e X \ G.
6.10. A "parabolic" problem
255
Given e > 0 we conclude from (6.86) that there exists a Ao > 0 with \uf-u(t)\ e/2 for t$_1
<
|u£ - uti\
< \u$ - u(t*)\ + \uti
- «(tf )| < e,
i=
l,...,Nx,0<X<Xo,
so that \ux(t) - ux(t)\ = \u$ - «£_il(l - (* - * t i ) A ) < \u$ - ul,\
<e
for *£_! < t < t$, i = 1 , . . . , Nx, 0 < A < A0. This proves that also (6.87)
limux(t)
= u(t)
uniformly on [0,T].
We next prove estimates which will be needed in order to get a bound on the derivatives of u\. Taking in (6.85) the inner product with tf(uf - u£_j) and using
- tlMuli)
- Mulr)
< tUu* -
ul1,M))x.
Summing from i = 2 to N\ we obtain 1
Nx
t=2
< A^u*) + A5>(«*-i) + $>*(«? i=2
u$-i,f($))x
i=2
i=2
i=2
i=2
This implies (note that
(6.88)
± £ t f k - « t i l a < 2 A E ^KA) + 2 A ^ ) + AE^I/(^)| 2 i=2
i=l
Using (6.85) and y£ G d(p{uf), 0 £ d
i=2
= 0 we get - j(u^
- x0, u* -
uti)x
256
C h a p t e r 6. Locally
Quasi-Dissipative
Evolution
Equations
for i = 1 , . . . , N\. This and Nx
~^2(uf
Nx
-X0,M
A
Nx
J
- u ^ x = £2(Ui -x0,Ui
- x 0 ) x - ] T ( « A -x0,u^_!
i=l
i=l
-x0)x
t=l
^^EO^-^-k-i-^i 2 ) i=i
imply Nx
N*
1
A ^ > K A ) < - | X - X 0 I 2 + A £ I/(*,-)II^-^I
(6.89)
i=l
i=l
Furthermore we have \I„.A -/VWI A ^ K.A"\) ^< A | < - i„ 0 1M|/(A)| - /K„ . A - x„ 0, <„,A - * ) *
(6.90)
For S € (0,T] we choose £ such that i ^ and (6.90) we get the estimate
I
dt
ux{t)
f
dt<
N
*
< S < t\. Using (6.88), (6.89) 2
d
1 v-—v
""^-l
i=2
Nx-l
NX
¥>(«A) + 2 A ^ A ) + A ^
<2\J^ 2=1
(6.91)
iV-«?-il2 A
| / ( iA \ | 2
1=2
< |x-x0|2 + 2 A ^ |/(^)| |UA-x0| i=i Nx
+ Aj> A |/(i A )| 2 i=l
+ 2\u*-x0\(\\f(\)\ Taking inner products with 0 (note that 0 € d?(xo)) gives
U^—XQ
\u$-x\).
in (6.85) and observing ( « A - x 0 , yf)x
|/(i A )| |uA - ioI > (uf - x0,f($))x (6.92)
+
> y K " *o,«* ~ « A - i ) x
- (uA - x 0 - (w2A_! - x 0 ), uA - x 0 ) x > - | U A - X 0 | ( | M A - X O |-
|MA_! - X
0
|),
>
6.10. A "parabolic" problem
257
which implies |u* - x0\ - | « t i - *o\ < Mf(ti)\,
i = l,...,Nx
Summing up we obtain (6.93)
|«„ - x0\ <\x~ x0\ + \J2 l/(**)l>
m = l,...,Nx
i=X
Using this inequality we get Nx
Nx
Nx
i
i=l
*=1
i=\
j= \
This and (6.91) gives f
d
J t-ux{t)
Nx
2
2
dt<\x-x0\
+
2\x-x0\\Y,\f{ti)\
Nx
i
Nx
i=l
j=l
i=l
+ 2 A £ | / ( ^ ) | A £ | / ( i * ) | + A£t*|/(i*)| 2 + 2K-ar 0 |(A|/(A)| + |u?-ar|). Given e > 0 we can choose Ao > 0 such that, for 0 < A < AQ, Js
eft < (a; — a;o| +2\x-x0\
f \f{t)\dt Jo
-T
(6.94)
t + 2 I l/(*)l [ \f(r)\drdt+ Jo Jo
= (\x-x0\+J
\f(t)\dt)\J
I t\f(t)\ dt + e Jo t\f(t)\2dt + e.
Here we have also used 2 / 0 |/(t)|/ 0 |/(T)|drdt = (/0 \f(t)\dt) . This proves that fQ t\u'x(t)\2dt and therefore also fg \u'x(t)\2dt for all 6 e (0, T] is bounded as A J. 0 for any (5 £ (0, T]. Therefore there exists a sequence (A„)„ £ N with A„ 4- 0 and a function v € L2(6, T; X) such that w-limn—•oo u\ u \ = v, i.e., lim / (0(s), «*»)*<*« = / {4>(s),v(s))x ds for all <> / e L2(<5,T;X).
258
Chapter 6. Locally Quasi-Dissipative
Evolution
Equations
For z G X we define <j>{s) = z for s G [<J, t] and c/>(s) = 0 for s G (t,T]. We get ll(4>(s),v(s))xds= (z,J^v(s)ds)x and lira / (<£(s),u^ (s)) n
ds = lim (z, / u'x
->°°j5
n^oo\
Js
(s)ds) "
/x
= l i m ( s , u A J * ) - f i A n ( < % = (*, «(*)-«(*))*»
*€[J,r].
Here we have also used that u\ —* u uniformly on [0, T]. Since the above equations are true for all z G X, we have (6.95)
u(t) - u{8) = I v(s) ds
for all t G [6, T],
Js
i.e., we have u G Wl<2{5,T;X) for all 6 € (0,T] and «'(£) = v(i) a.e. on (0,T]. This shows also that in fact we have w-lim,\j.o u'x = u' in L2(6, T; X). We choose [w,z] G dtp and take inner products with u^ — w in (6.85). Observing (j/^ - z, u* - w)x > 0 this gives hp$ - w\2 - i | ^ _ i " H* < *(/(**) -z,*i-
v)x,
i=l,...,Nx.
For t G (0, T) and r > 0 such that i + r G (0, T) we choose £, m such that *£_i < t < t* and t ^ l _ 1 < t + T < t ^ l . Summing the inequalities from i = £ to m we get 1 1 2 ^ " H2 " 2 ^ - 1 -
m w 2
! ^
A
E ( / ( f ^ ) - z^i
-
w
)x-
For A l 0 this implies
||«(t + T) - w|2 - i|«(t) ~w\2< J (-(u(£ + r) - u(t)),u{t)
-w)
(/(*) - *,«(*) - *>)* <**
< —(\u(t + r) - w| 2 - |u(t) - w| 2 ) 1 /" t+T
^7/
(f{s)-z,u(s)-w)xds.
For any £ G (0, T) where u'(i) exists we get by taking the limit r 4- 0 (/(*) - u'(t) - z, u(t) - w)x
> 0 for all [w, z] G dtp,
which by maximal monotonicity of dtp implies u(t) G domdtp and f(t)—u'(t) dtp(u(t)), i.e., equation (6.83) holds a.e. on (0,T). From inequalities (6.89) and (6.93) we get for A 4- 0 the estimate liminf J % ( « * ( < ) ) d t < \(\x
-x0\
+J
\f(t)\dt)2.
G
6.10. A "parabolic" problem
259
Since 0 < p(u(t)) < liminixiov{u\(t)) lemma in order to get
for t G [0,T], we can apply Fatou's
J
\f{t)\dt)\
i.e., ¥>(«(•)) GL^OjTjR). From (6.94) we get, for S | 0, J
t\u'x(t)\2dt<(\x-x0\
+J
\f(t)\dt))2
+J
t\f(t)\dt
This shows that there exist a function v G L2(0,T;X) with \ n 10 such that w-limn-xx, tx/2v!x = v, i.e., lim / (4>(s),81'2u'x(3))xds= ° Jo
n_>0
{ Jo
+ e,
Ae(0,A0).
and a sequence (Xn)neK
(
for all cfi G L 2 (0,T;X). This implies also rim„__>.00 Jg (4>(s),s1/2u'Xn(s))x ds = J^(^(s),v(s))xds for all (/> G L2(6,T;X), S G (0,T). Since 0 G L2(S,T;X) x2 2 if and only if s ' (p G L (£, T ; X ) , we have, using also w-lim^o w'A = u' in L2(6,T;X), f (J>(s),v(s))xds=lim = J
(s1/2cf>(S),ux(s))xds
f
(S1/2cl>(s),u'(s))xds
= J
((j)(S),S1/2u'(s))xd8
for (f) G L2{5,T;X), which implies t ^ V = v € L2(Q,T;X). Thus we have shown that the unique integral solution u has all the properties listed in the theorem provided / G C(0,T;X). For <7 € C(0,T;X) let (MA)A>O be the DS-approximation for the unique mild solution u of equation (6.83) with g instead of / with the same time mesh tf,i = l,...,N\. Subtracting the equation g{t*) = A _1 (u* - u ^ ) + y$ from (6.85) and taking inner products with uf — u^ we obtain
resp.
k A - « A | < | « t i - ^ A - i l + Mf(ti) -g&)\, A
i=
i,...,Nx,
where we have also used that (t/ — y^,u^ — u^)x > 0. Summing up from i = 1 to TO we get 771
k,-^i
260
Chapter 6. Locally Quasi-Dissipative
Evolution
Equations
For t E (0, T] we choose m such that t ^ _ ! < t < t^. For A J, 0 we have (6.96) \u(t) - u(t)| < / |/(s) - g(s)\ ds < T^2\f - g\L^T,x), Jo
0
For / G L 2 (0,T;X) we choose a sequence ( / „ ) „ 6 N C C{0,T;X) with |/"/n]L2(o,T;Jvr) —> 0 as n —> oo and denote by «( n ) the unique integral solution of (6.83) with fn instead of / . From (6.96) we see that (u^)ne^ is a Cauchy sequence in C(0,T;X), i.e., there exists a function u G C(0,T;X) with lim u ( n ) (i) = u(t) uniformly on [0,T\. 71 —fOO
We denote by uxn' the DS-approximations for (6.83) with / „ instead of / and by (iA,M™'A,y™'A,0) the associated sequences, where as before tA = iX and
V?*A = Utt) ~ V?'X with y^" = /„(**) - A-V?'" - u?i*)
G
^«'A), i =
1,2..., N\. For n = 1,2,... we choose A„ > 0 such that
\u^-u{£\c{m)<±.
(6-97)
Then {u\ ) is a DS-approximation for (6.83) and limn^^ w^ = u uniformly on [0, T\. The inequalities (6.88) - (6.94) are also true for the functions uxn' and the corresponding piecewise linear functions ux . We define the step functions /(") by /<")(£) = / n (i A ") for i ^ < t < i A ", i = 1 , . . . , Nx. If we observe that lim | / - / ( n ) | L 2 ( o , T ; X ) = 0 ,
then we can repeat the arguments from above in order to prove that u G Wlfi(S,T;X) for any S G (0,T), i V V e L 2 (0,T;X), «(t) G domdi,? a.e. on [0,T], equation (6.83) holds a.e. on [0,T] and y(w(-)) € 1/(0, T ; X ) . It remains to prove the statements in case x G Z3efr(?). If we take inner products with u™' — u^lj in (6.85) (with fn instead of / ) we obtain 1 for i = l,...,Nx. Note that ^ « ' A ) - ^ « 1 A ) < « ' i = 1 , . . . , N\. From the above inequality we obtain
\«'X
A
- u ^ , ^ ) * for
-
Summing from i = 1 to m we get
(6.98)
jf
-4
n )
di + 2 ^ ( C A ) < 2 ^ ) + A^|/„(i A )! 2 .
.10. A "parabolic" problem
261
Let (A„)neN be a sequence such that (6.97) holds. If we take m = N\n, we get for n sufficiently large
J \jtuld(t)\2dt<2¥>(x) + jo \f(t)?dtFrom this estimate we get analogously as above (see the proof for (6.95)) that w - l i m ^ o o ^ / d t ) ^ =u'e L2{0,T;X). In order to prove that
2n
for n sufficiently large. Observing tp(u(t)) < liminfn-^oo y(u^H, (t)) we see that
¥>(«(•)) eL°°(o,:r;X).
"
n
This page is intentionally left blank
CHAPTER 7
The Crandall-Pazy Class In this chapter we study the localized version of a class of conditions given by Crandall and Pazy in [Cr-Pa] and discuss their relationship with the theory developed in Chapter 6. The proofs follow closely the ones given in [Cr-Pa]. We prove also the existence of an evolution operator, however we do not establish uniqueness of mild solutions. This should be done by adapting the concept of integral solutions to this case and proceeding along the lines given in Section 6.5 (see the proofs for Theorems 6.19 and 6.20).
7.1.
The conditions
Let X be a real Banach space and A(t), 0 < t < Tmax, be a family of operators on X. Furthermore, assume that a real-valued, non-negative lower semi-continuous functional if : X —>• 1R with D = Deff (;) is given. We formulate the following conditions on the operators A(t), 0 < t < T m a x : (CP1) For any a > 0 and T € [0 j Tma.x) there exists a constant u>a T G R such that A(t) \oa is uja,T-dissipative for all t G [0,T]. (CP2) domA(t)
is independent oft.
We set £ :=
domA(t).
(CP3) There exists an increasing function a : RQ" —> RQ with o{a) > a for a > 0 and, for all a > 0, T G [0,T max ), a constant Xa,r > 0 such that EtlDaC
(I-XA(t))(domA(t)nDa{a))
for t e [0, T] and A e (0, A Q;T ). For the following we assume without restriction of generality that the constant u>QyT is always positive. The requirements a(a) > a and a increasing are no restriction of generality, because we can always replace a function a : MQ" -*• RQ in condition (CP3) by a(a) = a + s u p 0 < T < Q cr(r) > a(a). 263
264
Chapter 7. The Crandall-Pazy
Class
According to Proposition 1.9 and condition (CP1) the operators I — XA(t), t G [0, T], restricted to Da have a single-valued inverse for A G (0, 1/U}0IT) which we denote by Ja,\{t)- The corresponding Yosida approximation is denoted by Aat\(t). Assumption (PC3) implies that for any a > 0 and T G [0,T max ) we have (7.1) E n D a CdomJ f f ( a ) , A (t) = d o m i ( J ( a ) , A ( t ) ,
0 < A < /xQ,T, t G [0,T],
where we have set /XQ>T = min(AQ)r5 l / w 0 i r ) . Let 0 < a i < Q2 and choose 2; G E n L>ai c S n Da2. Then we have x G domJ f f ( a i )^(t) C dom J
i = l,2.
This implies 2/1,2/2 G domyl(i) n_D(T(Q2) and a; = ( J - XA(t))yi = (I - XA(t))y2 for t G [0, T] and 0 < A < min(/i Qlj T, £ta2,T)- By wCT(„2)iT-dissipativity of A(t) \D„,a ) this gives 2/1 = 2/2- Thus we have proved that (7.2)
J f ( a i ),A(t)i = J
t G [0,T], 0 < A < min(/i Q l i T ,/i Q 2 ) T ).
We are now in a position to state a growth and a continuity assumption for the operators A(-): (CP4) There exist continuous functions a,b : [0,T max ) —• R, b being nonnegative, such that we have T (v(J
f{x))
< a{t + \)
all x G E n Da,
+ X)x) + b(t + A)
X G (0, /J Q ,T) and £ e [0, T].
(CP5) For any a > 0 ^ftere exisi a continuous function fa : [0, T max ) —> X and, for
(7.3)
\Aa(a),\(t)x
-
Aa(a)tx(s)x\
< \fa(t) -
fa(s)\La,T(\x\)K(\Aa(Q),x(s)x\)
for all t,s G [0,T], A G (0,/i Qi x) and x G E n £) Q , w/iere either K(r) = 1 or K{r) = 1 + r. In the latter case we in addition assume that fa is of bounded variation on compact intervals.
7.1. The
conditions
265
Without restriction we assume that the function La,r m assumption (CP5) is right-hand continuous, so that implies l i m s u p , ^ ^ La^T{\xn\) < Laj{\x\). From (7.1) and Theorem 1.10, (v), we conclude that (1 - Awff(Q)iT)|A(T(Q)iA(t)x| < (1 - Mw CT ( a)iT )|A a(Q)iM (t)x| for f 6 [0,1], i 6 E fl Da and 0 < /i < A < \xa,T- Therefore the limit limAj.0 \Aa(a),\(t)x\ exists for all x G E D D Q and t G [0, T] with the possibility that lim^|o |Ar(a),A(0 x l = °°. From (7.2) we see that this limit is independent of a > 0 as long as x G E n Da. Therefore we can, for any i g S f l f l and any t e [0,T], define \A{t)A
=\$m\A„(a),x(t)x\,
where a > 0 is chosen such that x G E n Z)a and T G [0,T max ) such that t G [0, T). We have also the estimate (7.4)
(1 - Aw ff(a)iT )|A ff(Q)iA (i)x| < \A{t)x\,
x G E f l D , 0 < A < /x QiT ,
for all a > 0 with x G E n Da. We define the generalized domain D(A(t)) of >!(*) by D(A(t)) = {x G E n D | |A(t)x| < oo},
0 < t < Tmax.
The estimate (7.4) implies \Aa{a),x(t)x\<2\A(t)x\, (7-5)
. \Ja(a),\(t)x\ < iia
= lim(l - \uo{a),T)\Aa{a)tX{t)x\
< \\A(t)x\\.
A4.0
Thus we have (7.7) domA{t)nD C D(A(t)) (ZZHD, *e[0,Tmax). 7.1. Definition. The family of operators A{t), 0 < t < T m a x , belongs to the Crandall-Pazy class, A(-) G C-V, if and only if assumptions (CP1) - (CP5) hold. If we take D = E and tp(x) = 0 for x G D,
266
Chapter 7. The Crandall-Pazy
case Ja,x(t) = J\{t) and Aa,\{t) - (CP5) reduce to:
= A\(t) for all a > 0, then conditions (CP1)
(HI)
For any T £ [0, T max ) i/jere ezzste a constant w y e l is UT-dissipative for all t G [0, T\.
(H2)
domA(i) is independent oft£
(H3)
For all T G [0,T max ) there exists a constant Xx > 0 such that
SMC/J
i/iai A(t)
[0,T max ).
dom A(t) c range(7 - XA(t)), (H4)
Class
t£[0,T],
AG(0,AT).
T/iere esisi a continuous function f : [0,T max ) —> X and, for all T G [0,T max ), an increasing function LT '• R^ —> KQ" such that \Ax(t)x - Ax(s)x\
< \f(t) -
f(s)\LT(\x\)K(\Ax(s)x\)
for all s,t G [0,T], A G (0,min(A T , 1 / | W T | ) ) and x G domA(t), where K(r) = 1 or K(r) = 1 + r. 7n i/ie latter case we assume in addition that f is of bounded variation on compact intervals. Conditions (HI) - (H4) are just the conditions given in [Cr-Pa]. Assume that A(-) G C-V. Taking in (7.3) the limit for A J. 0 we obtain (7.8)
\A(t)x\ < \A(s)x\ + \fa{t) -
fa{s)\La,T(\x\)K(\A{s)x\)
for t,s £ [0,T], x G S n Da. This proves that D(A{s)) t,s £ [0,T], i.e., D{A(t)) is independent of t £ [0,T max ), D = D(A(t)),
C D{A{t)) for all
0 < t < T max .
As a consequence of (7.8) we note also that, for any xo G D, any a > 0 with XQ £ Da and any T £ [0,T max ), there exists a constant MQ = M0(xo,a,T) such that (7.9)
\A(t)x0\<M0,
0
Indeed, from (7.8) we get \A(t)x0\
< |A(0)ar 0 | + |/ 0 (t) -
fa(0)\La,T(\x0\)K(\A(0)x0\)
< \A(0)x0\ + pfa,T{T)LatT(\xo\)K(\A{0)xo\)
=: M0.
The following lemma shows that the continuity assumption (CP5) is related to the continuity assumption (El) resp. (E2). 7.2. Lemma. Assume that A(-) £ C-V. following condition:
Then the family A(-) satisfies the
7.2. Existence
of an evolution
operator
267
(CP5a) For any a > 0 there exist a continuous function fa : [0, T max ) —• X and, for any T e [0, r m a x ) , an increasing function La^ : Mj" —> Rjj" such that for all ii G D n Da, U G [0, T], i = 1,2, and A G (0, /iQ,T) we /iawe (7.10)
(1 - Aw ff(Q)iT )|xi - x2\ < \xi - x
2
- \{yi - y2)\
+ MfM ~ fa(t2)\La,T(\x2\)K(\y2\ where xt = Ja(a),\{U)xi,
y{ = Aa(a)tx{U)xi,
i = 1,2.
Proof. From Theorem 1.10, (ii), we see that [xi,j/j] G A(U) By definition of Ja(a),x{m) a n d Ar(a),A(') w e obtain Xi - Xyi = xt e
|D„ {Q) >
i = 1,2.
Dr\Da,
Ja(a),\(U)(xi - *>Vi) = Xi,
Aa(a)tX(ti)(xi
- Ay*) = yu
i - 1, 2.
Using Proposition 1.9 and assumption (CP5) we get |xi - x 2 | = | J
J<X( Q ),A(£I)(Z2
- Aj/2)|
+ |^
< z
r + MfM
\xi - x ~
2
- \{yi - y2)\ fa(t2)\La,T(\x2\)K(\y2\).
The result follows, because 1 — \wa(a),T < 1-
D
Condition (CP5a) is a variant of (El) resp. (E2) for special pairs [:Ei,yj] — [Ja(a),\{ti)xi, Aa(a}x{ti)xi]We only need to consider pairs of this form, because in the construction of DS-approximations for EP(A(-)) only pairs of this form will show up. This is due to the fact that the range condition (CP3) is much stronger than either one of the range conditions (Rl) or (R2). We see a trade off between range conditions and continuity conditions imposed on the family A(-) in the sense that stronger range conditions allow weaker continuity assumptions.
7.2.
Existence of an evolution operator
We fix s, T G [0, T max ) with s < T, choose x0 G £ D D, d G (0, T m a x T), e > 0 and set a = maxo
268
Chapter 7. The Crandall-Pazy
Class
v = min(5o, d, fj,a,T+d), where (5o is the constant in Lemma 6.4, depends only on XQ and T, v = v(x§, T). For A g (0, V{XQ, T)) we define tk=s
+ k\,
k =
0,...,Nx,
where N\ is determined by X(NX — 1) < T — s < \N\,
(7.H)
x k
J xo
and
for k = 0, x
\j
for fc = l,...,AT A ,
?/fc = 47(a),A(*fc)Zfc_l = J (*fc - I f c - l ) ,
fc
= 1, . . . , iV A .
The definition of the sequences (a;fc)fc=o,...,jv* and {yk)k=i,...,Nx i s meaningful, which can be seen as follows: Assume that we have already shown that x, exist and satisfy xj e dom^4(i^)n£>Q and
i = 1 , . . . . A:,
which by Lemma 6.4 implies y(x^) < V(*j> s i vK^o); e )i J = 1, • • • > &. In particular we have x£ 6 £>Q, i.e., x£ e d o m A ( ^ ) n D Q C E n D a c dom J 0 . ( Q ) J A ( ^ + 1 ) . From Theorem 1.10, (ii), we get also lxxk,y£}£A(txk),
k=
l,...,Nx.
Now it is easy to see that the functions (7.12)
ux(t)
-
Xo for t = S, xxk f o r t e («£_!,*£], A: = l,...,tf A )
with A £ (0, V(XQ,T)) constitute a DS-approximation for EP(A(-),s,x0) defined in Definition 6.6 (note that e\ = 0). The following lemma is analogous to Lemma 6.9:
as
7.3. Lemma. Assume that A(-) e C-P. For any T <E [0,T max ) and x0 £ D there exists a positive constant Mi = M I ( X Q , T ) such that, for all s G [0, T), x £ | < M i , fc = 0,...,JV A, ; and, in case K(r) = 1 + r, also
\yl\<M^
k=
provided A is sufficiently small, 0 < A <
l,...,Nx, V{XQ,T)/2.
7.2. Existence of an evolution operator
269
Proof. We set To = T + d with d, e, a, and this section.
as at the beginning of
U(XQ,T)
a) For fixed r G [0, T] and u G DC\Da we set u = J„{a),\{r)u, v = Then condition (CP5a) implies (using also xk - Xyk = xk_r) (1 - Xua{a)tTo)\x^
-u\<
Aa(a)t\(r)u.
| ^ _ ! - w| + A(M + )fa(tx)
-
fa(r)\La,To{\u\)K{\v\))
for k = 1 , . . . , N\ and 0 < A < v{xa, T). This implies (note that 1 - AuV(Q) To < 1) (1 - \wa{a),Ta)k\x$
- u\ < (1 - Aw ff(Q)iTo )*- 1 |a:^_ 1 - u| + A|u| + A|/Q(^)-/a(r)|La,To(HWH)
for k = 1 , . . . , iV^. By induction we arrive at (1 - \oja{a),To)k\xXk
-u\<
\x0 -u\ + k\\v\ k
+ XLa,To(\u\)K(\v\)
Y, \Mt$) -
fa(r)\.
Using \fa(tx) - fa(r)\ < Pfa,T0{\tf - r\) < pfa,T0(T0) and (1 - A O V ^ T J - 1 < exp(2Xu)a(a)tTo) for A G (0, i/(a;o,T)/2] we obtain (observing also (7.5)) \xXk\ < \u\ + Ma.To \A(r)u\ + e2To"°^o + T0(2\A(r)u\ — Mxfaro.T),
(\x0\ + \u\ + ^{a),T0
+
\A(r)u\
Pfa,T0(To)La,To(\u\)K(2\A(r)u\)))
k=l,...,Nx,
0 < A<
v{x0,T)/2.
b) Let K(r) = 1 + r. From (7.6), Theorem 1.10, (ii), (7.4) and (7.8) with x — x%_v t = tx.,s = tfc_i we obtain l^)^|-|^(*fc)^(a),A(ifc)4-ll < \\A(txk)Ja{ahx(txk)xxk^\\ (7<13)
<
\Aa{ahx(txk)xxk^\
< (1 - Aw^aJ.To)"1 M * * ) * * - ! I
+ |/«(t£) " / a ( i t 1 ) | i « , T o ( | x t 1 | ) ( l + | A ( i t l ) 4 - l I))We choose M x such that \xk\ < M 1 ; /c = 0 , . . . , _/VA. Analogously as in the proof of Lemma 6.9 we set ak = (l-
Xtoa{ahTo)k\A(tx)xxl
bk = L^iM^Utl)
-
fa(tX-i)\-
270
Chapter 7. The Crandall-Pazy
Class
Then (7.13) implies ak < {l + bk)ak-i +bk,
k=l,...,N)i.
As in the proof of Lemma 6.9 we get k
k
ak < fa 0 + ^ 6 „ J e x p f ^ 6 n J , We have 5Z*=i bn ^ £ a ,T 0 (Mi) var[0,T0] /«
k=
and
l,...,N\.
consequently
2^0 I + ^Q,T0(-Wl) var[0,To] fa J x exp^2T0o;CT(Q)jTo + L Q)To (Mi) var (0iTo ] / a J , for A; = l,...,Nx and 0 < A < V(XQ,T)/2. choose M 2 = M2{XQ,T) such that \A(tx)xx
(7.14)
\<M2,
Using (7.9) we see that we can
k = 0 , . . . , ATA, 0 < A < u(x0, T)/2.
The estimate (7.13) contains the inequality 7(a),. \Vk\ = |Ar(a),A(*fc)a:*-ll
<
•(l^L^-il
1 - AW 0 .( Q)ITO
+ \fa(tXk)
- /afOlWoflSfc-lDU
+ M * k - l ) * * - l I))
< i ( M 2 + / 0 / a , r o (A)X Q , r o (M 1 )(l + M 2 ) ) < i ( M 2 + p / t t > r o ( i / ( i o , r ) / 2 ) L a , T o ( M 1 ) ( l + M2)) = : M 2 ( x 0 , T ) forfc= l,...,JV A , 0 < A < i/(x 0 ,T)/2.
•
Given XQ £ D and s,T € [0, T max ) with s < T we define a and To as at the beginning of this section. For 0 < \x < A < u(xo, T)/2 we set aktl = \x$ - x%\,
k = Q,...,Nx,
£ = 0,...,AT M .
The constants
£l = (1 - ^ a ( a ) , T o ) _ 1 ^
»7l = ( 1 - M^
are non-negative and satisfy £ + 77 = 1. In order to prove convergence of the DS-approximations (7.12) we have to establish an appropriate estimate for ak^. To this end we shall need a sequence of lemmas.
7.2. Existence
of an evolution
operator
271
7.4. Lemma. The numbers akte satisfy the recursion (7.15)
ak,e < Ci^ft-M-i + mak,e-i
+ h,e,
k = l,...,Nx,
£=
!,...,N^,
where bk/^fi\fa(txk)-fa(t^)\LaiTo(M1)K(Ml),
k = l,...,Nx,
£=1,...,N^,
with the constant Mi of Lemma 7.3. Furthermore, we have
7.16
where KQ(x0,T)
akfi<XkK0(x0,T)e2To^^To,
k=
Q,...,Nx,
a0J
1=
0,...,^,
= M0(x0,a,T0)
(see (7.9)).
Proof. By definition of the sequences {x%)k=o,...,Nx
&k,l — \Ja(a),\\tk)xk-l
~
< | Ja(c)AtXk)4-l
(7.17)
an
^ (xi)l=o,...,N
we
get
Ja(a),fj.{t()xi-i\
~ ^(a), M (tfc)a^_l|
+ \Jtr(a),ii.\tk)Xt-\ ~ •Ja(a),IJ.\':e)X(-l\-
Note that x^_x e S n Da C dom JCT(Q)]M(t) for £ G [0, To]. Using the resolvent identity (see Theorem 1.10, (iv)) we have, for 0 < fi < A < U(XQ,T)/2,
\Ja(a),\\tk)xk-l
J(T(a),fi\tk)xe-i
X — /i ^ ( ( i J ^ l ^ j L ^ - l "I
< 1
—
7
Jo(a),\\tk)Xk-lj
Jcr(a),n(tk)xe_i
|^fe-i + Vxk - (£ + ??X_i I
< 6 a n , H + ')iaii,<-i,
A; = 1,...,NX,
t = 1,...,7VM.
This inequality together with (7.17) and (PC5) gives (7.15).
272
Chapter 7. The Crandall-Pazy
Class
In order to prove the estimates (7.16) we use (7.4) and (7.9) in order to get k
afc,o = \x\ - Z o | = | ( n ^ ( " U ( ^ ) ) X o
~x°
i=i
K=l
i=K
i—K+1
k
k
= A £ ( l - A W
fe
< A £ ( 1 - A W
< A ^ o ^ o , T ) ^ ( l - A Wff(a) , To )- K <
XkK0(x0,T)e2k^^°
K= l
< XkK0{x0,T)e2TouJ^^To,
k = 0,...,Nx,
0 < A<
v{x0,T)/2.
Analogously we get the second estimate in (7.16).
D
Concerning the recursion (7.15) we have the following result: 7.5. Lemma. Let the non-negative numbers ak,i,k = 0 , . . . ,N\,£ = 0 , . . . , N^, satisfy the recursion (7.15). Then we have the following estimate1: min(fc-l,€) 3' ~ 1 \ /-k
«M< E
j=0 -1
^-v,o+Erif
j-k
j=k
min(k-l,j)
ib +E E {im*-
and £=!,...,
N^.
Proof. We define the vectors at = {ai,t,...,aNxti)T, 1
Recall that £ * = f c = 0 if k > I.
h = {k,t, • • • ,bNxie)r,
£=
1,...,^,
7.2. Existence of an evolution
operator
273
and the nilpotent matrix / o
•••
1
• • .
°\ tNxxNx
o '••
Q =
In ...
0
1 0/
Then the recursion (7.15) can be written as at < {ml + ZiQ)at-i
+be + 6 K / - 1 , 0 , . . . , 0 ) T ,
I = 1 , . . . , N^,
where it is understood t h a t the ordering in R " * is with respect to the standard positive cone (i.e., the set of all vectors with non-negative coordinates). Since the constants ft, rji and the coordinates of the vectors at, be are all nonnegative, we easily get by induction t h a t e
at < {rnl + ZiQ) a0
+ ft ^(ml
+ hQyiaoj-j-uO,
•..,0)T
3=0
3=0 We have (mI + ^Q)j = £ i = o (foW^Q*
and, for * = 0 , . . . , Nx,
Qla0 = ( 0 , . . . , 0,01,0, • • •! o-Nx-ifi) Qlh-j
,
= (0, •• • , 0 , 6 1 ^ - j , . . . ,6jv x -i,«_j) ,
i
Q (a0,f_j_i,0,...,0)T = ( 0 , . . . , 0 , a 0 , ^ - i , 0 , . . . , 0 ) T , where in the third case the element ao,^_j_i is t h e (i-fl)-st coordinate of t h e vector on the right-hand side. Using these relations we easily get:
ak,e<^{M{r)li 3 ak-j,o+ Y l \ j=0 """ j=l e-i fe-i , .s
k
_i ) ^
k(1
o,t-j
j=0i=0 ^ ' Observing t h a t (?) = 0 for i > j we get the result.
•
274
Chapter 7. The Crandall-Pazy
Class
Inserting the estimate (7.16), the definitions of £i, r}\ and the definitions of the bk e into the estimate of Lemma 7.5 we have K0(x0,T)e4To"°^°
ak,e <
fc-i
e
//lX
x w
3=0
(7.18)
j=k 2Tou
+ + £a,T0( LatTo(M1)K(M1)e (-1 e-i
fc-1 fc-i
'^^o
, .x
x, j=Q i=0
foik = l,...,Nx,£
=
l,...,Nfl.
7.6. Lemma. Let £, 77feenon-negative numbers satisfying (,+t] = 1. Then we have the estimates fc-i
E (fW~j(*"j) - ^ ~k)2+£^1/2'
3=0
W
E(r i 1 >v-'( f -^(f + (^ +t - f ) 2 ) i/2 3— k
Proof, a) Using Cauchy-Schwarz and £ + 77 = 1 we get
a:
= E ('W-j'(* -3) < E (-Vy-^ - j\ fc-i
j=0
V J /
W
j=0
Using (™)n = m(™_l) for m, n e N we obtain £-1
/„
j=0 \
«-i
lN
J
/
j = 0
\
J
/
£—2
= k2- 2Ui+it+e(£ - i)e E (l ~.2 W- 2 - j •i=n \ 3=0 /,2 C 2
k* - 2ktz+it,
J
/
+ ^(1 - 0 = (* - *o + ^?-
7.2. Existence of an evolution operator
275
b) Analogously as under a) we get i
" s(i:e:l)^r(i:(i::)^'-<j—k
1
Using (-^Y )
=
(~l)^(~j )
j=fc ^
y
j=k
we
et
& ^
'
or t le
^
^
rst
actor o n
f
'
the right-hand side
j=0
For the second factor on the right-hand side of (7.19) we get by similar computations as under a)
3—k
3= r.2
fc)» +
2(/-fc)|
+
|
+
*(fe
+
l)^=(/-*
+
| )
a +
^.
By definition of £ and rj we have A((# - A;)2 +
^TJ)1/2
= ((ty - fcA)2 + £/x(A = ( ( ^ - ^ )
2
M))
1/2
+ ^(A-M))1/2,
For the second term on the right-hand side of (7.18) we have the following estimate:
276
Chapter 7. The Crandall-Pazy Class
7.7. Lemma. For all 6 > 0 we have e-i fc-i 1
• = ^ E E (i W'-Va(*ti) " /«(*/%)! < *?(p/o,To(|tfc " tf I) + P/n,Ib W + ^ ( A " M)^P/„,To(To))
/orfc = l,...,.NA, * = 1,...,JV M . Proof. Using £ + 77 = 1 and subadditivity of p/ Q ^ we get * - i fc-i 1
^ ^ E E (^ )«V-iP/a,ro(l*A - ^ + j> - iX\) j = 0 »=0
^ ' £-1 fc-i , . ,
< ^P/Q)T0(|fcA - £fi\) + M E E ( • )^V'-iP/a,To(lj> - *A|). -n j„_n = 0 ,i=0
\ V
Given 6 > 0 we split the second term on the right-hand side of this inequality into part h containing all terms with \jfi - i\\ < 5 and part h containing all terms with \jji — i\\ > S. We get the estimates e-ik-i
(7.22)
, .s
IX = P E E (\Y^~lPSa,T0{\m
- »A|) < v*pfa,T0{6)
\j/j,-i\\<6
and -1 fc-l / .x
J
£-lfc-l
2 = M E E (2W'-V/„,TO(IJ>- *A|) < MP/a,To(r0) E E j = 0 i=0 |j>-iA|>(S \jfj,-i\\>S
x ^
''
i=n i^n j=0 i=0 \j/j,-i\\>6
L r A 2 < W . , T 0 ( T O ) E~E ( A - ) ^,i„i-i V - 0> -<*2*' )
j = 0 2=0 e-1
j
/_. x
f-1
j
j=0 i=l
PP/ Q ,Tb(r 0 )
•(ai + a 2 +03)-
(jVv~ W
7.2. Existence of an evolution operator
111
We have
3=1 J
Using i($ =j( iZl)
i=i
we get
a2 = -2A M £j 2 £ ( ^ J W " ' = -2Atf£j 2 « + „)'-1 = -2M2 £ j 2 . Analogously we get for a%: e-i j=l
j-i i=o
^
*
/
*-l
i-l
3-2
,.
3,-=i =1
3=2 ,'-o
i -i=0 n V
„x
= **£;+^£;(;-i)Ef; W"2-' '
/
(A 2 e-A 2 aD+^ 2 £- 2 = (AM-P2)Ei+M2Ej2 j—l
j=l
3= 1
j=l
Summing up we obtain ^_1 £(£ — 1) CLI + a2 + a3 = (A// - // ) £ j = /z(A - A * ) " ^ — - < MA - M ) ^ , 2
so that j2
This inequality together with (7.21) and (7.22) gives the desired result.
•
Finally, the estimates in (7.18), Lemma 7.6, (7.20) and Lemma 7.7 imply, for any 5 > 0 and XQ £ D n Da, the estimate a M < c(x0,T)(2(Wt
- txkf + T0(A -
n)f2
(7.23) + 2b(/>/„,ib(ltf - 4\) + Pfa,T0(S) + ^ ( A -
n)ToPfaiTo{T0)))
for fc = 1 , . . . , N\, £ = 1 , . . . , ./V^ and 0 < \i < A < ^(a;oi T)/2. Here we have set c(xo,T) = max(K0(x0,T)e4To^^'To,LatTo(M1)K(M1)e2To^^^o). Observe that Mi = Mi(x0,T) and T0=T + d(T). The estimate (7.23) is fundamental for the proof of the following theorem:
278
Chapter 7. The Crandall-Pazy
7.8. Theorem. Assume that A(-) G C-V and fix T e [0,T m a x ). following is true:
Class
Then the
a) There exists an evolution operator U(t, s ) : E n D - > S n f l , 0 < s < t < T , for the problem EP(A(-)). For any xo E £ n D there exists an a > 0 such that A(t-s)/\]
(7.24) U(t, s)x0 = liml
JJ
.
Ja(a),A(s + jA) Jxo
uniformly for t E [s,T].
ITie function u(-;s,xo) = U(-,s)xo is a mild solution of EP(A(-),s,Xo) [s,T]. Moreover, for any d E (0,T m a x - T) we have the estimate \U{t,s)x0 - U{t,s)y0\ < e^'W+^—^xo-yol, for any x0,y0
0 < a < t < T,
£EnflQ.
b) For any xo E D there exists a constant Co = (7.25)
on
CO(XQ,T)
such that
\U(t, s)x0 - U(T, S)X0\ < c 0 (|t - T\ + pfaiTo(\t
- T\))
for 0 < s < t,r < T. If K(r) = 1 + r in assumption (CP5), then this estimate can be replaced by \U{t,s)x0-U(T,s)x0\
< co|* — r|,
0 < s
< T.
Moreover, in this case we have U{t,s)DcD,
0<s
c) For any XQ E D there exists a constant c\ = ci(xo,T) s,r E [0, T] and T > 0 with s + T
+ T,r)x0\ < cipfatT(\r
such that for all
- s\),
where a > 0 is chosen such that U(t, S)XQ G Da and U(t, r)xo e Da for t G [s,T] resp. t G [r,T]. Proof. We fix s,t G [0,T] with s < t, d G (0,T m a x - T), e > 0 and set To = T + d. In the following we always choose a > 0 such that max i/}(t,s,
s
max ip(t,s,
...
< a.
SiS-*o
a) For A,/i G (0,v(x0,T)/2] with fj, < A we choose k\ G {1,...,JV A }, l^ G { 1 , . . . , N^} such that \{k\ - 1) < t - s < \kx and ^(i^ - 1) < t - s < fd^. We have «A(<) = <
= ( f t Ja(a),A(**)Ja:0,
«/,(*) = <
= ( i l
«k
7.2. Existence of an evolution
operator
279 /J)1/4
and according to (7.23) with S = (A — \ux(t) -
U/1 (i)|
= a f c ,^ < cOco.T) ^ ( ( ^ - O + T0{Pfa,To(\tl
2
+ T0(\ - xx))1/2
- tfj) + P/«,T0((A - /x)1/4)
+ (A-/i)1/2r0p/Q,rQ(To))). Observing |t£ - t^ \ < A + \i we see that lim \u\it) - xxM(£)| = 0 uniformly for s,< G [0,T]. A, ^4-0
Let now XQ G £ n D. With a as defined above we have XQ G X n .DQ D D D a (observe (7.7) and the fact that Da is closed). We choose a sequence (xn)neN in 5 n D a with x„ —> xo- Using (7.23) with 6 = (A - /x) 1 / 4 and the Lipschitz condition for Ja(a),\(t), t G [0,T] (see Theorem 1.10,(i)), we get • kx |«A(*)-«
M
x
, «u
II ^wA^) Un - ( [J Jv^Atj) )X
(*)|<
i=i
+
'
S=i
' J
o^)A^))x
I I ^(a),A(**) )a:o " ( I I 1=1
'
3=1
\=1
'
'
\=1
k
< ((1 - Xu>ala)lTo)- > + (1 -
' e
^a(a),T0)- ")\XQ
~Xr,
+ c(xn, T) (2((A + /x)2 + r 0 (A - /x)) 1/2 + To(p/ a ,r 0 (A + /x) +
P/Q,T0((A
-
M)
1/4
)
+ (A-xx) 1 / 2 T 0 p / a , T o (T 0 ))) and consequently (7.26)
maa\ip\ux(t)-uli{t)\<2dv'^^t-''\x0-xn\,
n = l,2,...
A,/i4.0
Thus we have shown that, for xo G S n £), k),
U{t,s)x0
= Hm(|J.7 ( , ( a ) ) A (t*))a;o = 1 ™ ^ =
exists uniformly for t e [s,T\.
1™"A(*)
Chapter 7. The Crandall-Pazy Class
280
For xo,yo G S n D and 0 < A < min(z/(:co,T),z/(2yo,T)) let UA(-) and v\(-) denote the step functions defined by (7.12) with XQ = xo resp. x$ = yo. Given t G [s,T] we define k\ as above by X(k\ — 1) < t — s < Xk\. Then we get \u\(t) -vx(t)\
x
< (l - Xu)a{a)tTo)
\x0 -y0\
which for A 4, 0 implies \U{t,s)x0 - U{t,s)yo\ < e ^ - W ^ S o -
y o |.
This proves (7.25). In order to prove (7.24) we first observe that for t G (s, T] we have k\ = (t — s)/X if (t — s)/X is an integer and k\ = [(£ — s)/\] + 1 otherwise. In the latter case we get using (7.23) with k = k\, £ = k\ — 1 = [(t — s)/X] and fi = X the estimate / *\
x
\
A(t-s)/M
v
J
nJv^Atf)) o - ( n -(«),A(^))^o < c(x0,T)V2X for A G (0, v(x0,T)/2], (7.27)
-
OfcA.feA-l
+ T0{pfa:To(X)
+
Pfa,T0(S))
5 > 0 and a;0 G D. This implies, taking A 4 0 and J 4 0,
?7(t,s)a;o = Umf
JJ
. ^ ( a ) , * ^ ) Wo
uniformly for t G [s, T] for all xo £ D. For £ 0 G £ n D we choose a sequence (xn) C £> with a;„ —>• a;0. Then we get ,[(t-s)/A] i=l
'
,[(t-s)/\]
U(t,s)xn-(
< |?7(t, s)x0 - U(t, s)xn\ + ,[{t-s)/\} °)/"l
\
/[(*
'
^
H
—S
)/A]
j
Ja{a)^)\
AN
n •kw.A^w-f n -(«),A(^ ))a;o
i=l
< ( e ^(»),r 0 (t- s )
+ (1
_
i=l
AW^TJ-K*-')/*])
,[(*-*)/A]
[/•(t, s)a;n - f
JJ
^
i=l
'
\x0 - xr,
,
Ja(a),A(^)W '
This together with (7.27) implies that (7.24) is true for t G [s, T] and x0 G E n D .
7.2. Existence of an evolution operator
281
b) For 0 < s < r < i < T w e define Xn = {r — s)/n, n = 1,2,..., and choose N = N(n) G N such that (n + N - 1)A„ < i - s < (n + iV)A„. We have M An(i) = a^ + i v , uXn(r) = x^ and ra+JV
«A„(*)=(n
j
-(«),A„(^ A n ))'
M=n+1
AT.
'
n+JV
v
J] •WAJ**") W The right-hand side tends to U(t,s)x0 as n -> oo. The operators B n = n™=re+i ^(a),A„(*i n ) a r e uniformly Lipschitz-continuous with Lipschitz constant e2T°u,''<°)'T'o for An G (0, v(x0, T)/2] and converge strongly to U(t, r) (note that i£" = r for n = 1, 2 , . . . ) . We set xn = (]T? =1 J<7-(a),A„(**n))zo- Then we have xn —*• ?7 (r, s)x 0 and |C/(t,r)[/'(r,s)xo-B„x n | < |C7(t,r-)f/(r-, s)x0 - BnU(r, s)x0\ +
\BnU(r,s)x0-B
< \U(t,r)U{r,s)xo
-
BnU(r,s)x0\
+ e2TouJ°<-^-Tv \U(r, s)x0 - a ; n | ^ 0 a s n - > o o . This proves U{t,s)xo = U(t,r)U(r,s)xo,
x0 e S n D.
c) We set u(t) = u(t; s, XQ) = lim^o ux(t), t £ [s, T]. In order to finish the proof that U(t, s) is an evolution operator we have to prove that u(t) is continuous on [0, T]. For t, r e {s, T] we choose kx, £x G {1, • • •, Nx} such that {kx - 1)A < i - s < kxX and (£x - 1)A < r - s < £XX. From (7.23) with A = ft we get, for any <5 > 0, \ux(t)
-UX(T)\
=akx,tx
<
c(x0,T)(y2\t%x-tij+T0{pfa,TMx-tix\)+Pfa,T0{8)))-
Using |i£A - £AJ < |t - r | 4- 2A we get for A, 6 I 0 the estimate (7.28)
|«(t)-«(r)|
282
Chapter 7. The Crandall-Pazy Class
For r = s we get from (7.16) \ux(t) - ux(s)\ = \xxkx - x0\ = ak„0 < (t-s
+
XkxK0{x0,T)e2T°^^o
<
X)K0{xo,T)e2TouJ'^'To.
For A J. 0 we have \u(t)-u(s)\
(t-s)K0(x0,T)e2To"»^-T°.
<
This inequality and (7.28) prove continuity of u(t) on [0, T] for all x0 G D. Moreover, also the first part of statement b) is proved. Continuity of t —> U(t, s)x0 for XQ G D together with (7.25) proves continuity of t -> U(t, s)xo for all x0 eT,nD. d) In order to prove the second part of statement b) we assume that K(r) = 1+r and choose XQ G D, t, r G [0, T] with T < t. We choose fc^ and £x as above under c). Then, for A sufficiently small, we have £x < kx and kx
\ux(t) - UX(T)\ = \x£x - x$J
(7.29)
kx
From (7.8) with s = tx , t = tx and a; = a;^ we obtain the estimate (7.30)
\A{tl)xl\<\A{tl)x} + l/afeA) - fa(ti)\LatTo(\xl\)K(\A(tl)x$x
From (7.14) we get \A{txx)x^ \ < M 2 for all A G (0,v(x0,T)/2]. (7.30) and Lemma 7.3 imply \A(tx)xxx
\<M2 + pfa,T0(T0)La,To(M1)K(M2),
I). This estimate,
i = tx +
l,...,kx.
The estimate (7.29) shows that kx-tx
\ux{t) - ux(r)\ < AM3 £
(1 - A ^ a ) , ^ ) - '
< \{kx - £x)M3e2^x-e^x^^-To
<{t-T
+ 2A)M3e2Taav<°>'To
with some positive constant M$ which only depends on xo and T. This gives for A I 0 \U{t,8)xo-U(T,s)x0\
< \t - T\M3e2TouJ"^-To,
0<s
In order to prove that u(t) G D we choosefc^G { 1 , . . . , Nx} such that (kx — 1)A < t < kxX. Then u(t) = l i n u ^ o ^ and i ^ 6 E n f l „ C d o m . / ^ ^ ( t ) ,
7.2. Existence of an evolution operator
t G [0,T], 0 < A < v{x0,T). /i G (0,V(XQ,T)),
283
Using Theorem 1.10, (vi), and (7.4) we get, for
the estimate
< \A
\A„{a)^{t)u{t)\
+ l A ^ a j ^ t M * ) - A«,(Q)iM(t)a:£j
+ - ( 1 + (1 - / ^ ( a ) , ^ ) " 1 ) ! ^ * ) " < | . Taking first A 4- 0 and then /i 4- 0 implies (7.31)
|A(t)u(t)|
From (7.14) for s — t% , x — x^. and (7.8) we get the estimate \A(t)xxkJ<
M2 +
AG
P/Q,T0(A)LQ;T(M1)X(M2),
{0,V(X0,T)/2],
with constants M 2 and Mi only dependent on XQ and T. The last estimate together with (7.31) gives \A(t)u{t)\ < oo, i.e., u(t) G L>. e) In order to prove statement c) of the theorem we choose k = fc(A) G { 1 , . . . , N\} such that (fc — 1)A < r < fcA. Then U(s + r, s)a;o = lim^o x%. and [7(r + T,r)x0 = l i m A i 0 ^ , where (x$)i=0,...tNx, (^)»=O,...,JVA and (^)i=i,...,jv A , (^)i=o,...,jv* are the sequences associated with the DS-approximations for the problems EP(A(-), s, x0) and EP(A(-), r, x0) (see (7.11)). We set i — 0,...,N\, and get using (CP5), Lemma 7.3 and Lipschitz continuity of Ja(a),\{') the estimate Ofc = \Ja(a),\(h)xk-l
~
J
< \Jo(a),\\tk)Xk-l
~
Ja(a),\V'k)xk-l\
+ \J<7(a),\(tk)xk-l
< MUti)
~
Jo(a),\{tk)xk-l\
- / Q (^)|L Q ,To(l^-il)^(|y f c A |) + r—rl
< *Pfa,T0{\s - r\)LatTo(M1)K(M1)
+i -
—
a fe -i ak-i.
AWCT(a)]To
By induction we get (1 - *u>ir{a)tTo)kak < Xkpfa,To(\s rDLapoiMJKiMi). Observing kX < T0 and (1 - AwCT(Q)ix0)_fc < exp(2T0u;CT(Q)iTo) we get, for A 4- 0 and C\{XQ,T) appropriately defined, \U{s + T,S)X0 - U(r + T,r)x0\ < ci(x0,T)pfatTo(\s - r\).
n
Chapter 7. The Crandall-Pazy Class
284
7.1. Remark. In the proof of Theorem 7.8 we have actually shown that lim \u\ — u\ = 0 AJ.0
uniformly on [s,T], where the step functions u\ are denned by ' ( n j = i J A ( S + J'A))« 0 ux{t)
for te(s k=
[
(YI ?JI
X]
I. wo
M*
+ {k- 1)A, s + Xk], l,...,[T/\),
+ j A ) ) « o for t € (a + [r/A]A, T], for
£ = s.
CHAPTER 8
Variational Formulations and Gelfand Triples In this chapter we establish well-posedness for variational formulations of evolution problems in Hilbert spaces which are pivoting spaces of Gelfand triples by using the concept of DS-approximations. We recover the results given in [JLi] and [Bb4]. In Section 8.2 we provide an approximation result of LaxRichtmyer type (i.e., convergence follows from stability and consistency of the approximations).
8.1.
Cauchy problems and Gelfand triples
Let H be a real Hilbert space with inner product (-,-)# and X C H be a separable reflexive Banach space such that the triple (X, H, X*) is a Gelfand triple as defined in Section 3.1. We shall denote by J the injection X —> X*. In the following we always view H as a subspace of X*. Therefore we have Ju = M, u 6 X. We recall also that (u, v) = (u, V)H for u G X and v £ H. For single-valued operators A(t) : X -> X*, 0 < t < T, T > 0, and for a function / : [0,T] —> X* we shall consider the Cauchy problem (81)
jtu(t) u(0)
+ A(t)u(t) = f(t),
0
=u0GH.
We assume that the operators A(-) satisfy the following conditions: (Gl)
There exists an u> G M such that the operators A{t) + u>J are monotone for almost all t e [0, T]. Moreover, the operators A(t) are hemi-continuous for almost all t € [0,T].
If the operators A(t) satisfy (Gl) and we choose u> > a>, then the inequality («i - u2, (Co J + A(t))ui - (Co J + A(t))u2) - (C0-i0)(ui
-U2,Ui
~U2)H
+ («i - u2, (LOJ + A(t))ui - (UJJ + A(t))u2) >(Cb-uj)\u1-u2\2H>Q, 285
0
286
Chapter 8. Variational Formulations
and Gelfand
Triples
shows that also the operators d> J 4- A(t) are monotone. Henceforth we always assume that u) > 0 in (Gl). (G2)
There exist constants M > 0 and p £ [2, oo) such that \A{t)u\x,
(G3)
< M{\u\p^
+ 1),
[0,T].
There exists an a > 0 such that (u,A(t)u) +u\u\2H > a\u\px,
(G4)
u£X,t£
u £ X, t£ [0,T].
For any u(-) £ £ p ( 0 , T ; X ) , the function t -» A(t)u(t) measurable.
£ X* is
We furthermore assume that / £ Lq(0, T; X*), where 1/p + l/q = 1. Throughout this section we agree to extend /(•) and A(-) beyond T by setting f(s) — 0 and A(s) = 0 for s > T. For A > 0 we set t* = iX, i — Q,...,NX, where Nx is determined by X{NX - 1) < T < \NX. We define 1 /" ; A^u = A(s)uds, A
ti=\r
u £ X, i =
l,...,Nx,
M-i
f{s)ds,
i=i,...,NX.
Note that in view of (G4) the operators A\ are well-defined. We shall need the following properties of the operators A(-) resp. A*: 8.1. Lemma, a) Assume that the operators A(t) satisfy (Gl) - (G3). Then, for any X £ (0,1/ui] and almost all t £ [0,T], the operators J + XA(t) are maximal monotone with range(J + XA(t)) = X*. b) Assume that in addition also (G4) is satisfied for A(-). Then, for any A £ (0, l/u>] and i = 1 , . . . , Nx, the operators J + XAf are maximal monotone with range(J + \A$) = X*. Proof. Hemi-continuity of J + XA(t) resp. of J + XA$ a.e. follows immediately from (Gl) resp. from (Gl), (G2) and Lebesgue's dominated convergence theorem. The considerations following the statement of (Gl) show that ( 1 / A ) J + A(t), and therefore also J + XA(t), is monotone a.e. because we have
8.1. Cauchy problems and Gelfand triples
287
1/A > <j. Monotonicity of J + XAf then follows from the estimate (MI - u2, (J + XAf)m - (J + XA$)u2) 1 f = -r /
i
(ui - u2, (J + XA(s))ui ~(J + XA(s))u2) ds > 0.
From (G3) and Aw < 1 we get
(82)
(u, (J + XA(t))u)
\u\2H
Mx
|«|x
Au,A(t)u)
X , . ,,
14*
|«|x p
> YJ- \u\
x
,
= AaH^
1
„,
x v,
"
for almost all t G [0, T],
which proves coercivity of J + XA(t). For J + XAf we get from (8.2)
1 [**
(u,(J + XA})u) \u\x
(J + XA(s))u) ds
A|u > Aa|w|^r ,
BgX
Then Theorem 1.39 implies the result.
•
Under assumptions (Gl) - (G5) we shall consider the following time discretization of problem (8.1): (8.3)
u\ - u\_x + A ( 4 V - / • * ) = 0, UQ
=
UQ G
* = l , . . . , NX,
H.
From Lemma 8.1 it is obvious that the sequences (u*)i=i,...,jvA C X are welldefined for A G (0,1/w]. Corresponding to the sequences uf, / * , ^4^ we define the step functions ux, fx and Ax by
(M
J uo for i = 0,
« * ( * ) = ,[u*A _for * -€ ( * £ _ ! , #-] , /M*)
fo [ft
^ ,A
for i = 0, ,A loite(tl1,tf\,i
A,
t = l,...,./V A , =
l,...,Nx,
resp. 8.5)
Axit) = I
'
\
It is convenient to set fx(t) = 0, A\(t) = 0 and u\(t) = 0 for i > AJVA and to consider fx, Ax and uA as functions on [0, T + 1].
288
Chapter 8. Variational Formulations
and Gelfand
8.2. Lemma. The elements uf, A G (0, l/2w), i = 1,...,N\, satisfy (1 - 2Aw)*|«2& + ^ ( l - 2 A W ) i - 1 ( | ^ -
2 Uti| ff
Triples
defined by (8.3)
+ *a\u}\px)
(8-6)
fc = 1 , . . . , ATA, where cp =
1
1 q
2 q~ (ap) - .
Proof. From (8.3) we get {u$, u$ - uti)H
+ \(ut A$u$ - ft) = 0,
i=
l,...,Nx.
Using the identity 2(u,*,u,* - ut^H
= \u}\2H + KA - u£_i& -
\ulrfx
we obtain (8.7)
\u}\2H + \u$ - ^_iltf + 2\{ul A$u$) - 2X(uf, / * ) =
\utM-
x
This equation, the definition of the operators A and (G3) imply (8.8)
(1 - 2\w)\u*\2H + \uf - U ^ I I H + 2Xa\ut\px - 2\{ulf?)
<
\uU\jj.
Using the inequality ab
+ cbq,
a,b>0,
l/p+l/q
= l,
c=
q-1p-q/p,
we get (ulft)
< \u$\x\f?\x-
< f \u$\px +
\cP\ti\qx*-
The last estimate together with (8.8) gives (1 - 2\uJ)\u*\2H - \uU\l
+ KA " Ui-i\2H + *<*\*i\x - ^\fi\x-
< 0-
Multiplying this inequality by (1 — 2Aw)*~1 and summing up from i = 1 , . . . , k we get (8.6). • 8.3. Lemma. Let A(-) and f satisfy (Gl) - (G5). Then there exist positive constants Ao and M 0 such that max(|UA|LP(0,T+l;A-), \u\\L°°(0,T+1;H),
forO < A < A0.
\A\U\\Lq(o,T+l;X'))
< M0
8.1. Cauchy problems and Gelfand triples
289
Proof. The estimate \ti\h < W f
\f(s)\x.dsY < A-«+«/" f
\f(s)\x,ds
(8.9)
\ f A
\f(s)\x,ds
J(i-1)\
shows that (8.10)
^Mft\h< i=i
Jo
\f(s)\x,ds<
\f(s)\\,ds Jo
for A sufficiently small, 0 < A < Ao- This implies N
*
/-T+l
^ ( l - 2 A W ) i - 1 A c p | / f | ^ .
(8.11)
\f(s)\x.ds,
0
if we assume that in addition Ao < l/2w. Using (8.6) we get N
*
/.r+i
(8.12) a £ ( l - 2 A u ; ) i - 1 A | u * & < | u o & + Cr /
\f(s)\qx,ds,
0 < A < A0.
Observing (1 - 2Aw)_A: < e4kXuJ for A G (0, l/4w], we get fT+1
/
r\Nx
Nx
\ux(t)\xdt = Y,X\ui
\ux(t)\xdt =
Jo
Jo
\X
i=1
Nx
<^(l-2Aa.)-^+ 1 -)A|^|5 r < -e^T+1^(\u0\l CH
for 0 < A < A0 < l/4w, i.e., (8.6) the estimate
Jo
|WA|Z,P(O,T+I;X)
,.A|2 , ^ <e „ 44(T+ ( r +1)ul l W l „ . 2 |2 , „ (\u \ +c 0 H
/•T+l /
pJ
fT+l\f(S)\x,ds)
+ cp
\
'
< °°- Analogously we obtain from
\f(s)\gx.ds),
k=l,...,Nx
which proves the estimate for |wA|i,oo(o,T+i;i/)Concerning the function Axux we get from (G2) the estimate (using also (8.12) and the definition of the operators A*)
/ J
o
\Ax(t)ux(t)\x.dt = Y/MAM\x i=i
290
C h a p t e r 8. Variational
Formulations
and Gelfand
Triples
Nx
< £ > ( ! - 2Aw)-(2V*+1-iHVljci=l Nx
A
<M*J2
(! - 2Aw)-<JV*+1-i>(l + I^IJT 1 )*
»=I
/Nx
Nx
\
< 29~1M« I 53 A(l - 2Aw)- ( ^ +1 - i V*lx + A I3(1 - 2Aw)-' <2«~1M«
(\U0\2H+CP /
4(T+l)u,
<2«-'M' ^
-
\f(s)\x,dS) + \"£ /-T+l
(\UO\2H + CPJO
\f(s)\«x.ds) +-
I'
2a> q
for A G (0, Ao] with Ao < l/4a>, where we have also used the inequality (l+a) 2q-1(l + a"),a>0,q>l.
< •
8.4. Lemma. We have lim|/-/A|z/*(o,T ; x-) = 0 A4.O
forallf€L*{0,T;X*). Proof. From (8.9) we get, for / G Lq(0,T;X* rT
Nx-l
[ \h(t)\x,dt = £ J
<>
W?\x> +
(T-\(Nx-l))\f^\x.
i=l
/
l/(s)lx* d s +
< /
1 A
Jo /-T+l
/
l/(s)lx*
JMNX-I)
!/(*)&.
JO
The function g{t) = J0f(s) ds, t G [0, T], is differentiable a.e. with g'(t) = f(t) a.e. on [0, T\. For t G [0, T] where g'(t) exists we choose iA G { 1 , . . . , N\} such that t G (tix-i,ti\. Then we have
f(t)-fx{t)=g'(t)-f?x
+
8.1. Cauchy problems and Gelfand
291
triples
This proves \im\iof\(t) = f(t) a.e. on [0,T\. Applying Lebesgue's dominated convergence theorem we get the result. • 8.5. L e m m a . Assume that u G Lp(0,T;X) also
n W ' ' « ( 0 , T ; r ) . Then we have
UGC(0,T;H).
Proof. For an a £ (0,T] we extend u onto [— a,T + a] by setting u(t) = u(-t) for - a < t < 0 and u{t) = u(2T - t) for T < t < T + a. Then we have u e Lp(~a, T + a; X) and u' G Lg(—a, T + a, X*). For a continuously difFerentiable function a : [-a,T + a] -> K with cr = 1 on [0,T] and cr = 0 on [-a, -a + S] U [T + a - S, T + a], 0 < 6 < a, we set w(t)=a(t)u(t),
-a
+ a.
1
For a sequence of mollifiers pn, n— 1,2,..., we define rT+a
Wn(t) = I
pn(t - s)w(s) ds,
-a < t < T + a, n = 1,2,... .
J—a
Observing w'n(t) = f_a pn(t — s)w'(s)ds we get from standard results on mollified functions (see for instance [Wl, Section 1.3]) lim \wn - w\LP(_^T+a.X)
= lim \w'n - w'\Lq,_a,T+
x*)
= 0.
On the other hand we have rT+a
w'n(t) = /
p'n(t - s)w(s) dseX,
-a < t < T + a, n = 1, 2 , . . . ,
J — ex
which shows that w'n(t) G X. The estimate \wn(t)
~ Wm{t)\2H
=
/
—\wn{s)
= 2
-
Wm{s)\2Hds
(wn{s)-wm{s),w'n(s)-w'm(s))ds J —a rT+a
< 2 / \wn{s) - wm(s)\x\w'n(s) J—a < 2\wn - wm\LP(_atT+a.x)\w'n -
-
w'm(s)\x-ds w'm\Lq{_a,T+a.x,}
shows that (tu„) is a Cauchy sequence in C(—a,T + a;H). We set w = limn-j.oo wn G C(—a, T + a;H). Observing the continuous embedding X Q H J
We demand that pn G C£°(R), p„ > 0, suppp„ = [ - 1 / n , 1/re] and fl/™ pn(s)ds
Compare also Section A.3.
= 1.
292
Chapter 8. Variational Formulations
and Gelfand
Triples
(let c denote the corresponding embedding constant) and using Holder's inequality we get fT+a \wn ~ w\2L2(~a,T+a;H)
^ I J—a
\Wn(t)
~
w(t)\xdt
< c2(T + 2a)^-2^\wn
-
w\lP(_aiT+aiX),
which proves that also \wn — ui\L2(-a,T+a;H) ~• 0 as n —» oo. This implies that for a subsequence we have limfc_K>0 \wnk(t) —w(t)\H = 0 a.e. on [—a,T + a] and consequently w(t) = w(t) a.e. on [—a,T + a]. Thus u has a representation in C(0,T;ff). • Set X = Lp(0, T; X) and H = L 2 (0, T; H) equipped with the norms \y\x = (tfe-^\y(t)\pxdt)1/p, y 6 X, resp. \y\H = {£e-^W^dt)1'2, y G H. We have X* = L"(0,T;X*) with the norm \f\x. f e X*. From p > 2 we conclude that XQH
=
(J^e-2uJt\f(t)\x*dt)1/q,
= H* QX*
with continuous and dense embeddings, i.e., (XJ'HJX*) is a Gelfand triple. Indeed, continuity of the embeddings follows from continuity of the embeddings X Q H
£e-^{y(t),f(t))x,x.dt. Let J denote the injection X -> X* (given by (Ju)(t) u G X) and define the operator A : X -> X* by (Ay)(t) = A{t)y{t)
a.e. on [O.T] for
= Ju(t), 0 < t < T, y£X.
From assumption (G2) we see that indeed Ay € X* for y 6 X. 8.6. Lemma. Assume that (Gl) - (G4) are satisfied. Then the following is true: a) The operator A + u>J is maximal monotone. b) Let (yn)neN C X with limn-^oo yn = y G X. Then there exists a subsequence (j/nJfe€N with w-lim Aynk = Ay. Proof, a) It is obvious that the operator A + OJJ is monotone. Using hemicontinuity of A(t) for almost all t G [0, T], assumption (G2) and Lebesgue's dominated convergence theorem we can prove that A is also hemi-continuous. By Theorem 1.39, a), the operator A + u)J is maximal monotone.
8.1. Gauchy problems and Gelfand triples
293
b) Using assumption (G2) we see that \A(t)yn{t)\\,
< M*(l + l y ^ i r 1 ) 9 < M«2«-\l
+ \yn\px)
a.e. on [0,T],
which implies that (Ayn)neN 1S bounded in X*. Therefore there exist a subsequence {Aynk)keN and a z e A " such that w-limfc^oo Aynk = z. Monotonicity of A + UJJ implies Q<{w-ynk,{A = J
+ OJJ)W -{A
+
uj)ynk)
e" 2 w t (lw{t) - ynk (t), A(t)w(t) - A(t)ynk(*))
+ w\w(t) - ynk(t)\2H)
dt
for all w G X and A; = 1, 2 , . . . . Taking fc-)oowe obtain (w -y,(A
+ u)J)w -(z
+ ivy)) > 0
for all w G X.
Since .4 + UJJ is maximal monotone, this implies z = Ay.
D
8.1. Remark. It is clear that Lemma 8.6 remains true if instead of the interval [0, T] we take [0, t] with t G [0, T] for the definition of the spaces X, H, X* and the operator A. Concerning existence and uniqueness of solutions to problem (8.1) we can now prove the following result: 8.7. Theorem. Assume that the single-valued operators A(t) : X —> X*, 0 < t < T, satisfy (Gl) - (G4). Then, for any u0 G H and any f G Lq{0,T;X*), there exists a unique function u e LP(Q,T;X) D W1'q{Q,T;X*) n C(0,T;H) such that in X* (see Remark 8.2 on page 299) (8.13)
u(t) = u0~
(A(s)u(s) - f(s)) ds,
0
Jo Moreover, for the functions u\ and A\ defined by (8.4) and (8.5) we have w-lim Ax(-)ux{-) = A(-)u{-) w-lim u\ = u
in L«(0, T; X*),
p
in
L (0,T;X),
A4-0
w*-lim ux = u
in L°°(0,T;H)
and
A|0
lim\ux(t)-u(t)\H
=0,
0
Proof. Since X is reflexive, also Lp(0,T + l;X) is reflexive, the dual space being Lq(0,T+l;X*). According to Lemma 8.3 we have |MA|LP(O,T+1;X) < Mo, 0 < A < Ao, which implies (see [Yo, p. 126]) that there exists a sequence A„ 4- 0 and a function u G Lp(0, T + 1; X) such that w-limtiAn=M n—j-oo
in L P ( 0 , T + 1 ; X ) .
294
Chapter 8. Variational Formulations
This is equivalent to (see [Yo, Theorem 3 on p. 121]) /•T+l (8.14) lim / (uXn{s)-u{s),
and Gelfand
Triples
=0
™-K» Jo
ior allcp e Lq(0,T+l;H). Note that L"(0,T+1; H) is dense in Lq{0,T+l;X*), because H is dense in X*. By Lemma 8.3 the sequence (u\n) is also bounded in L°°(0,T + l;H). Closed balls in L°°(0, T + l ; H) are w*-compact and by separability of H (which follows from separability of X) also w*-metrizable. Therefore there exists a function u G L°°(0,T + \\H) and a subsequence of (u\n) which we again denote by («A„) s u c h that w* - lim^^oo u\n = u, i.e., /•T+l
(8.15)
n
lim /
(uA B (jj)-fi(s),V(s))ffdfl = 0
-+°°Jo
for all V G L ^ O . T + l ; ^ ) . From L"(0,T+l;H) (8.15) we see that
C L ^ O . r + l ; ^ ) and (8.14),
i-T+l
/ Jo
(u(s)-u{s),(t>{s))Hds
=0
for all
in L°°(0, T + l ; F ) .
0 < A < Ao, shows that in addition we can assume
\U\(T)\H,
w-lim uxAT)
= u(T)
in H.
n—foo
Boundedness of A\(-)u\(-), 0 < A < A0, in Lq(0,T + l;X*) implies that there exists a function v G Lq(0,T + l;X*) and a subsequence of (u\n) which we again denote by (u\n) such that (8.16)
w-lim AXnuXn
=v
in Lq{0,T+
l;X*).
n—¥oo
Our next goal is to prove that u(t) = u0-
Jo
(v(s) - f(s)) ds
a.e. on [0, T].
From (8.3) we get ux(t) = wo - /
(Ax(s)u\(s)
- fx(s)) ds
(Ax(s)ux{s)
- /(«)) ds
Jo
(8.17)
ti
= u0-
Jo
8.1. Cauchy problems and Gelfand triples
295
for all t G [0,A./VA], where i — i(t) is chosen such that t G (**_!,**]• The estimate J
l
\A^\X.
ds < X^^J
l
\A$u*\qx, ds)1"
X1'J'\A),ux\Lq(fi,T+XiX.)
<
together with Lemma 8.3 shows that
lim /
\Afu*\x*ds = 0
uniformly for t G [0, T]. It is obvious that also lim^o Jt i f(s) ds = 0 uniformly for t E [0,T]. Therefore we have limA4.0 /„* J^'\AX(T)UX(T) - / ( r ) ) dr ds = 0 for a l l i e [0,T]. For arbitrary x G X and t G [0,T] we define
= lim /
{(j)(s),uXn(s))Hds
= (x, / u(s)ds)
.
Observing that also <$> G £ P ( 0 , T + 1;X) we get from (8.16) Jun^x, /
/ AXn{T)u\n(T)
dr ds} =/x,
/ v(r)drds\.
Thus we have shown (observe also (8.17)) that, for all x G X and t G [0,T], we have ( i , /" («(a) -uo+
f
- / ( r ) ) d r ) ds^ = 0.
(V(T)
Since X is reflexive, this implies J0(w(s) — all t G [0, T] and consequently (8.18)
u(t)=u0-
(v(s)-f{s))ds
UQ
+
J0{V(T)
— / ( r ) ) dr) ds = 0 for
a.e. on [0,T].
This shows that u G LP(0,T;X) n W 1 , 9 ( 0 , r ; X*) which by Lemma 8.5 proves that ue C{0,T;H). Given y G LP(Q,T;X) c L2(0,T;H) (observe that p > 2) we set y(i) = 0 for t > T and define for A sufficiently small Sx = 2 / ex(t)((ux(t)
- y(t),Ax(t)ux(t)
- Ax(t)y(t))
+ w\ux(t) - y(t)\%) dt,
296
Chapter 8. Variational Formulations
and Gelfand
where ex(t) = (1 - 2Aw) i_1 for t G {$_!,$], i = 1,...,NX, t > XNX and e>,(0) — 1. For later use we note that lime A (i) = e~2ut
(8.19)
HO
Triples
ex(t) = 0 for
uniformly on [0,T].
Since Ax(t) + tuJ is monotone a.e. (cf. Lemma 8.1, b)), we see that Sx > 0. Furthermore we define fXNx TX=2J
t ex(t)((ux(t),Ax(t)ux{t)
- fx(t))
\ + uj\ux(t)\2H) dt.
Using (8.7) we get ] T ( ( 1 - 2Xu>y\u$\% - (1 - 2 A U 0 * - V _ i & ) + TX i=i
= 5 ^ ( 1 - 2A W ) i ~ 1 ((1 - 2\u})\u*\2H - | u *_!& i=i
+ 2\(u},A}ui-f?)
+ 2)w\u$\2H)
= -53(l-2A W ) i - 1 |^-«til^<0, i=l
i.e., we have (8.20)
TA < K l i - (1 - 2 A w ) ^ | « A ( r ) | ^ .
From (8.18) we see that j t (e-2^\u(t)\2H)
+ 2e" 2 -*((u(t),v(t) ~ /(*)) + u>N*)&) = 0 a.e. on [0,T\.
Integrating from 0 to T implies e-2"T\u(T)\2H-\u0\2H
+2 f
e-2"t((u(t),v(t)-f(t))+u\u(t)\2H)dt
= 0.
Jo
Using this and (8.20) we obtain 0 < Sx = Sx - Tx + Tx < Sx - Tx + \u0\2H - (1 - 2Aw)^\u x (T)\ 2 H (8.21)
^Sx~Tx
e-2^{{u{tlv(t)-f{t))+uj\u{t)\2H)dt
+ 2[ Jo
+
e-2"T\u(T)\2H~(l~2\uj)N>\ux(T)\2H.
8.1. Cauchy problems and Gelfand triples
297
From the definition of S\ and Tx we see Sx-Tx
= 2J
ex(t) [(y(t), Ax(t)y(t) - 2uj{ux(t),y(t))H
- Ax{t)ux(t))
-
(ux(t),Ax(t)y(t))
+ w\y{t)\2H + (ux(t), / A (t)>) dt.
In order to prove that SXri — TXn has a limit as n —> oo we assume first that y(-) is a step function in Lp(0, T; X), i.e., there exist 0 = SQ < si < • • • < SN =T and yk e X such that y{t) =Vk for te (sfe_i,Sfe), k = Then the functions Ax(t)y(t)
= X'1 jj
A(s)ykds,
l,...,N. t e (i*_i,**] n ( s n , * )
are also step functions. Using (G2) we see that (8.22)
|AA(-M-)IL(O,T;X*) ^
M
*2*_1 /
(! + l»(*)lx) * -
0<
A
< An
From (G2) and (G4) we conclude that A{-)y{-) e Lq{0,T;X*). For t 6 (sfc_i,Sfc) we have t 6 (t$_1,tf] for some i e { 1 , . . . , ./Vx}. For A sufficiently small we can assume that (£*_!, t$] C (s,t-i, s*). Then we have
ft
i Ax(t)y{t)
= -J^
A{s)ykds = -^J
ft-1
ft
i/
A(s)y(s)ds-J
\ A(s)y(s)dsy
With this observation we can use the proof of Lemma 8.4 in order to show that (8.23)
lira \Ax(-)y(-) - A(-)l/(-)lw(o,r ; x-) = 0. A4-U
This, (8.22) and (8.19) imply (8.24)
lim/
ex(t)(y(t),Ax(t)y(t))dt=
•H° Jo
e-2ut(y(t),A{t)y(t))dt.
Jo
Using in addition that w-limn^oo uXn = u in Lp(0, T; X) we get also lim / n
^°°
5.25)
eXn(t)(uxJt),AXn(t)y{t))dt
Jo
j Jo Weak convergence of AXn(-)uXn(-) (8.26)
lim / n >
~ °° Jo
e-2^(u(t),A(t)y(t))dt.
to v(-) and (8.19) imply
eXn(t){y(t),AXn(t)uXn(t))dt=
/ Jo
2uJt
e-
{y{t),v(t))
dt.
298
Chapter 8. Variational Formulations
From y G Lp{0,T;X) mL°°(0,T;H)weget (8.27)
C L2(0,T;H)
lim / -*°°Jo
n
and Gelfand
Triples
C L 1 ( 0 , T ; # ) and w* - l i m ^ o o uXn = u
= / e - 2 ^<w(t), y(t)> dt. Jo
eXn(t)(uXn(t),y(t))dt
Lemma 8.4 and w-lmin^oo uXrl = u in Lp(0, T; X) imply (8.28)
lim /
n
^>°° Jo
exJt)(uxJt)JxJt))dt
= / Jo
2
e-
^(u{t),f(t))dt.
From (8.24) - (8.28) we conclude that J i r n J ^ - TXn) = 2 f e-2^((y(t),A(t)y(t)
- v(t)) - (u(t),
A(t)y(t))
«/0
- 2uj(u(t),y(t))H+u;\y(t)\2H
+
for all step function y G L p (0,T;X). This and (8.21) imply (8.29)
e- 2 - T (limsup| U A r v (r)| 2 H - \u(T)\2H) < 2(y - u, Ay - v) + 2w|y - u\2n
for all step function y G L p (0,T;X). Using Lemma 8.6, b), we see that (8.29) is true for all y G X. For y = u we get from (8.29)
iimsu P |« An (r)|^<|u(r)lH. This and w- limn-yoo uXn (T) = u(T) in i J prove (compare [Yo, Theorem 1 on p. 120 and Theorem 8 on p. 124]) (8.30)
lim | u A B ( T ) - u ( r ) | f f = 0,
i.e., (8.29) implies that (8.31)
(y-u,(A
+ u>J)y-(v
+ um))>0,
y£X.
By maximal monotonicity of A + wj we conclude that v = Au, i.e., we get from (8.18) (8.32)
u(t) = wo - / {A(s)u(s) - f(s)) ds Jo
a.e. on [0, T}.
8.1. Cauchy problems and Gelfand triples
299
Suppose that u £ X satisfies also (8.32). Then we get 0 = | e - 2 u t | « ( t ) ~ u(t)\l
~ 2 e - 2 ^ ( W ( t ) - u(t), | ( u ( i ) - «(*)))
2we-2wt\u(t)-u(t)\2H
+
= ^ e - M | « ( t ) - u{t)\2H + 2e~2"t({u{t)
- u{t), A{t)u{t) -
A{t)u{t))
+ u\u(t) - u(t)\2Hy Integration from 0 t o t gives
0 = e~2uJt\u{t) - u(t)\2H + 2 f e-2"s(u{s) > e-2ut\u(t)
- u(t)\2H,
- u(s), {A{s) + uJ)u{s) - (A(s) + wJ)u(a)\
ds
0
This proves u(t) = u(t), 0 < t < T. Thus we have shown that solutions to (8.32) are unique. This implies that u = w-lim\i0u\ in Lp(0,T;X) and u u = w* - lim,\4.o \ in L°°(0, T; H). Moreover we get also w- lim^o A\U\ = Au in L«(0, T; X*) and linuio \ux(T)-u(T)\H = 0. Here we have used the following fact: In a Banach space Z let the family (^A)O• 0 as n —» oo there exists a subsequence (A„fc) such that l i m ^ c o z\k = z resp. w- lirm;_+00 z\k = z (resp. w* -limfc-joo 2Afc = 2 in case Z is the dual space of some other Banach space), then we have lim^o z\ = z resp. w- lim^o z\ = z (resp. w* - lim^o z\ = z). Observing Remark 8.1 (see page 293) we get analogously as above (just by considering the interval [0, t] instead of [0, T\) that \xm\ux{t)-u(t)\H
= 0,
0
• 8.2. Remark. That equation (8.13) holds in X* is equivalent to the fact that for all x G X we have 0
It
M(0)
= Mo-
In view of this u is called a weak solution of problem (8.1). Weak solutions of (8.1) depend continuously on MQ and / :
300
Chapter 8. Variational Formulations
and Gelfand
Triples
8.8. Corollary. Let assumptions (Gl) - (G4) be satisfied. Then for any M > 0 there exists a c > 0 such that \ui(t) - u2(t)\H
< c(|u<0) - 4 ° V + l/i -
ML^CT;**))'
where Ui is the weak solution of (d/dt)v,i(t) + A(t)ui(t) i = 1,2, and \uf]\H<M
and \fi\mo,T;X-)
< M,
= ft(t), Ui(0) = u\ , i = 1,2.
Proof. From Lemma 8.3 and w-limAio^A = u in Lp(0,T;X) mate 4(T+l)w
(8.33) for
|«|iP(o,r ; x) < (
\UQ\H
< M and
° ^ *^T'
we get the esti-
i/p
(M 2 +
)
cpM^
< ^f- From
|/|L"(O,T:X*)
«i(t) = <40) - / (A(s)ui(s) - fi{s)) ds Jo we get jte-^\Ul{t)
- u2(t)\2H + 2 e - 2 w t ( ( « i ( t ) - U2(t),^(t) U l (t) - X(t)u 2 (*))
- <«i(t) - « 2 (t),/i(t) - /2(*)> + w|«i(*) - «2(*)|?r) = 0 , which implies e-^lmW-uml^lu^-u^H - 2 / e" 2 w s (ui(s) Jo
M 2 (S),
(A{s) + u)J)Ul(s) - (A(s) + uJ)u2(s))
ds
+ 2 /e-2^(Ml(S)-M2(S),/1(s)-/2(S))ds < | < ) - 4 0 ) | 2 f + 2 / |«i(s)-U2(s)|x|/i(*)-/2(«)|x.da Jo s I (°) S |«i
(0)|2 , ol - «2
Iff + ^ P l ~
I U
Ir
/
2|LP(0,T;X)I/1 ~ / 2 | L < ! ( 0 , T ; X * ) •
This together with (8.33) implies |«l(*) " «2(*)|if < c ( | < } " 4 0 ) | ? / + l/l ~ / 2 |L,(0,T;X.)) 1/2
^ c ^ - ^ V + l/i-M^o,^*)) where c > 0 is appropriately defined.
•
8.2. An approximation
result
301
8.2.
A n approximation result
For problem (8.1) we have the following approximation result. Let A(t), An{t) : X ->• X% t e [0,T], UO)Mo , n G H and / , / „ € L«(0,T;X*) be given. The weak solutions of (834)
jtu(t)
+ An(t)u(t)
= fn(t),
0
U(0) = W0,n
are denoted by un, n — 1,2,... . 8.9. Theorem. Assume that the operators A(t) and An{t), n = [0,T], satisfy (Gl) - (G4) uniformly with respect to n2 and (8.35)
lira \A(t)x - An(t)x\x*
=0,
xGX,
l,2,...,t€
t€ [0,T\.
If we have lim^oo |w0,n - "olff = 0 and lim„_>oo |/„ - f\hi(o,T;X*) = °, then lim \U - Un\C(0,T:H) = 0,
n—• oo
w-lim ura = u
in Lp(0,T;X)
and
n—^oo
w-lim —w„ = —w n—s-oo at
»I'(0,r;I*).
ere
Proof. It is clear that the sequences (|un,n|ff) and (|/n|z,9(o,T;X*)) a r e bounded. The estimate (8.33) with un instead of u shows that (|unUp(o,T;X)) is also bounded, \UTI\LP(O,T;X) < M,
n = l,2,....
Furthermore as in the proof of Corollary 8.8 we obtain jte-2"\u(t)
- un{t)\2H = -2e-2^({u{t)
- un{t), A(t)u(t) -
- (U(t) - ^(t),
An(t)un(t))
f{t) - fnit)) + W\uit) - «n(t)|ff).
2 This means that we can choose the constants u>, a and M in (Gl) - (G3) are independent of n.
302
Chapter 8. Variational Formulations
and Gelfand
Triples
Integrating from 0 to t we have e-2"-"|u(t) - Un(t)\2H = |uo - u0,n\2H - 2 / e-2u,s(u{s)
- un(s), (An(s) + LJJ)U(S) - {An(s) + cjj)un(s)^
- 2 / e'2ws(u{s) Jo
- un(s), A(s)u(s) - An{s)u(s))
+ 2 fe-2"s\u(s) Jo
- un(s)\x\f(s)
< I WO -
-
ds
ds
fn(s)\x*ds
u
0,n\2H + 2 | « - U n |l,i>(0,T;X) X ( l / - /nU«(0,T;X«) + \A(-)u(-)
- v4n(-)u(-) U'(0,T;X-)) •
Since the operators An(t) satisfy (G2) uniformly with respect to n, we see that (|A„(-)u(-)|iQ(o,T:J>f*)) is bounded. This together with the consistency condition (8.35) and Lebesgue's dominated convergence theorem proves lim \A(-)u(-) - An(-)u(-)\LH0,T;x*) v
n—>oo
Observing also \u - un\LP(0tT.X)
< 2M, n = 1,2,..., we finally get
lim \u(t) - un(t)\2H = 0
(8.36)
= 0. '
uniformly on [0, T].
In order to prove the weak convergence results we first observe that for appropriately chosen constants Mi, Mi > 0 we have (8.37)
\un\LP(0,T;X)
< Mx,
\AnUn\Lq(0,T;X')
< M2,
71=1,2,....
This follows from Lemma 8.3 applied to the DS-approximations of (8.34) for n = 1,2,... and the weak convergence of these DS-approximations to un in LP(0,T;X) resp. to Anun in Li(0,T;X*) (see Theorem 8.7). From (8.37) we conclude that there exists a subsequence of (un) which we again denote by (un) and a w G Lp(0, T; X) such that w- lim un = w
in LP(Q, T;X),
i.e., we have (8.38)
lim / (u(s)-w(s),4>(s))Hds
=0
for all <j) G Lq{Q,T;H). Note that Li(0,T;H) is dense in Li(0,T;X*). From (8.36) and (8.38) we conclude that w — u. Since this does not depend on the specific subsequence, we have shown w-lim un = u
in
Lp(0,T;X).
8.2. An approximation
result
303
Using (8.37) again we see that for a subsequence and a function v G Lq(0, T; X*) we have w- lim Anun
= v
in Lq(0,
T;X*).
n—>oo
A proof analogous to that for (8.18) (using un{t) — u0,n - j0(An(s)un(s) fn(s))ds instead of (8.17)) shows that
—
u(t) = u0-
(v(s) - f(s)) ds a.e. on [0, T\. Jo The proof for v = Au is analogous to that for Theorem 8.7. We therefore give only the main steps. First we define, for y £ Lp(0,T;X), Sn = 2(un - y, (An + ujj)un = 2J
- (An +
uj)y)
e-2u}t ({unify - y(t),An(t)un(t)
-
An(t)y(t))
+ w\un(t) - y(t)\2u) dt > 0, Tn = 2{un, (An + tuj)un
- /„)
e~20Jt({un(t),An(t)un(t)
+ Lj\un(t)\2H^j
- fn(t))
dt
\uo,n\2H-e-2"T\Un(T)\2H.
=
With these definitions we get 0 < >-)n = Ora — Tn + ln + \uo,n\2H ~ Wo\l + e~2"T(\u(T)\2H
= Sn~Tn
+ 2 fTe-2^{(u(t),v(t) Jo = 2(un - y, (An + U)J)un 2
\un(T)\2H)
-
- f{t)) + uj\u(t)\2H) dt - (An + Uj)y) 2 T
2
+ M H ~ \Ml + e- " (\u(T)\ + 2(u,v + ujuf).
- 2(Un, (An + uj)un
- /„)
2
H
- \un(T)\ H)
This implies, taking n ->• oo possibly for a subsequence and using also the consistency condition (8.35) 0 < ( y - u , ( ^ + «l7)»-t;)l
yeX.
Since A + UJJ is maximal monotone, we have v = Au, i.e., v(t) = A(t)u(t)
a.e. on [0, T\.
This is true for any subsequence. Therefore we have w-lim Anun
= Au
mLq(0,T;X*).
D
This page is intentionally left blank
CHAPTER 9
Applications to Concrete Systems In this chapter we discuss applications of the theory presented in Chapter 6 to three concrete cases: delay equations, scalar conservation laws and NavierStokes equations.
9.1.
Delay-differential equations
Formulations of delay equations in R n as abstract evolution problems in some function space have been used frequently during the development of various parts of the theory for these equations. In particular this is true for autonomous linear delay equations where the theory of linear C0-semigroups played an important role (see for instance [Ha] or [Ha-Lu] and the literature quoted there). The state spaces which have been frequently used for equations with bounded delays are C(—r, 0; R n ) (for instance already by N. N. Krasovskij, see [Kra, Chapter 6]) or R n x L2(-r, 0; Rn) (originally in [Bo-Tu] for equations of retarded type, see also [De-Mi], and in [Bu-Her-St] for equations of neutral type). The latter space provides the natural setting for the linear-quadratic regulator problem (see [K-S]) and approximation results (on the basis of the Trotter-Kato theorem; see for instance [I-Kl]). Applications of the theory of nonlinear semigroups or evolution problems to nonlinear delay equations were hampered by the fact that the assumptions of the generation theorems for nonlinear contraction semigroups resulted in too stringent assumptions on the right-hand side of the nonlinear delay equation. The dissipativity assumption on the operator governing the abstract Cauchy problem requires to assume a global Lipschitz condition on the right-hand side of the delay equation. In this section we show that this difficulty can be overcome by using the theory presented in Chapter 6, where we use W1 x C(—r, 0;R n ) for the basic setting. The use of this product space was already announced in [I-K3]. The product spaces W1 x Lp{—r, 0;R n ) are not appropriate for nonlinear delay equations, because solutions may only exist for a very restricted subset of initial data. Besides delay equations of retarded type we consider also equations with state dependent delays (see also Section 11.2 for a different approach) and equations 305
306
Chapter 9. Applications
to Concrete
Systems
of neutral type, because of their increasing importance as models for concrete dynamical systems. 9.1.1. Equations of retarded type in the state space C. Let r > 0, rj G R™ and > G C(—r, 0; R") be given. For a continuous function x : [—r, oo) —> W1 we denote by xt the function in C(—r, 0;R n ) defined by xt{0) = z(i + 0),
t > 0, - r < 0 < 0.
We consider in this section initial value problems for delay-differential equations of the form (9.1)
| * W = f ( ' . * 0 . <>°> i(0) =»/, x{6) =
The right-hand side F is a mapping Rjj~ X C ( - r , 0; Rra) ->• R™ which satisfies the following conditions: (RD1) The function F is continuous on Rjj~ x C(—r, 0;R") and /or any T > 0 and a > 0 i/iere exists a non-negative constant uia%T such that \F(t, fa) - F(t, >2)|Rn < wa.rl^x -
fa\c
n
for allt>0
and all fa 6 C ( - r , 0 ; M ) urc'tfi |>i|c
= l,2.
Without restriction of generality we can assume that a —>• wQ,T is continuous on N) • Given 7 > 0 we set M(t)7) -
SUP{|F(*,V)|R»
I V> e C ( - r , 0 ; R n ) , H e < 7 } ,
* > 0,
and impose the condition: (RD2) For any T > 0 i/iere exist non-negative constants a,T,br such that M(t, 7) < a T 7 +
&T,
t G [0, T], 7 > 0.
With respect to the dependence of F on t we assume: (RD3) There exist normed spaces X( and, for all a > 0, continuous functions faj : RQ ->• Xt, I = 1 , . . . , m, and, for all T > 0, an increasing function Lax '• RQ~ —• RQ~ such that m
{F^fa-Fih,^ forti,t2
< (j2\f*Ah)
G [0,T] and $ £ C{-r,Q;Rn)
~
UAt2)\xe)La,T(\4>\c)
wtft | 0 | C < a.
9.1. Delay-differential
equations
307
Assumption (RD1) implies that a local version of (RD2) holds. Indeed, for any 7 > 0 we get from (RD1) the estimate (9.2)
\F(t, >)|Rn < \F(t, 0)|R» + UJ^T\4>\C < UI,T\\C + &T
for t G [0,T], <j> G C ( - r , 0;R n ) with \<j>\c < 7, where we have set bT = maxo
domA(t) = {(tj,0) eX\*e A(t)(
tj =
(
We see that dom A(t) is not dependent on t. The set D resp. the functional ip is denned by L > = { ( r ? , 0 ) G X | r ? = 0(O)} resp. by
= l{r] (t>)U
'
' tffa.*)eA
] 00,
if
(JJ,
0) £ £>.
Note that D = dom A(t), t > 0, in this case. For a proof that
u0 = (I -
XA(t))ux.
Moreover, Xo(uo,T) can be chosen such that, for any T > 0, the mapping UQ —> Xo(uo,T) is continuous. b) Let u\ — (n\,4>\) G domA(i) satisfy equation (9.3). Then we have 11 1 , 1 j=\vxW" \u\\x = \
« / M R » > \u0\x, ., 1 | . . tfmlllL" < \Uo\x-
Proof, a) Equation (9.3) is equivalent to (9.4)
nx=rjo + XF{t,(Px)
and 4>'\ = j ^ x - j4>o-
308
Chapter 9. Applications to Concrete Systems
From the last equation we get (note that (j>\(0) — rjx)
-r<9<0,
1
where <j>x(0) = A" J ^ - ^ / V o t O d£, -r<9<0. by
With $ : W1 ->• R" defined
${r1) = r1o + \F(t,e/xr)-4>x),
^R",
equation (9.4) is equivalent to the fixed point equation $(77) = 77. For 7 = \4>o\c + 1 we set £ 7 = {77 € K™ | |T7|H" < 7}. For 77 e £ 7 we get from the definition of 0^ the estimate \ee'xV - 4>x(9)\mn < e9/A|»/|R» + (1 - e 9 / A )|0o|c =: W ) ,
- r < 0 < 0.
_1 e A
From A'(0) = A e / (|77|Rn - \
1 M
<0,
if MR» < Itolc,
so that [h(-r),
if |77|Rn < \<po\c-
From ft(0) = |??|M« and /i(-r) = e"r/A(|77|Kn - \fo\c) + \fo\c < \
in
case
|e'/A77 - 4>x\c < max(|77|Hn, \<j>0\c) < max(7, |^>o|c) = 7.
This implies (using (9.2)), for t e [0,T], |$(??)|R"
< |*7oIR» + A(w7;T|e'/A77 - 4>x\c + bT) < I
From this estimate we see that
|^(T7)|R«
< 7 provided
A< 7W 7 ,T + br
The estimate - 4>x) - F(t,e/Xf)
|d>(77) - $(r))\Rn < X\F(t,e'/\
< Aw7iT|77-77|Mn,
- 4>x)\&n
77,r?GS 7 , t e [0,T],
shows that, for any t e [0, T] and A £ (0, A0], the mapping $ is a contraction on E 7 , where A0 = m i n ( -
,
=-Y
9.1. Delay-differential
equations
309
The unique fixed point 77^ defines the element u\ G dom A(t) which satisfies (9.3). It is also clear that the mapping UQ -» Ao is continuous (note that 7 = \uo\x + 1)b) Statement b) follows immediately from (9.5) for 77 = 77^.
•
9.2. Theorem. Assume that (RD1) - (RD3) are satisfied for F. Then assumptions (El) with a+ = 00, (E3) and (R2) hold for the operators A(t), t>0. Proof. We first prove that the operators A(t), t > 0, satisfy (El). In order to simplify the presentation we assume without restriction of generality that we have m = 1 in assumption (RD3). Let Xi — (>i(O),0») G domA(ti) with \
AWQ,T)MC
< M0)k-
= l^(°)k" -
~ Al^ti.^i) -
^Ja,T\i>\c
F(tu
< |^(0) - A^C*!,^) -i^C*!,^))^ < |^(0) - A(F(t!, ^ ) - i^(t 2) 0a)) | Hn + A|F(i 1 , 2 )| R „ < \xi - x 2 - A(A(ti)xi - A(t2)x2) +
A|/a(*l)-/a(*2)U1£a,T(|02|c).
This proves (El) in this case. Note that LatT(\(fo\c) Case 2: \1p\c = IV'C^o)!^™ for some #o G [-r,0). We choose a x in the duality set of ipifio) and get In -x2\x
= ml
\x
= IVKMH- = woo),
= Re(V(^o) - W{00),X)
=
LatT{\x2\x)-
x)
+ ARe^'(6> 0 ),x>-
n
The function # —>• |V'(^)|K is differentiable and we have <^o),V'(flo)> + = ^ W - ) l l 9 = e o < 0 , where we have also used Proposition 1.4, a). Observing (see Lemma 1.3, c)) ReW(0o),X> < W(0o)M0o)). we get from (9.7) \xi - x2\x
= ^'(So), W O ) )
< |V(flo) - AV>'(0O)|R» ^ 1^ -
+ IV(»O)|K»
A
^'lc
< |a;i - £ 2 - A(A(t 1 )x 1 - .Afo)^) | ,
< 0
310
Chapter 9. Applications
to Concrete
Systems
which proves (El) also in this case. Since dom^4(i) does not depend on t, it is obvious that assumption (E3) is satisfied. We next prove that (R2) holds. From Lemma 9.1, a), we see that we only have to prove j(
0
with constants a, b, b being non-negative. Assume first that |T?A|R" > \uo\xFrom Lemma 9.1, b), we get \u\\x = |T?A|R", which together with (RD2) and (9.4) implies j(
-^(I»7.\|R»
-
|%|R»)
< TI»?A - % | H " < \F(t,4>\)hn
<M(t,\(j)x\c)
t£[0,T\.
In case IT/AIK" < l^olx we see from Lemma 9.1, b), that \u\\x < quently we have -r(
\UQ\X-
Conse-
- \u0\x) < 0.
D From Theorem 6.17, a) and d), we see that EP(A(-), s, XQ) for any xo = ((f)(0),4>) G D and s > 0 has a unique mild solution U(-;S,XQ) on [s,oo). For XQ € D and t > 0 the mapping s —> u(t; s, xo) is continuous on [0, i\. Moreover, U(t,s)xQ = u(t;s,xo), 0 < s < t, XQ £ D, defines an evolution operator U(t, s):D^D (see Theorem 6.22). For any T > 0 and (3 > 0 we have \U(t,s)x-U(t,s)x\x
< e^T(t-s)\x-x\x,
0<s
x,x e D0,
where a = ip(T,/3). For any xo € D we have u(t;s,x0) g Di/j(t~s,\x0\x)> 0 — s < t < T, where ip(X,(3) = eaTX(3 + (bT/aT)(eaTX - 1), A > 0. The following example illustrates the fact that the global linear bound (RD2) is not necessary in order to apply the theory presented in Chapter 6 to problems of the form (9.1). Assumption (RD2) was only used in order to establish the range condition (R2) for the operators A(t). In concrete cases this can also be done by exploiting the special form of the function F without using (RD2). Consider equation (9.1) with ,o (9.8) F(t, <j)) = -ao
9.1. Delay-differential
equations
311
(i) t -» a(t, •), t > 0, defines a continuous mapping R j - • i 1 (—1,0; R). (ii) 6 is a continuous function RQ~ —>• R. (hi) We have /
\a{t,0)\dd + \b(t)\
t>0.
It is easy to see that (i) and (ii) imply that F(t,
a > 0, T > 0. ~ ~~
It is also clear that (RD2) is not satisfied for this example. The estimate \F(tu4>) ~ F{t2,4)\ < J_ \a(h,ff) - a(t2,0)\ \
-\A(t))ux.
The mapping w0 —• Ao(wo> T) is continuous. It remains to estimate A - 1 {
+ XF(t,
= m~ Ao0r/i + A J
a(t, 9)
< \uo\x - XaoVl + XVl J
\a(t, 6)\d6 + \b(t)\ rfl
< \UQ\X - \a0r)l + \a0r)x = K | x , which implies \ux\x < |wo|x- In case T]X < 0 we get analogously 0 > rjx > — l u o|x and consequently also \ux\x = —W\ < |"o|x- Thus we have proved
312
Chapter 9. Applications
to Concrete
Systems
that assumption (R2) is satisfied for this example with a = b = 0. In particular we can conclude that the mild solutions of the problem E P ( J 4 ( - ) , S, XQ) corresponding to this example satisfy \u(t;s,x0)\x
< \x0\x,
t>s.
Liapunov functionals can also be used in order to obtain bounds for solutions. We illustrate this on a special case of the right-hand side (9.8). Assume that a(t, 9) = 0 and let
v(
4> e D.
Note that V is a Liapunov functional for the equation (see [Ha, p. 117f]) x(t) = -a0x3{t)
(9.9)
+ b(t)x3(t - 1).
The operators A(t), t > 0, corresponding to this equation satisfy assumptions (El) with a+ = oo, (E3) and (R2) with the functional
VKA,/3)=/3, i.e., we have a — b = 0. For UQ = (<j)o(0),<j>o) £ D and T > 0 let Ao and u\ be given according to Lemma 9.1,a). Using the fact that for a convex and differentiable function h : R -> R we have h(r) < h(r0) + (r - T 0 ) / I ' ( T ) , r, r 0 G R, we get
v{4>x) - v{
GM0)5{MO) - <M#)) M.
Equation (9.3) implies for this specific example
- 0o(O) = A(-a o 0A(O) 3 + 6(t)<£ A (-l) 3 ),
MO) ~ MO) = WW),
-1<«<0,
so that V(M
- V(
<^A(-1)6) •
Since assumption (iii) implies \b(t)\ < ao, we get
v(M < v(
t>s,
x0G D,
9.1. Delay-differential
equations
313
for any mild solution of the evolution problem associated with equation (9.9). 9.1.2. (9.10)
State dependent delays. For fixed ro > 0 let F(t, >) = f(t, 4>(0),
where the functions / : R j x R n x R n -> R n and r : R^ x C(-r0,0; satisfy the following conditions:
R n ) -> (0, r 0 ]
(SD1) / is continuous and for all T > 0, a > 0 there exists a constant 7a,T > 0 such that \f(t,yi,zi)
- f(t,y2,z2)\Ur,
< 7Q,T(|J/I — J/2k" + \zi - z2\w)
for all t € [0,T] and y;,Zi 6 R™ wii/i |yi|m», I^IR™ < a, i = 1,2. (SD2) r is continuous and for all T > 0, a > 0 there exists a constant pa,T > 0 such that \r(t,fa) -r(t,(j)2)\ for allte
< P<X,T\4>I -
[0,T] and fa e C(~r0,0;R")
with \fa\c < a, i = 1,2.
(SD3) For any a > 0 there exist normed spaces Xt, continuous functions fa,e,9a,e '• R j —> Xe, £ = l,...,m, and, for each T > 0, increasing functions Lf%a^T, Lrta^x '• ^o~ ~~* ^o" suc^ that \f(h,x,y)
-
f{t2,x,y)\Rn m
- ( 5 1 l/<*.*(*i) " /«^(*2)|j5sr,J^/,a,T(max(|x|Kn, |y| H «)) f=i
/or ai/ ii,*2 > 0 and i , t / e l " wii/i
|:E|M«,
|j/|K„ < a and
m
|r(*i,^)-r(* 2) 0)|< (X) Itfa^^i) for alltut2
> 0 and(j>£ C(-r0,0;Rn)
ga,e(t2)\x^jLrtatT(\4>\c) wrt/i |<£|c < a.
(SD4) For all T > 0 there exists a constant ar > 0 swcft iftai | / ( * , Z , 2 / ) | K "
for all t £ [0, T] and i . j e l " . Note that assumption (SD4) implies that f(t,0,0) = 0, £ > 0, i.e., a;(i) = 0 is an equilibrium for the delay equation (9.1) with right-hand side (9.10) satisfying assumption (SD4). Without restriction of generality we can assume
314
Chapter 9. Applications to Concrete Systems
that in condition (SDl) resp. (SD2) the mapping a —> continuous.
7QIT
resp. a —> paj< is
As for equations of the form (9.1) we see that a condition analogous to (RD1) is satisfied also in case of right-hand sides as given by (9.10). Moreover, a lemma similar to Lemma 9.1 holds: 9.3. Lemma. Assume that conditions (SDl) and (SD2) are satisfied for f resp. r. Then for any a > 0 and any T > 0 there exist constants catT > 0 and da,T > 0 suc-h that |F(i,^1)-F(i,^2)|Kn <(cQ,r + d a , T ! # U ~ ) l ^ i - & l c for allte [0,T] and <j>x G W1'°°(-ro,0;Rn), 0 2 G C ( - r o , 0 ; R n ) with \(j>i\c < ct, \fa\c < OL. Moreover, the mappings a —> catx and a. —>• da:r o,re continuous. Proof. Let t G [0,T] and 0 : G W 1 ' o o ( - r 0 , 0 ; R n ) , 0 2 6 C(-r o ,0;]R n ) with | 0 i | c J 0 2 | c < a be given. Using assumptions (SDl) and (SD2) we get the estimate \F(t,cPi)-~F(t,4>2)\mn = |/(t,^i(O),0i(-r(t)^1)))-/(t)^(O),(fe(-r(*,02)))|Rn < 7a,r(|0i(O) - <£2(0)|Rn + | 0 i ( - r ( * , ^ i ) ) - 0 2 (-r(i,^. 2 ))| K „) < 7a,r(2|0i - 0 2 |c + | 0 i ( - r ( * , 0 i ) ) - 0i(-r-(*,0 2 ))| R n ) which proves the result with
C QJ T
—
27QIT
and d Qj r = Ja,Tpa,Tn
D re
As in Section 9.1.1 we choose the state space X = R x C(-To, 0; E ) with norm |(?7,0)|x = max(|rj|Rr., |0|c) and define the operators A(t), t > 0, by domA(t) = {(r/,0) G X \ 0 G C ^ - r o ^ R " ) , n = 0(0)}, .4(i)(0(O),0) = {F{t,4>),4>'), (0(0), 0) G dom^(t). However, in the present case the set D and the functional ip are defined by D = {(0(0), 0) G X | 0 G ^ - " ( - r o . O ; ^ ) } , =
fmax(|0|c,|0'|L»),
I oo,
if (r/,0) - (0(0), 0) G A
\f(ri,
The constant 9 > 0 has to be chosen appropriately in dependence on the righthand side (9.10). In order to prove lower semi-continuity of
9.1. Delay-differential
equations
315
and
n = n0,n0 + 1 , . . . .
This together with |>„->o|c -» 0 implies ^ 0 G W 1 ' o o ( - r 0 , 0 ; R r i ) . Moreover we have ql^oli 00 — a a n d % =
<^(%,0o)Note that dom A(t) C D C d o m i 4 ( t ) = {(0(O),0) G X | 0 E C(-ro,0;R™)}. 9.4. Lemma. Assume i/iai conditions (SDl) and (SD2) are satisfied. Then for any T > 0, 0 > 0 and u0 = (T/O, >O) G .D^ £/iere exisis a A0 = A/3]y(u0) > 0 SMC/J i/iai, for any X G (0, Ao] and any t € [0, T], there exists a u\ = (T?A,
XA{t))ux.
The function A/^TO) con be chosen to be continuous on Dp. Proof. Let j3 > 0, T > 0, t G [0,7] and tt0 = (?/o,/3 be given. By definition of the operators A(t), the equation UQ = (I — AA(£))«A with u\ = {rj\,4>\) E dom A(t) is equivalent to (9.11)
T/A=»to + A F ( i , e - / V - 0 A ) , -1
e
where ^ A = A / 0 V -^/ A
4>x\c < 7.
Assuming that |jjfe_i|Rn < 7 (which is true for k = 1) we get, using also Lemma 9.3, |%|K" < |i?ol»" +A|F(t,e' / A 77fc_i-^ A )| K n < |>o|c + A( o max T | J F(i,0)| K n + | J F ( i , 0 ) - - F ( i , e - / A % - i - £ A ) | B » ) < |0o|c + A(6T + c7,T|e'/Ar/fc-i - 4>\\c) < |
where br = max 0
This estimate proves |7/fc|]R» < 7, A; =
°T +
c
~t,Tl
Chapter 9. Applications
316
to Concrete
Systems
In order to prove that the sequence (rjk) converges we first observe that (note that 7/0 =
7 =,(9-0/*, >o(M 'e°'\ k - $x(0)) = V V - {MS) ~ ~ J dd A
\*B'\ilk-rK)-\f^9-*),xm)dti =
/KA ev^F{t,ef rik-i-
I [
Aio
^-«/ A > 0 (Ode.
-TO < # < 0, which gives the estimate •A,
K
'\Mn
d6> ,+ ( l - e ^ ) | < A 0 | L o (9.12)
< max(|F(t, e ' V -
^A)|R»,
|#,U~)
< m a x ( 6 T + 7 C 7 , T , |<^ 0 |i°°)
< max(6 T + 7c 7 , T , P/q) =• 7oThus we have \Vk+i -rjkk"
= A|F(t,e 7 rjk-<j>x) - F{t,e'
%_I-0A)|R„
< A ( c 7 i T + rf7iT7o)|»7fc -T/fc_i|Rn < — |r/A; - ? ? f c - l k "
for A; = 1,2,..., and A < Ao := min ( ,— ). ^ 6 T + 7 c 7 , r 2 ( c 7,r + a 7 ,T7o)^ This proves that r}\ — limfc^oo n^ exists. It is clear that 70 and therefore also Ao depends continuously on UQ G Dp. • 9.5. Theorem. Assume that conditions (SDl) - (SD4) hold for f, r and, for any Tmax > 0, set q = l/ax max - Then assumptions (El) with a+ = 00, (E3) and (R2) are satisfied for the operators A(t), 0 < t < T m a x , for any T m a x > 0. Proof. The proof for this theorem is analogous to that for Theorem 9.2. In order to simplify notation we take m = 1 in assumption (iii). We choose ^max > 0 and fix T £ (0,T m a x ). With the notation introduced in the proof for Theorem 9.2 we consider two cases: C a s e l : |V>|c =
|V>(0)|K-
9.1. Delay-differential
equations
317
Using Lemma 9.3 we get with ujaj = ca>T + OLq~1datT the estimate (note that (j>i G Da implies |0;|L°° < a/q, i = 1,2)
(1 - Aw a ,r)|zi - x 2 |x = (1 - XujatT)\il>\c = iV'Wk" - A(c a , T + a« _1 da,T)|V'lc ^IV'WlKn-AlF^!,^)-^!,^)!^ < |xi - x 2 - A(J4(ii)a;1 +
A(t2)x2)\x
\\F(t1,>2)-F(t2,>2)\Un
for *!, t2 > 0. Assumption (SD3) implies
|F(i1)(fe)-.F(i2,
+ 7a,T|02(-r(ii,0 2 )) - 0 2 ( - r ( i 2 , 0 2 ) ) | R n < |/a,l(
With
L0}T(T)
—ir,a,T(|02|c)-
= max(l// iQ , j T(r),Q;7 Q , i r9~ 1 ir,a,r(' r )) we finally get
(1 - Ao/Q,r)|£i - x2\x < |xi - x 2 - A(J4(ii)a;i - ^(i 2 )a; 2 )| x + A ( | / Q , i ( i l ) - / a , l ( t 2 ) | X i + |3a,l(*l) -
9a,l{t2)\x1)La,T(\x2\x),
which proves (El) in this case. Case 2: \ip\c = |V>(0o)kn for some 60 G [-r 0 ,0). The proof that (El) holds also in this case is completely analogous to the corresponding part of the proof for Theorem 9.2. Assumption (E3) holds, because dom A(t) does not depend on t. In order to prove that (R2) is also true we choose /3 > 0, T £ (0,T m a x ), u$ G Dp and t G [0, T]. In view of Lemma 9.4 we only have to estimate \~1(ip(v,\) —
318
Chapter 9. Applications
to Concrete
Systems
on D0. From (9.4) and (9.12) we get , , , , | f= Mm" \u\\x = \9\\c < . , . [<
^ M R « > l^olc .,,. ^ ,, ,
|0o|c
if |»7A|R" <
f = | F ( t , ^ ) |
1
\<
R
n
m\c
i f | F ( * , ^ ) |
R
n > | ^ |
if \F{tAx)W~ <
WO\L°°
L
o c ,
M I L -
We have to distinguish four cases: Case 1: \
I^'AU" 3
<
WO\L™-
(f(ux) = max(\<j>x\c,q\x\L°°) < max(|(/>o|c,g|<#>U~) =
=
|»7A|R"
<
hoU" < 7 7 7
T--JT i max
l^olc -i max
and (note that qi>d|L°° < (/3(uo)) (P(UA) < m a x ( y —
|0o|c,g|0'oU°°) = T - J T * max
Case 3: |!>A|C < |>o|c, We have
|<£AU°°
|
¥>C"o). J max
= |-F(t, 0A)|M«-
< aTmaJ<^A|c < aTmax|!>o|c,
which implies oIc,x\c = |??A|R", As in Case 2 we have
I^'AU 00
I^Alc =
=
= (p{u0)-
I^(*.0A)IR"-
I^AIH"
< T--7T
|
and analogously as in Case 3 (IT
| # J L ~ < aTmax!r?A|K- < x , ^ "
I0oIc
•* m a x
which gives „(«*) < | < A 0 | c m a x ( T - 1 i — > -* max
r
^ - ) -1 max
< T T ^ - ^ o ) . -* max
9.1. Delay-differential
equations
319
We conclude from Cases 1 - 4 that j(
•
9.1.3. Equations of neutral type. In this section we consider delay equations of neutral type, (9.13)
!^=*U*«), *>0, n x(0) = x0£ R , x(9) = (£(), - r < 6 < 0, r > 0 .
With a(-) G L°°(-r, 0 ; R " x n ) and a_ a G Rnxn C(-r, 0; R") ->• R n is given by
the difference operator £> :
D
^C(-r,0;RB).
J—r
The assumptions on the right-hand side F : R j x C(-r,0;R") following:
-> R™ are the
(NDl) For any a > 0 and T > 0 i/iere exists a constant uJa,T > 0 swc/i
< wQ,T(|>i(0) - 02(O)|Hn + \M~r)
-
for all te [0,T] and fc G C ( - r , 0;R n ) witfi |<^| c < a, i = 1,2. (ND2) There exist normed spaces Xg and, for all a > 0, continuous functions faie : RQ -4 X^, £ = 1 , . . . , m, and, /or a/Z T > 0, an increasing function La,T '• K-o ~* ^o such that m | F ( t l ^ ) - F ( t 2 , 0 ) | R „ < (X)l/a.«(*l)-/a,/(*2)|x<)£a,T(|0|c) *=1
fortut2
€ [0,T] andfie
C(-l,0;Rn)
with \<j>\c < a.
(ND3) For all T > 0 i/iere ezisi non-negative constants ar and by such that |-F(i,0)|iR" < bT + aT\
Chapter 9. Applications
320
to Concrete
Systems
for<j)£ C(-r, 0;R") and t G [0,T]. We shall consider the state space X = W1 x C(—r,Q;M.n) for equation (9.13). The norm on X is given by \(T),)\X
=max(|7 ? | K n,2- 1 |(Al7).
(i),fleX,
where, for 7 > 0, |0|7=
max
e-^|^)|r.
—r<#<0
The operators .A(£), i > 0, are defined by domA(t) = {(rt,
(D>, >) G dom A(i).
Note that dom A(t) does not depend on t. The set D and the lower semicontinuous functional tp are defined by D = {(77,0) G X I <£ G C ( - r , 0 ; R n ) , r, = ^ } , 1 00
otherwise.
We have dom A{t) C £> = Z> = domA(i) C X,
£ > 0.
Closedness of D and continuity of y> on £) imply lower semi-continuity of ip on X. Analogously to Lemmas 9.1 and 9.4 we have: 9.6. Lemma. Assume that condition (NDl) is satisfied for F. Then for any T > 0 and j3 > 0 there exists a Ao = \0(/3,T) > 0 suc/i i/ioi, for any u0 = (D4>0:
\A(t))ux.
Proof. By definition of the operators A(t) we see that we have to prove that (j>\ satisfies the following equation: (9.14)
D
\F(t,M,
where <j>\{9) = 4>\(0)e8/x — <j>\{9), -r < 9 < 0, and <j>\ is defined as in the proof of Lemma 9.1. The definition of D implies that f° Dcf>x = A(A)M0) - / J—r
a(9)4>x(0)d0-a-14>x(-r),
9.1. Delay-differential
equations
321
where ,o A(A) = / + /
e e/A a(0) d0 + a _ i e - r / \
J —r
so that (9.14) is equivalent to the fixed point equation ^A(O) = 3>(>A(0)) where $(r?) = A(A)- 1 (£>^ 0 + /
a(9)j>x(6)d9 -r + a _ ^ A ( - r ) + \F{t,e'xr,
v
(9.15)
J
for 77 £ Rn. The estimate ,o / ee/xa(6)de + a-1e'r/x
- <^))
< A|a(-)|i~ + | a _ i | e - r / A < A(|a(-)| i ~ + | a _ 1 | — ) ,
A>0,
shows that, for 0 < A < 1/po with p 0 = |a(-)|z,=° + | a _ i | ( e r ) - 1 , we have (9.16)
|A(A)|-' <
^
.
Let a constant c > 0 be given. Using assumption (NDl) we obtain for any function cj> G C(-r, 0;Mra) with |>|c < c the estimate |F(<,^)| K „ < 6Tmax + W C , T ( | ^ ( 0 ) | R » + |^(-r)| R » + j _ \
|$(»j)|R» <
1
A
max
0
o
(\Dfo\u~ + a0\<j)0\c + A(6r m „ + (2 + r)aD c , r )),
provided |e'/AT7 — 4>\\c < c, where we have set ao = max(l, |a_i| + r|a(-)|x,~). Observing |0o|c < 2ip(uo) we get + Qol^olc < (1 + 2a0)
|D^O|K»
«o e £>/3-
n
We set c = (1 + 2a 0 )/3 + 1 and E c = {77 G R | |j?|Hr. < c}. Then M0 G L^ implies \<j>o\c < 2/3 < 2ao/3 < c, so that, for 77 G S c , we have (see (9.6)) \e/xr] -4>A\C
< max(|77|Rn, \<j>0)c) < c,
A > 0.
Thus we get from (9.17) for r\ G S c and uo G Dp the estimate I*(»?)|K«
< JZJ^
^
+ 2 Q o ) / 3 + A( T
^ —
+ (2 + r)c(Z,c T
' )) -
c
Chapter 9. Applications
322
to Concrete
Systems
for 0< A < ^ . &Tmax + (2 + r)cu>CtT + p0c
Assumption (NDl) implies, for 77,77 e E c ,
|*fa) " *W)| K » < i T T ^ ^ r C 2 + r)\v ~ »?|R», which shows that $ is a contraction on E c for A < Ao and t G [0, T], where
Ao = min I ,— — ). Vt T miX + (2 + r)cwCtT + cp0 2wCjT(2 + r) + p0J The unique fixed point 77^ defines the element u\ £ dom. A(t) by u\ = (?7A,
9.7. Theorem. Assume that conditions (NDl) - (ND3) are satisfied for F. Then assumptions (El) with a+ = oo; (E3) and (R2) hold for the operators A(t), 0
2\Dip\^.
In this case we have \x\ -x2\x
{Fitufa)
=
I-D^IR**-
From assumption (NDl) we conclude
- F(ti,
W2/3,TV7)M7
< 2uj20,Tho(l)\Dxp\Mn,
9.1. Delay-differential
equations
323
where we have set /io(7) = 1 + e get
7r
+ J_re'iedd.
Using the last inequality we
(1 - 2\CJ2piTho{'y))\xi ~ x2\x = (l - 2Aa)2/3,T/io(7))l-D'i/'k" < l-DV'k" -
AW2/3,T/IO(7)H7
< 1-0(^1 - h) - X{F{h,
Fitufa))^
< \D(
Case 2: |^| 7 > 2|£ty| R ». We choose 7 > 0 such that
a) We first assume that IVKO^R" \a^\e~^
+J
\a{e)\e*dO<±.
From IV»(O)|R«
r7 Dtp — a_!e-rif,ri e V>(-r) - /
a(6>)e7V7V(<9) dfl
«/—r
< W k - + -IVI7 = l-DW + 2^(0)1^ we get the estimate (9.18)
|V(0)|H» <2|Zty| R ».
This implies 1, (1 - 2Xu>20,Tho('r))\xi - x2\x < (1 - 2Aw2^,T^o(7))2lV'l7 in - AW 2 /3,T/IO(7)|V'I"
<|I>V'|R--A|F(t1,0i)-F(ti)02)|H« From this inequality the proof proceeds as in Case 1.
324
Chapter 9. Applications
to Concrete
Systems
b) We assume that \ip\7 = \ip{90)\u^e"y9° for some 90 e [—r, 0) and choose \ in the duality set of e~'yeoip(6o). Then we get \x1-x2)x (9.19)
= \ \ ^ =
\^(90)e~^,x)
= ^Re(i;(90)e-^
- X(^(00)
-
7i;(90))e-^,x)
2M(^'(eo)-l^(9o))e-^0,x)-
+
The function 9 -t e~'ye\tp(9)\^n is differentiable with (see Proposition 1.4, a))
According to Lemma 1.3, c), we have
Using this in (9.19) we obtain \xi -x2\x
7e a < 2 V(^o)e- ° - X^'(90)e-^
+ X1i>(90)e-^
Rn
M7
<^(A7e-79o|^(^o)|R"+e-^|V(^o)-AV'(eo)|K„)|x1-x2U. From this estimate we get \xi -x2\x
< ^2AA 77| M ^ | 77 + + 2-\ip'
Ai//| 7
< A7|a;i - x2\x + \xi - x2 - X(A(ti)xi
-
A(t2)x2)
which implies (1 - A7)|zi - x2\x
< \xi - x
2
- X(A(ti)xi
-
A(t2)x2)\x.
This proves (El) also in this case. Assumption (E3) holds, because dom A(t) does not depend on t. In order to prove that (R2) holds also we choose uo = (D(j)0,(j)0) e Dp, (5 > 0, T e (0,T m a x ) and t £ [0,T}. According to Lemma 9.6 we only have to estimate X~1((p(u\) - tp(uo)), where u\ = (D(f>x,<j)\) is the element in D n domA(i) = domA(t) which exists for A < Ao- From (9.14) and assumption (ND3) we get \D(/>\\u" < l-D^ok" + A | F ( t , ^ ) | n » < p{uo) + A6rmax + Aa Tma j0A|c < f(u0) + A6rm« + 2Aa Tmix y(w A ).
9.1. Delay-differential
equations
325
From
we see that
f=
|^A(0)|R-
if |fo(0)| R » >
H
We have to consider two cases. Case 1: |(/>A|7 = |(/>A(0)|K". Using (9.18) for 4>\ we get the estimate ip(ux) =max(|£>>A|Rn,-|»A|7) = \D<j>\\u* < ifi{u0) + A6Tmax +
2\aTm,Mux),
which implies j(A|7 <
+ 6 Tmax ,
0 < A < A0.
|
In this case we have ip{ux) = maxd-D^AU", d ^ b ) < m a x ^ ( u o ) + A6Tm„ + 2\aTm^
1
_
y(Mo)j
This implies (1 - A7)
0 < A < min(A 0 ,1/(27)).
•
326
Chapter 9. Applications
9.2.
to Concrete
Systems
Scalar conservation laws
Given functions / = ( / i , . . . , fd) : R$ X Rd x R -s- R d and g : R^ x R d x R -»• R we consider conservation laws of the form d
d
d
u(0,:r) = uo(z),
a; G R d .
The special case of problem (9.20) where the functions fi and g do not depend on t and x was considered in [Cr2] using the state space L 1 (fi) and the theory of nonlinear strongly continuous semigroups (as presented in Chapter 5). Earlier, S. N. Kruzkov has developed a theory of generalized solutions for problem (9.20) in the class of bounded measurable functions (see [Kr]). In [Kr] as well as in [Cr2] the so-called vanishing viscosity method has been used, i.e., generalized solutions of (9.20) are established as limits of solutions to equations which are obtained from (9.20) by adding a viscosity term. The approach presented in this section is also based on the vanishing viscosity method and is in the spirit of the approach presented in [Cr2] using the theory of evolution problems as developed in Chapter 6 for the 'viscous' problems and the localized version of the Crandall-Pazy theory as presented in Chapter 7 for the limit problem (9.20). At the same time our approach is strongly based on the theory given in [Kr]. In particular this is true for the technical complications caused by the t- resp. x-dependence of the functions fi and g (see Subsection 9.2.8) and the proof that the mild solution obtained from the Crandall-Pazy theory is the unique entropy solution of (9.20). 9.2.1. Basic assumptions and preliminaries. We impose the following assumptions on the functions / and g: (Cll)
We have f G C2(]R+ x Rd x R;R d ) and g G Cl(R+ x Rd x R ) 1 . Moreover, for any a > 0 and T > 0 there exists a constant aa>r > 0 such that \h(t,x,u)\
for0
x G R d , \u\ < a,
where h is any of the functions \Ji)xii
\Ji)ui
9, 9xn 9u, 1
\lijxj,m
i,j,k
=
\Ji)xj,Xki
l,...,d.
We write Z,1(Md) etc. instead of L 1 ( R d ; R ) etc.
(Ji)u,ui
\Ji)t,U)
9.2. Scalar conservation laws
327
We define the function G : Rjf x R d x R ->• R by d
t > 0, x G R d , u G M,
G(i,x,M) = g(t,x,u) - Y^Ui)xi(t,x,u), and require a one-sided bound for g and G:
(C12) For any T > 0 i/aere e:m£s a constant CT > 0 SMC/I £/m£ gu(t,x,u)
< CT and
Gu(t,x,u)
xeRd,
0
Note that assumption (Cll) (for g and (fi)Xi) (9.21)
\Gu{t, x,u)\<(d+
l)a Q ) T ,
u<ER.
implies
0 < t < T, x G Rd, \u\ < a.
We furthermore assume: (C13) For any T > 0 there exists a function bT{-) G L x (R d ) n L°°(R d ) SMC/I that \G{t,x,0)\
0
Moreover, for any a > 0 and T > 0, i/iere exists a function da,T G L1(Md) SUC/J £fta£ |G t (i,a;,u)| < dQ,T(a;),
0 < t < T, xeRd,
\u\ < a.
(C14) For any T > 0 and a > 0 i/iere exisis a constant £QtT > 0 SMC/I £/ia£ |G Xi (t,a;,w) -G X i (t,a;,t;)| < ^ Q , T | W - W | ,
i=
l,...,d,
for 0 < t < T, x £ Rd and \u\ < a, \v\ < a. Furthermore, GXi(t, -, 0) G Z , 1 ^ ) , i = l,...,d,foranyt>0 and for any T > 0 £/zere exists a constant mx > 0 such that \GXi(t, -,0)| L i < m r ,
0
t=l,...,d.
We define the seminorm | • | B y on L 1 (R d ) and the subspace J3Vr(Rd) by | « | B V = sup{ / udiv
u G L 1 (M d ),
328
Chapter 9. Applications
to Concrete
Systems
Furthermore we define D = L°°(m.d) D BV(Rd), / N
l\u\Li + \u\L<*> + \u\Bv for U£D, I oo otherwise,
and L1(Rd)nL°°(Rd),
D =
~, N [ |«U°° f(u) = < I oo
for u G D, otherwise.
9.8. Lemma, a) We have W1'1^4) C BV(R d ) and \u\Bv = E ^ i I ^ U 1 = |Vu|z,i foruG W1>1(R 0, \un\Bv < M, n= 1,2,..., then we have u G £V(R d ) and \u\Bv < M. c) The functionals ip and dp are lower semi-continuous on X. d) For any u G Wl'1(Rd) n Da with Aw G Lx{Rd) there exists a sequence (u„) n e N C C£°(R d ) such that lim \u — u„|vm.i = lim |Aw — Au n | L i = 0 and lim <^(u„) =
Moreover, we have G(i,-, M „(-))Gi 1 (M d )
(/i)M(i,-,«„(-))Kk(-) G i 1 ^ " ) .
and 1
1
1
d
* > 0.
d
Proof, a) Assume that u G W - ^ ) and let <> / G C0 (M ;R ) with |>|i=o max^i,...^ |^i|L~ < 1 be given. Then we have / u{x) div 4>(x) dx = — / VM(X)
JMd
JS.d
\VU\LI.
JRd
Consequently we get u G BV{Rd) and \U\BV < |Vu|x,i. For M G W/1'1(ffid) and r > 0 we define Vr,i(X)
-signux.(x) 0
=
for |z|Rd < r, otherwise,
and consider the mollified functions (see Section A.3 for the definition of mollifiers) v„Ax)
/ vr,i(y)pe(x - y) dy,
x G ld.
d
JR
Obviously we have v^.i 6 Co(R d ) and | ^ J | L ~ < 1, i = 1,... ,d. This shows that
9.2. Scalar conservation
laws
329
parts gives / (Vu)T4>rt€dx = / udiv4)r,edx <\U\BV,
JRd
lim lim ( - / (Vu) T ^ r e da;) = lim / r->ooe|OV
prove that also
r,e>0.
jRd
JRd
)
|V«|LI
|Vu(x)| K ddx = IVuki
r
^°°J\x\d
< |u|sy. d
b) For any <j> G C^(R ;Rd)
with \
lim / undiv(j)dx=
/
udivcfrdx.
Since we have /„«,«„ div > dx < M for all n — 1,2,..., and all <> / £ CQ with |>|t°° < 1, we get that also JRdu div (f>dx < M for all such <j>, which implies u G BV(WLd) and \u\BV < M. c) We choose u £ X and a sequence (un)ne^ C X with l i m n ^ ^ |u„ — U\L\ = 0. We have to prove that a = liminfn-xxj tp(un) > ip(u). It is clear that we only need to consider the case a < oo. Without restriction of generality we can assume that (un)ne^ C D and l i m ^ o o
and \U\BV < lim inf \un\Bv-
Without restriction of generality we can assume that l i m n - ^ |Mn|Bv exists (otherwise take a subsequence). Then lhrijj-Kx,
lim n—foo
+ |M|LOO + \U\BV |M„|X,I +
lim 7i—^oo
|W„|L~ +
lim n—>-oo
|U„|BV =
lim
In order to prove that dp is lower semi-continuous on X we choose u G X and (wre)nsN hi -X' with l i m n - ^ \un — u\^ = 0 and set a = liminfn^oo
330
Chapter 9. Applications
to Concrete
Systems
lmifc^oo unk (x) = u(x) a.e. on M.d. This implies \u(x)\ < a a.e. on Kd, i.e., |«|i~
<
a.
d) Let crr, r > 0, be the functions defined in (A.7). It is easy to see that \{d/dxi)(jr(x)\ < M/r and \(d2/dxidxj)ar(x)\ < M/r2, x g Kd, i,j = 1, . . . , d , where M = maxj i j = i i ... i d(|o'a; i |L~, \
= lim \Au — A(aru)\Li
= 0.
r—»oo
For a family (pe)£>o of mollifiers we define
Since we have (d/dxi)(pe * oyw) = pe * {{d/dxi){aru)) and A(p e *CT,.U)= p£ * (A(oyu)), it is clear that lim^o \crru-urie\Wi,i = lim^o |A(oyM) — A U ^ I L 1 = 0, r > 0. Therefore we can choose e r > 0 with e r ->• 0 as r -» oo such that, for lim \u — u r |iyi,i = lim |Au — Aw r | L i = 0. r—J-oo
r—>oo
Obviously we have (9.22)
|Mr|l,~ £ \
From statement a) of the lemma we see that |w r |sv = |Vwrj^i and \U\BV = | Vu|i,i. Using Fubini's theorem and properties of mollifiers we get the estimate \UT\BV
= /
\Vur(x)\Md dx = / |V(/oer * aru)(x)\Md dx
= / |(Per * V(ov«))(:r)| Rd d2: = / | (p £r * (
/
d
dx
Per(a;-2/)kr(2/)||Vu(y)| H
jRdJRd
+
per(x-y)\u(y)\\\7
d
jR JR
= /
kr(y)||Vu(y)| R ddy+ /
._ .
, , . dM. . ML1 = F B V + ML1r r This estimate and (9.22) imply . , dM, (9.23) v(Ur) < ¥>W H «ii r and consequently limsup,..,.^
< Vu x1 +
dM,
|«(j/)| |V
9.2. Scalar conservation
laws
331
Let K'c Rd be a compact set such that ur(x) = 0 for x G Rd\.ftT. Observing |wrU~ < |W|L~ < ct and using assumption (Cll) for {fi)Xi, g and assumption (C13) we get /
\G(t,x,ur(x))\dx=
/ \G{t,x,ur(x))\dx+ < aa,tinasasK+
/
|G(i,a:,0)| dx
\br\L1 < oo.
Using assumption (Cll) for (fi)u we obtain \(fi)u(t, x,ur(x))(ur)Xi(x)\
dx < a Q , t I(u r ) Xi \ L i < oo.
a 9.2.2. Globally bounded functions. In order to prove the existence of solutions for problem (9.20) we consider first problems of the form (9.20) with modifications of the functions /j and g which are globally bounded with respect to u. In this subsection we define these modifications and formulate the assumptions satisfied by these modifications as a consequence from the assumptions (Cll) - (C14). We choose a function ip G C°°(IR) satisfying the following conditions: a) V is increasing on E with 0 < ip'(r) < 1 for r £ R. b) XP{T) = r f° r lTl < 1 a n d V;(r) = 1-5 sign r for |r| > 2. For R > 0 we define ipR e C°°(R) by IPR(T)
= m(r/R),
T£R,
and set fR(t,
x, u) = f{t,
for t > 0, x G Rd, » e l is easy to see that
x, IJJR(U)),
gR(t,
x, u) = g(t, x,
^R(U))
We shall use the notation fR = (fRtl,..., f R , d ) r .
It
d
GR{t, x, u) = Git,x,
-4>R{U))
= gR(t, x,u) - ^ ( / f l , i ) X i ( t , x, u)
for t > 0, x G Rd and a e l . Simple computations show that fR and gR satisfy the following assumptions: (C11R) We have fR G C2{R% x Rd x K;R d ) and gR G C 1 ^ xtfxR). Moreover, for T > 0 i/iere exists a constant aRtx > 0 such that \h{t,x,u)\
< afi,r
forO
xeRd,
uGR,
332
Chapter 9. Applications
to Concrete
Systems
where h is any of the functions \fR,i)Xii 9R,
\JR,i)ui\JR,i)xj,ui
(9R)xi,
(9R)U,
\jR,i)xj,Xk-i
\jR,i)u,ui
\JR,i)t,ui
i,j,k=l,...,d.
(C12R) For any T > 0 there exists a constant CT > 0 such that {9R)u{t,x,u)
< cT and 0 < t < T, x G M.d, u G R.
(GR)u(t, x,u)
\(GR)u(t, x,u)\<(d+
l)ofl, r ,
0 < t < T, xeRd,
net.
(C13R) For anyT>0 there exists a function bT(-) G L 1 (R d ) n L°°(Rd) and a function dRtr & L1(Rd) such that 0
\GR(t,x,0)\
dR,T{x),
0
x<ERd,
u&R.
(C14R) For any T > 0 there exists a constant £Rtx > 0 such that \(GR)Xi(t,x,u)
- (GR)Xi(t,x,v)\
i=
l,...,d,
d
for 0 < t < T, x G R and u,veR. Furthermore, (GR)Xi(t, -,0) G L 1 (R d ), i = 1 , . . . , d, for any t > 0 and for any T > 0 there exists a constant mr > 0 such that \(GR)Xi{t:-,0)\L,
<mT,
0
t = l,...,d.
The constants resp. functions aRj, £Rj and dR^{-) are given by aR,T = a3R/2,T(l + R~l ^ a x ^ £R,T
W{T)\),
= ^3fl/2,T>
dR,T(x) = d3R/2tT(x),
x£Rd.
In the following we fix R > 0 and shall consider problem (9.20) with fR and gR instead of / and g. In order to simplify notation we shall drop the index "i?" and still write / and g. However we shall indicate R in the constants as for instance aR T-
9.2. Scalar conservation
laws
333
9.2.3. Vanishing viscosity, quasi-dissipativity. The standard method for proving existence and uniqueness of generalized solutions for problems of type (9.20) has been and still is the so-called "vanishing viscosity method". We will also follow this approach and formulate in this subsection the 'viscous' problem. We furthermore shall prove that assumption (El) holds uniformly with respect to the viscosity v > 0. Together with (9.20) we shall consider also the 'viscous' equation ut + 2__/-^L(t,x,u)=g(t,x,u)
(9.25)
+ vAu
dXi
i=i
for any v > 0. Corresponding to this equation we define the single-valued operators Av{t), t > 0, on X = L1^) by domj4„(t) = {u € W rl ' 1 (K d ) | Au G L1^)
and
d
G(i,-, U (-))-E^)«^-' u (-))^(-) G L l ( R d )}' i=1
(9.26) d
(A„(t)u)(x)
= G(t,x,u(x))
- ^2(fi)u(t,x,u(x))uXi(x)
+
vAu(x)
i=l
for x G Rd, « e domj4„(t). It is clear that the sequence (u„)„ e N of statement d) in Lemma 9.8 is contained in dom A„(t), v > 0, t > 0. 9.9. Proposition. Let assumptions (C11R) - (C13R) be satisfied. Then the operators Av{t), t > 0, satisfy condition (El) with a+ = oo uniformly with respect to v, {Av(t)u - Av(s)v,uforO
domAv(t)r\Da
v)_ < cT\u - v\Li + \t-
s\La>RtT
andv G domA^(s)nDa,
where
£QIK,T
—
Proof. Let tjjh, h > 0,be the function defined in (A.8). By Lebesgue's dominated convergence theorem it is easy to see that (9.27)
lim / (j>(x)il)h(u(x))dx = / 4>{x) sign u(x)dx,
<j),u £
Ll(Rd).
Moreover, we have (9.28)
(v,u)_=
v(x) sign u(x)dx-
\v(x)\dx,
where E 0 (M) = {x G R d | u(x) = 0} and Ei(«) =Rd\
E 0 (w).
u,?;GL 1 (M d ),
334
Chapter 9. Applications
For u, v G C$(Rd) n Da and t,s£
to Concrete
Systems
[0, T] we have (see (9.27))
(A„(t)u - Av(s)v, u - v)_ < / {Av(t)u - Av{s)v) sign(u - v) dx Jmd
(9.29)
= lim / [Av(t)u - Av(s)v)iph(u - v) dx. Therefore we have to estimate /
(Av(t)u-Av(s)v)iph{u-v)dx = -V] / .^J^dXi\
(9.30)
+
Jud
—[fi{t,x,u)-fi{s,x,v)\iph{u-v)dx J
(g(t,x,u)
~g(s,x,v))tph(u-v)dx
+ u
A(u - v)iph(u - v) dx =: h + h + hJ&d Integration by parts and observing that V4( r ) — 0 yields h = -v / il>'h(u ~ v)V(u - v)JV(u Jmd
-v)dx<
0.
For h we use ff(i, x, u) - g(s, x, v) = g(t, x, u) - g(s, x, u) + g(s, x, u) - g(s, x, v) = (t-s)
/ gt{s + Jo
r{t-s),x,u)dr
+ (u-v)
/ gu(s,x,v Jo Analogously, for I\ we use the representation fi(s,x,v)
- fi(t,x,u)
= ~{t-s)
/ (fi)t{s +
+ T(U -
v))dr.
T(t-s),x,u)dT
Jo -(U-V)
I (fi)u(s,X,V
+
T(u-v))dT.
Jo We get the estimate h + h + h < it ~ s) /
JRd
(9.31)
+ / Jw
+ (
Jud
a
(*> s> x)i>h{u - v) dx b(s,x)(u-v)iph{u-v)dx
c(s,xfV{u-V)(u-vmu-V)dx,
9.2. Scalar conservation laws
335
where a(t,s,x)=
/ Gt(s + r(t — s),x,u)dr Jo d
r\
- ^ 2
b(s,x)=
I {fi)t,u{s
/ gu(s,x,v Jo
+ T(t-
+ T(u-
ffo\h)u(s,
s),X,u)d,TUXi,
v))dr,
x,v + T(U - v)) dr^
c(s,x) = — \J0\fd)v.(s, x,v + T(U - v)) drj For the function (9.32)
*/,(T):=
/ aiP'h(a)da,
r > 0,
Jo
we have V*h(u — v) = (u — v)ip'h(u — v)V(u - v) and consequently (9.33)
ah:=
d
c(s,x)TV(u
- v){u -v)tp'h(u-
v) dx
Ju
/
yh{u-v)^2-^-{s,x)dx.
suppiuUsupp v supp
The estimate
\yh(u-v)\
=h
I
(u—v)/h
aip'(a) da < h [ at/;'(a) da Jo
together with (9.33) and assumption (C11R) (for (fi)u>Xi 1 , . . . ,d) implies (9.34)
and {fi)u,u,
i
lima ft = 0. hiO
Using assumption (C12R) for gu we get (9.35)
lim / db(s,x)(u —v)iph(u ~ v)dx HO 7H
= / b(s,x)\u - v\dx < CT\U - V\L1. JtLd
336
Chapter 9. Applications
From assumption (Cll R ) for the functions (fi)t,u
(9.36)
[52
{fi)t,u{s +
we
to Concrete
Systems
obtain
T{t-s),x,u{x))dTUXi{x)dx
Rdi=1 d
< aR,T 52 \u*i (x) I dx d 1 = 1 ~Um
ad
-R,T-
From assumption (C13R) for Gt we see that / / Gt(s + r(t — 'JudJo
s),x,u(x))drdx <
\dR,T\Ll-
The last estimate together with (9.29) - (9.31) and (9.34) - (9.36) shows that for u,v £ C0l(Rd) n Da we have
(9.37)
(Av(t)u - Av(s)v, u - v)_ < I (Av(t)u - Av(s)v) sign(u - v) dx JRd
< CT\U - v\Li + \t-
s]LaiRiT,
where La,R,T •= ataR,T + \dRiT\Li. For u G dom Av{t) n Da and v G dom A„(s) n Da we choose the sequences (un), (vn) C C^°(R d ) according to Lemma 9.8, d). Obviously we have (9.38)
lim |A(u n -vn)
- A(u-v)\T1
= 0.
If we write G(t, x, un(x)) — G(t, x, u(x)) = / Gu(t,x,u(x) Jo
+T(un(x)
- u(x))) dr (un(x) - u(x))
we get, using also (9.24), \G{t,x,un(x))
-G{t,x,u(x))\
<{d+ l)aRtT\u„(x)
for 0 < t < T, x G R d , i.e., we have (9.39)
lim \G(t,;un(-))-G(t,-,u(-))\L1
= 0.
- u(x)\
9.2. Scalar conservation
laws
337
Using (CI1R) for (fi)u and (fi)u,u \(fi)u(t,x,u(x))uXi(x)
we get
- (fi)u(t
(x))(un)Xi(x)\
< \UxAx)\ \(fi)n(t,X,u(x))
-
+ \{fi)u(t,x,un(x))\
\uXi{x) -
<\uXi{x)\\un(x)-u(x)\
+ aR,T\uXi{x) < aR,T\\un{x)
{fi)u{t,X,Un{x))\
(un)Xi{x)\
/ Jo
-
\(fi)uu{t,X,u(x)+T(un(x)-u{x)))\dT
{un)Xi{x)\
- u{x)\ \uXi(x)\ + \uXi(x) -
(un)Xi(x)\)
for 0 < t < T and x G Rd. This implies |(/i)«(*, -,u(-))uXi -
{fi)u{t,-,un(-))(un)Xi\L1
/ \un(x) Jw
u(x)\\uXi(x)\dx.
For a subsequence (unJfceN we have limfc^oo |MnA,(a;) - u(x)\ = 0 a.e. This and the estimate \un{x) -u(x)\ \uXi(x)\ < 2a\uXi(x)\ a.e. prove (by Lebesgue's dominated convergence theorem) that (9.40)
lim \{fi)u{t,-,unk{-)){unk)Xi
- (/,)„(*, •, u{-))uXi | = 0 .
From (9.38) - (9.40) we conclude that for subsequences (unk) and (vnfc) we have lim (i„(£)u n t - Av{s)vnk)
= A ^ t j u - i4„(s)z;
in Z, 2 (R d ).
By lower semi-continuity of (•, •)_ (see Lemma 1.3, d)) we get using (9.37) (Av(t)u-Av(s)v,u
- v)_ < liminf(A 1/ (t)u nfc - AI/(s)vnk,unk
- vnk) ^
k—>-oo
< liminf I CT\unk k-±co
vnk\Li
\
+ \t-s\(\a
+
max{\u\Li,\v\Li))aRiT
= cT\u - v\Li +\t-s\
[aaRtT + ferU1 J
= cT\u - v\Li + \t-
s\LatR:T.
+ \dRiT\Li)
Note that we have to observe the estimate (9.23) for the functions un, vn.
)
•
338
Chapter 9. Applications
For later use we note that for s = t we have Av{t)u{x) u(x) = v(x) and consequently (observe also (9.28))
to Concrete
Systems
— Av(t)v(x)
= 0 if
JJuMu -v)- g ( | r / ^ - , «(•))- l-m -,«(•))) (9 4 1 )
+ ff(<, - , " ( • ) ) - 0(*> •, O ) )
=
si n
g (w - u) dx
((Mt)u-Mt)V)^u-V)dx
= (A„(t)u — Av(t)v,u — v)_ < CT\U — v\Li. 9.2.4. L 2 -considerations. Establishing the range condition (R2) is a more difficult task. We shall do this in several steps. We first consider the problem in L2 and use the results on maximal monotone operators presented in Section 1.5, in particular Theorem 1.39. Instead of the equation (I - \Av{t))u — <j>, u G dom Av{t), 4> G £ 1 (K d ), we set \i = 1/A and consider the equation fiu — Au(t)u = //>, i.e., r.
d
(9.42)
fiu -isAu
+ Y, Q^fifa-M-))
~ 9(t, ; «(•)) = M>-
l
i=\
We first consider the single-valued operators B(t), t > 0, defined by d B{t)u = g(t, •, «(•)) - ] T ^r/«(*> •> "(•)) i=\
dxi
•^(/iWv.OK + G(t, -,«(•)) - G(t,., 0) + G(t, -, 0),
u G W1'1^).
9.10. Lemma. There exist constants C I ^ ^ T and a ^ j * wiift 0 < a ^ / j ^ < c\tv,R,T such that equation (9.42) /ias, /or ant/ <£ G L 2 (R d ), a unique solution u G i72(]Rd) provided \x > CI^R^T- Moreover, for \i > CI^R^T we have the estimate (9.43)
^ | V « | | 2 + (/x - a 1 , f l ,r)|«|i2 < /i|u| L 2^| L a + - | 6 T | 2 2 . 2'
Proof. We first prove that the operators B(t) are bounded (nonlinear) operators ff1(Rd) - • L 2 (R d ). Using G(t,i,t;) - G ( t , i , 0 ) = v^Gu{t,x,Tv)d.T and assumption (C11R) for (fi)u,Xi and #„ we get -(G(£,z,t;)-G(i,x,0)) sup w ueR,te[o,T],xeRd
<(d+l)aRtT.
9.2. Scalar conservation
laws
339
Using assumption (C11R) for (fi)u we obtain SUP
\(fi)u(t,X,v)\
< Ofl, T -
veR,te[o,T],xe«.d
Since bT G L 1 ^ ) n L°°(Md), we have also bT G L 2 (R d ) and consequently G(t, -,0) € L 2 (R d ). Therefore we get for u G ff1(M
^2\(fi)n(t,;U(-))uXi\L2 + |G(t, •,«(•)) ~ G(t, -,0)| L 2 + \G(t, -,0)|L2 d
< O f l . T ^ l w ^ U 2 + (rf+l)afl,T|w|L2 + | M L 2 >
0 < t < T,
i=l
which proves that B(t) is a bounded operator H1 For w e H1 (R d ) we define
) ->• L 2 ( R d ) .
/•u(x)
(fi)u(t,x,s)sds, t>0,xeRd. Jo Observing \(fi)u(t, x,s)\< dn,T for 0 < t < T, x £ Rd and s £ R we get Wi(t,x)=
,T|M|22,
0
i.e., «>*(«, •) G Z-1/lttd , 1 ^ ) . Using that also \(fi)u,Xi(t,x,s)\ d x£R and s G R we have «~™*(*>x)
/
JjHd\ OXi
da;
= /
/
< aR
{fi)u,xi(t,x,s)sds
JwAJo
+ (fi)u(t,x,u(x))u(x)uXi(x) < 7;aR,T\u\\i +aR
/
+ ^\uXi\2L2),
dx
\u(x)uXi\ (x)\dx 0
so that also (d/dxi)wi(t, •) G L 1 (R d ). Thus by Lemma A.6, b), and the definition of Wi(t, x) we have 0 ^
Jut" d
= zl ~[
.
,x)dx
dx
i
,u(x)
/ JR* JO
d
{fi)u,xi{t,x,s)sdsdx
+\ i=1
.
/ JRd
(fi)u(t,x,u(x))u(x)uXi(x)dx.
Chi ipte 9. Applications to Concrete Systems Chapter
340
Using this we get G(t,x u(x)) - G(t,x ,0) u(x)2dx u(x)
(B(t)u,u)L
d
(
"
r
E
/
/
G(t,x,0)u(x) dx
u x pu{x)
r()
/
{fi)u,Xi(t,x,s)sdsdx.
This gives the estimate (observe also (C12R)) < cT\u\l2 + ^\u\2L2 + ± | 6 T | | 2 +
(B(t)u,u) [B(t)u,u)L2 T2
^-\u\l2
(9.45) I |2 = ai,R,T\U\L2
, 1 it |2 + ^\0T\L2,
where we have set ai^T = CT + 1/2 + dd^r/^We consider the Gelfand triple H1^) Q L2(Rd) Q H^W1)* = i/'- 1 (R d ) d 1 d (note that i?o(K ) = i? (M )). Lemma 1.58 implies that - A is the duality mapping H1(Md) -> H~l(Rd). According to Proposition 1.1, c), the mapping u —• AM is continuous on H1(Rd). We have also (u,Au) = — |Vu|| 2 = ~YA=I \uxi\2L2- This and (9.45) imply (u,Av(t)u)
= u(u,Au) + < -v\Vu\2L2
(u,B(t)u)L2
+ ai,H,TJ«lia + ^\br\2L2,
u £ H1^),
and consequently (J denotes the embedding H1 (u, (-Av{t) + aliRiTJ)u) IVul L2
1 Ihlh
> ^|VM|/,2 — —
2|Vu|L2'
which proves that the operators —Av(t) + ai^rJ nition 1.33, b)). For u,v & H1(Rd) we have the estimate — (fi)(t,x,u(x)) < \u(x)
-V(x)\
-
-incpd
))
t t e f l l / m d ),
are also coercive (see Defi-
—{fi)(t,x,v(x)) / Jo
+ \{fi)u{t, x,u(x))uXi(x)\ < aR,T{\u(x)
H
0
(fi)u,Xi(t,X,v(x)+T(u(x)-v(x)))dT
+
\(fi)u{t,x,v(x))vXi(x)\
- v(x)\ + \uXi(x)\ + \vXi{x)\),
0
x€Rd,
which implies that div(/(t, •,«(•)) - f(t,-,v(-))) e L2(Rd). Furthermore, we. have \f{t,x,u(x)) - f(t,x,v{x))\Md = \u(x) - v{x)\\f*fu(t,x,v(x) + T{U{X) -
9.2. Scalar conservation laws
341
v(x)))dr\Rd < d1/,2aRiT\u(x) - v(x)\, which shows that also f(t,-,u(-)) f(t,-,v(-)) £ L 2 (K d ;K d ). By Lemma A.6, a), we get - / 0 0 ) ~ v(x))Y^(j^fi(t,x,u(x)) = /
-
-
—fi(t,x,v(x)))dx
(V(u-v)(x))T(f{t,x,u(x))-f(t,x,v(x)))dx.
d
JK.
Using assumption (C11R) for {fi)u we get
-(«-^E^:(/*(*.-.«(-))-/i(*.-,«(-)))) i3 < /
\V{u-v){x)\&*\f(t,x,u(x))-f{t,x,v{x))\ddx
< /
\V(u-v)(x)\Rd\u(x)-v(x)\
JRd x
/ fu(t,x,v(x) Jo
v <^(n-v)\h
2
+
-v(x)))dr
+ T(U(X) 2 daaa RT
2lV(")|L2 + —
dx md
-^-\u~v\l2.
Analogously we have (u-v,g(t,-,u{-))
~g{t,-,v(-)))L2
aRtT\u-v\2L2.
<
Collecting the estimates from above we get, for u,v e /f 1 (]R d ), (u - v,A„{t)u - A„{t)v) = (u-v,A(u-v))
+ 2
(u-v,B(t)u-B(t)v)L2
< _ i l | V ( u - V)\ L2 + ( - ^ 1 +
afl>r)|„
- „|2 2 .
This proves that the operators — Av{t) + (daR T(2v)~1 + CLR^J Using the estimate
are monotone.
| (u, B(t)v - B{t)w)L21 < | (V«, f{t, •, «(•)) - /(*, -M-)))L21 + |(M,g(i,-,v(-))-5(t,-,w(-))) Z / 2 | < afl,T(|V«| L 2 + |u| L 2)|u - w\L2 for u,v,w e //^(IR"1) we see that the operators B(t) and hence the operators Av{t) are also hemi-continuous (see Definition 1.33, c)). We set CI,V,R,T
•= maxfa l j f i ) r, —a2RT
+
aR
Chapter 9. Applications
342
to Concrete
Systems
Then the operators —Av(t) + /J.J with // > cijVtRtT a n d t S [0, T] are monotone, coercive and hemi-continuous. By Theorem 1.39 these operators are maximal monotone with range(—Av(t)+fiJ) = H~1(Rd). This in particular implies that, for any <\> G L 2 (E d ) and any /x > c\tV,R,T there exists a unique u G H1(Rd) such that (9.46)
~Av(t)u
+ nu = fi
0
Since we have
+ (n- ai,R,T)\u\2L2 < n\u\L2\(f>\L2 + -\bT\2L2.
i.e., (9.43) holds.
•
9.2.5. L1- and i°°-estiniates. In this subsection we shall prove L1- and L°°-estimates for solutions of (9.42). 9.11. Lemma. Assume that 4> 6 L1^) n L°°(Rd). Then there exists a positive constant C2,V,R,T > max(cx, CI^R^) such that equation (9.42) has for any M > C2,U,R,T o, unique solution u G ff2(Rd)nL1(Rd)n.L°0(Rd) satisfying (9.43) and (9.47)
MLCC
< ( l - -cT)
(|^|L~
+
-|ML~),
|u| L i < ( l - i c r ) _ 1 ( | 0 | L i + - I f r r l i i ) .
(9.48)
Proof. Choose // > c i ^ ^ y and let u be the unique solution of (9.42) according to Lemma 9.10. We first show that u G L°°(R d ) and establish the estimate (9.47). For p > 2 and n = 1,2,... we define
*n(s)
H?/2-1 np/2-l
for \s\ < n, for
|s| >
n>
and set C„(x) = $ n ( | u ( z ) | 2 ) , a; G R d . From ( n ^ ) 2 ^ ) 2 = |u(a;)| 2p - 2 < \u(x)\2 for |M(X)| < 1, = \U(X)\2P~2 1/2
< n"-1
for 1 < |u(i)| < n1'2 and = 2
d
2
d
2
nP-
\u{x)\2
for |«(a;)| > n we see that («« € £ (R ) for u G L (R ). Analogously we see that, for u G H2(Rd), we have £„u G i7 1 (R d ). Taking inner products with
9.2. Scalar conservation
laws
343
Qnu in (9.42) and observing Lemma A.6, a), we get v((nVu,Vu)L2
2v(&n{\u{-)\2)uVu,uVu)L2
+
= (C„«, Git, -, «(•)) - G(t, -, 0)) (9.49)
2
+ (C„«, G(t, -, 0))L a
d
- X ] ( ^ M ' (/*)«(*. •. '"(•))Mxi)L2 -
M(C«M> W) L 2
+ M(CnW, 4>)L2-
We have the estimates d
- ] T ( ^ U ' (/<)«(*> •> «(-)K=) L 2 i=l d (9 50)
-
.
CnWIuWIKWIda:
< ^ (Cn V u , V u )
L2
a2 + d - J ^ (Cn«, « ) L 2 •
Let 1/p + 1/q = 1. Then we have
=
f
\u(x)\^-2^\u(x)\'!dx+
|«(x)|
n«W2-V\u(x)\qdx\=I+II.
I \u{x)\>n^n
Observing (p — l)q = p we get 1=
f
\U(x)\p-2\u(x)\2dx
=
\u(x)\
I
C,n\u{x)\2dx.
|u(x)|
For II we have (observing q(p/2 - 1) + q/2 - 1 = q(p - l ) / 2 - 1 = p/2 - 1) //=
/" n 9 (p/2-l)|w(x)| 9 - 2 |w(x)| 2 (ia;<
|«(i)|>n1/J
=
J
np/2-1\u{x)\2dx=
|«(i)|>nV2
/ \u(x)\>n1/'2
(
Cn{x)\u{x)\2dx.
\u(x)]>n1/2
Collecting these estimates shows that (9.51)
\Cn.u\qLq <
(C„u,u)L2,
n^l2-^+ql2-l\u{x)\2dx
344
Chapter 9. Applications to Concrete Systems
i.e., CnU G L 9 ( K d ) . Observing t h a t bT G L^(K d ) by assumption (C13 R ) we get the estimate {CnU,
G(t, -,«(•)) - G(i, •, 0 ) ) L 2 + (C„«, G(i, •, 0 ) ) L 2 < / Cn(x)u(x)2 / • /R " •/O
(9.52)
+ /
Gu{t,x,Tu{x))drdx
Cn{x)\u{x)\\bT{x)\dx
< CT{CnU,u)L2
+
\CnU\Li\bT\Lr>•
T h e estimates (9.50) - (9.52) together with (9.49) a n d t h e fact t h a t $ ' ( s ) > 0 for s > 0 imply (9 5 3 )
° ~
C
T(CnU,u)L2
- ll{CnU,u)
+ \CnU\L«\bT\LP L2
+ ^J a \
T
{CnU, u)
L2
+ ll\Cnu\L«\
Note t h a t <j> G L p ( R d ) for 2 < p < oo. Using (9.52) t h e last estimate gives fi{CnU, u)\2
- HI&ILP < \br\LP + (cT + - ^ \ T ) (CnU,
uf^
resp. {Cnu,ufl2p
< ( l - - ( c
+ —4
r
j T
))
(\4>\LV + - I f r r l t p )
for fi > C2,i.,ij,T, where C2,U,R,T : = m a x ( c i i I / i f l i T , c T + ^ ^ T ) -
By Fatou's lemma we get \u\Lp < lim (Cnu,u) n—>oo
<
2
^
( 1 -K P r + ^ T ))" 1 ( W L ' + ^ 6r|L ')
for a l l p > 2. Since Cn{x)u{x)2 < \u{x)\p, x G Rd, we have lim„_>. 00 (C n «,u) L 2 = \u\pLP. Returning t o (9.53) we analogously see t h a t | u | p / 2 _ 1 V u G L 2 ( R d ; R d ) and (9.54)
v{p - 2){\u\p-2Vu,Vu)
J2
=2v
lim
($'n{\u{-)\2)uVu,uVu) L 2 -
9.2. Scalar conservation laws
345
Using (9.49), the estimates (9.50), (9.52) and "52{(nU, {fi)u{t, i=l
-,u(-))uXi) L2
< ^(CnVu, Vu)L2
+—
a%T((nu,u)i
instead of (9.51) we see that also u(\u\p-2Vu,Vu)r2
(9.55)
=z/ lim (C„V«, Vu) r 2 . L 'u n—>oo Using (9.50), (9.52), (9.54), (9.55), the estimate ~^2{CnU, (fi)u{t,
-,u(-))uXi)>1L 2
< v{p-
1)«„V«, VM)L2 +
d
4y(p°_1)
5
B,r(CnU,t)p
and (9.49) for n —• oo we obtain 0 < cT|T|LP
This implies u
M L * - H i * < - ( | & r U* + (CT +
4,p-i)^)l
U»)•
Using Lemma 9.11 we get for p —>• oo |«|L~ < (l
CTJ
(|0U°° + - | H i ° ° J ,
V> C2,v,R,T-
We next prove that M G L 1 (E d ). To this end we define, for e > 0, e[)
\e-V2
forO<S<e,
and set Ce(a;) = $e(\u(x)\2), x G K d . From ((c{x)u{x))2 = 1 for |u(a;)| > e 1 / 2 and = e_1JM(a:)|2 for \u(x)\ < e 1 / 2 we see that (eu G L2(Rd). Moreover, we have \u(x)\\V(e(x)y = 2$'e(\u(x)\2) \u(x)\2\Vu{x)\Rd = 0 for \u(x)\ < e1'2 l 2 and = \u(x)\- \SJu{x)\^d < e~^ \S7u(x)\ma for \u{x)\ > e 1 / 2 . This shows 2 d d that uVC G L (R ;R ). Since we have also (£Vu G L2(Rd;Rd), we see that
346
Chapter 9. Applications
Ce« € H1(Rd).
to Concrete
Using Lemma A.6, a), we get
-v{Qu, Au)L2
= z/(uVCe + CeVu, V M ) L 2 ^(|u(x)| 2 )u(x) 2 Vu(x) T Vu(2:)dr
= 21//
+ u I |M(X)| _ 1 VU(X) T VM(X)<2X J|u(x)|>e 1 /2
+ i/e" 1 / 2 /
Vu(x) T Vu(x) dx
i|u(x)|<eV2
= ve~1/2
Vu{x)rVu(x)dx. J|u(x)|<eV2
We have also
1=1
*
2= 1
d
+ (&u, 5 (*, - , « ( • ) ) - 9it, ; 0)) L2 + (Ceu, g(t, -, 0)) La = (V(Ce«), /(*, •, «(•)) - /(*> •> 0 ) ) i a + (Ce«, G(t, •, 0)) L 2 + i(£u,g(t,-,u{-))
-g(t,
-,0)) L 2 .
For the individual terms in this expression we have the estimates
(v(c£iO,/(V,«(-))-/(t.->o))L2 = 2( u 2 ^(| M (.)| 2 )Vt i , f(t, -, «(•)) - / ( i , •, 0)) L 2
+ ( C £ v « , / ( t , - , « ( . ) ) - / ( t , - , o ) )' JL 2 — 11 //20 /
r
T / / s „ , .T u(x)V«(i) /
/
J|u(x)|<eV2
< e- 1 / 2 d 1 / 2 o f l ,r /
i(€u,G(t,-,0))L2
fu(t,x,Tu(x))drdx
J0
J\u(x)\
<^e~1/2/
r1
|u(a;)||Vu(a;)|R«.da;
|Vw(x)|2^x+-^I(C«,u)L2,
4*)\ < |C e M| L »|6 T | L1 <
|6T|LI
Systems
9.2. Scalar conservation
laws
347
and
=
/ (e{x)u{x)2 JMd
/ gu(t,X,Tu(x))dTdx JO
<
CT(CeU,u)L2.
Using these estimates we get, taking inner products with (eu in (9.42), da1 0 <
4i/
'
1
(CeM,u)£2 + M L
+ C r ( C e ' « , w ) L 2 - fJ-((eU,U)L2
+ fl\(f>\Ll
which implies (Cu,u)T2<
( l - I (
C r
/i v
+
- ^ l ) )
4^ / /
(l^lii + - | 6 r | £ i ) ,
v ~
H>C2,v,R,T.
/i'
By Fatou's 'atou's lemma we get u G L11(M (Rdd)) and
Hi^hm(C,,^<(l-i(c ) ) -J1J( | ^v1 +- I | 6^T' | L l ) . fi \ T + ^4v Since now we already know that u G L 1 (R rf ), we can use (9.41) for v = 0 and (9.42) in order to get /i(u,signu) L 2 -/x(!>, sign u ) L 2 d
„
= ( v A u - ^ ^ - ( / i ( t , •,«(•))-/i(t,-,0))+3(t,-,«(•))-fl(t,-,0),sign«)ia i=l
+ (G(t,-,0),signu) L 2 < cT|w|z,i + M L 1 . which implies ML1 < f 1
crJ
\\4\L1
+ -|6r|iiJ,
/i > C2,U,R,T-
D /1 1
11
d
9.2.6. H ' -estimates. We next prove that u G W ' (M. ) for any solution of (9.42) according to Lemma 9.11. We first derive an equation which is satisfied for w(x) = u(x + z) - u(x), x G Rd, where z G Rd is fixed. 9.12. Lemma. Assume that
(9.56)
~
fiw(x) - uAw(x) - Y^ —— (pi{t, x)w(x)) + q(t, x)w(x) + r(t, x)z i=i
dXi
li(
348
Chapter 9. Applications
to Concrete
Systems
where p(t,x)=
/ fu(t,x Jo
+z,u(x)
q(t,x) = - / gu(t,x Jo rj(t,x)
= -
Jo
GXJ(t,x +
+
Tw(x))dr,
+z,u(x)+Tw(x))dr, Tz,u(x))dr
.1
d
+ Y] (fi)u,xj(t,x ~1 Jo
+ TZ, u{x)) druXi,
j = 1,..., d.
Proof. From equation (9.42) for «(• + z) and u we get for the terms involving the functions / and g: a
^2 {(Mm (*' X + Z,U{X + z)) - (fi)Xi (t, X, U(x))j =1 d
d XI((/*)«(*.x + z,u(x + z))uXi(x + z) - (/,)„(*,x, w(x))u Xi (x)J i=\
- (g(t, x + z, u(x + z)) - g(t, x, u(x))) d
^2[(fi)xi(t,X
+ Z,U[X + Z)) - (fi)Xi(t,X
+ Z,u{x))\
i=l d
+ X ((/*)*i (*' X + Z> U(X)) - (Mm (*' X' u(x))) d
+ ^2{ifi)u(t,
x + z, u(x + z))uXi (x + z)
i=\
- {fi)u{t,x + z,u(x))uXi(x
+ z)\
d
X ( ( / * ) « ( * . x + z'«(a:))wxi(a; + z) - (/»)„(*, x + z, w(x))wXi(x)J i=i 1=1 d
X]{(fi)u(t,x
+ z,u(x))uXi(x)
- (/i)„(i,x,u(x))w Xi (x)J
1=1 1=1
((i, x + z, u(x + z)) - g(t, x + z, u(x)))
9.2. Scalar conservation laws
349
- (g(t, x + z, u(x)) - g(t, x, u(x))) =: h + • • • + I7. For the expressions I\,..., h=y2
h we have the following representation: {fi)xi,u(tix+ziu{x)+Tw(x))dTw{x)i
/ d
d
«i
i=\ j = l ' d i
I 4 = ^2(fi)u(t,x
+
z,u(x))wXi(x),
i=l 4 = 5 1 ^
/
(fi)u,xj(t,X
+
h = - I 9u(t,x + z,u(x) Jo d
TZ,u(x))dTUXi{x)Zj,
+Tw(x))drw(x),
„i
I7 = ~y2
gXj(t,x
3=1
+
TZ,u(x))dTZj.
J
°
We have r(t, x)z = I2+I5+I7 which immediately gives the expression for r(t, x) as given in the lemma. We obviously have IQ = q(t,x)w(x). Furthermore we get
h+h
+h d
„i
= V ] / (fi)xi,u(t,x d
+ z,u(x)
+Tw(x))drw(x)
.1
+ y2
(fi)u,u(t,x
+ z, u(x) +Tw(x))druXi(x
i=lJ° d
+ ^{fi)u{t,x
+
z,u{x))wXi{x)
i=l d
= yZ
„i
/
(fi)xi,u(t,X
+
Z,u(x)+Tw(x))dTw(x)
+ z)w(x)
350
Chapter 9. Applications d
to Concrete
Systems
.1
+ Y2
(fi)u,u(t,X
+ Z,u(x)
+ TVj(x))(uXi(x)
+
Tw(x))dTV)(x)
i=lJ° d
»\
+ V ^ / (fi)u,u(t, d
x + z,u(x)
+ TW(X))(1
- r)wXi(x)
dr
w(x)
»1
+ Y2
(fi)u{t,x
d
+z,u(x)+Tw(x))dTWXi(x)
»l
+ Y] / (fi)u(t,x
+
z,u{x))dTwXi(x)
i=lJ° „1
d
-Y]
/ (fi)u{t,X
+ Z,u{x)
+Tw{x))dTWXi{x)
i=lJ0 = (XI / d
-Q^(fi)u{t,X
+
Z,u(x)+TW(x))dTJw(x)
«1
+ V ] / (fi)u(t,x
+ z,u(x) + TW(X))
drwXi(x)
d
+ ^{f^u^it^
+ z,u(x) +rw(x))(l
- r)
drwXi(x)w(x)
i=i rf
/-l
/-l
/ (/t)u,u(*i a; + ^,w(a;) +cr-™(x))dc7TGfo-tt>Xi(x)i<;(x)
- V] /
i=l
where we have used / / {fi)u,u{t,x + z,u(x) + (TTW(X)) Jo Jo
n _
=
daTdr
{fi)u{t,x + z,u(x) + (fi)u(t,x
+ z,u(x)
£w(x))d£dr +£w(x))drd£,
Jo Je
= / (fi)u(t,x Jo
+
z,u(x)+Tw(x))(l-r)dT.
a
9.2. Scalar conservation
laws
351
9.13. Lemma. Assume that <> / e W 1 ' 1 (K d ) n L°°(K d ). Then there exist positive constants bRtT o^dcz,u,R,T > max(6.R]r,C2)i/I.R1T) such that equation (9.42) has for any fj, > c3^RiT « unique solution u G H2(Rd) n W 1 , 1 (R d ) n L°°(R d )
(9.57)
{n - 6 fil r)|Vw| L i < /i|V^| L i + d{iR:T\u\Li
Here we have set |Vu|/,i = Yli=i
+ mT).
I^KJL 1 -
Proof. For A; = 1,..., d and /i ^ 0 we set z = hek and u/fc) (a;) = u(x + hek) — u(x), x G Rd. Then, for 0 < t < T and x G Kd, we have q(t,x) = - / gu(t,x + hek,u(x) ./o
+
rw<(k\x))dT,
r(i, a;)2 = —h I GXk(t,x + rhek, u(x)) dr Jo .\
d
p(t,x)=
+ hT2
(fi)u,Xk(t,x
/ fu(t,x Jo
+ hek,u(x)
+
Thek,u(x))druXi(x), +TVj(k\x))dT.
We choose ip G C£°(R d ) with 0 < i>(x) < 1, x <= Md. Furthermore, let iph, h > 0, be the function denned in (A.8). Observing that u G i7 2 (M d ) we have (V>h(«(-))^,A«) ia = - ( V ( i M « ( - ) ) ^ ) , V u ) L a (9.58)
= - ( ^ h ( « ( - ) ) V ^ , Vu)L2
- ( M ( « ( - ) ) V u , Vw) L2
<-(^(«(-))V^,Vu)L2. We define * ^ ( r ) = J^iph{(y)da, r G M, and see that limhio4>h(o') — signer, a € R, and limh4.o ty, (r) = |r|, r G R. From V*ft(w(a;)) = iph{u(x))Vu(x), x e M.d, and (9.58) we get (9.59)
tyh(u(-)W,Au)La
< - ( V * f c ( u ( - ) ) , V ^ ) L 2 = (* h («(-)),A^) L 2 .
Taking /i 4- 0 we obtain (9.60)
(signuAu,$L2 < (|u|,A^)i2.
352
Chapter 9. Applications
to Concrete
Systems
We have also / 4>(x)iPh(w^(x))T^-(Pi(t,a>(fc)(x))
JRd
( 9 - 61 )
~[
dx
OXi
Mw{k}(x))^{x)Tp(t,x)w{k\x)dx
= - /
JRd
- / iJ>(x)^h(w^{x))Vw{k)(x)Tp(t ,x)w^k\x) dx. Jw By a proof analogous to that for (9.34) we see that (observe also that suppf/S is compact) lim / i>(x)ip'h(w(k\x))Vw(k\x)Tp(t,
x)u>(k\x) dx = 0.
Taking h I 0 in (9.61) we obtain d
(9.62)
Q
( ^ s i g n u ^ , ^ — (Pi(t,x)wW(x)))L2
= -(V^,p(t,-)\w^\)
L2.
i=l
Taking inner products with ipsignw^ in equation (9.56) (with z = hek and w — w^) we get using (9.60) and (9.62) M(^,k (fc) l) L 2 = M ( ^ sign «;<*>, 0(- + hek) - 4>)L2 + i/(tpsignw(-k\
Aww)[2 d
d
- (^signw^K^-JtM*'-)^)L2 %
i—l
+ U, I 9u(t,- + v
hek,u(-)+TW^(-))dT\w^\)
'L2
JO
-1
(9.63)
v
signur >, / GXk(t, • + Jo d
Thek,u(-))dT)L2 '
„i
- / i ^ s i g n w ^ . y ] / (/i) UlXfc (i,- + T/ie fc ,u(-))dTU a:i )
< n$, !»(• + hek) - <j>\)L2 + \h\(£R,T\u\Li
(vj,,P(t,-)k(fe)l)L2
+mT) d
-i
-/i(*0signu> ( f e ) ,V / (fi)u,Xk{t,-
+ Thek,u(-))dTuXi)
,
9.2. Scalar conservation
laws
353
where we have used assumptions (C12R) and the estimate (see also (C14R)) + rhek,u(-))\
dr)
<(>,/ \GXk(t,- + Thek,u(-)) - GXk{t,- + Thek,0)\dT^j + ( 1 M \GXk(t,- + <£R,T\U\LI
Thek,0)\dT^L2
+mT-
The second term on the right-hand side of (9.63) can be estimated as | (V^, p{t, •) \w^\)L21
f d / (J2 $*< l) k ( f c ) (x) | dx,
< a fi , T
s u p p ip
whereas for the last term on the right-hand side of (9.63) we get signw 1 ',2_. / {fi)v.,x Theu(-)) [fi)n.*L(t, + rhek, dr,uxi Xi)f k(t,- • + k,u(-))dT,u d
pi r-l
= -h(i>signw{k\Y^
,
- ^w(i))) 2
/ (fi)u,xk(t, • + Thek,u{-)) dr(uXi d
- fa s i g n a l , V v
L
fl
/ (fi)u,xk{t,-
+Thek,u{-))dT\w^\)
i=iJo d
<\h\daR,T'Ys
/L2
.
/
d
Uxi(x)--w{i\x)
rfa;
+ d a f i , T ( ^ , ^ |w ( f c ) |) L 2 .
supp V
Summing the inequalities (9.63) for k = 1 , . . . , d, dividing by \h\ and using the above estimates gives d
l
(fi- C T - d a f l , r ) f ^ ^ J - r w ( f e ) J
2
fc=i
d
/ SUppl/f
^ fc = l
i
Chapter 9. Applications to Concrete
354
da,R,T
f /
Systems
d \ 1 dx. '^2\Uxk(x) -w{k)(x)
J - f cI—1 =l suppi/)
From Lemma A.8 we conclude that lim^oCx, \h~lwW\)Li = (x, \uXk\)L2 resp. limft_,.o(X) \h~lw^k) - uXk\)L2 = 0 for any \ e C£°(IRd). Using this and taking ft^Owe get, for fi > max(c2,i,,.R,T, CT + dd^r), a fc=l d
(9.64)
fc=i
^ d J
L
fc=i d
- i=l
fc=l
suppi/)
+ d(£R,T\u\Li
+mT).
For r > 0 we set ip = aT, where aT is the function denned in (A.7). It is easy to see that iV'xJi" < | f7 z i |L°°A a n d |A^|x,«. < |A<7|Loo/r2. Using this and Fatou's lemma we see from (9.64) that Vu € L 1 (M d ;M d ) and (fi- cT - daR,T)\Vu\Li
< /i|V
+ mT)
for /x > max[C2^,R,T,CT + dciR^) and k = l,...,d. Therefore we have u G W 1 ' 1 (R d ) and the estimate (9.57) with bR>T = cT + daRtT. D 9.2.7. Uniformity with respect t o v. In this subsection we want to prove that equation (9.42) can be solved 'uniformly' with respect to v > 0, i.e., we shall show that there exists a constant JRIT > 0 independent of v such that equation (9.42) has a unique solution for any <> / G W M ( R d ) n i ° ° ( R d ) , t G [0, T] and n > 7i?,T- Note that the constant c\tV%R^T in Lemma 9.10 tends to oo as v 4- 0. At the end of this subsection we see that assumption (R2) holds uniformly with respect to v > 0. 9.14. Lemma. Let 4> G W1'1(Rd)nL00(Ud) be given. There exists a constant 1R,T > 0 such that equation (9.42) has for any fi > ^R)T, t & [0, T] and v > 0 a unique solution u G H2(Rd) n W1'1^) n L 0 0 ^ ) SMC/I i/iai «/so AM G L^R4) (i.e., u G dom^4i/(i)). Moreover, for 0 < A < 1/^R,T, we have the following
9.2. Scalar conservation
laws
355
inequalities: (9.65)
(l-Aor)MLi<MLi+A|&r|Li,
(9.66)
(l-Acr)Mi~ <
(9.67)
(1-A6B,T)|V«|LI
|4>|L~
< |V
Proof. Let
(A*|<£|Z,°°
+ A|foT|Loo,
and fix ^ > -fR>T := m&x(cT,bR,T,
+ |&rU°°) = (1
/x - cy
+ mT).
\
or) p,
/
(|
-|6T|L~)
\
p,
>
2ai, r , T ).
|<£|L°°,
J
choose p, > max(/i,c3jj/:iji7'), «o = 0 and consider the equations puj+1 - Av(t)uj+X
= p<j>+ (p-
fi)uj
Assume equation (9.68) has a unique solution for j = 0 , . . . , fc — 1 and that |uj|i~ < OCQ, j = 0 , . . . , k (which is trivially true for j = 0). Then we have also \{p/p)(j) + (1 - p/p)uj\Loo < Q 0 , j = 0 , . . . ,k. According to Lemma 9.13 there exists a unique solution uk+i G H2(Rd) n W1'1(Rd) n L°°(Rd) of (9.68). Moreover Uj, j = l,...,k + 1, satisfy the inequalities (9.47), (9.48) and (9.57). Using inequality (9.47) we get
- ^ ( ' - K H ^ (»-£)«. < -^
|ujU~
+ -
L~
+ - PTU°
P
(MI<£|L~ + | 6 T | L ~ ) ,
j =
0,...,k.
As a consequence we have k
|wfc+i|z,«> < y ] ( -
)
<(l_Azii\
(A#|L~
_
+
IML~)
(AxHi~ + |frr|L«>)=Q!o.
By induction it follows that (9.68) defines uniquely a sequence (ufc)fceN in # 2 ( R d ) n L^R*) n L°°(R'') such that (9.69)
|«fc|£»
(/i|^U~ + |6r|L~). fe = l , 2 , . . . .
Using (9.48) we obtain in a completely analogous way the estimate (9.70)
|u fc | L i <
(n\4>lLi + \bT\Li) - au p. — CT
k = l,2,...
.
356
Chapter 9. Applications
to Concrete
Systems
Using this and (9.57) we get also (9.71)
1 |Vu fc | Ll < „ _ , ,b_ _ ( M | V ^ | L I + d(iR,T\uk\Li M ~ R,T
+ ror))
for k = 1, 2 , . . . . Equation (9.68) for j = k and j = k + 1 together with (9.41) implies fi,\uk+i - Ufe|n = /x(ufc+i - Ufc, sign(u fc+ i = (Av(t)uk+i
uk))L2
- A„(t)uk,sign(uk+i
-uk))L2
+ (jl- H)(uk -ii f e _i,sign(u f c + 1
-uk))L2
< (A - /*)!"*: - Mfc-lUi + CT\uk+l - Uk\Li resp. (9.72)
K + i -ufc|Li <
| u f c - u f c _ i | L i , fc = l , 2 , . . . .
From this we immediately see that there exists a n £ L 1 (K d ) with (9.73)
lim \u - u fc | L i = 0. k—>oo
The estimate (9.43) with fi = jl is valid for the solutions of (9.68), (9.74)
v\Vuk+l\\i
+ (/t -
CH,.R,T)K+I|£2
< AK+l|z,2
f*+(1-f)»i, + 5«"' M
v
M
For K = max(ao)ai) we have |ufc|Li, |ufe|L°° < K, k — 0 , 1 , . . . , which by Lemma A.7, b), implies that \uk\Li < K, k = 0 , 1 , . . . , for some K > 0 which only depends on K. This and (9.74) imply that (9.75)
| V u f c | i 2 < # i , fe = l , 2 , . . . ,
where Kx = v-xK{n\
< aR,Tdl/2\Vuk\L2
(9.76)
l 2
2
< aR^d l K\'
+ (d+ l)aR}T\uk\L2
+ \bT\L2
.
+ (d+l)aR,TK
+ \bT\L2
for 0 < t < T and k = 1,2,... . From (9.68) we get, for k = 0 , 1 , . . . , Z / | A u / c + i | L 2 < \B(t)uk+i\L2
+ Al^fc+lU 2 + H\4>\L2
+ {&-
M)KU2,
which together with (9.76) implies that (|Aufc|/,2) is bounded. Since the d support of any ip e Co°(R ) is contained in some ball we get (see [L-U, p. 179])
9.2. Scalar conservation
laws
357
This implies, by density of C^{Rd) (9.77)
\u\2H2 < «
2
in
H2(Rd),
+ |A«| 2 2 ,
u£
H2{Rd).
Therefore we see that the sequence {uk)keN is also bounded in H2(Rd). Hence there exists av £ H2(Rd) and a subsequence (UnJkgN of (ufc)fceN such that (9.78)
w-\imunk=v
in
H2{Rd).
k —»oo
Since the restriction of a bounded linear functional on L2(Rd) resp. on HQ (Rd) to iJ 2 (K d ) is also bounded on H2(Rd), we get from (9.78) also w- lim^oo u„k = v in L2(Md) resp. in H^(Rd). From this and (9.73) we conclude that v = u. These arguments show that for every subsequence of (uk)ken there exists a subsequence which converges weakly in H2(Rd) to u. Consequently we have (9.79)
w-limufc=u
in
H2(Rd).
k—>oo
For r > 0 let Qr be the open ball with radius r and center at the origin. From the compact embedding H2(Qr) Q i? 1 (O r ) (see for instance [Wl, Theorem 7.2]) and boundedness of (uk)keN in H2(Qr) we conclude the existence of a subsequence (ttnfc)/feeN and of a function v € i/ 1 (fi r ) such that linifc^oo \u„k — v|fl-i(nr) = 0- Considering r = 1,2,... and taking consecutively subsequences we see that there exists a subsequence (unk)keN of (iifc)fceN and a function i> : R d ->• K. with v \nT<E H1^^ for all r > 0 such that linifc^oo \unk - v\Hi(nr) = 0 for all r > 0 and lim^oo u„fe(x) = v{x) a.e. on R d . Since we have limfc_>00 \unk — U\LI — 0, we see that v = u. This implies that (9.80)
lim uk(x) = u(x)
a.e. on Rd
and (9.81)
lim \v,k — U\HI(CI \ = 0
for all r > 0.
k—nx>
From the representation B{t)uk - B(t)u = / Jo
Gu(t,-,u(-)+T(uk(-)-u(-)))dT(uk-u) d
E
.i
/ (/»)«,«(*--^(O+^feC-) - " ( • ) ) )
d
(fi)u(t,-,uk(-)){(uk)Xi »=i
-uXi),
d,T{uk-u)uXi
358
Chapter 9. Applications to Concrete
Systems
(9.75) and assumption (C11R) we get \B(t)uk - B(t)u\L2(nr)
<(d+
l)aRiT\uk
-
u\L2{nr)
\uk(x) - u(x)\2\uXi{x)\
dx\
+ daRtrWk - u|ifi(n,.)Using boundedness of ( I ^ I L C O ) , dominated convergence theorem)
N,
(9.80) and (9.81) we get (by Lebesgue's
lim \B(t)uk — B(t)u\ ,,,„ . = 0
= 0 for all ip e C§°(Rd).
which implies lim^oo JRd (B(t)uk - B{t)u)ipdx density of C$°{Rd) in L 2 (R d ) we get w-lim B(t)uk = B(t)u
for all r > 0, By
in L2(M.d).
k—foo
Using this together with (9.79) in (9.68) we get jlu — Av{t)u = fixp + (jl — /J,)U, i.e., /j,u — Av(t)u = \M$>. In order to prove that u e Wl,1(Wi) we first observe that (9.73) and (9.81) imply limfc_+00 \S7uk — Vw| L i(o r ) = 0 for all r > 0. Taking r = 1, 2 . . . and consecutively subsequences we arrive at a subsequence (unjJfcgN such that lim fc _, 00 |(Vu„J(a;) - (Vu)(a;)| Rd = 0 resp. fclimJ(Vu„J(a;)|R
a.e. on R d .
= |(Vu)(aO| Rd
By Fatou's lemma and (9.71) we obtain Vw £ L 1 (M c( ;R d ) and |Vu| L i = / lim \Vunk(x)\ J k—• oo
ddx
< liminf
fc—>oo
\(Vunk){x)\ J '
(9.82)
m
ddx
»«* <
r—(MIWIL OR,T v
1
U
+ ^.R,T| U1
+mT).
VFrom equation (9.42) we get the representation
/
d
uAu = fi(u - 4>) + J2(fiUt,
; «(•))«*, - (G(t, •,«(•)) - G(t,., 0)) - G(t, •, 0).
Using (C11R) resp. (9.24) and (C13R) we see that d
\^2(fi)u{t,-,u(-))uXi i=l
9.2. Scalar conservation laws
359
and \G(t,;u(-))-G(t,;0)\
=
|G(t,-,0)| L 1
f
Gu(t,;Tu{-))dTU
< (d + £1
Jo <\br\Li.
l)aR,T\u\Li,
This proves Au G L a (R d ) and consequently u G dom.A„(£), 1/ > 0, 0 < t < T. In order to prove the inequalities (9.65) - (9.67) we set JJL = 1/A and first get from (9.73), (9.70) immediately (9.65). Using (9.80) and (9.69) we obtain (9.66). Finally (9.67) follows from (9.82). • Using properties of the space BV(Rd) more general case where (j> G D:
we can extend Lemma 9.14 to the
9.15. Proposition. Assume that
(1 - AC T )|M|L~ < \<J>\L°° + A | 6 T | L ~ , (1 - A6 f l ,r)|Vu|ti < \
+ mT)
/orAe(0,l/7fi,T). Proof. We choose <> / G D and fix /i > 7ft,x, * G [®,T]. Then there exists a sequence (4>n)neN C C°°(]Rd) such that (see [Am-F-P, Theorem 3.9 and p. 124]) lim |<£-
n m
I^J.BV =
lim
lim
\>n\L°° =
|(/>|L~.
IV^^i
= \>\BV,
ro—>-oo
From equation (9.42) for un,um \un ~ Um\Ll
and (9.41) we get < fl(n - CT)~l\<j)n
-
<j>m\Li,
which shows that (un)nen is a Cauchy sequence in Ll(Rd). Hence there exists a function u G ^(W1) with lhrin^oo \u-Un\L1 = 0. This and (9.66) immediately imply (A* - cT)\u\Lx < n\(f>\Li + \bT\Li.
360
Chapter 9. Applications
to Concrete
Systems
For a subsequence which we again denote by (un)neN we have linin^oo un(x) = u(x) a.e. on Rd. This together with (9.65) gives \u(x)\ = lim |w„(a;)| < liminf |un|z,°° n—»oo
n—»oo
< ( / i - c T ) _ 1 lim (/i|0nU~ + |&T|L°°) = ( M - C T ) - 1 ( M | 0 | L ~ + | 6 T | L ~ )
for a; G R d and consequently (/i - cr)|ix|i<» < MI
(MI0I
From equation (9.42) and the estimate (9.45) we obtain (9.85)
^|VM„||2
+ (n - altRjT)\un\2L2
This implies (fi - a,iiR,T)\un\2L2
< n\un\L2\(f>n\L2 + -\bT\2L2.
< fJ.\un\2L2/2 + \<j>n\2L2/2 + \bT\2L2/2 resp.
{fi - 2ai >fl , T )|wn||2 < n\
9.2. Scalar conservation
laws
361
Tmax only such that, for A G (0, l/7it,T m „), (9.86)
- (
resp. (9.87)
- (
Proof. We only have to verify the inequalities (9.86) and (9.87). However these inequalities follow immediately from (9.83). We have a = max (CT
(9-88)
+£RT
, &RT
),
b = |6r ma jLi + l&TmaxU°° + rnTm^ d
c
- = Tm*x and
resp.
b=\bTmax\L^.
n 9.2.8. The limit v \, 0. We start now to consider problem (9.20) (still with the truncated functions fn, #) as a limiting case of the viscous problems (9.25) for v I 0. 9.17. Lemma. For k G K, ^ G C£°(IRd) with ip(x) > 0, x G R d , and u G H2(Rd) n dom ^ ( i ) we /iave (sign(w -
k)Av{t)u,^)L2 < (sign(u - k)(f(t,-,u)
~ f(t,;k)),V$)
L2
(9.89) (sign(w - A;) [g(t, •, u) - ^ ( / i ) * i ( i , -, k)j, $) + v(\u-
k\,Atp)L2.
Proof. Let u G H2(Rd) n dom A„(i) be given. Using Q
ru(x)
-z— OXi
iph{s-k){fi)u(t,x,s)ds Jk fu(x) ^h
{u{x)-k)(fi)u(t,x,u(x))uXi+
/ Jk
iph(s -
k)(fi)UtXi(t,x,s)ds,
362
Chapter 9. Applications
to Concrete
Systems
where iph is the function defined in (A.8), we obtain
d
d
(iph(u -ft)£ ] -QTM^ •'M)' ^) L 2 l
i=i
d
+ (ij)h(u - ft) ^2(fi)Xi
{t, -,u),i)J
i—1
(9.90)
- ( / Ms
- k) £ ( / 0 „ , * , (t, •, s) da, ^ )
Jk
^
= ~y2
p
2 L
i=l ru(x)
/
^h{s-k){fi)u(t,x,s)ds^Xidx d
+ (^ph(u-k)^2{fi)Xi(t,;u),ii)j
2
i=l
- (/
^h(s ~ k)Y^(fi)v,xi(t,-,s)ds,'ipJ
.
Observing rk±h
p±l
/
iph{s - ft) ds = h I
Jk
JO
and \fu(t,x,s)\Md
ip(T)dr-^0
ash 10
< dl/2a,RfT for s 6 R and t G [0,T] we get
'l(x)
lim / hio j
iph(s-k)(fi)u(t,x,s)ds k
rk+h
= lim(/ h ±° Vfc
»u(x)
i/jh(s-k)(fi)u(t,x,s)ds+
sign(u(x) Jk+h
ru(x) = sign(w(x) - ft) / (fi)u(t,x,s)ds Ik Jk sign(w(z) -k)(fi(t,x,u(x)) fi(t,x,k))
k)(fi)u(t,x,s)ds) '
9.2. Scalar conservation
laws
363
in case u(x) > k resp.
lim / Ho Jk
iph(s~k)(fi)u(t,x,s)ds
= lim(/ Ho\Jk
iph(s-k)(fi)u(t,x,s)ds+
sign(u(x) Jk_h
k){fi)u{t,x,s)ds) )
*u(x)
- sign(u(:r) - k) I
(fi)u{t, x, s) ds
Jk
= sign(w(x) - k)(fi(t,x,u(x))
-
fi(t,x,k))
in case u{x) < k. Using this (also for (fi)UlXi h 4. 0 in (9.90) we obtain d
(sign(u -k)^2
instead of (fi)u) when taking
Q
Q^rJi(t,;u),-0J i=l
=-(sign(«-*:)(/(*, .,«)-/(t,.,fc)),V^)j d
+ (sign{u -
k)^2(fi)Xi{t,x,k),-ip)^. t=i
Observing that the proof for the estimate (9.60) works also for u(-) - k instead of u we get (sign(u-k)Au,tp)L2
= (sign(u - k)A(u - k),4>)L2 < (|u - fc|, Ar/S)L2.
Collecting the representations resp. the estimate given above we finally obtain (9.89). •
9.18. Lemma. For any solutionu € H2(M.d)ndomA„(t) where 4> G I, 1 (R d ) n L°°(R d ), we have
/ \u(x)\ Hx
lim >oo x
\ \s.d>r
dx — 0
of{I-\Av{t))u
uniformly for v > 0 and 0 < t < T.
= >,
364
Chapter 9. Applications
to Concrete
Systems
Proof. For ^ <E C£°(IRd) we get the estimate (Av(t)u,ipsignu)L2
= (vAu,ipsignu)L2
+ (g(t, •,u),-0signu) L 2
~ (5Z^^^'-' M )'^ Si g nU ) L 2 < v(\u\,Aip)L2 +
+ (g(t,-,u)
-g(t,-,0),ipsignu)L2
(g(t,-,0),i)signu)L2 d
Q
{^2 ~Q~. (&&' •' u ) - Z^*-'' °)) > ^ s i S n u) i—1
(9.91)
(^(/i)xi(i,-,0),^signujj
L2
+
(G{t,;0),ipsignu)L2 d
d
In order to estimate the last term we use the representation -[fdt.-.u)(9.92)
f,-(*.-.U)).<M>»,(u),
- ( / (/iJuCt.-.TuJdTU.^VfcW)^ + ( / (fi)u{t,-,Tu)dTu,i>ip'h(u)uXiJ
2=Ih
+ IIh,
where V^, h > 0, is defined in (A.8). For 7/j we get \imlh=( h\a
{fi)u(t,-,Tu)d,T\u\,ri)Xi) \JQ
/ L2
< a H i T |^ X i | L °=|u| L i.
By a proof completely analogous to the one for (9.34) we see that lim IIh = 0. ft|0
Thus we get from (9.92) the estimate d
(9.93)
~
- ^ ( ^ : ( / i ( t ) - , « ) - / i ( t , - , 0 ) ) , ^ s i g n u ) i a
9.2. Scalar conservation laws
365
For the other terms in (9.91) we have the estimates
(/
ff«(<,-,Tu)dr|u|,VJJ
2
(G(t,-,0),ipsignu)L2
< (bT,ip)L2.
From these inequalities together with (9.93) and (9.91) we obtain, using also (I - \Av(t))u = & (\u\,i>)L2 - {\<j>\,i>)L2 < Ai/|A^| L «.|u| L i + Acr(|w|, VOL2 + A(6T, I/OL2 + AaRiT|VV>|L~ |u| L i
resp. (9.94)
(1-ACT)(|«U)L»
<(|^U)L2+A(6T,V;)L2
+ A(P|AV)|L» + ai?,r|VVi|L~)|u| L i
for 0 < A < 1/CT- For K > 0 we choose a function x« € Co°(K d ) satisfying 0 < XKOT) < 1, a: G R d ,
XK,\X)
=
JO
for |x|Kd < 1/2 and |x|Rd >
\
c
..
1
^
\
\
2K,
^
I I for 1 < \x\^d <
K,
| V X K | L ° ° < | V X I | L ° ° and | A X K | L ~ < | A X I | L ° ° for K > 1. For r > 0 we set
•0 = VV.KC^) = XK.{.XIT)- It is easy to see that V ^ r i K ( i ) = r _ 1 V K (a;/r) and A^v K(:r) = r " 2 A ^ ( a ; / r ) . Given e > 0 we choose ro > 0 such that A(^|A
X K
U~+^
I :
|VX
K
U~)|M|LI
<e
for r > ro and K > 1. This and (9.94) imply (1-Ac T )(|u|,Vv, K ) L 2 < (| ro and K > 1. Taking K —>• oo we have (1 - ACT)
/
|w(aO|cte
MKd^r
<
/
|>(a;)|da;+
klad^/2
/
|&T(£)|
<£r + e,
r > r0,
kUd>r-/2
and consequently lim r—>OG
\u(x)\dx // M*)l< \x\Rd>r
= 0.
D
366
Chapter 9. Applications
9.19. Proposition, a) For any 4> £ D, A G (0, 1/^R,T) exists a u G D such that (9.95)
u = lim(7 -
to Concrete
Systems
and t € [0,T] there
XAv{t))'l4>.
v\.0
b) For <j>j G D, A G (0, l/7ij, T ) and * G [0,T] H «_,- = lim^ 0 (i" - AA,(i))"Vj, j = 1,2. Then the estimate (9.96)
(1 - Ac T )|«i - u 2 | L i < 101 -
is true. c) Forcf)GD,Xe (0, 1/7H,T) and t G [0, T] H u = lim^4,0(7 - XAu{t))~l(t) and set v = (u — 4>)/X. Then we have M ) L 2 = (/(*, •,«(•)), V ^ ) L 2 + ( 5 ( * , - , « ( - ) ) » L 2 /ora//VeCg°(]Rd). Proof, a) For any 0 G L>, A G (0, l/7i?,:r) and t G [0, T] we set u„ = (I - XA^t))-1^,
i/>0.
From Lemma 9.18 we have (9.97)
lim
/
\uv(x)\dx
=0
uniformly for u > 0.
For any i , f t e l l i we have the representation uv(x-\- h) - uu(x) = / (Vu„(x + r/i)) Jo which implies the estimate / \uv(x + h)-uv(x)\dx
JRd
<\h\Rd I jRd
I \VUV{X-\-TK)\
hdr,
ddrdx
JO
= \h\R
= 0.
9.2. Scalar conservation
laws
367
This and boundedness of (|Vu„|jr,i) 0 imply that u £ BV(Rd) (see Lemma 9.8, b)). Since a subsequence of {uVn)nen converges a.e. on R d to u, we obtain from boundedness of {\UU\L'X')1/>0 that u £ L°°(Rd). Thus we have shown that u£ D. b) For positive sequences {vj,n)neN with lim^-ycx, v^n — 0 let uVj,n £ H2(Rd) n domAUjn(t) satisfy
We assume that limn^oo uVl n — u and limn^oo uV2 — v. From Lemma 9.17 we see that for any k £ Rd and */> G C£°(]Rd) with */>(a:) > 0, x G Kd, we have /i(sign(u^. n - fc)(*S-,n - (t>j),$)L2 < (sign(uVjn (9-98)
- k)(f(t,-,uVjn)
-
f{t,-,k)),Vij))L2
d , / + |siKn(tt„, _ - fc)(<j(£, •,«„, _) - > f fi)r{(t,
x _v •,k)),ip)
i=l
+ Vj,n(\Uvi,n-k\,A'4>)L2,
J = 1,2.
We choose \ e C^°(Kd x R d ) with x(x,y) > 0, x,y £ Rd, &x y £ Rd and set fe = uV2n{y), ip(x) = x{x,y). Then we obtain from (9.98) the estimate / sign(u„ lin (:r) - u^y^f^u^x)
- <^i(a;))x(a;,j/)
- (f{t,x,uVXn(x))
-
f{t,x,uV2tn{y)))^xX{x,y)
- (g(t,x,uVln(x))
- ^2(fi)xi(t,x,uV2n(y))jx(x,y)J
d
dx \uVln{x)-uU2n{y)\Axx{x,y)dx.
We integrate this inequality with respect to y and add the inequality we obtain in an analogous way if we take (9.98) with j — 2, y instead of x as the variable of integration and k = uVln (x), tp(y) = x(x, y)- As a result we get / / Js.d Jmd (9.99)
an{x,y)$n(x,y)dxdy
< vi,n /
JUd
/
J]ftd
+ V2,n / J&d Jwd
\u„Un(x)-uU2n(y)\Axx(x,y)dxdy \ul/ln{x)-u„2n(y)\Ayx{x,y)dxdy,
368
C h a p t e r 9. Applications
to Concrete
Systems
where, for (x,y) G Md x Kd, an(x,y)
= s\gn(uVl
uV2n(y))
and $„(x,2/) = n{uVln{x)
- uV2
- (g(t,x,u„ln(x))
-
My)))x{x,y)
g(t,y,uU2n(y)))x{x,y)
d
+ ^2((f^xi (*>x' w^,„ (y)) - (fihi (t, y, ««/!,„ {x)))x{x, y) i=l
- (f(t,y,u^n(y))
- f(t,x,uV2n(y)))
Vxx{x,y)
- (/(*, y, uVun (x)) - f(t, x, uVun (x))) Vyx(x, y) - (f{t,x,uVlin{x))
- f{t,y,uV2:n{y)))
(Vxx{x,y)
+
Vyx(x,y)).
We set Un(x,y) = uUln(x)-u„2n(y), U(x,y) =u(x)~v(y) and define $(x,y) by replacing uVl n(x) resp. u„2n(y) in the expression for $n(x,y) by u(x) resp. v(y). Then it is easy to see (using assumption ( C I I R ) for gu, fu and fXi,u) that lim$„ = $
and
n—>oo
in L^R^ x l d ) .
lim Un = U n—>oo
Moreover we have otnlUnlL1 (RdxRd) G FUn, where F denotes the duality mapping on Lx(Md x Md). From the result stated in Remark 1.1 on page 3 we see that there exists a subsequence (ank)ken such that w* - l i m ^ o o ank = a for some a G FU. If we take (9.99) for these subsequences and let k —> oo, we obtain (9.100)
/ JRd
/ a(x,y)$(x,y)dxdy
< 0.
JRd
For later use we note that a{x, y) = sign(u(z) - v{y)), if u{x) ^ v(y), \a(x,y)\
For r, e > 0 we set X{x,y) = ar((x + y)/2)pe((x
BdxtJ
- y)/2),
(x,y) G WLd x Rd,
where ar is the function defined in (A.7) and pt, e > 0, is a family of mollifiers (see Appendix A.3). Using V*x(z,2/) = \vor{(x
+ y)/2)pe((x
- y)/2)
9.2. Scalar conservation
laws
369
+ 2°r{(x + Vvx(x,y)
= ^Var((x
+
y)/2)VPe({x-y)/2), y)/2)pt((x~y)/2)
'^r{{x
+
y)f2)Vpe({x-y)/2)
and setting x = £ 4- 77, y = £ - 77 we get from (9.100) the estimate (9.102)
0> /
/ a(x,y)$(x,y)dxdy
= Irte+IIrie
+ IIIr,e,
r,e>0,
where Ir,e=2d
I Ir{rj)pt{r))dri
Ir(v)=
I a{£ +
with
r]A~v)
X (/i(li(£ + 7/) - l>(£ - r/) - (
d£,
f Jr(7])pe{r])dr] with f a(£ + ri,S-Ti)(f{t,t-nMt
+ v))
and //!,,,= /
/
a(a;,i/)(2((/0x i (*,a:,w(l/))-(/i)x,(t,I/,u(a:)))p e ((a:-ff)/2)
+ f(t,x,u(x)))
Vp£((x - y)/2)yr({x
+ y)/2)
dxdy.
In the following 'const.' denotes a positive constant which may depend only on R, T and d. For the integral Ir<€ we have (9.103)
limsup7 rje > lim inf I r (r/), ej.0
'
MHd|0
r > 0.
370
Chapter 9. Applications
to Concrete
Systems
Using
g(t, Z + v, «(£ + v)) - 9(t, Z-v, v(£ - v)) = [ 9*(t,Z + V, v(Z ~V)+ T(U(£ + V)~ «(£ " V))) dr («(£ + 77) - «(£ - r?)) Jo + g(t, £ + 7?,«(£ - ??)) - s(t, f -»?. «(£ -»?)),
^eR
d
,
assumption (C12R) and also (9.101) we get Ir{v)=
f
Uv~
[
9u(t, £ + v, TJ(<£ - T?) + T ( U ( | + 7?) - v(£ - T?))) d r )
x W£ + v) -a(£
+ r,,Z- v)(»(MZ
+ V)~ Mt
+ g(t, Z + V,v(Z-v))~
-v(£-v)\
~ V)) 9it, £ + 77, v(Z -V)))j
MO
di
> / ((/i - cr)|«(C +»?) - «U ~ v)\ ~ / # i ( £ + r?) -
v{i - 7?))|)a r (0 d£.
By Kolmogoroff's compactness criterion (applied to the singletons u and v) we see that \u(-) - «(• + 77)|Li -> 0, |u(-) - i>(- - 7?)|Li -> 0 as |r/|K /
((/i-cr)|«(O-t;(O|-^i(O-02(OI)^(O^-
Consequently we have (see also (9.103)) that for any r > 0 (9.104) limsup Jr>£ > 2d /((/* - cT)\u(0
- v(0\ ~ MJ<MO - & ( 0 l ) M 0 # •
R<*
For the integral IIr,e we have the estimate limsup|i7 r i e | < 2d~1 limsup Jr{rj) «i0
M K d|0
2 d - 1 l i m s u p / |/(*,^-»7,«(4 + ' 7 ) ) - / ( « , e + ' ? , ^ - ' 7 ) ) | R , | V C T r ( 0 | R - ^ < i2"- 1 |Va| L cc /
|/(i^,«(0)-/(i,e^(0)k^e
9.2. Scalar conservation
laws
371
Using assumption (C11R) for /„ we get
l/(U,«(0)-/(*,£. f(0)li*<
/ Jo
\fu(t,Z,v{Z)+T(u(a-v(t)))\wdT\u(Z)-v{Z)\
^eR d ,
which implies ] i m s u p | i 7 r £ | < -const. \V
lim'mf IIr €|0
e
'
> — c o n s t . |V<J|Z,~|M — v\Li. r
Observing d
1 d we obtain IIIr,e = [
/ «(!,») 2 ( ( ( / 0 x i ( * . a:, «(»))-(/<)**(*.».«(a:)))p e ((a:-y)/2) - [fi{t,y,v(y))
- fi(t,x,v(y))
+ fi(t,x,u(z)))-fa.P^x
-
fi(t,y,u{x)) ~ y)/2))ar{{x
+ y)/2)
dxdy.
Using differentiability of / we get the representations: (/*(*, V, v{y)) - fi(t,x, v(y)))-^r.Pe{{x d
y(y))p€((x - y)/2)
p.
l
.1=1
+ ((fi)xt(t,y,
- y)/2) - (ft)Xi(t,x,
v(y)) - (fi)Xi(t,x,
v{y)))pt((x
- y)/2)
• 5Z((/i)xi(*.a;*,v(y)) - (/0*j (*>3/> «(»)))(%• - Xj)—pc{(x 3=1
°Xi
- y)/2)
372
Chapter 9. Applications
to Concrete
Systems
and (fi(t,y,u(x)
- 2/)/2) - {fi)xt(t,y,u(x))pe((x
- fi(t,x,u{x)j)-fa.Pe{{x
d
-
y)/2)
Q
= E ^ ) x , ( t , t f , « ( a : ) ) ( ( % - - x^—p^x d + ^2((fi)xj(t,x**,u(x))
- y)/2) - S^p^x
-
y)/2))
Q
- (fi)Xj(t,y,u(x)))(yj
- x^—pzdx
-
y)/2),
where 6ij is the Kronecker delta and x*, x** are points on the line segment joining x and y. Observing (yj -
X
^Q^PZ((X
~ 2/)/ 2 ) " sijP*((x
- y)/2)
= {ivj - xi)Pe{{x
-
y)/2))x.
we get
where «
d
d
/
/ a(s,y) £ £ ( ( / < ) * , (*,*/.«(*)) - (/<)*,(t,y,v(y))) x
42}=
f
(
f a(x,y)ar((x d
{(Vj - Xj)Pe{(x -
y)/2)ar{y))x.dxdy,
+ y)/2)
d
E E((/Ox,-(«,2/,«(»)) - (/Ox,(t,x*,v{y)) + i=i
(fi)Xj(t,x**,u(x))
j=i
- (/i)x3-(<, J/,u(a;)))(j/j - Xj)—pe({x
- y)/2)
d
.
+ E(^)xi(*,a;,«(l/))-(/ik(*,l/,«(!/)))/>£((a:-y)/2))da:dy i=l
+ /
/
/ a(a;,j/)(<7r((a; + y)/2-(r 7 .(y)) x
EE(^)x,(t,y,u(x)) i=i
x
. — J\y
*
\
£}f»
-
{fi)xj(t,y,v{y)))
3=1
{{yj - xj)Pe((x - y)/2)j
dx dy
9.2. Scalar conservation
laws
373
For the integral A n e we use the estimates < aRtTd1/2\y
|(fi)xi{t,y, v{y)) - {fi)Xj{t,x*,v(y))\
\{fi)xj{t,x**,u(x))
- x*\Rd 1/2
<
aRiTd \y-x\md,
- {fi)Xj{t,y,u(x))\
<
aR,Td1/2\y-x\Ud,
- (fi)Xi(t,y,v(y))\
< aR,Td1/2\y
|(fi)xi{t,x,v(y))
- x\Md
in order to get \Ar,e\ < const. /
/ ar((x + y)/2)\y - x\Rd (dp£{(x - y)/2) d
d
r.
2
+ £X>i-*ii|^^((a:-tf)/2)|)da;d0 i=i j=i d
= const.
/ H\Rd<2r
ar(0
/
d
|T/|Ed (dp€{rj) + ] C H ^jl gTP^)
\n\Kd<e
)
dr d
l Z-
i=lj = l
It is easy to see that, for some constant c > 0 which does not depend on e or i, 9
(9.106)
< A
c < "d^T.
|»7i| < e,
i=l,...,d.
This implies Ar,e\ < const, e / / [p€{rj) + -J^
^
\rjj\j drjd£.
ME
Observing / (9-107)
\rjj\dri = 2
H/d<£
•••
/
J/J-CJT/J
d»7i • • • <%_i d/fr+i • • • dr\d
/ eJ
^
• - °
nd-l
d+l
J = l,...,d,
we get |-^r,e| < const, e
/
0>(£) d£ = const, r e.
ieis
Thus we have shown (9.108)
l i m A r e =0 e|0
for all r > 0.
374
Chapter 9. Applications
to Concrete
Systems
For the integral Br>e we use 1 f1 \°r{{x + y)/2) - or(y)\ <-
d
Id Y\\-Z-°r{y
1, < const. r
I + T(X - y)/2)\ \xi - yi\ dr
\x-y\Kd,
| ( / i ) ^ ( i , y , « ( a ; ) ) - (fi)xj(t,y,v(y))\
< aR%T\u(x) - v(y)\ < aR,T(\u\L°°
+
\V\L°°)
and const I ((%• - xj)pe{{x - y)/2))x. | < \yj - Xj\-^TT + kjPe((x
-
y)/2)-
This gives the estimate
|BP,e| < ^ ^ ( | « U ~ + ML~) JJ(dPe(r]) + J2J2 1^1 | J ^ H ) dr>dZl«l R d<2r M R d<e
«=lj=l
Analogously as for Ar^€ we see that also lim Br e = 0 for all r > 0. ej,0
This together with (9.108) proves (9.109)
limJ,^ = 0 . ej.0
'
For the integral JrJ we first observe that a(x, y) can be replaced by sign(w(a;) — v(y)), because the factor of a(x, y) is zero for u{x) = v(y). Therefore we get
4V = »£= i £j = i4 ^ ) > where /
kj(r^)
/ sign(u(z) -v{y)) x
((fi)Xj (t, y, u(x)) - {fi)Xj (t, y, v(y)))
((Vi - xj)Pe((x -
y)/2)ar(y))x.dxdy.
We set q(u) = {fi)Xj{t,y,u) and Q(u,v) = sign(u - v)(q{u) - q{v)), u,v e R. The function q satisfies a Lipschitz condition with Lipschitz constant CLR TObserving that /
/ Q(u{y)^'(y))((yj-Xj)pe((x-y)/2)ar(y))
dxdy = 0,
9.2. Scalar conservation laws
375
because / ((%• - Xi)pt{{x - y)/2)ar(y))
for all y G Rd,
dx = 0
we get
\v\Rd<2r \x-v\Rd<* x
{(Vj - xj)pe((x -
y)/2)ar(y))xidxdy.
From Lemma A.13, the definition of ar and the estimate (9.106) we obtain | / i j ( r , c ) | < const.
JJ
\u(£ + rj) - u(£ - r,)\ {^\Vj\
+ Pe(v)) d^drj
\H-T,\sd<2r
< const. J
(-zfi\Vj\
+ Peti))
J
W%d<*
WZ +
v)-v(Z-ri)\dZdTi.
\(\Rd<2r+e
By KolmogorofT's compactness criterion we have lim \u(-+ rj) - u(-)\Li = lim \u(- - rf) - u(-)\Li - 0. |»?|Rd4-0
IllgdJ-O
Therefore, for arbitrary K > 0, we can choose eo £ (0,1] such that l u (£ + V) - u (£
/
_
v)\ d£ < K for all rj with |T/|Rd < e 0 .
|||Rd<2r+e This implies (using also (9.107)) \k,i{r,e)|
< const.K
J
( ^ " M + Pe(v)) M
Hnd
-(^TT
/
\rii\drl
+
1 K
)
\v\s,d<e
< const, K
for 0 < e < eo.
Consequently we have limIij(r,e)
= 0,
r > 0, i,j =
l,...,d.
This proves lime|o JrJ — 0 for all r > 0, which together with (9.109) implies (9.110)
lim IIIr,c = 0 c4.o
for all r > 0.
Chapter 9. Applications
376
We choose a sequence (rn)ne^
to Concrete
Systems
with rn > 0 for n € N a n d limjj.+oo rn = oo.
For each n = 1 , 2 , . . . we choose a sequence (e£)ken
such t h a t e^
> 0,
k = 1, 2 , . . . , limfc^oo e[.n) = 0 a n d limsup Irn,e = Ihn J
<«) for all n = 1, 2 , . . . .
From (9.102) for r = rn a n d e = e^' we get 0>limsup(7
e
K—KX)
= lim 7 r
fc—>00
w+77 K
e(~>+777 K
«
(n) + lim sup 7 / "'£fc
t—kr^i
£<»>)
(n) + lim 777 <„>
rrl 6
' fc
r
fc—»00
"> £ fc
> lim sup Ir„,e + lim inf 77^ r jn) fc->00
€|0
>2d [
n^i.
((v-cT)\u(!i)-v(0\-»\h(0-M0\)°rn(0dli const. |VCT|L«.|W — t>|i,i,
n = 1,2,...,
where we have used (9.104), (9.105) a n d (9.110). Taking n -*• oo we finally get (9.111)
(/i - CT)\U - v\Li < ll\l -
c) We prove now statement a) of t h e proposition. Let
\f{t,x,uv(x))
<
Ll{Rd).
f(t,x,u(x))\ /
\fu(t, x,u(x)
+ T(UV(X)
- u(x)))\Mdd.T
Jo < d1/2aR,T\uu{x)
- u(x)\,
xGRd,
implies lim|/(t,-,«„(•))-/(t,-,u(-))|Li=0
\UV(X)
-U(X)\
9.2. Scalar conservation laws
377
and consequently (9.112)
lim(/(i, -,«„(•)), V^)L2
= (/(*,-,«(•)). V ^ ) L 2
for all I/J £ C0oo(R
= (g(t, -,«(•)), V) L 2,
V> e (70°°(Rd).
l i m i / ( A u ^ ) i 2 = - l i m z / ( V ^ , V^) L 2 = 0 ,
^ € C0°°(Md),
lim(g(t,;Ul/(-)),ip)L2
Finally we have (9.114)
because (|Vuj/|z,i)l->o is bounded (see part a) of the proof). From (9.112) (9.114) we see that \im(Av(t)uv,i/})
2
= lim((/(t,-,u 1 / (-)), V ^ ) ^
+ (5(*, •, M O ) , 0L2 + K A u *> VOL^) = (/(*, -,«(•)), V ^ L 2 + ( 5 (i, -,«(•)), V ) L 2 ,
VeC 0 °°(R r f ).
On the other hand ^4„(£)MJ, = («„ —
in£. 1 (M d ).
D 9.20. Corollary. Let <j> € D, X e (Q,1/IR,T), t € [0,T] fee given and set u = lim„4.o(/ — \Au(t))~l(j). Then the following inequalities are satisfied: (1 - XcT)\u\Li (9.115)
1
C - XcT)\u\LX, (1 - XbR,T)\u\Bv
< \4>\Li + X\br\Li, < |^|L<x» + A | 6 T | L ~ , < \
In particular we have j(
ofTmax).
Proof. The inequalities (9.115) follow from the inequalities (9.83) with u = w„, v > 0. For the first inequality this is obvious because \u ~ uv\i,i —> 0. The second inequality follows because there exists a sequence (vn)nen with lim„_ >00 u 1/ (x) = u(x) a.e. on Rd. Since (1 - Xb^T)\uv\BV is bounded by the right-hand side of the third inequality in (9.83) and \u — UV\T,\ —• 0, we
Chapter 9. Applications
378
get also (1 - XbRtT)\u\Bv Xd(IR!T\u\Li+mT).
<
\4>\BV
to Concrete
KU1 + % ) =
+ ^d(IRtTlim^o
Systems \4>\BV
+ •
9.2.9. The limiting operator. We define the operators J\{t) : D -» D, 0 < t < T, A G (0, l/7fl,r), by (9.116)
J A (*)^ = l i m ( / - A ^ ( i ) ) " V ,
0e£>.
By Proposition 9.19 the operators J\{t) are well-defined. The operators Av{t) are cx-dissipative according to Proposition 9.9 with s = t. Therefore the operators Jx(t) = (l — \Av(t)) exist for A G (0, l/7fl,r) (see Proposition 9.9) and we get (9.117)
| J A ( * ) 0 1 - ^ A ( * ) 0 2 L i < T r — l ^ l - ^ U 1 . 4>U
Furthermore we have the resolvent equation (see Theorem 1.10, (iv)) (9.118)
rx{t)^
= J^{t)[^4>+^^Jx{t)^),
<> / G A A,M G (0,l/7fl,T).
From Proposition 9.19 we see that (we could also take the limit v \, 0 in (9.117)) (9.119)
\J\it)4>i - Mt)4>2\Ll < T^—\
for 0i,>2 G -O and A G (0, I/'JR.T)taking v \. 0 in (9.118) implies (9.120)
Jx(t)4> = Mt)^
-
CT
Using (9.117) it is also easy to see that
+ ^^Jx(t)4>),
0 G D , A, M G(0,l/7ij,T),
i.e., the family J\(t), A G ( 0 , 1 / 7 ^ ^ ) , is a pseudo-resolvent. The resolvent equation (9.120) implies range Jx(t) C range J^(t). Since we can interchange the role of A and fi, we get range Jx(t) = range J^(t),
A, // G (0, l/7fl,r), 0 < * < T. _1
We choose u G range J^(i) and v G A (w - J^ x (t)u). This implies u = Jx(t)(u - Xv) = Mt)(-(u •^(*)(T(«
-
>M)
- Xv) + ^^Jx(t){u
X — ii + —r-u)
- Xv)')
= Jn(t)(u ~ A*v).
i.e., we have u - p G Jll{t)"1u resp. t> € M _ 1 ( u — J M (i) _1 w). Thus we have shown that A _ 1 (/ - Jx{t)~x)u C /x_1(-f ~ ^ ( * ) _ 1 ) ' u f° r u £ range JA(*). Since we can interchange A and /x, we have shown -r(l-
Jx(t)~1)u
= -(I
- J M (i) _ 1 )u,
u G range J^(t) = range JM(£),
9.2. Scalar conservation laws
for X,fJ,G (0,1/JR:T), 0 < t < T, by
379
0 < t < T.
Thus we can define the operators A(t),
domA(t) = range J\(t), A(t)u = - ( / - Jx(t)-l)u,
u£domA{t),
where A can be chosen arbitrarily in (0, 1/7A,T)9.21. Proposition. The operators A(t), 0 < t < T, are cr-dissipative and single-valued with C%{M.d) CdomA{t).
(9.122) Moreover, we have d
(9.123)
p.
A(t)u = -^2—fi(t,;u(-))+g{t,;u(-)),
ue
domA{t),
where the derivatives are understood in the distributional sense. Proof. For [wi,^] € A(t), i = 1,2, we conclude from (9.119), using also ui — J\(t)(ui — Xvi), i = 1,2, that (1 - c T ) | u i - u 2 | z , i < |«i - " 2 - X(vi - v2)\L1,
A G (0,l/7 f l ,T)-
This shows that A(t) is c T -dissipative and Jx(t) = (J - A^(t))" 1 , 0 < t < T, A€(0,l/7fl,r)Let u e Co(R d ) be given. By definition of Av(t) in (9.26) we have Av(t)u = g(t, -,«(•)) - Y.i=i{dldxi)fi{t, -,«(•)) + ^Au, which implies d
(9.124)
lim Av(t)u = g{t, •, «(•)) " Y^^/dxi)/^,
We set i; = u — XA(t)u, vv = u — XAv(t)u. Using u = J^(t)vv we get \u - Jx(t)v\Li
< \J^t)vv < r^—\v
•,«(•)) = : ^(*)«-
Then (9.124) implies lim^o vv = v.
- Jx(t)v\L,
+ \Jux(t)v -
- ""U 1 + \Jx(t)v -
Jx(t)v\Li J\{t)v\v,
I — CT
which for v \. 0 implies u — J\{t)v e dom^4(£) 1
and v e J\(t)~ u
= u — AA(i)«. This and a = u — AT1(£)« show that A(t)u <E .4(t)u,
i.e., A(t) is an extension of A(t).
380
Chapter 9. Applications
to Concrete
Systems
Let u G dom A(t) be given, i.e., u = J\(t)(fr for some
(j(u
-
for all V G C^°(K d ). If w = JA(*) G A then we have also (9.125) with <£ instead of <j&. This implies A " 1 ^ - <j),ip)L2 = 0 for all ip G Cfi°(Rd) and consequently <j> = >. This implies that J ^ ( t ) - 1 and consequently A(i) is also single-valued. From A„(i)w„ = (uv — >)/\ we get lim Av(t)uv
= -{u-
J40
4>).
A
From u = J\(t)
and
- ( « - <j>) = j{u - Jxit^u)
= A(t)u.
This and (9.125) prove (9.123).
•
9.22. Theorem. For any T max > 0 the family A(t), 0 < t < T m a x , is of Crandall-Pazy class (see Definition 7.1). Proof. We have to verify assumptions (CPl) - (CP5). To this end we fix r m a x > 0 and T G (0,T m a x ). From Proposition 9.21 it is clear that (CPl) holds with uatT = CT for all a > 0. Furthermore, we conclude from (9.122) that E := domAjt)
= L1 (Rd)
for all t > 0,
i.e., assumption (CP2) is satisfied. In order to verify assumption (CP3) we choose <j> G Da. Then, for any v > 0, there exists a t i „ e f l f l dom Av(t) such that < / > = ( / - AJ4J,(t))ui/ (see Proposition 9.15). This implies uv = J^(t)(j>. We set u = lim^ 0 J%(t)<j) = J\(t)(f>, i.e., we have (j> = (I — \A(t))u. From Corollary 9.20 we get (1 - Aa)
A G (0, 1 / 7 B , T ) ,
where a and 6 are given by (9.88). We set A a ; T = min(l/7 f l i T , l/(2a)). Then we have
AG(0,AQ,T),
i.e., u G Da(a).
Thus we have shown that
(9.126)
E n £>« = £>Q C (I - \A(t)) (dom 4(4) n
for A G (0,A Q)T ) and 0 < t < T, i.e., (CP3) is satisfied.
Da{a))
9.2. Scalar conservation
laws
381
The inclusion (9.126) implies that J\{t)(j> e Aom. A(t) n Da^ for <j> e D Q , A G (0, AQiT) and < e [0,T]. Then Corollary 9.20 trivially shows that -(
<
Kl-XA^t^J^t^-il-XA^^J^^l^+Xlh-t^L^^T
= A|ti -
t2\La(a)iRtT.
For v \. 0 this implies (1 - ACT) | JxfaW
- Jx{t2)4>\L, < X\h -
t2\La(a)^T
resp. \Ax{ti)4> - Ax{h)
1 - A c
|*i - h\La{a)>R,T
< 2\ti -
t2\La{a)>RiT
for A S (0,A a ,r/2). Note that AQjT < 1/7A,T < 1/CT- Here A\(t) denotes the Yosida approximation of A(t). Thus we have shown that condition (CP5) is also satisfied. • In view of Theorem 9.22 all statements of Theorem 7.8 and Remark 7.1 on page 284 are valid for the evolution problem (9.127)
u{t)=A{t)u{t),t>0,
u{s) = u0.
In particular we have: 9.23. Corollary. For any T > 0 there exists an evolution operator U(t, s) : D -> D,0<s
= lim(
J7 \
Jx(s + jX))u0,
0<s
'
.7=1
defines a mild solution of (9.127). Moreover, the step functions u\ defined on [s,T] by ( fn?=i
>MJA))MO
ux(t) = I ( n g A 1 Jx(jX))u0 I wo
for te(s
+ (k-
for te(s
+ [T/X\X,T],
fort = s,
l)X,s + Xk], k = 1 , . . . , [T/X],
382
Chapter 9. Applications
converge uniformly on [s,T] to u (in
to Concrete
Systems
L1(R.d)).
In order to address the question of uniqueness of mild solutions to problem (9.127) we introduce the concept of entropy solutions as in [Kr], where such solutions are called generalized solutions: 9.24. Definition. Let u : [ 0 , T ] x E l i - 4 R b e a bounded measurable function. Then u is called an entropy solution of problem (9.127) with s = 0 o n [0, T] if and only if the following is true: (i) For any k G R and $ G C£°((0, T) x R d ) with tp(t, x) > 0 on [0, T] x Rd we have
/ Jo
/
JTS.'1 \
(\u(t,x)-k\Mt,x) + sign(w(i,:r) - k)( f(t,x,u(t,x))
- f(t,x,k)j
d
x,u(t,x))
Vip(t,x) .
- ^ ( / i ) x i ( £ , x,k)j^(t,
x) J dxdt > 0.
(ii) There exists a subset E C [0, T] with meas E = 0 such that, for all t G [0, T] \ E, the function x —> u(t, x) is defined a.e. on R d and lim
/
\u(t, x) — uo(x)\ dx = 0
U0,te[o,T}\Ejlx]Md
for all r > 0. We have the following result: 9.25. Theorem. The mild solution for (9.127) given in Corollary 9.23 is the unique entropy solution. Proof. We fix T > 0 and choose u0 G D. Let u(t, •) = [/(£, 0)w0, t > 0, be the mild solution according to Corollary 9.23. Since t —»• u(t, •) defines a continuous function [0, oo) —• D c L 1 (R d ) it is clear that u satisfies requirement (ii) of Definition 9.24. For A G (0, l/7fl,r) and t G [0, T] we set iVA = [t/X], t$ = jX, j = 0,...,Nx and Uj = JA(*J )w^_i,
;' = 1, • • •, Nx,
and
UQ = u0-
Corresponding to the sequence (u^ )J=O,...,JVA we define the step functions u^ by fu£ «A(*) = S < A I MQ
for i G ( $ _ ! , $ , i = l,...,7V A , fortG(t^,T], for t = 0.
9.2. Scalar conservation laws
383
From Corollary 9.23 we conclude that (9.128)
lim \ux{t) - u(t, -)\Li = 0
uniformly on [0, T\. In view of the definition of the operators A(t) in (9.121) we have u] - « ) _ ! = \A(t])u],
j =
l,...,Nx.
For v > 0 we define the sequences (UJ'I/)J=O,...,N\ a n a the step functions uxv' analogously as above the sequences (UJ)J=O,...,N>> r e s P- the step functions ux. According to Proposition 9.15 we have «*'" G H2(Rd) n dom A„(t) n D for j = 1 , . . . , N\. Furthermore we have «*•" - ufr
= AA„(i>^,
j =
l,...,Nx.
From the definition of the operators J\(t) in (9.116) we get lim^ 0 u\'v = u\. Assume that we already have shown that lim^oWjI^ = u$-i- Then using (9.117) and (9.116) we get \uj
< 7 - ^ r l ^ - i " UU\ + \Jx(t>U 1
- M$)Uj-i\
^0
as v 10.
Cf
Thus by induction we have (9.129)
limuf" =u>;,
j =
l,...,Nx.
Let the function Vfr be defined by (A.8). Then we have, for functions
(9.130) JM.d
V
384
Chapter 9. Applications
to Concrete
Systems
As in the proof of Lemma 9.17 we get d
= - V / i=1
(9.131)
/
tph(s-k){fi)u{tj,x,s)ds{ipj)Xidx
JRdJk d
i=l
- ( /
iph(s-k)^2(fi)^xi(tjr,s)ds,-ipj)
Jk
.
»=i
From (9.58) and (9.59) for u 3• '" — k instead of u we obtain (9.132)
( ^ ( ^, '• I / - f el,\„7,. ) V i , A\n,^ "i )\ L 2 XV
X V
< -{M^'v
= (*h(ufu - k), A ^ ) L 2 ,
- k)V^,Vu^)L2
where ^ ( r ) = J*0 iph(v) da, r € JR. We take the limit z/ J, 0 in the estimate, which we obtain from (9.130) when we use (9.131) and (9.132), and get - / iph(u$ - k)(u$ A
u^Wjdx
JR" ~
(9-133)
< J M*$
d
~ k)(g(t$,x,u$)
- £(/*)*,(#,*, u£))lM*
+ / ( F ^ ( ^ , x , ^ , f e ) T V ^ + G^(^,a;,u^fc)^)da;, jRd
where Fh(t,x,u,k)
= /
iph(s-h)fu(t,x,s)ds,
Jk
Gh{t,x,u,k)=
I
i/Jh{s-h)^2{fi)UtXi{t,x,s)ds.
Taking the limit z/ 4- 0 is justified, because (9.129) implies lim,,^ U\ (t) = u\(t) for all t e [0,T] and we see from Corollary 9.16 that |w^ | L ~ is uniformly bounded with respect to v > 0 (compare Proposition 6.26). From ^h{v)-^h{w) = (v-w)'4>h{v)+f^(iph(s)-i>h{v)) ds and monotonicity of tph we get the inequality {v - w)iph{v) < Vh{v) - Vh(w),
v,wGR.
9.2. Scalar conservation laws
385
We choose now ipj = 4>(tj, •), j = 1 , . . . , N\, and get from (9.133) the estimate (summing up from j = 1 , . . . , N\) V
/ (*,,(«£ - k) - * h ( u ^ _ ! " k))j>(t$,x) dx Nx
, / (h(t$,x,u$,k)TVi>(t$,x)
<XJ2 Nx
r
j=l ^
+
Gh(t$,x,u$,k)i>(t$,x))dx d
/
Hd
i=l
For A sufficiently small (i.e., t* is so close to zero and t^ $(ti,x) = tp(t%x,x) = 0 for all x 6 K d ) we see that V
/ (*/.(«* ~k)-
= ->
A/
so close to T that
*fc(^_! " * ) ) # £ , *) fife
^(u^-fc)—^
—=:
da.
Observing that the left-hand side can be interpreted as a Riemann sum for an integral and using (9.128) we get (taking the limit A ! 0 in (9.133)) / / &h(u(t,x) Jo Jmd + +
Jo Jud Jo Jud
k)ipt(t,x)dxdt
(Fh(t,x,u(t,x),k)JVip(t,x)
+
Gh{t,x,u{t,x),k)tp(t,x))dxdt
iph(u(t,x)-k)(g(t,x,u(t,x)) v d
- ^2(fi)Xi{t,x,u{t,x)))ip(t,x)
dxdt > 0.
»=i
Using the same arguments as in the proof of Lemma 9.17 we can take the limit h \. 0 in order to get the inequality of Definition 9.24, (i). Thus u is an entropy solution. For the proof that entropy solutions of (9.127) are unique we refer to [Kr]. • 9.2.10. The general case. In order to indicate that up to now the operators A(t) have been defined for the truncated functions fn and gR we write An(t), jR,\(t) and Uii(t,s) instead of A(t), J\{t) and U(t,s). The operators A(t)
386
Chapter 9. Applications
to Concrete
Systems
corresponding to / and g are denned by dom A(t) = {u€ Lx(ty
I - div/(t, -,«(•)) + g(t, -,«(•)) G L^Q), where the derivatives are taken in the distributional sense},
d
a
A{t)u = -^2
g^fitt,
•» «(•)) + 9(t, ; «(•)).
u
e dom A(t).
i=\
It is clear that u G dom A,R(t) and |u]z,~ < R imply u € domA(t). For fixed t € (s, T], u0 e D and A e (0, 1/JR,T) we set Wj = ^A,A(S +j\)Uj-i,
j = 1, ...,[(* - s)/A].
This is equivalent to Uj_i = (/ — inequality in (9.115) implies
AAH(S
J (<£(«j) - <^( u J-i) < a^(«i) +b, where a — CT and 6 = we get \UJ\L°°
|&T|L°°
s
Therefore the second
j = 1, • • •, [(* - s)/X],
do not depend on R. According to Lemma 6.4
=
+ j\))uj.
|M0|L~;1)
u
^ ^a,b( > > l o | i » ; 1) =: a r ,
.7 = 1 , . . . , [(* - s)/A],
for A sufficiently small. This shows that the DS-approximation for the evolution problem u(t) = AR(t)u(t),
s
u(s) = Mo,
corresponding to the sequence Uj, j = 0 , . . . , [(£ — s)/X], is also a DS-approximation for problem (9.127) provided R > air- Consequently the mild solution given in Corollary 9.23 is also a mild solution of (9.127) if R > ay.
9.3.
The Navier-Stokes equations
In this section we present the well-known results that the Navier-Stokes equations in R 2 possess globally existing strong solutions (in the terminology used in the context of Navier-Stokes equations) for all initial data, whereas in R 3 existence of strong solutions is only local in general and is global if the initial data are sufficiently small. We base our considerations on the theory presented in Chapter 6. The 2-dimensional case was already treated in [Kb-02]. The use of the theory developed in Chapter 6 for the 3-dimensional case seems to be new. Let fl c R d , d = 2 or d = 3, be a bounded domain with sufficiently smooth boundary T = d£l. The velocity field u(t,x) e Rd and the pressure
9.3. The Navier-Stokes
equations
387
distribution p(t, x) G R of an incompressible fluid confined to 0. satisfies the so-called Navier-Stokes equations d
(9 134)
Ut
^
^
+
^
n Ui
^'
divu(£,x)=0,
X
^~dx-^ ^
+ gradp
^' ^
=
^ " t * ' a ; ) + /(*> x )'
a; 6 fi, i > 0,
with the boundary resp. initial condition u(t,x) = 0 ,
x G T, t > 0,
u(0,x) = uo(a;),
a; G f2.
Here v denotes the kinetic viscosity and / G C(0, oo;L 2 (0;M d )) represents a body force. In order to formulate this problem as an evolution problem we first introduce the function spaces generally used in this context (see for instance [Te], [So] or [G-R]). Let V = {cj> € C£°(ft;R d ) | div^ = 0}, where C£°(fi;R d ) denotes the space of all Rd-valued C°°-functions with compact support in Q. The divergence-free subspace V of H$(Sl;Rd) resp. H of L2{9.\Rd) is defined as
V=V"°
resp.
H=VL\
The spaces V and H can also be characterized as (see [Te, Theorem 1.1.6] resp. [Te, Theorem 1.1.4] or [G-R, Section 2.2]) V ={4>e Hl{9.;WLd) | div<j> = 0} 2
resp.
d
# = {<£GL (ft;]R ) |div(/> = 0and7 n (A = 0}. Here derivatives are understood in the distributional sense, of course, and 7 n denotes the trace operator H —> H1'2(F;Md), which is uniquely determined by 7n> = nT
| 0 = gradp for some p G
H1^)}.
The space H as a closed subspace of L2 (fi; R d ) is equipped with the induced /
,
norm \<j>\H = |
x 1/2
, <j> & H.
equipped with the norm \<j>\v = \J2ij=i IQ\7fc~
dx
)
Analogously V is > <> / e
v
2
d
-
Since iyQ(fi;R ) is densely and continuously embedded into L (Q;R ), it is easy to see that the embedding V Q H is also dense and continuous. Thus the triple (V, H, V*) is a Gelfand triple with pivoting space H (see Section 3.1).
388
Chapter 9. Applications
to Concrete
Systems
According to Theorem 3.4 there exists a unique linear operator A on V* with dom A = V characterized by (Au)(w) = — (u, w)v,
u,w£V.
Moreover, A is a bijective mapping V —> V* such that ||^4-||/;(v,v*) < 1 a n d P ' ^ k t v . v ) < 1> i-e., we have ||i||z;(y,y.) = ||^'~ 1 ||£(v*,v) = 1 (note that the sesquilinear form {-,-)v trivially satisfies the inequalities (3.3) and (3.4) with K = 0, 7 — 5 — 1). The part AQ of A in H as defined in Theorem 3.4, b), is called the Stokes operator. The Stokes operator AQ is a sectorial operator on H (Proposition 3.9) and thus infinitesimal generator of an analytic semigroup on H (Theorem 3.19). Assuming that dd is of class C 2 the Stokes operator is explicitly given by (see for instance [So, Theorem 2.1.1]) domi4o = V r n # 2 ( f i ; R d ) , Aou = —PAu, u € dom AQ, where P denotes the orthogonal projection L2(Q;Rd) —• H. For later use we define the function g : [0, oo) —» H by g(t) = Pf(t, •), t > 0. It is clear that geC{0,oo;H). We introduce the trilinear form b:VxVx.V—>M.by b(u,v,w)=
VJ
ui(x)—J-(x)wj(x)dx=
/ u(x)T( — (x))
w(x)dx
for u,v,w £ V. For the proof of the following lemma on properties of b and also later we need that the following embeddings are continuous: (9.135)
Hl{Q) Q Lq(n),
2
in case d = 2
#o(fi) Ql«(Sl),
2 < g < 6,
in case d = 3.
and (9.136)
If the boundary <9fi is regular enough (satisfying the uniform cone condition for instance) the above embeddings are also true for Hl(Q). The embeddings in (9.135) are also compact, whereas the embeddings in (9.136) are compact for 2 < q < 6 (see for instance [Ad, Theorem 5.4 and Theorem 6.2]). 9.26. Lemma, a) The trilinear form b is continuous on V x V x V, d = 2,3, \b(u,v,w)\ < M\u\v\v\v\w\v, for some constant M > 0.
u,v,w e V,
9.3. The Navier-Stokes equations
389
b) We have b(u,v,v) = 0 = b(u,v,w) + b(u,w,v),
u,v,w € V.
c) For u, v, w £ V we have the estimates \b(u,v,w)\<21^\u\^2\u\]f2\v\v\w\1^\w\]f2 M/
\ul
ol
I 1 / 4 ! 13/41 I |
11/41
in cased = 2, ,3/4
,
„
|o(u,f;,w)| < z|u|^ |u|y |v|v|w|jj M y zn cose a = 3. Proof, a) For u,v,w 6- V we have (using (9.135) resp. (9.136)) ut € L6(n), 1^- € £ 2 (ft) and Wj £ L 3 (ft), i,j = 1,2,3. From 1/6 + 1/2 + 1/3 = 1 we conclude by Holder's inequality that Ui-^-Wj £ I/1(Q) and /
Ui{x)-T^-(x)wj{x)dx < W L 6
dv-j dxt
L2\Wj\L3.
Thus b(u, v, w) is well-defined and (9.137)
\b(u,v,w)\ < const. \u\Le\v\Hi\w\L3
< const. | w | ^ j ^ l ^ i l ^ l ^ i -
Here and in the following 'const.' denotes a positive constant which does not depend on the elements of the spaces involved in the inequalities and may have different values at different occurrences. b) We take u, v G V and get
/ ui(x)-^M)vj(x)dx
= 2 / ui{x) — {v:j{x)'2)dx = - - /
vj(x)2-^-(x)dx,
which implies *
~
d
b{u,v,v) — — - / (y_]vj(x)2)
divu{x)dx = 0.
Then the result follows by density of V in V. From 0 = b(u, v + w,v + w) and linearity of b in its arguments we get the second result. c) For the estimates of statement c) we refer to [Te, Lemma III.3.4 resp. Lemma III.6.3]. • Let u = u(t,x), p = p{t,x) be a classical solution of (9.134), i.e., we have MeC 2 ([0,oo) xTi;Rd),pe C^fO.oo) x f i ; ! ' 1 ) satisfying (9.134) for t > 0 and x 6 Q. It is clear that u(t, •) € V for t > 0. For any
(Au{t,-),fi)H = -{u{t,-),(t))v, ( £ « < ( * ' - ) g | : ( * . •). ^ ) H = «»(«(*. •).«(*. O,^), (giaAp{t,-),4>)H = - (p(t,-), div 4>)H = 0 ,
390
Chapter 9. Applications
to Concrete
Systems
so that we get from equation (9.134) that (9.138)
— ( « ( * , •), )H = -b(u(t,
•), u(t, •), 4>) ~ "(«(*> •).
for t > 0. From Lemma 9.26, a), we see that there exists a unique Bu 6 V* with (9.139)
(Bu,<j)} = b(u,u,(p),
u,(t>eV.
It is easy to see that, for u e C2(Q;Rd), we have Bu — P[J2i=1 " J ^ T Y From [Te, Lemma III.3.8] we see that Bu £ H if u £ dom Ao- This motivates the following definition of the family A(i), t > 0, of operators on H: (9 140)
domA(i) = domA 0 ,
t > 0,
A(i)u = -vA0uBu + Pf(t,-), w£domA0. In the following we shall consider the evolution problem u(t) = A(t)u(t),
t > 0,
Let w(-) be a strong solution of (9.141) with u(t) € domA 0 for t £ [0,T]. Then equation (9.141) implies (u(t) + vAu(t) + Bu(t) - f{t, •),>)
=0
for all
This implies (see [Te, Remark 1.4 on p. 15]) that u(t) + uAu{t) + Bu(t) - f(t, •) = gradp(t, •) withp(t,-)
1
£H (Q;Rd).
9.27. Lemma. The family A(t), t > 0, satisfies the estimate (A(t)ui - A(s)u2,u1
- u2)_ 1
uilylux - U2\H + \g(t) - g(s)\H
ford = 2,
^3 \ui\lr\ui - u2\H + \g(t) - g(s)\H
for d = 3,
< '"
2
for any ui,u2 £ dom Ao and t, s > 0. Proof. We choose u\,u2 £ domA 0 and t,s > 0. Then we have (A(t)ui - A(s)u2,ui - u2)H < (A(i)wi - A(t)u2,ui ~u2)H + (A(t)u2-A(s)u2,ui = -b(ui,ui,ui
-u2)
- v{ux - u2,
MI
+ b(u2,u2,ui
-u2)
- u2)v + (g(t) - g(s), Ui -
u2)H.
-
u2)H
9.3. The Navier-Stokes
equations
391
By linearity of b in its arguments we get -b(ui,ui,ui
-u2)
+ b(u2,u2,ui
~u2)
= - 6 ( u i , u i , t t i - u2) + b(u2,ui,ui -b(u2,ui,ui
-u2)
- u2)
+b(u2,u2,ui
- u2)
= b(u2 - ui,ui,ui
- u2) + b(u2,u2 - U\,u\ - u2)
— b(u2 - u\,u\,u\
- u2).
Using this and Lemma 9.26, c), we get (A(t)ui - A(s)u2,ui
-
u2)H
< V2\ui - u2\H\ui\v\ui
-
u2\v
~ H w i ~ w 2|y + \g(t) - g(s)\H\ui
(9.142)
+ \g(t) - g(s)\fi\ui
- u2\H
-u2\H
in case d = 2 and (A(t)ui - A(s)u2,U! -
u2)H
< 2|ui -
M2|^2|UI|V|UI
- Italy 2
- v\ui - u2\v + \g(t) - g(s)\H\ui - 2^l U l l^l U l ~ w2|f/|wi - -j\ul
- ul\v
2 < —\u\\v\u\ in case d = 3. Observing result.
(U,V)H
-u2\2H =
- u2\H
u2\v
+ ls(*) - g(s)\H\ui
+ \g(t) - g{s)\H\ui
\V\H(U,V)-
- U2\H
- u2\H
for u,v e H we get the •
For the proof that the operators A(t) satisfy the range condition (R2) we shall use the following result: 9.28. Lemma. Let u0 € H be given. Then for any u G V, X > 0 and t > 0 there exists exactly one w\ £V such that (9.143) for all ip €V. (9.144)
T{W\,IP)H
+ V(W\,IIJ)V
+ b(u,w\,ip)
=
(T"O
Moreover we have w\ e domAo and \{\W\\H
- l«o&) + v\w*\2v < l\9(t)\2v. •
+ g(t),ip)
392
Chapter 9. Applications
Ifuo<EV then we have also 1 2 2 ^T{\WX\ ^ v , —V ,v - \u , -0l\ vv), +•
to Concrete
-\A0wx\2H
2
r 8 M l | . . . 2 , . . 2, 2 , . . .2 ,2 , 1 ^ MHW\ V\WX\ V + -W)VH <<
(9.145)
Systems
^L\u\*v\wx\2v
ford
+ -\g(t)\l
=2,
ford = 3.
Proof. We define the sesquilinear form a : V x V —> R by a(w,ip) =
-T(W,IP)H A
+ v(w,ij))v + b(u,w,ip),
w,ip
eV.
This sesquilinear form satisfies \a(w,ip)\ <
-\W\H\IP\H
+ v\w\v\ip\v
+
M\u\v\w\v\i>\v
2
< ( y + v + M\u\v^J\w\v\tp\v,
w,ipeV,
(here c denotes the embedding constant for the embedding V Q H and M is the constant in statement a) of Lemma 9.26) and tf(^)
= -^M2H + i#lv>HV>l 2 v,
V»GV.
According to the Lax-Milgram theorem (Theorem 3.2) there exists a bounded bijective linear operator C : V —> V* with ||C|| < c2/A + v + M\u\v and HC"1!! < 1/v such that a(w,ip) = (Cw,ip)
for all w,ip G V.
Using this we see that (9.143) is equivalent to {Cwx,il>) = {uo/\ + g(t),i/>)H = (uo/\ + g{t),il>), i.e., to Cw\ = uo/\+g(t). From this we get w\ = C~1(uo/\ that \v\v < C\V\H for v £ H) (9.146)
\wx\v<^(j\u0\H
i>eV, + g(t)) and (note
+ \g(t)\H).
From (9.143) with ip = w\ we get J\W\\H-JMH\WX\H
+ V\W\\V
< \9(t)\v\w\v
< 2^lfl(*)lv« + ^ M v >
which implies (9.144). In order to prove that w\ € dom AQ we shall use some results on interpolation spaces. Given a pair of Banach spaces X, Y and a 6 € (0,1) we denote by [X, Y]g the interpolation space corresponding to the pair X, Y constructed
9.3. The Nairier-Stokes
equations
393
by the so-called complex method (see [B-L, Chapter 4]). We obviously have the continuous embeddings V Q L6(fL;Rd),
HQL2(n-,Rd),
which imply (see the definition of an interpolation space in [B-L, Section 2.4], for instance) the continuous embedding Vl>2 := [V,H]1/2 Q. [L 6 (fi;M d ),L 2 (n;R d )] 1 / 2 = L 3 (ft;R d ), where we have also used [B-L, Theorem 5.1.2] and [R d ,R d ] 1 / 2 = Rd (see [B-L, Theorem 4.2.1, (c)]). By boundedness of fl we have L 3 (fi;R d ) q. L 2 (Q;R d ), so that trivially V1'2 Q L 2 (Q;R d ). Thus we have |0|L3 1/2
for all
< const. |^|yi/2
\
and
const. |0|yi/2
From (9.137) we conclude that
\b(u,w,tp)\ < const.
ML'SIHVIV'IL 3
< const. |«|y|w|v|V'l\/i/2
for u,w,tp e V. From (9.143) we get u\(Aw\,ip)\
=
u\(w\,ip)v\
~ ( A ' U ° ~W^H
+
\9(t)\H)\4>\H + const.
\u\v\wx\v\ip\vi/2
< const.(T|WO - WA|H + |^(*)|jy + |w|v|w A k) Mv"/2 for u, ip G V. By density of V in y 1 / 2 we see that Aw^ is a bounded linear functional on y 1 / / 2 , i.e., Awx G (y 1 / 2 )*.
(9.147)
Since A is an invertible continuous mapping dom A0 -> H and also y ->• V* with continuous inverses, we see that A is also an invertible continuous mapping [dom^4 0 ,y]i/2 —>• [#, V"*]i/2 with continuous inverse. From [H,V*]i/2 = ([V,H]1/2)* (see [B-L, Corollary 4.5.2]) and (9.147) we get (9.148)
wx e [domA 0 ,y]i / 2 =:
V3/2.
Let Di = d/dxi, i = l,...,d. Then Di is a bounded linear operator domAo -4 fl"1^;!**) and also y -5- L 2 (fi;R d ). Consequently Dt is also a bounded linear operator [domA0,V]i/2 -> [Hl(9,\Rd),L2(Q.;Rd)}1/T Observing JH"1(n;Kli) q. L 6 (ft;R d ), we get analogously as above that (9.149)
[H1{fl;Rd),L2{n;Rd]1/2Q
[L 6 (ft;R d ),L 2 (f2;R d )] 1 / 2 = L 3 (ft;R d ).
Thus we have |A
< const. |(A|V3/2,
0G y 3 / 2 , i = 1 , . . . ,d,
Chapter 9. Applications
394
to Concrete
Systems
resp. |V>|L3 < const. \
(9.150)
From (9.148) and (9.150) we get \b(u,w\,ip)\
< const. \u\Le\Vu>x\L3\ip\L2 < const.
\U\L6\WX\V3/2\IP\L2
for all u,t/j G V. This inequality and (9.143) imply p\(Awx,ip}\
= p\(wx,tp)v\ <
(J(\W\\H
+ \UO\H) + \g{t)\H)WH
+ \b{u,wx,ip)\
< const.(-T\WX\H + T\U0\H + \g(t)\H + \u\Le\wx\v3/2j\tl}\H for all ip GV, i.e., vox € domAo. In order to establish the estimate (9.145) we shall use the inequalities (see [Te, Lemma III.3.3]) \4\L* < const. l^l^lcAl^ 2 ,
HH^R2),
and (see [Te, Lemma III.3.7]) (9.151)
\(p\H2 < const. \A0(p\L2,
(p e domA 0 , d > 2.
From these inequalities we see that b(u, wx,AoWx) is defined for u G V. Moreover we have \b(u,wx,A0wx)\
\U\L4\\7WX\LAAOWX\L2
< const. < const.
(9-152)
s-
IUI^IUI^IMWXI^IVWXI^XIAQWXIH
<- I | l / 2 i
.1/2.
,1/2,
< const. |w|^ luly' |w A |v 1
2
2
,1/2, ,
,
\WX\H2\AOWX\H
3 2
<M1\u\ f\u\]f \wx\]/ \A0wx\ J . Using (w\,<j>)v = (^o^A, 0) = (^O W A, >)# and density of V in H we conclude from (9.143) that (9.153) -{wx
-UO,IP)H
+ V(A0W\,IIJ)H
+b{u,wx,^)
= {g{t),ip)H,
ip
9.3. The Navier-Stokes equations
395
Setting ip = A0w\ and assuming u 0 G V we have using (9.152)
^(K|y-|wo|y)+-^|Ao»A|H
+ -\g(t)\2H
< MMTM'Awx^lAowxlT <
2M?L
\U\H\U\V\WX\V\AQWX\H
V
V
v
< -^\u\2H\u\2v\wx\2v
+ ^\AQWX\2H
+ ^\A0wx\2H
+
+
-\g(t)\2H
-\g(t)\2H,
which implies (9.145) for d = 2. In case d — 3 we conclude first from (9.136) that \4>\L^ < const. |0|#i for (j) G J? 1 (fi;R 3 ) provided dQ. is sufficiently smooth. By Holder's inequality we have |0|3L3 < (/ n (|\L* < const. \4>\%2\(t>\Hi, <S> G
Hl(Q;R3).
Using this and (9.151) we see as in case d = 2 that b(u,wx,AoWx) for u € V. Moreover we have \b(u,wx,A0w)\
is defined
< const.
\U\L6\VW\\L3\A0WX\L2
< const.
\U\V\\7WX\)/22\VU)X\HI\AOWX\H
< const.
\U\V\WX\V\WX\H2\A0WX\H
M2\u\v\wx\]j2\A0wxU2'.
<
This together with (9.153) for ip = Aowx implies ^(\wx\2v
- \uo\2v) + ^\A0wx\2H
< M2\u\v\^\\/2\Aowx\T
+ i|fl(i)&
2
2M i' 1 < —-|u|v|u>A|v|4)M>A|tf + - ( A O W A I ^ + -\g{t)\2H V
O
<^\u\Uwx\2v
+ ^\AoWx\2H +
This immediately implies (9.145) for d = 3.
f
l\9(t)\2H. •
9.29. Lemma. For any a > 0 and T > 0 there exists a A Q J T > 0 such that for any A £ (0, A Q J T], < € [0, T] and u o € ^ with |uo|v < a £/ie equation (9.155)
MO = (/ -
XA(t))ux
has a solution ux G dom AQ satisfying (9.156)
\im\ux — u0\v = 0-
396
Chapter 9. Applications
to Concrete
Systems
Proof. According to Lemma 9.28 we define a mapping $ A : V -> V by $A(W) = wx, u G V, where A > 0 and wx is the unique solution of equation (9.143). We choose a > 0, t G [0,T] and u 0 G V with |xto|v < a - From (9.145) we conclude that 2A (1 - \p\u\U\wx\l < \uo\2v + -£\g(t)\2H
Ae(0,/i£,r].
We next show that 3>,\ is a compact mapping on Be. To this end we fix A G (0,^ e ,r] and choose a sequence (wn)„eN in Be. Since V is a Hilbert space, there exists a subsequence, which we again denote by ( U „ ) „ € N , and & it £ V such that w- lim un = u
in V.
We set u>n = $A("n), n G N. From (9.143) we get A - 1 ^ ^ -wm,ip)H + i/(wn wm, ip)v + b(un, wn,il>)- b(um, wm, tp) = 0, ip G V. Taking %j> = wn - wm this gives -\wn - wm\2H + v\wn - wm\y =b(un -um,wn,wm
~wn)
< const. \un - um\Li\wn\v\wn
- wm\L4
< const. \un - um\n\wn\v\wn
-
wm\v,
where we have used (9.135) and (9.136). Thus we have u\wn - wm\v (9.157) d
< const. |w„|y|«„ - um\L* , 9 M < const.(a + e)\un —um\L4, 4
n,m G N.
d
Since #d(f2;R ) is compactly embedded into L (fi;R ), d = 2,3, there exists a subsequence - again denoted by (w„)n6N ~ which is convergent in LA(Q;M.d). This and the inequality (9.157) imply that (w„) n€ N is a Cauchy sequence in V. We set w = limn^oo wn G B€. Taking n —> oo in (9.143) (with u = un and wx =wn) we get j(w,ip)H
+ v(w,ip)v
+b(u,w,i(>) = (-u0+g{t),ip)
,
V € V,
9.3. The Navier-Stokes
equations
397
which proves w — $\(u). Thus $A is compact. By Schauder's fixed point theorem there exists at least one fixed point u\ e Be, u\ = $\(u\). From (9.143) (with u = u\ and w\ = $ A ( " A ) = u\) and the definition of $ A we get (9.158)
j(ux,il>)H + v(ux,il>)v+b(ux,ux,^)=(juo+g(t),il>}
V 6 V.
According to Lemma 9.28 we have u\ £ dom A0 and (9.159)
i(\u x \ 2 H - \uo\l) + v\ux\lr < -\g(t)\2v. • A
V
By definition of A(t) (see (9.140) and (9.139)) we obtain from (9.158) that -(ux - u0) = A0ux + Bux + g{t) = A{t)ux, i.e., ux solves (9.155). Thus the first part of the lemma is established with A Q ,T = MI,T f° r an Y a > 0 for instance. In order to prove (9.156) we first establish w-limAj.oWA = «o in if. From (9.159) we see that (9.160)
\ux\2H < K i n + - C I , T ,
0 < A < min(l, A Q , T ),
where we have set ci,r = c 2 max 0
w-lim uxn =u in H. n—>-oo
The inequality (9.159) implies also that limA|o A ^ + ^ W A I V = 0 for any e > 0. This and the estimates for b(-, •, •) given in Lemma 9.26, c), imply that
. Ifc, n| JV \n\b{uxn,Uxn,-4>)\ <<
^A^AJ^VJ^I^W2
[2\n\uxn\v
7 / 4
,1/4, ,,1/4, ,,3/4 \uxn\^ IV'IH mv
ford = 2, ,
ford
,
„
= 3,
which implies A„6(MA„ , WA„,VO -* 0 as n -¥ oo. Taking n -> oo in (9.158) with A = A„ we obtain (u - tio, IP)H = 0 for all tp 6 V, which by density of V in H implies u = u$. From MA £ B£ for A £ (0,/X£IT] we immediately get (taking a = |wo|v) (9.162)
limsup|M A k < \u0\v-
This and (9.159) show that (MA)o oo and a t; £ V such that (9.163)
w-lim uxn — v in V.
Chapter 9. Applications
398
to Concrete
Systems
A bounded linear functional on H is also a bounded linear functional on V. Therefore (9.163) implies w-lhrin-xx, u\n = v in H. In view of (9.161) and U = UQ this implies v = Uo- Therefore (9.163) and (9.162) imply |«olv < liminf \uXn\v < limsup n—>oo
|UA„|V
< |«o|v
n—»oo
and consequently (9.164)
lim \uXn\v
= \u0\v-
n—>oo
From (9.163) and (9.164) we conclude that linin^oc, \u\n — w 0 |y = 0 (note that H is a Hilbert space). Thus we have shown that for any sequence (uxn)neN with Xn I 0 as n —» oo there exists a subsequence which converges to uo in V. This proves lim \u\ - un\v = 0. AJ.0
D 9.3.1. The two-dimensional case. Following [Kb-02] we introduce the functional
| u |
1 oo
"
+
Col/4ln(1
+
|W|
'^)
f
°r
U
y
^
'
otherwise,
where CQ > 0 is a constant which will be determined later. 9.30. Lemma. For any CQ > 0 the functional tp is lower semi-continuous on H. Proof. Let u e H and (un)nen C H with \u - un\n -» 0 be given and set a = limunvn.00 tp(un). We only need to consider a < oo and may assume that (u„) n€ N C V with linin^oo y(«„) = a. This implies that (M„)n£N is bounded in V. Consequently there exist a subsequence, which we again denote by (un)nefi, and an element w € V such that w- lim un = w
in V.
n—»oo
Since a bounded linear functional on H is also a bounded linear functional on V, we see also that w- lim un — w
in H.
n—>oo
This implies ^ — ^* From limu_^00 |^n[/f — l^lff ^^d ^^n—^oo^i^n} conclude that |u|fr < Jim \un\y = exp( (a - \u\4H)) - 1. re—nx)
^CQf
/
— ^ we
9.3. The Navier-Stokes
equations
This implies a > \u\4H +
399
CQV4
ln(l + \u\v) =
D
9.31. Lemma. The family A(t), t > 0, satisfies assumption (El) with a+ = oo and ^,T = ^(eQ(co!/4rl-l),
L Q ,r = l.
Proof. It is easy to see that
satisfies the range condition (R2) for
Proof. We choose (3 > 0, T > 0, t e [0,T] and u 0 e Dp. From Lemma 9.29 we see that there exists a \Q,T > 0 such that for any A G (0, Xp,r] there exists a « x 6 dom AQ satisfying -(ux -u0) = A(t)ux and lim^o \ux — UQ\V = 0. We can take
A/?,T
=
4 -1
where
A Q I T,
A Q ,T
is the constant
1 f?
in Lemma 9.29 with a = (exp(/3(c 0 ^ ) - l) . Next we establish the inequalities for the functional
(9.165)
A
0 < A < XPiT. V
Concavity of s —• ln(l + s) implies ln(l + S2) < ln(l + Si) + (si — S2)(l + s i ) - 1 , i> «2 > 0. This and (9.145) for d = 2 (with u = wj = ux) show that
s
—
(ln(l + \ux\v) - In(l + |«o|v)) < — 4
CQV
We set co = (8M?)-1, ^
h n , i
—-(ln(l A
l +
4
/16M ,
l2
,
]uo?y
l4
2, . x l 2 \
c 2 , T = (SMf)" 1 max 0 < t
1/1,1
i2 A\ ^ 2v\ux\2H\u\\y
+ | u A | ^ ) - l n ( l + |«olv)) <
, , •,
+ 2V3C2,T |2
I t |"0IK
-•
400
Chapter 9. Applications
to Concrete
Systems
This and (9.165) imply
A^W "^M)
TT^il ^^\UX\2H-2P\UX\2H\UX\2V
+
<2v3c2,T ^
0
^\ux\2H
+
l"A|^|ttA|y(|«A|v-|«o|y-l)
1 + \uo\v for 0 < A < \/3tT, 0
From (9.159) we see that
K & < |«OIH + -IffWIv- < l«olfr + ^fSince we have limAj.o \u\\v = luo|y> w e s e e that for any uo & V and T > 0 there exists a A 6 (0, Ag^] such that \ux\\ < \uo\y + 1 for A £ (0, A]. We define A/3,r(wo) by (9.166)
X0,T(uo)
= sup{A G (0, A^.r] I |«A|V < l«olv + 1 f o r
a11 A G
(M]}-
For later use we note that A^T^MO) < XptT implies that for any S > 0 there exists a Aj G (A/3,T(UO)> A/3,T(WO) + S\ such that (9.167)
| « A J V - |«o|v > !•
For 0 < A < \J3,T{U0) we have T(
<2^3c2,T + 2 ( ^ - )
+2^^|M0|H.
For | tiolff < 1 we get \ (y>(ux) - p M ) < 2^ 3 C 2 , T + 2 ^ ( l + ^ ) , whereas in case |uo|# > 1 we see that Y(V(UA) - ¥>(«<>)) < 2^ 3 C 2 ,T + 2 ( ^ 2 I ) 2 + 2 ^ ^ | u o | ) r A
\
v
/
< 2v\XT + 2(^ff
v
+ 2^^(u0).
Combining both cases we have j(
b — 2V3C2,T + 2(l +
0 < A < X0tT{uo),
0
C\HTJV)C\,TIV.
Finally we establish the property of the mapping tto —• X0^(UQ) as stated in Remark 6.3 on page 202. Let («o,n)neN be a sequence in Dp for some j3 > 0
9.3.
The Navier-Stokes
equations
401
with linin^oo |«o,n ~ UO\H = 0. Furthermore we denote by u\>n the solution of uo,n — {I — AA(i))uA,n according to Lemma 9.29. Using the estimate \/2|«i - u2\H\ui\v\u1
- u2\v < -\ui ~ usffflu^v
+ -\ui - u2\y
in (9.142) for s = t we obtain - u2\2H.
(A(t)ui - A(t)u2, «i - u2)H + -\ui - u2\v < -\ui\v\ui
We choose u\ = u\, u2 = ux,n and observe that A{t)u\ = (u\ - u0)/X, n ~ Uo,n)/^- The last inequality then implies (u\
-U0
-UX,n
+ U0:n,UX ~ U\,n)
H
+ "^"I^A ~ Ux,n\v
< -\u\\y\u\
~Ux,n?H,
which in turn gives / (9.168)
[\
2A
\ | « A | V J \U\ - Ux,n\2H + >^v\ux - Ux,n\v
< |«0 -
u
0,n\2H-
From limA^o \ux ~Uo\v = 0 we see that \ux\v < -W2 for 0 < A < \P,T(UQ), where M2 is some positive constant. Consequently we have 1 — 2At'~~1|u.\|fr > 1/V2 for 0 < A < min(A/3jT(Mo), (2 - V2)v(2M2)~2) ~. X/3,T(UO). Then we get from (9.168) \u\ - ux,n\H < 2|uo - Mo.Jff
for A G (0, X^T(UQ)],
n = 1,2,... .
This implies \U0,n - Ux,n\H
< |M0,n ~ U0\H
+ |«0 - U\\H
+ |«A ~
U\,TI\H
< 3|w0,n - U0\H + I WO - UX\H for A e (0, A/3,x(wo)], n — 1,2,... . We have also the estimate ||WA,n|ff - |w0,n|ff| - l U A,n ~ «0,n|ff + 2|uo,n|fJ|«A,n ~ « 0 , n | H -
The last estimate together with lim^o |«A — UO\H = linin^oo luo,n — UO|JJ = 0 shows that for any e > 0 there exist Ae € (0, Xptx{uo)} and rae e N such that |l"A,n|fl- - l«o,n|ff| < y for A £ (0, A£] and n > nc. Without restriction we can assume that Ae < i/ 2 (2ci ) r)~ 1 e. Using the last estimate in (9.159) (with «A 5 „, «o,ri instead of ux, UQ) we get (9.169)
X\ux,n\v < A ^ + \t < e
Chapter 9. Applications to Concrete Systems
402
for A 6 (0, A6] and n > ne. From (9.159) (with u\,n and u0,n) we get
K X < l«0,n& + ~l5(*)lv- < M I + -c?,T < Mf + - C i T =: c3iT,
0 < A < 1, n = 1, 2 , . . . ,
where M 3 is a bound for |uo,n|#, n = 1,2,... . Consequently we have, for A € (0, A£] and n > n € ,
This shows that we can choose eo > 0 such that 1 - A
* \uX,n\2HW\,n\v
> 3
for
A £
(°> A «o]> " > " e 0 -
Using this in (9.145) (with u = w\ = u^) we obtain (note that «o,n G -D/3) |«A,nlv < 2)82 + — C I , T < 2/32 + - c i , r =: M 4
for A e (0, A£J and n > n £0 . Assume that linin^,^ A ^ T ^ O , ™ ) = 0. Then according to the statement following the definition of A/g>x(wo) there exists a sequence {\n)nen with A„ J, 0 a s n - > o o and a n J V E N such that (9.170)
l<|uAnfr-|uo,»lv>
" > # .
Without restriction we can assume that A„ < Aeo for n > N. For n > max(N, n€0) we get from (9.145) (with d = 2, X — Xn, u = w\ = wA„ and uo = uo,n) |«An,n|?/ ~ IWO,™!2/ < 2A„(^—5L|MA„,„|^|wAn,rl|^ + -IsWIff) - T - C 3 , T M 4 2 + - max Z/J ' * 1/ 0
|ff(i)|^), /
which implies lim„_>00(jMATiira|2/ - |uo,n|\/) = 0, a contradiction to (9.170). D From Lemmas 9.30 - 9.32 we get: 9.33. Theorem. In case d = 2 the evolution problem (9.141) has for any UQ € V a unique mild solution U(-;0,UQ) on [0, oo). Proof. The existence of a unique mild solution on [0, oo) follows immediately from Theorem 6.17, a). Note that D n domA(0) = D n dom A0 — V and T + (0, uo) = T^max = oo in view of a+ — oo. D
9.3. The Navier-Stokes
equations
403
9.3.2. The three-dimensional case, a) We first consider the case of small data and define the set D and the functional ip by (9-171)
z > = { «
V | | < < ^ }
G
>
where /xo is the smallest eigenvalue of Ao, and (9.172)
*»)=(
H ? r
f
r e A otherwise.
I oo
Note that Ao is selfadjoint and A^1 is a compact operator on H (see [Co-F, p. 32fj). Therefore there exist numbers 0 < fi0 < fii < ••• and elements Wj e domA 0 such that AQWJ — fJ-jWj, j — 0,1,... . Moreover, (wj)je^0 is a complete orthonormal set in H. Let w G domA0 be given. Then w = Y^jLoaJwJ w r t n \W\2H = S j l o l a j ' l 2 - O n t n e other hand we have \w\v — (w,w)v = (w, A0w)H = Yl'jLo^j\a3?• Using this we get (9.173)
\A0w\2H =
(AQW,AQW)H
= ^ / ^ | < x , | 2 > /j,0 Y^^MJ? 3=0
= Mo|w
j=0
9.34. L e m m a . The functional if as defined in (9.172) is lower semi-continuous on H. The proof for this lemma is analogous to that for Lemma 9.30. 9.35. Lemma. The family of operators A(t), t>0, with a+ = oo and
satisfies assumption (El)
Proof. Let u\, u 2 G dom A0 n Da for some a > 0 and t, s > 0 be given. Then we have from Lemma 9.27 for d = 3 that 2 (A(t)ui -A(s)u2,ui - w2) < —|wi|^|«i - w2|ff + ls(i) ~ 5 ( S ) | H < ^6^4
lMl ~
U H
^
+ \9{t) ~
9(S)\H-
a 9.36. Lemma. Assume that 3/2
9 m)
<-
S5
|9<()|2
S
4
" OT-
404
Chapter 9. Applications
to Concrete
Systems
Then the family of operators A(t), t > 0, satisfies assumption (R2) for any T > 0. Moreover we have 3/2
3
b
2 '
-8V2Mf
Proof. By Lemma 9.29 we see as in the two-dimensional case that there exists a Ay > 0 such that for any A G (0, AT], £ G [0,T] and uo 6 D there exists a u\ G domAo satisfying -{u\
-u0) =
A(t)u\
and liniAj.o \u\ - «o|v = 0. Note that |u 0 |v < a := (/i 0 /32) 1 / 4 (^/M2) for uo G A so that we can set AT = A Q> T where A Q> T is chosen according to Lemma 9.29. We have to show that u\ G D. The set D as defined in (9.171) is a closed ball in V. For UQ & V consider w\ = <&\{u) for u G D. From (9.171) and the estimate (9.145) for d — 3 we conclude that K l v + \v\AwxW
2
< l«olv +
3
H v K l v + — lff(*)lfl
1 2A < l«olv + ^ " W K I v + —l5(*)lffUsing (9.173) for w = wj we get K f v < (l + ^A^o)_1(|«o|2v + ^ls(t)lff).
(9.175)
A > 0.
It is easy to see that (|uo| 2 / + — | 9 ( < ) ! H ) < m a x ( | u 0 | v , ^ | 5 ( £ ) l f f ) ,
(l + iAzV)
A > 0.
From (9.174) we conclude w\ = 3>A(U) G £> for all u £ D, i.e., 3>A maps D into Z>. Therefore 3>A has a fixed point a A G £>• From (9.175) (with u\ instead of w\) we see that f\
12
i
i2 \
^/*0 i
(2
-(|uA|y-|uo|y) < ——\ux\v + A
I
i
/ \ 12
-sup\g{t)\jI
V (>0
< - ^ K ! 2AIV v + ^ , 2 '" ' 872M.
0
i.e., we can take Ap T( W O) = AT for all 0 > 0, T > 0, u 0 G D and -T(^C"A) -V'(wo))
b = ^/2u3
(8\/2Mf)
From Lemmas 9.34 - 9.36 we get:
1
.
0 < A < AT, D
9.3. The Navier-Stokes
equations
405
9.37. Theorem. Assume d — 3 and let /xo denote the smallest eigenvalue of Ao. Furthermore assume that condition (9.174) is satisfied for g. Then the evolution problem (9.141) has for any UQ <E V with 1/2 2
a unique mild solution on [0, oo). Proof. Existence and uniqueness of mild solutions follows immediately from Theorem 6.17, a). We have to observe that DndomA(O) = D and T+(0, u0) = oo for UQ £ D. D b) For arbitrary initial data in V we can only prove local existence of solutions. We set D = H and define
{
1— 1
1 l0 M, for u e V,
T,
(1 + K ) 2
otherwise.
9.38. Lemma. The functional
w = w-lim u n
in V.
n—t-oo
As in the proof of Lemma 9.30 we see that w = u. From linin^oo
1 / 2
-l)2,
La,T = l .
Proof. Choose a e [0,1). It is easy to see that
a^O, 6 ( t ) = 4 ( M + i|fl(t)|^).
Chapter 9. Applications
406
to Concrete
Systems
Proof. Choose (3 G [0,1), T > 0, t G [0,T] and u0 G D0. From Lemma 9.29 we see that there exists a \p,T > 0 such that for any A G (0, A^r] there exists s.u\ £ dom A0 satisfying -{ux
-u0) = A(t)u\
and limAj.o \u\ — UQ\V = 0. Note that UQ G Dp implies \u\v
<((l-ay^-lf2=:a,
so that we can take A ^ T = A Q ,T with AQ]x according to Lemma 9.29. We have to establish the inequality for the functional ip. Observing that the function h(s) — 1 — (1 + s)~2 is concave for s > 0 we get h(s2) — h(s\) < h'(si)(s2 — si) for s\,S2 > 0. This implies (taking si = \UQ\V, S2 = |«AIV)
(9.178)
I(^M_vM)<|^i_>2Ji, A
O<X<X0,T.
A [i. + \U0\v)
Multiplying equation (9.145) for d = 3 with u = w\ = u\ by (1 + JMOIV) - 3 we obtain 4 2\ux\v-\u0\v 1 4 rqi~rt 8M2 6 2X (9 179)
-
A ( i + i ^ ) 3 - l~|MAI^ +
^m"){i+\u,\ir
For 0 < A < A/3,T- From lim^o \u\ - UQ\V — 0 we see that there exists a r e X/3,T € (0, A/3,T] such that \u\\v < 1 + |«o|y f° ^ (0, A ^ T ] . This together with (9.178) and (9.179) implies
i(p(« A ) - ^(tio)) < 4 ( ^ + J| 5 (t)| 2 H ),
0 < A < X0,T.
It remains to prove the property for the function MO —• Xpx a s stated in Remark 6.3 on page 202. Since we can define Xp^iuo) also in the present case by (9.166), we can proceed exactly as in the proof of Lemma 9.32 in order to establish that Xgtx{uo) satisfies this property. • From Lemmas 9.38 - 9.40 we get: 9.41. Theorem. In case d = 3 the evolution problem (9.141) has for any u0 £ V a unique mild solution on [0,T+(uo)), where T+(u0) > 0 is uniquely determined by UQ. Proof. According to Theorem 6.17, a), there exists for any UQ £V & unique mild solution on [0,T + (0, UQ)). Note that «o €E V implies (p(uo) < a+ = 1 and that D n d o m , 4 ( i ) = H. We set T+(u0) = T + ( 0 , u 0 ) . From Lemma 9.40 we get (see the definition of ip in (6.4)) 32M 4 4 /"' r/;(t,0,
t > 0, u0 G V.
9.3. The Navier-Stokes
equations
407
Since the mapping t ->• ip(t, 0, y(uo)) i s monotonically increasing on t > 0 and V>(0,0,<£>(uo)) = ¥>(uo) < 1 for uo € V, there exists a unique T + (w 0 ) > 0 such that xp{T+(u0), 0, p(tio)) = 1. D
This page is intentionally left blank
CHAPTER 10
Approximation of Solutions for Evolution Equations In this chapter we present approximation results for mild solutions of the evolution problem EP(A(-),s,xo). For many of these results the approximation is done by solutions of approximating evolution problems. Results of this type can also be viewed as results on continuous dependence of solutions of EP(A(-),s,xo) on the family of operators A(t), 0 < t < T m a x . In Section 10.1 we first state and prove approximation results of Lax-Richtmyer type and then investigate the relationship of the consistency hypothesis to resolvent convergence. Here we follow closely the presentation in [Miy]. At the end of Section 10.1 we obtain some Trotter-Kato type theorems for nonlinear semigroups as a consequence of the general theory. In Section 10.2 we prove Chernoff's theorem for time dependent evolution problems thus generalizing the results given in [Br-Pa] and [Miy-O]. As an application we consider in Section 10.3 operator splitting methods for the approximation of nonlinear semigroups. Below in Section 10.1, when we state the uniform (with respect to the approximation index) analogues to assumptions (El) and (E2), we - for simplicity of presentation - consider the case a+ = oo only.
10.1.
Approximation by approximating evolution problems
Let Xn, n = 1,2,..., be a sequence of closed linear subspaces of X and An(t), 0 < t < T m a x , n = 1,2,..., be operators on Xn. Together with EP(A(-), s, xo) we consider the approximating problems EP^C),',*™)
jtun(t)
£ An(t)un(t),
s
un(s) = xn € Xn. As in Chapter 6 we assume that an extended real valued non-negative, lower semi-continuous functional
410
Chapter 10. Approximation
of Solutions for Evolution
Equations
(Elu) For any (3 > 0 there exists a continuous function fp : [0, T max ) —> X and, for any T G (0,T m a x ), an increasing function L/3,T : Rjj" ~~^ ^o~ and a constant u>p,T G R sttc/i tftaf, /or n = 1,2,..., 0 < A < 1/|W/3,T| and 0 < ti,t2 < T, we have (1 - \U>/3:T)\XI
-X2\
< I n - a;2 - A(yi - y 2 )| + Mf0(ti)
- //3(t2)|i/3,T(|a;2|)
/or a?Z [xi,yi] G i4 n (ij) IM£/J x* G Dp, i = 1,2.
(E2u) For any /3 > 0 £/»ere exists a continuous function fp : [0, T max ) —> X which is of bounded variation on compact intervals and, for any T G (0,T m a x ), an increasing function Lptr '• Ro~ —> ^o and a constant >jJp,T £ K sucft i/tat, /or n = 1,2,..., 0 < A < l/\ujpiT\ and 0 < t\, £2 < T, we have (1 - \ojplT)\xi
~ x2\
< | n - x 2 - A(j/i - !ft)| + AI/sC*!) - Mt2)\LPtT(\x2\)(l
+ life I)
for all [xi,yi] G An{U) with Xi G Dp, i = 1,2. (C)
{Consistency) For any T G (0,T max ) i/iere exisis an increasing function a : R j -t R$ with a{j3) > f3, (3 > 0, such that for all (3 > 0, t G [0, T] and [x, y] G A(t) with x G -D/3 there exist elements [xn, Vn] G An(t) with xn G Da^p), n = 1,2,..., sucft £/ia£ lim £„ = £
and
lim yn = y.
Assumption (Elu) resp. (E2u) implies that (El) resp. (E2) with a+ = 00 is satisfied for the operators An(t), 0 < t < T m a x , uniformly with respect to n. As in Chapter 6 we henceforth assume that tJa,T > 0. We shall need an estimate for the difference of mild solutions and step functions on meshes with max^(i^ — £*_j) —» 0 as A l 0. 10.1. Lemma. Assume that the family of operators A(t), 0 < t < T m a x , satisfies assumptions (El) and (Rl) resp. (E2) and (R2). Let s,T G [0,T max ) wit/i s < T, £0 G D n dom A(s) and To G (T, T max ) 6e given. In case of assumption (E2) we assume in addition that XQ G Dndom A(s). Suppose that the sequences (tf)i=o,...,Jv*, (ar*)i=o,...,w», (y*)*=i JVA, ( e . ^ i , . . . , ^ satts/y (6.24), i^ x > T /or A G (0, A0] and limA;o d\ - 0.
10.1. Approximation
by approximating
We set, for 0 < A < A0
evolution problems
411
ands
= / X ° / ° r t = s> \x$ fortl1
\vx{t) - u(t)\ < e^r0(2t+dx)
Aa,o _ u |
\XQ
-
U\ Nx
(d\ + dx(T0 - s))1/2(\v\
+ Mpf,To(T0))
+ J2 hXn\eXn\ =i
2
M(T0 - s){-cpf
Pft7h(8J)
for s < t < T, provided A is sufficiently small. The constant M can be chosen as an increasing function in each of the variables \u\, \v\,a,T, \XQ\ and, in case of assumption (E2), also of \\A(S)XQ\\ and is independent of the sequences Proof. According to Theorem 6.17, a) and b), there exists a unique mild solution u(-) of EP(A(-),s,x0) on [s,T\. Let (wM)o<M
kx,jjv\(t)
- Ufj,(t)\ < \XQ -U\ + \X0 - u\ + Ck^(0)(\v\
n=l
+ M(tl
+
Mpf,To(T0))
1=1
- s)[-cPflTo(To)ck^(a)
+
pftTo(8))
412
Chapter 10. Approximation
of Solutions for Evolution
Equations
for A, JJ, sufficiently small. Without restriction we can assume that in addition kx T
kx\
U
^ e x p ( 2 o , Q , T o ( X > » + Z ) h e ) ) < exp(2u;Q,To(2* + dx + d^)).
By definition of c%j{p) in (6.20) we get l i n i c f e w > ) = ((tl
- t - of + dx(tl
s))1'2
-
jX\\J
<{(dx~°f
dx(T0-s))1/2.
+
Taking first p 1.0 a n d then a \. 0 in (10.1) we obtain i 2t+d K'--l-»*, I j ^ _ \VX{t) - U{t)\ 2^
u
|
+
\XQ _
u
Nx
+ {d\ + dx(T0 - s))ir2(\v\
+ Mpf,T0(T0))
+ $>*|e*| 71=1
+ dx(T0 - s))1/2
+ M(T0 - s)(±Pf,T0(T0)(dl
+
Pf,To(5))
for s < t < T and A sufficiently small. The constant M is the constant given in the proof of Lemma 6.13, i.e., M =
max(L(\u\)K(\v\),L{M)K(M)),
where M is a bound for \xf\ and, in case of assumption (E2), also of \y^\, which correspond to the DS-approximation uM. According to Lemma 6.9 applied to the sequences corresponding to w^ a bound for \xf\ is given by M = \u\ + e ^ ^ o ( i ^ _ u\ +
To|w| + 7o +
where To resp. a > 0 is chosen such that t't
p / i T o (T 0 )),
< To resp. u„ is confined to D&.
The constant 70 is a bound for J2j=i h^\e^|. Since we have J2j=i ^jl^j I ~~^ 0> *VM ~*• M M uniformly and i^ —» T as /i J, 0, we can take M:=MX
= \u\ + e2^TT{\x0
-u\ + T\v\ +
pf,T(T))
in case of assumption (El). In case of assumption (E2) we see also from Lemma 6.9 that a bound for \y^\ is given by M 2 = e^,TT+L{Ml)v,rl0iT1
/(p(s)a;o||
+ L{Ml)
var [0iT] / ) ,
so that in this case we have to choose M = max(Mi, M2). The basic approximation result is the following:
D
10.1. Approximation
by approximating
evolution
problems
413
10.2. Theorem. Let s,T G [0,T max ) with s
Un{t;s,x„)\
=0
uniformly on [s,T], where u(-;s,xo) resp. un(-;s,x„) denotes the unique mild solution of EP(A(-),S,XQ) resp. EP(An(-),s,x„) on [s,T]. b) Assume that the operators An(t), 0 < t < T m a x , n = 1,2,..., satisfy (E2u) and (C). Moreover, we assume that the operators An{t), 0 < t < T m a x , n = 1,2,..., and the operators A{t), 0 < t < T m a x , satisfy (R2), where the functions an,bn corresponding to (R2) for the operators An{t) are bounded in I/ 1 (0, T; K). Then for any XQ 6 D n dom A(s) i/ie following is true: Let P > 0 be such that XQ £ .D^. For any sequence (x n ) ng p) iw£/i £„ G Z>/3 ndom^4 n (s), n = 1,2,..., suc/i iAaf lim^oo xn = x0 and (\\An(s)xn\\)neN is bounded we have lim \u(t;s,xo) - un(t;s,xn)\
=0
uniformly on [s,T]. Proof, a) We first prove that assumption (El) resp. (E2) holds for the operators A(t), 0 < t < T m a x . Indeed, let [xi,yi] G A{ti) with Xi G Dp for some 0 > 0 and U £ [0,T] for some T G (0,T m a x ), i = 1,2. According to the consistency assumption (C) we can choose [x",yf] G An(ti) with x™ G i?Q(/3) and lim^oo x? = Xi, limn^oo j/f = yu i = 1, 2. For any n = 1, 2 , . . . we have (1 - A w a W , r ) | x ? - x2n| < |x? - *£ - A(tf - y2ra)| + A|/ Q ( / 3 ) (ti) - / Q(/3) (i 2 )|i Q(/3) (|x 2 l |) J fr(|2/ 2 re |)
for 0 < A < l/ua(0),T- Taking n ->• oo we see that (El) resp. (E2) is satisfied for the operators A(t), 0 < t < T max (we may have to replace La^ by the function £«(£) defined by La^(r) = lim^oLa(p)(r + h), T > 0). According to Theorem 6.17 the mild solutions u(t) = u(t;s,Xo) of EP(A(-),S,XQ) and un(t) — un(t; s, xn) of EP(i4 n (-), s, arn) exist on [s, T] and are unique. Moreover, we have
< max
ipn(t,s,j3),
414
Chapter 10. Approximation
of Solutions for Evolution
Equations
where ^n denotes the function corresponding to an, bn according to (6.4) for e = 0. Let c > 0 be chosen such that |an|z,i(o,r;R)i l&nU^o.TsR) < c, n = 1,2,... . Then we have max ipn(t, s, f3) < /3ec + cec,
n = 1,2,... .
s<.t<-T
Choosing J3 appropriately we see that un(-), n = 1,2,..., and u(-) are confined to Dp on [s,T]. b) We first consider the case where assumptions (Eul), (Rl) etc. hold. Let u\, 0 < A < Ao, be a DS-approximation of EP(A(-), s, xo) on [s, T] with lim\u(t) - ux(t)\ = 0 AJ.0
uniformly on [s,T]. Let j3 > 0 be such that u\, 0 < A < Ao, is confined to Dp and let (t^,x$, y$,e^) be the sequences associated with u\. We choose To £ (T,Tmax) such that ijy < To, 0 < A < Ao- The consistency assumption (C) implies that there exist sequences [xi,n,yi'n] G An(tf), i — 1,...,N\, 0 < A < A0, such that x^'n G Da^ and lim7l_+00 x*,n = £*, l i m ^ o o y^'n = y£, i = l,..., N\, 0 < A < Ao- For any e > 0 and A G (0, A0] we choose n(e, A) G N such that, for n > n(e, A), we have (10.2)
\x$'n-x$\<e
and \y?'n - y?\ < e,
i=
l,...,Nx.
We set x0'n = xn, 0 < A < AQ, n = 1,2,..., and define xn ^."(')-U^
for t = s, 1
,wA f tort*_
=
l,...,Nx.
Without restriction we can assume that \xn — XQ\ < e for n > n(e, A). Using (10.2) we get, for n > n(e, A), the estimate (10.3)
\ux(t) - UA,n(<)| < e,
« < t < T, 0 < A < A0.
We set A.n
e,
A,n ^i
= —
A,n i-l
— x
A,re
Vt
and get from (10.2) the estimate Nx
J^h}\e$'n\ 2=1
Nx
<J2hi\ei\ t= l
+ C2Nx+Nxdx)e+\xn
- x*|,
n > n(e, A).
10.1. Approximation
by approximating
evolution problems
415
Using this estimate, the estimate (10.3) and Lemma 10.1 for the associated sequences (£*,a^'",y i 'n,ei ' n ) and the mild solution un(-) we get, for n > n(e, A), \u{t)-un{t)\ < \u(t)
- UX(t)\
<\u(t)-ux(t)\ + (1
°'4)
2 e
+ \uX(t)
- U A ,„(<)| + |«A,n(*) -
Un(t)\
+e
"aW),T0(2t+dx)
U ^
_ ^ j
+ K + dx(T0 - s))1/2(\zn\
+
+
Xn
XQ
I
MnPf,To(T0))
Nx
+ Mn(T0 - s)[-cpf,To(T0)(dl
+ dx(T0 - s))1/2
+
pf,To(6))
s < t < T, for any real numbers S, c with 0 < c < 8 < T0 and any [wn, zn] G An(s) with wn G Da(py Given any [u, v] G A(s) with u € Dp we choose [wre,,zra] according to (C) such that wn —> v, and zn —> v as n —> oo. Since x n G £>/?, n = 1, 2 , . . . , the mild solutions un(-) are confined to D*. Moreover, the sequences (|tu n |), (\zn\) and (|a;n|) are bounded. Therefore, in view of Lemma 10.1, the constants Mn in (10.4) are bounded, M = sup n Mn < oo. Taking n —> oo in (10.4) we obtain limsup \u(t)— un(t)\ n—voo
< \u(t) - ux(t)\ + e + e2^(3),T0(2t+dx) | 2|a;0 - u| + |zo - 4 1 4- {d\ + dx(T0 - s))1/2{\v\
+
Mpf,T0{T0))
Nx
+ M(T 0 - *) ( ^ / ; r o ( r o ) K + dx(T0 - s))1/2
+ pf,T0(S))
Taking first e 4- 0 and then A \. 0 we have limsup |u(t) - un{t)\ < e4u"^^t(2\x0
- u| + M(T0 - s)pfiTo(S)),
s
416
Chapter 10. Approximation
of Solutions for Evolution
Equations
From XQ S Dp n dom A(s) it follows that we can choose (ufe) C -D/3 fl dom A(s) with limfc-^oo Uk = XQ. Observing also lim^o Pf,r0 ($) = 0 we finally get lim \u{t) — un{t)\ = 0 uniformly on [s,T]. The proof for the case where assumptions (E2u), (R2) etc. hold is quite analogous to the one given above. Therefore we only indicate the differences. Since in the present case the constants Mn depend also on H ^ ^ a ^ l j (compare Lemma 10.1), we need boundedness of these elements in order to have M = supra Mn < 00. The rest of the proof is exactly the same as before (note that we could assume that Yln=i hn\en\ = 0)'-' Recall that for an operator A C X x X and a subset D e l the restriction of the operator A to D is the subset A\D={[x,y]
£A\xGD}.
For a sequence (Dn)neN of subsets of X we define (10.5)
lim Dn = { « e l |there exists a sequence (un)ne^s with ° un G Dn, n = 1,2,..., and lim un = u\.
n_fo
n—>oo
Using these notations assumption (C) can be written in the following form: (C)
For all T £ (0, T max ) there exists an increasing function a : M£ —» K j with a(/3)> /3, (3> 0, such that for all (3>Q and t £ [0,T] we have W)
\D0C. Km^A^t)
\Da{0) .
If we can choose tp = 0 (which implies Dp = X for all /3 > 0 and in view of assumption (Elu) resp. (E2u) that the operators A(t) and An(t) are u>dissipative for some w > 0), then assumption (C) is equivalent to (10.6)
A(t) C lim An(t),
0 < t < Tmax.
In the following we shall investigate the relation between convergence of dissipative operators in the sense of (10.6) and convergence of their resolvent operators. We first state some simple results on limits of sequences of subsets of X as defined in (10.5). 10.3. L e m m a , a) Let (Dn)n€N be a sequence of subsets of X. limra_>oo Dn is closed and
Then the set
lim Dn = lim Dn. n—>oo
b) Let A C X x X and An C XxX,
n—foo
n = 1,2,...,
be given. If A C l i m ^ o o An,
10.1. Approximation
by approximating
evolution
problems
417
then dom A c lim domA n
and range A c lim range An.
Proof, a) It is clear that limn_»oo Dn = linin^oo Dn. We set D = linin^oo Dn. For x 6 D we choose a sequence (yfe)fceN C D with lim^oo y^ = x. For each fc = 1,2,... there exists a sequence (x„ )„eN with x „ ' £ D„, n = 1,2,..., and linin^oo We choose a strictly increasing sequence (rik)keN such that \yk ~ x^\
< -
for n > nfc,fc= 1,2,... .
For n = l , . . . , n i we choose xn £ Dn arbitrary and set xn = x<£) for n = rife+ l , . . . , n f c + i , fc = 1,2,... . It is easy to see that lim„^oo xn = x, i.e., we have x € D. b) According to a) we only have to prove that dom A C limj^oo dom An and ranged C limn_>.00 range v4.n, which obviously follows from ^4 CZ limn_».CXD An. D Recall that, for an w-dissipative operator A C X x X with w > 0, J\ = (I — XA)-1, 0 < A < 1/u, is a single-valued operator range(T — XA) —>• domvl (see Proposition 1.9). In the following we set Jn,\ = (I — A / l n ) _ 1 for wdissipative operators An on X. 10.4. Theorem. For some cu > 0 let An, n = 1,2,..., arcd A be w-dissipative operators on X satisfying dom An C range(7 — XAn) for X € (0,1/w) and n = 1,2,... B = {[Jxx,Axx]
and dom A C range( J — A/1)
. The operator B is defined by1 | x e dom A, A e ( 0 , l / o i ) } .
Then the following two statements are equivalent: (i) B c lim n ^ooyl ra , (ii) a) dom A C limn^oo dom An. b) For all x G dom/I and all sequences (xn)nejq with xn £ n = 1,2,..., and limn_>oo xn = x we also have lim Jn,\Xn — J\x, If, in addition, we have dom A C domAn (ii) is equivalent to
domAn,
0 < A < 1/u. for all n = 1, 2 , . . . , then (i) resp.
1 Recall that A\x = A X{J\X — x), x G dora/lj, = range(7 — \A), 0 < A < l/u> (see (1.13)).
Chapter 10. Approximation
418
of Solutions for Evolution
Equations
(iii) limn^oo Jn,\X = J\x for all A G (0,1/w) ana" aZ/ a; G domA. Proof, a) Assume that (i) is true. From Lemma 10.3, b), we conclude that dom B c lmin^oo dom An. For all x G dom A we have lim^o J\x = x (compare Theorem 1.10, (iii)), which implies domA C d o m B . Since domJ5 C domA is obvious, we have dom A = domB and consequently domA C lim^,-^ dom Ara. Let xn G dom An and x G dom A with lirrin-xx, xn — x be given. From range(7 — \An) D dom An we see that xn G range(7 — \An), n = 1,2,... . We have to prove that l i m n - ^ Jn,\xn = J\x, 0 < A < 1/w. Using (i) we see that, for any A G (0,1/w), there exist elements [un, vn] G An, n = 1,2,..., such that (10.7)
lim un ~ J\x
and
n—>oo
lim vn = -r(J\x — x). n—>oo
A
Since we have xn G range(7 — XAn), there exist xn G dom A„ and yn G Anxn such that xn = xn ~ Xyn- It is clear that xn = Jn,\xn- Dissipativity of An implies (see Proposition 1.8, (ii)) (1 - uj\)\un - xn\ < \un ~xn-
\(vn -yn)\
= \un - Xvn - xn\.
Using (10.7) and lmin-^oo xn = x we see that hin^^oo \un — xn\ = 0 and consequently lim Jn,\xn
= lim xn = lim un — J\x.
b) Let (ii) be true. We choose [u,v] G B and x G domA, A G (0,1/w) such that J\x = u and A _ 1 ( J \ x - x) = v. From domA c linin^oo d o m A n we conclude that there exist xn £ domA„ with lim^^ooXn — x. By assumption (ii) this implies l i m ^ o o Jn,\xn = J\x = u and, moreover, l i m ^ o o A _1 ( Jn,\xn - x„) = X~l(J\x - x) = v. Since J„,\xn G dom An and X~l(Jn,\xn - xn) £ AnJn,\Xn (compare Theorem 1.10, (ii)), we conclude that \u,v\ G l i m n - ^ A„. c) Assume that dom A C dom An,n= 1,2,..., which trivially implies dom A C limn-too dom A„ = lim„^oo dom A„. If (ii) holds, then, for any x G domA, we can choose xn = x, n = 1,2,..., and get from (ii) that lim^^oo Jn,\x — J\x, 0 < A<
1/LO.
If on the other hand (iii) holds and we have xn G domA„, x € domA with limra_Kx>£7i = x, then (using also Theorem 1.10, (i)) \Jn,\Xn ~ J\X\ < \Jn,\Xn
- Jn,\x\
+ \Jn,\X -
JXx\
-1
< (1 — A o ; ) ) ^ - x\ + \Jn,\x - J\x\ -> 0 as n ->• oo. D A stronger result can be established when the operators are m-dissipative:
10.1. Approximation
by approximating
evolution
problems
419
10.5. Theorem. Let An, n = 1,2,..., and A be uj-dissipative operators on X, w > 0, which are also m-dissipative, i.e., range(7 - \An) = range(7 - XA) = X,
n = 1, 2 , . . . , 0 < A < 1/w.
Then the following statements are equivalent: (i) A = Y\mn^00An. (ii) A C l i m ^ o o An. (hi) For all x G X and all sequences (x n ) nG N C X with linin^oo xn = x we have lim Jn \xn = J\x
for all A G (0,1/w).
(iv) For all x £ X and all A € (0,1/w) we /lave lmiji-xx, Jn>,\x = JAX. (v) For some AQ € (0, l/a>) we /lave lim,,.-^ Jn,x0x = JA 0 X /or a?Z i £ X . Proof. The implications (i)=>(ii), (iii)=>(iv) and (iv)=>(v) are obvious. The proof for (ii)^=^(iii) is analogous to the proof for the implication (i)=>(ii) in Theorem 10.4 if we observe that, for x G X, we have J\x G domA and A\x = X_1(J\x — x) G AJ\x, 0 < A < l/ui (compare Theorem 1.10, (ii)). In order to prove that (v)=>(ii) we choose [x,y] € A. According to (v) we have lim Jn,x0(x - X0y) = J\0(x - X0y) = x, n—too
and lim — (J n ,\ 0 {x - X0y) - {x - X0y)) = — (x - {x - X0y)) = y. n->oo Afj
^0 1
Since we have Jn,\0{x - X0y) G dom An and A^ (Jnt\0(x - A0y) - (x - X0y)) = AnJn,\0{x — ^oy) (see Theorem 1.10, (ii)), we have shown that A C hin^^oo An. It remains to prove that (ii)^=^(i). Let [x,y] G linin-xx, An be given, i.e., there exist [x„,yn] G A„, n = 1,2,..., such that lim^^.^ xn = x and l\mn^xyn = y. Consequently we have also lim n _ >00 (x n - Xyn) = x - Xy, 0 < A < \/UJ. Then by (hi) (which is implied by (ii)) we have x = lim xn = lim
J„,A(X„
- Xyn) = J\(x - Xy) G domA.
This and y = -{x-{ximply [x, y]eA.
Xy)) = j(J\(x
- Xy) - (x - Xy)) e AJx{x - Xy) = Ax D
10.6. Theorem. Let An(t), n = 1, 2 , . . . , and A(t), 0 < t < T m a x , be operators on X satisfying the following conditions:
420
Chapter 10. Approximation
of Solutions for Evolution
Equations
(i) There exists a continuous function f : [0,T max ) —>• X, which is of bounded variation on compact intervals and, for all T £ (0, T m a x ), an increasing function LT '• Ko" —> RQ" and a constant o i y G l such that, forO<\< 1/\UT\, n = 1,2,..., h,t2 £ [0,T], we have (1 - Xu}T)\xi
-x
2
< |n - x
2
|
- A(yi - y 2 )| + \\f(h)
- f(t2)\LT(\x2\)(l
+ \y2\)
for all [xi,yi] £ An(U), i = 1,2. (ii) We /lave range(7 - AA„(i)) = X, n = 1,2,..., for A > 0 and t £ 1^5 -imaxj-
(iii) For all T £ (0,T m a x ) there exists a Ay £ (0, 1/|WT|) such that for all x £ X and all t £ [0, T] the limit J\T(t)x
:= lim
JnxT(t)x
exists.2 Then the following is true: a) The operators A(t), 0 < t < T m a x ; defined by the graphs GA(t) = {[JxT{t)x,\T\J\T{t)x
-x)}eXxX\xGX}
satisfy assumptions (E2) with a+ = oo and (R2'). b) For any s £ [0, T max ) and XQ £ dom^4(s) and any sequence (xn)nefq xn £ dom An(s) and linin^oo xn = xo we have lim un(t;s,xn)
= u(t;s,Xo)
with
uniformly for t in bounded intervals.
n—>oo
Here un(-;s,xn) resp.
resp.
U(-;S,XQ)
denotes the mild solution of
EP(An(-),s,xn)
~EP(A(-),S,XQ).
Proof. We set D = X and f = 0. Then assumption (i) is just (E2u) for this special case. In order to prove that assumption (E2) holds for the operators A(t) we fix T e (0,T max ) and choose U e [0,T], [uuVi] £ A(U), i = 1,2. The definition of the operators A(t) implies that m = J\T{U)xi and vi = Ay (J\T(U)xi — Xi) for some Xi £ X, i = 1,2. By assumption (iii) we have lim Jn,xT(ti)xi
=m
and
71—KX)
lim — (jn \T(ti)xi
71—fOO A 7 1
- xt) = v,,
i = 1,2.
Since we have X^l{Jn,\T{U)xi - xt) £ An{ti)Jn^T{ti)Xi) (see Theorem 1.10; note that assumption (i) implies that the operators An(t), 0 < t < T, are 2
We set Jni>,(t) = (I-
XAnit))-1,
0 < A < 1/\LJT\,
0
10.1. Approximation
by approximating
evolution problems
421
w-r-dissipative), we get from assumption (i) the estimate (1 - XLOT)\ Jn,\T{ti)xi
-
< \Jn,\T(ti)xi
Jn,\T(t2)x2\
-
Jn,\T(t2)x2
- XX^} [jntxT(ti)xi
-Xi-
(J„,XT(t2)x2
+ AL T (|J„, A T (i 2 )x 2 |)(l + X^\Jn<XT(t2)x2
-X2))\
- i2|)|/(ti) -
f(t2)\
for 0 < A < l/|w T |- For n -» oo this implies (1 — \wT)\ui
— u2\ < \Ul -u2~
\{vi -v2)\+
XLT(\u2\)(l
+ \v2\)\f(h)
-
f(t2)\
for 0 < A < 1/\LOT\, which proves (E2) for the operators A(t). By assumption (ii) we see that the operators An(t) satisfy the range condition (R2'). For any x G X and t £ [0, T] we get x = J A T . ( i ) x - A T ( — (JxT(t)x-x)}
= (I -
XTA{t))JxT(t)x,
which implies i&nge(I — XrA(t)) = X, i.e., the operators A(t) satisfy also (R2'). By definition of the operators A(t) it is obvious that the consistency assumption (C) holds. By Theorem 10.2, b), we see that lim un(t; s, xn) = u(t; s, x 0 )
uniformly for t G [0, T]
n—>oo
for any XQ G doirij4(s) and any sequence xn G dom An(s) with limn^^Xn = Xo such that (||A n (s)x n ||) n6 N is bounded. Since we have Xo = J\T(S)XQ = lim^^oo J„ I A T ( s )*o and X^1 {Jn,\T(s)^o ~ ^o) S An(s)Jn<xT{s)x0, it is clear that xn — Jn,\T{s)%Si ra = 1,2,..., is such a sequence. Next let (x n ) n 6 N be a sequence with xn G dom An(s), n = 1,2,..., and limn-^oo x„ = xo G domA(s). We have xo = l i m n - ^ J n ,A T (s)xo and lim \u(t;s,xo)—
un(t;s,Jn\T(s)x0)\
=0
n—>oo'
uniformly on [s,T] for some xo G X. This and (see Theorem 6.20) |w„(i;s, J „ ; A T ( S ) X 0 ) - M „ ( i ; s , x n ) | < e " ^ * - ^ (| J„,A T (S)X 0 - x 0 | + |x 0
-x„|)
for s < t < T show that lim \u(t;s,xo) — un(t;s,xn)\
=0
uniformly on [s,T].
In case xo G d o m i ( s ) we choose a sequence (xo,fc)fceN C domA(s) with linifc^oo x0,fc = x 0 and, for each k = 1,2,..., elements x„ G dom^4ra(s),
422
Chapter 10. Approximation
of Solutions for Evolution
Equations
(k)
n = 1,2..., such that lim„_>oo xn (using again Theorem 6.20) \u(t;s,x0)
= £o,fc, fc = 1,2,... . We get the estimate
-un(t;s,xn)\
< \u(t; s, x0) - u(t; s, x0,k)\ + \u(t; s, x0,k) - un(t; s, x^)\ + |u„(i;s,^ f c ) )
-un(t;s,xn)\
s
< e ^ ( ' - ) ( 2 | x 0 - x0,k\ + |4 f c ) " so,*I + ko - xn\) + \u(t;s,x0,k)
-un{t;s,x^)\.
For e > 0 we choose fco £ N such that \XQ — xo,k\ < ee~UJTT/2. Since fco) limn^.oo |a4 - x0M\ = °> lim^oo \x0 - xn\ = 0 and limn_^.00 \u{t;s,x0iko) un(t;s,xn°)\ = 0 uniformly for t £ [s,T], we can choose % C M such that, for n > n 0 , we have e a;T( '~ s) (|a;i fco) - xQM\ + \x0 - xn\) + \u(t;s,x0iko) un(t;s,Xn° )\ < e/2 for t £ [s,T]. Thus we have \u(t;s,Xo) — un(t;s,xn)\ for s < t < T and n > no, which proves the result.
<e •
Finally in this section we present some Trotter-Kato type theorems for strongly continuous semigroups of nonlinear Lipschitzian operators. As a corollary to Theorem 10.2, a), we obtain: 10.7. Corollary. Assume that the operators A C X x X and An C X x X, n= 1,2,..., satisfy the condition A C lim An n—foo
and the tangential condition (6.59), i.e., 1 liminf — dist(range(7 — \A),x) AJ,0
=0,
x £ dom^4,
= 0,
x £ domAn,
A
and liminf — dist(range(7 - XAn),x) A4.0
A
n=l,2,...
.
Moreover, suppose that the operators An, n = 1,2,..., are ui-dissipative. Then for every x £ dom A and xn £ dom An with lim^-,.^ xn = x we have (10.8)
lim \Sn(t)xn
- S(t)x\ = 0
uniformly on bounded t-intervals,
w/iere S(-) and 5 n (-) are the semigroups generated by A resp. by An. Moreover, for every x £ dom A there exist xn £ domA n , n = 1,2,..., such that lim^^oo xn =x and, consequently, (10.8) holds.
10.1. Approximation by approximating evolution problems
423
Proof. Obviously assumption (Elu) is satisfied for the operators An, n = 1,2,... . For the special situation considered in this corollary the consistency assumption (C) is equivalent to A C l i m , , - ^ An (see (10.6)) and the tangential condition implies the range condition (Rl) with an = bn = a — b = 0. In the proof of Theorem 10.2 we have shown that A satisfies assumption (El), i.e., A is w-dissipative. According to Theorem 6.27 the operators A resp. An generate strongly continuous semigroups of type u> on dom A resp. on domAn. Then (10.8) follows from Theorem 10.2, a). The last assertion of the corollary follows immediately from Lemma 10.3, b). • As a consequence of Corollary 10.7 and Theorem 10.4 we have: 10.8. Corollary. Assume that the operators A C X x X and An c X x X, n= 1,2,..., are w-dissipative and satisfy the range condition (5.5), i.e., dom A C range(7 — \A)
and dom An C range(i" — XAn),
A G (0, l/w).
Furthermore suppose that statement (ii) of Theorem 10.4 is true. have lim \Sn(t)xn
— S(t)x\ = 0
Then we
uniformly on bounded t-intervals,
where S(-) and Sn(-) are the semigroups generated by A resp. by An. If in addition we have dom A C domAn! n = 1,2,..., then (ii) of Theorem 10.4 is implied by the resolvent convergence lim Jn,\x = J\x
for A G (0,1/w) and x G dom A.
n—foo
Proof. Let B be the operator defined in Theorem 10.4. In part a) of the proof for Theorem 10.4 it is shown that dom A = d o m 5 . For x G dom A we have x = J\x - \A\x implies
e (I - \B)J\x,
A G (0,1/w). This
range(7 — XB) D dom A = dom B. By Corollary 5.4 the operator B generates a strongly continuous semigroup T(-) of type u> on dom A. According to Theorem 10.4 we have B C lmin-nx, An. It is trivial that the range condition (5.5) implies the tangential condition (6.59). Therefore we get from Corollary 10.7 that for x G dom A = domB and xn G dom An, n = 1,2,..., with limn-^oo xn = x we have lim Sn(t)xn
= T(t)x
uniformly on bounded t-intervals.
Let x G domA = domfi be fixed. From Theorem 5.8 we conclude that t -4 T(t)x resp. t —> S(t)x is the unique integral solution of u G Bu, u(0) = x, resp. of u G Au, u(0) = x. From B C A it is clear that an integral solution
424
C h a p t e r 10. Approximation
of Solutions
for Evolution
Equations
for u G Au, u(0) = x, is also an integral solution for u G Bu, w(0) = x (see Definition 5.5, b)). By uniqueness of integral solutions we have T(t)x = S(t)x,
t > 0, for all x G dom A
The last assertion of the corollary follows immediately from Theorem 10.4.
D
As a consequence of Theorem 10.6 we get a version of the Trotter-Kato theorem which is analogous to the version given in Theorem 4.6 for strongly continuous semigroups of nonlinear Lipschitzian operators: 10.9. Corollary. Let the operators An C X x X, n = 1,2,..., be given and assume that the operators An~wl are m-dissipative for some UJ G R. Let Sn{-) denote the semigroup generated by An according to Corollary 5.4. Furthermore assume that there exists a Ao G (0,1/ui) such that Jx0x = lim Jn%\0x n—>oo
exists for all x G X (Jn>A denotes the resolvent operator for An). following is true:
Then the
a) Let the operator A be defined by A= {[J\0x,XQ1
(JXox - x)] | x G X}.
Then the operator A — u>I is m-dissipative. b) Let S(-) be the semigroup generated by A. Then for every x G domA and all xn G dom An, n= 1,2,..., with limra_>.00 xn= x we have lim Sn{t)xn
= S(t)x
uniformly on bounded t-intervals.
n—foo
c) For every x G dom A there exist xn G dom An with limn^oo xn = x. Proof. It is easy to see that the assumptions of Theorem 10.6 are satisfied (observe that we can take D = X and ip = 0). Then the conclusions a) and b) follow immediately from conclusions a) and b) of Theorem 10.6. In order to prove statement c) we observe that Theorem 10.5 implies A C linin^oo An. Then the result follows from Lemma 10.3, b). • The following theorem demonstrates that in certain situations the consistency condition (C) can be relaxed if on the other hand we can prove existence of DS-approximations of a special form. 10.10. Theorem. Assume that the spaces X, X* are uniformly convex and that the operators A, An, n = 1,2,..., on X are m-dissipative. Furthermore, let the following consistency condition be satisfied: (10.9)
For all x G domA there exist [xn,yn] & An, n = 1,2,..., such that lim xn = x and lim yn = A°x. n—>oo
n—foo
1 0 . 1 . Approximation
by approximating
evolution
problems
425
Then, for any x G dom A and any sequence (xn) with xn G domA„ and liuin^ao xn = x, we have lim Sn{t)xn
= S(t)x,
t>0,
n—>oo
the convergence being uniform on bounded t-intervals. Proof. From Theorem 5.16 we see that the operators An resp. A generate contraction semigroups on domA n resp. on dom A which both are convex subsets of X. The operators An, n = 1,2,..., resp. A obviously satisfy assumptions (Elu), (Rl) resp. (El) with a+ = oo, (Rl). However the consistency assumption (10.9) is weaker than the consistency assumption (C). Therefore we cannot apply Theorem 10.2 directly. We first have to construct DS-approximations for u(i) = S(t)x, where for the associated sequences we have y\ = A°xf. Theorem 5.16 implies also that the minimal section A0 of A is single-valued with dom A0 = dom A and is the strong infinitesimal generator of S(-). Then Theorem 5.15 implies that, for x G dom A, we have S(t)x G dom A on [0,oo), A°S(t)x = (d+/dt)S(t)x, t > 0, and t -> (d/dt)S(t)x exists and is continuous on [0, oo) except on an at most countable subset. Furthermore, in the proof of Theorem 5.15 it is shown that t^\(d+/dt)S(t)x\
(10.10)
is decreasing on [0, oo).
Let x G dom A be given and choose T > 0. For 0 < A < 1 we define t$ = iX, x$ = S(iX)x, i = 0,...,Nx, where A(iVA - 1) < T < XNX. For \ f (A°S(T)X * J(i-i)\
i)-A°xi
e)
- A°S(i\)x)
dr,
Nx, we get Nx
(10.11)
fXNx
22x\e$\< i=l
\A°S(T)X
- A°5(([r/A] + l)A)x| dr.
Jo
Since r ->• A°S(T)X is continuous a.e., we see that \A°S(T)X - A°S'(([r/A] + l)A)x| -^ 0 a.e. as A | 0 (note that 0 < T - ( [ T / A ] + 1)A < A). From A°S(T)X = (d+ /(IT)S(T)X for r > 0 and (10.10) we see that the integrand in (10.11) is also uniformly bounded (by 2\A°S(T)X\) with respect to A. By Lebesgue's dominated convergence theorem we get Nx
limVA|e<M = 0. AJ.0 ^—' i=i
This shows that the step functions ux, 0 < A < 1, given by . . Jx for t = 0, Ux W~ \S{iX)x forte((i-l)A,iA], i=l,...,Nx,
426
Chapter 10. Approximation
of Solutions for Evolution
Equations
define a DS-approximation of EP(A,0,x) converging uniformly on [0,T] to S(t)x. For XQ 6 domyl we choose xn G dom^4re with limTl_).0O xn = XQ. The consistency assumption (10.9) implies that there exist [xi'n,yi'n] G An, i — 1 , . . . , Nx, 0 < A < 1, such that l i m ^ o o x*'n = x$ and l i m ^ o o y\'n = y? = A°xf, i = 1,...,NX, 0 < A < 1. For any e > 0 and A
(10.12)
| j / * ' n - A°xf\ < e,
i=
l,...,Nx.
We set x0'n = xn, 0 < A < 1, n = 1,2,..., and define (t\ - ) X n \xi'n
for
for
* = °' ( i - l ) A < t < » A , t = l,...,JV A .
Without restriction we can assume that |x n — xo\ < e for n > n(e, A). Using (10.12) we get, for n > n(e, A), the estimate (10.13)
\ux(t) - ux,n{t)\ <e,
0<*
0
We set A,ra
et
x
=
A,n x A,n i ~ i-\
~x
\,n
»,'
and get from (10.12) the estimate Nx
Nx
5>|e* i=l
,n
| ^ E
A
'
e
^ + (2Nx + XN^e
+ \xn ~ 4 1 ,
™ > n(e, A).
i=l
Note that ft^ = dA - A, i = 1 , . . . , Nx, 0 < A < 1. Using this estimate, (10.13) and Lemma 10.1 for the sequences (i\,xi'n,yi'n,ei'n) and the mild solution «„(•) of EP(.4 n ,0, x„) we get, for n > n(e, A), \u(t)~un{t)\ < \u{t) - UX(t)\
(10.14)
< |"(*) -
M
+ \uX{t)
- « A , n ( t ) | + |«A,n(*) ~ « » ( ' ) !
A(*)| + e + 2|x„ - w„| -I- |x„ - XQ I
+ (A2 + A(T+ 1)) V 2 |2„| + £ 2=1
0 < t < T, for any [w„, zn] € A„.
A|ezA| + (2iVA + AiVA)e,
10.2. Chernoff's
theorem
427
We choose [tu n ,z n ] according to (10.9) such that wn —• XQ and zn —• A°xo as n —> oo. Taking n —» oo in (10.14) we obtain sup
\u(t) - un(t)\ < \u(t) - ux(t)\ +
e+\x0-x%\
(\* + \(T +
l))1/2\A°x0\
n=l,2,.
i=l
Taking first e J, 0 and then A 4- 0 we have lim \u(t) — un(t)\ = 0 uniformly on [0, T]. For xo G dom ^4 and x n G dom An, n = 1,2,..., with linin-xx, xn = XQ we choose xk G dom^4 and xk,n G dom>1„, k = 1,2,..., n = 1,2,..., such that limfc->oo Xk — XQ and \xktTl — Xfc| < 1/n, n = 1,2,... . Then we have \S(t)x0
- ^ ( ^ X n l < | x 0 - Xk\ + \S(t)xk
-
+ \xk,n -Xk\ + \xk
Sn{t)xk,n\
-Xn\
< 2|x 0 - Xfc| + - + \xn - x0\ + \S(t)xk -
Sn(t)xk^n\
for t > 0. Given e > 0 we first choose fco such that |xo - xko\ < e/4 and then n 0 such that 1/n + \xn - x 0 | + |5(i)x fco - Sn(t)xko,n\ < e/2 for t G [0,T] and n > TIQ. D 10.2.
Chernoff's t h e o r e m
In this section we present a version of Chernoff's formula for the evolution problem EP(A(-), s, XQ). The basic idea for this formula is to approximate the evolutions operator corresponding to the problem EP(A(-), s, x 0 ) by a product of operators from a family of operators, which in the limit approximates the operators A{t). We first explain the basic idea behind Chernoff's formula in case of a scalar linear equation u — au, where the evolution operator is just the function eat, i e i . We have the following result: 10.11. L e m m a . For o n n £ l let f : R —> K be a function with (10.15) Then we have (10.16)
limi(/(p)-l)=a. lim f{t/n)n
= eat
428
Chapter 10. Approximation
of Solutions for Evolution
Equations
uniformly on bounded t-intervals. Proof. From (10.15) we conclude that (10.17)
f(p) = l+(a
+ g(p))p,
peR,
where g : R —• R satisfies limp_).o d{p) = 0- The representation (10.17) implies that there exists a So > 0 such that (10.18)
| / ( p ) | < l + (l + |a|)|p|
for |p| < 5 0 .
Using (10.17) we see that eat - f{t) = th(t),
(10.19)
t e R,
where h : R —> R satisfies l i m ^ o h(p) = 0. The representation n—1
eat - f(t/n)n
.
.,
= (eat/n - f(t/n))Y,f(tMJexp(^—^at),
n = l,2,... ,
3=0
together with (10.18) and (10.19) implies the estimate at
1\e
- f(t/n)n\
< ^ \h(t/n)\eM n
z] T
( l + (1 + | a | A —' \ nJ o\at\
< | / l ( t / „ ) | ( l + (l + | a | ) ^ ) Given «o > 0 we can choose no = \eat
[KO/SO] +
n I
^
)
|t|
1 and get, for \t\ < «o and n > no, |a|re 0
f(t/nr\<
sup \h(r)\(lv + (l + \ a \ ) ^ ) n ^ n J \ + \a\ ||T|
which proves (10.16).
D
It is remarkable that this result can be extended to strongly continuous semigroups in Banach spaces and even to evolution operators for time dependent problems. We start with some preparatory results: 10.12. Lemma. Let C be a closed convex subset of X and G(t), 0 < t < T m a x , operators C —> C such that t -4 G(t) is strongly continuous on [0, T m a x ). Assume that for any T e (0, T max ) there exists a positive constant 7 r such that (10.20)
\G{t)x - G(t)y\ < -yT\x - y\,
0 < t < T, x, y € C.
Then, for any x £ C, there exists a unique function u(-) = «(•; x) € C 1 (0, T; C) satisfying (10 21)
jtu(t)
= (G(t)~l)u(t),
u(0) = x.
0
10.2. Chernoff's
theorem
429
Moreover, we have for any T £ (0, T max ) \u(t;x)-u(t;y)\<e(-'n-1'>t\x-y\,
(10.22)
0 < t < T, x,y £ C.
Proof. It suffices to prove that there exists a unique function u £ C(0, T m a x ; C) with u(t) = e~lx + / e-^~s)G(s)u(s) ds, 0 < i < T m a x . Jo Note that s —» G(s)u(s) is continuous on [0,T max ), if M is continuous. Since C is convex and closed, we have, for any function v £ C(0, T; C), (10.23)
f
e
x+ f\
^G(s)v(s)ds
= (l-
\)x + A J o
t
"ww™
e
c
Jo
for 0 < t < T m a x , where A = /0'e^scJs £ [0,1). Note that ( / " e ^ ' - ^ s ) " 1 /" e- ( '- 5) G'(s)t;(s) rfs £ C because the elements we get by replacing the integrals by Riemann sums corresponding to the same mesh 0 = to < ii < • • • < £JV = t is a convex combination of the elements G{ti)v{ti) £ C, % = 1 , . . . , N, and C is convex and closed. We define a sequence of functions un £ C(0, T; C) by u0(t) = x, 24
(10- )
un(t)=e
_,
/"' x+
e
,•_ , 3) G{s)un-i(s)ds,
(
n=l,2,...,
for £ £ [0, T m a x ). By induction it is easy to see that, for any T £ (0, T m a x ), (7T*r /•*, | t i „ + i ( t ) - u n ( t ) | < ^ * T / | G ( s ) x-x\ds,
0
n = 1,2,... .
This implies that M(£) = lim n ^ 0 0 w„(t) exists uniformly on any interval [0, T], 0 < T < T m a x . Taking n ->• oo in (10.24) we see that (10.23) is satisfied. From (10.23) we obtain also, for T £ (0,T m a x ), et\u{t\x)-u{t\y)\<^T
/ es\u(s;x) -u(s;y)\ds + \x - y\ Jo for 0 < t < T, x,y £ C, which by Gronwall's inequality implies (10.22).
•
10.13. Theorem. Le£ C be a closed convex subset of X and G(t) : C —»• C, 0 < £ < Tmax, 6e a family of operators satisfying the following conditions: (i) For any T £ (0,T max ) there exists a constant 7 T > 1 such that (10.20) holds.
430
Chapter 10. Approximation
of Solutions for Evolution
Equations
(ii) There exists a constant S > 0 and a Lipschitz continuous function g : [0, T max ) —> K wii/i Lipschitz constant Lg^r on [0, T] for any T G (0, Tmax), and for any such T a non-decreasing function LT : Rg" —» RQ such that (10.25)
\G(t)x - G(s)x\ < LT(\x\){6 + \G(s)x - x\)\g(t) - g(s)\
for s,t G [0, T] and x € C. If u = u(-;x) is the unique solution of (10.21) on [0,T max ), then for any T G (0,T max ) we have the estimate: n
\u(t;x)-
(j[G(i))x
(10-26) + Lg,TLT(MT)
< 7 ? e ( 7 T - 1 ) t d T ( n , i ) ( c T + \G{0)x - x\) ft / Jo
„
, e^-^-^drin-s^-s)
x (S + \G(s)u(s;x) - u(s;x)\) ds for n = 1 , . . . , [T], t G [0, T], where MT = maxo
dr(p,q) = ((p - irqf
cT = LT{MT)LgtTT(6
p,q&R,
q> 0,
+ \G{0)x - x\).
Proof. From (10.23) and e~fx = x - / 0 e~ ( *~ s) a;ds we get (10.27)
u(t;x)-x=
I es-t(G{s)u{s;x)-x)ds,
0 < t < Tmax.
Jo
We fix T G (0,T m a x ) and obtain from assumption (i), (10.25) and (10.27) the estimate f e s -*(|G(s)u(a) - G(0)u(s)|
\u(t) -x\<
+ \G(0)u{s) - G(0)x\ + \G(0)x - x\\ ds <j\'-t(LT(\u(8)\)\g(8)-g(0)\(S+\G(0)x-x\) + \G{0)x -x\+
7T|W(S) - x\)
ds
for 0 < t < T. This implies e'|«(t) -*\<J
(e S (LT(MT)\g(s)
- 5(0)|(<5 + |G(0)a: - x\)
+ |G(0)a; -
ar|) + fre'\u{a)
- x\) ds,
10.2. Chernoff's
theorem
431
which by Gronwall's inequality gives Ht)-x\
< f Jo
(10.28)
e^-1^t-sHLT(MT)\g(s)-g(0)\(6+\G(0)x-x\)
v
+ \G{0)x - x\) ds,
0
We set d = G(i), i = 1 , . . . , n, and obtain from (10.27) the representation k
„t
k
u(t) - ( I ] ^ ) ^ = e^(x
- (UGi)x)
k
+ / e s -*(G(s) W (s) - ( n ^ i ) * )
ds
>
k = 1 , . . . ,n. Using assumptions (i) and (ii) we get n
G
k
e_t a;
«(*)- (n 0H ^ l - (n G 0H /
fc
—1
+ / e s - ' (\G(s)u(s) - Gku(s)\ + \Gku(s) - Gk (j[
GAXI)
ds
< e ^ 7 r 4 + y e s " * ( L T ( M T ) | 5 ( S ) - fl(fc)|(5 + \G(s)u(s) - u(s)\) fc-i i=l
for t e [0, T\, where Jfc = £ * = 1 \G iX — x\. If we define the functions
bk{t) = ^\u{t) - (f[Gl)x\,
(10.29)
IT
i•= l-
k = 0,. ,n,
then we get, for k = 1 , . . . , n and 0 < t < T, Mt) (10.30)
< 4 + / (es^kLT(MT)(5 Jo v
+ \G(s)u(s) - u(s)\)\g(s) - g(k)\ + (t>k-i(s)) ds.
From (10.28) we obtain 4>o(t) < trterrt
(LT{MT)Lg
+ \G(0)x - x\) + \G{0)x - x\ ) ,
0 < t < T,
432
Chapter 10. Approximation
of Solutions for Evolution
Equations
where we have used e* f^e^-^^'^ds = (-yT - l ) " 1 ^ ^ " 1 ) * - l)e* < te^Tt < r 1Tt )Tte. . Using the estimate for <j>o{t) in (10.30) for k = 1 we have Mt) < *i + L T ( M T ) A ' ( J + |G(s)u(s) - u(a)|)|ff(s) IT
JO
+ J lTse-
g(l)\ds
+ \G(0)x - x\) + |G(0)x - z|)
for t G [0, T\. By induction we get the estimate
x (6 + \G(s)u(s) - u(s)\) \g(s) - g(n :=I + II + III,
0
-k)\ds
n = 1 , . . . , [T\.
For 5k we have (using (10.25) with t = i and s = 0) 4 =^
| G ( t > - a?| < 53(£ r (|ar|)t£ f f > r (J + \G(0)x - x\) + \G(0)x - x\)
i=i
»=i
< A ; ( c r + 10(0)1-11),
k=
l,...,[T\,
which implies n
&n-£<^fa K
fc=o
-
+ \G(0)x-x\)(n-k)&f-, fc=o
0
From
we get /•t
oo
j+1
/ (t - s)n~llTse^sds = yJ3L-
,t
(t- a)n~
V+1
(n-1)! J2 (fc-")7T""l7 fc=n+l
<(»-!)! f>-„)<2g) fc=ra+l
fc!
10.2. Chernoff's theorem
433
Therefore we have the estimate (10.32)
I + II<(cT
+
\G(0)x~x\)Y,\k
n
k\
fc=Q
for t € [0, T], n = 1 , . . . , [T]. By the Cauchy-Schwarz inequality we have (7r*)fc
Ei*-»i^S(E^),,2(B*-")^)'
fc=0 ' "
<
• fc=0
fyijrtfy^fy^ fc=0
^2(7Ti)^V2
''
/fe=0 /fe=0
,( Tt)fc^/2 < e - * / 2 ( f ; ft ( f—t -'II)n ) 72 ^ ) 1 / 2 ,
0
'fc=0
This together with *(?r*)*
to
fa*)fc
2 ^ t 0„Y^
fc!
1
,^(7Ti)fc,o
tl fc. " * '
fc^" )'
= (n2-2n7rt)e-*
£
+
= (n 2 - 2njt + 7 T i + =
B
|
^
{^Tt)2)e1Tt
{{n-^Ttf+lTt)e
gives ^ | f e - n | ^ ^ - < e ^ * ( ( n - 7 T ^ ) 2 + 7T01/2. 0
E e'7^(*J S)k ,3V \9(s) ~ a9{n ~ a)" |fc - (n - a)\ g,TJe* £ ^ v - k)\ yi < Lff k\ ' " ' f^ /c! fc=0 fc=0
< L g , r e s e ^ ( ' - ^ ((n - a - 7 r ( i - «)) 2 + Jr{t ~ a))
1/2
This implies the estimate III < ^ ^ - L IT
g
,
T
f e°e^-°-> ((n -
S
- 7 T ( * - s)f
JO
+ yrit - s))1/2(S
+ \G(s)u(s) - u(s)\) ds,
for 0 < t < T, n = 1 , . . . , [T\. This together with the definition of <j>n(t) (see (10.29)), the estimates (10.31) and (10.32) implies (10.26). •
434
Chapter 10. Approximation
of Solutions for Evolution
Equations
As above, also below C will always denote a closed and convex subset of X. In the following we shall consider operators Tp(t) : C -> C, p > 0, 0 < t < Tmax, satisfying the assumption: (Chi) For any T e (0,T max ) there exists a constant LOT > 0 such that \Tp(t)x - Tp{t)y\ < (1 + pwT)\x - 2/|,
x, y e C, 0 < t < T.
Corresponding to the operators Tp(t) we define the operators Ap(t),
p > 0,
0 < t < T m a x , by Ap{t)x = -{Tp{t)x-x),
x£C,
and impose the assumption: (Ch2) There exists a Lipschitz continuous function f : [0,T max ) -4 R with Lipschitz constant Lf^x on [0, T] and, for any T G (0, T^ax), a nondecreasing function LT '• RQ~ —> K^ such that \Ap(t)x - Ap(s)x\ < LT(\x\)(l
+ \Ap(s)x\)\f(t)
-
f(s)\
for all x e C, p> 0 and t,s e [0, T\. For p > 0 we consider the Cauchy problems u(t) = Ap(t)u(t), v
'
0
u(o) = xeC.
10.14. Lemma. Suppose that assumptions (Chi), (Ch2) are satisfied and let x g C be given. Then the following is true: a) The Cauchy problem (10.34) has, for any p > 0, a unique solution up(-) = up(-;x)£C\0,TmaK;C). b) The assumptions (i) and (ii) of Theorem 6.25 are satisfied for the family Ap{t) uniformly with respect to p. Moreover, assumption (E3) holds also. Proof, a) We set G{t) = Tp(pt), g(t) = f{pt), 0 < t < T m a x /p, 6 = p and 7 T 1 + pur, 0 < T < T m a x . Then the operators G(t) obviously satisfy condition (i) of Theorem 10.13. Moreover, assumption (Ch2) implies, for s,t £ [0,T/p] and x £ C, \G(t)x - G(s)x\ = p\Ap(pt)x < PLT(\x\){l =
-
Ap(ps)x\ + \Ap(ps)x\)\f(pt)
-
f(ps)\
LT(\x\){p+\G(s)x~x\)\g(t)-g(s)\,
10.2. Chemoff's
theorem
435
i.e., assumption (ii) of Theorem 10.13 holds also. In view of Lemma 10.12 there exists for any x £ C a unique solution up(-) £ C1(0,Tmax/p;C) of
u(t) = (G(t)-l)u(t),
0
u(0) = x. If we set up(t) — up(t/p), 0 < t < T m a x , then up satisfies up(t) = p~lup{t/p) = p-l{G{t/p) - I)up(t/p) = p'^Tpit) - I)up(t) = Ap(t)up(t) and « p (0) = u p (0) = x. b) We choose T £ (0,T m a x ), x\,X2 £ C and t,s £ [0,T]. Using assumptions (Chi) and (Ch2) we get, for A £ (0, l/uT) and p > 0, \xi - x2 - X(Ap(t)xi
-
Ap(s)x2)
= | ( l + -){xi - ) (*i -x - x2) 2 ) - - (Tp{t)Xl - Tp(s)x2) pj p >(l + -Ax) F l ~x2\--(\TA - Tp(t)x2\ + \Tp(t)x2 - Tp(a)x2\) p(t)Xl p) p > (1 - \UT)\XX - x2\ - \\Ap{t)x2 - Ap(s)x2\ > (1 - A^r)|ari - x2\ - XLT(\x2\)(l + \Ap{s)x2\)\f{t) - f(s)\, which is assumption (i) of Theorem 6.25 (for K(r) = 1 + r). Note that / as a Lipschitz continuous function is also of bounded variation on [0,T]. In order to prove that assumption (ii) of Theorem 6.25 holds also we choose T £ (0,T m a x ), uo £ C and consider the equation (10.35)
(J - XAp(t))ux
= «o,
0 < t < T, 0 < A < l/w T , p > 0,
which is equivalent to the fixed point equation A „,(i)u\ ^.. u\ = ——T p
_P_ +, ——u =: 0 X + p~
F\,Pttu\
for 0 < t < T, p > 0 and 0 < A < 1/UJT- Since C is convex, we see that T\,p,t is a mapping C —• C. Furthermore, we have the estimate \F\,P,tX ~ F\,P,ty\ = T——\Tp(t)x - Tp(t)y\ A ~r p A(l + /exjT)| | < -^r-\x-y\, X+p For the function a{p) X(Xu>T - 1)(A + p)~2 is a contraction for p AT > 0 with A T ^ T <
^ r, x,y£C.
= A(l + puJr){X + p ) _ 1 we have Q(0) = 1 and a'(p) = < 0 on p > 0 for A £ (0, l/wT)- This proves that Tx,P,t > 0, t £ [0,T] and 0 < A < AT, where we can take any 1- Consequently equation (10.35) has a unique solution
436
Chapter 10. Approximation
of Solutions for Evolution
Equations
u\ G C for any UQ G C, i.e., we have C c (J - XAp{t))C,
0 < A < AT, 0 < t < T, p > 0,
which is assumption (ii) of Theorem 6.25. Note that dom Ap(t) = C for all t € [0, T max ) and p > 0. Since C is closed, assumption (E3) is trivially satisfied for the operators Ap(t). • 10.15. Proposition. Suppose that assumptions (Chi), (Ch2) hold for the operators Tp(t) : C —> C, p > 0, 0 < t < T m a x , and let x e C be given. Then the following estimate is valid for the unique solution up(-) = up(-;x) of (10.34): It/P] HI
,1-1
up(t)-
X
(Y[Tp(kp)\
< p^e2^({l+LoTt)2p+(l
+ pLOT)t)1/2 x ( L / i T T L r ( M P i T ) ( l + |Ap(0)a:|) + |Ap(0)a:|)
+ p1/2Lf,TLT(Mp,T)
/ e ^ ( t - s ) ( ( l + o ; T ( i - S ) 2 p + ( l + pwT)(i-5))1/2 Jo x (1 + \Ap(s)up(s)\) ds
for all T 6 (0, T m a x ), < G [0,T] and p > 0, w/«ere M P I T = max 0
*PWP) - n fc=i
ww
< (1 + p a > r ) ^ W ( ( ( l + pwT)t/p - [t/p])2 + (1 + pu, T )*/p)
1/2
x {CP,T + \Tp{0)x - x\) + pLf,TLT(MPtT)
j
"e^itlP-s)
+ (1 + /xjr)(t/p
^(1 - s))
+
puj.^tfp
-s)
+ s
-
[t/p])2
(p + \Tp(ps)up(s) - up{s)\) ds
for 0 < t < T, where c p , T = Lf,TTLT{Mp,T){p + \Tp{Q)x - x\). Observing (1 + pu)T)t/p - [t/p] < (1 + puJT)t/p -t/p+l = l+uTt and (1 + puT)^/^ <
10.2. Chernoff's
(1 + pwTflP
437
theorem
< e"Tt for t > 0 we get /[t/p]
«p(^) - ( n ^(M <
pV2e2o,r*
((1
+
^
^
+
(1 +
^ f )
V2
x (L / > T TL T (M p , T )(l + \Ap(0)x\) + \Ap(0)x\) ft
+ p1/2Lf,TLT{MPtT)
/ Jo
uT(t-«)
x ((1 + wr(t - s)fp + (1 + pwr)(t - s ) ) 1 / 2 ( l + |i4 p (s)u p ( fl )|) ds for 0 < f < T, p > 0.
•
10.16. Theorem (Chernoff). Assume that the family A(t), 0 < t < T m a x , of operators on X satisfies condition (E3) (with D = C) and the following range condition: (10.36) v
For any T £ (0,T m a x ) there exists a AT > 0 such that {I - \A{t))(C
n dom A(t)) DC,
0 < t < T, 0 < A < AT.
Moreover we assume that the operators Tp(t) : C —± C, p > 0, 0 < t < T m a x , satisfy assumptions (Chi), (Ch2) and the following consistency condition: For any t G [0, T max ) and [x, y\ G A(t) with x G C there exist (10 37)
xp £ C, p > 0, such that limx„ = x and PiO
F
lim AJt)x0
= y.
Pi0
Then for any s,T G [0, T max ) with s
w(i;s,x) = lim(
TT
x
T p (s + fep) )x
uniformly on [s, T], where «(•; s, x) is i/ie unique mild solution of KP(A(-), s, x). Proof, a) The range condition (10.36) imposed on the operators A(t) is just condition (ii) of Theorem 6.25. We next show that also condition (i) of Theorem 6.25 holds. For fixed T G (0,T max ) we choose U G [0,T] and [x^jji] G A(U) with Xi G C, i = 1,2. According to the consistency assumption (10.37) there exist xPti G C, p > 0, such that limpj,o x p ,j = Xi and limpj.o v4p(ii)xPii = yt, i = 1,2. From Lemma 10.14 we conclude that (1 - \u)T)\xp,i
- x Pi2 | < |x p ,i - xp,2 - X(Ap(t1)xPti
-
Ap(t2)xpfl)\
+ ALT(|xp,2|)(l + \Ap(t2)xp,2\)\f(h)
- f{t2)\
438
Chapter 10. Approximation
of Solutions for Evolution
Equations
for A G (0, 1/OJT), p > 0. Taking the limit p I 0 we get 3 (1 -\u>T)\x\
-XI\ < \Xl -X2-
\(yi - y 2 )| + XLT(\x2\)(l
+ |ite|)|/(ti) -
f(h)\
for A G (0, 1/UJT), which is condition (i) of Theorem 6.25. According to this theorem the unique mild solution u(-; s, x) of EP(A(-), s, x) is given by u{t; s, x) = U(t, s)x,
0<s
where U(t, s) : C fl dom ^4(s) - > C f l dom ^4(i) is the evolution operator defined in (6.52). Moreover, we have (10.38)
\U{t,s)x-U{t,s)y\
< e"T{t~s)\x
- y\,
x,y G C n dom A(s),
for any T G (0, T max ) and s, t G [0, T] with s < t. b) If we define the lower semi-continuous functional tp on X by Defj (?) = C and f{x) = 0 for x G C resp.
lim \u(t; s, x) — up(t; s, xp)\ = 0
uniformly on any interval [s,T] with 0 < s < T < T m a x . c) Without restriction of generality we can assume that s = 0. In the following we use the notation u(t;x) resp. up(t;x) instead of u(t;0,x) resp. up(t;0,x). Equation (10.39) in particular implies that for any T G (0,T m a x ) there exists a constant Mr > 1 such that (10.40)
MPtT = max \up{t;xp)\ < MT
for all p G (0,1].
We fix T G (0,T m a x ) and T0 G (T,T m a x ). Since up(t;xp) is the unique mild solution of EP(AP(-), 0, xp) (see Theorem 6.20), there exists a DS-approximation (uP,x{t))0<x<x0 converging uniformly on [0,T] to up(t;xp). Let (tf'A)i=o,...,jvx. (zf )i=ot...,Nx, (Vi' )i=i,...,ArA and (ef )i=i,...iNx be the sequences in [0,T0] x C x X x X associated with this DS-approximation. In view of Theorem 6.17, b), and Proposition 6.16 we can assume that ef' = 0 and XQ = xp. It is clear that tp0'x = 0. We have also #•* = Ap{t^,x)x^,x € C, i = 1 , . . . ,JVA, 3 As in the case of Theorem 10.2 we may have to replace the function LT by the function LT defined by LT{T) = l i m ^ o ^ T ( T + h), T > 0. Then we have LT{T) > LT(T), T > 0, and limpj.o LT{\xp,2\) < LT(\X2\).
10.2. Chernoff's
theorem
439
0 < A < Ao, p > 0. We set yfr — Ap(0)xp. According to Lemma 6.9, b), there exist positive constants M P J I and Mp^ such that \xPi'X\<MpA
\yt'X\<Mpfl,
and
i = 1 , . . . , JVA, 0 < A < A„.
The proof of Lemma 6.9 shows (we may choose u — xp and v = MpA = \xp\ + ^ 6 ^ 0 ^ ( 1 ^ ( 0 ) ^ 1 + PftTo(T0)LT0(\xp\)(l
+
Ap(0)xp) \Ap(0)xp\))
and Mp,2 = exp(2uJT0To +
var[0,T0] / ) (|Ap(0)a:p| + LTo{MpA)
LT0(MPI1)
var[0,To] / ) •
Since (a;P)p>o satisfies (10.37), there exists an MT0 > 0 with MP:i < MT0, i = 1,2, for all p G (0,1], i.e., we have in particular (10.41)
\Ap(tP'x)xP'x\
< M To ,
i = l,...,Nx,
0 < A < A o , 0 < p < 1.
We fix £ G [0,T], /J G (0,1] and choose kx G {1,...,JV A } such that t G (*ft>A-i>ffcAA]> 0 < A < A0. It is clear that tpk'X -> £ and
xj^A ->• up(t)
as A J. 0.
Furthermore we get using (10.41) and assumptions (Chi), (Ch2)
< \AMfK? - MtHtl + \MtKt - Ap(t)up(t)\
MTo)\f(tpkf)-f(t)\
+
+ -{2 + puTo)\xpk'*-up(t)\->0
asA|0.
Consequently we have (10.42)
\Ap{t)up(t)\
< MTo,
0
0
d) Using (10.40) and (10.42) in Proposition 10.15 we obtain A*/p]
x
< p1/2MT,
i(t;xp)-l\[Tp{kp)\xi
0
with an appropriately defined constant MT > 0. This proves [t/p]
(10.43)
lim
Y[Tp(kp))xp
p|0
fc=i
-
up{t;xp) = 0
0
Chapter 10. Approximation
440
of Solutions for Evolution
Equations
uniformly for t £ [0,T]. Using assumption (Chi) we get MP)
(10.44)
x
At/p)
s
(l[Tp(kp))y-mTp(kp)\z <(l + pujT)[t/p]\y-z\<e^T\y-zl
0
This for y = xp and z = x together with (10.39) and (10.43) gives A*/p]
(10.45)
s
]im(T\Tp(kp))x Pio V AA
y
= u{t;x),
0 < t < Tmax,
uniformly on bounded t-intervals for all x G C Pi domA(0). For x e C D domA(0) we choose (xn) C C (~l domA(0) with x n -» x. Then (10.38), (10.44) and (10.45) imply that (10.45) holds also for all x e Cndom^(O). D
10.3.
Operator splitting
In this section we present some results concerning operator splitting in order to obtain approximation results for nonlinear contraction semigroups. The basic idea is to consider the operator which governs the given Cauchy problem as the sum A + B of two generators and to obtain an approximation of the semigroup generated by A+B by proceeding in small time steps alternating between the directions given by A resp. B. In its simplest form (i.e., when the time steps are done using the semigroups generated by A resp. B) this idea leads to the so-called Lie-Trotter product formula given in Theorem 10.17 below. For a discussion of relevant literature see for instance [Bb4, p. 248ff]. The other results given in this section are concerned with cases where the alternating steps are done by using difference approximations to the semigroups generated by A resp. B. 10.17. T h e o r e m . Assume that the spaces X, X* are uniformly convex and that the operators A, B are single-valued and m-dissipative. In addition let also A+B be m-dissipative. Let SA{-), SB(-) resp. S(-) denote the contraction semigroups generated by A, B resp. A+B and assume that dom A n dom B is invariant with respect to SA{-) and SB(-)- Then we have, for any x G dom A n dom B,
S(t)x = lim{SA(p)SB(p)) Wp]r p|0
uniformly for t in bounded intervals. Proof. We define the operators Tp, p > 0, by Tpx = SA(p)SB(p)x,
x G C := dom A n dom B.
10.3. Operator splitting
441
Note that C = dom A n dom B = dom(j4 + B) is a closed convex set by Theorem 5.16. By assumption on SA(-) and SB(-) the operators Tp: p > 0, are well-defined and are contractions C -* C. Therefore assumption (Chi) holds. Assumption (Ch2) is trivially satisfied, because the operators are not timedependent. We choose x E dom^4 n d o m 5 and set yp = (1/P)(SA(P)SB(P)X — SA(P)X),
p > 0, and
get
-(TpX-x)
= -(SA(P)X-X)
+yp.
From Theorem 5.16 we get lim - (SA(p)x - x) = Ax. pio p In order to prove that lim^o yp = Bx we use the fact that the mapping r —> \BSB(T)X\ = \(d+ /<1T)SB(T)X\ is decreasing and get (10.46)
\y„\ < -\SB(p)x-x\ P For arbitrary u E dom A we have (10.47)
- (SA(p)u -u)+p
p
fP\BSB{T)\dT<\Bx\.
(SB(p)x -X)--
p
=
(SA(p)x - x) - yp -(I-SA{p))SB{p)x--(l-SA{p))u.
Since SA{P) is a contraction, the operator SA{P) — I is dissipative. Using also the fact that the duality mapping F is single-valued (see Proposition 1.1) we get (10.48)
((I-SA(P))SB(P)X-
(l-SA(p))u,F(SB(p)x-u))>Q.
From the estimate (10.46) we see that for any sequence (pn) with pn —>• 0 there exists a subsequence (which we again denote by (pn)) and a, y e X such that w- limn_>oo yPn = y. Taking n —> oo in (10.48) with p = pn and observing (10.47) we get [Ax + y - Bx - Au, F(x - «)) < 0 for all u £ dom A. This implies that the operator A defined by dom A = dom A and Ax = Aw for w ^ x resp. Aw = Ax U {Ax + y — Bx} for w — x is dissipative. Since A is maximal dissipative, we get y = Bx. This together with (10.46) implies that limn^oo \yPn\ = \Bx\. By uniform convexity of X we have lim^^oo yPn = Bx. Since the sequence (pn) was arbitrary, we finally get lim - (T px - x) = Ax + Bx = (A + B)x, P-l-o p v F '
x G dom A n dom B,
442
Chapter 10. Approximation
of Solutions for Evolution
Equations
which proves that the consistency assumption (10.37) is also satisfied. application of Theorem 10.16 implies the result.
An •
The next result is concerned with the case where the semigroups SA(•) resp. SB{-) are replaced by the corresponding backward Euler approximation. 10.18. Theorem. Assume that X and X* are uniformly convex. Let A and B be m-dissipative operators, A being single-valued. Furthermore assume that (10.49)
range(l - \(A + B)) = X
for some A > 0. Let S(-) denote the contraction semigroup on dom A n domB generated by A + B. Then we have, for any x £ dom A Pi d o m S , S(t)x = limf (/ -pA)-1
(I -pB)-1)
x
uniformly for t in bounded intervals. Proof. Note that in view of the assumptions on the operators A, B and the space X* the operator A + B is dissipative (see the last paragraph of the proof for Theorem 1.24) and by (10.49) m-dissipative. By Theorem 5.16, A + B generates a contraction semigroup. We define the operators Tp,Ap : X —• X, p > 0, by Tpx = JpJpX
and
Apx = -(Tpx
- x),
For x G dom A n dom B = dom(A + B) we choose b £ Bx (A + B)°x. This is possible because A is single-valued and that also dom(A + B)° = dom(,4 + B) and that (A + B)° set xp = x — pb £ (I — pB)x, p > 0. Then we have Jpxp Apxp = - (Jpx -x)+b,
x e X. such that Ax + b = hence A0 = A. Note is single-valued. We = x and
p>0.
Using Theorem 1.20, b), we conclude that lim ApXp = A°x + b = {A + B)°x. pio Obviously we have lim p |o xp — x. We cannot apply Theorem 10.16 directly, because the consistency property we have established here is weaker than the consistency assumption (10.37) required in Theorem 10.16. The operators Tp, Ap, p > 0, trivially satisfy assumptions (Chi) and (Ch2) (with C — X, arbitrary T > 0, UIT > 0 and with / = 0, LT = 0). According to Lemma 10.14, b), assumptions (i) and (ii) of Theorem 6.25 hold. In our present situation this just means that the operators Ap, p > 0, are m-dissipative. Let Sp(-) denote the contraction semigroup generated by Ap. From Theorem 10.10
10.3. Operator
443
splitting
we conclude that, for any x £ dom A n dom .B and any family (a;p)p>o with lim^o xp — x, we have lim 5^,(4)^ = 5(t)a; p|0
uniformly for t in bounded intervals. We can now follow the proof of Theorem 10.16 with minor modifications. First let x0 G dom vlndom B be given and choose (a:p)p>o C X with lim p | 0 xp = XQ and limP4.o Apxp — A®x§. Since assumptions (Chi) and (Ch2) are satisfied for the operators Tp, Ap, we get from Proposition 10.15 the estimate ,[t/p\
< pl'2{p + l)x'2\ApXP\ < P1/2M,
SP{i)xp-(\\Tf
0 < p < 1,
where M = y 2 s u p 0 < p < 1 |j4pa;p|. This establishes the estimate (10.43) for the present situation. From here the proof is completely analogous to the proof of Theorem 10.16. D The approximation for SA+B{-) provided by Theorem 10.18 gives first order convergence at best. In order to get higher order convergence one has to use more sophisticated time steps for the approximation of SA(-) resp. SB{-)- In the following we present such a higher order method which was investigated in [PLi-Me] (see the Algorithm I there). We first prove a lemma: 10.19. L e m m a . Assume that the spaces X, X* are uniformly convex and that the operator A on X is m-dissipative. Let z G dom A, y G X and (zp)p>0 C X be such that limPio(l/p)(zp — z) = y. Then it is true that lim — (JpZp — Zp) = w G Az
with \w + y\ = min \v + y\.
piO p
v£Az
Proof. We define the operator E C X x X by Ex = Ax + y, x G dom A. Then the statement on w just means w — E°z - y. It is clear that E is also m-dissipative. Moreover, we have Jp(zP ~ PV) = JfzpFor vp := zp — py we obtain \{J>P
~ vP) = ~p{z ~ vp) + l(J?z
-z)+
l
-{J°vp
-
Jfz).
By definition of vp it is easy to see that p~x{z — vp) = y — p~1(zp - z) -> 0 and p~l\Jfvp - Jfz\ < p~~*-\vp - z\ -4 0 as p \. 0. Then Theorem 1.20 implies limP4.0 p~l(J®z — z) — E°z. Therefore we get
444
Chapter 10. Approximation
which is equivalent to w = lim p | 0 p~1{JpAzp
of Solutions for Evolution
Equations
- zp) = E°z -y.
O
10.20. Theorem. Assume that X is a real Hilbert space and that the operators A, B, A + B on X are m-dissipative. We denote by S(-) the contraction semigroup generated by A + B. Then we have, for any x G dom A n dom£?, S{t)x = Hm((2(/ - {p/2)Ayl
- I) (2(7 - ( p / ^ B ) " 1 - / ) J
x
uniformly for t in bounded intervals. Proof. We define the operators Tp, Ap : X —> X, p > 0, by Tpx = (2Jp/2 - I) (2Jp/2 -I)x
and
Apx = - (Tpx -x),
i £ l
We first prove that the operators Tp, p > 0, are contractions on X. It suffices to show that this is true for 2JpA,2 — I. It is easy to see that y = 2JpA,2x — x if and only if
;(»-)^m Using this and dissipativity of A we get for Xi G X and j/j = 2JpA,2xi — x;, i = 1,2, the inequality 0 > — (j/i - j/2 - {xi - x 2 ), xi ~x2 + yi-
V
y2)x ^-(|2/i-2/2|2-|zi-Z2|2),
which proves the contraction property of 2 j A 2 — I. This implies that the operators Ap, p > 0, are m-dissipative and hence generate contraction semigroups SP( Given x G dom A n dom B let MA = {u G Bx j there exists a v G Ax such that u + v = {A + B)°x}. For a fixed b G MA we define xp = x - (p/2)b G (I—(p/2)B)x. Consequently we have J^i2xp = x and (2J^,2—I)xp = x+(p/2)b. This gives ^ x p = - ( J ^ / 2 ( i + (p/2)b) - (x + (p/2)6)) + 6 ,
p > 0.
For zp = x + pb, p > 0, we have l i n i p i o P - 1 ^ — x) = 6. Lemma 10.19 with z = x and y = b implies limpj_0 p~1(Jpizp — zp) = w G Ax, where \w + b\ = minv<=Ax \v + b\, i.e. w + b — (A + B)°x. Consequently we have UmApXp pj.0
= (A +
B)°x.
10.3. Operator splitting
445
Trivially we have limp.j_o xp = x- This proves that the consistency assumption (10.9) is satisfied. An application of Theorem 10.10 shows that, for any x S dom.4 n domB, lim Sp{t)x = S(t)x uniformly for t in bounded intervals. The rest of the proof is completely analogous to the corresponding part of the proof for Theorem 10.18. •
This page is intentionally left blank
CHAPTER 11
Semilinear Evolution Equations In this chapter we discuss well-posedness and approximation results for a special class of semilinear evolution equations, which incorporates also delay equations with state and time dependent delays. For these delay equations we present also a concrete approximation scheme. For a different approach to semilinear evolution problems see for instance [Har].
11.1.
Well-posedness
We consider equations of the form (11.1)
— u{t)=Au{t)
+
BG(t,u{t)).
Let T > 0 and 1 < p < oo be fixed. Furthermore let W C, X q. H and U be Banach spaces such that the embedding X Q H is dense and continuous, whereas the embedding W Q X is just continuous. A specific feature of the problem under consideration is that the nonlinearity G(t, (j>) will only be defined for (j) in the smaller space X and on the other hand B is assumed to be a linear operator with range B C H, but not range B C X. Motivated by the situation for delay systems with state dependent delays (see Section 11.2) we restrict initial data to the subspace W of X. Thus we shall consider existence of mild solutions of (11.1) in the Banach space X with initial data in W, i.e., we investigate the following semilinear equation: (SL)
u(t) = S{t)(j> + / S(t - s)BG(s, u(s)) ds,
0 < t < T,
Jo
The following assumptions will be needed: (Al)
The family S(t), t > 0, of operators is a Co-semigroup on H, which leaves the spaces X and W invariant. Moreover, the restrictions S(t)\x, t > 0, form a Co-semigroup on X. We set MQ — maxo
448
Chapter 11. Semilinear
(A2)
(11.2)
Evolution
Equations
B G C{U,H) and j*S(t - s)Bf(s)ds G X resp. tW,0
(11.3)
x
< M2\f\Lrl0tTiU),
0
and
/ S(t - s)Bf(s) ds < M 3 |/| L =o ( 0 > T ; [ / ) ! Jo w
0
forallf£L°°{0,T;U). (A3)
G is a mapping [0, T] x X —> U such that for any ip G X the mapping t —• G(t,tp) is strongly measurable on [0, T]. Moreover, for any (3 > 0 i/xere exists a constant kp > 0 suc/i i/iat
(11.4)
| G ( t , 0 ) - G ( t , ^ ) | [ / < f e ^ ( l + |)|w)|>-V|x
o.e. on [0,T\
for all
(11.5)
\G(t,iJj)\u
+ \iP\x)
a.e.on[0,T]
for allip £ X with \ip\x < POf course, on the right-hand side of (11.2) resp. (11.3) we can always take res P- l/lL°°(o,t;£/)) because we can always replace / by the function which is / on [0, t] and 0 on (t,T]. Note that (11.5) can be replaced by the assumption that \G(t,0)\u < c a.e. on [0,T] for some constant c > 0. This is a straightforward consequence of (11.4) for (p = 0. In general the mapping t —» S(t)
We shall use the following simple implications of assumptions (Al) - (A3): 11.1. L e m m a . Let assumptions (Al) - (A3) be satisfied. Then the following is true:
11.1.
449
Well-posedness
a) ($/)(i) = LS(t — s)Bf(s)ds, $:Lp(0,T;U)->C(0,T;X).
0 < t < T, defines a continuous mapping
b) Assume thatu G C(0,T;X)f)B(0,T; 0<s
W). Then the mapping s ->•
G(s,u(s)),
Proof, a) By assumption (A2) we have / 0 'S(i - s)Bf{s) ds G X for 0 < t < T. Wefixt G (0, T). Then, for /i G (0, i] with t + h
/ Jo
pt
S(t + h-s)Bf(s)ds-
/ Jo
= f S(t- s)B(f{s Jo
S(t-s)Bf{s)ds
+ h)~ f(8)) ds + S{h) f S{t - s)Bf(s) Jo
ds.
Inequality (11.2) implies / S(t - s)B{f(s Jo
+ h)- M) ds
x
< M 2 |/(- + h) - f\Lv(o,T;U) ->• 0
as h I 0, where we have defined / ( s ) = 0 for s > T. With f(s) = f(s) for 0 < s < h and f(s) = 0 for s > h we get (again using (11.2)) / S{t-s)Bf{s)ds = / S(t-s)Bf(s)ds x Jo Jo <
M2\f\LP(0,T: (0,T;U)
M2
X
(J'lmfvds)I/P
as h I 0. This proves the right-hand continuity of $ / on (0, T). For £ = 0 and h G (0,T] we immediately get from (11.2) that f S(h-s)Bf(s)ds
<Mjf\f{8%ds)
?
->• 0 a s / i | 0.
For £ G (0, T] and /i G (—t, 0) we use analogous arguments as above for the expression l-t + h
/ Jo
rt
S{t + h-s)Bf(s)ds-
/ Jo
rt+h
=
S(t-s)Bf{s)ds p—h
S(t + h-s)B(f(8)-f(a-h))ds-S(t
+ h) S(-h-s)Bf(s ds. Jo Jo in order to show left-hand continuity of $ / on (0, T]. Therefore $ / is continuous on [0,T]. Boundedness of $ is a trivial consequence of (11.2).
450
Chapter 11. Semilinear Evolution
b) Set 0 = max 0 <(
an
Equations
d define the step func-
0 < S < T, U = 1, 2, . . . ,
fe=0
where x/ denotes the characteristic function of a set / (i.e., x/(*) = 1 for t e / and = 0 otherwise). Then |ii„(s)|x < /3 and |u n (s)|w < 7 for all s G [0,T) and limrn.00 |u(s) - un(s)\x = 0 uniformly on [0,T\. By assumption (A3) the mappings s —>• G(s,un(s)), 0 < s < T, are strongly measurable on [0,T]. From (11.4) we obtain \G(s,u(s)) - G(s,un(s))\u
< k0(l + -y)\u(s) - un{s)\x
a.e. on [0,T],
which implies limn^oo G(s,un(s)) = G(s,u(s)) a.e. on [0,T]. This proves strong measurability of s -* G(s,u(s)). Finally, by (11.5) we have \G(s,u(s))\u
< kp(l + p)
a.e. on [0,T],
which completes the proof for assertion b).
•
The main result of this section is the following well-posedness result for equation (SL): 11.2. Theorem. Assume that (Al) - (A3) are satisfied. Then the following is true: a) For any a > 0 there exist constants r = r(a) > 0, 7 = 7(0) > 0 and 7 = 7(a) > 0 such that for any (f> G W with \cf>\w < o. there exists a solution u(-; >) € C(0, r; X) n 5(0, r; VT) 0/ (SL) w/wcft satisfies \u{t; >)| < 7, |«(t; 0 ) | w < 7 /or
0<
t
b) For any
C ( 0 , T ; I ) n B ( 0 , T ; l f ) 0/ (SL). c) For any 7 > 0, 7 > 0 and T > 0 there e:nste a constant CL = CL(I,7,
T) > 0
|u(-; 4>i) - «(•; (/>2)|c(o,r;x) + |«(-; >i) - u(-5 <£2)|B(O,IW) < CL|
11.1. Well-posedness
451
functions on [0,T]: u0(t) = S(t)cj), (11.6)
u fc+ i(t) = u0(t) +
ft
S(t-
Jo
s)BG(s, uk{s)) ds,
k = 0,1,... .
By assumption (Al) the function u0{-) is in C(0,T;X) n B(0,T;W) with K W U ^ Moc0a and K W I w < ^ i « , 0 < t < T. We define 7 = 2M0c0a and 7 = M i a + M3fc7(l + 7) and choose r = T(Q) such that
M2fc7(l + 7 ) r 1 / p < | . We assume that uk(-) is in C(0, T; X) n B(0, T; W) with (11.7)
|u*(*)U<7
and
|« f c (i)k < 7 for 0 < i < r.
Note that |uo(i)|x < 7/2 on 0 < t < T. From Lemma 11.1, b), we see that the mapping s —>• G(s,uk(s)) is in L°°(0, T; [/). From (11.5) we see that (11.8)
\G(s,uh(s))\u
< k7(l + 7 )
a.e. on [0,r].
This together with (11.2) resp. (11.3) implies
Jo
S(t - s)BG(s, ufc(s)) ds\ ^ < M2fc7(l + 7 ) r 1 / p < | ,
0 < t < r,
x
resp. I S(t~s)BG(s,uk{s))ds
<M 3 fc 7 (l + 7),
0 < i < r.
The last two estimates together with the estimates for UQ(-) show that |ufc+i(*)|x < 7
and
\uk+i(t)\w <7,
0 < i < r, fc = 0 , 1 , . . . .
From (Al) and (A2) it is clear that Uk+i(t) £ W, 0 < t < T. Thus we have shown that uk(-) G C(0, r; X) n 5(0, r; VT) and (11.7) holds for k = 0 , 1 , . . . . We set ci = (M2k7(l + j))P and c2 = (M2&T(1 + •y))p. Then inequalities (11.2) and (11.8) imply |tn(t)-«o(*)lj
f
S(t-s)BG{s,u0(s))ds
<M?\G(;Uo(Wmo,r;U) < M%kpJl + 7 ) p r = C2T,
0 < t < T.
452
Chapter 11. Semilinear
Assume that \uk(t) - M fc _i(i)|^ < c2ck~1tk/k\, (11.4) and (11.7) we see that
Evolution
Equations
0 < t < r. Then by (11.2),
K + 1 ( i ) - uk(t)\px < M||G(.,« fc (-)) - £(•,«*_!(•))£,(„,.;£/)
+ ^Yc2ck~l J
<M^{l
^ds
Thus we have shown that
(a..)
,„ t+lW -M^(tn^9r
for 0 < t < T, k = 0 , 1 , . . . . This proves that (lifc(-)) is a Cauchy sequence in C(0,T;X). Hence u(t) = lim Uk(t),
0 < t < T,
k—>oo
exists, the limit being uniform on [0, r]. It is clear that \u{t)\x
< 7,
0 < * < r.
Using (11.3), (11.4) and (11.9) we get |u fc+ i(t) - uk(t)\w
< M 3 |G(-, «*(•)) - G(-,^-i(-))Loo ( 0 i r ; [ / )
«.M.
+
fl(2)'"(^)v'
for 0 < £ < r, A; = 0 , 1 , . . . , which proves that Uk(t) converges also in W for all t G [0, T] (in fact uniformly on [0, T]). Since W is continuously embedded in X, we must have lim \u(t) - uk(t)\w
=0,
0 < t < T.
k—fcxD
This in particular proves u £ (11.10)
B(0,T;W)
with
|«(*)|w<7,
0
Analogously as above we see also that s —> G(s,u(s)) / S(t - s)B(G(s, u(s)) - G(s, uk(s))) ds Jo
is in L°°(0,r;C/) and
x
< M2fc7(l + 7)r 1 / p jw~ Uk\c(o,T-,x) -> 0 as k ->• oo. Taking the limit as fc ->• oo in (11.6) we see that u(-) is a solution of (SL) on [0,r].
11.1. Well-posedness
453
b) If we have two solutions «;(•), i = 1,2, of (SL) in C(0,T;X) n with Uj(0) = >, 0 G W, then inequalities (11.2) and (11.4) imply
B(0,T;W)
M * ) - Mt)\Px < MZ\G(;Ul(-)) - G(. )U2 (-))| LP(0iT;l/) < Af£*£(l + yo)p / \Ul(s) - M 2 ( S ) & (is, Jo
0 < t < T,
where we have chosen p and p such that |iii(i)|x < P, |ui(*)|w < p on [0,T], z = 1,2. Gronwall's inequality implies u\ = u2. c) Let Ui(-) G C(0,T;X) n B(0,T; W), i = 1,2, be solutions of (SL) on [0,T] with M,(0) = >i, c/>i G PF, i = 1,2, and choose 7, 7 such that \ui(t)\x < 7 and \ui(t)\w < 7 on [0,T], * = 1,2. Then by (11.2) and (11.4) we get, for 0 < t < T, \Ul(t) -
u2(t)\x
< (|5(t)(0i -
- G(s:u2(s)))
< ( M i | 0 ! - fa\x + M 2 /c 7 (l + 7 ) ( / \ui(s) - u2{s)\px
ds|JP
dsf/Py
< 2^1 (cgAiTl^i - 021^ + M|fcP(l + 7 ) p J |«i(s) - «2(«)|^da). Here we have used the inequality (a + b)p < 2 p " 1 (a p + W) for a, 6 > 0, p > 1. Gronwall's inequality implies (11.11)
|«i(t)-«2(*)|x
0
with an appropriately defined constant c 3 = 03(7,7, T) > 0. Note that the constants Mi and M 2 in general depend on T. Therefore we have |Ml - U2\C(Q,T;X)
< C3J01 " fclw •
This estimate together with (Al), (11.3) and (11.4) implies |«i(*) - u2(t)\w
< Mi|0 x - 4>i\w + M3\G(;Ul(-))
- G(-,u 2 (-))| L =o ( o, r;t/)
< M i | 0 ! - >2|W + M 3 fe 7 (l + 7)|Ui - U2|C(0,T;X)
0
where c4 = Mi + M3fc7(l + 7)03.
•
Given
u(t) = u T (t)
ifi€/r.
454
Chapter 11. Semilinear
Evolution
Equations
By Theorem 11.2,1 is non-empty and «(•) is well-defined by (11.12). Obviously «(•) is the unique solution of (SL) on [0,i max ) with w(0) = <j> and W|[O,T] € C(0, r; X) n 5(0, r; W) for any r G [0, f m a x ). The interval [0, i m a x ) is called the maximal interval of existence for the solution u(-). Our next results are concerned with regularity of solutions with respect to time. In addition to assumptions (Al) - (A3) we impose the following regularity condition on G with respect to time: (A4)
For any (3 > 0 there exists a constant mp > 0 such that \G(t,iP) - G{s,rP)\u < m0{\ + \^>\w)\t - s\ for allipGW
with \ip\x < 0 and all s, t 6 [0, T].
A straightforward consequence of (11.4) and (A4) is that (11.13)
\G(t, 4>) - G(s, i>)\v < m a x ^ , m0)(l + \i/>\w)(\t -s\ + \4>- i/>\x)
for all >,ip£X such that tp G W, \>\x, \tp\x < /? and all s,t G [0,T). 11.3. Theorem. Assume that (Al) - (A4) are satisfied and let <j> G W fl dom/1 with A
S(tJo Since (j> G dom A, we have
s)B(G(s, u{s)) - G(0,
s)BG{0,4>)ds,
0 < t < T.
S(t)4> -
Jo
+ / S{t-s)B(G(s,u{s))-G(Q,(i>))ds The estimate for / is (using (Al)) \I\x <Mot\A<j) + G(0,(j))\x,
0
= : / + //.
11.1. Well-posedness
455
Note that the integral defining 7 is a Bochner-integral in 77. By the assumptions on 4> and the fact that 5(-)|x is also a Co-semigroup it exists also as a Bochnerintegral in X. Naturally both integral coincide. Set (3 = maxo
+ \
a.e. on [0, r]. Consequently we have (using (11.2))
a
/o
t
[s + \u{s)
, 1i / p
-4>\x)"ds;
(s + \u{s) - >|x)Pds) < 2 - / M 2 max(fc / 3,m /3 )(l + \4>\W)U {sp + \u(s) - 4>\px) ds^'" 1 1 p
for 0 < t < T. This together with the estimate for \I\x gives M t ) - ^ < 2 * - 1 ( | J & + |J/ft) <2p~1Mp\A(j)
+ G(Q,(f))\xtp
+ 4p-1Mp(max(A^m/0)p(l + | ^ ) < cMp + d2 I \u{s) - <j)\x ds, Jo
p
( - ^ + / \u(s) - <j>\x ds) \p+1 J0 /
0
with appropriately defined constants di = di(<j>), i = 1,2. By Gronwall's inequality we get (11.15)
\u(t) - <j>\x < dt,
0
with a non-negative constant d = d{4>). For t and h such that 0 < t < i + / i < r w e obtain from (SL) (11.16)
u{t + h)~ u(t) = S(t) (u(h) - <j>) + [ S{t - s)B(G(s + h,u{s + h)) - G{s,u{s))) Jo
Set 7 = (11.13))
|W(-)|B(0TW)-
\u(t + h) -
ds.
Then we get (using also (Al), (11.15), (11.2) and
u(t)\x
< M0rf/i + M2max(A;/3,m1a)(l + 7)f / (h + \u(s + h) -
u(s)\x)Pds)
456
Chapter 11. Semilinear
Evolution
Equations
which for appropriately chosen constants di = di(4>), i = 1, 2, implies
\u{t + h) - u(t)\vx
0 < t < r - h.
Jo
By Gronwall's inequality we get finally \u(t + h) - u(t)\x
0
+
h
where d = d{<j>) > 0.
•
If the space X is reflexive, then any Lipschitz continuous X-valued function is difFerentiable almost everywhere. Therefore in this case Theorem 11.3 would imply differentiability of the unique solution of (SL) a.e. on [0,£ max ). However, when applying this theory to delay equation, for instance, we cannot assume reflexivity of X. But we can get also differentiability of solutions if we assume that the space U is reflexive: 11.4. Theorem. Assume that in addition to the assumptions of Theorem 11.3 the space U is reflexive. Then the unique solution u(-) of (SL) is in C1 (0, r; X)C\ C(0,T\domA) for any r G [0,i max ) and —u(t) = Au(t) + BG(t, u(t)),
0
imax,
in H. Proof. We set 0 = maxo< s < r \u(s)\x, 7 = sup 0 < s < T \u(s)\w and g(s) = G(s,u{s)), 0 < s < T. Moreover, we choose r G [0,tmax). Then (11.13) and Theorem 11.3 imply \9(si) - 9(s2)\u <max(A;/3,m/3)(l + 7)(|si -s2\
+ \u(si) -
< max(fc/3,m/3)(l + 7)(l + J ) | s i - s2\,
u(s2)\x)
s1,s2 G [0,T],
where d is the Lipschitz constant for «(•) on [0, r]. Since U is reflexive, g'(s) exists a.e. on [0, r] with g' G L°°(0,T;U). In particular this implies Bg £ W1'1(Q,T; H). By Theorem 2.13, a), u(-) is the unique strong solution of —u{t) = Au{t) + Bg{t) = Au(t) + BG{t, u{t)), in H. In particular we have «(•) G C 1 ( 0 , r ; i l ) n
C(0,T;domA).
0
11.1.
Well-posedness
457 C1(0,T;X).
It remains to prove that we have also u(-) £ t + h < T we obtain from (11.16) and (11.14) 1
h
(u(t + h)- «(*)) = S(t)]- (u(h) -
For 0 < t <
S)B]- (g(s + h)- g{s)) ds h
f S(s)(A(j) + BG(0,(l)))ds h Jo
+ S(t) J S(h - s)B± (g(s) - G(0,4>)) ds /•*
1
+ J S(t-s)B-(g(s
+
h)~g(s))ds
=: 1(h) + 11(h) + 111(h). Since A<j) 4- BG(0,
u
s6 <-r<S, h
0< s <
Therefore (Al) and (11.2) imply \II(h)\x
<M0M26h1/p
0
as h I 0.
Again using (11.2) we see that J S(t - s)B(±(g(s
+ h)- g(s)) - g'(s)) ds x < M 2 }-($(• +ft)-$(-))-s'(-)
LP(0,T;U)
The estimate
1 (g(s + h)- g(s)) - 5 '( s )|* < (8 + | < / ( S ) | ^ <2^1SP
+ \g'\l LpLoom ^ ; C, / ) ' ° ° ( 0 , rm
0<s
and Lebesgue's dominated convergence theorem imply that lim IJI(/i) = / 5(t - a)Bs'(s) ds £ X. hiO J0 By Lemma 11.1, a), the mapping defined by t —> J0S(t — s)Bg'(s) ds is in C(0,T;X). Thus we have proved that (d+ /dt)u £ C(0,T;X). But then u £
458
Chapter 11. Semilinear
Evolution
Equations
C^O.rsA") (see for instance [Yo, p. 239]) with ft
j
-u{t) dt
= S{t) (A
S(t- s)Bg'(s) ds,
0 < t < r,
inX.
D
11.2.
Delay equations with time and state dependent delays
In this section we show that the results of Section 11.1 cover delay systems of the form (11.17)
fty(t)=f(t,y(t),y(t~h(t,yt))),
t > 0,
where / : R+ x R™ x R™ and h : Rn x C(-h0,0;Wl) -> R for some h0 > 0. As usual for delay systems, yt is defined by yt(s) — y(t + s), —ho < s < 0. We restrict ourselves to equations with one delay in order to keep the notation simple. The extension of the results to any finite number of delays is trivial. Let T > 0 be fixed. The functions / and h are assumed to satisfy the following conditions: (Bl)
For any (3 > 0 there exists a constant £p > 0 such that for 0 < t < T we have
(11.18)
\f(t,yi,zi)
- f{t,y2,z2)\ur,
<£0max(\y!
for any yi; Zi with |j/i|K« < (3, constant c > 0, we have (11.19)
|/(*,0,0)|R»
(B2)
|Z;|R"
-y2\&*>,\zi -
22|R»)
< /?, i = 1,2, and, for a
0
is measurable on [0,T] for any y,z e l " .
For all t G [0, T] and <j> G C{-h0,0;
R") we have
0 < h{t,
0 < t < T,
for all 4>,ip G C ( - / i 0 , 0 ; R n ) with \
M.nxLP(-h0,0;Rn),
11.2. Delay equations with time and state dependent delays
459
X = {(0(O),0)UeC(-ho,O;Rn)}, W = {(0(0), 0) | 0 satisfies a Lipschitz condition on [—ho,0}}, U = Rn. We endow H, X with the standard norms (i.e., we have \(r), 4>)\PH \^\PLP{-h0fi-MnY l(0(O),0)|j>f = |0|c(-fco,O;K")) a n d W w i t h t h e n o r m
=
+
MR*
|(0(O),
Bu = {u, 0),
u£U
= Rn,
and (11.21)
G(i,0) = /(i,0(O),0(-/i(*,0))),
0
11.5. L e m m a . Let (Bl) and (B2) 6e satisfied. Then, forG defined in (11.21) assumption (A3) is true. Proof. Measurability of t ->• G(t, -0) = /(*, ^(0), i>(-h(t, >))) on [0, T] for ip € X follows from the measurability assumptions on / and h and from continuity of ip and of f(t, y, z) with respect to z. Let
\G(t, 0) - G(t,VOIt/ <\f(t, 0(0),0(-/^,0))) - f(t,0(0), 0(-ft(i,V))) |R„ + |/(t, 0(0), 0(-/ l (i, V))) - fit, v>(o), ^(-ft(t, v))) |R„ <£ / 3 |0(-/i(i,0))-0(-^V'))| R „ + ^max(|0(O) - V(0)|«n, |#-/i(t f V)) - ^(-M*, ^))|Rn) < ^|0|w|/i(t,)\ + ^(0 - ^U
< e0\
0 < t < T,
so that (11.4) holds. For ip £ X with | ^ | x < /? we get from (11.18) and (11.19) I G f t ^ l t , < \f(t,iK0)M-Ht,j>)))
- /(i,0,0)| R „ + |/(t,0,0)| R n
< ep\1>\x + c < max(tp, c)(l + |V|x), which proves (A3).
0 < t < T, d
460
Chapter 11. Semilinear
Evolution
Equations
Remark. Note that in the proof of the Lipschitz estimate for G we had to restrict the function <j> to the space W in order to get the appropriate estimate for the term