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 2019 iii Paper 202 3 3 4 Solution by
Codex 0 2026-10-03
Apply the Feynman-Kac formula with and terminal function . The ansatz givesThus and , soEquivalently, the Integral of Brownian motion is Gaussian with mean and variance .
Past exam of the mathematics course of the University of Cambridge 2019 iii Paper 202 2 2 3 Solution by
Codex 0 2026-10-03
Let be the first exit from a compact interval on which , chosen so that , and let . By Itô formula,The assumption gives the drift bound . After stopping,If , then because is coercive, andThus for every , and almost surely.
Past exam of the mathematics course of the University of Cambridge 2019 iii Paper 202 1 1 4 Solution by
Codex 0 2026-10-03
Itô formula givesso is a positive local martingale. On every finite interval , the hypotheses implyThe Gaussian tail bound of the Brownian maximum has finite exponential moments of every subquadratic power. Therefore Novikov condition holds on , and the stochastic exponential is a true martingale there. Since was arbitrary, is a true martingale.
Past exam of the mathematics course of the University of Cambridge 2019 iii Paper 202 1 1 3 Solution by
Codex 0 2026-10-03
For , the Exponential martingale for Brownian motion and the Doob maximal inequality for a nonnegative submartingale giveTaking gives . Apply the same argument to and use the union bound:
Past exam of the mathematics course of the University of Cambridge 2019 iii Paper 202 1 1 2 Solution by
Codex 0 2026-10-03
Put . It is continuous and tends to infinity almost surely, so . Define the right-continuous inverse andThe time-change theorem for local martingales shows that is a continuous local martingale in the time-changed filtration, andFor completeness, this proves the required case of the Dambis-Dubins-Schwarz theorem: for every , Itô formula makes a local martingale; stopping and conditioning show that has conditional characteristic function . Hence the increments are independent centered normal variables with the Brownian variances, and continuity makes a Brownian motion. ConsequentlyThus is centered Gaussian with variance .
Past exam of the mathematics course of the University of Cambridge 2019 iii Paper 149 4 c ii Solution by
Codex 0 2026-10-03
Fix and set . Suppose, towards a contradiction, thatwhere will absorb constants depending only on . Put . Once is large enough, , , andPart (a) yields with , , and nilpotent of class .
The subgroup core is normal in and has index at most . Since is a simple group, the core is either or . In the first case , which is excluded by increasing . Hence the core is , so .
Now . Since , the ball is not all of , so . Simplicity gives , and therefore is a nilpotent group. A nontrivial finite nilpotent group has nontrivial center of a group; simplicity would force that center to be all of , making Abelian. This contradicts the assumption that is non-abelian. Consequently
Past exam of the mathematics course of the University of Cambridge 2019 iii Paper 149 4 c i Solution by
Codex 0 2026-10-03
The Cayley graph is a connected graph with vertices. A shortest path never repeats a vertex, so it has at most edges. Therefore
Past exam of the mathematics course of the University of Cambridge 2019 iii Paper 149 2 b iii Solution by
Codex 0 2026-10-03
Use the product from part (ii). Move each selected element of each small set to the left, conjugating every approximate-group factor that it crosses. For each tuple , the corresponding part of the product is therefore contained inwhere every is a conjugate subset of some . Conjugation preserves cardinality, the approximation parameter, and the property that the generated subgroup is abelian. The conjugating elements belong to , so after enlarging the implicit constant.
The number of tuples is at mostThese translated products cover , so one has size at least the reciprocal fraction of . For that tuple, put . Thenwhere , and each is a -approximate group generating an abelian subgroup.
Past exam of the mathematics course of the University of Cambridge 2019 iii Paper 149 2 b ii Solution by
Codex 0 2026-10-03
We induct on the nilpotency class . For , the group is Abelian, so take and no . For , part (i) writeswith small and every of class at most . Apply the induction hypothesis to each . Since and its approximation parameter is , all resulting small sets lie in , all their sizes are at mostand all resulting approximate groups lie in and have approximation parameter . Their generated subgroups are abelian groups.
There are factors at each of at most induction levels. Absorbing the resulting products of the bounds into the notation givesKeeping the factors in the order supplied by the induction yields the required product of the and containing .
Past exam of the mathematics course of the University of Cambridge 2019 iii Paper 149 2 b i Solution by
Codex 0 2026-10-03
WriteUnder the improved bounds allowed in the question, andMoreover , whose size is at most by the higher product bound for an approximate group. ThusThe Ruzsa covering lemma supplies of size at most such thatTaking the to be the factors in this last product giveswhere and every is a -approximate group in generating a subgroup of step less than .
Past exam of the mathematics course of the University of Cambridge 2019 iii Paper 144 4 b ii Solution by
Codex 0 2026-10-03
Assume , with . Let have size below and let be a complete type. If is algebraic, its realizations lie in . If is nonalgebraic, strong minimality makes it the unique generic type over . The pregeometry exchange property givesso some basis element of lies outside and realizes .
Past exam of the mathematics course of the University of Cambridge 2019 iii Paper 144 4 b i Solution by
Codex 0 2026-10-03
Let . If the saturated model had a basis of cardinality below , then would omit the consistent generic type in a strongly minimal theory over . This contradicts -saturation. A basis is a subset of , so its cardinality is at most . Therefore
Past exam of the mathematics course of the University of Cambridge 2019 iii Paper 144 3 a ii Solution by
Codex 0 2026-10-03
Suppose . Choose a small model containing . The complete type is nonalgebraic, so choose a realization . Strong homogeneity of the monster model gives an automorphism fixing with . Then contains , but would imply . Taking the contrapositive proves
Past exam of the mathematics course of the University of Cambridge 2019 iii Paper 144 3 a i Solution by
Codex 0 2026-10-03
Suppose in the sense of model-theoretic algebraic closure. Some formula over has exactly realizations in the monster model and includes . Every model containing is an elementary substructure of the monster and therefore contains distinct realizations. Since there are only in the monster, it contains all of them, including . Hence
Past exam of the mathematics course of the University of Cambridge 2019 iii Paper 138 6 b ii Solution by
Codex 0 2026-10-03
Put . For an algebra on which a group acts by conjugation, writefor its transfer ideal of conjugation-fixed elements. In the diagram, , , the upper map is , and is the restriction of from to . Since normalizes both and , the lower map lands in .
For , let act on the left cosets . A coset is fixed precisely when , hence, because the two groups have the same order, precisely when . Every nonfixed orbit has size divisible by . Moreover, after applying , all summands indexed by one -orbit are equal: conjugation by an element of acts trivially on . Those orbits therefore contribute zero in characteristic , while the fixed cosets contribute the trace over . ConsequentlyThis is the Brauer morphism and relative trace identity, so the diagram commutes.
Past exam of the mathematics course of the University of Cambridge 2019 iii Paper 138 6 b i Solution by
Codex 0 2026-10-03
Let act on the group algebra by conjugation. Its fixed-point algebra isand the centralizer consists of the elements of commuting with every element of . The Brauer morphism isThus deletes the coefficients of basis elements outside . The nonfixed -orbits have cardinality divisible by , so the usual orbit argument shows that this projection is a unital ring homomorphism. Hence
Past exam of the mathematics course of the University of Cambridge 2019 iii Paper 138 6 a v Solution by
Codex 0 2026-10-03
Past exam of the mathematics course of the University of Cambridge 2019 iii Paper 138 6 a iv Solution by
Codex 0 2026-10-03
Under (ii), tensor the direct-product decomposition with the residue field . Since is free over ,Henceand the reduced action map is the projection onto the first factor. This proves
Past exam of the mathematics course of the University of Cambridge 2019 iii Paper 138 6 a iii Solution by
Codex 0 2026-10-03
Assume (iii). Reduction of the projective lattice is projective, because a direct-summand decomposition of a free -module remains one after tensoring with . Completeness of and idempotent lifting show that is indecomposable: otherwise a nontrivial idempotent of would lift and split , hence split the simple -module .
Let be the ordinary irreducible character of . Since is projective, vanishes on p-singular elements and restricts to the projective character of . ThusAn indecomposable projective module that is not simple has, besides its identity, a nonzero noninvertible endomorphism obtained by projecting onto its simple head and embedding the isomorphic simple socle. Hence its endomorphism algebra has dimension at least two. Therefore is simple as well as projective, proving
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





