ScalingStacks

Proof. [02L9]

Original official author HTML, exact retained edition. Historical TeX conversion verdicts remain unchanged. Cited-edition alignment and mathematical self-containment are not assessed.

Complete original source context · Original author HTML

Proof.

Fix x0∈dom⁡(∂f∨)x_{0}\in{\operatorname{dom}}(\partial f^{\vee}) such that C=Cx0C=C_{x_{0}} and u0∈ri⁡(C)u_{0}\in\operatorname{ri}(C). Let x∈∂f⁡(u0)x\in\partial f(u_{0}). Then

(3.29) ⟨x,v−u0⟩≥f⁡(v)−f⁡(u0)for all ​v∈Nℝ.\langle x,v-u_{0}\rangle\geq f(v)-f(u_{0})\quad\text{for all }v\in N_{\mathbb{R}}.

Let u∈Cu\in C. By (3.25), we have f⁡(u)−f⁡(u0)=⟨x0,u−u0⟩f(u)-f(u_{0})=\langle x_{0},u-u_{0}\rangle and so the above inequality implies ⟨x,u−u0⟩≥⟨x0,u−u0⟩.\langle x,u-u_{0}\rangle\geq\langle x_{0},u-u_{0}\rangle. The fact u0∈ri⁡(C)u_{0}\in\operatorname{ri}(C) implies u0+λ⁡(u0−u)∈Cu_{0}+\lambda(u_{0}-u)\in C for some small λ>0\lambda>0. Applying the same argument to this element we obtain the reverse inequality ⟨x,u−u0⟩≤⟨x0,u−u0⟩\langle x,u-u_{0}\rangle\leq\langle x_{0},u-u_{0}\rangle and so

(3.30) ⟨x−x0,u−u0⟩=0.\langle x-x_{0},u-u_{0}\rangle=0.

In particular, f⁡(u)−f⁡(u0)=⟨x0,u−u0⟩=⟨x,u−u0⟩f(u)-f(u_{0})=\langle x_{0},u-u_{0}\rangle=\langle x,u-u_{0}\rangle and from (3.29) we obtain

⟨x,v−u⟩=⟨x,v−u0⟩+f⁡(u0)−f⁡(u)≥f⁡(v)−f⁡(u)for all ​v∈Nℝ.\langle x,v-u\rangle=\langle x,v-u_{0}\rangle+f(u_{0})-f(u)\geq f(v)-f(u)\quad\text{for all }v\in N_{\mathbb{R}}.

Hence x∈⋂u∈C∂f⁡(u)x\in\bigcap_{u\in C}\partial f(u) and so ∂f⁡(u0)⊂⋂u∈C∂f⁡(u)\partial f(u_{0})\subset\bigcap_{u\in C}\partial f(u), which implies the stated equality. ∎

Original mathematics by the credited authors. Source-backed reader collection; mathematical self-containment is not assessed.