Let be the convex hull of all terms of the sequence, meaning the set of their finite convex combinations. Suppose . Part (ii) then gives a continuous linear functional with for every . In particular for every , contradicting . Therefore the ball meets .
A point of that intersection is a finite combination with nonnegative coefficients summing to one. Set , combine repeated indices and insert zero coefficients for omitted indices. This gives
Thus zero lies in the norm closure of the convex hull. The same argument applies to every tail of the sequence and, by choosing errors tending to zero, also gives the usual Mazur lemma. Completeness of is not required for this conclusion.
The hypothesis needed is precisely convergence to zero against every continuous linear functional, namely weak convergence. The PDF says only “continuous” for the testing maps. If that is interpreted as including arbitrary nonlinear continuous maps, the constant map makes the hypothesis impossible. The proof above establishes the substantive conclusion under the intended, weaker linear-testing hypothesis, and therefore also the implication under the literal stronger wording.
If and , then because is bounded and linear. Therefore , proving weak continuity of .
For a bounded sequence in , extract successive subsequences on which the first, second, and subsequent coordinates converge, then take a diagonal subsequence. Call the coordinate limits . Every finite partial sum satisfies , so and . For any , the pairing on its first coordinates converges, while the pairing on the tail is bounded uniformly by . First choose large, then take the subsequence limit. The Riesz representation theorem identifies these pairings with every continuous linear functional, proving the requested weak convergence.
For , norm convergence implies weak convergence immediately. Conversely, suppose but a subsequence has . Coordinate convergence to zero allows us to select indices and cutoffs such that the mass of before or at is below , and its mass after is below . Its mass on the intervening block is then at least . On that block set when nonzero and zero otherwise. These prescriptions define . The bounded linear functional has real part at least on every selected , contradicting weak convergence. Translating by the limit proves weak and norm convergence of sequences coincide in , the Schur property.
A compact operator sends bounded sets to relatively norm-compact sets. Every bounded sequence in has a weakly convergent subsequence by the argument above, after scaling into the unit ball. Its image under converges weakly and therefore in norm by the Schur property. Sequential compactness in a metric space gives relative compactness of the image of the unit ball. Every bounded linear operator from to is compact.
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.
Suppose in . Then in . Since is a differentiable convex function, its supporting inequality is
Take , and integrate. Part (i) shows that every energy is finite and that the fixed field belongs to , so
The last integral tends to zero by the definition of weak convergence in . Therefore
This is weak lower semicontinuity of convex gradient energies. It uses a fixed supporting gradient at the limit; weak convergence alone would not justify passing pointwise through the nonlinear integrand.
Assume the bounded set is measurable, as needed to define its indicator in . Put and choose a smooth cutoff function of compact support equal to one near . Weak convergence in the H1 space gives a uniform bound, by the Uniform boundedness principle, and therefore is uniformly bounded in with fixed compact support.
Here is a direct Fourier proof of the local compactness in the Rellich-Kondrachov compactness theorem. For each frequency , , since integrating against the fixed compactly supported function is a continuous linear functional on . Also uniformly, by Cauchy-Schwarz inequality on the fixed support. The dominated convergence theorem gives, for every fixed ,
The uniform derivative bound and the unitary Plancherel theorem control high frequencies:
First let , then . This proves , and hence .
Let . The Sobolev embedding theorem bounds uniformly. For , choose with . Interpolation of Lp norms gives . For , Holder inequality on the fixed finite-measure support gives the same conclusion from convergence. Thus
The same integral estimate covers if those spaces are interpreted with their usual quasi-norm. No conclusion at the critical exponent is asserted.
As usual, the bounded set is assumed Lebesgue measurable and an exponent is positive; the conventional Banach-space assertion concerns . No boundary regularity of is needed. Choose a smooth compactly supported cutoff equal to one on a ball containing . Weak convergence and the Uniform boundedness principle give a common bound for , hence also for . These functions have a common compact support.
We prove their local compactness directly. Translation and the fundamental theorem along line segments give, by density from smooth functions,
For a compactly supported mollifier , integration of this estimate gives
At fixed , Hölder's inequality bounds and uniformly by the norm of the corresponding smoothing kernels. Their supports lie in one fixed compact set, so the Arzelà-Ascoli theorem makes this smoothed family precompact in . The uniform approximation makes the original family totally bounded in : choose a finite net for the smoothed family and add the approximation error. Completeness gives relative compactness.
Every strongly convergent subsequence of has limit , since multiplication by preserves weak convergence. Consequently the whole sequence converges strongly: otherwise a subsequence with distance at least a fixed positive number would have a further convergent subsequence and contradict that unique limit. In particular .
The critical Sobolev inequality supplies a uniform bound in . For clarity, this estimate follows from part 2(a), not from compactness at the critical exponent. For a compactly supported smooth , integrating by parts against the vector field gives
Its distributional divergence is the sphere-area multiple of a point mass; applying the Hardy–Littlewood–Sobolev inequality with yields . Density extends this to .
For choose with . Hölder's inequality gives
For , use . The same integral estimate also works for if is understood with its usual quasi-norm. Thus strongly for every positive . We have never asserted that multiplying by the possibly nonsmooth indicator preserves .
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.
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.
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.