The literal assumptions suffice for the scalar quadratic fidelity problem. One can avoid regularity of level-set boundaries by moving only a clipped part of the minimizer. We prove the stronger jump-amplitude inequality for total variation denoising:
Comparison with the zero function gives finite energy and hence . Here , and both differences use the same oriented BV traces on a hypersurface. Reversing the normal reverses both differences and leaves the inequality unchanged. Outside , the two traces of agree, so the inequality would read at a jump of . It therefore gives the requested no-new-jumps property of total variation denoising in every dimension.
First use residual-preserving clipping of an ROF minimizer. For an integer , put
The coarea formula for BV functions gives scalar total variation splitting under clipping:
Indeed the levels in contribute to , while the levels outside that interval contribute to . This uses the full signed coarea formula. For any , minimality of and the triangle inequality for the total variation seminorm give
Cancel the tail variation. Thus is a bounded ROF denoising minimizer for . The data may still be unbounded. This is an exact reduction preserving ; it does not truncate the data and then pass to a limit of different reconstructions.
We next prove the jump-amplitude inequality for a bounded ROF minimizer, allowing its data to be unbounded. Fix a coordinate , a nonnegative , and let be the local flow of the smooth vector field . The flow is the identity near the domain boundary, preserves each line parallel to , and satisfies . Write
These maps are diffeomorphisms, with and uniformly.
The useful trace calculation is the BV jump-product limit with one bounded factor. For and ,
The right side is integrable: and only the common jump part of contributes. The same limit holds with both increments replaced by their negative-time increments, still dividing by positive .
Here is why this calculation needs only one bounded factor. By the BV slicing theorem, almost every coordinate slice of and has one-sided representatives. On one such interval let and use its right-continuous representative. Since ,
Fubini's theorem rewrites the slice integral as
At each interior , the inner expression tends to ; if , it is zero. Its absolute value is at most . Dominated convergence against therefore leaves just the measure atoms common to the two slices. The bound is also integrable over the transverse coordinates, by the BV slicing theorem. Integrating the slice jump sums gives the surface integral and its factor . Negative-time increments give the same product, because both slice differences reverse sign. At no point is a uniform bound on across the slices required.
For , use the mixed competitors
The total variation under opposite smooth flows satisfies
To see this for the entire vector Radon measure , the change of variables formula gives
For , the two cofactor matrices expand as , with the same and opposite signs. Their norm expansions on have cancelling linear terms. Integrating proves the estimate, including the absolutely continuous, jump and Cantor parts. The BV transformation formula is also given in Lemma 4.2 on differentiable regularizers; that lemma does not assume bounded data. The total variation seminorm is a convex function, so
Thus minimality forces the sum of the two fidelity changes to have nonnegative limit after division by .
It remains to evaluate that sum without bounding . Put . Exact expansion of the quadratic fidelity, together with change of variables, gives the opposite-flow fidelity identity for quadratic data:
For completeness, the cross-term identity fixing its sign is
The last integral is : , while
Take first, then . Here and the local flow is strongly continuous in . The remaining Jacobian mass term is . This argument avoids multiplying an unbounded fidelity derivative by an uncontrolled derivative measure.
Apply the BV jump-product limit with one bounded factor with and , and use minimality. For every nonnegative and every coordinate ,
Let . These are inequalities for finite signed Radon measures, so arbitrary nonnegative smooth tests imply nonnegativity of their densities. Since at least one coordinate of a unit normal is nonzero,
This proves the bounded-minimizer lemma with arbitrary data.
Finally return to and . At almost every finite approximate jump point of , choose an integer . The BV traces on a hypersurface commute with clipping, so , and there. It is consequently a jump point of , and its inequality is exactly . A countable union over removes all exceptional surface-null sets. Outside , the BV traces on a hypersurface of agree almost everywhere. We conclude
The mechanism is exact scalar coarea splitting, paired smooth-flow variations, a one-bounded-factor BV trace limit, and localization through integer clipping levels. It works in every dimension under the printed hypotheses, without essential boundedness of or and without regularity of their level-set boundaries.
In total variation calibration notation, . Since this divergence is itself in the BV space, the proved inequality equivalently reads
Thus an upward output jump forces the appropriate nonpositive jump of the calibrated divergence. This is a consequence of the variational argument above, with common oriented BV traces on a hypersurface; no curvature of the rectifiable interface or differentiability of its normal is assumed.
For , define the set functional
The ROF level-set formulation states that the unique minimizer of has superlevel sets minimizing for almost every . Conversely, an admissible with minimizing superlevel sets is the ROF minimizer. Thus the concise characterization is
The signed layer-cake identity for quadratic fidelity and the coarea formula for BV functions give
Indeed pointwise. Its absolute integral is bounded by , so Fubini's theorem applies for . The negative-level baseline is essential; integrating the unadjusted would generally diverge.
Each attains its minimum. A minimizing sequence of indicator functions has bounded norm, and comparison with the empty set bounds its perimeter by an forcing bound. Bounded-variation compactness supplies a limiting indicator function. The forcing integral converges by dominated convergence, while relative perimeter is sequentially lower semicontinuous.
For , the supplied comparison lemma applied to makes every selected minimizer contained in up to a null set. The comparison of perimeter minimizers with ordered forcing also follows directly: compare with , compare with , add and use submodularity of relative perimeter to obtain .
Select minimizers at rational levels, remove their countably many exceptional null sets, and reconstruct . The strict superlevel set is . This union also minimizes : take , use monotone convergence of its indicator functions and sequential lower semicontinuity, and note that satisfies .
To justify finite energy before assuming it, clip this reconstruction to . Comparison with the empty set gives uniformly on a bounded interval of levels. Since , pairing with compactly supported test-field divergences bounds its total variation seminorm by . Thus belongs to the BV space before applying the coarea formula for BV functions. The layer-cake argument on the finite interval shows for every finite-energy competitor , where is clipping. In particular bounds the norms and variations uniformly. Fatou's lemma excludes infinite values of on a positive-measure set. Bounded-variation compactness and weak convergence in identify an admissible limit . For any fixed competitor, in and its variation tends to that of , by bounded-variation contraction under clipping and sequential lower semicontinuity. Thus .
The quadratic fidelity is strictly convex, so every ROF minimizer equals almost everywhere and has the selected minimizing superlevel sets. Conversely, for any whose levels minimize , integrate the levelwise inequality against any competitor's levels in the displayed identity to obtain . This proves both directions for signed as well as nonnegative data.
For a scalar , put . The coarea formula for BV functions is the measure identity
for every Borel . For almost every real , is a finite-perimeter set, with . In particular . This is relative perimeter: it counts interfaces inside , and does not add the boundary jump of a zero extension.
ROF level-set formulation 2026-10-07
The scalar ROF denoising minimizer has perimeter-plus-forcing minimizing superlevel sets at almost every height. Conversely any finite-energy function with that property minimizes the full energy. The signed layer-cake identity for quadratic fidelity and coarea formula for BV functions prove sufficiency. To prove necessity, construct nested minimizing sets using comparison of perimeter minimizers with ordered forcing, reconstruct a function from rational levels, clip to establish energy bounds, and use uniqueness from strict convexity of the squared fidelity.
For a scalar BV space function, clipping to partitions its coarea formula for BV functions into middle and tail levels. The clipped function has the original superlevel sets at heights in . The positive tail levels of correspond to original heights above , and its negative tail levels to heights below . Thus their total variation seminorms add exactly. This is stronger than the triangle inequality and is specific to scalar monotone clipping. It supports residual-preserving clipping of an ROF minimizer.