This document provides a rigorous and detailed exploration of smoothness for real-valued functions on Rn, including formal definitions, key lemmas, and proofs. It connects smoothness to Lipschitz continuity of the gradient, descent guarantees in optimization, Hessian bounds, and cocoercivity. The relationships between convexity, smoothness, and cocoercivity are clarified through the Baillon–Haddad theorem.
The central geometric object throughout the article is the affine approximation of φ at x,
y⟼φ(x)+(y−x)⊤∇φ(x).
Convexity specifies on which side of this tangent model the graph lies, while smoothness controls how far from it the graph may move. The quadratic inequalities introduced below make this relationship precise.
Notation
For a vector x∈Rn, ∥x∥p=(∑i=1n∣xi∣p)p1∀p∈(0,∞) and ∥x∥∞=maxi∈[n]∣xi∣.
For a matrix A∈Rm×n, we let σ(A)⊂[0,∞) be the set of singular values of A, and σf(A)=f{σ(A)} for any operator f∈{min,max,…}.
Similarly, for a square matrix A, we define λ(A)⊂R to be its set of eigenvalues.
For a matrix A∈Rm×n, the induced p→q norm of A is ∥A∥p→q=supx=0∥x∥p∥Ax∥q=sup∥x∥p=1∥Ax∥q. We have ∥A∥2→2=σmax(A), the These are three names for the same quantity here: the largest factor by which A can stretch a Euclidean unit vector. It equals the largest singular value σmax(A)..
Definition 1 [Subdifferentiability]
A function φ:Rn→R is said to be subdifferentiable at x∈Rn if and only if
∃z∈Rn,φ(y)≥φ(x)+(y−x)⊤z∀y∈Rn
The set of all such z is called the subdifferential of φ at x and is denoted by ∂φ(x). When ∂φ(x) is a singleton, we say that φ is differentiable at x:
∂φ(x)={∇φ(x)}■□
The vector z specifies the slope of the affine function
y⟼φ(x)+(y−x)⊤z.
The defining inequality says that this affine function supports the graph of φ from below: it touches the graph at x and never crosses above it. In one dimension, it is a supporting line; in higher dimensions, it is a supporting hyperplane. The subdifferential collects every slope that can provide such a support.
Definition 2 [Convexity]
A function φ:Rn→R is said to be convex if and only if
φ(λx+(1−λ)y)≤λφ(x)+(1−λ)φ(y)∀x,y∈Rn,∀λ∈(0,1)
If φ is subdifferentiable, convexity implies
φ(y)≥φ(x)+(y−x)⊤z∀x,y∈Rn,∀z∈∂φ(x)
If φ is twice differentiable, convexity implies
λmin(∇2φ(x))≥0∀x∈Rn■□
The defining inequality says that the graph of a convex function lies below every chord joining two points of its graph. When the function is differentiable, the equivalent first-order picture is that every tangent hyperplane lies below the graph. When it is twice differentiable, the nonnegative eigenvalues of the Hessian say that the function bends upward in every direction.
For a convex function, chords lie above the graph, whereas supporting lines and tangent hyperplanes lie below it. Definition 1 describes the supporting slopes; Definition 2 describes the global shape.
Definition 3 [Lipschitz Continuity]
For L>0, a function Φ:Rn→Rm is L-Lipschitz continuous if and only if
∥Φ(y)−Φ(x)∥2≤L∥y−x∥2∀x,y∈Rn
When L=1, this means that Φ is A nonexpansive map never increases pairwise distance: ∥Φ(y)−Φ(x)∥2≤∥y−x∥2..
■□
The inequality compares two distances: the distance between the inputs and the distance between their images. The map may rotate, bend, or collapse space, but it cannot separate two outputs by more than L times the original input separation. Thus, L is a worst-case amplification factor. When L=1, no pairwise distance can increase, which explains the term nonexpansive.
When Φ=∇φ, Lipschitz continuity means that the slope of φ cannot change arbitrarily fast as the point moves.
Definition 4 [Cocoercivity]
For L>0, a vector field Φ:Rn→Rn is 1/L-cocoercive if and only if
⟨Φ(x)−Φ(y),x−y⟩≥L1∥Φ(x)−Φ(y)∥22∀x,y∈Rn
Cocoercivity is also often called the The names emphasize two equivalent viewpoints: cocoercivity is historically associated with Dunn, and it can be read as strong monotonicity of the inverse relation when that inverse is well defined.. When L=1, this means that Φ is A map is firmly nonexpansive when ∥Φ(x)−Φ(y)∥22≤⟨Φ(x)−Φ(y),x−y⟩. This is stronger than ordinary nonexpansiveness..
■□
Write Δx:=x−y and ΔΦ:=Φ(x)−Φ(y). Lipschitz continuity controls only the length of ΔΦ. Cocoercivity also controls its direction: the inner product requires ΔΦ to have a sufficiently large component along Δx. In particular, the inner product is nonnegative, so a cocoercive field is monotone.
By the Cauchy–Schwarz inequality, cocoercivity implies ∥ΔΦ∥2≤L∥Δx∥2.
Thus, cocoercivity is stronger than L-Lipschitz continuity in general. The Baillon–Haddad theorem will show that the two notions become equivalent for gradients of convex functions.
Definition 5 [Smoothness]
For L>0, a differentiable function φ:Rn→R is L-smooth if and only if ∇φ:Rn→Rn is L-Lipschitz continuous.
■□
The word smooth refers here to the controlled variation of the gradient, not to the mere existence of many derivatives. If one moves a distance r, the gradient can change by at most Lr. Consequently, the function cannot bend upward or downward faster than a quadratic with curvature L. This is why L appears in the quadratic envelopes of Definition 6 and in the step-size threshold 2/L of the descent and ascent lemma below.
A small L means that the tangent model remains accurate over a relatively large neighborhood. A large L permits the slope to change rapidly, so a smaller optimization step is needed.
Remark 1
In classical analysis and differential geometry, a function φ:Rn→R is often called smooth if it belongs to C∞ is a local differentiability condition of every order. L-smoothness is a global quantitative bound on how fast the first derivative changes. Neither property implies the other on all of Rn., meaning that all its partial derivatives of every order exist and are continuous. This notion differs from L-smoothness in optimization, which only requires the gradient to be L-Lipschitz continuous. Neither property implies the other in general:
A C∞ function need not have a globally Lipschitz gradient. For example, φ(x)=x14 belongs to C∞(Rn), but its Hessian ∇2φ(x)=12x12e1e1⊤ is unbounded. Hence, ∇φ is not globally Lipschitz.
An L-smooth function need not belong to C∞. For example, φ(x)=x121{x1>0} is 2-smooth, but it is not twice differentiable at points where x1=0, and therefore does not belong to C2(Rn)⊋C∞(Rn).
Definition 6 [L-UQI, L-LQI, and L-QI]
For L>0, a differentiable function φ:Rn→R
is L-UQI (upper quadratic inequality) if and only if
For a base point x, define the first-order Taylor remainder
Rφ(y;x):=φ(y)−[φ(x)+(y−x)⊤∇φ(x)].
This is the vertical error made when the tangent model at x is used to predict the value at y.
L-UQI literally means that this error is bounded from above by (L/2)∥y−x∥22. Geometrically, the graph cannot rise above the upward quadratic model centered at x. It may, however, fall arbitrarily far below that model.
L-LQI means that the error is bounded from below by −(L/2)∥y−x∥22. Geometrically, the graph cannot fall below the downward quadratic model. It may rise arbitrarily far above it.
L-QI imposes both bounds. The graph is trapped inside a quadratic tube around its tangent model, and the approximation error grows at most quadratically with the distance from x.
These inequalities do not, by themselves, assert convexity. Convexity would additionally require Rφ(y;x)≥0, whereas concavity would require Rφ(y;x)≤0.
In one dimension, the L-UQI supplies only the upper quadratic envelope, the L-LQI supplies only the lower envelope, and the L-QI traps the function between both. Each envelope touches the tangent model at the base point.
The L-GLB and L-GUB relate two changes at once: the error of the tangent model and the change in the gradient. The L-GLB says that a positive tangent-model error must be large enough to account for the squared change in slope. Its concave counterpart, the L-GUB, says the same thing after reversing the sign.
For a convex L-smooth function, the L-GLB strengthens the ordinary supporting-hyperplane inequality 0≤Rφ(y;x) to 2L1∥∇φ(y)−∇φ(x)∥22≤Rφ(y;x).
Thus, a large change in gradient requires a correspondingly large gap above the tangent hyperplane.
Lemma 1 [One-sided QI]
Let L>0 and let f:Rn→R be differentiable.
Being L-UQI alone, or L-LQI alone, does not imply L-smoothness in general.
If f is convex and L-UQI, then f is L-smooth and L-GLB.
If f is concave and L-LQI, then f is L-smooth and L-GUB.
Remark 2
This lemma says that one-sided quadratic inequality controls curvature in only one direction. The L-UQI prevents excessive upward bending but allows arbitrarily strong downward bending; the L-LQI does the reverse. This is why neither condition alone guarantees L-smoothness.
Convexity supplies the missing sign: for a convex differentiable function, 0≤Rf(y;x).
Combining this with the L-UQI traps the remainder between 0 and (L/2)∥y−x∥22. For a concave function, the symmetric argument combines the nonpositivity of the remainder with the L-LQI. The counterexamples at the end of the proof show exactly what fails when this curvature sign is absent.
Proof
Convex case.
Fix x,y∈Rn and define the Adding or subtracting an affine function does not change curvature: the affine term cancels in the convexity inequality. Thus Fx is convex whenever f is convex.
Fx(z):=f(z)−f(x)−(z−x)⊤∇f(x).
By convexity, Fx(z)≥0 for every z∈Rn. Subtracting an affine function preserves the L-UQI, so
Fx(v)≤Fx(u)+(v−u)⊤∇Fx(u)+2L∥v−u∥22∀u,v∈Rn.
Set
s:=∇Fx(y)=∇f(y)−∇f(x),w:=y−L1s.
Applying the L-UQI for Fx with base point y and target point w gives
which explicitly proves that f is L-GLB. On the other hand, since f is L-UQI,
Fx(y)≤2L∥y−x∥22.
Combining these two displayed inequalities yields
2L1∥∇f(y)−∇f(x)∥22≤2L∥y−x∥22.
Because L>0, taking square roots gives
∥∇f(y)−∇f(x)∥2≤L∥y−x∥2.
Thus f is L-smooth.
Concave case.
Assume that f is concave and L-LQI, and apply the Negation turns concavity into convexity, changes a lower quadratic inequality into an upper one, and preserves gradient differences up to sign. It therefore transfers the convex result directly to the concave case.. Then q is convex, and the L-LQI for f is equivalent to the L-UQI for q. By the convex case, q is L-smooth and L-GLB. Since ∇q=−∇f, it follows immediately that f is L-smooth. The L-GLB for q gives
2L1∥∇f(y)−∇f(x)∥22≤−[f(y)−f(x)−(y−x)⊤∇f(x)],
which is equivalent to the L-GUB for f.
Counterexamples: why a one-sided quadratic inequality is insufficient
For the L-UQI, let f:Rn→R be defined by
f(x):=−a∥x∥22(a>0).
Then ∇f(x)=−2ax and, for every x,y∈Rn,
f(y)−f(x)−(y−x)⊤∇f(x)=−a∥y−x∥22≤2L∥y−x∥22.
Thus f is L-UQI for every L>0. However,
∥∇f(y)−∇f(x)∥2=2a∥y−x∥2,
so f is L-smooth if and only if L≥2a. Choosing 0<L<2a shows that the L-UQI alone does not imply L-smoothness.
For the L-LQI, define instead f(x):=a∥x∥22. Then
f(y)−f(x)−(y−x)⊤∇f(x)=a∥y−x∥22≥−2L∥y−x∥22.
so f is L-LQI. Again, f is L-smooth if and only if L≥2a. Choosing 0<L<2a shows that the L-LQI alone does not imply L-smoothness.
■□
Lemma 2 [Descent and Ascent Lemma]
Let L>0, and let φ:Rn→R be differentiable.
Then φ is L-smooth if and only if it is L-QI.
Remark 3
The standard descent lemma in the optimization literature usually focuses on only one side of the result: the upper quadratic inequality and the descent obtained with a positive learning rate. Here, we state the two-sided L-QI and thus generalize the usual presentation to include ascent as well. Indeed, for any learning rate α∈[0,2/L], moving from x to x−α∇φ(x) cannot increase φ. Symmetrically, for α∈[−2/L,0], the same update moves in the gradient direction and cannot decrease φ. Corollary 1 quantifies both the descent and the ascent, while Corollary 2 gives the corresponding gradient bounds when φ is bounded below or bounded above.
The equivalence is important: L-smoothness is a statement about the variation of the gradient, whereas the L-QI is a statement about function values and tangent models. Lemma 2 says that these are two descriptions of exactly the same regularity.
On a one-dimensional slice of the function, a positive learning rate moves against the gradient and produces descent, whereas a negative learning rate moves with the gradient and produces ascent. Smoothness determines the interval of learning rates for which these changes are guaranteed.
Proof
(⟹) L-smoothness implies L-QI.
Let x,y∈Rn and define d:=y−x. We reduce the multivariate statement to the one–variable case by slicing φ along the line segment joining x and y. Define ψ:[0,1]⟶R by
ψ(t)=φ(x+td).
By the fundamental theorem of calculus, ψ(1)=ψ(0)+∫01ψ′(t)dt, and by the chain rule, ψ′(t)=⟨∇φ(x+td),d⟩. Therefore,
In the second equality, the blue terms display the same quantity being added and subtracted. The first inequality follows from the Cauchy–Schwarz inequality, and the second uses the L-Lipschitz continuity of ∇φ.
Since −φ is also L-smooth, applying the upper bound just proved to −φ gives
−φ(y)≤−φ(x)−⟨∇φ(x),d⟩+2L∥d∥22,
or, equivalently,
φ(y)≥φ(x)+⟨∇φ(x),d⟩−2L∥d∥22.
Combining the upper and lower bounds and recalling that d=y−x yields precisely the two-sided L-QI.
The blue and orange terms are the two possible signs of the same remainder r, while the purple quadratic term is common to both shifted functions. Since ∣r∣≤(L/2)∥d∥22, both colored sums are nonnegative.
Both quantities lie in [0,L∥d∥22]. Hence g and h are convex and 2L-UQI. By Lemma 1, they are (2L)-GLB. Therefore,
The blue and orange vectors are mirror images in the Δ component. When their squared norms are added, the opposite cross terms cancel; this is precisely the parallelogram identity used in the next line.
Thus ∇φ is L-Lipschitz continuous, so φ is L-smooth.
■□
Corollary 1 [Descent and ascent]
If a function φ:Rn→R is L-smooth, then, for every x∈Rn and every α∈R,
The two sides of the L-QI are used separately here. The upper quadratic bound produces the descent guarantee for 0≤α≤2/L, while the lower quadratic bound produces the ascent guarantee for −2/L≤α≤0. At the endpoints α=±2/L, the result guarantees only that the function does not move in the wrong direction. For an interior step and a nonzero gradient, the displayed quadratic estimate is strict.
Proof
Fix x∈Rn and set y:=x−α∇φ(x). By Lemma 2, φ is L-QI. Its upper quadratic inequality gives
The orange terms give the mirrored lower estimate. When −2/L<α<0, their combined coefficient makes the new value strictly larger whenever ∇φ(x)=0.
For 0≤α≤2/L, the coefficient α(2−Lα)/2 is nonnegative, which proves the descent statement. For −2/L≤α≤0, the coefficient −α(2+Lα)/2 is nonnegative, which proves the ascent statement.
The choice ∣α∣=1/L is special because it maximizes the guaranteed quadratic improvement: both denominators reduce to 1/L. The corollary therefore converts a function-value gap into a pointwise bound on the gradient. Near the infimum of a function bounded below—or near the supremum of a function bounded above—an L-smooth function cannot retain a large gradient.
Proof
For α∈(0,2/L), Corollary 1 and the definition of φ⋆ give
φ⋆≤φ(x−α∇φ(x))≤φ(x)−2α(2−Lα)∥∇φ(x)∥22,
which yields the first bound. Setting α=1/L gives its stated special case.
For α∈(−2/L,0), Corollary 1 and the definition of φ⋆ give
φ⋆≥φ(x−α∇φ(x))≥φ(x)+2(−α)(2+Lα)∥∇φ(x)∥22,
which yields the second bound. Setting α=−1/L gives its stated special case.
The blue chain uses the lower bound φ⋆ to limit how much descent remains possible. The orange chain is its ascent counterpart: the upper bound φ⋆ limits how much increase remains possible.
■□
Lemma 3 [Bounds on the curvature]
A twice-differentiable function φ:Rn→R is L-smooth if and only if
λ(∇2φ(x))⊂[−L,L]∀x∈Rn■□
For a unit direction v, the scalar v⊤∇2φ(x)v measures the second-order bending of φ along that direction. The eigenvalues of the Hessian are the extreme directional curvatures, as expressed by the For a symmetric matrix H, the quotient v⊤Hv/∥v∥22 is its curvature along v. Its minimum and maximum over nonzero vectors are the smallest and largest eigenvalues.:
Thus, the interval [−L,L] says that neither upward nor downward curvature can have magnitude larger than L.
This is the second-order version of the quadratic tube in Definition 6. For a convex function, all eigenvalues are already nonnegative, so the condition reduces to λ(∇2φ(x))⊂[0,L]. The lower bound expresses convexity, and the upper bound expresses L-smoothness.
Proof
(⟹) Assume that φ is L-smooth. Fix x∈Rn. For a vector v∈Rn, the directional derivative of ∇φ at x is given by
∇2φ(x)v=t→0limt∇φ(x+tv)−∇φ(x)
Taking norms and using the L-Lipschitz property of ∇φ,
The blue factors show the same infinitesimal distance ∣t∣: Lipschitz continuity contributes one factor through ∥tv∥2=∣t∣∥v∥2, which then cancels with the difference-quotient denominator.
If v is an eigenvector of ∇2φ(x) associated with the eigenvalue λ, then λv=∇2φ(x)v, which implies ∣λ∣∥v∥2=∥∇2φ(x)v∥2≤L∥v∥2. Dividing both sides by ∥v∥2=0, we obtain ∣λ∣≤L.
(⟸) Now assume that, for every x∈Rn, all the eigenvalues of ∇2φ(x) lie in [−L,L].
Let x,y∈Rn and define d:=y−x. We want to show that
∥∇φ(y)−∇φ(x)∥2≤L∥d∥2
We reduce the multivariate statement to the one-variable case by slicing ∇φ along the line segment joining x and y. Define
ψ(t)=∇φ(x+td)∀t∈[0,1]
By the fundamental theorem of calculus, ψ(1)−ψ(0)=∫01ψ′(t)dt, and by the chain rule, ψ′(t)=∇2φ(x+td)d. Therefore,
The purple step uses ∇2φ(⋅)2→2=σmax(∇2φ(⋅))≤L. Indeed, since φ∈C2(Rn), its Hessian is symmetric, so A real symmetric matrix has an orthonormal eigenbasis and singular values equal to the absolute values of its eigenvalues. Hence ∥H∥2→2=maxi∣λi(H)∣., which is at most L by assumption.
■□
Lemma 4 [Baillon–Haddad]
Let φ:Rn→R be a differentiable function.
If ∇φ is 1/L-cocoercive, then φ is L-smooth. The converse is false in general.
If φ is convex and L-smooth, then ∇φ is 1/L-cocoercive.
Remark 4
Let
Δx:=x−y,Δ∇φ:=∇φ(x)−∇φ(y),
and let θ be the angle between these vectors. Cocoercivity can be written as
∥Δ∇φ∥2∥Δx∥2cosθ≥L1∥Δ∇φ∥22.
When Δ∇φ=0, this becomes
cosθ≥L∥Δx∥2∥Δ∇φ∥2.
Lipschitz continuity provides only the bound on the ratio appearing on the right. Cocoercivity additionally says that the change in the gradient is aligned strongly enough with the change in position. Convexity supplies this directional structure; the Baillon–Haddad theorem shows that, for a convex gradient field, the Lipschitz bound automatically upgrades to cocoercivity.
Lipschitz continuity limits the length of the field variation. Cocoercivity also requires a sufficiently large projection onto the input displacement, so the two variations cannot point in opposing directions.
Proof
(⟹) Cocoercivity implies L-smoothness
Fix x,y∈Rn. If ∇φ(x)=∇φ(y), then ∥∇φ(x)−∇φ(y)∥2=0≤L∥x−y∥2. We may therefore assume that ∇φ(x)=∇φ(y). If ∇φ is 1/L-cocoercive, then
L1∥∇φ(x)−∇φ(y)∥22≤(∇φ(x)−∇φ(y))⊤(x−y).
The Cauchy–Schwarz inequality therefore implies
∥∇φ(x)−∇φ(y)∥22≤L∥∇φ(x)−∇φ(y)∥2∥x−y∥2
Dividing both sides by ∥∇φ(x)−∇φ(y)∥2=0 gives ∥∇φ(x)−∇φ(y)∥2≤L∥x−y∥2. Hence, φ is L-smooth.
The converse is false in general. The For φ(x)=−∥x∥22/2, the gradient is 1-Lipschitz but points opposite the displacement, making the monotonicity inner product negative. Cocoercivity is therefore impossible. is φ(x)=−21∥x∥22. We have ∇φ(x)=−x and ∇2φ(x)=−I, so φ is L-smooth if and only if L≥1. However, for every L>0, ∇φ is not 1/L-cocoercive, since
Let us find the point z∗(t) that minimizes the A function of the form g⊤(z−t)+(L/2)∥z−t∥22 has gradient g+L(z−t). Setting it to zero gives the unique minimizer z=t−g/L. on the right-hand side with respect to z. This occurs when
The blue and orange function-value differences cancel exactly when the two inequalities are added. The remaining two tangent terms then combine into the inner product required for cocoercivity.
■□
This result is the Baillon–Haddad theorem restricted to Euclidean spaces. We give the general version below. From now on, let H be a real A Hilbert space is a complete inner-product space. It may be finite- or infinite-dimensional; completeness ensures that Cauchy sequences converge inside the space. with inner product ⟨⋅,⋅⟩ and induced norm ∥⋅∥.
Definition 8
We say that a function φ:H→R is Fréchet differentiability requires one bounded linear map to approximate the function uniformly over all sufficiently small directions. It is stronger than merely having every directional derivative. at x∈H if there exists a bounded linear operator Dφ(x):H→R such that
∥h∥→0lim∥h∥∣φ(x+h)−φ(x)−Dφ(x)(h)∣=0
Equivalently, using r(h)=o(∥h∥) means r(h)/∥h∥→0 as h→0: the remainder is negligible compared with the size of the displacement.,
φ(x+h)=φ(x)+Dφ(x)(h)+o(∥h∥)as h→0
Since Dφ(x) is a bounded linear functional on H, the Every bounded linear functional on a Hilbert space has the form h↦⟨g,h⟩ for a unique vector g. That representing vector is the gradient. guarantees that there exists a unique vector ∇φ(x)∈H such that
Dφ(x)(h)=⟨∇φ(x),h⟩∀h∈H
Therefore, the Fréchet differentiability of φ at x can also be written as
φ(x+h)=φ(x)+⟨∇φ(x),h⟩+o(∥h∥)■□
Fréchet differentiability says that, after subtracting the best linear approximation, the remaining error is negligible compared with ∥h∥ as h→0. Unlike a directional derivative, this approximation must work uniformly across all directions of approach. The Riesz representation theorem allows the bounded linear derivative to be represented by the gradient vector, so the familiar tangent-hyperplane picture continues to hold in a Hilbert space.
Definition 9
For L>0, a function Φ:H→H is
L-Lipschitz continuous if and only if
∥Φ(y)−Φ(x)∥≤L∥y−x∥∀x,y∈H
1/L-cocoercive if and only if
⟨Φ(x)−Φ(y),x−y⟩≥L1∥Φ(x)−Φ(y)∥2∀x,y∈H■□
Theorem 1 [Baillon–Haddad]
Let φ:H→R be a Fréchet differentiable function on H.
If ∇φ is 1/L-cocoercive, then ∇φ is L-Lipschitz continuous. The converse is false in general.
If φ is convex and ∇φ is L-Lipschitz continuous, then ∇φ is 1/L-cocoercive.
Proof
For the full Hilbert-space proof, see Heinz H. Bauschke and Patrick L. Combettes, The Baillon–Haddad Theorem Revisited. The paper proves and relates several equivalent forms in Hilbert spaces..
■□
Remark 5
For an arbitrary vector field, being L-Lipschitz controls only length and is strictly weaker than being 1/L-cocoercive. A gradient field is more structured because its variations arise from a scalar potential, and convexity forces those variations to be monotone. The Baillon–Haddad theorem says that these two additional facts are exactly strong enough to recover the missing alignment estimate.
The easy direction, cocoercivity implying Lipschitz continuity, follows from the Cauchy–Schwarz inequality. The remarkable direction is the converse under convexity: an L-Lipschitz gradient is automatically 1/L-cocoercive.
Corollary 3 [Nonexpansive gradients are firmly nonexpansive]
Let φ:H→R be a convex and continuously Fréchet differentiable function. If ∇φ is nonexpansive, then it is firmly nonexpansive.
This follows directly from Theorem 1 by taking L=1. It is the classical formulation of the Baillon–Haddad theorem that is often found in textbooks; the general form states that an L-Lipschitz gradient of a convex function is 1/L-cocoercive.
Cite this post
If you would like to cite this post, you can use the following BibTeX entry:
@misc{tikengnotsawo2025smoothnessdescentcocoercivity,
author = {Tikeng Notsawo, Pascal Jr.},
title = {{Smoothness, Descent, and Cocoercivity}},
year = {2025},
month = feb,
url = {https://tikquuss.github.io/blog/smoothness-descent-cocoercivity/},
note = {Blog post}
}