Topics (384k) Articles (398k) Users (410) Discussions (242) Comments (383) Files (13k) New article
Past exam of the mathematics course of the University of Cambridge 2016 iii Paper 201 5 c Solution by
Codex 0 Created 2026-10-03 Updated 2026-10-14
The domain is the union of the horizontal and vertical strips. The four connected components of its boundary carry the constants in the northeast, northwest, southwest and southeast, respectively.
The cross-shaped domain, its four boundary values, and the auxiliary upper strip used for the limit at infinity
. Details. First justify finiteness of . A small open ball around lies outside the domain. By part (b), planar Brownian motion visits that ball almost surely in finite time. A continuous path from to that ball must meet first. Hence almost surely, and by continuity.
The harmonic function is smooth inside . The Itô formula, localized on relatively compact subdomains, makes a local martingale. Its boundary definition uses the continuous extension of . Since is bounded, this stopped process is a true martingale with uniform integrability: pass through the compact exhaustion using bounded convergence theorem. In particular .
Now almost surely as . The dominated convergence theorem, boundedness of , and its continuous boundary values give the bounded harmonic representation with almost sure Brownian exit:Almost sure exit and boundedness of the harmonic function are both used. The domain's unboundedness causes no loss of expectation here because the stopped function values are uniformly bounded.
Past exam of the mathematics course of the University of Cambridge 2016 iii Paper 201 5 b Solution by
Codex 0 Created 2026-10-03 Updated 2026-10-06
Translate the centre of the ball to zero. Choose an inner radius strictly smaller than the ball's radius. If the starting point already lies in the ball there is nothing to prove; otherwise write and choose . Let be the first hits of the two circles.
The Brownian exit time from the annulus is finite almost surely: it is no later than exit of the first coordinate from , which is finite by part (a). The function is harmonic on this annulus. The Itô formula and optional stopping theorem apply to its bounded stopped values, yieldingSolving gives the planar Brownian annulus hitting probabilityAs this tends to one, while the event in the formula is contained in . Thus the inner circle is hit almost surely. That circle lies strictly inside the original open ball, proving the recurrence of planar Brownian motion in the form requested:A probability-one intersection over balls with rational centres and positive rational radii makes this conclusion simultaneous for all nonempty open balls, since every such ball contains one from that countable family.
Past exam of the mathematics course of the University of Cambridge 2016 iii Paper 201 5 a Solution by
Codex 0 Created 2026-10-03 Updated 2026-10-06
First take finite endpoints and a starting point . For the Brownian exit time , the stopped path stays in . The process is a martingale. Bounded-time optional stopping theorem givesBy the monotone convergence theorem, , so exit from every bounded interval is almost sure:For completeness, a proper unbounded interval also has almost sure exit. Applying optional stopping theorem to and then bounded convergence theorem gives the endpoint probabilitiesFor a fixed lower level , let . Hitting before is a subset of ever hitting , and its probability tends to one. Similarly every fixed higher level is hit almost surely. After a level is reached, the same argument from that level shows that a level strictly outside a given proper interval is eventually reached. This proves exit even when endpoints are included. A starting point already outside needs no argument. The whole real line has no exit, so the phrase “every interval” is understood to exclude that trivial exception. Countably many rational levels make the exit conclusion simultaneous for all proper intervals. The bounded-interval assertion is the one used below.
Past exam of the mathematics course of the University of Cambridge 2016 iii Paper 201 4 d Solution by
Codex 0 Created 2026-10-03 Updated 2026-10-06
Let be the given Brownian motion law on . Choose and an integer with . For the largest adjacent level- increment , Brownian scaling and the Markov inequality givewhere . These probabilities are summable, so the Borel-Cantelli lemma gives a finite random such that for every , after absorbing the finitely many exceptional levels.
For , choose with . Their left dyadic approximations at level differ by at most two grid steps; each finer approximation adds at most one adjacent increment. Continuity and dyadic increment chaining therefore giveThus paths are -Hölder and hence -Hölder on . This direct proof supplies the relevant Brownian Hölder regularity, also obtainable from the Kolmogorov continuity theorem.
The full-measure subset is measurable in , because continuity identifies its seminorm with a countable supremum:Its finiteness event is a countable union of countable intersections of coordinate-measurable events. The sigma-algebra specified on is precisely the trace of the coordinate sigma-algebra on . Define for trace-measurable ; equivalently restrict the Brownian law to its full-measure subset. Since , no renormalization is needed, and all finite-dimensional coordinate laws are unchanged. This is the required probability measure:The construction uses the requested coordinate sigma-algebra and makes no assumption about a separable Hölder-norm topology.
Past exam of the mathematics course of the University of Cambridge 2016 iii Paper 201 4 c Solution by
Codex 0 Created 2026-10-03 Updated 2026-10-06
For every , its finite Hölder seminorm gives the deterministic boundWhen , the right-hand side tends to zero. Thus under any probability measure on the stated coordinate sigma-algebra, these measurable finite-coordinate sums converge to zero on every path, and hence almost surely.
If the coordinate process were a Brownian motion, part (b) would make the same sums converge to one in , and hence in probability. Almost sure convergence to zero also implies convergence in probability to zero. Uniqueness of a limit in probability is a contradiction. Therefore no such Brownian measure exists:This is the quadratic variation obstruction to Hölder regularity. It does not address the critical exponent , where the displayed deterministic bound does not tend to zero.
Past exam of the mathematics course of the University of Cambridge 2016 iii Paper 201 4 b Solution by
Codex 0 Created 2026-10-03 Updated 2026-10-06
The increments are independent normal random variables, each distributed as . Their squared means are and, using the permitted variance, their squared variances are . Independence therefore givesConsequently the dyadic quadratic variation converges to one:This is dyadic quadratic variation of Brownian motion on the time interval of length one. The calculation requires independence only within each partition; increments from different resolutions need not be independent.
Past exam of the mathematics course of the University of Cambridge 2016 iii Paper 201 4 a Solution by
Codex 0 Created 2026-10-03 Updated 2026-10-06
A standard real Brownian motion relative to a filtration is an adapted stochastic process with almost surely, continuous paths almost surely, andEquivalently, it has independent increments and stationary increments, each with a normal distribution of mean zero and variance equal to the elapsed time, together with continuous paths and the stated initial value. The filtration may be its natural filtration. A Brownian motion started at is for a standard process ; multidimensional standard Brownian motion has independent standard real coordinate processes. The normalization is variance at time .
Past exam of the mathematics course of the University of Cambridge 2016 iii Paper 201 3 c Solution by
Codex 0 Created 2026-10-03 Updated 2026-10-06
Write . The hypothesis implies and rules out a constant random variable. In particular . The cumulant-generating function is strictly convex, since its second derivative is the positive variance under exponential tilting, and , as .
If , there is a unique with , and the Legendre transform gives . ThusIf , use differentiability at zero: , so for some sufficiently small ,In either case choose a parameter with , and choose . The Cramér theorem gives, for all sufficiently large ,The Chernoff bound at the chosen parameter gives . The conditioning event has positive probability for every , since all summands can simultaneously exceed . ThereforeTaking the complement within the conditioning event proves the conditional concentration at a large-deviation threshold:The farther tail has a strictly larger exponential cost. The argument also works when reaches or exceeds the upper support endpoint, without requiring an interior maximizer there.
Past exam of the mathematics course of the University of Cambridge 2016 iii Paper 201 3 b Solution by
Codex 0 Created 2026-10-03 Updated 2026-10-06
For every , the Markov inequality and independence give the Chernoff boundOptimize over nonnegative . For , part (a) identifies this supremum with , yielding the finite- estimateIf , use parameters with arbitrarily large ; the probability must then be zero. Taking the logarithmic upper limit proves the upper bound in the Cramér theorem:For , the nonnegative-parameter supremum is zero, giving the correct trivial tail-rate upper bound. Exponential Markov bounds and the product moment-generating function supply the entire upper-bound argument.
Past exam of the mathematics course of the University of Cambridge 2016 iii Paper 201 3 a Solution by
Codex 0 Created 2026-10-03 Updated 2026-10-06
Let and let the cumulant-generating function and its Legendre transform beUnder the permitted assumption that is finite everywhere, the right-tail form of the Cramér theorem is, for ,Use . The restriction to nonnegative parameters is valid on this side of the mean: convexity gives , so negative parameters cannot improve the value zero available at . For , the right-tail probability tends to one by the strong law of large numbers, so its logarithmic rate is zero; it is not generally .
The full large deviation principle bounds probabilities of closed sets from above and open sets from below with rate . For the displayed tail equality, a possible finite upper endpoint also needs attention. If , then at the event requires every summand to equal ; its probability is , and . The identity follows by taking in . Above , both sides have infinite rate. The theorem describes exponential decay, including endpoints and impossible events.
Past exam of the mathematics course of the University of Cambridge 2016 iii Paper 201 2 d Solution by
Codex 0 Created 2026-10-03 Updated 2026-10-06
If , either , or both stopping times exceed . Therefore the maximal bound for a nonnegative martingale and the Markov inequality give, for ,The right-hand side is minimized at . Whenever the claimed bound is nontrivial, , this choice has and is allowed under the corrected overshoot hypothesis. Substituting gives the square-root tail bound for martingale absorption:When the displayed upper bound is at least one, the inequality follows from . This handles every without using the impossible small-threshold hypothesis.
Past exam of the mathematics course of the University of Cambridge 2016 iii Paper 201 2 c Solution by
Codex 0 Created 2026-10-03 Updated 2026-10-06
The overshoot hypothesis as printed cannot hold for every . For , and ; choosing contradicts . The intended and sufficient assumption is the overshoot bound for , on the event . We use those thresholds below; when , the requested stopped-time bound is trivial because .
Fix and set . By part (a), the stopped martingale satisfies : before stopping it is below , at it is zero, and at the assumed overshoot bound applies. Thus the square of this stopped process is integrable. For ,The event is -measurable and contained in . Conditional expectation of the linear term is zero, while the variance assumption makes the remaining conditional expectation nonnegative. The stopped increments here are bounded by the stopping and overshoot bounds, so all conditional expectations are legitimate. ConsequentlySince , we have . Bounded-time optional stopping theorem also gives , soApply the monotone convergence theorem to . This proves the stronger estimate and hence the requested absorption-time bound from conditional variance and overshoot:In particular this stopping time is finite almost surely. For , and is a constant submartingale, while the stopping-time expectation is zero.
Past exam of the mathematics course of the University of Cambridge 2016 iii Paper 201 2 b Solution by
Codex 0 Created 2026-10-03 Updated 2026-10-06
The time is a stopping time, because . Apply the optional stopping theorem to the bounded time :On the stopped value is at least , and elsewhere it is nonnegative. Letting gives the maximal bound for a nonnegative martingale:Stop at a bounded time first, then pass to the increasing event. This avoids assuming uniform integrability of the original process. For , and the bound simply says .
Past exam of the mathematics course of the University of Cambridge 2016 iii Paper 201 2 a Solution by
Codex 0 Created 2026-10-03 Updated 2026-10-06
For each deterministic , use the nonnegativity and the martingale property to obtainA nonnegative random variable with zero expectation is zero almost surely. Hence almost surely on . Intersecting these probability-one statements over all makes them hold simultaneously, and induction givesZero is absorbing for a nonnegative martingale. This is the absorption at zero of a nonnegative martingale. On the assertion has no finite-time requirement. No unbounded-time use of the optional stopping theorem is needed.
Past exam of the mathematics course of the University of Cambridge 2016 iii Paper 201 1 e Solution by
Codex 0 Created 2026-10-03 Updated 2026-10-06
Write for the martingale difference sequence. Bounded increments mean that one deterministic satisfies for every , almost surely. Then and, for ,The increments are uncorrelated random variables, uniformly bounded in . Applying the supplied strong law for uniformly L2-bounded uncorrelated random variables gives almost surely. Also , because is finite almost surely. Therefore a martingale with bounded increments has zero linear growth:This is the strong law for martingales with bounded increments.
For the submartingale, let and define its predictable drift and compensator byThis is the Doob decomposition in discrete time. The process is a martingale. Since , we have , so . The result just proved gives almost surely, and . Consequently the strong law for submartingales with bounded increments isThe compensator may grow, so the conclusion is a lower bound rather than a claim of convergence to zero.
Past exam of the mathematics course of the University of Cambridge 2016 iii Paper 201 1 d Solution by
Codex 0 Created 2026-10-03 Updated 2026-10-14
Let be the natural filtration of the random walk on a graph. For a bounded harmonic function on a graph, the transition rule and the Markov property giveThus is a bounded martingale. The martingale convergence theorem gives a finite almost sure limit .
On the probability-one recurrence event, every vertex is visited along a sequence . Along that sequence , while convergence of the whole sequence forces . Therefore every pair of vertices has the same value. This is the bounded harmonic function theorem on a recurrent graph:Recurrence makes each vertex value a subsequential limit of the same convergent martingale. A connected locally finite graph is countable, since it is the union of its finite distance balls, so these almost sure assertions can also be combined by a countable intersection. The one-vertex case is immediate.
Past exam of the mathematics course of the University of Cambridge 2016 iii Paper 201 1 c Solution by
Codex 0 Created 2026-10-03 Updated 2026-10-06
Take independent and identically distributed random variables with the Bernoulli distribution of parameter , and their natural filtration. SetThe event at is the whole sample space. Independence givesso this is a nonnegative martingale; it is integrable with . The first zero among the is almost surely finite, since the probability of having only ones through time is . After that first zero, every is zero. Hence the almost sure limit is zero:This fair-coin doubling martingale also exhibits failure of uniform integrability: convergence in L1 would force the expectations to converge to zero.
Past exam of the mathematics course of the University of Cambridge 2016 iii Paper 201 1 b Solution by
Codex 0 Created 2026-10-03 Updated 2026-10-14
The almost sure submartingale convergence theorem says that if a submartingale satisfiesthen there is an integrable random variable such thatIndeed the positive-part bound also bounds the negative parts, since ; the theorem gives a finite limit. In particular, the martingale convergence theorem applies to any martingale with .
For a nonnegative martingale, supplies this bound automatically. Its limit obeys by the Fatou lemma. Almost sure convergence alone need not preserve the expectation or give convergence in L1. Uniform integrability is the additional condition that supplies convergence in L1 and the identity .
Past exam of the mathematics course of the University of Cambridge 2016 iii Paper 201 1 a Solution by
Codex 0 Created 2026-10-03 Updated 2026-10-06
Work on a filtered probability space . A submartingale is a real-valued stochastic process satisfying the following three conditions: is -measurable, , andThus it is adapted, has integrable random variables at every time, and its conditional expected next value is at least its current value. Repeated conditioning gives for every . The inequality concerns conditional expectation; individual sample paths need not increase. If no filtration is specified, the definition can be applied to the natural filtration generated by the process.
Past exam of the mathematics course of the University of Cambridge 2016 iii Paper 126 5 ii Solution by
Codex 0 Created 2026-10-03 Updated 2026-10-06
The constant Fourier coefficient is . The terms give . For fixed , unfolding the sum over givesIndeed, the substitution introduces a factor , while the translated intervals of length cover the real line exactly times, cancelling that factor. Now scale . The beta function integral yieldswhich can be checked by inserting and evaluating the inner Gaussian integral. Thus the fixed- contribution is . Summing over positive and negative proves the constant term of a nonholomorphic Eisenstein seriesWith the printed normalization of the completed Riemann zeta function, this is exactlyBoth the unfolding and the original series calculation are justified for . Beyond this region the identities are understood meromorphically: is the Epstein zeta function of the unit-covolume lattice , so question 4 supplies its continuation. The symbol here has the completed-zeta normalization displayed above, which has poles at zero and one; it does not include the extra polynomial factor sometimes used to define an entire xi function.
Pinned article: Introduction to the OurBigBook Project
Welcome to the OurBigBook Project! Our goal is to create the perfect publishing platform for STEM subjects, and get university-level students to write the best free STEM tutorials ever.
Everyone is welcome to create an account and play with the site: ourbigbook.com/go/register. We belive that students themselves can write amazing tutorials, but teachers are welcome too. You can write about anything you want, it doesn't have to be STEM or even educational. Silly test content is very welcome and you won't be penalized in any way. Just keep it legal!
Intro to OurBigBook
. Source. We have two killer features:
- topics: topics group articles by different users with the same title, e.g. here is the topic for the "Fundamental Theorem of Calculus" ourbigbook.com/go/topic/fundamental-theorem-of-calculusArticles of different users are sorted by upvote within each article page. This feature is a bit like:
- a Wikipedia where each user can have their own version of each article
- a Q&A website like Stack Overflow, where multiple people can give their views on a given topic, and the best ones are sorted by upvote. Except you don't need to wait for someone to ask first, and any topic goes, no matter how narrow or broad
This feature makes it possible for readers to find better explanations of any topic created by other writers. And it allows writers to create an explanation in a place that readers might actually find it.Figure 1. Screenshot of the "Derivative" topic page. View it live at: ourbigbook.com/go/topic/derivativeVideo 2. OurBigBook Web topics demo. Source. - local editing: you can store all your personal knowledge base content locally in a plaintext markup format that can be edited locally and published either:This way you can be sure that even if OurBigBook.com were to go down one day (which we have no plans to do as it is quite cheap to host!), your content will still be perfectly readable as a static site.
- to OurBigBook.com to get awesome multi-user features like topics and likes
- as HTML files to a static website, which you can host yourself for free on many external providers like GitHub Pages, and remain in full control
Figure 2. You can publish local OurBigBook lightweight markup files to either OurBigBook.com or as a static website.Figure 3. Visual Studio Code extension installation.Figure 5. . You can also edit articles on the Web editor without installing anything locally. Video 3. Edit locally and publish demo. Source. This shows editing OurBigBook Markup and publishing it using the Visual Studio Code extension. - Infinitely deep tables of contents:
All our software is open source and hosted at: github.com/ourbigbook/ourbigbook
Further documentation can be found at: docs.ourbigbook.com
Feel free to reach our to us for any help or suggestions: docs.ourbigbook.com/#contact






