Gradients and Hessians in Hilbert spaces

Jordan Bell
July 26, 2015

1 Gradients

Let (X,⟨⋅,⋅⟩) be a real Hilbert space. The Riesz representation theorem says that the mapping

Φ⁢(x)⁢(y)=⟨y,x⟩,Φ:X→X*,

is an isometric isomorphism. Let U be a nonempty open subset of X and let f:U→ℝ be differentiable, with derivative f′:U→ℒ⁢(X;ℝ)=X*. The gradient of f is the function grad⁢f:U→X defined by

grad⁢f=Φ-1∘f′.

Thus, for x∈U, grad⁢f⁢(x) is the unique element of X satisfying

⟨grad⁢f⁢(x),y⟩=f′⁢(x)⁢(y),y∈X. (1)

Because Φ-1:X*→X is continuous, if f∈C1⁢(U;ℝ) then grad⁢f∈C⁢(U;X), being a composition of two continuous functions.

For example, let T be a bounded self-adjoint operator on X and define f:X→ℝ by

f⁢(x)=12⁢⟨T⁢x,x⟩,x∈X.

For x,h∈X,

f⁢(x+h)-f⁢(x)=12⁢⟨T⁢x,h⟩+12⁢⟨T⁢h,x⟩+12⁢⟨T⁢h,h⟩=⟨T⁢x,h⟩+12⁢⟨T⁢h,h⟩.

Thus

|f⁢(x+h)-f⁢(x)-⟨T⁢x,h⟩|=12⁢|⟨T⁢h,h⟩|≤12⁢∥T∥⁢∥h∥2=o⁢(∥h∥),

which shows that f is differentiable at h, with f′⁢(x)⁢(y)=⟨T⁢x,y⟩. Thus by (1), grad⁢f⁢(x)=T⁢x.

For example, let T∈ℒ⁢(X;X), let h∈X, and define f:X→ℝ by

f⁢(x)=12⁢∥T⁢x-h∥2,x∈X.

We calculate that

grad⁢f⁢(x)=T*⁢T⁢x-T*⁢h,x∈X.

For x0∈X, define

ϕ⁢(t)=exp⁡(-t⁢T*⁢T)⁢x0+∫0texp⁡(-(t-s)⁢T*⁢T)⁢T*⁢h⁢𝑑s,t≥0.

It is proved11 1 cf. J.W. Neuberger, A Sequence of Problems on Semigroups, p. 51, Problem 195. that ϕ satisfies

ϕ′⁢(t)=-(grad⁢f)⁢(ϕ⁢(t)),ϕ⁢(0)=x0.

For a function F:X→X, we say that F is L Lipschitz if

∥F⁢(x)-F⁢(y)∥≤L⁢∥x-y∥,x,y∈X.

The following is a useful inequality for functions whose gradients are Lipschitz.22 2 Juan Peypouquet, Convex Optimization in Normed Spaces: Theory, Methods and Examples, p. 15, Lemma 1.30.

Lemma 1.

If f:X→ℝ is differentiable and grad⁢f:X→X is L Lipschitz, then

f⁢(y)≤f⁢(x)+⟨grad⁢f⁢(x),y-x⟩+L2⁢∥y-x∥2,x,y∈X.
Proof.

Let h=y-x and define g:[0,1]→ℝ by g⁢(t)=f⁢(x+t⁢h). By the chain rule, for 0<t<1,

g′⁢(t)=f′⁢(x+t⁢h)⁢(h)=⟨grad⁢f⁢(x+t⁢h),h⟩.

Thus by the fundamental theorem of calculus,

∫01⟨grad⁢f⁢(x+t⁢h),h⟩⁢𝑑t=∫01g′⁢(t)⁢𝑑t=g⁢(1)-g⁢(0)=f⁢(x+h)-f⁢(x)=f⁢(y)-f⁢(x),

and so, using the Cauchy-Schwarz inequality and the fact that grad⁢f is L Lipschitz,

f⁢(y)-f⁢(x) =∫01⟨grad⁢f⁢(x+t⁢h)-grad⁢f⁢(x)+grad⁢f⁢(x),h⟩⁢𝑑t
=⟨grad⁢f⁢(x),h⟩⁢d⁢t+∫01⟨grad⁢f⁢(x+t⁢h)-grad⁢f⁢(x),h⟩⁢𝑑t
≤⟨grad⁢f⁢(x),h⟩+∫01∥grad⁢f⁢(x+t⁢h)-grad⁢f⁢(x)∥⁢∥h∥⁢𝑑t
≤⟨grad⁢f⁢(x),h⟩+∫01L⁢∥t⁢h∥⁢∥h∥⁢𝑑t
=⟨grad⁢f⁢(x),y-x⟩+L2⁢∥y-x∥2,

proving the claim. ∎

2 Hessians

Let U be a nonempty open subset of X. We prove that if a function is C2 then its gradient is C1.33 3 Rodney Coleman, Calculus on Normed Vector Spaces, p. 139, Theorem 6.5.

Theorem 2.

Let U be an open subset of X. If f∈C2⁢(U;ℝ), then grad⁢f∈C1⁢(U;X), and

f′′⁢(x)⁢(u)⁢(v)=⟨v,(grad⁢f)′⁢(x)⁢(u)⟩,x∈U,u,v∈X. (2)
Proof.

That f is C2 means that f′:U→X* is C1. That is, for all x∈U, the map f′:U→X* is continuous at x, there is f′′⁢(x)∈ℒ⁢(X;X*) such that

∥f′⁢(x+h)-f′⁢(x)-f′′⁢(x)⁢(h)∥=o⁢(∥h∥), (3)

as h→0, and the map x↦f′′⁢(x) is continuous U→ℒ⁢(X;X*).

Let x∈U and let h∈X. Define ϕh∈X* by

ϕh⁢(v)=f′′⁢(x)⁢(h)⁢(v),v∈X.

Define νx⁢(h)=Φ-1⁢(ϕh)∈X, thus

f′′⁢(x)⁢(h)⁢(v)=⟨v,νx⁢(h)⟩,v∈X.

It is straightforward that νx is linear. Because Φ is an isometric isomorphism,

∥νx⁢(h)∥=∥ϕh∥=sup∥v∥≤1⁡|ϕh⁢(v)|=sup∥v∥≤1⁡|f′′⁢(x)⁢(h)⁢(v)|≤∥f′′⁢(x)∥⁢∥h∥,

where (u,v)↦f′′⁢(x)⁢(u)⁢(v) is a bilinear form, with

∥f′′⁢(x)∥=sup∥u∥≤1,∥v∥≤1⁡|f′′⁢(x)⁢(u)⁢(v)|,

showing that νx:X→X is a bounded linear operator with ∥νx∥≤∥f′′⁢(x)∥. For h such that x+h∈U and for v∈X,

(f′⁢(x+h)-f′⁢(x)-f′′⁢(x)⁢(h))⁢(v) =⟨v,grad⁢f⁢(x+h)-grad⁢f⁢(x)-νx⁢(h)⟩,

so

∥f′⁢(x+h)-f′⁢(x)-f′′⁢(x)⁢(h)∥ =sup∥v∥≤1⁡|⟨v,grad⁢f⁢(x+h)-grad⁢f⁢(x)-νx⁢(h)⟩|
=∥grad⁢f⁢(x+h)-grad⁢f⁢(x)-νx⁢(h)∥.

Thus by (3),

∥grad⁢f⁢(x+h)-grad⁢f⁢(x)-νx⁢(h)∥=o⁢(∥h∥)

as h→0, and because νx∈ℒ⁢(X;X), this means that grad⁢f:U→X is differentiable at x, with (grad⁢f)′⁢(x)=νx. It remains to prove that x↦νx is continuous U→ℒ⁢(X;X), namely that (grad⁢f)′ is continuous. For x∈U and for h with x+h∈U,

∥νx+h-νx∥ =sup∥u∥≤1⁡∥νx+h⁢(u)-νx⁢(u)∥
=sup∥u∥≤1⁡sup∥v∥≤1⁡|⟨v,νx+h⁢(u)-νx⁢(u)⟩|
=sup∥u∥≤1⁡sup∥v∥≤1⁡|f′′⁢(x+h)⁢(u)⁢(v)-f′′⁢(x)⁢(u)⁢(v)|
=∥f′′⁢(x+h)-f′′⁢(x)∥,

and because f′′ is continuous on U we get that x↦νx is continuous on U, completing the proof. ∎

If f∈C2⁢(U;ℝ), we proved in the above theorem that grad⁢f∈C1⁢(U;X). We call the derivative of grad⁢f the Hessian of f,44 4 cf. R. A. Tapia, The differentiation and integration of nonlinear operators, pp. 45–101, in Nonlinear Functional Analysis and Applications (Louis B. Rall, ed.)

Hess⁢f=(grad⁢f)′,U→ℒ⁢(X;X),

and (2) then reads

f′′⁢(x)⁢(u)⁢(v)=⟨v,Hess⁢f⁢(x)⁢(u)⟩,x∈U,u,v∈X.

Furthermore, it is a fact that if f∈C2⁢(U;ℝ), then for each x∈U, the bilinear form

(u,v)↦f′′⁢(x)⁢(u)⁢(v)

is symmetric.55 5 Serge Lang, Real and Functional Analysis, third ed., p. 344, Theorem 5.3. Thus, for x∈U and u,v∈X,

⟨v,Hess⁢f⁢(x)⁢(u)⟩=⟨u,Hess⁢f⁢(x)⁢(v)⟩.

Now, using that ⟨⋅,⋅⟩ is symmetric as X is a real Hilbert space, (Hess⁢f⁢(x))*∈ℒ⁢(X;X) satisfies

⟨u,Hess⁢f⁢(x)⁢(v)⟩=⟨(Hess⁢f⁢(x))*⁢u,v⟩=⟨v,(Hess⁢f⁢(x))*⁢u⟩.

so

⟨v,Hess⁢f⁢(x)⁢(u)⟩=⟨v,(Hess⁢f⁢(x))*⁢u⟩.

Because this is true for all v we have Hess⁢f⁢(x)⁢(u)=(Hess⁢f⁢(x))*⁢u, and because this is true for all u we have Hess⁢f⁢(x)=(Hess⁢f⁢(x))*, i.e. Hess⁢f⁢(x) is self-adjoint.

Theorem 3.

If U is an open subset of X and f∈C2⁢(U;ℝ), then for each x∈U it is the case that Hess⁢f⁢(x)∈ℒ⁢(X;X) is self-adjoint.

3 Critical points

For an open set U in X for k≥1, and for f∈Ck+2⁢(U;ℝ), we say that x0∈U is a critical point of f if f′⁢(x0)=0. If x0 is a critical point of f, let we say that x0 is a nondegenerate critical point of f if Hess⁢f⁢(x0)∈ℒ⁢(X;X) is invertible. The Morse-Palais lemma66 6 Serge Lang, Differential and Riemannian Manifolds, p. 182, chapter VII, Theorem 5.1; Kung-ching Chang, Infinite Dimensional Morse Theory and Multiple Solution Problems, p. 33, Theorem 4.1; André Avez, Calcul différentiel, p. 87, §3; N. A. Bobylev, S. V. Emel’yanov, and S. K. Korovin, Geometrical Methods in Variational Problems, p. 360, Theorem 5.5.2; Hajime Urakawa, Calculus of Variations and Harmonic Maps, p. 87, chapter 3, §1, Theorem 1.10; Jean-Pierre Aubin and Ivar Ekeland, Applied Nonlinear Analysis, p. 52, Theorem 8; Melvyn S. Berger, Nonlinearity and Functional Analysis: Lectures on Nonlinear Problems in Mathemtical Analysis, p. 355, Theorem 6.5.4. states that if f∈Ck+2⁢(U;ℝ) with k≥1, f⁢(0)=0, and 0 is a nondegenerate critical point of f, then there is some open subset V of U with 0∈V and a Ck diffeomorphism ϕ:V→V, ϕ⁢(0)=0, such that

f⁢(x)=12⁢⟨Hess⁢f⁢(0)⁢(ϕ⁢(x)),ϕ⁢(x)⟩,x∈V.

If x is a critical point of a differentiable function f:U→ℝ, we call f⁢(x) a critical value of f. If k≥n and f∈Ck⁢(ℝn;ℝ), Sard’s theorem tells us that the set of critical values of f has Lebesgue measure 0 and is meager.

For Banach spaces Y and Z, a Fredholm operator77 7 Martin Schechter, Principles of Functional Analysis, second ed., chapter 5. is a bounded linear operator T:Y→Z such that (i) α⁢(T)=dim⁡ker⁡T<∞, (ii) T⁢(Y) is a closed subset of Z, and (iii) β⁢(T)=dim⁡ker⁡T*<∞. The index of a Fredholm operator T is

ind⁢T=α⁢(T)-β⁢(T).

For a differentiable function f:U→ℝ, U an open subset of X, and for x∈U, f′⁢(x)∈ℒ⁢(X;ℝ)=X*. f′⁢(x) is a Fredholm operator if and only if dim⁡ker⁡f′⁢(x)<∞. For U a connected open subset of X and for f∈C1⁢(U;ℝ), we call f a Fredholm map if f′⁢(x) is a Fredholm operator for each x∈U. It is a fact that ind⁢f′⁢(x)=ind⁢f′⁢(y) for all x,y∈U, using that U is connected. We denote this common value by ind⁢f. A generalization of Sard’s theorem by Smale here tells us that if X is separable, U is a connected open subset of X, f∈Ck⁢(U;ℝ) is a Fredholm map, and

k>max⁡{ind⁢f,0},

then the set of critical values of f is meager.88 8 Eberhard Zeidler, Nonlinear Functional Analysis and its Applications, IV: Applications to Mathematical Physics, p. 829, Theorem 78.A; Melvyn S. Berger, Nonlinearity and Functional Analysis: Lectures on Nonlinear Problems in Mathematical Analysis, p. 125, Theorem 3.1.45.

A function f∈C1⁢(X;ℝ) is said to satisfy the Palais-Smale condition if (uk) is a sequence in X such that (i) {f⁢(uk)} is a bounded subset of ℝ and (ii) grad⁢f⁢(uk)→0, then {uk} is a precompact subset of X: every subsequence of (uk) itself has a Cauchy subsequence.

Often when speaking about ordinary differential equations in ℝd, we deal with differentiable functions whose derivatives are locally Lipschitz. ℝd has the Heine-Borel property: a subset K of ℝd is compact if and only if K is closed and bounded. In fact no infinite dimensional Banach space has the Heine-Borel property.99 9 Some Fréchet spaces have the Heine-Borel property, like the space of holomorphic functions on the open unit disc, which is what Montel’s theorem says. Thus a locally Lipschitz function need not be Lipschitz on a bounded subset of X. (On a compact set, the set is covered by balls on which the function is Lipschitz, and then the function is Lipschitz on the compact set with Lipschitz constant equal to the maximum of finitely many Lipschitz constants on the balls.) We denote by 𝒞 the set of function f:X→ℝ that are differentiable and such that for each bounded subset A of X, the restriction of grad⁢f to A is Lipschitz.

The mountain pass theorem1010 10 Lawrence C. Evans, Partial Differential Equations, p. 480, Theorem 2; Antonio Ambrosetti and David Arcoya Álvarez, An Introduction to Nonlinear Functional Analysis and Elliptic Problems, p. 48, §5.3. states that if (i) I∈𝒞, (ii) I satisfies the Palais-Smale condition, (iii) I⁢(0)=0, (iv) there are r,a>0 such that I⁢(u)≥a when ∥u∥=r, and (v) there is some v∈X satisfying ∥v∥>r and I⁢(v)≤0, then

infg∈Γv⁡sup0≤t≤1⁡(I∘g)⁢(t)

is a critical value of I, where

Γv={g∈C⁢([0,1];X):g⁢(0)=0,g⁢(1)=v}.

4 Convexity

We prove that a critical point of a differentiable convex function on an open convex set is a minimum.1111 11 N. A. Bobylev, S. V. Emel’yanov, and S. K. Korovin, Geometrical Methods in Variational Problems, p. 39, Theorem 2.1.4.

Theorem 4.

If A is an open convex set, f:A→ℝ is differentiable and convex, and x0∈A is a critical point of f, then f⁢(x0)≤f⁢(x) for all x∈A.

Proof.

Because f is convex, for 0<t<1,

f⁢(t⁢x+(1-t)⁢x0)≤t⁢f⁢(x)+(1-t)⁢f⁢(x0),

i.e.

f⁢(x0+t⁢(x-x0))-f⁢(x0)t≤f⁢(x)-f⁢(x0).

Taking t→0,

f′⁢(x0)⁢(x-x0)≤f⁢(x)-f⁢(x0),

and because x0 is a critical point,

0≤f⁢(x)-f⁢(x0),

i.e. f⁢(x0)≤f⁢(x). ∎

We establish equivalent conditions for a differentiable function to be convex.1212 12 Juan Peypouquet, Convex Optimization in Normed Spaces: Theory, Methods and Examples, p. 38, Proposition 3.10.

Theorem 5.

If A is an open convex subset of X and f:A→ℝ is differentiable, then the following are equvialent:

  1. 1.

    f is convex.

  2. 2.

    f⁢(y)≥f⁢(x)+⟨grad⁢f⁢(x),y-x⟩, x,y∈A.

  3. 3.

    ⟨grad⁢f⁢(x)-grad⁢f⁢(y),x-y⟩≥0, x,y∈A.

Proof.

Suppose (1). For x,y∈A and 0<t<1, that f is convex means f⁢(t⁢y+(1-t)⁢x)≤t⁢f⁢(y)+(1-t)⁢f⁢(x), i.e.

f⁢(x+t⁢(y-x))-f⁢(x)t≤f⁢(y)-f⁢(x),

and taking t→0 yields

f′⁢(x)⁢(y-x)≤f⁢(y)-f⁢(x),

i.e.

⟨grad⁢f⁢(x),y-x⟩≤f⁢(y)-f⁢(x).

Suppose (2) and let x,y∈A, for which

⟨grad⁢f⁢(x),y-x⟩≤f⁢(y)-f⁢(x),⟨grad⁢f⁢(y),x-y⟩≤f⁢(x)-f⁢(y).

Adding these inequalities,

⟨grad⁢f⁢(x),y-x⟩-⟨grad⁢f⁢(y),y-x⟩≤0.

Suppose (3), let x,y∈A, and define ϕ:[0,1]→ℝ by

ϕ⁢(t)=f⁢(t⁢x+(1-t)⁢y)-t⁢f⁢(x)-(1-t)⁢f⁢(y).

ϕ⁢(0)=0 and ϕ⁢(1)=0, and for 0<t<1, using the chain rule gives

ϕ′⁢(t) =f′⁢(t⁢x+(1-t)⁢y)⁢(x-y)-f⁢(x)+f⁢(y)
=⟨grad⁢f⁢(t⁢x+(1-t)⁢y),x-y⟩-f⁢(x)+f⁢(y).

Let 0<s<t<1, let u=s⁢x+(1-s)⁢y and v=t⁢x+(1-t)⁢y, which both belong to A because A is convex, and so the above reads

ϕ′⁢(s)=⟨grad⁢f⁢(u),x-y⟩-f⁢(x)+f⁢(y),ϕ′⁢(t)=⟨grad⁢f⁢(v),x-y⟩-f⁢(x)+f⁢(y),

so

ϕ′⁢(s)-ϕ′⁢(t)=⟨grad⁢f⁢(u)-grad⁢f⁢(v),x-y⟩.

And

(s-t)⁢(x-y)=u-y-(v-y)=u-v,

so

ϕ′⁢(s)-ϕ′⁢(t)=1s-t⁢⟨grad⁢f⁢(u)-grad⁢f⁢(v),u-v⟩.

But (3) tells us

⟨grad⁢f⁢(u)-grad⁢f⁢(v),u-v⟩≥0,

so, as s-t<0,

ϕ′⁢(s)-ϕ′⁢(t)≤0,

showing that ϕ′ is nondecreasing. On the other hand, because ϕ⁢(0)=0 and ϕ⁢(1)=0, by the mean value theorem there is some 0<t0<1 for which ϕ′⁢(t0)=0. Therefore, because ϕ′ is nondecreasing it holds that

ϕ′⁢(t)≤0,0≤t≤t0,

and

ϕ′⁢(t)≥0,t0≤t≤1.

That is, ϕ is nonincreasing on [0,t0], and with ϕ⁢(0)=0 this yields ϕ⁢(t)≤0 for t∈[0,t0], and ϕ is nondecreasing on [t0,1], and with ϕ⁢(1)=0 this yields ϕ⁢(t)≤0 for t∈[t0,1]. Therefore ϕ⁢(t)≤0 for t∈[0,1], which means that

f⁢(t⁢x+(1-t)⁢y)-t⁢f⁢(x)-(1-t)⁢f⁢(y)≤0,0≤t≤1,

showing that f is convex. ∎

Theorem 6.

If A is an open convex subset of X and f:A→ℝ is twice differentiable, then the following are equivalent:

  1. 1.

    f is convex.

  2. 2.

    ⟨Hess⁢f⁢(x)⁢(v),v⟩≥0, x∈A, v∈X.

Proof.

Suppose (1) and let x∈A. From Theorem 5, v∈X and for t>0 with which x+t⁢v∈A,

⟨grad⁢f⁢(x+t⁢v)-grad⁢f⁢(x),t⁢v⟩≥0,

i.e.

f′⁢(x+t⁢v)⁢(v)-f′⁢(x)⁢(v)t≥0.

Taking t→0,

f′′⁢(x)⁢(v)⁢(v)≥0,

i.e.

⟨Hess⁢f⁢(x)⁢(v),v⟩≥0.

Suppose (2), let x,y∈A and define ϕ:[0,1]→ℝ by

ϕ⁢(t)=f⁢(t⁢x+(1-t)⁢y)-t⁢f⁢(x)-(1-t)⁢f⁢(y).

Applying the chain rule, for 0<t<1,

ϕ′′⁢(t)=f′′⁢(t⁢x+(1-t)⁢y)⁢(x-y)⁢(x-y),

i.e.

ϕ′′⁢(t)=⟨Hess⁢f⁢(t⁢x+(1-t)⁢y)⁢(x-y),x-y⟩≥0,

showing that ϕ′ is nondecreasing. In the proof of Theorem 5 we deduced from ϕ′ being nondecreasing and satisfying ϕ⁢(0)=0, ϕ⁢(1)=0, that f is convex, and the same reasoning yields here that f is convex. ∎

We call a function F:X→X β co-coercive if

⟨F⁢(x)-F⁢(y),x-y⟩≥β⁢∥F⁢(x)-F⁢(y)∥2.

We prove conditions under which the gradient of a differentiable convex function is co-coercive.1313 13 Juan Peypouquet, Convex Optimization in Normed Spaces: Theory, Methods and Examples, p. 40, Theorem 3.13.

Theorem 7 (Baillon-Haddad theorem).

Let f:X→ℝ be differentiable and convex and let L>0. Then grad⁢f is L Lipschitz if and only if grad⁢f is 1L co-coercive.

Proof.

Suppose that grad⁢f is L Lipschitz and for x∈X, define hx:X→ℝ by

hx⁢(y)=f⁢(y)-f′⁢(x)⁢(y)=f⁢(y)-⟨grad⁢f⁢(x),y⟩.

For y,z∈X and 0<t<1, because f is convex,

hx⁢(t⁢z+(1-t)⁢y) =f⁢(t⁢z+(1-t)⁢y)-⟨grad⁢f⁢(x),t⁢z+(1-t)⁢y⟩
≤t⁢f⁢(z)+(1-t)⁢f⁢(y)-⟨grad⁢f⁢(x),t⁢z+(1-t)⁢y⟩
=t⁢hx⁢(z)+(1-t)⁢hx⁢(y),

showing that hx is convex. For y,z∈X,1414 14 Henri Cartan, Differential Calculus, p. 29, Proposition 2.4.2.

hx′⁢(y)⁢(z)=f′⁢(y)⁢(z)-f′⁢(x)⁢(z),

and in particular grad⁢hx⁢(x)=0. Thus by Theorem 4,

hx⁢(x)≤hx⁢(y),y∈X. (4)

For x,y,z∈X, by Lemma 1,

f⁢(z)≤f⁢(x)+⟨grad⁢f⁢(x),z-x⟩+L2⁢∥z-x∥2,

so

hy⁢(z)≤f⁢(x)-⟨grad⁢f⁢(y),z⟩+⟨grad⁢f⁢(x),z-x⟩+L2⁢∥z-x∥2,

i.e.

hy⁢(z)≤hx⁢(x)+⟨grad⁢f⁢(x)-grad⁢f⁢(y),z⟩+L2⁢∥z-x∥2,

and applying (4),

hy⁢(y)≤hx⁢(x)+⟨grad⁢f⁢(x)-grad⁢f⁢(y),z⟩+L2⁢∥z-x∥2. (5)

Now,

∥grad⁢f⁢(x)-grad⁢f⁢(y)∥=sup∥v∥≤1⁡⟨grad⁢f⁢(x)-grad⁢f⁢(y),v⟩

so for each ϵ>0 there is some vϵ∈X with ∥vϵ∥≤1 and

⟨grad⁢f⁢(x)-grad⁢f⁢(y),vϵ⟩≥∥grad⁢f⁢(x)-grad⁢f⁢(y)∥-ϵ.

Let R=∥grad⁢f⁢(x)-grad⁢f⁢(y)∥L, and applying (5) with z=x-R⁢vϵ yields

hy⁢(y) ≤hx⁢(x)+⟨grad⁢f⁢(x)-grad⁢f⁢(y),x-R⁢vϵ⟩+L2⁢∥R⁢vϵ∥2
=hx⁢(x)+⟨grad⁢f⁢(x)-grad⁢f⁢(y),x⟩-R⁢⟨grad⁢f⁢(x)-grad⁢f⁢(y),vϵ⟩
+12⁢L⁢∥grad⁢f⁢(x)-grad⁢f⁢(y)∥2⁢∥vϵ∥2
≤hx⁢(x)+⟨grad⁢f⁢(x)-grad⁢f⁢(y),x⟩-R⁢∥grad⁢f⁢(x)-grad⁢f⁢(y)∥+R⁢ϵ
+12⁢L⁢∥grad⁢f⁢(x)-grad⁢f⁢(y)∥2
=hx⁢(x)+⟨grad⁢f⁢(x)-grad⁢f⁢(y),x⟩-12⁢L⁢∥grad⁢f⁢(x)-grad⁢f⁢(y)∥2+R⁢ϵ.

Likewise, because R does not change when x and y are switched,

hx⁢(x)≤hy⁢(y)+⟨grad⁢f⁢(y)-grad⁢f⁢(x),y⟩-12⁢L⁢∥grad⁢f⁢(y)-grad⁢f⁢(x)∥2+R⁢ϵ.

Adding these inequalities,

0 ≤⟨grad⁢f⁢(x)-grad⁢f⁢(y),x⟩+⟨grad⁢f⁢(y)-grad⁢f⁢(x),y⟩
-1L⁢∥grad⁢f⁢(x)-grad⁢f⁢(y)∥2+2⁢R⁢ϵ,

i.e.

1L⁢∥grad⁢f⁢(x)-grad⁢f⁢(y)∥2≤⟨grad⁢f⁢(x)-grad⁢f⁢(y),x-y⟩+2⁢R⁢ϵ.

This is true for all ϵ>0, so

1L⁢∥grad⁢f⁢(x)-grad⁢f⁢(y)∥2≤⟨grad⁢f⁢(x)-grad⁢f⁢(y),x-y⟩,

showing that grad⁢f is 1L co-coercive.

Suppose that grad⁢f is 1L co-coercive and let x,y∈X. Then applying the Cauchy-Schwarz inequality,

∥grad⁢f⁢(x)-grad⁢f⁢(y)∥2 ≤L⁢⟨grad⁢f⁢(x)-grad⁢f⁢(y),x-y⟩
≤L⁢∥grad⁢f⁢(x)-grad⁢f⁢(y)∥⁢∥x-y∥.

If ∥grad⁢f⁢(x)-grad⁢f⁢(y)∥=0 then certainly ∥grad⁢f⁢(x)-grad⁢f⁢(y)∥≤L⁢∥x-y∥. Otherwise, dividing by ∥grad⁢f⁢(x)-grad⁢f⁢(y)∥ gives

∥grad⁢f⁢(x)-grad⁢f⁢(y)∥≤L⁢∥x-y∥,

showing that grad⁢f is L Lipschitz. ∎