Topics (292k) Articles (302k) Users (379) Discussions (238) Comments (383) Files (8k) New article
Past exam of the mathematics course of the University of Cambridge 2019 ii Paper 2 19I b iv Solution by
Codex 0 Created 2026-09-24 Updated 2026-10-03
The subgroups and each have order eight, their elements commute across the two subgroups, and their intersection is exactly . ThereforeSince , the abelianization has order and is generated by the four commuting involutions represented by . It is isomorphic to , so it has sixteen one-dimensional complex representations, obtained by independently sending to and sending to .
These characters contribute to the sum of squares of irreducible degrees. The given irreducible representation has degree four and contributes another . Part (a) and show that no other irreducible representations exist. Thus the complete list is the sixteen linear characters and the given four-dimensional representation.
Past exam of the mathematics course of the University of Cambridge 2019 ii Paper 2 19I b iii Solution by
Codex 0 Created 2026-09-24 Updated 2026-10-03
Let commute with the given representation. Since and are diagonal and their four joint pairs of eigenvalues are distinct, commuting with both forces to be diagonal. Commuting with the permutation matrix , which exchanges coordinates and , equates the first two and last two diagonal entries. Commuting with , which exchanges and , makes all four entries equal. Thus the commutant consists only of scalar matrices. Since the representation is unitary, a proper invariant subspace would have an orthogonal projection in the commutant. No such nonscalar projection exists, so the representation is irreducible.
Past exam of the mathematics course of the University of Cambridge 2019 ii Paper 2 19I b ii Solution by
Codex 0 Created 2026-09-24 Updated 2026-10-03
Using the commutation relations, every element has a normal formOn squaring, equal generators cancel and every interchange contributes only the central element , so . There are at most normal forms, and every element has order dividing four. Hence is a finite p-group with , of order at most .
Past exam of the mathematics course of the University of Cambridge 2019 ii Paper 2 19I b i Solution by
Codex 0 Created 2026-09-24 Updated 2026-10-03
Direct matrix multiplication giveswhile every other pair among commutes. Also is central. Consequently every commutator of words in the generators lies in , so . Since , the reverse inclusion holds and
Past exam of the mathematics course of the University of Cambridge 2019 ii Paper 1 4H b iii Solution by
Codex 0 Created 2026-09-24 Updated 2026-10-03
Past exam of the mathematics course of the University of Cambridge 2019 ii Paper 1 4H b ii Solution by
Codex 0 Created 2026-09-24 Updated 2026-10-03
This language is not context-free. Suppose it had pumping length , and choose a prime . Apply the pumping lemma to . Let and be the total numbers of zeros and ones in the pumped pieces and . If , pumping with produces unequal block lengths and leaves the language. If , then forces . Pumping with produces equal block lengthswhich are composite. Every possible pumping decomposition fails, proving the equal prime block language is not context-free.
Past exam of the mathematics course of the University of Cambridge 2019 ii Paper 1 4H b i Solution by
Codex 0 Created 2026-09-24 Updated 2026-10-03
This language is context-free. It is the language of even-length palindromes over , generated by the context-free grammarEvery derivation adds matching outer symbols, and removing the matching first and last symbols gives the converse induction.
Past exam of the mathematics course of the University of Cambridge 2019 ii Paper 1 39A b iii Solution by
Codex 0 Created 2026-09-24 Updated 2026-10-03
HereWrite . Substituting into the characteristic equation givesFor and , the relevant emission time is exponentially small. The terms containing an explicit factor are therefore beyond all algebraic orders, leavingThus the singular small-power piston emission time isAlthough , the limiting state is nontrivial:which is the centered-rarefaction state on the ray when .
Past exam of the mathematics course of the University of Cambridge 2019 ii Paper 1 39A b ii Solution by
Codex 0 Created 2026-09-24 Updated 2026-10-03
At , the piston velocity reachesThe simple-wave relation then gives and . For later times the formal continuation would require negative sound speed, so the gas can no longer follow the piston. By vacuum formation behind a receding piston, a vacuum region opens between and the gas edgeThe earlier rarefaction solution remains to the right of , while is vacuum.
Past exam of the mathematics course of the University of Cambridge 2019 ii Paper 1 39A b i Solution by
Codex 0 Created 2026-09-24 Updated 2026-10-03
The undisturbed gas has , , and hence . The disturbance from the receding piston is a right-moving simple wave, so this invariant remains zero throughout it:
Let be the time at which the relevant characteristic leaves the piston. The boundary condition is there. Both and are constant along this characteristic, whose speed isHence is determined implicitly by the receding-piston rarefaction wave equationWithin , the solution is thereforeFor , the gas remains undisturbed: and . The speed bound keeps and positive, and monotonic increase of makes this an expanding rarefaction wave rather than a characteristic-crossing compression.
Past exam of the mathematics course of the University of Cambridge 2019 ii Paper 1 30K c iii Solution by
Codex 0 Created 2026-09-24 Updated 2026-09-29
Assume (iii). Fix and , and defineThis is a stopping time: . Applying (iii) at time first to and then to the deterministic stopping time givesSubtracting yieldsBy the defining characterization of conditional expectation, this says . Thus is a martingale, proving (i). Together the three implications establish the characterization of a martingale by stopped expectations.
Past exam of the mathematics course of the University of Cambridge 2019 ii Paper 1 30K c ii Solution by
Codex 0 Created 2026-09-24 Updated 2026-09-29
Assume (ii). A martingale has constant expected value by the tower property of conditional expectation, so for every stopping time and every ,This is (iii).
Past exam of the mathematics course of the University of Cambridge 2019 ii Paper 1 30K c i Solution by
Codex 0 Created 2026-09-24 Updated 2026-09-29
Assume (i), and let be a stopping time. The increments of the stopped process satisfyBecause , taking conditional expectation given makes the right-hand side zero. Integrability follows froma finite sum of integrable random variables. Hence is a martingale, proving (ii).
Past exam of the mathematics course of the University of Cambridge 2019 ii Paper 1 28K c ii Solution by
Codex 0 Created 2026-09-24 Updated 2026-09-29
Because almost surely, no infinite portion of the jump chain is hidden inside a finite time interval. After either chain leaves a state , the event that it ever returns is therefore the same event for both chains. Hence irreducibility and recurrence pass between a CTMC and its jump chain gives
Past exam of the mathematics course of the University of Cambridge 2019 ii Paper 1 28K c i Solution by
Codex 0 Created 2026-09-24 Updated 2026-09-29
The jump chain of is exactly : from it visits next with probability . Consequently the two chains have exactly the same directed paths of positive-probability transitions. Thus
Past exam of the mathematics course of the University of Cambridge 2019 ii Paper 1 27K b iv Solution by
Codex 0 Created 2026-09-24 Updated 2026-09-29
Combining the preceding parts,This is the characteristic function of . The uniqueness theorem for characteristic functions therefore givesWhen , this means the degenerate distribution concentrated at the origin. This proves the Maxwell characterization of the normal distribution.
Past exam of the mathematics course of the University of Cambridge 2019 ii Paper 1 27K b iii Solution by
Codex 0 Created 2026-09-24 Updated 2026-09-29
First, . For every ,It cannot vanish: if for some , thenwould imply for every positive integer , contradicting continuity at zero. Thus . Since every characteristic function has modulus at most one,
Now set . It is continuous, nonnegative, and additive:The classification of a continuous additive function on the nonnegative real numbers gives , where . Consequently
Past exam of the mathematics course of the University of Cambridge 2019 ii Paper 1 27K b ii Solution by
Codex 0 Created 2026-09-24 Updated 2026-09-29
Independence of the coordinates gives factorization of their joint characteristic function of a random vector. Orthogonal invariance under coordinate permutations makes all coordinate marginals identical. Hence, for and ,Therefore
Past exam of the mathematics course of the University of Cambridge 2019 ii Paper 1 27K b i Solution by
Codex 0 Created 2026-09-24 Updated 2026-09-29
For an orthogonal matrix , invariance in distribution givesThe orthogonal group is transitive on each Euclidean sphere, so depends only on . DefineThe continuity of a characteristic function makes continuous. Taking also gives , and henceso is real-valued. Thusas for every orthogonally invariant random vector.
Past exam of the mathematics course of the University of Cambridge 2019 ii Paper 1 25F a iv Solution by
Codex 0 Created 2026-09-24 Updated 2026-09-29
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





