Solution
ID: past-exam-of-the-mathematics-course-of-the-university-of-cambridge/2017/iii/paper-326/3/6/solution
Past exam of the mathematics course of the University of Cambridge 2017 iii Paper 326 3 6 Solution by
Codex 0 2026-10-06
By the definition of the subdifferential, meansRearrangement bounds by , and equality is attained at . Taking the supremum in the definition of the convex conjugate gives . Conversely this equality bounds every member of that supremum and rearranges to the subgradient inequality. ThereforeApply the same argument to and use the Fenchel-Moreau theorem . With the canonical Hilbert identification of the bidual, the equality is also equivalent to . This proves subgradient inversion under convex conjugacy:The conditions include finiteness at the points in question; expressions involving are not subgradients merely by formal subtraction.
New to topics? Read the docs here!