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 33 3 c Solution by
Codex 0 Created 2026-10-03 Updated 2026-10-07
Interpret the second process as an independent copy of the unit-rate Poisson process. First, the sums are finite almost surely. On there are finitely many arrivals, none at , so their inverse-square contributions are finite. On ,For completeness, this expectation identity follows first for nonnegative simple functions from , and then for all nonnegative measurable functions by monotone convergence. Thus no unproved Poisson-integral formula is needed, and the tail sum is finite almost surely.
By (b), merging the two processes produces a rate- Poisson process with arrival times . Its rescaled arrivals form a unit-rate Poisson process: for a measurable set , their count is the merged count on , with parameter , and disjoint-set independence is preserved. ConsequentlyTherefore . This is the scaling of an inverse-power sum over Poisson arrivals with exponent .
Past exam of the mathematics course of the University of Cambridge 2012 iii Paper 33 3 b Solution by
Codex 0 Created 2026-10-03 Updated 2026-10-07
For a measurable with , independence of the two Poisson random measures givesThus its count has the Poisson distribution with the summed parameter. If are disjoint, the variables within each family of counts are independent, and independence of and makes the two families independent of each other. Hence the pairs , and therefore their sums, are independent over .
Adding sample counting measures preserves countable additivity. The definition in (a) therefore provesThis proves the required Superposition theorem for Poisson point processes directly from count distributions.
Past exam of the mathematics course of the University of Cambridge 2012 iii Paper 33 3 a Solution by
Codex 0 Created 2026-10-03 Updated 2026-10-07
On a measurable space with a sigma-finite measure , a Poisson random measure is a random counting measure such that has the Poisson distribution with parameter for every measurable of finite intensity, and the counts on finitely many pairwise disjoint measurable sets are independent. The sample measures are countably additive; repeated atoms are allowed if the intensity has atoms.
When , exhaustion by finite-intensity subsets gives almost surely. Indeed their counts increase, and the Poisson distribution probability of a count at most any fixed integer tends to zero as the parameter tends to infinity. Independent Poisson counts on disjoint sets, with means prescribed by , characterize the Poisson random measure.
Past exam of the mathematics course of the University of Cambridge 2012 iii Paper 33 2 c Solution by
Codex 0 Created 2026-10-03 Updated 2026-10-07
The transformation of the uniform distribution gives, for ,Thus has a Pareto distribution with lower endpoint and shape . It has mean , but no positive exponential moments, so the preceding version of the Cramér theorem is unavailable.
At , the event in question is certain. For every fixed and all sufficiently large , positivity of the summands gives the one-big-jump polynomial lower boundTaking logarithms and dividing by gives an upper bound and a lower bound . HenceThis covers thresholds below, at and above the mean. Above the mean it means decay is slower than exponential speed , not that the tail probability tends to .
Past exam of the mathematics course of the University of Cambridge 2012 iii Paper 33 2 b Solution by
Codex 0 Created 2026-10-03 Updated 2026-10-07
For the unit-rate exponential distribution, direct integration givesFor , maximizing gives , and therefore . For the supremum is infinite, as seen by taking .
For , is increasing on , and its continuity gives . The closed-set upper bound and open-set lower bound of the Cramér theorem squeeze the desired limit to . For , both infima are , because and as . For , the strong law of large numbers gives almost surely, so the tail probability tends to ; at it is identically .
Consequently the exponential sample-mean upper-tail rate isThe threshold case uses the rate-function lower bound on the open half-line, rather than applying the law of large numbers at equality.
Past exam of the mathematics course of the University of Cambridge 2012 iii Paper 33 2 a Solution by
Codex 0 Created 2026-10-03 Updated 2026-10-07
Let be independent and identically distributed random variables with moment-generating function finite on an open interval about . Putallowing outside its finite domain. The Cramér theorem states that satisfies a large deviation principle with speed and good rate function , the Legendre transform of a cumulant-generating function. Explicitly, for every closed set and open set ,Here and . The rate function is lower semicontinuous and its finite sublevel sets are compact. The exponential-moment hypothesis is essential for this form of the Cramér theorem.
Past exam of the mathematics course of the University of Cambridge 2012 iii Paper 33 1 d Solution by
Codex 0 Created 2026-10-03 Updated 2026-10-07
The time is the waiting time for two consecutive successes in independent fair trials. First note its integrability: if any one of the disjoint pairs is , then . Thus .
Let be the expected additional waiting time with no trailing positive step, and let be the expected additional time when the preceding step was positive. Conditioning on the next independent increment givesA negative step returns either state to state ; a positive step moves state to state and completes the pattern from state . Substitution yields , so . The original process starts in state , and thereforeOverlapping pairs are dependent, so regarding each successive pair as a fresh trial of success probability would give the wrong expectation.
Past exam of the mathematics course of the University of Cambridge 2012 iii Paper 33 1 c Solution by
Codex 0 Created 2026-10-03 Updated 2026-10-07
Because each increment is , the event at time defining is exactly . Therefore, for ,and for this event is empty. Thus is a stopping time for the natural filtration.
On the other hand, . This event has probability , whereas the initial sigma-algebra is trivial, even after completion up to null sets. It therefore cannot belong to . Hence is not a stopping time. Subtracting a deterministic delay from a stopping time can require information from the future.
Past exam of the mathematics course of the University of Cambridge 2012 iii Paper 33 1 b Solution by
Codex 0 Created 2026-10-03 Updated 2026-10-07
Define the stopped martingaleIt is nonnegative: before the first visit to , the nearest-neighbour random walk is at most , and afterwards the stopped position is . Each is integrable, with . MoreoverThe indicator is -measurable and the increment has conditional mean zero, so is a martingale with .
Part (a) shows almost surely, so every such path eventually has . Thus almost surely. But for every , so there is no convergence in L1. Any possible L1 convergence limit would agree with the almost sure limit. This is a nonnegative martingale with almost sure convergence but no convergence in L1, and hence it is not uniformly integrable.
Past exam of the mathematics course of the University of Cambridge 2012 iii Paper 33 1 a Solution by
Codex 0 Created 2026-10-03 Updated 2026-10-07
Use the natural filtration of the simple symmetric random walk. The event belongs to , so is a stopping time.
For a positive integer , set . This exit time from the finite interval is integrable: in each block of steps there is a probability at least of all steps being positive, which forces exit if it has not already occurred. Consequently the survival probabilities have a geometric upper bound.
We use the bounded-time optional stopping theorem: if is a martingale and a bounded stopping time, then . Apply it at to and to the square-minus-time martingale of a simple symmetric random walk . The stopped positions lie in , so dominated convergence and monotone convergence giveWriting , the first equation becomes , hence . The second gives . Since , its expectation satisfies for every . ThereforeNevertheless . Thus the infinite mean first passage of a simple symmetric random walk occurs despite almost sure finiteness; using unrestricted optional stopping directly at would be unjustified.
Past exam of the mathematics course of the University of Cambridge 2012 iii Paper 31 3 iv Solution by
Codex 0 Created 2026-10-03 Updated 2026-10-07
Put . For a real eigenvalue ,The spectral theorem for real symmetric matrices therefore gives and , since is a sum of with nonnegative coefficients given by squared eigenvector coordinates of . This is the positive imaginary part of a Stieltjes matrix resolvent. HenceApply the triangle inequality to the identity above, and add and subtract the minor trace:The allowed principal minor resolvent trace bound, with the printed normalization, bounds the second average by . Thus the explicit conclusion isIn particular, the final term is with a constant independent of . The upper-half-plane restriction gives the displayed positive denominators; in the lower half-plane the analogous bound uses .
The chosen centering also has a probabilistic meaning. The column vector is independent of the minor, has mean zero and coordinate variance , so its conditional expectation satisfiesThis explains why the bound isolates fluctuations of a quadratic form around the minor trace. Mean centering alone is not a concentration estimate; no unrequested limiting assertion is being assumed.
Past exam of the mathematics course of the University of Cambridge 2012 iii Paper 31 3 iii Solution by
Codex 0 Created 2026-10-03 Updated 2026-10-07
Work with in the upper half-plane. Write the Stieltjes matrix resolvents and their normalized matrix traces asThe minor trace is normalized by , not by . This sign convention is the negative of the convention used in the general resolvent of an operator article. Here is the Stieltjes transform of a measure of the empirical spectral measure, with kernel .
The diagonal entries of are zero, so the preceding Schur complement formula gives . Taking the matrix trace, subtracting the comparison value , and combining fractions gives the resolvent self-consistency defectThe positive numerator sign is fixed by this subtraction. All denominators are nonzero in the upper half-plane, as the imaginary-part estimate in the next part shows. The identity is deterministic and does not use entry independence or moment assumptions.
Past exam of the mathematics course of the University of Cambridge 2012 iii Paper 31 3 ii Solution by
Codex 0 Created 2026-10-03 Updated 2026-10-07
Take off the real axis, or more generally require both and to be invertible. The spectral theorem for real symmetric matrices guarantees these inverses for nonreal . Move coordinate to the first position by a simultaneous row and column permutation. With , the permuted matrix isSolve its equation against the first coordinate vector: if its solution is , then the lower block equation gives . Substitution into the first equation gives . The component is the requested diagonal entry of the matrix inverse, proving the Schur complement formula for a diagonal resolvent entry:The product is bilinear, with transpose, because is real and is real symmetric, even when the inverse is complex. In a complex Hermitian matrix version the row is instead. The final belongs inside the denominator, as in the original PDF; the converted TeX misplaces it outside the fraction.
The inverse hypotheses matter if is real: is invertible at , while its one-by-one principal minor is not. Thus existence of the full inverse alone is not sufficient to use this formula.
Past exam of the mathematics course of the University of Cambridge 2012 iii Paper 31 3 i Solution by
Codex 0 Created 2026-10-03 Updated 2026-10-07
Use block matrix elimination with the invertible square block :The left multiplier is block triangular with identity diagonal blocks, so its determinant is . Taking the determinant of the block-triangular product provesThe matrix is the Schur complement of . The proof needs invertible, but does not assume the Schur complement or the full matrix is invertible.
Past exam of the mathematics course of the University of Cambridge 2012 iii Paper 31 2 v Solution by
Codex 0 Created 2026-10-03 Updated 2026-10-07
Use the fixed common entry law from the printed setup: has mean zero and second moment for each upper-triangular entry, including the diagonal. LetSince , the removed part after centered truncation of a Wigner matrix isConsequently . Symmetry gives . There are diagonal terms and off-diagonal terms in this sum, soMirrored entries are counted twice, as they must be; independence of those mirrored entries is neither true nor needed for this expectation calculation.
By the preceding bound and the Markov inequality,The dominated convergence theorem applies to , so . Choose with . ThenThis second moment bound for spectral truncation depends only on and the common law of , and is uniform over functions with Lipschitz bound . No fourth-moment hypothesis is required. If the scaled entry law were allowed to vary arbitrarily with , a uniform choice would instead require uniform decay of its second-moment tails; the intended fixed-law setting supplies exactly that condition.
Past exam of the mathematics course of the University of Cambridge 2012 iii Paper 31 2 iv Solution by
Codex 0 Created 2026-10-03 Updated 2026-10-07
Put . Apply the Cauchy-Schwarz inequality to the average of the nonnegative eigenvalue differences, and then the Hoffman–Wielandt inequality:Taking nonnegative square roots gives the spectral Lipschitz bound from Frobenius distanceThe factor is essential: the empirical spectral measure has total mass , not .
Past exam of the mathematics course of the University of Cambridge 2012 iii Paper 31 2 iii Solution by
Codex 0 Created 2026-10-03 Updated 2026-10-07
The Hoffman–Wielandt inequality says that for normal matrices with eigenvalues , there is a permutation such thatwhere is the Frobenius norm and denotes the conjugate transpose. For Hermitian matrices, the increasingly ordered real eigenvalues may be paired directly: this ordering minimizes the sum of squared distances over all permutations, by removing crossed pairs. In particular, for the real symmetric matrices in this question,The square on the right is justified by symmetry. For arbitrary matrices, the appropriate expression is the conjugate-transpose product, not the ordinary square.
Past exam of the mathematics course of the University of Cambridge 2012 iii Paper 31 2 ii Solution by
Codex 0 Created 2026-10-03 Updated 2026-10-07
The empirical spectral measures of the two real symmetric matrices arewhere is the Dirac measure at . Thus . Pair the eigenvalues in the specified increasing order and apply the triangle inequality followed by Lipschitz continuity with bound :This deterministic estimate uses only the Lipschitz bound; no entry independence or distributional hypothesis is needed here.
Past exam of the mathematics course of the University of Cambridge 2012 iii Paper 31 2 i Solution by
Codex 0 Created 2026-10-03 Updated 2026-10-07
A function satisfies Lipschitz continuity with bound ifHere is an admissible Lipschitz bound; the least admissible value is the Lipschitz constant. The later parts use the admissible bound .
Past exam of the mathematics course of the University of Cambridge 2012 iii Paper 31 1 v Solution by
Codex 0 Created 2026-10-03 Updated 2026-10-07
For , the correlation function of a point process associated with the eigenvalues isThe factorial factor counts ordered selections of distinct eigenvalues, so this is a factorial moment density, rather than the ordinary probability density of particular labels. Equivalently, for a nonnegative measurable test function ,Repeated projection kernel determinant integration, with , gives a factor on integrating an -by- kernel determinant down to size . Together with the normalizing in , the factors cancel:In particular and . Set and for . The eigenvalue configuration is thus a determinantal point process with a rank- finite-rank projection kernel.
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





