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.
A rigorous Mumford–Shah functional permits nonsmooth image signals and free discontinuities. One classical admissible class consists of relatively closed countably rectifiable sets with finite Hausdorff measure , and with finite energy. No exterior boundary values are prescribed. For an existence argument, use the equivalent relaxed class
A special bounded-variation space excludes the Cantor part of a bounded-variation derivative of the derivative: . The jump set of a bounded-variation function is the relaxed image edge set. Clipping to decreases squared fidelity, does not increase the gradient term, and does not create jumps, so this bound loses no minimizers.
Take a minimizing sequence and compare with a constant image signal. Its gradient norms and jump lengths are bounded. Also
so the sequence is bounded in . The SBV compactness theorem for bounded values, superlinear gradient growth and bounded jump measure yields an limit in , weak convergence of gradients in , and lower semicontinuity of both the Dirichlet term and the jump measure. The uniform value bound upgrades convergence to , so fidelity converges. This proves existence of a relaxed minimizer. Essential closedness of Mumford–Shah jump sets then supplies a relatively closed representative , without added length, and . This completes the outline for the classical pair problem. Arbitrary Hausdorff convergence of image edge sets alone is not an adequate substitute for these compactness and regularity results. No uniqueness is claimed for segmentation.
As with fixed, bounded energy forces in . The reduced piecewise-constant Mumford–Shah problem is
Equivalently, use a Caccioppoli partition of the image signal domain and constants :
The relative perimeter counts only interior boundaries, and the factor one half counts each interface once. Adjacent equal-valued regions can be merged, removing unnecessary boundaries.
For fixed , let be its positive-area regions. Minimization over reduces to independent scalar least-squares fits:
The minimized fidelity is . Thus region means in piecewise-constant segmentation give the optimal grey values for a fixed segmentation.
For a fixed full spatial function , the image edge set must contain its jumps; any extra curve only adds length. The optimal choice is its essential jump set, with a relatively closed representative when appropriate. There is no independent relocation of boundaries while that full function is held fixed. A different common alternating step fixes the values but allows the labels to move. It minimizes the fidelity-plus-perimeter partition functional above. Without the perimeter term each point takes its nearest grey value; with it, interface length is penalized. At a smooth interface between two labels, outward normal displacement of has first variation
where is positive for an outward normal to a circle. The stationary segmentation interface curvature balance is
This is the geometric interpretation of optimizing boundaries with fixed grey levels, and distinguishes it from fixing the whole spatial image signal.
As with fixed, a constant competitor bounds the minimum independently of , forcing . compactness in the relaxed formulation leaves no jump or Cantor part of a bounded-variation derivative, so the limit is in on the connected rectangle. The reduced edge-free Mumford–Shah limit is
A set of zero length can be omitted; this does not impose a zero image signal or a Dirichlet boundary value. Comparison with any fixed competitor and lower semicontinuity justify the limit minimization.
For completeness, the bilinear form on is continuous and coercive, with . The right-hand side is bounded because on the bounded rectangle. The Lax-Milgram theorem gives a unique satisfying
It is the unique minimizer by strict convexity. Formally,
with the Neumann condition understood through this weak formulation. Equivalently, subtracting the weak equation shows that the energy increase at is for nonzero .
Use the corrected essential spectrum of a bounded self-adjoint operator and put . Essential spectral points are real. If is infinite-dimensional, choose an orthonormal sequence in the kernel. It converges weakly to zero by the Bessel inequality, and its residuals vanish.
If is finite-dimensional, membership in the essential spectrum means the range is not closed. Choose unit with , using the closed-range bound on the kernel complement. A bounded Hilbert space sequence has a weakly convergent subsequence. Its weak limit satisfies because bounded operators preserve weak convergence, and ; hence . This subsequence is a singular Weyl sequence.
Conversely a singular Weyl sequence first places in the spectrum of a bounded operator. If it were not essential, the sequential properness for a self-adjoint operator equivalence for would yield a norm-convergent subsequence. Its weak limit is zero, whereas norm convergence of unit vectors gives a unit norm limit, a contradiction. Therefore
For nonreal , the resolvent lower bound excludes such a sequence, so the equivalence covers all .
Weak convergence means that for every bounded continuous real function on ; it is a statement about their distributions, not their coupling.
The central limit theorem says that for independent identically distributed real variables of finite mean and variance , . For this is equivalent to convergence of to the standard normal distribution. For , every variable equals almost surely and the limit is the point mass at zero.
For the proof when , put . Its characteristic function has expansion . To justify this using only a second moment, subtract the first two Taylor terms of and use dominated convergence theorem, with the second-order remainder bounded by a constant times . Independence gives the characteristic function of the normalized sum as . The Lévy continuity theorem says that pointwise convergence of characteristic functions to a characteristic function continuous at zero implies weak convergence. Since is the characteristic function of , the result follows.
For each , evaluation is a bounded linear functional of norm one. Thus weak convergence to zero gives at every . The set is a weakly bounded set, since every scalar sequence converges, and part (a) supplies a uniform bound .
The constant is integrable for Lebesgue measure on . Applying the dominated convergence theorem to gives the weakly null continuous functions converge in L1 conclusion
Pointwise convergence alone would not provide the needed uniform dominating function; it is the weak boundedness argument that supplies it.
In an infinite-dimensional Hilbert space, every bounded sequence has a weakly convergent subsequence, but it need not have a norm-convergent one. For example an orthonormal sequence has pairwise distance and therefore no strongly convergent subsequence, although by Bessel inequality.
More generally, weak sequential compactness of bounded sequences in a reflexive Banach space ensures a weakly convergent subsequence with its limit in that space. Conversely, this property for all bounded sequences characterizes reflexivity, using the Eberlein-Šmulian theorem and weak compactness of the closed unit ball. Thus reflexivity replaces finite-dimensional norm compactness by weak sequential compactness.
In a nonreflexive Banach space there is no such general weak-subsequence guarantee. The coordinate unit vectors in give an example: by the Schur property, weak convergence would imply norm convergence, impossible for their pairwise distance two. Banach-Alaoglu theorem supplies weak-star compactness of a dual unit ball, which gives convergent subnets, not automatically convergent subsequences. For a separable predual, the weak-star compact dual ball is metrizable and subsequences do suffice. For an arbitrary Banach space one can also regard a bounded sequence in its bidual and extract a weak-star convergent subnet there; the limit need not belong to the original space. These qualifications distinguish weak from weak-star compactness.
Use the standard inverse-problem setting of a bounded linear and exact data having a finite-penalty solution. Let denote the unique -minimizing exact solution for , . This is the limiting target of elastic net regularization in Hilbert sequence space; it need not be the Moore–Penrose minimum-norm solution unless additional hypotheses identify them, for example injectivity of .
For each , the reconstruction objective is weakly lower semicontinuous, coercive by , and strictly convex. The direct method on the reflexive l2 sequence space gives existence, and strict convexity gives uniqueness. For two data sets, monotonicity of the one-norm subgradients and the quadratic penalty give, with and ,
Completing the square yields , so each reconstruction map is continuous.
Minimality against gives
Choose and , for example . This bounds the Hilbert norms, drives the data residual to zero and gives . Every weakly convergent subsequence has an exact solution as its limit, by boundedness of ; weak lower semicontinuity and uniqueness of the penalty minimizer identify that limit with . Separately applying weak lower semicontinuity to the one-norm gives
Weak convergence and convergence of Hilbert norms imply strong convergence by the Radon-Riesz theorem. This proves norm convergence of elastic net regularization:
The argument applies to every sequence of noise levels and admissible data, hence gives the usual uniform noise-ball convergence for a fixed admissible exact datum.
For nonlinearity of elastic net reconstruction, zero is the minimizer exactly when . This includes a neighborhood of zero. If , choose with and for ; zero then fails its optimality condition. A linear map vanishing on a neighborhood would vanish everywhere, so the elastic-net reconstruction is nonlinear whenever . For the explicit formula is , exhibiting soft thresholding.
A concrete distinction from Moore–Penrose convergence is (embedded in the first output coordinate of ), exact datum one, and . Its minimum-norm solution is , with penalty , while the unique penalty-minimizing exact solution is , with penalty . For the exact-data elastic-net reconstruction is , converging to the latter. Thus it is not a Moore–Penrose-consistent regularization for every noninjective operator under the earlier definition.
The PDF supplies neither a nonzero assumption on nor a target/domain qualification here. Its unconditional nonlinearity claim is false for , whose reconstruction is the zero linear map. The convergence proof above states the finite-penalty exact-solution hypotheses explicitly; it establishes convergence to the penalty-minimizing solution, not an automatically identical minimum-norm least-squares solution.
Let be conjugate to , so , including for . Hölder's inequality implies, for every measurable finite-measure set ,
This proves integrability on and gives uniform integrability there. Choose a set with on which convergence is uniform, using Egorov theorem. Then
First take and then . Thus even the local difference tends to zero, and in particular
For , simple functions supported on finite-measure Borel sets are dense in . The displayed convergence proves pairing convergence for such functions. Approximate any by a simple and use
By the duality of Lp spaces, these are all continuous linear functionals on , so converges weakly to . It need not converge strongly: converges pointwise to zero but has norm one. For the pairing argument gives weak-star convergence against , rather than asserting weak convergence against every functional in the much larger full dual.
For a Banach space , weak convergence means
For its continuous dual space , convergence in the weak-star topology means
Weak convergence on tests against all of , whereas weak-star convergence tests only against the canonical image of . Thus weak convergence always implies weak-star convergence. If is a reflexive Banach space, that image is all of , so the weak and weak-star topologies on coincide. Weak-star topology is defined relative to a chosen predual; it is not an extra intrinsic topology on an arbitrary Banach space without such an identification.
The Radon-Riesz property of a norm is the implication
In a Hilbert space, expand the square using its inner product:
Weak convergence gives , and convergence of norms gives . Hence the right side tends to zero. This proves the Hilbert-space Radon-Riesz theorem.
Weak convergence means for every . Weak-star convergence means for every , viewing as the predual. The Sequential Banach-Alaoglu theorem for a separable predual says that every norm-bounded sequence in has a weak-star convergent subsequence. Separability is what turns the bounded weak-star compactness statement into this sequential form.
For the weak-star limit of periodic rescalings, apply it with , which is separable, and . The rescaled functions have uniform essential-supremum bound . Let and . Since is one-periodic with zero mean, is a bounded one-periodic absolutely continuous primitive. Thus for every finite interval,
Every weak-star subsequential limit therefore satisfies for all . To apply the supplied uniqueness fact without assuming global integrability, fix and set . This is in , and its integral over any interval is zero, since intersecting with again gives an interval. Hence almost everywhere. Taking integer yields almost everywhere on the whole line.
Finally, if the full sequence did not converge weak-star to this constant, some and some subsequence would have its pairing with bounded away from zero. Sequential compactness gives a further weak-star convergent subsequence, whose limit must be the constant just identified, a contradiction. Therefore
This is averaging against integrable test functions, not a claim of pointwise or strong norm convergence.
For a coercive Neumann energy with a positive reaction term, let be the ellipticity constant and . Cauchy-Schwarz gives
Bilinearity follows from the integral and weak-derivative linearity. Ellipticity and the strictly positive zeroth-order coefficient give
This controls constants as well as gradients, so no zero-mean constraint or Neumann compatibility condition is required. Symmetry of the coefficients makes symmetric.
Write . This is a bounded linear functional on , with . Consequently
as the norm tends to infinity. The infimum is finite, and every minimizing sequence is bounded. The Hilbert space is reflexive, so a minimizing subsequence converges weakly to some .
To verify lower semicontinuity directly, put . Boundedness of makes under weak convergence, and symmetry gives
Also . Therefore , so the absolute minimum is attained.
For every the real function has a minimum at zero. Its derivative there is , yielding the required weak equation for every . If two weak solutions exist, their difference satisfies for all ; choose and use coercivity to obtain . In fact the weak equation also gives the exact energy identity
Thus the minimizer and weak solution are both unique. The natural boundary condition is encoded by testing in the whole space, without needing pointwise conormal derivatives for rough coefficients.
Weak convergence means for every bounded linear functional . Norm convergence implies this by . The converse fails for coordinate unit vectors in : their norms are one, but pairing with any square-summable sequence tends to zero, so they are weakly null.
For the subsequence assertion apply Gram-Schmidt process to a countable dense subset to choose a countable orthonormal basis of the separable Hilbert space and a bound for the sequence. Repeated subsequence selection and diagonalization make every coefficient converge to a scalar . Bessel inequality gives for every , so exists in with norm at most . Pairings with finite linear combinations of the basis converge. Approximating any other test vector by such combinations and using the common norm bound proves . The finite-dimensional case uses the same argument with a finite basis.
Apply this to every subsequence of the bounded sequence. Any weakly convergent further subsequence has limit with , since interval indicators are tests. The permitted fact gives almost everywhere. If the whole sequence failed to converge weakly to zero, some fixed test functional and subsequence would stay a positive distance from zero. Its weakly convergent further subsequence would then contradict the preceding conclusion. Thus the entire sequence converges weakly to zero in .
Bounded coefficients and Cauchy-Schwarz give . Uniform ellipticity gives because . Poincaré inequality holds on of a bounded domain, so
A weak solution is satisfying for every . The energy is finite by boundedness of and the forcing functional, and
It is bounded below and a minimizing sequence is bounded in the Hilbert space . Its closed linear span is separable, so part 1 supplies a weakly convergent subsequence with limit . Symmetry and nonnegativity of show
The forcing term converges by weak convergence. Thus , proving attainment. First variation in every zero-trace direction gives the weak equation. If are two solutions, test their difference equation with and use coercivity to get . Hence there is exactly one weak solution, and it is the unique energy minimizer. Indeed directly verifies the minimizing property.
A continuous embedding is an injective continuous linear inclusion, so for a fixed constant. On a finite-measure domain, Holder inequality gives
with . For finite apply Holder inequality to with exponents and ; equality of exponents is immediate, and follows by integrating the supremum bound.
Weak convergence means for every bounded linear functional . The Riemann-Lebesgue lemma says that the Fourier transform of an integrable function tends to zero at high frequency. Since , it makes weakly null in . Its absolute value is at most one, so . For a test ,
while by the Riemann-Lebesgue lemma applied to . Hence . Taking instead gives , so two weakly null factors need not have a weakly null product.
For and , Holder inequality gives
Thus in . In contrast, if had a weak limit , testing on every interval strictly away from zero would give integral zero for , hence almost everywhere by the permitted fact. Testing against the constant function one would give , a contradiction. Therefore has no weak limit.
Radon-Riesz property Created 2026-10-05 Updated 2026-10-14
A normed vector space has the Radon-Riesz property when weak convergence together with implies strong convergence . The Hilbert-space case is the Radon-Riesz theorem. The condition prevents norm from remaining in weakly invisible directions.
Schur property of l1 2026-10-03
The l-p sequence space has the Schur property. If a weakly null sequence stayed bounded below in norm, coordinatewise convergence and summability would select disjoint blocks containing almost all of successive terms. A sequence in matching their signs on those blocks would pair uniformly positively with a subsequence, contradicting weak convergence through the duality of l1 and l infinity.
A subset of a normed space is sequentially weakly closed when every weakly convergent sequence in has its limit in . Every weakly closed set has this property. For a convex set in a Banach space, it is equivalent to closure in the norm topology: Mazur lemma produces norm convergent convex combinations from any weakly convergent sequence, and conversely norm convergence implies weak convergence. For a Hilbert space, the weak Banach–Saks theorem in a Hilbert space supplies these convex combinations as subsequence averages. No equivalence with weak closedness is asserted here for arbitrary nonconvex sets.
Weak limit Created 2026-10-25 Updated 2026-10-31
The weak limit of a sequence in a normed vector space is an element at which every continuous linear functional has the limit of its values along the sequence. Thus the definition is precisely weak convergence to that element.
Weak convergence to zero gives pointwise convergence by the continuous evaluation functionals and uniform boundedness in the supremum norm by the weakly bounded set criterion. The dominated convergence theorem for Lebesgue measure then proves the displayed implication. The finite measure of the interval and uniform norm bound are the relevant hypotheses.