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 2005 iii Paper 34 5 c Solution by
Codex 0 Created 2026-10-03 Updated 2026-10-14
Start at with all , and let be the first zero of the th coordinate. The orthant exit time is . The coordinate processes are independent, soHere the Brownian reflection principle gives ; is the standard normal distribution function. Since as ,The tail integral formula for expectation, , has a bounded integrand on and converges at infinity exactly when . Therefore the Brownian exit-time expectation in an orthant givesThe divergence for is logarithmic; almost-sure finiteness of the exit time does not imply a finite expectation.
Past exam of the mathematics course of the University of Cambridge 2005 iii Paper 34 5 b Solution by
Codex 0 Created 2026-10-03 Updated 2026-10-14
Allow to take the value . Fix a closed ball , independently choose a radius with density on , and let be the first time the Brownian motion from reaches that radius. Conditional on , the Strong Markov property at decomposes the remaining Brownian exit time from . Since and the conditional exit time has mean , Tonelli's theorem and part (a) give the Brownian exit-time ball averaging identityThis identity is valid in the extended nonnegative reals; no finiteness was assumed to derive it.
If , the integral over is finite. For any choose with . The same identity at has a finite right side because its integral is over a subset of the integrable ball. Thus . The set is therefore open relative to .
It is also relatively closed. If converges to , choose with . For large , , and . The preceding argument shows that every point in , including , belongs to . Hence is closed in . Since is nonempty and is connected, for every . This proves finiteness propagation of Brownian mean exit times without assuming beforehand that solves a smooth Poisson equation.
Past exam of the mathematics course of the University of Cambridge 2005 iii Paper 34 5 a Solution by
Codex 0 Created 2026-10-03 Updated 2026-10-14
Let . Uniform volume measure on the unit ball gives , , hence radius density . Conditional on , independence leaves a standard Brownian motion. Its exit time from the radius- ball is finite: applying optional stopping to stopped at that exit and then letting gives .
The probability law of the exit point is invariant under every orthogonal transformation, because both Brownian motion and the centred sphere are invariant under those transformations. The unique invariant probability on that sphere is normalized surface measure; for it is the equally weighted pair . This is also the conditional angular law of given . Mixing these identical conditional laws against proves the uniform ball sampling by Brownian stopping identityThe event has probability zero and causes no difficulty. Independence of permits its value to be included in the initial filtration, making a stopping time.
Past exam of the mathematics course of the University of Cambridge 2005 iii Paper 34 4 c Solution by
Codex 0 Created 2026-10-03 Updated 2026-10-14
Continue with equal to the integral defined in the PDF and . Until the Brownian motion hits the radius- ball, is a bounded local martingale, hence a true martingale. At the finite stopping time , optional stopping givesRearranging,The fixed random variable is integrable by the Gaussian heat kernel and the local-integrability calculation above. Also . For any , the final expectation is at mostFirst send , then , proving that it vanishes. The identities from part (b) giveSubtracting yields the small-ball Brownian hitting asymptoticThus the constant in this printed limit requires exactly the same reciprocal correction as in part (b). For the multiplier is , not . The argument proves the corrected finite-time limit directly, rather than inferring it from the eventual hitting probability alone.
Past exam of the mathematics course of the University of Cambridge 2005 iii Paper 34 4 b Solution by
Codex 0 Created 2026-10-03 Updated 2026-10-14
To keep the normalization visible, denote the integral defining the printed constant by . Substituting gives, for ,This is the Newtonian potential of the Brownian heat kernel. The singularity at zero is locally integrable in dimension , since its radial integral behaves like . All integrands are nonnegative, so Tonelli's theorem permits both orders of integration.
Integrating in first givesIntegrating in first uses the Gaussian heat kernel convolution. Completing the square in givesConsequently , and the actual identity isThe original PDF uses rather than as the multiplier while defining its constant to equal . That formula is false. For example , so the required multiplier in dimension three is . Equivalently, as at , the left side tends to , whereas the printed right side tends to . One can retain the printed form only by defining its multiplier as .
Past exam of the mathematics course of the University of Cambridge 2005 iii Paper 34 4 a Solution by
Codex 0 Created 2026-10-03 Updated 2026-10-14
Write . For a radial function , the Laplacian isThus is a harmonic function off zero. Fix and stop Brownian motion when it reaches either sphere of radius or , at time . This exit time is finite: stopping the martingale at yields , and monotone convergence applies. By Itô's formula, is a bounded martingale. Optional stopping and dominated convergence therefore giveThe events increase to as : a continuous path up to any finite hitting time is bounded. Since , , proving the Brownian hitting probability of a ball
Past exam of the mathematics course of the University of Cambridge 2005 iii Paper 34 3 b Solution by
Codex 0 Created 2026-10-03 Updated 2026-10-14
First construct a centred Gaussian process on the countable dyadic set with covariance function . These consistent finite-dimensional normal distributions exist because, for coefficients ,the Kolmogorov extension theorem realizes them on one probability space. Every increment has the normal distribution , so for every finite ,Use the preceding estimate with , and . It yields an almost surely Hölder continuous extension from the dense dyadic set to . Approximate arbitrary times by dyadic times; continuity of the paths and of the Gaussian covariance function preserves all finite-dimensional laws. Disjoint increments are jointly Gaussian with zero cross-covariances, hence independent, with the required variances. Together with and continuity, this constructs Brownian motion.
For any , choose large enough. Taking a countable increasing sequence of exponents tending to gives simultaneous Hölder regularity of every order on a common probability-one set; the same argument on each compact time interval gives local Brownian Hölder regularity. This method does not give the endpoint exponent. In fact that endpoint fails: if a path had a finite -Hölder seminorm , all its adjacent normalized increments at level would have magnitude at most . These are independent standard normal random variables, so for a fixed integer the probability that their maximum is at most is . The event of a finite is contained in the union over of events with this bound at every level, each of probability zero. Thus Brownian paths are not -Hölder continuous on almost surely.
Past exam of the mathematics course of the University of Cambridge 2005 iii Paper 34 2 c Solution by
Codex 0 Created 2026-10-03 Updated 2026-10-14
The dyadic slope martingale is uniformly bounded by . The martingale convergence theorem gives an almost-sure limit , and dominated convergence gives L1 convergence. Define on the null exceptional set and at the endpoint. This gives a measurable representative with everywhere.
If are dyadic rationals, then for every sufficiently fine grid the integral telescopes:Pass to the limit by L1 convergence. For arbitrary endpoints choose dyadic , with . The error in the integrals is at most , and Lipschitz continuity controls the error in the endpoint values by the same expression. ThereforeThis constructs the bounded integral density directly, without assuming in advance that a Lipschitz function has an almost everywhere derivative.
Past exam of the mathematics course of the University of Cambridge 2005 iii Paper 34 2 b Solution by
Codex 0 Created 2026-10-03 Updated 2026-10-14
Take with its Borel sigma-algebra and Lebesgue measure of total mass one. Let be the finite sigma-algebra generated by the half-open dyadic intervals of length . Set if the indexing begins at one. Each is adapted to this filtration, and if is a Lipschitz constant of , then , so every coordinate is integrable.
On a parent interval , conditional expectation averages the two equally likely child values. Their average isThus , establishing the dyadic slope martingale. One can equivalently include as a separate null atom without changing any probability law.
Past exam of the mathematics course of the University of Cambridge 2005 iii Paper 34 2 a Solution by
Codex 0 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 iii Paper 34 1 d Solution by
Codex 0 Created 2026-10-03 Updated 2026-10-14
The exact condition is again , with the terminal almost-sure limit used to define when . In that case , andproves uniform integrability. The preceding unbounded optional stopping argument yields .
For necessity, suppose . For every fixed , the normal distribution of gives . Hence , and intersecting over positive integer shows . Unboundedness above is unchanged by altering finitely many of the independent , because that changes all sufficiently late sums by one finite constant. It is therefore a tail event; the Kolmogorov zero-one law makes its probability one. Consequently almost surely and . Its expectation is at least one, possibly infinite, and cannot equal zero. This proves the necessity assertion in threshold stopping of an independent Gaussian series.
Past exam of the mathematics course of the University of Cambridge 2005 iii Paper 34 1 c Solution by
Codex 0 Created 2026-10-03 Updated 2026-10-14
With the natural filtration , the sums form a martingale. Put . Independence and the characteristic function of a standard normal random variable giveIf almost surely with a finite limit, dominated convergence gives convergence of these characteristic functions to . If , that limit would be at zero and at every nonzero . A characteristic function is continuous at zero: apply dominated convergence to as . This contradiction provesThis is also sufficient by the L2-bounded martingale convergence theorem, since . Thus the almost sure convergence criterion for an independent Gaussian series is an equivalence.
Past exam of the mathematics course of the University of Cambridge 2005 iii Paper 34 1 b Solution by
Codex 0 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 2005 iii Paper 33 4 b Solution by
Codex 0 Created 2026-10-03 Updated 2026-10-14
Use the homogeneous weight enumerator conventionThus records ones, records zeros, and the ordinary weight enumerator is . For a binary linear code of dimension and its dual code , the MacWilliams identity isor, equivalently, . The second form applies the first to the dual and uses .
One can verify the variable order directly from the character identity . If is not orthogonal to , translation by a codeword having odd inner product pairs positive and negative terms, giving zero; otherwise all terms are one. After multiplying by and summing over , coordinate contributes when , and when . Their product is exactly the stated substitution.
For a Hamming code with , its dual is the binary simplex code, generated by the rows of the usual parity-check matrix . There are dual words. A nonzero message produces the evaluations as runs over all nonzero vectors of . Exactly of them are one: the nonzero linear functional takes each value equally often on the whole vector space, and removing zero removes a zero value only. This proves the constant weight of a binary simplex code.
Put , so . The dual enumerator is therefore . Applying the MacWilliams identity gives the Hamming code weight enumeratorIn one variable this isFor example, gives ; gives . For , the expression is , agreeing with the singleton code. Setting in the homogeneous formula gives , the correct number of codewords.
Past exam of the mathematics course of the University of Cambridge 2005 iii Paper 33 4 a Solution by
Codex 0 Created 2026-10-03 Updated 2026-10-14
Let the distinct codewords be . No linearity assumption is needed. Sum their Hamming distances over unordered distinct pairs:Each summand is at least the minimum Hamming distance , so .
For coordinate , let be the number of codewords whose th bit is . Exactly unordered pairs differ at that coordinate. Summing coordinate contributions givessince . Combining the two bounds and dividing by gives , hence . Under , division is legitimate, proving the Plotkin boundBecause is an integer, it also satisfies the floor of the right-hand side. The binary alphabet is essential to the coordinate count; this proof applies to arbitrary binary block codes, not just linear ones.
Past exam of the mathematics course of the University of Cambridge 2005 iii Paper 32 4 iii Solution by
Codex 0 Created 2026-10-03 Updated 2026-10-14
For a rank-zero example, take , with rational two-torsion . Its two-isogeny formula companion is . The prime-support bound in two-isogeny descent allows only on ; all nonzero affine are positive because is a square. Hence . For the possible classes are , all realized: gives , gives , and give . ThereforeThis is the rank-zero elliptic curve with cubic x cubed plus x certificate; no unresolved locally soluble covering is being counted as soluble.
For a positive-rank example, take . Its companion is . The first image is contained in . The identity gives , gives , and gives ; multiplicativity of the square-class group homomorphism also gives . Thus has all four classes. On , the same prime-support bound allows , but is nonnegative only for , eliminating the negative classes. The identity gives and gives , so . ConsequentlyThe rank-one elliptic curve with cubic x cubed minus twice x therefore supplies the required positive-rank example. The exhibited point is itself nontorsion: doubling gives , whose nonintegral coordinates contradict the Nagell–Lutz theorem if it were torsion. No assertion that this point generates the full free part is needed for the rank calculation.
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





