Past exam of the mathematics course of the University of Cambridge 2005 iii Paper 39 1 Solution Created 2026-10-03 Updated 2026-10-14
Equip with a sigma-algebra . A Poisson random measure with intensity measure of a point process is a random counting measure such that, for every measurable with ,and the counts on every finite collection of pairwise disjoint measurable sets are independent. Thus . For a sigma-finite measure , sets of infinite intensity contain infinitely many points almost surely: exhaust such a set by increasing finite-intensity sets and use the Poisson count tails as their means tend to infinity. The count is a measurable random variable for every measurable , which is part of saying that is a random measure.
Under the usual point representation write , counting multiplicities. If is a non-atomic measure, this is a simple Poisson point process; if has atoms, several point occurrences can have the same location, and each occurrence is counted separately. In a topological setting, local finiteness requires that the intensity be finite on compact sets.
Sufficient existence conditions are that is a standard Borel space and is a sigma-finite measure. This gives existence of a Poisson random measure on a standard Borel space. If a simple locally finite configuration is desired, additionally take a non-atomic, locally finite intensity on a locally compact second-countable Hausdorff space. These conditions are sufficient, not claimed necessary. In particular sigma-finiteness suffices for a countable family of occurrences that can each be independently coloured.
Let and be the red and green counting measures. The marking assumption means that, conditional on , the colours of all point occurrences are independent, with the same red probability . For a measurable set of finite intensity , condition on its total count. To obtain red and green points the total must be , so direct multiplication gives the joint red and green Poisson count formulaThus the two counts are independent Poisson variables with respective means and . This computation includes zero intensity with the usual convention for the probability of zero counts.
For disjoint finite-intensity sets , the original counts are independent. Conditional marking in different sets uses disjoint collections of independent colours. Repeating the preceding calculation therefore givesThis proves the disjoint-count definition for each coloured Poisson point process and independence of their two count vectors.
To obtain independence of the whole processes, take any finite list of red test sets and any finite list of green test sets, initially all of finite intensity. Refine their union into the disjoint cells given by their membership patterns. Every test-set count is the sum of the counts of its cells. The entire red cell vector is independent of the entire green cell vector by the product formula, hence so are the corresponding test-set count vectors. For arbitrary measurable test sets, intersect first with a finite-intensity exhaustion of and pass to the increasing count limits. The count cylinder events generate the two evaluation sigma-algebras, and independence extended from generating pi-systems gives independence of those sigma-algebras. ConsequentlyThis is a direct count proof of the Poisson thinning theorem; no general marking or thinning result has been used to deduce it.
Past exam of the mathematics course of the University of Cambridge 2018 iii Paper 202 1 ii Solution Created 2026-10-03 Updated 2026-10-05
Use the standard convention that the finite-variation process has càdlàg paths and that the stochastic integral starts from zero. Write for its total-variation process. The necessary admissibility condition is almost surely for each finite ; it holds, for example, for locally bounded . Define the pathwise Lebesgue-Stieltjes integralAn atom at contributes , so this convention also fixes the treatment of jumps.
Fix . For a generator of the predictable sigma-algebra, with , the Lebesgue-Stieltjes integral isIt vanishes when and is -measurable otherwise. The total-variation process is adapted: for a càdlàg path its value at is the supremum over a countable collection of partitions of an interval using rational interior points and endpoint . Thus the positive and negative Lebesgue-Stieltjes measures have -measurable masses on the generator intervals.
The Monotone class theorem, applied separately to these positive random measures on , extends this measurability from the generators of the predictable sigma-algebra to all nonnegative predictable processes. Truncation and positive/negative decomposition then cover every admissible . Consequently is adapted.
The integrability condition is essential. Taken literally, an arbitrary previsible process cannot always be integrated against a finite-variation process: with and deterministic for , , the proposed value at every diverges. The usual càdlàg convention is also what identifies by .
Point process Created 2026-10-07 Updated 2026-10-14
A point process records random locations by a random measure that counts them. Examples include arrival times of a queue, positions of stars, and the finite eigenvalue configuration of a random matrix. The count in an observation window is a random variable; its expected value is supplied by the intensity measure of a point process, while its fluctuations and relationships with other windows require more information.
For a precise spatial convention, take with its Borel sigma-algebra and a probability space . A locally finite point process is a measurable function from to the space of locally finite point measures, equipped with the sigma-algebra generated by evaluations for Borel sets . Each realization has the formwhere is finite or countable and repeated locations are allowed; is a Dirac measure. Here a point measure is a counting measure with possible multiplicities, rather than the counting measure of a set of distinct locations.[ref]
Lectures on the Poisson Process by Günter Last and others. Section 2.1, Definition 2.1, printed pp. 10-11: point measures and the sigma-algebra generated by evaluations
Local finiteness means for every bounded Borel set , on a single almost sure event. In it suffices to check the countable collection of balls of integer radius centered at the origin, and this is equivalent to finiteness on every compact set. On a general measurable space there is no notion of boundedness without additional structure: state a metric or an explicit family of observation windows. Another convention on locally compact spaces requires finiteness on compact sets; this need not coincide with finiteness on all bounded sets outside . Local finiteness does not require finitely many points in all of .[ref]
Lectures on the Poisson Process by Günter Last and others. Section 2.4, Definitions 2.11 and 2.13, printed pp. 16-17: bounded-set local finiteness and the countable ball exhaustion