For a proper convex function on a real Hilbert space, its subdifferential at is
In a Banach space, interpret the pairing with an element of the dual space. For a chosen subgradient , the Bregman distance is
If also , its symmetric Bregman distance is
The subgradient inequality proves nonnegativity. These quantities depend on the chosen subgradients and generally are not metrics: they need not distinguish different points or obey the triangle inequality.
For a convex functional on a real Banach space, its subdifferential at is empty unless is finite; otherwise
Given , the Bregman distance is
It can be infinite if is infinite. If is differentiable at , the choice is its derivative; otherwise the base subgradient must be specified. Given also , add both directional distances to obtain the symmetric Bregman distance
The symmetric version here is the sum, not half the sum. These nonnegative quantities are not generally metrics and can vanish at distinct points.
Assume the displayed variational minimizer exists and is bounded and linear. The smooth data-fidelity term and the subdifferential sum rule give
Use the supplied source condition in variational regularization . Put and , so . By the symmetric Bregman distance identity,
Dropping the last square and using proves the source-condition estimate for symmetric Bregman distance:
The source condition also makes a -minimizing exact solution: for , its subgradient inequality has zero pairing with . Existence of is not implied by properness and lower semicontinuity alone; it is a hypothesis when no coercivity/compactness condition is provided.