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 2018 iii Paper 331 1 b ii Solution by
Codex 0 Created 2026-10-03 Updated 2026-10-05
For the growing normal mode in two deep layers,It vanishes at the endpoints of the unstable band and has its unique interior maximum where . Using givesThis is the maximum exponential growth rate, not the real oscillation frequency.
Past exam of the mathematics course of the University of Cambridge 2018 iii Paper 331 1 b i Solution by
Codex 0 Created 2026-10-03 Updated 2026-10-05
Put . In the deep-layer limit, the finite-depth Rayleigh-Taylor dispersion relation gives . Its sign changes atThe Rayleigh-Taylor instability band is ; is neutral and is oscillatory.
Past exam of the mathematics course of the University of Cambridge 2018 iii Paper 331 1 a iii Solution by
Codex 0 Created 2026-10-03 Updated 2026-10-05
Use the linearized boundary condition: evaluate at and discard products of perturbations. The kinematic boundary condition and Young–Laplace equation becomeIncompressible flow and irrotational flow give the Laplace equation for each potential. For a normal mode, the wall conditions selectWith , the kinematic conditions give and . Hence and . Substitution into the dynamic condition gives the finite-depth Rayleigh-Taylor dispersion relation:Its denominator is positive. Assuming and , negative therefore produces a growing branch with , as in Rayleigh-Taylor instability.
Past exam of the mathematics course of the University of Cambridge 2018 iii Paper 331 1 a ii Solution by
Codex 0 Created 2026-10-03 Updated 2026-10-05
The interface is material: fluid particles on remain there. Its material derivative therefore vanishes, giving on the interface. Since , this is the kinematic boundary condition for a free-surface graph on each side. The material derivatives use the respective tangential fluid velocities; they enforce the same moving normal boundary.
The Unsteady Bernoulli equation gives . Absorb the spatially constant functions into the gauges of the velocity potentials. Evaluating at and subtracting the equations yields the stated dynamic boundary condition for an inviscid interface. Surface tension supplies the pressure jump, rather than pressure continuity. Thus the first condition enforces material motion, and the second enforces the Bernoulli pressure balance.
Past exam of the mathematics course of the University of Cambridge 2018 iii Paper 331 1 a i Solution by
Codex 0 Created 2026-10-03 Updated 2026-10-05
For irrotational flow, . An impermeable stationary horizontal wall has zero normal velocity, so the kinematic boundary condition isNo tangential no-slip condition is imposed on these inviscid fluids.
Past exam of the mathematics course of the University of Cambridge 2018 iii Paper 326 3 2 d Solution by
Codex 0 Created 2026-10-03 Updated 2026-10-05
Write for the indicator functional of a constraint set and . ThenBoth terms are convex, hence their infimal convolution is the convex squared distance to a convex set. The closest point theorem in a Hilbert space supplies the unique metric projection onto a closed convex set and gives .
Identify the Hilbert space with its dual space using the Riesz representation theorem. Completing the square yields , while is the support function. The conjugate of the squared distance to a convex set is thereforeFor the closed unit ball, the metric projection onto a closed convex set is if , and otherwise. ThereforeThe last equality uses the Cauchy-Schwarz inequality to compute the unit ball's support function, attained in the direction of when .
Past exam of the mathematics course of the University of Cambridge 2018 iii Paper 326 3 2 c Solution by
Codex 0 Created 2026-10-03 Updated 2026-10-05
For , the definition of the convex conjugate giveswhere the substitution is a bijection of the independent pairs. ThereforeThis infimal convolution identity does not need convexity of or attainment of the inner infimum. The assumptions ensure that both functions have nonempty effective domains; their conjugates never take , so the separated sum is well defined, allowing .
Past exam of the mathematics course of the University of Cambridge 2018 iii Paper 326 3 2 b Solution by
Codex 0 Created 2026-10-03 Updated 2026-10-05
Let . To prove convexity, take with finite values, , and . By the definition of infimum, choose withPut and . Convexity of and givesLet . If either endpoint value is infinite, the convexity inequality is automatic, and gives equality. Thus the infimal convolution of two convex functions is convex under the stated properness assumption. The proof uses approximate minimizing splits, so no attainment of the inner infimum is assumed.
Past exam of the mathematics course of the University of Cambridge 2018 iii Paper 326 3 2 a Solution by
Codex 0 Created 2026-10-03 Updated 2026-10-05
For a functional on a real Banach space, its convex conjugate is defined on the dual space byHere is the dual pairing. For complex spaces, use its real part, equivalently regard the space as real for convex analysis. The convex conjugate is a convex function, being the supremum of affine functions of , even when itself is not convex.
Past exam of the mathematics course of the University of Cambridge 2018 iii Paper 326 3 1 e Solution by
Codex 0 Created 2026-10-03 Updated 2026-10-05
The small-parameter limit depends on data compatibility with the regularizer domain. SetFor every such , optimality givesTaking the upper limit as and then the infimum over proves . Its two nonnegative contributions above must vanish, yielding the general resultIn particular, the requested zero-misfit limit holds when . A sufficient condition is an exact solution with and ; thenMembership of in alone is insufficient. Take , , , and the indicator functional of a constraint set . All positive-parameter objectives are proper extended-real functions with coercivity and sequential lower semicontinuity, with the unique minimizer , yet for every . Thus the first printed limit needs compatibility with the regulariser's effective domain; the second limit remains true under the given assumptions.
Past exam of the mathematics course of the University of Cambridge 2018 iii Paper 326 3 1 d Solution by
Codex 0 Created 2026-10-03 Updated 2026-10-05
Comparison with zero and nonnegativity of the two terms givesThereforeFor a concrete variational regularization example, take a Hilbert space and . The bound forces in norm. Since is a bounded linear operator, , and continuity of the squared norm givesThe same conclusion is not forced by for a regulariser with a nontrivial zero set.
Past exam of the mathematics course of the University of Cambridge 2018 iii Paper 326 3 1 c Solution by
Codex 0 Created 2026-10-03 Updated 2026-10-05
For , abbreviate and . Optimality of the two variational regularization solutions givesAdding shows , so . Rearranging each comparison then gives the monotonicity of data fidelity and regularization penaltyHence the regulariser value is non-increasing and the data misfit is non-decreasing with the parameter. These inequalities hold for any choices of minimizers at the two distinct parameters, including when uniqueness fails.
Past exam of the mathematics course of the University of Cambridge 2018 iii Paper 326 3 1 b Solution by
Codex 0 Created 2026-10-03 Updated 2026-10-05
Use the value function of variational regularization in its selection-independent formBecause , each objective is non-decreasing with , hence so is its infimum. For , the affine function of the parameter at each fixed givesThus is concave.
For continuity, on any interval , comparison using givesIt follows that is a locally Lipschitz function, hence continuous, on . Therefore the value function of variational regularization is non-decreasing, concave and continuous. No uniqueness of minimizers is needed for these conclusions.
Past exam of the mathematics course of the University of Cambridge 2018 iii Paper 326 3 1 a Solution by
Codex 0 Created 2026-10-03 Updated 2026-10-05
First interpret the stated well-definedness as including uniqueness of the global minimizer for each positive parameter. Under that assumption, the parameter continuity of variational regularization follows from the direct method in the calculus of variations argument below.
Let . For large , . Comparison with zero, using , givesCoercivity of therefore bounds the sequence. Take a -convergent subsequence with limit . For any , optimality givesThe last two terms vanish. Sequential lower semicontinuity at the fixed parameter implies . Thus every cluster point is a global minimizer at . Uniqueness makes it , and the subsequence property provesIndeed, a subsequence staying outside a neighborhood of would have a further convergent subsequence, whose limit must be , a contradiction.
The listed existence hypotheses alone do not imply uniqueness or convergence of an arbitrary selection. For example, on , set , , andThis is nonnegative, convex, continuous and has ; every has coercivity. Its minimizers are for all . Along , selecting prevents convergence. Without uniqueness, the valid conclusion is that every cluster point minimizes the limiting objective.
Past exam of the mathematics course of the University of Cambridge 2018 iii Paper 326 2 2 f Solution by
Codex 0 Created 2026-10-03 Updated 2026-10-05
The Iterated Tikhonov regularization update is the proximal operator stepThe objective has coercivity and is weakly sequentially lower semicontinuous and strongly convex, so the direct method in the calculus of variations and uniqueness of a minimizer of a strictly convex function give existence and uniqueness. Its gradient equation iswhich is exactly . The second term penalizes the change from the previous iterate, rather than the norm of relative to zero.
Past exam of the mathematics course of the University of Cambridge 2018 iii Paper 326 2 2 e Solution by
Codex 0 Created 2026-10-03 Updated 2026-10-05
Assume , as in the exact-solution setting used for the preceding source condition for quadratic regularization. Let , , and . Then , and expanding the two squared errors givesThe Cauchy-Schwarz inequality supplies the last line. Thus while the residual remains at least the noise bound,Compatibility of the exact data is essential. If only is retained, let , , , and . The minimum-norm least-squares solution is zero, but the first iterate is and its residual norm is . Its error has increased from zero. Thus the original assertion uses the implicit exact-data assumption from part (c), and is false without it.
Past exam of the mathematics course of the University of Cambridge 2018 iii Paper 326 2 2 d Solution by
Codex 0 Created 2026-10-03 Updated 2026-10-05
Write the residual of an inverse problem as . The iteration can be rearranged asApplying gives . Since is a positive operator, its resolvent operator has operator norm at most one. HenceMore explicitly, taking the inner product of the residual equation with givesThis directly proves the same monotonicity by the Cauchy-Schwarz inequality, including the case . An unresolvable data component in remains unchanged.
Past exam of the mathematics course of the University of Cambridge 2018 iii Paper 326 2 2 c Solution by
Codex 0 Created 2026-10-03 Updated 2026-10-05
With exact data , the iteration error obeysThe source condition for quadratic regularization excludes any null space component. Using its singular system of a compact operator coefficients,By Bernoulli's inequality, . Also . ThereforeSumming the squared coefficients and using Bessel inequality yieldsThis is an a priori error rate from the source condition for quadratic regularization, with constant independent of .
Past exam of the mathematics course of the University of Cambridge 2018 iii Paper 326 2 2 b Solution by
Codex 0 Created 2026-10-03 Updated 2026-10-05
Let , so . By linearity, . The preceding operator norm estimate givesMoreover, has factors on the data singular vectors, and is zero on . Every factor is in , henceThus, for any fixed , one can take and .
The first constant cannot generally be chosen independently of the iteration count. On the l2 sequence space, take , , and noise . At the solution perturbation has normThis disproves a uniform-in- interpretation of the stated first estimate. For a closed operator range, boundedness of the Moore–Penrose inverse of an operator instead supplies the uniform constant .
Past exam of the mathematics course of the University of Cambridge 2018 iii Paper 326 2 2 a Solution by
Codex 0 Created 2026-10-03 Updated 2026-10-05
For Iterated Tikhonov regularization, set and . In a singular system of a compact operator, each coefficient obeysSumming this geometric recurrence givesEquivalently, its iterated Tikhonov spectral filter is . For , the finite geometric sum givesConsequently the inverse coefficient is at most . Thus every is a bounded linear operator withFor exact admissible data, write . The Picard criterion gives , andby dominated convergence theorem. Therefore this is a linear regularization of an inverse problem with discrete parameter ; a family for all positive can be obtained by setting . No upper restriction on the positive step size is needed for this implicit iteration.
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





