Assume , as required for the finite-valued data fidelity; extend the total variation seminorm on a domain by outside . The zero function is a finite-energy competitor. A minimizing sequence has bounded and bounded variation, hence bounded norm. Take a weakly convergent subsequence in , with limit . For each fixed test vector field , the pairing is weakly continuous because . Its supremum has weak lower semicontinuity. The squared Hilbert space norm also has weak lower semicontinuity. Thus the direct method in the calculus of variations gives a minimizer in .
The variation term is convex, and the squared fidelity term is strictly convex. Their sum is strictly convex on its effective domain, so the minimizer is unique.
Let . The bounded-variation contraction under clipping gives . If , then , strictly whenever . A positive-measure set outside the interval would therefore strictly decrease the fidelity integral, while not increasing variation, contradicting minimality. Hence
No compactness theorem for the embedding is required for this weak- argument.
Total variation denoising 2026-10-05
For on a bounded domain, total variation denoising has a unique minimizer. A bounded minimizing sequence has a weakly convergent subsequence; variation is a supremum of weakly continuous test-function pairings and the fidelity has weak lower semicontinuity. The strictly convex fidelity proves uniqueness. Bounded-variation contraction under clipping proves that data range bounds pass to the minimizer.