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 2004 iii Paper 70 3 iii Solution by
Codex 0 Created 2026-10-03 Updated 2026-10-14
Use the influence result and quadratic degree preservation to find each local limit piece, rather than assuming its smoothness. On , only matter. Extend these three values to a quadratic across the uniform grid. Every refinement adds , so the accumulated offset tends toBy locality this gives the same limit as the original data on the chosen interval. Put and . The limit piece is consequentlyAt the right edge center it hasThe next piece gives the same value and derivative at its left endpoint. The second derivatives on the two sides are instead and , which generally differ. HenceThere is one continuous derivative in addition to the continuous curve itself. Special data such as a globally quadratic sequence can make higher derivatives match.
Past exam of the mathematics course of the University of Cambridge 2004 iii Paper 70 3 ii Solution by
Codex 0 Created 2026-10-03 Updated 2026-10-14
Use coordinates in which the current spacing is . On the first child subgrid, the polynomial candidate ison the second it isFor arbitrary sufficiently long uniformly spaced data, all refined vertices can lie on one degree- polynomial only if these two candidate polynomials agree. They agree with when . For , expansion givesThus quadratics preserve their degree, although not the same values.
For a polynomial of degree , subtract the two finite Taylor expansions. The first-derivative term cancels, while the leading nonzero differential term isIf the leading coefficient of is , this difference has nonzero coefficient at degree ; the higher derivatives have lower degree and cannot cancel it. Therefore the polynomial degree preservation under Chaikin subdivision holds exactly forThis is a general refinement property, independent of accidental interpolation through a small finite number of vertices.
Past exam of the mathematics course of the University of Cambridge 2004 iii Paper 70 3 i Solution by
Codex 0 Created 2026-10-03 Updated 2026-10-14
Let the original abscissae be and vary only the ordinate of vertex . Under Chaikin subdivision, the two child values on an edge are and . All influence weights are nonnegative, so no cancellation removes an active descendant.
At level the spacing is . If the leftmost influenced vertex is at , the next leftmost is the quarter point on the preceding edge, ; the rightmost advances by the same amount. Starting at , the influenced vertex range is thereforeThe neighboring zero vertices bound any extra affected polygon segments by one refined spacing, which tends to zero. Passing to the limit givesIt spans three original grid intervals, with its endpoints at original edge centers. Positive descendant weights occur arbitrarily close to each endpoint, so this is the exact support closure. The support of a stationary subdivision scheme concerns the limit curve, not only the first pair of adjacent original edges. This describes interior vertices or an infinite uniform sequence; a finite open polygon needs an endpoint convention.
Past exam of the mathematics course of the University of Cambridge 2004 iii Paper 70 2 iii Solution by
Codex 0 Created 2026-10-03 Updated 2026-10-14
Scale the equal intervals to unit length. A nonzero compactly supported cubic B-spline with maximum continuity is , so its fourth derivative is a sum of impulses at the knots. Equivalently it is a combination of truncated cubes,To vanish to the right of its support, the polynomial tail must be identically zero. Expanding that tail requires for . Four or fewer distinct knots give a full-rank Vandermonde matrix and only the zero solution. Hence a nonzero function requires at least five knots, or four intervals. At knots , the one-dimensional nullspace has coefficients proportional to . The unscaled combination integrates to six on , so unit-integral cardinal normalization gives:This is the Cardinal cubic B-spline, nonnegative with support . To obtain its cubic B-spline Bézier extraction, use local parameter on interval . The four power-form numerators, with a common divisor six, areFor , the cubic Bernstein basis coefficients are , , , . Applying this conversion givesEach scalar row describes a cubic Bézier curve graph piece with abscissa controls . The truncated-cube construction proves value, first- and second-derivative agreement at all joins, including the zero exterior. Minimum support and maximum continuity determine the basis up to a scalar; the displayed normalization fixes that remaining freedom.
Past exam of the mathematics course of the University of Cambridge 2004 iii Paper 70 2 ii Solution by
Codex 0 Created 2026-10-03 Updated 2026-10-14
A degree- B-spline basis keeps the positive partition of unity and convex hull properties while introducing local support. At a generic parameter value, only consecutive basis functions are nonzero. Moving one control point therefore changes only its support interval, unlike a generic interior Bézier curve control, which affects the whole polynomial segment.
Many low-degree pieces can represent a long curve with automatic continuity. At a knot of multiplicity , the generic continuity is ; simple cubic knots give . Knot positions and multiplicities control the placement of detail and joins. Knot insertion can refine the representation without changing the curve, and local refinement avoids raising the global polynomial degree. Thus B-splines combine geometric bounds, local editing and controlled smoothness with a fixed low degree. Clamped end knots can also give endpoint interpolation.
Past exam of the mathematics course of the University of Cambridge 2004 iii Paper 70 2 i Solution by
Codex 0 Created 2026-10-03 Updated 2026-10-14
The degree- Bernstein basis on isThe associated Bézier curve is . The basis is nonnegative and has partition of unity, since . Thus the curve is a convex combination of its control points, giving the convex hull enclosure useful for geometric bounds. The same identity makes the construction invariant under application of affine functions.
It interpolates its endpoint controls, , , and its endpoint tangent vectors are and . These follow fromThe control polygon therefore gives direct geometric editing and tangent control. Repeated interpolation by the De Casteljau algorithm evaluates and subdivides the curve without converting to a monomial representation. Together, positive geometric weights, simple endpoint behavior and stable subdivision make this basis useful in computer aided geometric design.
Past exam of the mathematics course of the University of Cambridge 2004 iii Paper 70 1 ii Solution by
Codex 0 Created 2026-10-03 Updated 2026-10-14
Compute twice the four opposite face areas and their weighted vertex average:These positive weights make an interior convex combination. To verify the incenter of a tetrahedron, put . The altitude from to its opposite face is . Signed distance to that face is affine and vanishes at the other three vertices, so has distance . The same argument works for every face. HenceThe sphere of radius centered at is tangent to all four faces. Equality of the four distances conversely forces these face-area weights, proving uniqueness.
Past exam of the mathematics course of the University of Cambridge 2004 iii Paper 70 1 i Solution by
Codex 0 Created 2026-10-03 Updated 2026-10-14
Use vectors in three-dimensional Euclidean space, with the usual dot product and cross product. The following explicit assignments compute the circumcenter of a tetrahedron:General position means . The reciprocal cross-product identities give , and . Consequentlyand likewise for . Thus is the unique point equidistant from the four vertices. It can lie outside the tetrahedron; no inside constraint should be imposed.
Past exam of the mathematics course of the University of Cambridge 2004 iii Paper 7 4 iii Solution by
Codex 0 Created 2026-10-03 Updated 2026-10-14
We derive the required Calderón–Zygmund decomposition and apply the preceding two parts. Use the Fourier transform convention , and put . The Plancherel theorem givesFor completeness this starts with smooth rapidly decreasing inputs, where , and extends by density. It agrees with the pointwise convolution in the question: if in , then . Thus there is no need to assume that itself is integrable.
Fix , let , and choose . Select the maximal dyadic cubes for which . They exist above every qualifying cube because averages over increasingly large ancestors tend to zero. They are disjoint, their total volume is at most , and maximality givesOutside their union, dyadic differentiation gives almost everywhere. One can obtain this differentiation fact from the allowed martingale convergence theorem: on each fixed dyadic cube the averages are conditional expectations of the integrable restriction, their almost-everywhere limit exists, and approximation by dyadic step functions shows in that this limit is .
Let , define outside the selected cubes and on , and set . This constructswith the estimatesThese follow by integrating separately on each selected cube; gives both the good-part norm bound and the last cancellation-error bound.
Let , with the dilation from part (ii). Then . On its complement, part (i), followed by part (ii), givesFinally, implies or . The first alternative is controlled by the operator bound, and the second by the last integral outside . HenceThus has weak type , with a constant depending only on the dimension, the bounded Fourier transform, and the Hörmander integral kernel condition.
Past exam of the mathematics course of the University of Cambridge 2004 iii Paper 7 4 ii Solution by
Codex 0 Created 2026-10-03 Updated 2026-10-14
Let be the center and the side length of . The zero integral of lets us subtract a constant kernel value:Choose . For outside the concentric cube of side length , and for ,Thus the domain of integration in is contained in . After the translations and , the Hörmander integral kernel condition givesIf the difference is zero and the same inequality holds. Apply the triangle inequality and Tonelli theorem to obtain the cancellation estimate outside a dilated cube:In particular the constant on the right is the same as in the hypothesis; only the dilation depends on the dimension.
Past exam of the mathematics course of the University of Cambridge 2004 iii Paper 7 4 i Solution by
Codex 0 Created 2026-10-03 Updated 2026-10-14
The defining convolution integral is absolutely convergent for every when . Indeed, writing with and , the Cauchy-Schwarz inequality givesDisjoint supports imply almost everywhere. The Tonelli theorem therefore yieldsWe may exchange the sum and integral; the resulting numerical series is absolutely convergent. Its triangle inequality givesHere belongs to the stated operator domain, as is implicit when writing . Disjoint supports also ensure that each summand belongs to that domain.
Past exam of the mathematics course of the University of Cambridge 2004 iii Paper 69 5 b Solution by
Codex 0 Created 2026-10-03 Updated 2026-10-14
The stability convention matters. The Cambridge numerical analysis notes define a strict linear stability domain through decay . For a multistep recurrence, robust decay requires every amplification root to lie strictly inside the unit disk. With that convention we can prove the stronger result that this method's strict linear stability domain is empty, and therefore bounded. Mere boundedness of oscillatory sequences gives a different answer, described below.
On the Dahlquist test equation, . With , the amplification polynomial of a multistep method isExclude , where the intended two-step update cannot be solved. If both polynomial roots have modulus below one, their product requires . Butso necessarily . The complex quadratic Schur criterion also requiresIts left-hand side equals , while for its right-hand side is only . The inequality is impossible. ThusFor comparison, the bounded-root stability set of the symmetric two-derivative formula is unbounded. On , rotate the amplification polynomial into a real reciprocal quadratic. Its two roots are distinct and on the unit circle precisely whenequivalently or . In particular, arbitrarily large imaginary parameters give bounded, undamped numerical oscillations. At the two equality thresholds, repeated unit-circle roots produce unbounded solutions. Hence the question's bounded-domain claim holds for the strict decay convention; it does not hold if the phrase is interpreted using the non-growing root condition for a multistep method.
Past exam of the mathematics course of the University of Cambridge 2004 iii Paper 69 5 a Solution by
Codex 0 Created 2026-10-03 Updated 2026-10-14
Along the exact ordinary differential equation solution, the chain rule gives . Insert the exact solution into the symmetric two-step two-derivative formula and expand about the middle time . Its unnormalized local truncation error isThe coefficients of , and are respectivelyThe centered residual is an odd function of , so every even power cancels. The next coefficient isThus the method has order six. Its zero-stability roots at are the simple roots . With sufficiently accurate starts and smooth derivative evaluation maps, convergence of a zero-stable multiderivative method gives sixth-order error on fixed time intervals. The first Dahlquist barrier for ordinary linear multistep methods does not apply, because this is a multiderivative multistep method.
Past exam of the mathematics course of the University of Cambridge 2004 iii Paper 69 4 b Solution by
Codex 0 Created 2026-10-03 Updated 2026-10-14
Use the zero-boundary Sobolev space with . The Poincaré inequality makes this a complete Hilbert space norm. The weak formulation isAssume are measurable and satisfy the supplied bounds almost everywhere. The Cauchy-Schwarz inequality and Poincaré inequality giveBecause and ,This is the coercive variable-coefficient Dirichlet form. If , then ; more generally one may assume . Some such source regularity is necessary to invoke the theorem. All hypotheses of the Lax-Milgram theorem now hold, with coercivity constant and boundedness constant , giving the unique weak solution and every conforming Galerkin method approximation. This argument does not require a pointwise derivative of .
Past exam of the mathematics course of the University of Cambridge 2004 iii Paper 69 4 a Solution by
Codex 0 Created 2026-10-03 Updated 2026-10-14
Let be a real Hilbert space, a bounded bilinear form, and a bounded linear functional. Assume constants , satisfyThe second hypothesis says that is a coercive bilinear form. The Lax-Milgram theorem then supplies a unique weak solution with for every , and .
For a finite-dimensional trial linear subspace , the same boundedness and coercivity constants apply to the restricted form. Since a finite-dimensional subspace is closed, is itself a Hilbert space. Thus there is a unique Galerkin method solution satisfying for every . The Galerkin orthogonality gives the Céa lemma:In particular, approximation by the trial spaces implies numerical convergence. For a complex Hilbert space, replace bilinearity by a sesquilinear form, take antilinear in the test variable, and require .
Past exam of the mathematics course of the University of Cambridge 2004 iii Paper 69 3 b Solution by
Codex 0 Created 2026-10-03 Updated 2026-10-14
For the method of lines in part (a), the Fourier symbol of the spatial operator isEach Fourier mode therefore evolves by , whose multiplier has modulus at most one. The discrete Parseval identity givesThus the fourth-order centered second derivative gives an unconditionally stable semidiscrete evolution in the L2 norm. No time integration method has yet been chosen, so no time-step restriction belongs to this conclusion.
An arbitrary L2 function does not have well-defined point samples. For the stated initial data one may use cell-average projection, . The Cauchy-Schwarz inequality gives , providing a bounded initialization for the stability estimate.
Past exam of the mathematics course of the University of Cambridge 2004 iii Paper 69 3 a Solution by
Codex 0 Created 2026-10-03 Updated 2026-10-14
Expanding the symmetric spatial stencil by the Taylor theorem givesConsistency of a numerical method and cancellation of the term require , , and . Solving this linear system givesThe resulting fourth-order centered second derivative hasThe nonzero next coefficient proves that the highest spatial order of a numerical method is four for this three-parameter stencil.
Past exam of the mathematics course of the University of Cambridge 2004 iii Paper 69 2 b Solution by
Codex 0 Created 2026-10-03 Updated 2026-10-14
Put . The update isUnder , all three weights are nonnegative and sum to one. With the imposed zero Dirichlet boundary conditions, this is a convex combination including any boundary values. Thus the monotone half-grid diffusion update givesDifferences of two computed solutions obey the same estimate, proving numerical stability in the discrete maximum norm, uniformly in .
There is also an L2 norm proof. The diffusion matrix is symmetric and satisfiesSince , every eigenvalue lies in . Hence the eigenvalues of lie in under the same step restriction, and the spectral theorem for real symmetric matrices gives an L2 norm contraction. These stability estimates are valid for the printed recurrence, although they cannot repair its inconsistency with the printed advection equation.
Past exam of the mathematics course of the University of Cambridge 2004 iii Paper 69 2 a Solution by
Codex 0 Created 2026-10-03 Updated 2026-10-14
Write , , and assume are sufficiently smooth for the following Taylor expansions. The symmetric half-grid diffusion consistency calculation giveswhereThe normalized local truncation error of the full update is consequentlyThe PDF prints an advection equation, , whereas this stencil approximates conservative diffusion, . For the literal printed equation the leading defect is , which generally does not vanish: the method is inconsistent, with an normalized defect.
For the intended variable-coefficient conservative diffusion equation, the first two terms cancel and . Under the parabolic step scaling , this is , while the unnormalized one-step local truncation error is . These two orders use different normalizations. With numerical stability and compatible smooth initial and boundary conditions, the intended diffusion problem has global error on a fixed time interval. Positivity and boundedness of alone do not justify the displayed Taylor expansion; coefficient regularity is also needed for that error formula.
Past exam of the mathematics course of the University of Cambridge 2004 iii Paper 69 1 b Solution by
Codex 0 Created 2026-10-03 Updated 2026-10-14
For one stage, first-order consistency of a numerical method gives . The condition then gives . Hence the scheme is the Backward Euler method:It is a one-node collocation Runge-Kutta method with . Specifically, choose a linear polynomial on with and impose . Its derivative is constant, so , exactly the Backward Euler method update.
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





