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 2012 iii Paper 34 3 b Solution by
Codex 0 Created 2026-10-03 Updated 2026-10-07
Let . The stopped logarithm lies between and , so the bounded local martingale criterion makes it a true bounded martingale. Also is finite almost surely. Indeed is a martingale, and applying its stopped identity through givesmonotone convergence theorem implies , hence almost surely. Boundedness permits dominated convergence theorem in the stopped logarithm as . ConsequentlyThe standard results used are Itô's formula, the bounded-local-martingale criterion, the stopped martingale identity at bounded stopping times, and dominated/monotone convergence theorem. At exit the radius is either or by continuity. Solving also gives the planar Brownian annulus hitting probability
Past exam of the mathematics course of the University of Cambridge 2012 iii Paper 34 3 a Solution by
Codex 0 Created 2026-10-03 Updated 2026-10-07
For away from the origin,The Itô formula for planar Brownian motion therefore has no drift term before the radius reaches . Since the initial logarithm is zero,The integrand's squared norm is on this stopped interval, so this is a square-integrable martingale on every finite horizon, in particular a local martingale. One may first stop in an outer annulus to apply the formula on a compact smooth domain and then remove that localization.
Past exam of the mathematics course of the University of Cambridge 2012 iii Paper 34 2 c Solution by
Codex 0 Created 2026-10-03 Updated 2026-10-07
Use just the parameters and . Positivity and adaptation of their local martingales giveThus both processes are adapted. A positive continuous local martingale has a semimartingale logarithm, by Itô formula after localization away from zero. Since and has finite variation, is a continuous semimartingale. Write , where is a zero-starting continuous local martingale and is continuous finite variation, also starting from zero.
Apply Itô formula to each exponential:Because is itself a local martingale, the finite-variation term is zero by part (a). Divide its finite signed measure by the strictly positive . For , respectively,Adding and subtracting show and . Therefore the exponential criterion for a continuous local martingale and its bracket givesThe semimartingale property was established before applying Itô's formula to ; it was not assumed from the outset.
Past exam of the mathematics course of the University of Cambridge 2012 iii Paper 34 2 b Solution by
Codex 0 Created 2026-10-03 Updated 2026-10-07
For a continuous semimartingale , its quadratic variation is the continuous increasing zero-starting process obtained as the limit, uniformly on compact time intervals in probability, of sums of squared increments along deterministic partitions whose mesh tends to zero. If is its continuous local-martingale/finite-variation decomposition, then ; finite-variation terms and their cross sums vanish.
Write . If , then for every ,First send to infinity and then to infinity. Thus convergence in probability under implies convergence in probability under , also for a supremum on a compact time interval. The same squared-increment sums converge under to the version of . Since is also a semimartingale under , these sums converge to its quadratic variation. Uniqueness of limits in probability gives equality at every fixed time; continuity and countably many rational times giveAbsolute continuity suffices; equivalence is not required. This is quadratic variation under an absolutely continuous measure change.
Past exam of the mathematics course of the University of Cambridge 2012 iii Paper 34 2 a Solution by
Codex 0 Created 2026-10-03 Updated 2026-10-07
For a continuous path of finite variation on , every partition satisfiesUniform continuity makes the right side tend to zero as the mesh tends to zero. The quadratic variation of the given continuous local martingale is therefore identically zero.
Stop when its magnitude first reaches an integer , so the stopped process is a bounded, square-integrable martingale. The square identity, or the Itô isometry, gives . Hence it is zero at each rational time almost surely, and continuity extends this simultaneously to all times. Let tend to infinity. This provesThis is the continuous finite-variation local martingale is constant principle with initial value zero.
Past exam of the mathematics course of the University of Cambridge 2012 iii Paper 34 1 d Solution by
Codex 0 Created 2026-10-03 Updated 2026-10-07
Use the shifted filtration . Each is a stopping time, and the optional sampling theorem implies that is a -martingale. It is -bounded, for example by . Its quadratic variation is . The shifted process is continuous and -adapted, hence predictable. Its boundedness and the integrability of the bracket make the right-hand stochastic integral well-defined in .
For a deterministic partition , use left-endpoint coefficients . Both integrals have the same approximating sumOn the original clock this is the integral of the simple process on the stopping-time intervals ; on the shifted clock it is a deterministic-partition integral. As the mesh tends to zero, continuity of gives pathwise uniform approximation on the random compact interval . The Itô isometry and domination by a constant times the integrable give convergence of both sums. Thus stopping-time shift of a stochastic integral yieldsThe left integral includes increments strictly after , so no jump at the starting time is added.
Past exam of the mathematics course of the University of Cambridge 2012 iii Paper 34 1 c Solution by
Codex 0 Created 2026-10-03 Updated 2026-10-07
The stopping-interval indicator is an elementary predictable process with stopping-time intervals. Its stochastic integral isIt is zero before , equals between and , and equals after . For a martingale with jumps, the jump at is excluded and the jump at is included, exactly as required by the half-open interval.
Past exam of the mathematics course of the University of Cambridge 2012 iii Paper 34 1 b Solution by
Codex 0 Created 2026-10-03 Updated 2026-10-07
An elementary predictable process with stopping-time intervals has the form , where the stopping times are ordered and is bounded and -measurable. Deterministic endpoints give the usual simple predictable process. Define the zero-starting stochastic integral byCommon refinement and telescoping show that this definition is independent of the representation. Use for an infinite endpoint. The L2-bounded martingale convergence theorem gives convergence of in to and .
Put . The optional sampling theorem gives . For , the variable is -measurable; hence . Applying the same theorem to the assumed martingale givesConsequently the Itô isometry follows:The unbounded stopping times cause no optional-sampling gap. The terminal representation makes uniformly integrable and makes the family of stopped uniformly integrable, by conditional Jensen applied to . Also , from monotone convergence theorem and the assumed square-compensator identity. Thus has the needed uniform integrability, and truncating stopping times and passing in is legitimate. Bounded coefficients are part of the simple-integrand convention; more general coefficients require the displayed square-integrability condition.
Past exam of the mathematics course of the University of Cambridge 2012 iii Paper 34 1 a Solution by
Codex 0 Created 2026-10-03 Updated 2026-10-07
Use the predictable sigma-algebra generated by , , and , . A previsible process is a measurable function for this sigma-algebra. Set , with . The events and are in , because they are countable unions of events and for rational . Thus is an adapted process. Each path is left-continuous, including at the two endpoints, and is zero if .
For a direct measurability argument, letEach summand is measurable for the predictable sigma-algebra, since its coefficient is -measurable. At every the sampling time approaches strictly from below, so left-continuity gives . ThereforeThe original PDF has a right-closed interval. The open right endpoint in the converted TeX is a transcription error; replacing by is not valid for arbitrary stopping times.
Past exam of the mathematics course of the University of Cambridge 2012 iii Paper 33 6 c Solution by
Codex 0 Created 2026-10-03 Updated 2026-10-07
For the simple symmetric random walk, the increments have mean and variance . Use the polygonal interpolation from (b). The maximum functional is Lipschitz in the supremum norm, sinceEach interpolating segment is linear, so its maximum occurs at a grid endpoint. The continuous mapping theorem applied to the Donsker invariance principle givesThe limiting maximum has no atom at by the Brownian reflection principle, so the closed-tail probabilities converge at this threshold. Including does not change the event because . Therefore the random-walk maximum limit from Donsker invariance isHere is the standard normal distribution function. The normalization and the positive-threshold condition are those in the PDF; the TeX aid's is not the printed expression.
Past exam of the mathematics course of the University of Cambridge 2012 iii Paper 33 6 b Solution by
Codex 0 Created 2026-10-03 Updated 2026-10-07
Let be independent and identically distributed random variables with mean and variance , and put , . Define the polygonal interpolationwith the endpoint . The Donsker invariance principle stateswhere is standard one-dimensional Brownian motion and the arrow denotes weak convergence of probability measures on this path space. Equivalently, the step interpolation converges in the Skorokhod space with its topology. The continuous interpolation version is sufficient for the maximum in part (c).
Past exam of the mathematics course of the University of Cambridge 2012 iii Paper 33 6 a Solution by
Codex 0 Created 2026-10-03 Updated 2026-10-07
Let . The Brownian reflection principle givesHere is the reflection argument: on paths that hit before , reflect all increments after their first hitting time. The Strong Markov property gives independent Brownian motion after that time, whose sign can be reversed without changing its law. This exchanges paths ending below with paths ending above . The latter have necessarily hit , and the endpoint has no atom at , giving the displayed equality. It also shows that has a continuous distribution at every positive level.
Writing for the standard normal distribution function, the probability of staying below the barrier is thereforeSince as , the Brownian barrier survival asymptotic isAny smaller exponent gives a zero limit and any larger exponent gives an infinite limit, so this is the unique exponent producing a finite positive constant.
Past exam of the mathematics course of the University of Cambridge 2012 iii Paper 33 5 c Solution by
Codex 0 Created 2026-10-03 Updated 2026-10-07
Let be the fixed line and choose . Take orthonormal vectors spanning the plane perpendicular to . The processis standard planar Brownian motion starting from . Indeed the projected increments are centered Gaussian random vectors with covariance , are independent on disjoint intervals, and have continuous paths.
The event is exactly . The polar point for planar Brownian motion result in (b) therefore givesThis is a projection criterion for Brownian avoidance of affine subspaces: avoiding a fixed point in a two-dimensional projection excludes hitting the original line.
Past exam of the mathematics course of the University of Cambridge 2012 iii Paper 33 5 b Solution by
Codex 0 Created 2026-10-03 Updated 2026-10-07
First fix a deterministic point different from the initial point. By translation, work with and . For , hitting before requires hitting every circle of radius before . Part (a) givesAny finite-time hit of lies before exit from some sufficiently large integer-radius circle, since a continuous path on a finite interval is bounded. A countable union over such radii therefore shows that this fixed point is never hit. This is the polar point for planar Brownian motion property; it is a statement about each fixed point, not about avoiding all points simultaneously.
For the initial point , fix a deterministic . The Gaussian distribution of has a density, so almost surely. Conditional on , the future is Brownian motion starting from , and the preceding fixed-point result shows that it never hits . Taking and a countable union proves there is no return to the starting point at any positive time.
In contrast, neighborhoods are revisited arbitrarily late. Choose so that the closed disk centered at of radius lies in the given open set . From any point outside this disk, let in part (a), centered at . It givesAt each deterministic integer time , condition on . If it is in the disk there is already a visit to at time ; if it is outside, the Markov property and the last calculation ensure a later visit to that disk, hence to . With probability one this holds for all simultaneously. Thus the set of visits to is unbounded. The recurrence of planar Brownian motion concerns neighborhoods even though every fixed point is polar.
Past exam of the mathematics course of the University of Cambridge 2012 iii Paper 33 5 a Solution by
Codex 0 Created 2026-10-03 Updated 2026-10-07
Put . First establish almost sure finiteness. The Itô formula gives the martingale for planar Brownian motion. Stop it at . The stopped path has norm at most , soBy monotone convergence, , and hence almost surely.
The function is a harmonic function away from : in polar coordinates its Laplacian is . The Itô formula shows is a local martingale. It is bounded between and , so it is a true martingale and passage to is justified by dominated convergence. Writing and using continuity at exit givesSolving yields the planar Brownian annulus hitting probabilityThe stopping argument stays away from the singularity of the logarithm until the calculation is complete.
Past exam of the mathematics course of the University of Cambridge 2012 iii Paper 33 4 d Solution by
Codex 0 Created 2026-10-03 Updated 2026-10-07
For , integrate the identity for . The Tonelli theorem and the tail bound in (c) giveFor the expectation is , and for the fact gives . ThereforeThis is an exponential moment bound for a Gaussian random-walk maximum. The upper-tail bound proves the requested sufficient range; it alone does not establish a converse at the endpoint.
Past exam of the mathematics course of the University of Cambridge 2012 iii Paper 33 4 c Solution by
Codex 0 Created 2026-10-03 Updated 2026-10-07
The strong law of large numbers gives almost surely, so . Therefore the infinite-horizon maximum is finite and attained almost surely; also because .
Apply the Doob maximal inequality to through time . Since ,These finite-horizon events increase to . Continuity of probability under increasing unions givesFor the same bound is trivial, because its right side exceeds . Only bounded-horizon maximal inequalities were used before passing to the limit; no unjustified stopping at an infinite-horizon crossing time is needed.
Past exam of the mathematics course of the University of Cambridge 2012 iii Paper 33 4 b Solution by
Codex 0 Created 2026-10-03 Updated 2026-10-07
The moment-generating function of a normal distribution givesIndependence of from impliesEvery exponential here is integrable. Thus the process is a martingale exactly when . Its two roots are and , and the unique positive root isThe resulting exponential martingale of a random walk is nonnegative and has expectation at every finite time.
Past exam of the mathematics course of the University of Cambridge 2012 iii Paper 33 4 a Solution by
Codex 0 Created 2026-10-03 Updated 2026-10-07
For a nonnegative submartingale and , the weak form of the Doob maximal inequality isTo prove it, let be the event that is the first index with . These events are disjoint, , and their union is . The submartingale property gives . Multiplying by , taking expectations and summing yields . Nonnegativity gives the second inequality.
The associated Doob Lp maximal inequality, for and , isIndeed , so conditional Jensen inequality first ensures finite th moments for all and hence for the finite maximum. Integrating the weak inequality against and using the Tonelli theorem givesThe last step is Holder inequality. Dividing, unless the maximum is zero, proves the stated norm bound. For an arbitrary martingale, its absolute value is a nonnegative submartingale by conditional Jensen inequality, so both corresponding absolute-maximum bounds follow.
Past exam of the mathematics course of the University of Cambridge 2012 iii Paper 33 3 d Solution by
Codex 0 Created 2026-10-03 Updated 2026-10-07
Use the independent-mark interpretation: the Brownian motions attached to the atoms are independent of one another and of the initial Poisson random measure. Fix and defineConditionally on the initial atoms, each atom is retained as a dangerous atom if its own path meets the target by time . These tests are independent, with position-dependent retention probability . The permitted Poisson thinning property makes the dangerous atoms a Poisson random measure of intensity .
Its total intensity is computed without invoking a marking or displacement theorem. The event in the definition of says that belongs toBy the Tonelli theorem,Symmetry of Brownian motion gives as processes. It therefore identifies the last expectation with , where the sign of the deterministic path is unchanged. This swept set is a Wiener sausage with an added deterministic path.
The total intensity is finite on each bounded time interval. To see this explicitly, write and . The sausage is contained in a ball of radius . On a finite time grid, splitting according to the first crossing of a positive level by a one-dimensional Brownian motion shows that the chance of ending above , conditional on the crossing, is at least : the remaining independent increment is symmetric. Thus the grid maximum exceeds with probability at most twice the final Gaussian upper tail. Dense grids and continuity give the same bound for the path maximum. Applying this to each coordinate and its negative givesThe last inequality follows from and minimizing the exponential Markov bound. Integration of this tail gives finite moments of of every positive order, so .
There are consequently only finitely many dangerous atoms on each compact time interval, almost surely. For closed balls, continuity of the paths makes each finite hitting-time infimum attained. The event is therefore the absence of dangerous atoms up to time .
The open-ball convention has the same survival probability at each fixed . Indeed for any compact path range , the difference between its closed and open radius-one neighborhoods is the shell , which has zero Lebesgue measure. To see this, choose a nearest for a shell point . For every sufficiently small , the ball of radius centered at lies in the open neighborhood and inside the ball of radius about . Thus the shell has a fixed proportional hole at every scale; the Lebesgue density theorem forces its measure to be zero. By the Tonelli theorem, closed-touch and open-entry retention probabilities have equal integrals. Independent thinning therefore gives no atom that touches only the boundary before this fixed horizon, almost surely. This also excludes a difference at an open-entry infimum equal to .
The zero-count probability of a Poisson distribution is , and henceThis survival among independently moving Poisson traps formula has been derived using only independent thinning and the defining Poisson zero-count probability, with the expectation/volume step supplied by Tonelli's theorem.
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





