Approximation property of an infimum 2026-10-14
Let be nonempty and bounded below. A lower bound equals exactly when every admits with . Otherwise would be a larger lower bound. Taking tolerances gives a sequence of members converging to . For a real-valued objective with finite infimum, this supplies a minimizing sequence without assuming that a global minimizer exists.
For , a nonempty closed convex set in an Lp space has exactly one nearest point to every . A minimizing sequence is a Cauchy sequence: the Clarkson inequality bounds by , where is the infimum of the distances. Completeness of Lp spaces and the closed set property give a limit in . Applying the same inequality to two minimizers proves uniqueness. Nonemptiness is essential.
Infimum and supremum Created 2026-10-14 Updated 2026-10-18
For a subset of a partially ordered set, its infimum is its greatest lower bound and its supremum is its least upper bound. An upper bound only has to lie above every member; the supremum is the smallest such bound. A lower bound lies below every member; the infimum is the largest such bound. These definitions identify the exact edges of a set even when neither edge belongs to it.
For example, and both have infimum zero and supremum one. Only has a minimum and a maximum: those must be actual members of the set. The set has infimum zero without a minimum, but its supremum one is also its maximum. Such examples distinguish a bound from an attained extremal value. [ref].
For a nonempty subset of the real numbers, completeness of the real numbers guarantees a real supremum when it is bounded above, and a real infimum when it is bounded below. The bound and the ambient partially ordered set both matter: has supremum in the real numbers, but no supremum in the rational numbers. The detailed explanation belongs to completeness of the real numbers.
Why are unattained bounds useful? They specify a precise limiting target. In mathematical optimization, on has infimum zero but no global minimizer. The inputs for give a minimizing sequence: their objective values approach zero without ever reaching it. Bounds therefore describe what approximation can achieve even when no feasible input is best. The approximation property of an infimum and approximation property of a supremum express this idea quantitatively.
Minimizing sequence Created 2026-10-05 Updated 2026-10-06
A minimizing sequence satisfies . Coercivity bounds an appropriate sublevel set, Compactness supplies a convergent subsequence, and sequential lower semicontinuity turns its limit into a global minimizer.
Let be a nonempty norm-closed convex set in a real Hilbert space, and let be continuous and a convex function. If is bounded, or as tends to infinity in norm, then attains its infimum. Every sublevel set is bounded, norm-closed, and convex, hence contains the weak limits of its sequences by norm-closed convex set is weakly closed. A minimizing sequence in one fixed sublevel set has a weakly convergent subsequence by weak sequential compactness in a Hilbert space. Its limit lies in every sublevel set above the infimum. Since is real-valued, this also rules out infimum and proves attainment. This is an instance of the direct method in the calculus of variations.
We prove existence by the direct method in the calculus of variations, making the step with weakly compact sets explicit. For and , introduce the functionalIt is finite by part (b)(i). Hölder's inequality and the Sobolev embedding theorem giveThus is a coercive function, bounded below, and every minimizing sequence is bounded in .
The space is a reflexive Banach space: it is isomorphic to a closed linear subspace of the finite product of the reflexive spaces recording the function and its weak derivatives. A bounded sequence in a reflexive Banach space has a weakly convergent subsequence. Hence, after passing to a subsequence, a minimizing sequence satisfies in . The continuous linear maps into and into preserve weak convergence, soThe norm in any Banach space has weak lower semicontinuity, since it is the supremum of absolute values of bounded linear functionals of dual norm at most one, by the Hahn-Banach theorem. Therefore the two nonnegative norm powers in have weak lower semicontinuity. Also belongs to and is continuous for weak convergence. It follows thatFor any , the real function has a minimum at . Its derivative there isThis differentiation is justified directly by finite polynomial expansions: the fourth power of the Euclidean norm of and the eighth power of have integrable coefficients by Hölder's inequality. Thus , giving existence of a weak solution.
If are two weak solutions, testing the difference by and using part (b)(iii) givesHenceNo sign assumption on or on the weak solution is required.
Past exam of the functional analysis II course of the University of Oxford 2023 1 c Solution 2026-10-25
For each real , define the sublevel set . Continuity of and closure of make a closed set in ; the convex function inequality makes it a convex set. The preceding result therefore makes every a sequentially weakly closed set. Equivalently, has weak lower semicontinuity along sequences in .
Every is bounded. This is immediate if is bounded. Otherwise, an unbounded would contain with , contradicting the assumed coercive function condition .
Choose and put . Choose a minimizing sequence entirely in , with ; when , require for sufficiently large . It is bounded by the previous paragraph.
The weak subsequence of a bounded Hilbert-space sequence theorem gives . This applies even if is not separable: the closed linear span of the sequence is a separable Hilbert space; successive extraction makes every coefficient in a countable Hilbertian basis converge, the common norm bound gives square-summable limiting coefficients by the Bessel inequality, and approximation by finite linear combinations proves weak convergence. Orthogonal decomposition extends that conclusion to all test vectors in . Since is a sequentially weakly closed set, .
For any real , a tail of lies in , so . If , this would give for every real , impossible because is real-valued. Thus is finite; letting gives , while the definition of infimum gives the reverse inequality. ThereforeThis proves minimum of a coercive convex functional on a Hilbert space by the direct method in the calculus of variations, with bounded sublevel sets supplying the required weak sequential compactness in a Hilbert space.
Past exam of the mathematics course of the University of Cambridge 2006 iii Paper 42 4 iv Solution Created 2026-10-03 Updated 2026-10-20
For independent observations in a natural exponential family, the log likelihood isIn a minimal exponential family the observed Fisher information matrix is positive definite, so the log likelihood is strictly concave. Any finite solution of the likelihood equation is therefore the unique global maximum likelihood estimator. Existence is a separate issue: the observed sufficient-statistic mean must belong to the image of the mean parameter map .
For a full regular minimal natural exponential family this image is the interior of the convex support of an exponential family, . The necessity follows from a supporting hyperplane argument. If a finite parameter had its mean on a boundary face, some nonzero would satisfy almost surely and . Equality of the expectation forces almost surely. Exponential tilting preserves the base-measure null sets, so this contradicts minimality.
For sufficiency, let be an interior point of . Choose finitely many points of the support whose convex hull contains a ball about , say of radius . Such points exist because is interior to the closed convex hull; one may approximate the vertices of a small simplex surrounding it by finite convex combinations of support points. Take support neighbourhoods of radius at most with positive finite base-measure masses . These masses can be taken finite by restricting to bounded neighbourhoods and using finiteness of the normalizing integral at any fixed interior parameter. For every vector , at least one has . Integrating over that neighbourhood yieldsThus the negative log likelihood grows to infinity as . At a finite boundary point of the full open natural parameter space, the normalizing integral is infinite, since otherwise that point would itself belong to the full domain. Fatou's lemma makes diverge on approach to such a boundary. A minimizing sequence for therefore stays in a bounded subset away from the boundary; it has an interior limit where the minimum is attained. Its gradient vanishes, giving the required likelihood equation. Strict convexity gives uniqueness.
Hence, under these full, regular and minimal conventions,This is maximum likelihood existence in a full regular natural exponential family. Regularity alone does not make every sample admissible: in a Bernoulli distribution an all-zero or all-one sample has its sample mean on the boundary of , and the canonical maximum is approached only as or . The usual probability parameter then has a boundary maximum in an enlarged model, but no finite canonical maximizer. A regular restriction of the natural parameter space requires membership in its actual mean-map image, rather than merely in . Without minimality, affine redundancies may prevent uniqueness of the canonical parameter even when the fitted probability distribution is unique.
Past exam of the mathematics course of the University of Cambridge 2008 iii Paper 13 2 c Solution Created 2026-10-03 Updated 2026-10-14
The required functional, with the sign appropriate to a positive divergence operator, isIt 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 implyThus 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. ThereforeThe 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.
Past exam of the mathematics course of the University of Cambridge 2009 iii Paper 12 2 iii Solution Created 2026-10-03 Updated 2026-10-14
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 isAll 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 givesThe 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 mapstake 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
Past exam of the mathematics course of the University of Cambridge 2009 iii Paper 12 6 iii Solution Created 2026-10-03 Updated 2026-10-14
The affine class is nonempty, and part (i) gives a finite comparison energy . Since , its energy infimum satisfies . Choose a minimizing sequence with . ThenThe gradient bounds also control the full Sobolev norm. Indeed , so the Poincaré inequality givesThus 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 provesNeither a smooth boundary nor a classical trace theorem is needed: the boundary condition is encoded by the closed zero-boundary Sobolev space.
Past exam of the mathematics course of the University of Cambridge 2009 iii Paper 9 1 a Solution Created 2026-10-03 Updated 2026-10-14
The statement requires ; an empty set is closed and convex but contains no minimizer. Assume this necessary condition and put . Since is closed and , . Choose a minimizing sequence with .
The midpoint lies in the convex set . Applying the stated Clarkson inequality to and givesThe right side tends to zero, so is a Cauchy sequence. By completeness of Lp spaces, proved in Question 2(a), it converges to some . Closedness puts in , and continuity of the norm gives . This is the closest point theorem for a closed convex subset of Lp. The same inequality applied to two minimizers forces their difference to be zero, so the minimizer is also unique.
Past exam of the mathematics course of the University of Cambridge 2014 iii Paper 64 1 iii Solution Created 2026-10-03 Updated 2026-10-07
Apply the direct method in the calculus of variations to . Since , take a minimizing sequence with . ThenThus 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, henceTherefore 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.
Past exam of the mathematics course of the University of Cambridge 2014 iii Paper 64 2 ii Solution Created 2026-10-03 Updated 2026-10-07
For , define the set functionalThe 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 giveIndeed 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.
Past exam of the mathematics course of the University of Cambridge 2014 iii Paper 68 1 Solution Created 2026-10-03 Updated 2026-10-06
A one-dimensional Sobolev representative is absolutely continuous. For , the fundamental theorem of calculus and Holder inequality giveThus 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, sinceThese 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 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 and are independent. Hence its stated supremum, denoted , separates asThe 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 , givingwhere 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 provesThe 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 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 drops out and one obtains total variation denoising. Its total variation calibration form isThe 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 isMinimality 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.
Past exam of the mathematics course of the University of Cambridge 2014 iii Paper 68 3 Solution Created 2026-10-03 Updated 2026-10-06
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 classA 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. Alsoso 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 isEquivalently, 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 variationwhere is positive for an outward normal to a circle. The stationary segmentation interface curvature balance isThis 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 isA 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 satisfyingIt 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 .
Past exam of the mathematics course of the University of Cambridge 2018 iii Paper 326 1 1 2 d Solution Created 2026-10-03 Updated 2026-10-05
The direct method in the calculus of variations gives the following existence theorem. Suppose bounded sequences in the Banach space have -convergent subsequences, and is a proper extended-real function with coercivity and is -sequentially lower semicontinuous. Then has a finite-valued global minimizer.
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.
