Topics (282k) Articles (291k) Users (353) Discussions (237) Comments (383) Files (6k) New article
Past exam of the mathematics course of the University of Cambridge 2011 ii Paper 1 40A iii Solution by
Codex 0 Created 2026-09-24 Updated 2026-10-14
For , the Jacobi method iteration matrix has zero diagonal, nonnegative axial entries , and diagonal-neighbour entries . Its row sums are at most one; they are strictly below one at grid points next to the Dirichlet boundary. Its graph is connected by the positive axial entries.
To prove the strict spectral radius bound, let with and choose a component of maximum magnitude . Thenso . If equality held, every positive-weight neighbour of a maximal component would also have modulus , and that row would have sum one. Propagating along axial edges reaches a boundary-adjacent row, whose sum is strictly less than one, a contradiction. This also covers a one-point interior grid, for which . HenceThe standard convergence theorem for a stationary linear iteration says it converges from every initial vector exactly when its iteration matrix has spectral radius below one. Since is invertible by (i), the error satisfies andWeak row diagonal dominance alone would not prove convergence; the connection to a strictly deficient boundary row supplies the required strictness.
Past exam of the mathematics course of the University of Cambridge 2011 ii Paper 1 40A ii Solution by
Codex 0 Created 2026-09-24 Updated 2026-10-14
Let be the diagonal part of . The weighted Jacobi method isEquivalently it is . In grid form, all neighbours on the right are taken from the old iterate:The boundary values stay zero at every step. The iteration matrix is .
Past exam of the mathematics course of the University of Cambridge 2011 ii Paper 1 40A i Solution by
Codex 0 Created 2026-09-24 Updated 2026-10-14
Take to be the vector of and absorb into . Its diagonal entry is , each axial-neighbour entry is and each diagonal-neighbour entry is . Since these weights agree in both directions, is a symmetric matrix.
Extend a grid vector by zero to the whole integer lattice. Let contain unordered axial-neighbour pairs and unordered diagonal-neighbour pairs. Only finitely many differences involving nonzero values contribute. Each lattice vertex has total neighbour weight , so expanding the squared differences givesIt is nonpositive. If it vanishes, every axial difference vanishes. The axial lattice is connected and is zero outside the finite interior square, forcing . Thus for every nonzero : .
Reordering the grid replaces by for a permutation matrix . This preserves symmetry and the sign of the quadratic form, proving the assertion for any ordering. Multiplying the whole system by merely rescales by a positive number and has the same conclusions.
Past exam of the mathematics course of the University of Cambridge 2011 ii Paper 1 30A iv Solution by
Codex 0 Created 2026-09-24 Updated 2026-10-14
If , the characteristics have constant velocity variable and . This flow is globally defined for every finite at each . ThereforeDirect differentiation gives and the initial value at .
Past exam of the mathematics course of the University of Cambridge 2011 ii Paper 1 30A iii Solution by
Codex 0 Created 2026-09-24 Updated 2026-10-14
The characteristic vector field is a divergence-free vector field:The Jacobian determinant obeys , with . Thus the flow preserves phase-space volume, the Liouville theorem in Hamiltonian mechanics. Changing variables and using (i) givesThis applies on intervals where the flow is a diffeomorphism of the phase space and the integrals are defined; for finite conservation statements require integrability. For instance compactly supported initial data and give the usual setting. An arbitrary smooth need not make these integrals finite on infinite-volume space, and merely smooth does not exclude escape of characteristics to infinity. Equivalently , with no flux through infinity, proves the same Casimir invariant of a transport equation conservation.
Past exam of the mathematics course of the University of Cambridge 2011 ii Paper 1 30A ii Solution by
Codex 0 Created 2026-09-24 Updated 2026-10-14
Every value of the solution is transported unchanged from its initial characteristic endpoint. Therefore the formula from (i) immediately givesMore generally the Hamiltonian transport equation preserves the range of the initial values while its characteristic solution exists: it neither creates negative values nor changes values by a source term.
Past exam of the mathematics course of the University of Cambridge 2011 ii Paper 1 30A i Solution by
Codex 0 Created 2026-09-24 Updated 2026-10-14
In phase-space coordinates , the characteristic equations for a transport equation are the Hamilton equationsSmoothness of gives a unique local Hamiltonian flow . Along it the chain rule gives . ThusThe inverse is the backward autonomous flow, so this formula defines the unique local classical solution wherever the characteristic reaches the initial hypersurface. A smooth Hamiltonian on all of need not have a globally complete flow; the formula is understood on the interval and region where both flows exist. A common global time interval requires the corresponding completeness or growth assumption.
Past exam of the mathematics course of the University of Cambridge 2011 ii Paper 1 2F ii Solution by
Codex 0 Created 2026-09-24 Updated 2026-10-14
For each integer , put . Every derivative is an entire function and cannot be identically zero: otherwise repeated integration would make a polynomial. By the identity theorem for holomorphic functions, its zero set has empty interior, and continuity makes a closed set. Thus is nowhere dense.
The complex plane with its usual metric is a complete metric space, so the Baire category theorem gives . The Taylor series there has coefficients
Past exam of the mathematics course of the University of Cambridge 2011 ii Paper 1 2F i Solution by
Codex 0 Created 2026-09-24 Updated 2026-10-14
The closed-set version of the Baire category theorem says that if a nonempty complete metric space is a countable union of closed sets, then at least one has nonempty interior. Equivalently, a nonempty complete metric space cannot be a countable union of closed nowhere dense sets.
Past exam of the mathematics course of the University of Cambridge 2011 ii Paper 1 29J iii Solution by
Codex 0 Created 2026-09-24 Updated 2026-10-14
Assume and keep , . The constraint is . If the unrestricted optimum in (i) lies in this half-space, it remains optimal. Its cash holding isThus it has strictly positive cash precisely when . If , the free optimum violates the constraint, so strict concavity and the Karush-Kuhn-Tucker conditions put the optimum on the boundary, where it is the cash-free solution in (ii). At equality the two solutions coincide. ThereforeIn particular,The multiplier for the inequality is , explicitly checking the complementary-slackness condition.
Past exam of the mathematics course of the University of Cambridge 2011 ii Paper 1 29J ii Solution by
Codex 0 Created 2026-09-24 Updated 2026-10-14
With , the budget constraint is . On this hyperplane the riskless term is constant, so maximize . The Lagrange multiplier equation gives . If , let and impose the budget constraint:Positive definiteness makes the objective strictly concave on the hyperplane, proving this stationary point is the global constrained optimum. If , the cash-free constraint is feasible only when ; in that degenerate case the optimum is . The displayed quotient, including the one in the question, presupposes .
Past exam of the mathematics course of the University of Cambridge 2011 ii Paper 1 29J i Solution by
Codex 0 Created 2026-09-24 Updated 2026-10-14
Set , , and . The terminal wealth is , a normal random variable with mean and variance . Its moment-generating function givesMaximizing this expected exponential utility is equivalent to maximizing the strictly concave quadratic form . Since the nonsingular covariance is positive definite, the unique stationary point is the unique maximum:
Past exam of the mathematics course of the University of Cambridge 2011 ii Paper 1 27J v Solution by
Codex 0 Created 2026-09-24 Updated 2026-10-14
A path that reaches level from below does so while in state , because is continuous and has slope . At the first crossing time, the residual exponential holding time is memoryless and the Strong Markov property restarts the chain from . Conditional on ever reaching , the probability of subsequently exceeding is therefore exactly the original probability of exceeding . HenceThe zero-level limit is one because the initial holding time is positive almost surely. Also , and it is nonincreasing. Consequently is nondecreasing and additive. First is linear on positive rationals, then monotonicity gives the same result on all positive reals. ThusAbsorption can be viewed as killing at rate , independent of sign changes at rate ; this ensures the maximum is finite almost surely and makes the positive decay rate found in (iv) natural.
Past exam of the mathematics course of the University of Cambridge 2011 ii Paper 1 27J iv Solution by
Codex 0 Created 2026-09-24 Updated 2026-10-14
Past exam of the mathematics course of the University of Cambridge 2011 ii Paper 1 27J iii Solution by
Codex 0 Created 2026-09-24 Updated 2026-10-14
Starting from , the level reaches at time if the first holding time exceeds . This has probability ; surviving beyond also makes the level strictly greater than , as required by the strict event. A switch to at time has density , leaves level , and requires a later rise of . Absorption before reaching cannot succeed. ThereforeHolding times have continuous distributions, so the single endpoint has no effect on the formula.
Past exam of the mathematics course of the University of Cambridge 2011 ii Paper 1 27J ii Solution by
Codex 0 Created 2026-09-24 Updated 2026-10-14
Let and set . Starting from , the first holding time has exponential distribution of rate . Its joint density with a jump to is . Before such a jump decreases to , so the remaining rise needed to exceed is . If instead the jump is to the absorbing state zero, the level stays nonpositive and never exceeds .
Past exam of the mathematics course of the University of Cambridge 2011 ii Paper 1 27J i Solution by
Codex 0 Created 2026-09-24 Updated 2026-10-14
For the natural filtration , a nonnegative random time is a stopping time when for every : whether it has occurred can be decided from the observations already made.
For a time-homogeneous finite-state continuous-time Markov chain, the Strong Markov property says that, on , conditional on , the process has the law of a fresh chain started at and is independent of the earlier history given that state. In particular, with transition matrix ,The property applies also to bounded functions of several future times or of the entire future path.
Past exam of the mathematics course of the University of Cambridge 2011 ii Paper 1 26K iv Solution by
Codex 0 Created 2026-09-24 Updated 2026-10-14
Finite independent Gaussian sums are Gaussian; directly, multiplication of their characteristic functions givesBy Markov inequality, . Part (ii) makes the same sequence converge in distribution to , and the characteristic-function estimate there makes . Uniqueness of distributions determined by characteristic functions therefore yieldsIf , all coefficients vanish and almost surely; here denotes that degenerate distribution.
Past exam of the mathematics course of the University of Cambridge 2011 ii Paper 1 26K iii Solution by
Codex 0 Created 2026-09-24 Updated 2026-10-14
The independent standard Gaussian random variables have mean zero and variance one. For , the mixed products have expectation zero, givinguniformly over as . Thus is Cauchy in the L2 space. Its completeness, proved in (i), suppliesMoreover convergence implies convergence of the means and second moments: and .
Past exam of the mathematics course of the University of Cambridge 2011 ii Paper 1 26K ii Solution by
Codex 0 Created 2026-09-24 Updated 2026-10-14
Suppose in probability. For a fixed real and any , split according to . The supplied exponential inequality and the bound giveLet , then . Thus the characteristic functions converge pointwise to . The Lévy continuity theorem states that pointwise convergence of characteristic functions to a characteristic function continuous at zero implies convergence in distribution. Every characteristic function is continuous at zero, so
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





