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 2007 iii Paper 33 5 c Solution by
Codex 0 Created 2026-10-03 Updated 2026-10-14
Set and , , with . Both start at zero and are continuous. Increments of over consecutive disjoint time intervals are negatives of Brownian increments over corresponding disjoint past intervals, read in reverse order. They are independent centered normal random variables with covariance equal to the interval length times the identity. The same properties hold for using future increments. Every past increment is independent of all the future increments after deterministic time , so the two whole processes are independent, by finite-dimensional independence and generation by rational-time evaluations. They are the independent Brownian arms at a deterministic time.
Let and be their ranges. Pathwise,Although need not be independent of , this last equality uses only translation invariance of Lebesgue measure. Put for a standard Brownian motion started at zero. Independence of the centered processes and Tonelli theorem giveSince , it follows that for Lebesgue-almost every . ThereforeThe scaling relation in part (a) gives . A nonnegative random variable of expectation zero vanishes almost surely, proving the area of a planar Brownian path resultThe integral argument establishes the needed almost-everywhere spatial assertion; it does not require a prior theorem that individual points are polar.
Past exam of the mathematics course of the University of Cambridge 2007 iii Paper 33 5 b Solution by
Codex 0 Created 2026-10-03 Updated 2026-10-14
Path continuity makes each time-segment range compact and therefore Borel measurable. The membership event is jointly measurable in the sample and spatial variable: distance to the range equals the infimum of over a countable dense set of times. We may consequently apply the Tonelli theorem to its indicator.
Put , using the allowed integrability hypothesis. Since , finite-measure inclusion-exclusion and the preceding expectation identities giveFinally Tonelli theorem givesFiniteness of is what justifies the subtraction of expectations; an infinite-minus-infinite calculation would not establish this conclusion.
Past exam of the mathematics course of the University of Cambridge 2007 iii Paper 33 5 a Solution by
Codex 0 Created 2026-10-03 Updated 2026-10-14
Let and . For planar Brownian motion, the process is again standard Brownian motion. Thus its time- range has law . Two-dimensional Lebesgue measure scales by the square of the spatial factor, givingThe increments , , form another standard Brownian motion. Its range has the same law as , and translation by does not change its area. HenceThe equality concerns the laws of the areas. No independence between these two original areas is needed here.
Past exam of the mathematics course of the University of Cambridge 2007 iii Paper 33 4 c Solution by
Codex 0 Created 2026-10-03 Updated 2026-10-14
The Borel-Cantelli first lemma applied to that finite sum says that almost surely, for all sufficiently large ,For , both the Brownian running maximum and the positive function are nondecreasing. Thus eventuallyThis proves the lower limit bound one, with interpolation across all small real times rather than only the dyadic sequence.
For every positive integer , the function satisfies the same assumptions and integrability condition. Repeating the argument gives an eventual lower bound on a probability-one event. Take the countable intersection of these events. On it, the ratio is eventually at least any prescribed positive integer, proving the integral lower envelope for the Brownian maximum:
Past exam of the mathematics course of the University of Cambridge 2007 iii Paper 33 4 b Solution by
Codex 0 Created 2026-10-03 Updated 2026-10-14
Monotonicity of gives, for each ,Hence ; the additional term is finite by continuity at one. Also as , since a positive limiting lower bound would make the integral diverge.
By Brownian scaling, has law . Apply the small-value bound for the Brownian running maximum to obtainSumming yields the requested finite probability sum. The argument needs no independence of these nested-time events.
Past exam of the mathematics course of the University of Cambridge 2007 iii Paper 33 4 a Solution by
Codex 0 Created 2026-10-03 Updated 2026-10-14
For , reflect a Brownian path after its first hitting of . The Strong Markov property and symmetry preserve its law and exchange the events and . The terminal equality event has probability zero, so the Brownian reflection principle givesContinuity of this distribution also gives no atom at zero. ThereforeA useful global bound follows from the maximum of the standard normal distribution density:
Past exam of the mathematics course of the University of Cambridge 2007 iii Paper 33 3 d Solution by
Codex 0 Created 2026-10-03 Updated 2026-10-14
Let . Continuity makes each displacement equal to or . Reflection symmetry of a fresh Brownian motion gives probability one half to each sign, and the Strong Markov property makes these signs independent across successive exits. Thus .
For the normalized position, the characteristic function issince near zero. By the Lévy continuity theorem, this provesThis is the Gaussian limit of a Brownian exit skeleton.
Compare along the subsequence with . Joint Brownian scaling of the successive exits givesThe right-hand side converges weakly to . The preceding part and path continuity give almost surely on the original Brownian probability space. Hence its weak limit is also the law . Uniqueness of the weak limit forces , so finally . Independence of the position and its random clock was not assumed in this comparison.
Past exam of the mathematics course of the University of Cambridge 2007 iii Paper 33 3 c Solution by
Codex 0 Created 2026-10-03 Updated 2026-10-14
At each finite stopping time , the Strong Markov property says that is a standard Brownian motion independent of the past sigma-algebra. Its exit time from is exactly . By induction the stopping times are finite almost surely, and these durations are independent with common law , not merely identically distributed. This is the Brownian exit-time skeleton.
Put , which follows from the moment estimate. Brownian scaling gives . Forthere are independent durations of mean and variance . ConsequentlyFor each , Chebyshev's inequality givesApply the Borel-Cantelli first lemma for a countable sequence of positive errors tending to zero. We obtain the Brownian exit-skeleton clock convergence:No independence between the clocks for different values of is required.
Past exam of the mathematics course of the University of Cambridge 2007 iii Paper 33 3 b Solution by
Codex 0 Created 2026-10-03 Updated 2026-10-14
The process is standard Brownian motion, by Brownian scaling. Its first exit from occurs at , soThe first part ensures integrability. Set ; it is finite and strictly positive because path continuity at zero gives almost surely. ThereforeWe keep unspecified until the comparison of limits requested below.
Past exam of the mathematics course of the University of Cambridge 2007 iii Paper 33 3 a Solution by
Codex 0 Created 2026-10-03 Updated 2026-10-14
If , all the integer-time positions through lie in , so every increment over an intervening unit interval has absolute value at most two. The unit-time increments of Brownian motion are independent standard normal random variables. PutThe inclusion of events and independence giveIn particular is finite almost surely. For real , its tail is at most . The tail integral formula for moments therefore gives, for every ,An exponential geometric factor dominates the polynomial factors in this sum. This proves the requested moment finiteness for , and in fact for every positive .
Past exam of the mathematics course of the University of Cambridge 2007 iii Paper 33 2 c Solution by
Codex 0 Created 2026-10-03 Updated 2026-10-14
If , the strict inequality in question already fails at time zero, almost surely, since . Its probability is therefore zero, as required. Assume for the rest that , so .
Before time one the boundary inequality is equivalent to . The process increases continuously between arrivals and has only downward jumps. Its first time of reaching level one must consequently be a continuous crossing, except possibly if an arrival occurs at the very same instant. All possible first crossing times belong to the finite deterministic setA uniform arrival hits none of these times almost surely. Thus on . This finite candidate set also proves the stopping-time property directly: determining whether a crossing has occurred by time only uses the arrival history up to . The boundary set always contains time one because , so .
For a deterministic , the martingale is bounded on by . The optional stopping theorem for a bounded stopping time therefore givesMoreover : if its value is one, and otherwise no crossing has yet occurred. As , the stopped value tends to one on and to zero on , because after the last arrival the unstopped process is zero. Dominated convergence now givesThis is the finite-jump boundary crossing identity. It uses uniform integrability of the bounded stopped values, not uniform integrability of the original family, which fails.
Past exam of the mathematics course of the University of Cambridge 2007 iii Paper 33 2 b Solution by
Codex 0 Created 2026-10-03 Updated 2026-10-14
Since there are finitely many arrival times and each is strictly below one almost surely, almost surely. For every with , all weights have arrived and . Therefore almost surely as .
Nevertheless for every . If the family were uniformly integrable, its almost-sure convergence along any deterministic sequence tending to one would imply convergence in , and hence convergence of expectations to zero. This is impossible. Thus the martingale is not uniformly integrable. Its constant expected mass is carried by increasingly rare, late arrivals.
Past exam of the mathematics course of the University of Cambridge 2007 iii Paper 33 2 a Solution by
Codex 0 Created 2026-10-03 Updated 2026-10-14
Write the residual process asFor , the filtration tells us whether each has arrived by time , and its exact arrival time if it has. On , its conditional law is uniform on . Independence of the original means that the histories of the other arrivals do not alter this law. HenceThis conditional identity can also be checked against products of bounded functions of the censored arrival times and extended to by the Monotone class theorem. Summing the identity gives .
Each is adapted and integrable, withIts paths are smooth between the finitely many arrival times and have downward jumps of size at arrivals before time one. The indicators use , so the value at a jump is the post-jump value: paths are right continuous with finite left limits on . Thus is a càdlàg martingale, specifically the uniform-arrival residual mass martingale.
Past exam of the mathematics course of the University of Cambridge 2007 iii Paper 33 1 b Solution by
Codex 0 Created 2026-10-03 Updated 2026-10-14
The martingale convergence theorem in the form needed here states that a nonnegative supermartingale with uniformly bounded expectations converges almost surely to a finite integrable limit. Here for all , so it applies to . The ordinary Fatou lemma givesFor fixed , apply the Conditional Fatou lemma to the nonnegative variables , . The martingale property makes each equal to , henceThe inequality is simultaneous for all after removing a countable union of null sets. Equality of expectations in the limit has not been assumed; it can fail for a measure with a singular component.
Past exam of the mathematics course of the University of Cambridge 2007 iii Paper 33 1 a Solution by
Codex 0 Created 2026-10-03 Updated 2026-10-14
Use the filtered probability space , with its half-open dyadic intervals. Complete the initial definition by putting . This is the same cell-average formula at level zero, where the only cell is .
The function is -measurable and nonnegative. Its expectation isEvery parent cell is the disjoint union of its two half-open child cells. On , the conditional expectation of is its cell average:Thus , including at . This proves that is a nonnegative martingale, specifically the dyadic density martingale. The half-open endpoints are essential to the disjoint partition for an arbitrary measure, which may have atoms.
Past exam of the mathematics course of the University of Cambridge 2007 iii Paper 31 1 f Solution by
Codex 0 Created 2026-10-03 Updated 2026-10-14
For the uniform 27-symbol model, . The uniform-source Huffman length distribution givesThus five symbols receive four-bit codewords and the other 22 receive five-bit codewords. To realize these lengths, start with all 32 binary words of length five and collapse any five disjoint sibling pairs into their four-bit parents. This leaves exactly five leaves at depth four and 22 at depth five. All source letters have the same probability, so which five letters receive the shorter codewords is arbitrary.
Past exam of the mathematics course of the University of Cambridge 2007 iii Paper 31 1 e Solution by
Codex 0 Created 2026-10-03 Updated 2026-10-14
A full binary tree has Kraft sum one. For example, place mass one at the root and divide each internal vertex's mass equally between its children; a leaf at depth receives , and the total mass on leaves remains one. Using part d gives the two equationsMultiplying the second equation by and subtracting the first gives the uniform-source Huffman length distributionIf , the first number is zero and every codeword has length . Otherwise both levels occur. The corresponding mean length is .
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





