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 2015 iii Paper 69 1 iii Solution by
Codex 0 Created 2026-10-03 Updated 2026-10-06
Apply the periodic Korovkin theorem to the constant sequence . Since it fixes the three test functions, the theorem gives for every .
One can also see the rigidity directly. For fixed , the positive linear functional has and is represented by a probability measure. The fixed sine and cosine imply . The integrand is nonnegative with unique zero on the circle, so the measure is . Thus at every point. The operator is uniquely the identity: .
Past exam of the mathematics course of the University of Cambridge 2015 iii Paper 69 1 ii Solution by
Codex 0 Created 2026-10-03 Updated 2026-10-06
Averaging the given Dirichlet kernels gives the normalized Fejér kernelThe geometric-series identity, or summing the sine terms, proves the second equality. At multiples of use its removable value . Therefore , andis a positive linear operator on continuous functions. The Fourier partial sums, viewed as orthogonal projections, fix , so and . They also fix and for degrees at least one, whereas annihilates them. ConsequentlyAll three periodic Korovkin theorem tests converge uniformly. Hence Fejér sums converge uniformly for every continuous periodic function:
Past exam of the mathematics course of the University of Cambridge 2015 iii Paper 69 1 i Solution by
Codex 0 Created 2026-10-03 Updated 2026-10-06
For positive linear operators on continuous functions, a general Korovkin theorem, in its compact Korovkin test space form, can be stated using a test space , where is a compact Hausdorff space. Assume contains a strictly positive function . Require that, for every , the only positive linear functional on with for all is evaluation at . Then convergence on the test space implies convergence on every continuous function:By the Riesz-Markov-Kakutani representation theorem, the functional condition equivalently says that a positive measure with these test moments must be . This permits arbitrary test families, not just the interval tests .
For completeness, let . Positivity gives , so the operator norms are uniformly bounded. If the conclusion failed for some , choose where its error is bounded away from zero. The evaluation functionals have uniformly bounded norm. Compactness of and the Banach-Alaoglu theorem give a subnet on which and converges in the weak-star topology to a positive . For every , uniform test convergence gives . The hypothesis forces , contradicting the chosen errors. Complex-valued functions follow by applying the real result to their real and imaginary parts.
A useful concrete sufficient condition is that and for each there is with and zero set exactly . Its zero moment forces the representing measure to be supported at , while the constant moment fixes its mass.
For the circle, take . The nonnegative function belongs to and vanishes only at on the circle. Thus the periodic Korovkin test set isUniform convergence on these three functions is sufficient for uniform convergence on .
Past exam of the mathematics course of the University of Cambridge 2015 iii Paper 68 5 b Solution by
Codex 0 Created 2026-10-03 Updated 2026-10-06
The original PDF has on the left of the update; the converted TeX omits its . Use the Forward Euler method with and . The explicit time stepping for bounded reaction diffusion update matrix isWhen , the heat update has nonnegative stencil weights and row sums at most one. Hence its induced maximum operator norm is at most one. It is also a symmetric matrix with eigenvaluesall in , so its discrete L2 norm operator bound is at most one too. Let . In either of these norms,Iteration gives the mesh-uniform stability estimateThe same estimate applies to differences of solutions. Adding a per-step defect gives .
This proof only requires and bounded reaction coefficients. It does not assume the full update is nonnegative: a negative can make its middle stencil weight negative when . Nor does it claim contractivity or an all-time bound for every coefficient. The required stability is a bound uniform in the discretization on fixed finite intervals.
Past exam of the mathematics course of the University of Cambridge 2015 iii Paper 68 5 a Solution by
Codex 0 Created 2026-10-03 Updated 2026-10-06
For energy stability for variable-coefficient reaction diffusion, let , let be the Dirichlet discrete Laplacian, and set . Use the mesh-weighted inner product with the corresponding discrete L2 norm. For zero boundary values, summation by parts givesFor a solution, or a difference of two solutions, the energy method givesThe Gronwall inequality therefore provesThe constant is independent of , so this is stability of a numerical method on every fixed finite time interval. The bound allows physical growth if ; stability here does not mean uniform boundedness as .
There is also a uniform maximum-norm bound. At a positive spatial maximum the second difference is nonpositive. Applying this observation to and to its negative gives . With a perturbing source , the Duhamel principle gives the corresponding initial-data bound plus in either norm. Thus the estimate controls accumulated residuals as well as initial perturbations.
Past exam of the mathematics course of the University of Cambridge 2015 iii Paper 68 4 c Solution by
Codex 0 Created 2026-10-03 Updated 2026-10-06
The criterion for algebraic stability of a Runge-Kutta method is and positive semidefiniteness ofThe Runge-Kutta contractivity identity implies that this criterion is sufficient for B-stability, namely contractivity for a dissipative vector field, whenever the stage equations are defined. The implication from algebraic stability to B-stability is the relevant nonlinear theorem; A-stability alone is a linear property.
All weights here are positive, butA positive semidefinite matrix cannot have this negative quadratic value. Hence the method is not algebraically stable. Failure of this sufficient criterion alone would not be a proof of failure of B-stability; no such converse is needed for the question.
Past exam of the mathematics course of the University of Cambridge 2015 iii Paper 68 4 b Solution by
Codex 0 Created 2026-10-03 Updated 2026-10-06
For a Runge-Kutta method, the stability function is . Solving the stage equations on the Dahlquist test equation givesThe denominator has roots of a polynomial , both in the open right half-plane. If , direct expansion givesSince , the modulus of is at most one exactly when . ThusThe method is A-stable. Its stability function has unit modulus on the imaginary axis and tends to one as , so it is not L-stable.
Past exam of the mathematics course of the University of Cambridge 2015 iii Paper 68 4 a Solution by
Codex 0 Created 2026-10-03 Updated 2026-10-06
The tableau is the three-stage Lobatto IIIA method. To check its order of a Runge-Kutta method directly, write , , and . The eight fourth-order conditions for a Runge-Kutta method evaluate toPowers of here mean componentwise powers. For example, , , and , which make the last three checks immediate. These Butcher order conditions establish order at least four for general nonlinear ordinary differential equations.
It is not order five: part (b)'s stability function has expansionThe fifth coefficient already fails on the Dahlquist test equation. The order is exactly four.
Past exam of the mathematics course of the University of Cambridge 2015 iii Paper 68 3 c Solution by
Codex 0 Created 2026-10-03 Updated 2026-10-14
There is a genuine conflict in the printed coefficient assumptions: no uniformly positive coefficient in a zero-boundary Sobolev space exists. A function cannot also obey almost everywhere. Indeed, the Lipschitz truncation has , so Lipschitz truncation preserves zero-boundary Sobolev spaces, giving . But would be the nonzero constant . Its zero gradient contradicts the Poincaré inequality in the zero-boundary Sobolev space. Thus the literal coefficient class is empty.
For the meaningful uniformly elliptic problem, take with , and impose the Dirichlet boundary condition on the unknown and test functions: . Additional regularity of is harmless, but a zero trace for must be removed. The divergence-form elliptic operator is . Integration by parts defines the symmetric bounded bilinear formIn particular,Here is the first Dirichlet Laplacian eigenvalue on the unit square; the Poincaré inequality follows, for example, by applying the one-dimensional inequality in each coordinate and adding. Thus is coercive in the gradient norm on , and the Dirichlet realization of is a positive definite symmetric operator. On its operator domain, .
The required functional and weak equation areBecause , the right side is a bounded linear functional by the Cauchy-Schwarz inequality and Poincaré inequality. The Lax-Milgram theorem gives a unique weak solution, and part (b) proves that it uniquely minimizes . These formulas prove the intended conclusion under the repaired coefficient hypothesis; under the literal hypothesis there is no coefficient to which the conclusion can be applied.
Past exam of the mathematics course of the University of Cambridge 2015 iii Paper 68 3 b Solution by
Codex 0 Created 2026-10-03 Updated 2026-10-06
First let be a bounded linear operator on satisfying the symmetric positive-definiteness convention in part (a). For any direction , expansion of the quadratic functional givesThus vanishing of the first variation in every direction is precisely the weak equation for every . In this whole-space bounded-operator setting it is equivalent to , the Euler-Lagrange equation.
If solves that equation, set . The linear terms cancel:with equality only when . Hence the weak solution is the unique global minimizer. Conversely, any minimizer has zero first variation, and therefore solves the weak equation. For a symmetric bounded bilinear form on a form space , exactly the same calculation gives and for every ; it does not require an unbounded differential operator to map every into .
Existence for every requires an extra hypothesis if “positive definite” means only strict positivity. The coercive operator bound makes the form coercive, so the Lax-Milgram theorem supplies existence and uniqueness. Without that bound, the diagonal operator on sequence space on is symmetric and strictly positive, but belongs to and its formal inverse does not. Thus strict positivity alone proves uniqueness and the minimizing property of a solution when one exists, not existence for all .
Past exam of the mathematics course of the University of Cambridge 2015 iii Paper 68 3 a Solution by
Codex 0 Created 2026-10-03 Updated 2026-10-06
For the quadratic variational principle for a symmetric positive operator below, use a symmetric operator on the real Hilbert space . Strict positive definiteness meansA uniformly positive definite symmetric operator satisfies the stronger coercive operator conditionIn this variational setting, “positive definite” is often used for a symmetric operator with this uniform bound. We will state explicitly where the coercive operator bound is needed. For a bounded linear operator defined on all of , symmetry means that the operator is self-adjoint. For an unbounded operator, positivity is imposed on its operator domain, and the variational formulation is made on its form domain.
Symmetry is essential in a real Hilbert space: positivity of the quadratic expression alone does not imply symmetry. For example, with nonzero real skew-symmetric matrix satisfies , but its quadratic functional has derivative involving , not . A positive definite symmetric operator supplies both the positivity and symmetry needed in part (b).
Past exam of the mathematics course of the University of Cambridge 2015 iii Paper 68 2 b Solution by
Codex 0 Created 2026-10-03 Updated 2026-10-06
Set and . The Dirichlet discrete Laplacian has the eigenvectorsand its negative has the eigenvaluesThe discrete sine transform therefore reduces the method of lines equations to . Each coefficient is an oscillator, a linear function, or a hyperbolic function according to the sign of . A finite collection of oscillators is bounded in every fixed-grid norm. A zero-frequency mode can grow linearly, and a negative-frequency-square mode can grow exponentially. Consequently,is necessary and sufficient for all-time boundedness of a semidiscrete reaction wave equation on this grid. Equality allows bounded displacement only when the initial velocity has zero projection onto the first eigenvector; above it, the growing components must be absent in every unstable mode. A strictly positive spectral gap also gives a time-independent displacement bound uniform over grids whose gaps are bounded below.
The discrete threshold is strictly smaller than , because for , and tends to as . A coarse grid can therefore introduce long-time growth into a continuum problem with . This is distinct from displacement stability of a symmetric semidiscrete wave equation on fixed finite time intervals. As in part (a), if existence of the printed limit is required for every initial datum, no qualifies: any one mode admits oscillatory, secular, or growing initial data, depending on its coefficient.
Past exam of the mathematics course of the University of Cambridge 2015 iii Paper 68 2 a Solution by
Codex 0 Created 2026-10-03 Updated 2026-10-14
Use the Dirichlet Laplacian eigenvalues and eigenfunctions on :An expansion reduces the wave equation to independent ordinary differential equationsWhen , put ; each coefficient isFor finite-energy data and , a uniform spatial bound follows from the energy method, rather than from unjustified absolute summation of the Fourier series. The conserved quantity isThe Poincaré inequality gives . Hence with for , and with for . Since the Dirichlet boundary condition gives , the Cauchy-Schwarz inequality yieldsAt , the first coefficient is , which is unbounded for some admissible data. For , that coefficient has an exponentially growing component for some admissible data. Thus all-time boundedness of a wave equation with a reaction term requiresAt equality, boundedness for a particular data set requires ; the remaining modes are bounded by their spectral gap. Above the threshold, every unstable mode must have its growing component canceled, and any zero-frequency mode must have zero initial velocity. There is no condition on alone for arbitrary specially chosen data.
The printed reference to a limit needs qualification. Bounded oscillations generally have no limit as . If actual existence of that limit for every admissible initial datum is required, no real works: for every , choose with and nonzero pure oscillatory data in that eigenfunction. The boxed inequality answers the intended long-time boundedness question.
Past exam of the mathematics course of the University of Cambridge 2015 iii Paper 68 1 c Solution by
Codex 0 Created 2026-10-03 Updated 2026-10-06
Apply the Dahlquist test equation and put . Every recurrence mode must satisfyThe amplification polynomial of a multistep method, rather than just its root near one, determines absolute stability. Put and use the Cayley transform between the half-plane and diskFor , the characteristic equation becomesIf , the denominator cannot vanish at a root of the characteristic equation: would force , a contradiction. Hence forces , so all amplification roots have modulus less than one. On the imaginary axis the roots have modulus one and are simple: the transformed quadratic has discriminant for imaginary . At they are the two simple roots . Also cannot be a root when and , and the leading coefficient cannot vanish in the closed left half-plane.
If , the root near isFor small negative real it lies below , violating absolute stability. The endpoint deserves separate treatment:One root is always ; the other is the trapezoidal rule multiplier . They are distinct for every finite in the left half-plane. Consequently, with absolute stability understood as the bounded root condition for a multistep method,There is a convention at this reducible endpoint: if A-stability is defined to require every unreduced recurrence mode to decay for , the answer is , since the mode persists at . Canceling the common factor gives the A-stable trapezoidal rule, but cancellation removes an actual starting-error mode of the original two-step recurrence. The fourth-order member is outside either A-stability range.
Past exam of the mathematics course of the University of Cambridge 2015 iii Paper 68 1 b Solution by
Codex 0 Created 2026-10-03 Updated 2026-10-06
Expand the exact solution about . The unscaled local truncation error isOnly odd powers occur in this centered expansion. Unless , the first nonzero coefficient is the coefficient, giving order of a numerical method two. For , that term vanishes but the next coefficient is , giving order of a numerical method four. ThusThese are exact orders for general smooth ordinary differential equations, since the respective first surviving derivatives need not vanish. With starting errors , the zero-stability established in part (a) makes the global error .
Past exam of the mathematics course of the University of Cambridge 2015 iii Paper 68 1 a Solution by
Codex 0 Created 2026-10-03 Updated 2026-10-06
The characteristic polynomials of a linear multistep method areThe consistency of a numerical method conditions hold for every real :Both roots of a polynomial of , namely and , are simple and have modulus one. The root condition for a multistep method therefore gives zero-stability for every . The Dahlquist equivalence theorem now gives convergence for every fixed . As usual, this means convergence of a numerical method on each fixed finite interval for a sufficiently regular ordinary differential equation with a Lipschitz continuous vector field and starting values tending to the exact starting values. When , the implicit time-stepping method update is locally uniquely solvable for sufficiently small , for example by a contraction mapping if . Zero-stability does not assert that a large fixed step is suitable for a stiff differential equation.
Past exam of the mathematics course of the University of Cambridge 2015 iii Paper 67 4 d Solution by
Codex 0 Created 2026-10-03 Updated 2026-10-06
The filtered decomposition is not necessarily frustration-free. Commuting with makes an eigenvector of each term; it does not make that eigenvector a lowest-energy state of each term. This is the distinction expressed by commuting with a ground projector does not imply frustration freeness.
For an explicit positive, two-local counterexample on three qubits, let and , and use the two distinct interaction sets and :Both are positive semidefinite and commute with their sum. The total energy on a computational basis vector isThus has unique ground state , energy , and spectral gap . Since , spectral filtering of Hamiltonian terms leaves both terms unchanged for every normalized filter:But , whereas . The global ground state therefore does not minimize , proving that the resulting decomposition is not a frustration-free Hamiltonian.
There is a useful positive result if the original decomposition already is a frustration-free Hamiltonian. If and , then . Averaging its unitary conjugates with nonnegative gives , while . Thus filtering preserves existing frustration freeness; it does not create it for an arbitrary gapped Hamiltonian.
Past exam of the mathematics course of the University of Cambridge 2015 iii Paper 67 4 c Solution by
Codex 0 Created 2026-10-03 Updated 2026-10-06
For each interaction neighbourhood, setThen the shell term is . Since , its conjugation leaves fixed, so . Since , is precisely the choice of from (b). Therefore the telescoping local-shell decomposition givesNo limiting interchange is needed: the sum has finitely many shells. Each is supported within the union of supports appearing in together with , because its unitary time evolution acts trivially outside that neighbourhood. The individual shell terms need not commute with the full ground state projector; the full filtered sum does.
Past exam of the mathematics course of the University of Cambridge 2015 iii Paper 67 4 b Solution by
Codex 0 Created 2026-10-03 Updated 2026-10-06
Use the Fourier transform convention and define the spectral filtering of Hamiltonian terms byThe normalization means . Since is real and nonnegative, . Thus the stated positive-frequency cutoff also implies for . The integral exists in operator norm, because its integrand has norm at most .
Let , with for . In this eigenbasis,Every matrix element coupling the unique ground state to an excited state vanishes, in either direction. HenceMoreover, linearity and conservation of under its own Heisenberg picture evolution giveEach filtered term is Hermitian, but it need not remain supported on its original set . The tail assumption supplies stronger long-time control than the integrability used here; no additional tail estimate is needed for the requested identities.
Past exam of the mathematics course of the University of Cambridge 2015 iii Paper 67 4 a Solution by
Codex 0 Created 2026-10-03 Updated 2026-10-06
Here is a finite-dimensional form of the Kitaev geometrical lemma. Let be positive operators, with nullspaces and all positive eigenvalues at least . First assume . Let be the orthogonal projections onto those nullspaces, and define their smallest angle between two subspaces byIf either nullspace is zero, set . Then
To prove it, spectral decomposition gives and . Write and . For every vector ,Thus . Since is positive semidefinite, each of its eigenvalues lies in , so . Consequentlyas claimed.
If there is a common nullspace , restrict to and define the angle between and there. The same proof bounds the smallest positive eigenvalue of by , while is its zero-energy subspace. This version gives a spectral gap above a possibly degenerate ground state space.
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





