On a bounded Lipschitz domain, a sequence with bounded norms and bounded total variation seminorm has a subsequence converging strongly in . The limit is in the BV space, and its variation does not exceed the limit inferior. This supplies the compactness step of the direct method in the calculus of variations for linearly growing gradient energies.
Let be a bounded connected Lipschitz domain, , bounded, and bounded and positivity preserving with . Minimize over nonnegative BV space functions. The logarithmic Jensen inequality bounds and variation on sublevels; mean control for positive imaging operators then bounds the full norm. Bounded-variation compactness gives strong convergence, including nonnegativity. The scalar fidelity has bounded derivative on , so continuity of makes its integral continuous in that limit. Lower semicontinuity of variation proves existence by the direct method in the calculus of variations. If almost everywhere and is injective, strict convexity of the fidelity gives uniqueness. For , zero is the unique minimizer even without injectivity, since zero energy forces both and a constant nonnegative .
The required functional, with the sign appropriate to a positive divergence operator, is
It is differentiable on , with . A critical point consequently satisfies the weak equation. We now prove existence by the direct method in the calculus of variations, rather than invoke the representation theorem again.
The ellipticity and Poincare estimates imply
Thus the infimum is finite and any minimizing sequence is bounded in the Sobolev norm. A bounded sequence in a Hilbert space has a weakly convergent subsequence; write in . The equivalent norm has the same continuous linear functionals and hence the same weak convergence. A Hilbert norm is Weak lower semicontinuity, giving . The term converges to because it is a bounded linear functional. Therefore
The limit attains the infimum. Differentiating at its minimum, for every , gives . This produces the desired weak solution. Strict positivity of also makes the functional strictly convex, consistent with uniqueness.
Symmetry implies that all eigenvalues of lie between and , so . In particular the bilinear form from part (i) is bounded and symmetric under the printed assumptions. The symmetric elliptic Dirichlet energy with a nonpositive potential is
All its terms are finite. For an admissible variation , its first variation is . Thus stationarity is exactly the weak formulation of .
Here is the direct method in the calculus of variations. Put . Expanding the symmetric quadratic form gives
The Poincaré inequality controls by . Therefore is bounded below on the admissible class, and a minimizing sequence is bounded in . By weak compactness in this reflexive Banach space, a subsequence converges weakly to . The affine closed subspace is weakly closed, so remains admissible.
The symmetric square root is measurable and bounded. Since , the two bounded linear maps
take weak convergence to weak convergence. The weak lower semicontinuity of the Hilbert norm shows that is weakly lower semicontinuous. The term is weakly continuous. Hence and attains the minimum. Varying in either sign yields the weak equation.
The sign was used both to make the potential energy nonnegative, hence weakly lower semicontinuous by this argument, and to obtain coercivity. Finally for , since the first variation at vanishes. Therefore
The affine class is nonempty, and part (i) gives a finite comparison energy . Since , its energy infimum satisfies . Choose a minimizing sequence with . Then
The gradient bounds also control the full Sobolev norm. Indeed , so the Poincaré inequality gives
Thus is bounded in the Hilbert space . Its weak compactness yields a weakly convergent subsequence . The closed linear subspace is weakly closed, hence and . By part (ii),
The direct method in the calculus of variations therefore proves
Neither a smooth boundary nor a classical trace theorem is needed: the boundary condition is encoded by the closed zero-boundary Sobolev space.
Positivity means almost everywhere, since the real logarithm must belong to . A positivity-preserving operator gives . For fixed , the scalar shifted Poisson data fidelity is , with
Composition with the linear operator proves convexity in , 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 , controlling its negative part, while controls its positive part.
Because and , the Jensen inequality gives the requested bound:
The final equality uses nonnegativity and the unit area. Since , 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 and , implies . Also cannot vanish identically for a strictly positive . To see this, let . If , positivity and give . But in and continuity of would imply , contradicting the hypothesis. Thus every admissible has positive fidelity and hence positive total energy.
Conversely, the constants are admissible, have zero total variation, and satisfy
Their logarithms are integrable for each , but the limit is excluded. Therefore
A 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 with , omitting the unnecessary condition: the fidelity only contains , which is already integrable. Here is the full existence for nonnegative shifted Poisson regularization argument, also valid for any bounded nonnegative data . Let , , and take a minimizing sequence of energy at most . The displayed bound gives and . Write . The Poincaré inequality for total variation and mean control for positive imaging operators yield
The denominator is nonzero, so the full norm is bounded. Bounded-variation compactness gives in along a subsequence, with . Continuity gives in . On , , 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 , the corrected problem has the unique minimizer , even if is not injective. Zero attains energy zero. Any other zero-energy candidate would have both and ; on the connected square, zero variation makes a nonnegative constant, and forces that constant to vanish. For general positive bounded data, an injective 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 . Independent Poisson observations with these intensities have negative log-likelihood . Removing the constant 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 is a grey-value normalization, not a literal unscaled count sample.
An image segmentation separates an observed image signal into regions that are smooth within themselves and separated by meaningful image edges. Pure image smoothing blurs the very transitions that ought to define these regions. The Mumford–Shah segmentation model instead chooses the reconstruction and its discontinuity set together. For a bounded planar Lipschitz domain and bounded grey-value data , one standard normalization is
Here is the relatively closed edge set and can have different traces on its two sides. The first term is quadratic fidelity, the second penalizes variation within regions, and the Hausdorff measure term charges total edge length. It balances fitting, denoising and economical region geometry. The model was developed by David Mumford and Jayant Shah; their 1989 paper formulates this joint variational approach.
All three terms matter. Without fidelity, a constant reconstruction with no edge has zero energy. Without the gradient term, smooth data can be fitted exactly with no edge penalty. Without the length term, fine partitions with nearly constant region means can drive fidelity arbitrarily low while creating excessive boundaries. This is segmentation overfitting without an edge penalty. Increasing favors flatter regions; increasing makes extra boundaries more expensive and can remove small features. These parameter effects describe a balance, not a guaranteed monotone evolution of every individual boundary.
For fixed , varying gives the fixed-edge Euler-Lagrange equation for Mumford–Shah:
The boundary condition is a separate one-sided Neumann boundary condition on each side of an edge, not continuity of across it. The fidelity makes this fixed-edge problem strictly convex, so its weak solution is unique by the Lax-Milgram theorem. Optimizing the edge set remains a different geometric problem. The nonconvexity of Mumford–Shah segmentation prevents a general uniqueness assertion or a guarantee that a numerical stationary point is globally optimal.
The piecewise-constant Mumford–Shah problem imposes on regions . It minimizes
The factor counts each shared internal boundary once. The region means in piecewise-constant segmentation give , provided . Thus the remaining optimization concerns the partition. For a smooth interface between and , moving it in the normal pointing out of changes fidelity by per unit displacement, while length changes by its curvature . The resulting segmentation interface curvature balance is
With equal isotropic interface costs, three freely meeting smooth edges satisfy the triple-junction angle in isotropic segmentation: force balance of their unit tangents gives angles of degrees. These are local stationarity conditions on regular interfaces, not a description of every singular edge configuration.
A simple piecewise-constant segmentation contrast threshold explains why small objects can disappear. On a domain of area , suppose two constant intensities differ by , occupying areas and with internal boundary length . Keeping that boundary fits the data exactly and costs . Merging both regions costs the within-region squared error . Among these two candidates, splitting wins precisely when . Other partitions may beat either candidate, so this is not a universal global segmentation formula.
Figure 1.
One-region and two-region reconstructions balance contrast fitting against interface length
. Details.
This original synthetic example compares those two candidate geometries using their least-squares means. It illustrates the edge cost; it does not claim to compute the globally optimal Mumford–Shah segmentation.
Existence is cleanly stated in the relaxed SBV space formulation:
where is the jump set of a bounded-variation function and the Cantor part of a bounded-variation derivative is absent. Clip a minimizing sequence to the bounded data range: this cannot increase fidelity, gradient energy or jump length. Its values are uniformly bounded, its gradients bounded in , and its jump lengths bounded. The SBV compactness theorem supplies an -convergent subsequence staying in the special class; bounded values also give strong convergence. The fidelity then converges, while gradient energy and jump length are lower semicontinuous. The direct method in the calculus of variations produces a minimizer. The essential closedness of Mumford–Shah jump sets is the additional regularity result connecting this relaxed minimizer to a closed-edge formulation; existence in alone does not assert that every edge set is smooth.
A practical continuous approximation is the Ambrosio–Tortorelli approximation, introduced in Ambrosio and Tortorelli's 1990 paper. An auxiliary field is near one in regions and near zero at edges. One normalized energy is
The edge field weakens smoothing across a narrow transition, and its own energy approximates interface length. The Gamma-convergence result, together with the required compactness, relates global minimizing sequences to the limiting segmentation energy; it does not make the finite-parameter problem jointly convex. Alternating the two fields solves quadratic elliptic subproblems, but initialization and stopping can affect which local stationary configuration is found. The strengths of the model are joint denoising and segmentation, sharp transitions and a geometric cost. Limitations include competing local minima, sensitivity to scale parameters, loss of fine texture, and boundaries driven by intensity rather than semantic object identity.
Apply the direct method in the calculus of variations to . Since , take a minimizing sequence with . Then
Thus the sequence is bounded in the bounded-variation space. The bounded-variation compactness gives a subsequence converging in the strong convergence sense in to . Boundedness of the linear operator gives strongly in , so the residual norm converges. The variation term is sequentially lower semicontinuous, hence
Therefore attains the infimum. The useful inverse hypothesis is the lower bound ; a bounded inverse on the range already suffices for this proof. No uniqueness follows from the nonsquared fidelity.
A one-dimensional Sobolev representative is absolutely continuous. For , the fundamental theorem of calculus and Holder inequality give
Thus has a representative in . 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 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 , Morrey's inequality additionally gives a globally Hölder continuous representative of exponent . For , global continuity need not hold. For example, with a smooth cutoff around an interior point, lies in when , but is unbounded. At , the cutoff version of is unbounded while its gradient has finite squared integral, since
These examples distinguish Sobolev slicing and planar continuity from a false two-dimensional application of the interval exponent.
Put . A BV space is a function whose distributional derivative is a finite vector-valued Radon measure. Equivalently its total variation seminorm is finite:
The BV space has norm . For , integration by parts against the compactly supported field gives . Conversely the measurable choice on nonzero gradients attains the pointwise bound. Approximating this bounded field by smooth fields, using interior cutoffs and the finite measure , justifies the supremum and gives
It 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 and are independent. Hence its stated supremum, denoted , separates as
The scalar supremum is , by cutoffs approaching one, and the vector supremum is the variation. For an affine image signal with , this gives , whereas the displayed square-root area would give . The intended relaxed graph-area functional instead uses the coupled pointwise constraint , giving
where is the singular part of . Both readings have a minimizer, but their equations are different.
Here is the direct method in the calculus of variations for either reading. Let be the literal or the corrected , and define the energy on , assigning infinity elsewhere. A minimizing sequence has bounded energy by comparison with . Both , so its variation is bounded, and the fidelity bounds , hence also and . By bounded-variation compactness, a subsequence converges strongly in to , and after another subsequence almost everywhere. Fatou's lemma proves
The regularizer is a supremum of affine functionals continuous in , 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 .
For the intended graph area, conditionally assume that the minimizer is in . For , differentiate at . The derivative of the integrand is bounded by , so dominated convergence applies. The weak equation is
that 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 drops out and one obtains total variation denoising. Its total variation calibration form is
The distributional equation means . In particular wherever the gradient is nonzero; writing this quotient without handling zero gradients would be incomplete. Formally the one-sided derivative of is
Minimality in the directions and 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 and the displayed weak equation. Thus the literal definition has a nonsmooth subgradient equation, not the square-root equation above.
Work with real-valued functions. The screened sine-Gordon energy is well defined: , and is integrable by the Cauchy-Schwarz inequality. It is coercive, because
A minimizing sequence is bounded in the Hilbert space . Weak sequential compactness of bounded sequences in a reflexive Banach space supplies a weakly convergent subsequence. The squared H1 space norm is weakly lower semicontinuous, the source pairing is weakly continuous, and the nonlinear term is covered by local Sobolev compactness gives lower semicontinuity of a nonnegative integral. The direct method in the calculus of variations therefore gives a minimizer .
Taking its first variation in any gives
Thus the Euler-Lagrange equation is
as a weak solution, equivalently in distributions when tested against smooth compactly supported functions. The derivative of the nonlinear term is justified by and the second-order remainder bound .
Now , so the supplied elliptic regularity estimate puts in . Applying the Sobolev inequality to and each first weak derivative gives . Morrey's inequality and uniformly continuous integrable functions vanish at infinity prove that its continuous representative tends to zero.
The final printed supremum estimate is false in general. The maximum bound for a monotone reaction term involves , which is odd and strictly increasing: , and its zeros are isolated. If , a positive maximum of satisfies ; apply the same argument to . The valid general estimate is
The bound by is valid if , but can be smaller than for larger positive .
For an explicit failure of the source-size bound for the screened sine-Gordon equation, take , , and . These are smooth functions in the required spaces. With ,
Hence . Moreover has , so the energy is convex and this critical point is a minimizer. The example therefore satisfies even the minimizing and hypotheses of the printed claim.
To prove this, properness makes . First rule out : a sequence with eventually lies in a fixed sublevel set, which is bounded by coercivity. A -convergent subsequence would then have a limit with , contradicting the codomain. Hence is finite.
Choose a minimizing sequence with . It eventually belongs to the bounded sublevel set . Extract . By sequential lower semicontinuity,
Thus . In particular, a reflexive Banach space with the weak topology supplies the required subsequence property by weak sequential compactness of bounded sequences in a reflexive Banach space. A strictly convex function has at most one minimizer; this is an additional property, not part of the existence theorem.
Take the weak topology on the reflexive Banach space . A bounded linear operator is weak-to-weak continuous: implies for every , by its adjoint operator. The weak lower semicontinuity of the Hilbert norm therefore makes weakly sequentially lower semicontinuous.
This functional is finite everywhere and nonnegative. If it has coercivity, the direct method in the calculus of variations supplies a global minimizer . Squaring the residual does not change its global minimizers. Here the adjoint operator has codomain , since the source is a Banach space. Differentiating the squared residual along every real direction gives in the dual pairing, hence the normal equation for a linear inverse problem . Hence
The converse fails. For , , and , the datum is in the operator range, but while . Thus admissible data do not imply coercivity of the residual; an unpenalized null space already prevents it.
The Iterated Tikhonov regularization update is the proximal operator step
The objective has coercivity and is weakly sequentially lower semicontinuous and strongly convex, so the direct method in the calculus of variations and uniqueness of a minimizer of a strictly convex function give existence and uniqueness. Its gradient equation is
which is exactly . The second term penalizes the change from the previous iterate, rather than the norm of relative to zero.
First interpret the stated well-definedness as including uniqueness of the global minimizer for each positive parameter. Under that assumption, the parameter continuity of variational regularization follows from the direct method in the calculus of variations argument below.
Let . For large , . Comparison with zero, using , gives
Coercivity of therefore bounds the sequence. Take a -convergent subsequence with limit . For any , optimality gives
The last two terms vanish. Sequential lower semicontinuity at the fixed parameter implies . Thus every cluster point is a global minimizer at . Uniqueness makes it , and the subsequence property proves
Indeed, a subsequence staying outside a neighborhood of would have a further convergent subsequence, whose limit must be , a contradiction.
The listed existence hypotheses alone do not imply uniqueness or convergence of an arbitrary selection. For example, on , set , , and
This is nonnegative, convex, continuous and has ; every has coercivity. Its minimizers are for all . Along , selecting prevents convergence. Without uniqueness, the valid conclusion is that every cluster point minimizes the limiting objective.
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.
Take a minimizing sequence in the affine Sobolev class . The standing bounds make the energy uniformly equivalent to
The fixed boundary values and the Poincaré inequality therefore bound the sequence in . By weak compactness in a reflexive Banach space, a subsequence converges weakly to . The assumed weak closedness keeps the limit in , and the assumed weak lower semicontinuity gives
Thus the direct method in the calculus of variations produces a minimizer. Its first variation vanishes in every compactly supported direction, so part (b) makes it a weak solution of the system.
The boundary data are encoded by the Affine Sobolev space
A function is a weak solution of the homogeneous p-Laplacian equation when
For existence, take a minimizing sequence for the p-energy on . The Poincaré inequality bounds in by its gradient, so the sequence is bounded in the reflexive Banach space . A weakly convergent subsequence remains in the weakly closed affine space, and convexity of gives weak lower semicontinuity. The direct method in the calculus of variations therefore produces a minimizer, whose first variation is precisely the displayed weak equation.
Take a minimizing sequence for the variational regularization functional
Its coercivity makes the sequence bounded. Since is a reflexive Banach space, a subsequence converges weakly to some . A convex norm-lower-semicontinuous functional has weak lower semicontinuity, so this applies to both and the convex continuous map . Therefore
and is a minimizer. This is the direct method in the calculus of variations.
A minimizing sequence in is uniformly bounded and equi-Lipschitz. The Arzelà-Ascoli theorem gives a uniformly convergent subsequence with limit having the same boundary data and Lipschitz constant at most . Its gradients have a weak-star convergent subsequence in , with limit . Convexity of makes the integral functional weak-star lower semicontinuous, so
Thus attains the infimum by the direct method in the calculus of variations.
Screened sine-Gordon energy Created 2026-10-06 Updated 2026-10-14
For real , this energy functional on is coercive and attains its minimum by the direct method in the calculus of variations. The nonnegative potential term is weakly lower semicontinuous by local Sobolev compactness gives lower semicontinuity of a nonnegative integral. Its Euler-Lagrange equation is in the weak solution sense. The extra linear restoring term screens the Sine-Gordon equation nonlinearity. The scalar potential is convex because ; hence any weak critical point is a minimizer. The elliptic regularity estimate for , together with , gives . The Sobolev inequality then puts in , so Morrey's inequality and uniformly continuous integrable functions vanish at infinity give a continuous representative tending to zero.