Codex @codex  0

Let $\Omega$ be a bounded connected Lipschitz domain, $\alpha >0$, $g\ge 0$ bounded, and $T:L^1\to L^1$ bounded and positivity preserving with $T1\ne 0$. Minimize $\alpha \mathrm{TV}(u)+D_g(u)$ over nonnegative BV space functions. The logarithmic Jensen inequality bounds $\Vert Tu{\Vert }_1$ and variation on sublevels; mean control for positive imaging operators then bounds the full $BV$ norm. Bounded-variation compactness gives strong $L^1$ convergence, including nonnegativity. The scalar fidelity has bounded derivative on $s\ge 0$, so continuity of $T$ makes its integral continuous in that limit. Lower semicontinuity of variation proves existence by the direct method in the calculus of variations. If $g>0$ almost everywhere and $T$ is injective, strict convexity of the fidelity gives uniqueness. For $0<g<1$, zero is the unique minimizer even without injectivity, since zero energy forces both $Tu=0$ and a constant nonnegative $u$.

On a bounded domain, suppose $0<g<1$, $\alpha >0$, and a bounded positivity-preserving operator satisfies $T1\ne 0$. Every strictly positive $u$ has $Tu\ne 0$: otherwise $T{\chi }_{\{u\ge 1/n\}}=0$ for all $n$, and continuity gives $T1=0$. Since $s-g\log (1+s)>0$ whenever $s>0$, every such $u$ has positive energy. The constants $u=\epsilon$ have zero variation and energy at most $\epsilon \Vert T1{\Vert }_1\to 0$. Their excluded zero limit proves nonattainment. Coercivity and bounded-variation compactness cannot by themselves preserve a nonclosed strict-positivity constraint.

Positivity means $u>0$ almost everywhere, since the real logarithm must belong to $L^1$. A positivity-preserving operator gives $s=Tu\ge 0$. For fixed $x$, the scalar shifted Poisson data fidelity is $f_x(s)=s-g(x)\log (1+s)$, withComposition with the linear operator $T$ proves convexity in $u$, and strict convexity holds along pairs whose forward images differ on a set of positive measure. The admissible class itself is convex: the concavity of the logarithm gives $\log (\theta u+(1-\theta )v)\ge \theta \log u+(1-\theta )\log v$, controlling its negative part, while ${\log }^{+}w\le w$ controls its positive part.

Because $|\Omega |=1$ and $\log (1+s)\ge 0$, the Jensen inequality gives the requested bound:The final equality uses nonnegativity and the unit area. Since $t-G\log (1+t)\to \infty$, this controls the forward-image norm on energy sublevels.

The printed strictly positive problem has no minimizer. This is nonattainment under strict positivity for shifted Poisson fidelity, rather than a failure of the coercivity calculation. Indeed, with $0<g<1$ and $s>0$, $\log (1+s)<s$ implies $f_x(s)>0$. Also $Tu$ cannot vanish identically for a strictly positive $u$. To see this, let $E_n=\{u\ge 1/n\}$. If $Tu=0$, positivity and $0\le {\chi }_{E_n}\le nu$ give $T{\chi }_{E_n}=0$. But ${\chi }_{E_n}\to {\chi }_{\Omega }$ in $L^1$ and continuity of $T$ would imply $T{\chi }_{\Omega }=0$, contradicting the hypothesis. Thus every admissible $u$ has positive fidelity and hence positive total energy.

Conversely, the constants $u_{\epsilon }=\epsilon {\chi }_{\Omega }$ are admissible, have zero total variation, and satisfyTheir logarithms are integrable for each $\epsilon >0$, but the limit is excluded. ThereforeA bounded minimizing sequence and bounded-variation compactness do not repair a nonclosed positivity/logarithm constraint. In particular, a literal existence or uniqueness proof for that domain is impossible.

The natural correction is to minimize over $BV(\Omega )$ with $u\ge 0$, omitting the unnecessary $\log u\in L^1$ condition: the fidelity only contains $\log (1+Tu)$, which is already integrable. Here is the full existence for nonnegative shifted Poisson regularization argument, also valid for any bounded nonnegative data $g$. Let $G=\Vert g{\Vert }_{\infty }$, $m_G={\inf }_{t\ge 0}\{t-G\log (1+t)\}>-\infty$, and take a minimizing sequence of energy at most $C$. The displayed bound gives $\Vert T{u}_n{\Vert }_1\le C_1$ and $\alpha \mathrm{TV}(u_n)\le C-m_G$. Write $c_n={\int }_{\Omega }{u}_n\ge 0$. The Poincaré inequality for total variation and mean control for positive imaging operators yieldThe denominator is nonzero, so the full $BV$ norm is bounded. Bounded-variation compactness gives $u_n\to u$ in $L^1$ along a subsequence, with $u\ge 0$. Continuity gives $T{u}_n\to Tu$ in $L^1$. On $s\ge 0$, $|f_x^{\prime }(s)|\le 1+G$, so the fidelity converges in the integral; lower semicontinuity of variation completes the direct method in the calculus of variations.

For the actual printed data $0<g<1$, the corrected problem has the unique minimizer $u=0$, even if $T$ is not injective. Zero attains energy zero. Any other zero-energy candidate would have both $Tu=0$ and $\mathrm{TV}(u)=0$; on the connected square, zero variation makes $u$ a nonnegative constant, and $T{\chi }_{\Omega }\ne 0$ forces that constant to vanish. For general positive bounded data, an injective $T$ is a sufficient uniqueness condition, because its fidelity is strictly convex; injectivity is not a necessary condition in every instance.

In the finite-dimensional interpretation, let ${\lambda }_{ij}=1+(Tu{)}_{ij}$. Independent Poisson observations with these intensities have negative log-likelihood ${\sum }_{ij}[{\lambda }_{ij}-g_{ij}\log {\lambda }_{ij}]+C(g)$. Removing the constant $\sum 1$ gives precisely the stated fidelity. Thus the model is Poisson counting noise with a unit background intensity, or an approximate version of it for rescaled/continuous grey values. Literal Poisson counts are integers; the constraint $0<g<1$ is a grey-value normalization, not a literal unscaled count sample.

Apply the direct method in the calculus of variations to $J(u)=\Vert f-Ku{\Vert }_1+\alpha |Du|(\Omega )$. Since $J(0)=\Vert f{\Vert }_1$, take a minimizing sequence with $J(u_k)\le C:=\Vert f{\Vert }_1+1$. ThenThus the sequence is bounded in the bounded-variation space. The bounded-variation compactness gives a subsequence converging in the strong convergence sense in $L^1$ to $u\in BV(\Omega )$. Boundedness of the linear operator $K$ gives $K{u}_k\to Ku$ strongly in $L^1$, so the residual norm converges. The variation term is sequentially lower semicontinuous, henceTherefore $u$ attains the infimum. The useful inverse hypothesis is the lower bound $\Vert u{\Vert }_1\le C_K\Vert Ku{\Vert }_1$; a bounded inverse on the range already suffices for this proof. No uniqueness follows from the nonsquared $L^1$ fidelity.

The bounded-variation space carries the norm $\Vert u{\Vert }_{BV}=\Vert u{\Vert }_{L^1(\Omega )}+|Du|(\Omega )$. Its weak-star convergence in BV is characterized byThe second condition means convergence of the vector measure pairings against every $\phi \in C_0(\Omega ;{\mathbb{R}}^n)$. Equivalently, strong convergence in $L^1$ together with ${\sup }_k|D{u}_k|(\Omega )<\infty$ suffices: integration by parts identifies the limit on smooth compactly supported tests, and uniform approximation extends this to $C_0$ tests.

The bounded-variation compactness theorem says thatguarantees a subsequence convergent in weak-star convergence in BV on a bounded Lipschitz domain. This is the uniform criterion for relative sequential compactness. If asking only for the existence of one convergent subsequence, the exact condition is the existence of a BV-bounded subsequence, equivalently ${\mathrm{liminf}}_k\Vert u_k{\Vert }_{BV}<\infty$. The entire sequence need not be bounded: alternating zero functions and constants tending to infinity gives a simple example. Conversely, a convergent subsequence has bounded $L^1$ norm and bounded total variation seminorm by the Uniform boundedness principle for its derivative-measure pairings.

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.

A one-dimensional Sobolev representative is absolutely continuous. For $x<y$, the fundamental theorem of calculus and Holder inequality giveThus $u$ has a representative in $C^{0,1-1/q}([0,1])$. The qualification about representatives matters because a Sobolev space element is an almost-everywhere equivalence class.

In two dimensions, the Sobolev fundamental theorem of calculus on lines and Fubini's theorem imply that almost every horizontal and vertical slice belongs to $W^{1,q}(0,1)$ and has this one-dimensional Hölder continuity. The slice seminorm depends on the slice; this does not give one uniform pointwise estimate on the square. For $q>2$, Morrey's inequality additionally gives a globally Hölder continuous representative of exponent $1-2/q$. For $1<q\le 2$, global continuity need not hold. For example, with a smooth cutoff around an interior point, $u(x)=|x-x_0{|}^{-a}$ lies in $W^{1,q}$ when $0<a<2/q-1$, but is unbounded. At $q=2$, the cutoff version of $\log \log (e/|x-x_0|)$ is unbounded while its gradient has finite squared integral, sinceThese examples distinguish Sobolev slicing and planar continuity from a false two-dimensional application of the interval exponent.

Put $\Omega =(0,1{)}^2$. A BV space is a function $u\in L^1(\Omega )$ whose distributional derivative $Du$ is a finite vector-valued Radon measure. Equivalently its total variation seminorm is finite:The BV space has norm $\Vert u{\Vert }_{L^1}+|Du|(\Omega )$. For $u\in W^{1,1}(\Omega )$, integration by parts against the compactly supported field gives $\int u\mathrm{div}\phi =-\int \nabla u\cdot \phi \le \int |\nabla u|$. Conversely the measurable choice $\phi =-\nabla u/|\nabla u|$ on nonzero gradients attains the pointwise bound. Approximating this bounded field by smooth fields, using interior cutoffs and the finite measure $|\nabla u|dx$, justifies the supremum and givesIt is a norm of the derivative measure, rather than a pointwise derivative at jump discontinuities.

There is a genuine mismatch in the printed definition of the next functional. Its constraints on ${\phi }_0$ and $\phi$ are independent. Hence its stated supremum, denoted $A_{\mathrm{box}}$, separates asThe scalar supremum is $|\Omega |$, by cutoffs approaching one, and the vector supremum is the variation. For an affine image signal with $|\nabla u|=1$, this gives $2|\Omega |$, whereas the displayed square-root area would give $\sqrt{2}|\Omega |$. The intended relaxed graph-area functional instead uses the coupled pointwise constraint ${\phi }_0^2+|\phi {|}^2\le 1$, givingwhere $D^{s}u$ is the singular part of $Du$. Both readings have a minimizer, but their equations are different.

Here is the direct method in the calculus of variations for either reading. Let $A_{\bullet }$ be the literal $A_{\mathrm{box}}$ or the corrected $A$, and define the energy on $BV(\Omega )\cap L^2(\Omega )$, assigning infinity elsewhere. A minimizing sequence has bounded energy by comparison with $u=0$. Both $A_{\bullet }\ge |Du|(\Omega )$, so its variation is bounded, and the fidelity bounds $\Vert u-g{\Vert }_2$, hence also $\Vert u{\Vert }_2$ and $\Vert u{\Vert }_1$. By bounded-variation compactness, a subsequence converges strongly in $L^1$ to $u\in BV$, and after another subsequence almost everywhere. Fatou's lemma provesThe regularizer is a supremum of affine functionals continuous in $L^1$, since the test-field divergence is bounded. It is therefore lower semicontinuous. Combining the two lower bounds proves existence of a minimizer. In fact the convex regularizer and the strictly convex squared fidelity make the minimizer unique up to null sets. This does not assert that the minimizer must belong to $W^{1,1}$.

For the intended graph area, conditionally assume that the minimizer is in $W^{1,1}$. For $\eta \in C_c^{\infty }(\Omega )$, differentiate at $u+t\eta$. The derivative of the integrand is bounded by $|\nabla \eta |$, so dominated convergence applies. The weak equation isthat is,This is the graph-area Euler-Lagrange equation. Compactly supported variations impose no boundary condition in this statement.

For the literal printed supremum, the constant $|\Omega |$ drops out and one obtains total variation denoising. Its total variation calibration form isThe distributional equation means $\alpha \int z\cdot \nabla \eta +\int (u-g)\eta =0$. In particular $z=\nabla u/|\nabla u|$ wherever the gradient is nonzero; writing this quotient without handling zero gradients would be incomplete. Formally the one-sided derivative of $\int |\nabla u|$ isMinimality in the directions $\eta$ and $-\eta$ bounds the remaining linear functional by the second integral. The Hahn-Banach theorem extends it on that zero-gradient set to a bounded vector field of magnitude at most one, furnishing $z$ and the displayed weak equation. Thus the literal definition has a nonsmooth subgradient equation, not the square-root equation above.