Past exam of the mathematics course of the University of Cambridge 2005 iii Paper 34 1 b Solution Created 2026-10-03 Updated 2026-10-14
The required condition is uniform integrability, written entirely in terms of the given probability laws:Together with the given almost sure convergence, this implies L1 convergence to an integrable . Passing to the limit in , using the contraction property of conditional expectation in L1 space, gives .
For every bounded stopping time , the same identity holds with : split an event of its stopping-time sigma-algebra according to and use the deterministic-time identity. In particular . These conditional expectations are uniformly integrable: for an integrable and , the event satisfies , andFirst choose , then , uniformly in . Define on . Now almost surely and in L1 space, so the bounded-time mean identities imply even when can be infinite.
Past exam of the mathematics course of the University of Cambridge 2008 iii Paper 34 6 Solution Created 2026-10-03 Updated 2026-10-14
A standard Brownian motion is a real stochastic process with almost surely, continuous sample paths almost surely, and independent increments such that has normal distribution whenever . With its completed, right-continuous natural filtration , its Strong Markov property is the following: for every almost-surely finite stopping time , the processis a standard Brownian motion independent of . Here the stopping-time sigma-algebra isIn particular, for every bounded -measurable random variable and bounded Borel functional on the continuous path space,Thus the independence is from the entire stopped past, not only from , and is a statement about the whole future path, not just a single increment.
To prove the Brownian reflection principle without assuming that a level is hit in finite time, fix , , and set and . Continuity of the sample paths makes a stopping time and gives whenever . The stopping time is bounded. Reflect the path after :By the Strong Markov property, the future increments after are an independent Brownian motion. Negating them preserves their probability distribution, by symmetry of their joint normal distributions. Hence the reflected process has the same path law as .
If , reflection changes nothing on and . If , both paths first hit at the same time and . Therefore, for , the following events agree path by path:Indeed, the right-hand endpoint is at least , so the reflected path must have hit before or at ; this also forces the original path to have done so. The reflection relation then makes the endpoint inequality equivalent to . Equality cases at satisfy the same relation. Since and have the same probability distribution,For , both sides are zero, because and .
For , set in this identity. Continuity implies , and the normal distribution of has no atom at . Splitting according to whether givesBoth random variables are nonnegative. Their tails agree for all , which determines their probability distributions, including the mass at zero. Thus the Brownian running maximum satisfies
For and , continuity again gives . Since is a standard normal random variable, the distribution function of the Brownian first-passage time isIt tends to one as and to zero as , proving almost-sure finiteness and absence of an atom at zero. For the standard normal random variable ,The value of this ratio on the zero-probability event may be defined arbitrarily. Matching the distribution functions provesFinally, differentiate the distribution function on , using and . The first-passage-time density isand is zero for . Its integral is one by the endpoint limits of , so no missing mass at an infinite hitting time is present.
Past exam of the mathematics course of the University of Cambridge 2009 iii Paper 101 3 a Solution Created 2026-10-03 Updated 2026-10-14
A discrete-time martingale relative to a filtration is an adapted process with andIterating conditional expectation also gives for . It is bounded in when each is square integrable andThis is a uniform bound on the second moments, not a pathwise bound on all sample values.
The optional stopping theorem for bounded stopping times says that, if for a deterministic finite , thenHere is the stopping-time sigma-algebra. The second assertion follows by taking and then expectations. An bound is not needed: integrability at the finitely many deterministic times suffices.
For a proof, both stopped values are integrable since . ExpandIf , then by the definition of the stopping-time sigma-algebra, and because is a stopping time. Thus the indicator of is -measurable. Multiplying the sum by , taking expectations, and conditioning each summand on gives zero, by the martingale increment property. Therefore for every . Since is -measurable, this is exactly the claimed conditional expectation identity.
Past exam of the mathematics course of the University of Cambridge 2015 iii Paper 29 1 iii Solution Created 2026-10-03 Updated 2026-10-06
Put . The stopped martingale in discrete time identityshows that is a martingale: the indicator function is -measurable and the increment has zero conditional expectation. Integrability follows because is selected from the finitely many integrable values .
For the bounded stopping time , the optional stopping theorem in its conditional form givesHere is the stopping-time sigma-algebra. Indeed, for , partition into and apply the martingale identity on each piece. This proves the displayed conditional expectation identity directly.
Let and . Conditional absolute-value domination and the Markov inequality give and, for any ,First choose using the uniform integrability of , and then choose . The estimate is uniform in , proving uniform integrability of a stopped uniformly integrable martingale. No finiteness assumption on is needed.
Past exam of the mathematics course of the University of Cambridge 2015 iii Paper 29 2 iii Solution Created 2026-10-03 Updated 2026-10-06
Recall the stopping-time sigma-algebra:For the proposed random time,The first set belongs to . Since , the second can be writtenwhich also belongs to . Therefore is a stopping time, as in pasting ordered stopping times. Moreover , so is a bounded stopping time.