Harmonic-measure asymptotic at infinity 2026-10-07
For a compact H-hull and a Borel subset of the intrinsic boundary of a simply connected domain, hydrodynamic normalization at infinity and the Poisson kernel for the upper half-plane give this limit as with . After multiplying the kernel by , it tends pointwise to one and is eventually uniformly bounded. Dominated convergence proves the finite-measure case and Fatou's lemma proves the infinite-measure case.
Past exam of the mathematics course of the University of Cambridge 2001 iii Paper 24 2 Solution Created 2026-10-03 Updated 2026-10-14
For a simple predictable process, define its stochastic integral byCommon refinement of the deterministic partitions makes this definition independent of the representation. Each summand is a martingale increment multiplied by information already available at its left endpoint, so the resulting process is a continuous square-integrable martingale starting at zero. Its terminal value is the same sum with replaced by .
Write . If , then is -measurable. By the conditional expectation identity for increments of a martingale,The conditional bracket isometry for stopped martingale increments givesFor completeness, this identity follows by applying the optional stopping theorem to and and expanding the square. The latter process is a true uniformly integrable martingale here: the Doob L2 maximal inequality bounds , stopped square identities and Fatou's lemma give , and its absolute supremum is bounded by . Consequently all the stopped identities pass to the limit.
Multiplying the conditional identity by , taking expectations, and using the vanished cross terms proves the Itô isometry:
To extend the stochastic integral, use the finite quadratic-variation measure on the predictable sigma-algebra. The density of simple predictable processes for finite measures gives approximations to every . The Itô isometry makes the corresponding terminal integrals Cauchy in , and the Doob L2 maximal inequality makes the whole processes Cauchy in expected squared supremum. Their limit defines a continuous martingale, and the isometry persists. For a locally bounded predictable process, choose increasing stopping times tending to infinity on which it is bounded, also restrict the time horizon, and perform this construction after stopping. The isometry shows that the stopped definitions agree on overlaps, so they patch into a uniquely defined continuous local martingale .
Past exam of the mathematics course of the University of Cambridge 2001 iii Paper 24 4 Solution Created 2026-10-03 Updated 2026-10-14
First stop the solution on leaving , at , and set . The stochastic integral representation, the Doob L2 maximal inequality and the Cauchy-Schwarz inequality give, for ,Here stopping ensures square integrability before the calculation, and explains the constant. The Gronwall inequality gives . For globally Lipschitz functions as coefficients, the global existence theorem for stochastic differential equations with Lipschitz coefficients supplies a nonexplosive solution. Letting increase and using Fatou's lemma proves the slightly stronger maximal second-moment bound under linear growth:
For coefficients that are only locally Lipschitz functions, let and replace the coefficients by and . These are globally Lipschitz functions, agree with the originals on , and obey the same linear growth condition for an SDE, since . The globally defined solutions agree until their common exits from by pathwise uniqueness. The uniform preceding estimate and Markov's inequality implyPatch the solutions before their increasing exit times. Their limiting lifetime exceeds almost surely by this bound. Thus a pathwise unique strong solution exists throughout even for locally Lipschitz coefficients.
Past exam of the mathematics course of the University of Cambridge 2002 iii Paper 27 6 a Solution Created 2026-10-03 Updated 2026-10-14
Write , where the angle brackets average only over walk paths, and use only for the environment. Every nearest-neighbor path of length has probability , so the finite path sum is exactly the walk expectation. It depends only on environment layers through time , and hence is -measurable. Its factors lie in , so is positive and integrable at each fixed time.
For any fixed path through time , the environment variable is independent of and has mean zero. Conditional expectation therefore removes its last factor. Summing over the possible last steps of each length- path cancels the extra factor in the path probability. ThusThis is the positive random-environment path-weight martingale. It is nonnegative and bounded in , so the martingale convergence theorem gives a finite limit almost surely. At this stage one can conclude by Fatou's lemma, but not yet equality; the second-moment bound in part (b) will prevent loss of mean.
Past exam of the mathematics course of the University of Cambridge 2004 iii Paper 28 3 a Solution Created 2026-10-03 Updated 2026-10-14
Use the natural filtration . Define the deterministic tail and put . This is nonnegative and integrable. Since ,Thus the deterministic summable drift correction produces a nonnegative supermartingale. The almost sure supermartingale convergence theorem gives a finite limit almost surely. Its finiteness is also reflected in the bound and Fatou's lemma, which gives . The convergence theorem follows from the upcrossing argument: bounded expected negative parts of rule out infinitely many crossings of rational intervals, and the expectation bound excludes an infinite limit.
Since , the required conclusion is . The original sequence need not itself be a supermartingale; subtracting the vanishing deterministic tail recovers it from one that is.
Past exam of the mathematics course of the University of Cambridge 2005 iii Paper 34 2 a Solution Created 2026-10-03 Updated 2026-10-14
The almost sure submartingale convergence theorem states that a discrete-time submartingale satisfying converges almost surely to a finite integrable limit. In particular, a martingale with converges almost surely to an integrable , and by Fatou's lemma. This is the martingale convergence theorem. Uniform integrability gives the stronger conclusion of L1 convergence; it is not implied by bounded first moments alone.
Past exam of the mathematics course of the University of Cambridge 2005 ii Paper 3 24J b Solution 2026-10-14
Completeness means that every norm-Cauchy sequence has a limit belonging to the same Lp space, with . To prove it, choose a subsequence with . The functionshave -norm bounded by , by Minkowski inequality. They increase to , and Fatou's lemma gives . Thus is finite almost everywhere, so the subsequence telescopes absolutely there to a measurable limit with and .
The same argument on the tails gives . Given , choose such a subsequence term beyond the Cauchy threshold and use . This proves convergence of the full sequence and completeness for every , on an arbitrary measure 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-14
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 2006 ii Paper 4 25J d Solution Created 2026-09-24 Updated 2026-10-14
Fatou's lemma states that nonnegative measurable functions satisfyTo prove it, put . These measurable nonnegative functions increase to . By the monotone convergence theorem, . Since for every , one has . Taking the limit proves the inequality, including extended infinite integrals.
Past exam of the mathematics course of the University of Cambridge 2007 ii Paper 1 28J i Solution Created 2026-09-24 Updated 2026-10-14
Relative to a filtration , a martingale is an adapted integrable process satisfying for . The martingale convergence theorem gives an almost-sure finite limit for a nonnegative martingale, with by Fatou's lemma. In continuous time take the usual right-continuous version and filtration hypotheses. Convergence in , and preservation of expectation at infinity, additionally require uniform integrability.
Past exam of the mathematics course of the University of Cambridge 2009 iii Paper 31 1 Solution Created 2026-10-03 Updated 2026-10-14
For , let be the number of completed upcrossings by the observations : buy when the value is at most , sell at the first subsequent value at least , and repeat. With , one form of the Doob upcrossing inequality for a martingale isFor completeness, hold either zero or one unit according to this rule. The holding at each step is measurable before the next martingale increment, so the total gain has expected value zero. Completed trades earn at least each; an unfinished trade loses at most . Thus , proving the inequality.
Suppose . For each rational pair the inequality and monotone convergence giveEvery rational interval therefore has only finitely many upcrossings, simultaneously outside a countable union of null sets. If , there is a rational interval strictly between them and infinitely many upcrossings, a contradiction. Thus the limit exists in the extended real line almost surely. Fatou's lemma now givesThe limit is finite almost surely and integrable. This proves the martingale convergence theorem rather than using it as the deduction.
The exact extra condition for convergence in L1 is uniform integrability:To see sufficiency, first discard the tails of uniformly and the tail of the integrable . On the set where both absolute values are at most , their difference is bounded by and tends to zero almost surely; dominated convergence finishes the proof. Conversely, if in , thenMake the first term uniformly small for all sufficiently large , then control the finitely many remaining integrable variables by increasing . Hence uniform integrability is necessary too. In this case the conditional expectation identity follows by taking the limit in for .
The coin-doubling martingale shows why an bound is not enough. Let be independent fair coin indicators and setConditional on the first coins, the next value is either or zero with equal probabilities, so this is a nonnegative martingale. Its expected value is always , while a first failure occurs almost surely, giving almost surely. Yet for every . Indeed, whenever , its tail expected value above is still . Thus convergence in L1 fails because uniform integrability fails.
Past exam of the mathematics course of the University of Cambridge 2011 ii Paper 4 25K ii Solution Created 2026-09-24 Updated 2026-10-14
Write , , and . Almost-everywhere convergence gives , so Fatou's lemma gives and . The given norm condition is . Consequentlyand the symmetric argument bounds . Combining upper and lower limits provesNo common integrable dominating function for has been assumed.
Past exam of the mathematics course of the University of Cambridge 2011 ii Paper 4 25K i Solution Created 2026-09-24 Updated 2026-10-14
Fatou's lemma states that for nonnegative measurable ,Indeed is measurable, increases to , and satisfies for every . The monotone convergence theorem gives , proving the claim, including infinite values.
The dominated convergence theorem states that if measurable almost everywhere and almost everywhere for one integrable nonnegative , then is integrable and ; in fact . Integrability follows from . For real functions, Fatou applied to gives , and applied to gives the reverse inequality against the upper limit. Thus the integrals converge. To obtain the stronger conclusion, Fatou applied to gives , forcing the latter limit to be zero. Complex functions may be treated through their real and imaginary parts or the same absolute-difference argument.
Past exam of the mathematics course of the University of Cambridge 2013 iii Paper 27 1 i Solution Created 2026-10-03 Updated 2026-10-07
Use the intrinsic boundary of a simply connected domain, so different approaches to the two sides of a slit remain distinct. The mapping-out function extends as a homeomorphism from this intrinsic compactification to that of the complex upper half-plane. Set . The imaginary coordinate of planar Brownian motion hits zero in finite time almost surely, and is no larger than that time. Thus and continuity gives a finite Euclidean exit point.
By conformal invariance of planar Brownian motion, is a planar Brownian motion in the complex upper half-plane, run with clockThe terminal clock cannot be infinite: that would make the transformed Brownian motion stay in the upper half-plane forever. It cannot stop while the transformed path is in the interior either, since continuity of would then put the original exit point inside . Hence the terminal clock is precisely the transformed Brownian exit time. The transformed path converges to a real boundary point, and applying the extended inverse proves almost sure convergence to a point of the intrinsic boundary.
Write , and let . The point at infinity has zero harmonic measure. Conformal invariance of planar Brownian motion and the Poisson kernel for the upper half-plane giveThe hydrodynamic normalization at infinity gives , so along the specified approach and . For each fixed real ,If , dominated convergence applies because is eventually bounded. If , Fatou's lemma makes the limit infinite. This proves the harmonic-measure asymptotic at infinitywith the equality understood in the extended nonnegative reals.
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 8 2 Solution Created 2026-10-03 Updated 2026-10-06
The weak topology of probability measures is the smallest topology making every map continuous for bounded continuous real on . Define the bounded-Lipschitz metric byUsing the maximum of the two bounds instead of their sum changes the metric by at most a factor of two and gives the same topology. Symmetry and the triangle inequality follow from the supremum formula. Bounded Lipschitz functions distinguish probability measures by the open-set approximations below, so is a metric. On a separable metric space, induces the weak topology.
Here are the essential details. If , integrals of every bounded Lipschitz function converge after rescaling its Lipschitz bound. For an open set , the functionsincrease to ; for take . Thus . It follows both that is lower semicontinuous for the weak topology, as a supremum of continuous maps, and that beta convergence impliesThis is the open-set Portmanteau criterion. Its closed-set equivalent, by complements, isEither family of inequalities is necessary and sufficient for weak convergence of probability measures. For sufficiency of the open inequalities, apply the layer-cake formula and Fatou's lemma to the open superlevel sets of a continuous function , obtaining . Applying the same argument to gives the reverse bound. Scaling handles every bounded continuous function.
Conversely, weak convergence implies beta convergence. Choose a compact set of arbitrarily large -mass, using tightness of a probability measure on a Polish space. The unit bounded-Lipschitz class is uniformly bounded and equicontinuous on , so finitely many of its members approximate all others uniformly there. On the open -neighborhood , approximation errors increase by at most . The open-set inequality makes large for all sufficiently large . Weak convergence for the finitely many selected functions, combined with these approximation errors and the small mass outside , bounds the supremum defining by an arbitrarily small number. The same finite-test and open-mass bounds define weak neighborhoods, so the argument gives equality of the topologies, not only their convergent sequences. It does not first assume uniform tightness of the entire sequence.
The map is injective and continuous: for , is bounded continuous on , and . To prove inverse continuity on its image, suppose . For every open , there is an open with . Hence and . The open-set criterion on now gives the criterion on , so . Both spaces are metrizable, and this sequential argument provesThis is the probability pushforward embedding theorem. The printed claim needs the words “onto its image”: it is generally not onto all , since a Dirac mass at a point outside is not in its image. By Question 1, the completely metrizable subspace is a Borel G-delta set, and
Now let be weakly closed and uniformly tight. Take any sequence in . The space is compact for the weak topology. For completeness, this compactness follows by choosing a countable uniformly dense family in , extracting a diagonal subsequence of its bounded integrals, and extending the limits to a positive normalized functional on ; the Riesz-Markov-Kakutani representation theorem gives the limiting probability measure. Thus, along a subsequence, .
For every , choose compact with for every . The set is compact and closed in , so the closed-set criterion givesTherefore , and for some . Inverse continuity gives , and closedness puts . Hence is sequentially compact, and metrizability makes it compact. This proves the required closed uniformly tight compactness criterion, rather than assuming it from Prokhorov's theorem.
Such a compact metrizable extension is always available: for a countable dense set , the coordinates embed homeomorphically into . Injectivity and inverse continuity follow by choosing close to a specified point and using the triangle inequality. The closure of the image gives .
To show separability of , use finite sums of Dirac measures on a countable dense subset of with nonnegative rational weights summing to one. This is a countable family. Given , cover a large-mass compact set by finitely many small balls centered in that subset, move the mass in each piece to its center, and move the remaining small mass to one fixed center. The bounded-Lipschitz error is at most the ball radius plus twice the exceptional mass. Approximate the resulting weights by rational weights. Thus these atomic measures are beta-dense.
Finally use a complete compatible metric on the Polish space , as required for the granted total-boundedness-to-tightness assertion. A beta-Cauchy sequence is beta-totally bounded, and so is its closure in . By the allowed assertion this closure is uniformly tight; it is weakly closed because the weak and beta topologies agree. The compactness result just proved gives a convergent subsequence, and the Cauchy property forces the whole sequence to converge in beta. Consequently beta is complete for this choice of , andIf the originally displayed compatible metric is incomplete, replace it by a complete compatible metric for this last argument; the weak topology itself is unchanged.