For a functional on a real Banach space, its convex conjugate is defined on the dual space by
Here is the dual pairing. For complex spaces, use its real part, equivalently regard the space as real for convex analysis. The convex conjugate is a convex function, being the supremum of affine functions of , even when itself is not convex.
For , the definition of the convex conjugate gives
where the substitution is a bijection of the independent pairs. Therefore
This infimal convolution identity does not need convexity of or attainment of the inner infimum. The assumptions ensure that both functions have nonempty effective domains; their conjugates never take , so the separated sum is well defined, allowing .
Since
for , the second-derivative criterion shows that is strictly convex. Put , so . For dual variable , the stationary equation in the Legendre transform is
It is the unique global maximizer of , and hence
Applying the same calculation with the conjugate exponent gives
Under the Legendre-Fenchel transform on all real dual variables, the same supremum additionally gives for .
Now take , , and apply the Fenchel–Young inequality . This yields Young's inequality for products
for positive and conjugate exponents .
Let and let denote its convex conjugate. Its Fenchel–Young gap
is nonnegative by the Fenchel–Young inequality, and the hypothesis says .
First justify the integrability needed for the certificate. Finite second moments and the Cauchy-Schwarz inequality imply, for every transport plan ,
Since and , the identity proves by the marginal distribution property. In particular, no subtraction of infinite integrals is being used.
Set
These are integrable Kantorovich potentials. The Fenchel–Young inequality gives . More precisely, for every transport plan ,
Taking the infimum in the first inequality therefore proves
The factor in the quadratic cost is essential for this exact gap identity.
Use the sign convention
for the Lagrangian function in constrained optimization. The Lagrangian dual problem is
where is the convex conjugate. For this convex problem with affine equality constraints, the stationarity and feasibility parts of the Karush-Kuhn-Tucker conditions are
They say exactly that the displayed operator satisfies
Thus its zeros are precisely the primal-dual optimal points, subject to the usual attainment assumptions.
For and , the Euclidean inner product gives
The last two terms cancel by the defining property of the matrix transpose, and the first is nonnegative by part a. Hence is a monotone operator.
For a proper lower-semicontinuous convex function , its proximal operator is
The squared norm is strongly convex, so the minimizer is unique. The subdifferential sum rule gives the necessary and sufficient condition
More generally,
The subgradient inversion rule for the convex conjugate says exactly when . Hence
which is precisely the proximal optimality condition
Since , this proves the generalized Moreau decomposition
The function is the support function . For a nonempty compact convex set,
so its convex conjugate is the indicator function . Applying the Moreau decomposition,
Multiplication of an indicator function by a positive scalar does not change it, and its proximal operator is the Euclidean projection onto a convex set. Therefore
The Reuss elastic approximation assumes uniform stress. The local strain is the derivative of the convex conjugate ; its mean is . Under invertible differentiable duality, this mean determines . For positive linear elasticity, . Uniform stress is generally not accompanied by a compatible local displacement field, so this approximation is distinguished from an exact heterogeneous solution.
Support function 2026-09-28
The support function of a nonempty set is . It is convex and positively homogeneous, and for a closed convex set its convex conjugate is the indicator function of .