1370 CHAPTER 42. MAXIMAL MONOTONE OPERATORS, HILBERT SPACE

Proof: From the above, if u ∈ D(A) and y ∈ Au, then∣∣∣∣ 1λ

u− 1λ

Jλ u∣∣∣∣≤ |y|

Hence Jλ u→ u. Now for x arbitrary,

|Jλ x− x| ≤ |Jλ x− Jλ u|+ |Jλ u−u|+ |u− x|< 2ε + |Jλ u−u|

where the last term converges to 0 as λ → 0. Since ε is arbitrary, this shows the proposition.Thus in the case where D(A) is dense, if you have

x ∈ εAxε + xε

so that xε = Jε x, then |x− xε | → 0.The next lemma gives a way to determine whether a pair [x,y] is in the graph of A

defined as{[x,y] : y ∈ Ax} ≡ G (A)

Here I am writing [·, ·] rather than (·, ·) to avoid confusion with the inner product. It is theconclusion of this lemma which accounts for the use of the term “maximal”. It essentiallysays there is no larger monotone graph which includes the one for A.

Lemma 42.1.5 Suppose (y1− y,x1− x)≥ 0 for all [x,y]∈G (A) where A is maximal mono-tone. Then x1 ∈ D(A) and y1 ∈ Ax1. Also if [xk,yk] ∈ G (A) and xk → x,yk ⇀ y where thehalf arrow denotes weak convergence, then [x,y] ∈ G (A).

Proof: I want to show y1 ∈ Ax1 or in other words I want to show

x1 +λy1 ∈ x1 +λAx1

or in other wordsJλ (x1 +λy1) = x1.

This is the motivation for the following argument.From Lemma 42.1.3 Aλ (x1 +λy1) ∈ AJλ (x1 +λy1) and so by the above assumption

0≤ (y1−Aλ (x1 +λy1) ,x1− Jλ (x1 +λy1))

=

(y1−

(1λ(x1 +λy1)−

Jλ (x1 +λy1)

),x1− Jλ (x1 +λy1)

)=

((− 1

λx1 +

Jλ (x1 +λy1)

),x1− Jλ (x1 +λy1)

)= − 1

λ(x1− Jλ (x1 +λy1) ,x1− Jλ (x1 +λy1))

which requiresx1 = Jλ (x1 +λy1)

1370 CHAPTER 42. MAXIMAL MONOTONE OPERATORS, HILBERT SPACEProof: From the above, if wu € D(A) and y € Au, thenzu—~Jzu} < |p|| 1Xr XrHence J, u — u. Now for x arbitrary,\Igx—x| < |yx—Jyul+|J,u—ul+|u—x|< 2€+|J,u—ulwhere the last term converges to 0 as A — 0. Since € is arbitrary, this shows the proposition.Thus in the case where D(A) is dense, if you havex € €AXe + Xeso that xe = Jex, then |x —xg| > 0.The next lemma gives a way to determine whether a pair [x,y] is in the graph of Adefined as{|x,y] :y © Ax} =G (A)Here I am writing |-,-] rather than (-,-) to avoid confusion with the inner product. It is theconclusion of this lemma which accounts for the use of the term “maximal”. It essentiallysays there is no larger monotone graph which includes the one for A.Lemma 42.1.5 Suppose (y1 —y,x1 —x) > 0 for all [x,y] € Y (A) where A is maximal mono-tone. Then x; € D(A) and y; € Ax. Also if xz, yx] € G (A) and xp > x,y~ — y where thehalf arrow denotes weak convergence, then |x,y] € G (A).Proof: I want to show y; € Ax, or in other words I want to showxy +Ay, Ex, +AAX,or in other wordsJy (x1 +Ay,) =X}.This is the motivation for the following argument.From Lemma 42.1.3 Ag (x; +Ay1) € AJ, (x1 +Ay1) and so by the above assumption0 < (y1 —Ag (x1 +Ay1) x1 —Ja (41 +Ay1))1 1= (» — € (x1 +Ay1) — rae (x1 +4y1)) x1 — Jy (x1 +4y1))1 1= ((-5 + ada (x1 +4y1)) »X1 —Jy (x1 +Ay1))1= ~ x Ja i + Ayi) a1 Sa 1 + Ay)which requiresx1 = Jy (x1 +Ay1)