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 2008 iii Paper 34 4 e Solution by
Codex 0 Created 2026-10-03 Updated 2026-10-14
For the simple symmetric random walk, the moment-generating function isFor a given , choose the unique satisfying . The transform in part (d) becomes . To express this in terms of , put . The equation gives . Its smaller root is the one in , soThe second expression follows by rationalizing the first root. As the transform tends to one, consistent with the almost-sure finiteness proved in part (c).
Past exam of the mathematics course of the University of Cambridge 2008 iii Paper 34 4 d Solution by
Codex 0 Created 2026-10-03 Updated 2026-10-14
The stopped martingale is a martingale. For completeness, the bounded-time stopping rule follows directly fromwhose conditional expectation given is zero. Integrability at each fixed follows by expressing the stopped value as a finite sum of the integrable restricted to disjoint events. Therefore .
The crucial bound is deterministic. Since and ,A bounded family is uniformly integrable: for all its quantities vanish. Part (c) gives almost surely, and then . HenceThe general result for passing to expectations is the dominated convergence theorem: almost-sure convergence under one integrable bound implies convergence in L1 and convergence of expectations. Applying it with the bound givesThis is the exponential first-passage transform for an upward skip-free random walk; it avoids an unjustified use of optional stopping at an unbounded stopping time.
Past exam of the mathematics course of the University of Cambridge 2008 iii Paper 34 4 c Solution by
Codex 0 Created 2026-10-03 Updated 2026-10-14
The hitting time is a stopping time for the natural filtration, because . The integer-valued increments are at most one. A path started at zero therefore cannot reach or exceed without first visiting , soDefine . It is nonnegative and integrable: . Moreover,The indicator function is -measurable, and is independent of with zero expected value. Taking conditional expectation therefore proves directly that is a nonnegative martingale.
The general result used here is that a nonnegative discrete-time martingale has a finite almost-sure limit; this is the martingale convergence theorem, since bounds its L1 norm. On it follows that converges finitely. A convergent sequence of integers is eventually constant, so would eventually be zero on this event.
However, the independent events all have the same strictly positive probability. The second Borel-Cantelli lemma says that they occur infinitely often almost surely. This contradicts eventual constancy on any positive-probability subset of . ThusNotice that no lower bound on the negative increments was needed.
Past exam of the mathematics course of the University of Cambridge 2008 iii Paper 34 4 b Solution by
Codex 0 Created 2026-10-03 Updated 2026-10-14
Here , so for every ,The Jensen inequality for the strictly convex exponential function givesIn fact the inequality is strict: and exclude a constant random variable. In particular, as required.
For , independence and identical distribution giveThus is positive, integrable with mean one, and adapted to the natural filtration. Conditioning on the next increment givesConsequently This is the exponential martingale of a random walk.
Past exam of the mathematics course of the University of Cambridge 2008 iii Paper 34 4 a Solution by
Codex 0 Created 2026-10-03 Updated 2026-10-14
Put and take to be the trivial sigma-algebra. Each is measurable with respect to the natural filtration , andIndependence of from makes its conditional expectation equal to its expected value, which is zero. HenceThe measurability, integrability and conditional expectation conditions are all verified, so
Past exam of the mathematics course of the University of Cambridge 2008 iii Paper 34 3 c Solution by
Codex 0 Created 2026-10-03 Updated 2026-10-14
The martingale property gives . Both and are square-integrable, so their product is integrable by the Cauchy-Schwarz inequality. Using the -measurability of in conditional expectation givesThe pull-out step for the possibly unbounded can be justified by first truncating it, then passing to the limit in the L2 norm and using the Cauchy-Schwarz inequality. Expanding the square now yieldsThe left side is nonnegative. Thus is nondecreasing and bounded above by , and so . For ,By symmetry of the norm difference this proves that is a Cauchy sequence in the L2 space. The completeness established in part (a) gives an withThis is the L2-bounded martingale convergence theorem, derived from martingale-difference orthogonality and completeness. The same sequence also converges almost surely by part (b), since ; uniqueness of a limit in probability identifies that limit with this .
Past exam of the mathematics course of the University of Cambridge 2008 iii Paper 34 3 b Solution by
Codex 0 Created 2026-10-03 Updated 2026-10-14
A filtration on a probability space is an increasing sequence of sigma-algebras contained in : . A real stochastic process is a martingale for this filtration if is -measurable, , andThe first condition is adaptedness; the tower property of conditional expectation then gives whenever .
The almost-sure martingale convergence theorem states that if a real martingale satisfies , then some integrable random variable satisfies almost surely. The more general almost sure submartingale convergence theorem needs only for a submartingale. In particular, a nonnegative martingale converges to a finite integrable limit almost surely, because its expected value is constant. Mere boundedness in the L1 norm does not imply convergence in L1. The stronger uniformly integrable martingale convergence theorem gives both almost-sure convergence and convergence in L1 when the martingale is uniformly integrable.
Past exam of the mathematics course of the University of Cambridge 2008 iii Paper 34 3 a Solution by
Codex 0 Created 2026-10-03 Updated 2026-10-14
The real L2 space on a probability space consists of equivalence classes of measurable functions satisfying , where two random variables represent the same element if they are equal almost surely. Its norm isPassing to equivalence classes makes this a genuine norm: exactly when almost surely. The Minkowski inequality gives the triangle inequality.
Let be a Cauchy sequence in this norm. Choose an increasing sequence of indices such thatThis is possible by choosing beyond a Cauchy threshold for tolerance . Set . The Cauchy-Schwarz inequality on a probability space gives . By Tonelli theorem,Thus the series of absolute differences is finite almost surely. Define on this probability-one event, and give it the value zero on its complement. It is a measurable function, and almost surely.
For , the Minkowski inequality givesApply the Fatou lemma to the squared difference as . It follows thatIn particular , and therefore by the Minkowski inequality. This proves convergence in L2 of the subsequence. To recover the entire sequence, for a prescribed choose a Cauchy threshold for , then choose with and . For every ,Hence , proving completeness of Lp spaces for without assuming the desired completeness in the argument.
Past exam of the mathematics course of the University of Cambridge 2008 iii Paper 34 2 c Solution by
Codex 0 Created 2026-10-03 Updated 2026-10-14
For and , let . Symmetry of the standard normal distribution and the Mills ratio asymptotic just proved giveFor the series of these probabilities converges, since its terms are eventually bounded by a constant times the convergent p-series . For it diverges: choose strictly between and one, and use for sufficiently large , reducing to the divergent p-series . At it still diverges, as the integral test givesFor , the first Borel-Cantelli lemma makes occur only finitely often. For , independence of the random variables makes the events independent, so the second Borel-Cantelli lemma makes them occur infinitely often almost surely. Apply these conclusions simultaneously at for positive integers , and at . On the resulting probability-one event, the limit superior is at most every and at least two. Therefore the Gaussian sample limsup at logarithmic scale is
Past exam of the mathematics course of the University of Cambridge 2008 iii Paper 34 2 b Solution by
Codex 0 Created 2026-10-03 Updated 2026-10-14
Write , where is the standard normal density. For , and integration by parts yieldThe boundary term at infinity vanishes. The remainder is nonnegative and is at most , soDividing by the positive quantity gives lower and upper bounds and . The squeeze theorem proves the Mills ratio asymptotic
Past exam of the mathematics course of the University of Cambridge 2008 iii Paper 34 2 a Solution by
Codex 0 Created 2026-10-03 Updated 2026-10-14
For events , define their limit superior byIt is the event that infinitely many occur. The two Borel-Cantelli lemmas are as follows: if , then , without any independence assumption; if the are independent and , then .
For the first assertion, the union bound gives, for every ,The tail of a convergent nonnegative series tends to zero, proving the first Borel-Cantelli lemma.
For the second assertion, independence and for giveBy continuity of probability, . The event that only finitely many occur is the countable union of these zero-probability events over . Its probability is zero. This proves the second Borel-Cantelli lemma, and hence both requested assertions:
Past exam of the mathematics course of the University of Cambridge 2008 iii Paper 32 2 ii Solution by
Codex 0 Created 2026-10-03 Updated 2026-10-14
Write , and . The Eisenstein criterion at gives , whereas the prime cyclotomic field degree gives . The splitting field is a Galois extension of , and an automorphism fixing sends to . Thus its Galois group embeds in . It is nontrivial, since cannot be contained in the degree-four field . Therefore and .
Index the five roots by , with root . Every automorphism has the form , and acts on indices as , with . This is a faithful inclusion of into the affine group over a finite field, and both groups have order , so it is an isomorphism. This is the affine Galois group of a prime-radical splitting field.
Let be the specified decomposition group. Its nonidentity element is an involution. If its linear coefficient were , it would be a nontrivial translation, which has order . Hence it acts as . There is exactly one fixed root, at , and the other four roots form two pairs. By involution orbits in an affine group of odd prime degree, has three orbits on the five roots. Those roots identify with , so the double-coset formula gives three primes in .
For , the embeddings identify with . The image of is and acts by multiplication, giving the two orbits and . ThereforeThe orbit argument counts primes whether or not is ramified; cyclicity of the given order-two decomposition group does not require that it be generated by an unramified Frobenius element.
Past exam of the mathematics course of the University of Cambridge 2008 iii Paper 32 2 i Solution by
Codex 0 Created 2026-10-03 Updated 2026-10-14
Write and fix a prime ideal above . Suppose there is another prime above outside the -orbit of . Distinct nonzero prime ideals in the ring of integers are distinct maximal ideals, hence pairwise comaximal. The Chinese remainder theorem supplies satisfying and for every . Its field norm isThe factor puts in , hence in . But every is congruent to modulo , since . Thus , contradicting . This proves transitivity of the Galois action on primes without any unramified hypothesis.
Let be the decomposition group and . Transitivity identifies the primes of above with the coset space . Two such primes contract to the same prime in exactly when they are in the same -orbit: apply the transitivity just proved to the Galois extension . Therefore primes in an intermediate field as double cosets givesThe second equality follows by inversion of representatives. It allows one to count -orbits on the embeddings of into , represented by . If is normal, this simplifies to ; the double-coset formulation also handles nonnormal intermediate fields.
Past exam of the mathematics course of the University of Cambridge 2008 iii Paper 32 1 iii Solution by
Codex 0 Created 2026-10-03 Updated 2026-10-14
Put and . The Eisenstein criterion at shows that is an irreducible polynomial, so . Its derivative is , and the polynomial discriminant isThe discriminant-index formula for an integral lattice implies that the field discriminant has no prime divisor outside . By the discriminant obstruction to ramification, every other prime is unramified.
To prove that neither candidate disappears through an index correction, let lie above and normalize its valuation to have value group . If , the relation givesIn both cases . The fundamental identity for prime decomposition, , now forces exactly one prime ideal above each candidate, with and . This is ramification forced by a coprime root valuation; at it avoids an invalid direct application of the Eisenstein criterion, since . Hence
Past exam of the mathematics course of the University of Cambridge 2008 iii Paper 32 1 ii Solution by
Codex 0 Created 2026-10-03 Updated 2026-10-14
The polynomial discriminant satisfiesA polynomial has no repeated roots over the algebraic closure exactly when it is coprime to its derivative. Consequently the assumed squarefree reduction has nonzero resultant with its derivative, so . On the other hand the power basis is a basis of the order in a number field , and the discriminant-index formula for an integral lattice givesHere the field discriminant is an integer. ThereforeThis is squarefree reduction excludes a prime from the power-basis index; its argument establishes the index condition before applying the Kummer-Dedekind theorem.
Past exam of the mathematics course of the University of Cambridge 2008 iii Paper 32 1 i Solution by
Codex 0 Created 2026-10-03 Updated 2026-10-14
Let , where is an algebraic integer with monic minimal polynomial , and put . The Kummer-Dedekind theorem applies to a prime number with . Write its reduction as a product of polynomial factors over :where the are distinct monic irreducible polynomials, choose monic integral lifts . Then the distinct prime ideals above are , andThus the multiplicity of a factor is its ramification index of a prime ideal, and its degree is the residue degree. The hypothesis on the order in a number field is essential: one cannot infer prime ideal factorization from an arbitrary defining polynomial at a prime dividing its index. There is also a relative version over a base number field : if and agree after localization at , factor the minimal polynomial over and use with the same conclusions.
Past exam of the mathematics course of the University of Cambridge 2008 iii Paper 3 5 iv Solution by
Codex 0 Created 2026-10-03 Updated 2026-10-14
Use the same nonsemisimple matrix from part (i) and the one-dimensional Lie subalgebraIt is a Lie subalgebra because for all scalars . Its Jordan–Chevalley decomposition has and . If , comparing off-diagonal entries forces , which contradicts the diagonal entries. If , taking traces gives , again forcing although . ThusThe semisimplicity assumption on the Lie algebra in part (ii) is therefore essential.
Past exam of the mathematics course of the University of Cambridge 2008 iii Paper 3 5 iii Solution by
Codex 0 Created 2026-10-03 Updated 2026-10-14
A complex semisimple Lie algebra has zero centre, so its Adjoint representation is faithful. Its absolute Jordan decomposition is the unique expression with , diagonalizable and nilpotent. Existence follows by applying part (ii) to the adjoint embedding, and uniqueness follows from uniqueness of the matrix Jordan–Chevalley decomposition. The representation-compatibility theorem states that for every finite-dimensional Lie algebra representation , and are respectively the semisimple and nilpotent parts of . Thus these parts are intrinsic to the Lie algebra, independent of a chosen matrix embedding, and their semisimplicity and nilpotence are preserved in every finite-dimensional representation.
Past exam of the mathematics course of the University of Cambridge 2008 iii Paper 3 5 ii Solution by
Codex 0 Created 2026-10-03 Updated 2026-10-14
We prove closure using complete reducibility of semisimple Lie algebra representations, rather than assuming that a Lie subalgebra is closed under polynomials in its elements. Write the matrix Jordan–Chevalley decomposition as . On , the commutator operator is diagonalizable: if has eigenspaces , then its eigenvalue on is . The operator is nilpotent: if , thenThe two operators commute because . Uniqueness of the Jordan–Chevalley decomposition therefore says that is the semisimple part of . Since a matrix's semisimple part is a polynomial in that matrix, and is invariant under , it follows thatNow regard as a Lie algebra representation of under commutators. By complete reducibility of semisimple Lie algebra representations, there is an invariant complement with . Write , with and . For , the normalization property gives , while invariance of gives . Thus : commutes with the whole Lie algebra.
Decompose into irreducible -modules. Each is preserved by , hence by its polynomial parts , and also by ; therefore it is preserved by . By the Schur lemma, . A semisimple Lie algebra is a perfect Lie algebra, so every element is a sum of Lie brackets and has trace zero on every finite-dimensional representation. Consequently . Also is nilpotent, so it has trace zero; henceThus every is zero, , and . Finally . We have proved
Past exam of the mathematics course of the University of Cambridge 2008 iii Paper 3 5 i Solution by
Codex 0 Created 2026-10-03 Updated 2026-10-14
The Jordan–Chevalley decomposition is characterized byOver , a semisimple linear operator is a diagonalizable one. These conditions determine the two parts uniquely. Concretely, on the generalized eigenspace for an eigenvalue , the semisimple part is and the nilpotent part is ; both are polynomials in . To see uniqueness, any commuting candidate parts preserve each generalized eigenspace; diagonalize the proposed semisimple part there, and nilpotence then forces its eigenvalue to be the sole eigenvalue of on that space.
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





