Throughout, each result cited is universally quantified over the data appearing in its own statement and is applied to the data named here. The Cauchy-Schwarz inequality ∣u⋅v∣≤∥u∥∥v∥ is Cauchy-Schwarz Inequality for the Euclidean Dot Product, and the homogeneity and triangle inequality of the Euclidean norm are claims 5 and 6 of Elementary Properties of the Euclidean Norm on Rn; claim 2 of that lemma identifies dE(x,y) with ∥x−y∥. Since ∥q0∥≤L and norms are nonnegative, 0≤L. Write ∂ϕL=∂RnϕL.
Step 1 (Claim 1). Let x∈Rn and let Sx={ϕ(z)+L∥x−z∥:z∈G}. It is nonempty, G being nonempty. It is bounded below: for z∈G the subgradient inequality at x0 gives ϕ(z)≥ϕ(x0)+q0⋅(z−x0), and
q0⋅(z−x0)=q0⋅(z−x)+q0⋅(x−x0)≥−∥q0∥∥z−x∥+q0⋅(x−x0)≥−L∥x−z∥+q0⋅(x−x0)
by Bilinearity and Symmetry of the Dot Product on Rn, Cauchy-Schwarz, claim 3 of Properties of the Absolute Value in an Ordered Field, and claim 5 of Elementary Arithmetic in an Ordered Field applied with the nonnegative factor ∥z−x∥. Adding L∥x−z∥,
ϕ(z)+L∥x−z∥≥ϕ(x0)+q0⋅(x−x0),
a bound independent of z. Hence the infimum ϕL(x) exists in R.
For x∈G the choice z=x gives ϕL(x)≤ϕ(x)+L∥x−x∥=ϕ(x).
Lipschitz. Let x,y∈Rn and z∈G. By the triangle inequality, ∥x−z∥≤∥y−z∥+∥x−y∥, so ϕL(x)≤ϕ(z)+L∥x−z∥≤(ϕ(z)+L∥y−z∥)+L∥x−y∥ by claim 5 of Elementary Arithmetic in an Ordered Field with the nonnegative factor L. Taking the infimum over z∈G gives ϕL(x)−L∥x−y∥≤ϕL(y), that is ϕL(x)−ϕL(y)≤L∥x−y∥; exchanging x and y and using claim 6 of Properties of the Absolute Value in an Ordered Field gives ∣ϕL(x)−ϕL(y)∣≤LdE(x,y), so ϕL is Lipschitz with constant L.
Convexity. Let u,v∈Rn, let t be a real number with 0≤t≤1, and let ε be a positive real number. By claim 4 of Approximation Property of the Supremum and the Infimum in R, applied to Su and to Sv, there are zu,zv∈G with
ϕ(zu)+L∥u−zu∥≤ϕL(u)+ε,ϕ(zv)+L∥v−zv∥≤ϕL(v)+ε.
The point zt=(1−t)zu+tzv lies in G, which is convex, and ϕ(zt)≤(1−t)ϕ(zu)+tϕ(zv) by convexity of ϕ. Writing w=(1−t)u+tv, one has w−zt=(1−t)(u−zu)+t(v−zv) by Euclidean Space Rn is a Real Vector Space, so the triangle inequality and homogeneity give ∥w−zt∥≤(1−t)∥u−zu∥+t∥v−zv∥. Therefore
ϕL(w)≤ϕ(zt)+L∥w−zt∥≤(1−t)(ϕ(zu)+L∥u−zu∥)+t(ϕ(zv)+L∥v−zv∥)≤(1−t)ϕL(u)+tϕL(v)+ε,
using claim 5 of Elementary Arithmetic in an Ordered Field with the nonnegative factors 1−t and t. As ε was an arbitrary positive real number, Comparison of Real Numbers with Arbitrary Positive Slack §slack-above gives ϕL(w)≤(1−t)ϕL(u)+tϕL(v), so ϕL is convex on Rn.
Step 2 (Claim 2). Let x∈G and p∈∂Gϕ(x) with ∥p∥≤L. For z∈G the subgradient inequality and Cauchy-Schwarz give
ϕ(z)+L∥x−z∥≥ϕ(x)+p⋅(z−x)+L∥x−z∥≥ϕ(x)−∥p∥∥z−x∥+L∥x−z∥≥ϕ(x),
the last step by claim 5 of Elementary Arithmetic in an Ordered Field applied to ∥p∥≤L with the nonnegative factor ∥x−z∥. Hence ϕ(x) is a lower bound for Sx and ϕL(x)≥ϕ(x); with claim 1 this gives ϕL(x)=ϕ(x).
Now let y∈Rn and z∈G. By Bilinearity and Symmetry of the Dot Product on Rn, Cauchy-Schwarz and claim 5 of Elementary Arithmetic in an Ordered Field,
p⋅(z−x)=p⋅(y−x)+p⋅(z−y)≥p⋅(y−x)−L∥z−y∥,
so, using the subgradient inequality once more,
ϕ(z)+L∥y−z∥≥ϕ(x)+p⋅(z−x)+L∥y−z∥≥ϕ(x)+p⋅(y−x)=ϕL(x)+p⋅(y−x).
Taking the infimum over z∈G gives ϕL(y)≥ϕL(x)+p⋅(y−x) for every y∈Rn, that is p∈∂ϕL(x).
Step 3 (Claim 3). Let x∈G with ∂Gϕ(x)={p} and ∥p∥≤L. By claim 2, p∈∂ϕL(x) and ϕL(x)=ϕ(x). Conversely let q∈∂ϕL(x) and let y∈G. Then, using ϕL≤ϕ on G from claim 1,
ϕ(y)≥ϕL(y)≥ϕL(x)+q⋅(y−x)=ϕ(x)+q⋅(y−x).
As y∈G was arbitrary, q∈∂Gϕ(x)={p}, so q=p. Hence ∂ϕL(x)={p}.