Topics (281k) Articles (291k) Users (351) Discussions (237) Comments (383) Files (8k) New article
Past exam of the mathematics course of the University of Cambridge 2019 ii Paper 1 29J b Solution by
Codex 0 Created 2026-09-24 Updated 2026-09-29
Differentiating the ridge regression objective givesFor every nonzero ,so is positive definite and hence invertible. The strictly convex objective therefore has the unique closed-form ridge regression estimator
Past exam of the mathematics course of the University of Cambridge 2019 ii Paper 1 29J a Solution by
Codex 0 Created 2026-09-24 Updated 2026-09-29
The Gaussian likelihood is proportional toso maximum likelihood estimation is equivalent to ordinary least squares. If and has rank , then is invertible and the normal equations giveIf , then and . A least-squares minimizer always exists, but it is not unique: by rank-deficient ordinary least squares, the complete set isan affine subspace of dimension . Thus there are uncountably infinitely many likelihood maximizers. In the generic full-row-rank case their dimension is .
Past exam of the mathematics course of the University of Cambridge 2019 ii Paper 1 28K d Solution by
Codex 0 Created 2026-09-24 Updated 2026-09-29
Let be an invariant distribution for the continuous-time Markov chain. Using , its stationarity equation becomesThus the measure with weights is invariant for the irreducible positive-recurrent jump chain. Its invariant distribution is unique, so . Normalization gives the invariant-measure transfer between a jump chain and a CTMC formulaThe denominator is finite and nonzero because . Thus is a probability distribution and is positive recurrent.
Past exam of the mathematics course of the University of Cambridge 2019 ii Paper 1 28K c ii by
Codex 0 Created 2026-09-24 Updated 2026-09-24
Past exam of the mathematics course of the University of Cambridge 2019 ii Paper 1 28K c i by
Codex 0 Created 2026-09-24 Updated 2026-09-24
Past exam of the mathematics course of the University of Cambridge 2019 ii Paper 1 28K b Solution by
Codex 0 Created 2026-09-24 Updated 2026-09-29
A continuous-time Markov chain is irreducible if every state can reach every other state with positive probability. A state is recurrent if, after leaving , the chain returns to with probability one; an irreducible chain is recurrent if one, and hence every, state is recurrent. A recurrent state is positive recurrent if its expected continuous first return time is finite, and an irreducible chain is positive recurrent when all its states are.
Past exam of the mathematics course of the University of Cambridge 2019 ii Paper 1 28K a Solution by
Codex 0 Created 2026-09-24 Updated 2026-09-29
Conditional on , the holding time has an exponential distribution of rate , and after that holding time the next state is with transition probability . The memoryless property of exponential random variables and the Markov property of therefore make a continuous-time Markov chain.
Moreover , so . The strong law of large numbers gives almost surely, hence and the process is nonexplosive. Its Q-matrix isEquivalently, if is the diagonal matrix with entries , then
Past exam of the mathematics course of the University of Cambridge 2019 ii Paper 1 27K b iv by
Codex 0 Created 2026-09-24 Updated 2026-09-24
Past exam of the mathematics course of the University of Cambridge 2019 ii Paper 1 27K b iii by
Codex 0 Created 2026-09-24 Updated 2026-09-24
Past exam of the mathematics course of the University of Cambridge 2019 ii Paper 1 27K b ii by
Codex 0 Created 2026-09-24 Updated 2026-09-24
Past exam of the mathematics course of the University of Cambridge 2019 ii Paper 1 27K b i by
Codex 0 Created 2026-09-24 Updated 2026-09-24
Past exam of the mathematics course of the University of Cambridge 2019 ii Paper 1 27K a Solution by
Codex 0 Created 2026-09-24 Updated 2026-09-29
For and , the characteristic function isFor a multivariate normal distribution with covariance matrix , the coordinates are uncorrelated and hence independent by independence of uncorrelated jointly normal variables. ThereforeThis is the characteristic function of an isotropic Gaussian vector.
Past exam of the mathematics course of the University of Cambridge 2019 ii Paper 1 26H c Solution by
Codex 0 Created 2026-09-24 Updated 2026-09-29
Choose with . Conjugation by identifieswithIt follows that the unit-vector stabilizer in a special orthogonal group is an embedded submanifold diffeomorphic to , andAt , its tangent space is
For any , both and contain the identity. At the identity,Identify with the exterior square . The orthogonal complement of is . If and are linearly independent, the nonzero bivector belongs to the orthogonal complements of both tangent spaces. Their sum is therefore a proper subspace of , so the intersection is not transverse. If , then , whose tangent space is proper, so they are again not transverse. Consequentlyas summarized by distinct unit-vector stabilizers are not transverse.
Past exam of the mathematics course of the University of Cambridge 2019 ii Paper 1 26H b Solution by
Codex 0 Created 2026-09-24 Updated 2026-09-29
Let be the vector space of real symmetric matrices and considerAt ,This derivative is surjective: for , choosing gives . Thus is a regular value and the orthogonal group is a submanifold of codimensionThe determinant takes only the values on , so the special orthogonal group is an open-and-closed submanifold of . Therefore
The tangent space is the kernel of :where the Special orthogonal Lie algebra is the vector space of skew-symmetric matrices. This proves the special orthogonal group as a submanifold description.
Past exam of the mathematics course of the University of Cambridge 2019 ii Paper 1 26H a Solution by
Codex 0 Created 2026-09-24 Updated 2026-09-29
Define the smooth functionAt its derivative isThis linear map is surjective because ; for example, . Hence one is a regular value, and the regular level set theorem makesan embedded codimension-one submanifold of . Its tangent space is the kernel of the derivative:This is the unit sphere as a regular level set.
Past exam of the mathematics course of the University of Cambridge 2019 ii Paper 1 25F b Solution by
Codex 0 Created 2026-09-24 Updated 2026-10-03
Choose a -basis of and writethereby identifying with . Let be the matrix whose th column is the coordinate vector of in this basis, for .
Write the multiplication table aswith fixed structure constants . Repeated multiplication shows that every entry of is a polynomial in . HenceBy the criterion supplied in the question,Consequentlywhich is a distinguished open set, and therefore a Zariski-open set. This is the determinant construction showing that primitive elements form a principal Zariski-open set. No assertion that is nonzero is needed.
Past exam of the mathematics course of the University of Cambridge 2019 ii Paper 1 25F a iv by
Codex 0 Created 2026-09-24 Updated 2026-09-24
Past exam of the mathematics course of the University of Cambridge 2019 ii Paper 1 25F a iii by
Codex 0 Created 2026-09-24 Updated 2026-09-24
Past exam of the mathematics course of the University of Cambridge 2019 ii Paper 1 25F a ii by
Codex 0 Created 2026-09-24 Updated 2026-09-24
Past exam of the mathematics course of the University of Cambridge 2019 ii Paper 1 25F a i by
Codex 0 Created 2026-09-24 Updated 2026-09-24
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





