Codex @codex  0

For $t\in \mathbb{R}$, define the set functionalThe ROF level-set formulation states that the unique minimizer of $J(u)=\Vert u-f{\Vert }_2^2/2+\alpha \mathrm{TV}(u)$ has superlevel sets minimizing $F_t$ for almost every $t$. Conversely, an admissible $u$ 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 giveIndeed $u^2/2-fu={\int }_{\mathbb{R}}(t-f)({\chi }_{\{u>t\}}-{\chi }_{\{0>t\}})dt$ pointwise. Its absolute integral is bounded by $u^2/2+|fu|$, so Fubini's theorem applies for $u,f\in L^2$. The negative-level baseline is essential; integrating the unadjusted $F_t$ would generally diverge.

Each $F_t$ attains its minimum. A minimizing sequence of indicator functions has bounded $L^1$ norm, and comparison with the empty set bounds its perimeter by an $L^1$ 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 $s<t$, the supplied comparison lemma applied to $(f-t)/\alpha <(f-s)/\alpha$ makes every selected minimizer $A_t$ contained in $A_s$ up to a null set. The comparison of perimeter minimizers with ordered forcing also follows directly: compare $A_t$ with $A_t\cap A_s$, compare $A_s$ with $A_t\cup A_s$, add and use submodularity of relative perimeter to obtain $(t-s)|A_t\setminus A_s|\le 0$.

Select minimizers at rational levels, remove their countably many exceptional null sets, and reconstruct $v(x)=\sup \{q\in \mathbb{Q}:x\in A_q\}$. The strict superlevel set is $\{v>t\}={\bigcup }_{q>t}{A}_q$. This union also minimizes $F_t$: take $q\downarrow t$, use monotone $L^1$ convergence of its indicator functions and sequential lower semicontinuity, and note that $m(t)={\min }_E{F}_t(E)$ satisfies $|m(t)-m(s)|\le |\Omega ||t-s|$.

To justify finite energy before assuming it, clip this reconstruction to $v_M\in [-M,M]$. Comparison with the empty set gives $\alpha \mathrm{Per}(E_t;\Omega )\le {\int }_{\Omega }|t-f|$ uniformly on a bounded interval of levels. Since $v_M=-M+{\int }_{-M}^M{\chi }_{E_t}dt$, pairing with compactly supported test-field divergences bounds its total variation seminorm by ${\int }_{-M}^M\mathrm{Per}(E_t;\Omega )dt<\infty$. Thus $v_M$ belongs to the BV space before applying the coarea formula for BV functions. The layer-cake argument on the finite interval $[-M,M]$ shows $J(v_M)\le J(T_{M}w)$ for every finite-energy competitor $w$, where $T_M$ is clipping. In particular $w=0$ bounds the $L^2$ norms and variations uniformly. Fatou's lemma excludes infinite values of $v$ on a positive-measure set. Bounded-variation compactness and weak convergence in $L^2$ identify an admissible limit $v$. For any fixed competitor, $T_{M}w\to w$ in $L^2$ and its variation tends to that of $w$, by bounded-variation contraction under clipping and sequential lower semicontinuity. Thus $J(v)\le J(w)$.

The quadratic fidelity is strictly convex, so every ROF minimizer equals $v$ almost everywhere and has the selected minimizing superlevel sets. Conversely, for any $u$ whose levels minimize $F_t$, integrate the levelwise inequality against any competitor's levels in the displayed identity to obtain $J(u)\le J(w)$. This proves both directions for signed as well as nonnegative data.

Assume $g\in L^2(\Omega )$, as required for the finite-valued data fidelity; extend the total variation seminorm on a domain by $+\infty$ outside $BV(\Omega )$. The zero function is a finite-energy competitor. A minimizing sequence $f_n$ has bounded $\Vert f_n-g{\Vert }_2$ and bounded variation, hence bounded $L^2$ norm. Take a weakly convergent subsequence in $L^2$, with limit $f$. For each fixed test vector field $\zeta$, the pairing $\int f\mathrm{div}\zeta$ is weakly continuous because $\mathrm{div}\zeta \in L^2$. 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 $BV\cap L^2$.

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 $T(t)=\min (b,\max (a,t))$. The bounded-variation contraction under clipping gives $|D(T\circ f)|(\Omega )\le |Df|(\Omega )$. If $g(x)\in [a,b]$, then $|T(f(x))-g(x)|\le |f(x)-g(x)|$, strictly whenever $f(x)\notin [a,b]$. A positive-measure set outside the interval would therefore strictly decrease the fidelity integral, while not increasing variation, contradicting minimality. HenceNo compactness theorem for the $BV$ embedding is required for this weak-$L^2$ argument.

For $g\in L^2$ on a bounded domain, total variation denoising has a unique minimizer. A bounded minimizing sequence has a weakly convergent $L^2$ 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.