Let . To prove convexity, take with finite values, , and . By the definition of infimum, choose withPut and . Convexity of and givesLet . If either endpoint value is infinite, the convexity inequality is automatic, and gives equality. Thus the infimal convolution of two convex functions is convex under the stated properness assumption. The proof uses approximate minimizing splits, so no attainment of the inner infimum is assumed.
Articles by others on the same topic
There are currently no matching articles.