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 2002 iii Paper 31 6 a Solution by
Codex 0 Created 2026-10-03 Updated 2026-10-14
There is no density on the full infinite path space; the two laws are mutually singular. Under Wiener measure, almost surely. Under the shifted law, almost surely, so the same measurable tail event separates the laws.
For completeness the Brownian limit follows from the Gaussian bound at integers and the maximal bound on each interval : for every fixed , both and are finite. The Borel-Cantelli lemma and continuity fill the gaps between integers. Intersect over positive rational . This proves the limit and the claimed singularity, which is infinite-horizon singularity of Brownian motion with constant drift.
On every finite horizon there nevertheless is the density . Its failure to give a global density is exactly the distinction required by the printed half-line path space.
Past exam of the mathematics course of the University of Cambridge 2002 iii Paper 3 5 c Solution by
Codex 0 Created 2026-10-03 Updated 2026-10-14
Write with , and let be the splitting field. The root set of is an -dimensional vector space over , by the argument of part (a) with replaced by .
The constants really occur inside , rather than only in the ambient algebraic closure. Choose a nonzero root . For every , is also a root, so both elements lie in andLet . Since is Galois of degree two,This index statement does not require proving that has no still larger constant field.
As an extension of , is the splitting field of the same polynomial. Applying part (b) with base constant size and dimension givesThe special linear group is the kernel of determinant in the general linear group, so every element of normalizes it. Therefore is the required normal index-two subgroup normalizing .
In fact the full group is semilinear over : an element outside acts on constants as and satisfies . Field automorphisms preserve determinant one, so this also explains the normalizer behavior geometrically. This is the quadratic constant extension of a q-squared linearized splitting field, not the polynomial of part (b) with its term unchanged.
Past exam of the mathematics course of the University of Cambridge 2002 iii Paper 3 5 b Solution by
Codex 0 Created 2026-10-03 Updated 2026-10-14
Put , so and in the characteristic. For a nonzero root , division by givesThe projective point is therefore represented by , satisfyingTwo nonzero roots give the same exactly when their ratio lies in . Thus the projective points are precisely the roots of . The polynomial is irreducible in , since it is linear in and its quotient ring is . Gauss's lemma makes it irreducible over , so the action on projective points is transitive.
Fix one such coordinate , so . The other coordinates satisfyWe prove its irreducibility even over . Make the birational change , . Multiplication by transforms the equation intoChoose a nontrivial th root of unity over the algebraic closure. Since the characteristic does not divide , has a simple zero at . Viewed as a polynomial in over , is Eisenstein at the prime : the leading coefficient is one, every intermediate coefficient is zero, and the constant term is divisible by that prime exactly once. It is therefore irreducible.
The birational substitution preserves irreducibility after inverting or . No factor supported solely on is lost, because is nonzero. Gauss's lemma then proves that is irreducible over and hence over . Its roots are distinct: a repeated root would have as well as , forcing , impossible generically.
The stabilizer of the chosen projective point is , and the irreducibility of makes it transitive on all the remaining projective points. This proves projective transitivity of a trinomial linearized polynomial, namely two-transitivity on the one-dimensional subspaces. The supplied group-theoretic result now applies to the linear subgroup from part (a), givingThe Eisenstein argument remains valid even though is divisible by the characteristic; it concerns irreducibility in , not separability of that projection. Separability of the projective polynomial has been checked independently.
Past exam of the mathematics course of the University of Cambridge 2002 iii Paper 3 5 a Solution by
Codex 0 Created 2026-10-03 Updated 2026-10-14
The PDF has -power exponents; the polynomial is a linearized polynomial over a finite field, not the degree- polynomial produced by the converted TeX. Let be its root set in an algebraic closure. Because and for ,Thus is an -vector space. Its derivative is , and its degree is , so it has exactly distinct roots. A finite vector space of that size has dimension .
Every splitting-field automorphism fixes and carries roots to roots. Hence it acts linearly on . The action is faithful because the splitting field is generated by the roots. Choosing a basis identifies this injection withDifferent bases conjugate the matrix subgroup. The linear action itself is canonical, while a particular matrix realization is basis-dependent.
Past exam of the mathematics course of the University of Cambridge 2002 iii Paper 3 4 c Solution by
Codex 0 Created 2026-10-03 Updated 2026-10-14
The relevant cycle types are , and . Conjugate the first entry to , fixing six. An entry of type pairs six with one of the five other letters. Powers of move that partner to one. With the pair fixed, only three matchings remain:Thus there is exactly one centralizer orbit of eligible second entries, consisting of five matchings before normalization. The third entry is forced to be , so there is at most one inner orbit of product-one tuples of these types.
For the actual displayed , direct multiplication giveswhich belongs to the class of the displayed . This is a product-one witness. The three displayed permutations themselves need not multiply to one; the problem concerns their conjugacy classes.
The group is transitive, because moves the first five points transitively and connects six to them. Its stabilizer of six contains the five-cycle and is transitive on the other points. Hence the group is two-transitive and therefore primitive. Moreover is a transposition. The primitive transposition lemma proves that the group is . Consequently all tuples in the sole inner orbit generate , andAs a count check, there are first entries and five eligible second entries for each, giving tuples. A generating tuple has simultaneous stabilizer equal to the trivial center of , so its inner orbit also has size .
Past exam of the mathematics course of the University of Cambridge 2002 iii Paper 3 4 b Solution by
Codex 0 Created 2026-10-03 Updated 2026-10-14
For , take to be the class of -cycles, the class of transpositions, and the class of an -cycle with one fixed point. With rightmost permutations applied first, a witness isMultiplying an -cycle by a transposition splits it at the two exchanged letters. The resulting cycles have the lengths of the two arcs between those letters in the cyclic ordering. Thus has type exactly when the exchanged letters are cyclically adjacent.
Any product-one tuple can first be conjugated so that its first entry is . Its second entry is then one of the adjacent transpositions. The centralizer acts transitively on these choices; the third entry is forced to be the inverse product. Therefore every product-one tuple lies in a single simultaneous-conjugation orbit.
The conjugates exchange all adjacent letters around the cycle. Their connected-edge graph generates , so the witness, and every tuple in that orbit, generates . HenceFor the last two classes coincide, which causes no difficulty: the same three adjacent swaps form one orbit and generate .
Past exam of the mathematics course of the University of Cambridge 2002 iii Paper 3 4 a Solution by
Codex 0 Created 2026-10-03 Updated 2026-10-14
Fix ordered branch positions and conjugacy classes in . Form the generating product-one setThe rigid ramification type condition is that this set is nonempty and consists of one orbit under simultaneous inner conjugation by . Rationality of classes is a further arithmetic condition and is not needed for this complex uniqueness statement.
Let . Choose a base point and positively oriented peripheral loops with sole relation . A connected Galois cover over gives a surjective monodromy map , and changing the labeling of one fiber conjugates it. Its peripheral images are exactly a tuple in the set above.
For two extensions of the same rigid type, rigidity conjugates their tuples to agree. The loops generate , so their entire monodromy maps then agree. This constructs an isomorphism of the unramified covers directly: label fibers at the base point identically, and transport that matching along paths. Independence of path follows from equal monodromy. The resulting map is holomorphic because the cover maps are local biholomorphisms.
Near each missing point, the cover has local form . The isomorphism therefore extends over the added points, equivalently by the removable-singularity theorem in these local parameters. Pullback of meromorphic functions gives an isomorphism of the function fields fixing . Hence there is at most one extension of the prescribed rigid type. This is uniqueness for fixed branch positions and peripheral conventions, not uniqueness after arbitrarily moving the branch points.
Past exam of the mathematics course of the University of Cambridge 2002 iii Paper 3 3 b Solution by
Codex 0 Created 2026-10-03 Updated 2026-10-14
Put and write , where . The unit has a square root in . Dividing the radical by that square root and by reduces the completed extension toIf is even, it is unramified and locally splits; if is odd, adjoining gives ramification index two. At points where , and there is no branch. ThereforeFor infinity set . If ,The same quadratic branch parity criterion applies to the negative valuation , soThe generic irreducibility excludes being a square. Local splitting at the even-order places is compatible with that global irreducibility. The number of odd finite orders plus the possible odd infinity order is even, as also follows from the sum of orders of a rational function being zero.
Past exam of the mathematics course of the University of Cambridge 2002 iii Paper 3 3 a Solution by
Codex 0 Created 2026-10-03 Updated 2026-10-14
For a finite point , use the valuation with local parameter ; at infinity use . Its extensions to are permuted transitively by . The completed residue field is , because is algebraically closed, so the local decomposition group equals its inertia group.
Write . Characteristic zero makes all local ramification tame. One can choose a uniformizer in the completion for whichIndeed, initially is times a unit; that unit has an th root in , by its algebraically closed residue field and the invertibility of . Absorb it into . The local automorphisms are then , , and form a cyclic group of order . Define .
To specify an element rather than a subgroup, fix a compatible choice of primitive roots of unity . Define by its uniformizer characterand let be its conjugacy class in . Over , take , corresponding to positive local continuation around . At an unramified point, and .
Changing the uniformizer does not affect this character. If with a unit, inertia fixes its residue, soThe character is injective: a nonidentity finite-order automorphism with derivative one would have for , and its th iterate would have coefficient at that first nonzero displacement. Characteristic zero contradicts finite order. Thus the chosen primitive character identifies a unique generator.
For another place , conjugation gives , preserves its order, and carries to , since fixes the constants and hence . This proves that and the branch-cycle conjugacy class are independent of the place and uniformizer. Without the stated roots-of-unity convention, only the cyclic inertia-subgroup conjugacy class is intrinsic: replacing by another primitive root replaces the generator by a coprime power, which need not lie in the same conjugacy class.
Past exam of the mathematics course of the University of Cambridge 2002 iii Paper 3 1 c Solution by
Codex 0 Created 2026-10-03 Updated 2026-10-14
Use . At the specialization is , already proved irreducible and separable. Because the original polynomial is monic, this proves irreducibility over and gives a transitive group on five roots.
At the specialization factors asNeither factor has a root in , so they are irreducible; the factors are coprime and the specialization is separable. For example its derivative is and its value at one is one. The unramified reduction test gives a permutation whose cube is a transposition. The same primitive prime-degree graph argument now givesNo characteristic-zero discriminant-sign argument is being transferred to characteristic two: good specialization and the explicit cycle test are sufficient.
Past exam of the mathematics course of the University of Cambridge 2002 iii Paper 3 1 b Solution by
Codex 0 Created 2026-10-03 Updated 2026-10-14
Modulo two the polynomial becomes . It has neither zero nor one as a root. The only irreducible quadratic over is ; modulo it, and . A reducible quintic has a factor of degree at most two, so is irreducible. It is also separable: , which is coprime to . Thus the rational polynomial is irreducible, and its group is transitive.
Modulo three there is the exact factorizationThe quadratic has no root. The cubic takes value one at each of , so it too has no root and is irreducible. The two factors are distinct and coprime. The Frobenius cycle type therefore supplies an element with disjoint cycles of lengths two and three. Its cube is a single transposition.
A transitive action of prime degree is primitive: a block size divides five, so the only sizes are one and five. To finish without classifying all degree-five groups, apply the primitive group with a transposition argument. Form the graph of all conjugate transpositions in . Its connected components are blocks, so it is connected. Transpositions along the edges of a connected graph generate every transposition: along a path, conjugating adjacent swaps yields the swap of its endpoints. Hence they generate , and
Past exam of the mathematics course of the University of Cambridge 2002 iii Paper 3 1 a Solution by
Codex 0 Created 2026-10-03 Updated 2026-10-14
Let have degree . A useful reduction prime must preserve its degree and make its reduction separable. Thus exclude the leading coefficient and discriminant from ; after localizing at those elements one may make monic. The residue base field is , not necessarily the ring itself. Then the Galois group of the reduced polynomial embeds in the generic group, with the same action on the corresponding roots.
Here is the unramified reduction of a polynomial Galois group argument. A UFD is integrally closed. Let be the splitting field over , and use the root algebra obtained by adjoining all roots after inverting the discriminant. It is finite étale over the resulting normal base: successive simple-root adjunctions are unramified, and the distinct generic components separate over a normal ring. Choose a prime above . The residue field is generated over by the reduced roots, so it is their splitting field. The decomposition groupacts on . Its residue action is onto ; this is the local decomposition-group description of the unramified fiber. Equivalently, the geometric points of that fiber form a free transitive Galois-group set, and the commuting residue-field action identifies the residue group with a stabilizer subgroup of the generic group.
The kernel is the inertia group. An element in that kernel fixes every reduced root. Since the discriminant is a unit, distinct roots have distinct reductions; consequently it fixes every original root and is the identity. ThereforeChoosing another prime changes this subgroup by conjugacy, which does not change the cycle types available for computing the generic group.
When , its splitting-field group is generated by Frobenius. A reduced irreducible factor of degree contributes one -cycle. Hence a squarefree factorization with degrees proves that the generic group contains that cycle type. Irreducible degree-preserving reduction also proves generic irreducibility by Gauss's lemma: a nontrivial monic factorization would reduce to one. Several good primes, a discriminant-square test and permutation-group arguments can then identify the group. A ramified or degree-dropping prime does not justify the same cycle test.
Past exam of the mathematics course of the University of Cambridge 2002 iii Paper 29 6 c Solution by
Codex 0 Created 2026-10-03 Updated 2026-10-14
Let , where is the short rate. At maturity the zero-coupon bond pays one, so . If the discounted bond price is a martingale, its terminal conditional expectation isThe positive factor is measurable with respect to the current filtration. Dividing it out givesConversely, this identity says . The tower property gives for every , establishing the martingale condition. The integrated short rate is a Gaussian random variable with finite variance, so the Gaussian moment-generating function proves that is integrable. Together with the preceding subparts, this proves all three descriptions equivalent.
Past exam of the mathematics course of the University of Cambridge 2002 iii Paper 29 6 b Solution by
Codex 0 Created 2026-10-03 Updated 2026-10-14
Assume the displayed Gaussian forward-rate covariance drift restriction. Its diagonal instance givesUsing it on the two parts of the deterministic discounted exponent yieldsThe last equality uses covariance symmetry to reflect the triangular integration region across its diagonal. The independent increments of the integrated Gaussian forward-rate process and its conditional Gaussian moment-generating function then give, for ,All these prices are integrable because their exponents are Gaussian random variables with finite variance. Thus the mean restriction implies the discounted bond martingale condition, completing the equivalence of the first two descriptions.
Past exam of the mathematics course of the University of Cambridge 2002 iii Paper 29 6 a Solution by
Codex 0 Created 2026-10-03 Updated 2026-10-14
If the discounted zero-coupon bond price is a martingale, its expectation is . The Gaussian moment-generating function applied to the representation above gives , soDifferentiate in maturity . The two mean derivatives are and . Symmetry of the covariance in its last two arguments makes the two boundary terms in the derivative of the double integral equal. HenceWe obtain the Gaussian forward-rate covariance drift restrictionwhich proves that the martingale condition implies the mean restriction. Only maturity differentiation is used; a time derivative of the covariance is unnecessary.
Past exam of the mathematics course of the University of Cambridge 2002 iii Paper 27 6 c Solution by
Codex 0 Created 2026-10-03 Updated 2026-10-14
For each fixed and , remove the first weight factors but retain the same walk law:This quantity is measurable with respect to , since the averaging over all walk positions is deterministic and involves no earlier environment variables. The bounds on each deleted factor give, pointwise for every environment,Both constants are finite and strictly positive. Taking lower limits gives the exact identity of eventsThere is no exceptional-set issue in this comparison. Choose the version of to equal when this is finite and to equal otherwise; it agrees with the almost-sure martingale limit, and its zero event is precisely the left-hand event above. Since the identity holds for every , belongs to the printed tail sigma-algebra . This proves the tail event for a vanishing positive path-weight limit without pretending that the whole value of is tail-measurable.
The independent time layers of the environment are independent random vectors, so the Kolmogorov zero-one law applies to their tail sigma-algebra. It yields . Under the small-noise condition from part (b), and , so that probability cannot be . HenceThe tail-event argument itself works for every ; the deduction of positivity here uses the mean-one conclusion supplied by part (b).
Past exam of the mathematics course of the University of Cambridge 2002 iii Paper 27 6 b Solution by
Codex 0 Created 2026-10-03 Updated 2026-10-14
For a fixed environment, use two independent copies of the walk to express . The product is finite and nonnegative, so we can interchange the two expectations. At each time , if the walks occupy different sites, the two environment signs are independent and their factors have product expectation . If they coincide, both factors use the same sign andDifferent time layers are independent even when a site is visited again. Therefore, with the simultaneous collision count ,This is the collision-count second moment for independent path weights. It involves equal-time intersections, not arbitrary intersections of the two spatial ranges.
The difference walk has independent bounded increments symmetric about zero and a full-dimensional step distribution. It may hold at zero for one step; such a hold counts as a positive-time return. The allowed transience fact givesMoreover since the two first steps can be equal. Restarting the independent increments after every return to zero shows that the total positive-time return count has the zero-based geometric distributionIndeed the probability of at least returns is , and subtracting successive tails gives this law. Consequently, whenever ,A sufficient small-noise condition is .
The L2 martingale convergence theorem now gives in as well as almost surely. One can see the mean preservation directly: for , the martingale identity gives . The second moments are increasing and bounded, so the sequence is Cauchy in and its limit is the already identified almost-sure limit. Thus
Past exam of the mathematics course of the University of Cambridge 2002 iii Paper 27 6 a Solution by
Codex 0 Created 2026-10-03 Updated 2026-10-14
Write , where the angle brackets average only over walk paths, and use only for the environment. Every nearest-neighbor path of length has probability , so the finite path sum is exactly the walk expectation. It depends only on environment layers through time , and hence is -measurable. Its factors lie in , so is positive and integrable at each fixed time.
For any fixed path through time , the environment variable is independent of and has mean zero. Conditional expectation therefore removes its last factor. Summing over the possible last steps of each length- path cancels the extra factor in the path probability. ThusThis is the positive random-environment path-weight martingale. It is nonnegative and bounded in , so the martingale convergence theorem gives a finite limit almost surely. At this stage one can conclude by Fatou's lemma, but not yet equality; the second-moment bound in part (b) will prevent loss of mean.
Past exam of the mathematics course of the University of Cambridge 2002 iii Paper 27 5 b Solution by
Codex 0 Created 2026-10-03 Updated 2026-10-14
We prove fourth-moment tightness of polygonal random walks uniformly, including intervals shorter than a mesh cell or crossing a mesh boundary. For , let be the length of the overlap of with . The interpolated increment isPut . Expanding the fourth power and using centered independent steps, only the terms with four equal indices or two equal pairs survive. ConsequentlyIf , the last correction is nonpositive. If , use . In either case the expression is at most . Since ,Also and the paths are continuous. The stated tightness criterion applies with , and the displayed constant, so the laws are tight on with its uniform topology. Part (a) established all the Brownian finite-dimensional distribution limits. The supplied implication from tightness plus those limits now yields the Donsker invariance principle:where is Wiener measure. No estimate restricted to grid endpoints would suffice by itself for the printed uniform criterion; the overlap coefficients handle every pair of times.
Past exam of the mathematics course of the University of Cambridge 2002 iii Paper 27 5 a Solution by
Codex 0 Created 2026-10-03 Updated 2026-10-14
Write and . Since and , the characteristic function expansion at zero is . Indeed, for real , and . The dominated convergence theorem, with dominating variable , proves the expansion after taking expectations. Initially omit the endpoint interpolation terms. The integer-time increments involve disjoint sets of independent steps, so their joint characteristic function isHere . Taking the logarithm near givesThis proves the claimed limit for the integer-time approximation.
At a fixed time , the omitted endpoint term is , and . A fixed linear combination of the errors in the increments therefore tends to zero in , by the triangle inequality and Cauchy-Schwarz inequality, even when two endpoint terms share a step. Since , restoring interpolation changes the joint characteristic function by a quantity tending to zero. HenceThe limit is the joint characteristic function of independent centered normal increments with the indicated variances. By Lévy continuity theorem, the increment vectors converge in distribution to Brownian increment vectors. The value vector is obtained by the fixed invertible triangular map of cumulative sums; thus the continuous mapping theorem gives convergence of to . This proves every required finite-dimensional distribution limit. The finite fourth moment is not needed for this part; it will give tightness in part (b).
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





