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 2017 iii Paper 341 5 ii Solution by
Codex 0 Created 2026-10-03 Updated 2026-10-06
Choose a basis of a conforming finite element space and write . Testing the variational problem with each basis function givesThese are also the equations for the Ritz method. The stiffness matrix is symmetric and a positive-definite matrix: for a nonzero coefficient vector , linear independence gives , andThus there is a unique coefficient vector.
Subtracting the exact and discrete variational problems proves Galerkin orthogonality, for every . In the energy norm , the Pythagorean identity yieldsTherefore the Ritz method is the best approximation in the energy norm. The Céa lemma also gives , so any dense sequence of conforming trial spaces converges.
Past exam of the mathematics course of the University of Cambridge 2017 iii Paper 341 5 i Solution by
Codex 0 Created 2026-10-03 Updated 2026-10-14
Use the real Hilbert space , the zero-boundary Sobolev space, with norm . The Poincaré inequality makes this equivalent to its usual Sobolev space norm. Define the symmetric bilinear form and continuous linear functionalThe Cauchy-Schwarz inequality and the sharp interval Poincaré inequality implyThus is a bounded bilinear form and a coercive bilinear form, and is bounded because is square-integrable. The Lax-Milgram theorem supplies a unique weak solution:This is obtained from the differential equation by integration by parts; the test functions have zero boundary trace. Conversely, the weak solution satisfies in the sense of distributions. Since , it belongs to and solves the equation almost everywhere.
Equivalently, the Ritz method minimizesover . Indeed , since the mixed term is . This proves existence and uniqueness of the minimizer directly from the weak solution, as well as its equivalence to the variational problem.
Past exam of the mathematics course of the University of Cambridge 2017 iii Paper 341 4 ii Solution by
Codex 0 Created 2026-10-03 Updated 2026-10-14
The spatial shift in the PDF also requires a boundary value beyond the supplied right endpoint: if is the last interior index, the newest value is outside the interval. Thus the printed Dirichlet method has no specified boundary closure, and no unique stability range can be assigned to it as stated.
For completeness, the literal interior formula has an exact von Neumann stability analysis on an infinite or periodic grid. Substitution of a Fourier mode givesFor the root of a polynomial tending to one as , expansion givesConsequently is unstable: sufficiently small nonzero frequencies have a root of a polynomial of modulus greater than one, and arbitrarily fine periodic grids contain such frequencies.
Conversely, if and , thenFor with ,Since , the complex quadratic Schur criterion yields both roots of a polynomial in the unit disk, strictly inside except at , where they are and . Uniform stability follows directly from the BDF2 discrete energy identity: the modal recurrence is , whose energy decreases because . Summing the modal energies proves a bound independent of the grid and even of ; no eigenvector-separation assumption is needed. This is the stability of a spatially shifted BDF2 stencil. Thus the literal periodic-grid result isThis cannot establish stability of an unspecified Dirichlet boundary condition closure. It also does not restore consistency of a numerical method.
For the intended unshifted backward differentiation formula, a spatial eigenvalue givesThe Schur stability criterion gives the root condition for a multistep method for every , with strict inequalities for . A useful uniform energy method proof, including the repeated interior roots that a bare separation argument would miss, is the BDF2 discrete energy identity. With andthe corrected Dirichlet discrete Laplacian scheme satisfiesThis follows by taking the inner product of with and using summation by parts. It controls both time levels uniformly, regardless of the mesh ratio. Hence the corrected method is stable for
Past exam of the mathematics course of the University of Cambridge 2017 iii Paper 341 4 i Solution by
Codex 0 Created 2026-10-03 Updated 2026-10-06
The original PDF has a spatial shift , so the printed scheme is not the usual second-order BDF discretization. The PDF does have on the right; the TeX aid loses that factor two, and that transcription must not be used.
Let , , and expand an exact smooth heat equation solution about . Relative to the standard unshifted backward differentiation formula, the printed newest value addsDividing the raw residual by , its expansion isIn particular, for the usual refinement with fixed , the term generally diverges. A concrete smooth counterexample is , which satisfies the Dirichlet boundary conditions and has at . Thus the printed scheme has no consistent order under fixed- refinement. Its normalized shift error is , so one could only investigate a special coupled limit such as after specifying a valid boundary closure; it has no standard joint second-order accuracy.
For the likely intended correction , the extra shift terms disappear. The normalized local truncation error isWith a stable, suitably accurate starter, the corrected backward differentiation formula combined with the second-order central difference therefore hasThis is a correction to the printed method, not a claim about it.
Past exam of the mathematics course of the University of Cambridge 2017 iii Paper 341 3 ii Solution by
Codex 0 Created 2026-10-03 Updated 2026-10-06
The printed formula is not a consistent spatial discretization of the stated PDE. The original PDF genuinely has , rather than . Writing , the Taylor expansion givesso it approximates a diffusion coefficient tending to zero. Moreover, and cover , whereas the given Dirichlet boundary conditions belong to . No value at the interior location was prescribed. These are actual source defects, not repairs justified by the TeX conversion.
A conditional analysis of the literal ordinary differential equation system is still possible. If it is closed by imposing on the displayed grid, the negative Dirichlet discrete Laplacian has positive frequencies squaredand each normal mode obeys . For a fixed mesh, every solution is bounded for all time exactly whenEquality produces a linearly growing normal mode for nonzero modal initial velocity; above the threshold there is an exponentially growing normal mode. Since , any gives bounded continuous solutions but unbounded literal discrete solutions on sufficiently fine meshes. For example, , gives , and a growing first sine normal mode. At , every fixed mesh is bounded for all time, but unit first-mode initial velocity has maximal displacement , which diverges on mesh refinement. For uniform-in-mesh, all-time displacement bounds for arbitrary bounded displacement/velocity data in the mesh-weighted L2 norm, the literal closed system therefore requires .
This differs from finite-time stability of a numerical method, governed here by displacement stability of a symmetric semidiscrete wave equation. For the conditional closure above, diagonalization of a matrix gives, with ,Oscillatory modes use , including its value at ; growing modes use . Thus the displacement map is mesh-uniformly bounded on each fixed finite time interval for every fixed real . This is a legitimate finite-time displacement stability estimate, but neither consistency of a numerical method nor the all-time conclusion of part (i). It does not assert a velocity bound in the unweighted displacement norm.
If the intended method instead uses and the full interval, take interior indices , , with zeros at . Its first positive discrete eigenvalue isThe corrected, fixed-mesh all-time condition is , with the same strictness at equality. For every fixed , this holds on all sufficiently fine meshes. This corrected interpretation is stated separately rather than silently replacing the PDF.
Past exam of the mathematics course of the University of Cambridge 2017 iii Paper 341 3 i Solution by
Codex 0 Created 2026-10-03 Updated 2026-10-14
The Dirichlet Laplacian eigenfunctions and positive Dirichlet Laplacian eigenvalues on the interval of length two areA Sturm-Liouville eigenfunction expansion gives , with . Thus all normal modes oscillate precisely when .
To justify a spatially uniform bound for arbitrary appropriate data, assume the usual wave equation energy class and , or smoother compatible data. The energy method conservesThe sharp Poincaré inequality is . For , this makes coercive with constant ; for , coercivity is immediate. The one-dimensional Sobolev representative satisfies by the fundamental theorem of calculus and the Cauchy-Schwarz inequality. Hence the conserved energy bounds uniformly in both variables.
At , the smooth solution is unbounded. At , is unbounded. ThereforeThe bound depends on the initial data; it is not a single bound for all arbitrarily rescaled solutions. The energy-class hypothesis supplies pointwise meaning and excludes undefined rough-data interpretations.
Past exam of the mathematics course of the University of Cambridge 2017 iii Paper 341 2 iii Solution by
Codex 0 Created 2026-10-03 Updated 2026-10-06
On the Dahlquist test equation, , so the amplification polynomial of a multistep method becomesBoth roots of a polynomial, including the parasitic one, must satisfy the root condition for a multistep method.
For , multiply by seven and set . The polynomial is . The complex quadratic Schur criterion says that its roots of a polynomial are strictly in the unit disk ifHere is a direct verification on the entire left half-plane. Put , , , and . Thenand expansion of the squared inequality givesEvery term is nonnegative, and at least one is positive unless . Since , taking square roots proves the strict complex quadratic Schur criterion for . At , the roots of a polynomial are the simple values and . The leading coefficient cannot vanish because . Thus the method at is A-stable. Its order three is compatible with the Second Dahlquist barrier: that barrier concerns first-derivative linear multistep methods, whereas this method uses a second derivative.
For , choose , strictly in the left half-plane. The amplification polynomial of a multistep method reduces toOne root of a polynomial has modulus . Thus the method at is not A-stable.
Past exam of the mathematics course of the University of Cambridge 2017 iii Paper 341 2 ii Solution by
Codex 0 Created 2026-10-03 Updated 2026-10-06
The first characteristic polynomials of a linear multistep method isThe root condition for a multistep method requires and excludes , where the root of a polynomial at one is double. At , the two unit-modulus roots of a polynomial are distinct, so zero-stability holds. For , the first-order consistency of a numerical method identity is , equal to the coefficient of .
Using the permitted Dahlquist equivalence theorem in this multiderivative multistep method setting givesThis means convergence on every fixed finite time interval where the smooth exact solution of a differential equation exists, with consistent starting values and the nearby branch of each implicit solve. More specifically, the convergence of a zero-stable multiderivative method gives order when the starting errors are and both and are locally uniformly Lipschitz continuous on the relevant region.
Past exam of the mathematics course of the University of Cambridge 2017 iii Paper 341 2 i Solution by
Codex 0 Created 2026-10-03 Updated 2026-10-06
Insert an exact smooth solution of a differential equation and expand about . The unscaled local truncation error, with every term moved to the left, isHere the constant, first-derivative, and second-derivative terms all cancel, using the chain rule identity . Hence the formal defect convention givesAt , the coefficient of is , so there is no further cancellation. At any other , the cubic coefficient is nonzero.
There is a degeneracy at : both the first-derivative coefficient and vanish. The raw defect still has the displayed formal order two, but it cannot be normalized by into an ordinary first-order consistency of a numerical method test. Thus a convention requiring this nondegenerate normalization would leave the ODE order undefined at . In either convention, it is not a convergent approximation to arbitrary initial-value data; the next part explains why.
Past exam of the mathematics course of the University of Cambridge 2017 iii Paper 341 1 ii Solution by
Codex 0 Created 2026-10-03 Updated 2026-10-06
For the Dahlquist test equation, put . Eliminating the stages of the Runge-Kutta method gives the stability functionIts poles are , strictly in the right half-plane. To prove A-stability directly, write with . With and , elementary expansion givesTherefore throughout the closed left half-plane; the inequality is strict except at . The method is A-stable. Moreover as , so the Radau IIA method is also L-stable.
Past exam of the mathematics course of the University of Cambridge 2017 iii Paper 341 1 i Solution by
Codex 0 Created 2026-10-03 Updated 2026-10-06
The Lagrange interpolation polynomials at and areTheir integrals giveThus the coefficients are exactly those of a collocation Runge-Kutta method. More explicitly, with stage slopes , the degree-two polynomialsatisfies , , and . These are the collocation Runge-Kutta method equations, and . For an implicit Runge-Kutta method, the nearby stages exist uniquely for sufficiently small under Lipschitz continuity; see stage solvability of an implicit Runge-Kutta method.
Write , , and interpret powers of componentwise. The Butcher order conditions through degree three are verified directly:For the last equality, . However, the necessary degree-four Butcher order condition fails:Consequently, for sufficiently smooth ordinary differential equations, the local truncation error is and the order of a Runge-Kutta method is exactlyThis is the two-stage Radau IIA method; the conclusion follows from the explicit calculations rather than its name.
Past exam of the mathematics course of the University of Cambridge 2017 iii Paper 340 5 c Solution by
Codex 0 Created 2026-10-03 Updated 2026-10-06
Absolute values are missing in the printed formula. For signed real blocks, the intended block mixed norm must beWithout them, at a block has value zero although it is nonzero, and a negative scalar has negative value. For nonintegral , a negative component may not even have a real power. The literal expression therefore is not a norm and does not define the claimed general convex problem. Even integer exponents do not fix all other in the stated range.
With the corrected norm, let be the Holder conjugate exponent: for and for . Blockwise Holder inequality, with equality from a norming block, givesThe duality of block mixed norms identifies the closed compact convex set and the projection residual from the Moreau decompositionFor , the dual blocks are Euclidean balls; for , they are cubes given by componentwise bounds . No injectivity or surjectivity of is required: compactness of the block product makes its linear image compact, and the strictly convex fidelity still gives a unique primal minimizer. For general , the Euclidean projection onto a dual block ball is not generally obtained by radial scaling, so the special clipping formula from the isotropic case should not be reused without further analysis.
Past exam of the mathematics course of the University of Cambridge 2017 iii Paper 340 5 b Solution by
Codex 0 Created 2026-10-03 Updated 2026-10-06
Computing is equivalent to minimizing over , since ranges over precisely . Differentiating with the adjoint operator gives , whose Lipschitz constant is . Starting with any , for example zero, the projected-gradient dual total variation algorithm isThe block formula is the Euclidean projection onto a convex set , since it clips each two-dimensional block to a Euclidean ball of radius . Both components must be clipped together for the isotropic block mixed norm.
For the unscaled forward differences, and likewise in the other direction, so . More exactly, for the one-dimensional path difference has eigenvalues , , and the square-grid operator sums two such spectra. Thus . Finite-dimensional projected gradient descent for a convex objective with an -Lipschitz gradient converges from every feasible starting point to a dual minimizer for fixed . The theorem assumes a nonempty closed convex set, a convex differentiable objective with globally Lipschitz gradient, and a nonempty minimizer set. All hold here: is compact and convex, and is a continuous convex quadratic. Finite-dimensional convergence is of the full sequence, rather than only its objective values.
Consequently any fixed step with is safe on this grid; the more conservative is also safe. The dual minimizer need not be unique because has a null space, but and uniquely. For , the gradient penalty vanishes and , so no positive- step restriction is needed.
Past exam of the mathematics course of the University of Cambridge 2017 iii Paper 340 5 a Solution by
Codex 0 Created 2026-10-03 Updated 2026-10-06
Write and use the real pixelwise inner products. Let be the adjoint operator, defined by . For each nontrivial grid direction its one-dimensional formula iswith the analogous formula in for . Their sum is ; unused components and do not contribute. For , . If discrete divergence is defined, its sign convention is , as in the adjoint of a discrete forward gradient.
Define the compact convex set and its image . The image is compact and convex, hence closed, and contains zero. The finite-dimensional Euclidean duality formula , applied independently at every pixel, givesThus the penalty is the support function . Its convex conjugate is the indicator functional of a constraint set , equal to zero on and infinity elsewhere. For , the conjugate supremum is zero; for , the separation theorem supplies a direction with , and scaling that direction makes the supremum infinite.
The proximal operator is . It exists uniquely because the objective is continuous, coercive and strictly convex. The Moreau decomposition for a proper closed convex function gives . The second term is the Euclidean projection onto a convex set, so the projection residual for discrete total variation isAlternatively, the variational characterization of convex projection says exactly when for every . Hence attains the support function at , giving and the same optimality condition. This supplies a direct verification of the Moreau decomposition step in this instance.
The printed wording needs “the residual after a projection”, rather than “the projection itself”. In general this denoising map is not a projection onto any fixed closed convex set. A metric projection onto a closed convex set is idempotent, while denoising a sufficiently large jump twice shrinks it twice. Concretely, for and data with rows and , the minimizer has rows and . Reapplying the map gives rows and , so it is not idempotent. These formulas have a global certificate: take , all other dual entries zero, giving with rows and ; it saturates every positive row difference and yields the primal optimality condition. The qualification is therefore not merely a consequence of a restricted two-level ansatz.
Past exam of the mathematics course of the University of Cambridge 2017 iii Paper 340 4 d Solution by
Codex 0 Created 2026-10-03 Updated 2026-10-06
Let , with . Its indicator function has L2 norm squared and total variation seminorm on a domain . On the family , the objective is , whose minimizer is . To prove global optimality, a total variation calibration is needed.
Define the bounded radial vector fieldIt satisfies and has a continuous normal component across . Its distributional divergence therefore has no boundary measure, and direct differentiation yields . Although is not compactly supported, multiply it by a smooth radial cutoff equal to one through radius and zero beyond . The extra divergence has magnitude on an annulus of area , hence L2 norm . Smoothing the continuous piecewise field gives compactly supported smooth admissible test vector fields with divergences tending to in , preserving the bound . The dual definition therefore gives for every finite-penalty , and trivially for all other .
Moreover . By the subgradient characterization of an absolutely one-homogeneous functional, for every , and . If , choose ; then . If , choose ; then belongs to , since multiplying the dual bound by a number in preserves it. The previous optimality criterion provesThe quadratic fidelity is strictly convex, so this minimizer is unique, including the threshold . The disk retains its radius on the positive branch and disappears on the zero branch; this is total variation denoising of a disk.
Past exam of the mathematics course of the University of Cambridge 2017 iii Paper 340 4 c Solution by
Codex 0 Created 2026-10-03 Updated 2026-10-06
Work in the real Hilbert space , with and . The penalty is a proper convex function: it is finite at zero, and the bounded-variation space domain is convex. Its subdifferential at a finite-penalty consists of satisfying for every .
Conversely, let be a minimizer. Its penalty is finite since comparison with zero gives a finite objective. For any with , set , where . Convexity gives . Minimality and quadratic expansion then implyLetting yields . The inequality is automatic if . HenceThis also follows from the subdifferential sum rule, since the quadratic term is everywhere continuous and differentiable, and the subgradient optimality condition. The direct proof above needs no unproved existence theorem.
On the entire plane, the printed global BV domain is not closed in the L2 geometry. The usual definition includes an condition. For , belongs to , has finite distributional variation , and fails to belong to . The truncated lies in and tends to in . Its variation is the interior variation plus , and tends to a finite limit. Thus stays bounded but the literal , establishing failure of L2 closure of the global BV domain. One must not infer universal minimizer existence from an inapplicable closed-penalty proximal operator theorem. The standard closed extension uses the homogeneous bounded-variation space, allowing finite distributional variation without global . The optimality equivalence just proved is valid for the literal penalty whenever a minimizer exists; the next datum has an explicit certified minimizer in its domain.
Past exam of the mathematics course of the University of Cambridge 2017 iii Paper 340 4 b Solution by
Codex 0 Created 2026-10-03 Updated 2026-10-06
Take the indicator function inside . For a compactly supported test vector field, integration in and then givesThe vertical derivative term integrates to zero. The absolute pairing is at most one, and test vector fields with along all but arbitrarily short endpoint pieces approach one. Thus . More explicitly, the distributional derivative is , where is Hausdorff measure along the segment. Also .
A Sobolev space function in has each weak derivative represented by an density with respect to planar Lebesgue measure. The nonzero segment measure here is singular with respect to that measure, so this requirement fails. Equivalently, the Sobolev fundamental theorem of calculus on lines would require an absolutely continuous representative on almost every horizontal slice, whereas each slice has a jump. ThereforeThis is the bounded-variation step outside W11 example.
Past exam of the mathematics course of the University of Cambridge 2017 iii Paper 340 4 a Solution by
Codex 0 Created 2026-10-03 Updated 2026-10-06
For real , its total variation seminorm on a domain isThe vector fields have compact support inside , so no boundary term is charged. Taking both and makes this equivalent to a supremum of absolute pairings. When finite, the distributional derivative is a finite vector-valued Radon measure, and the displayed supremum is its total variation norm of a measure. For a smooth function it equals .
The function of bounded variation on a domain belongs to the Banach spaceThe L1 norm is needed because variation alone vanishes on constant functions and is only a seminorm. No smoothness of is part of this definition.
Past exam of the mathematics course of the University of Cambridge 2017 iii Paper 340 3 c Solution by
Codex 0 Created 2026-10-03 Updated 2026-10-06
Use the Lq null space property established above. Fix and order its magnitudes . For a fixed exponent, the sum over the largest entries is the greatest sum over any support of a vector of size at most , so it suffices to verify the property for this ordered support.
If , put . We have : otherwise would have fewer than nonzero entries, and applying the Lq null space property to its support would assert a positive number is less than zero. For , the exponent is negative. ThusThe first inequality uses on the top part; the last uses in the tail. Zero tail entries contribute zero without invoking a negative power of zero. Every other set of size at most has no larger top sum and no smaller complementary sum, so it too satisfies the strict inequality. The preceding equivalence provesThis is monotonicity of uniform sparse recovery in the exponent. If the feasible vector is unique regardless of the objective; if , only the zero vector is relevant. These cases need no threshold argument.
Past exam of the mathematics course of the University of Cambridge 2017 iii Paper 340 3 b Solution by
Codex 0 Created 2026-10-03 Updated 2026-10-06
It is equivalent to minimize or its th power , because taking the th root is strictly increasing. For , this is an Lq quasi-norm, while gives the L1 norm.
Assume the Lq null space property of order . Let have support of a vector with , and let be any distinct feasible vector. Then . The triangle inequality for complex magnitudes and the subadditivity giveFor the same inequality follows directly from the triangle inequality. Since off ,Thus is the unique minimizer.
Conversely, suppose every -sparse vector is the unique minimizer for its measurements. Fix and any with . The vectors and are distinct and satisfy , since . Uniqueness for this therefore implies , exactly the required strict inequality. HenceThe quantifier is uniform over the entire sparse class. Recovery of one particular signed vector alone would not imply this null space property.
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





