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 2006 iii Paper 66 6 c Solution by
Codex 0 Created 2026-10-03 Updated 2026-10-14
Use the quartic treble-knot representation of a quadratic B-spline. Specify the indexing as well as the controls: for the interior of the long curve, take the quartic spline knot sequenceWith the standard B-spline convention that control multiplies supported on , the answer isIn other words, keep the three interior quartic Bézier curve controls for each span in that order. The offset matters for the stated knot indexing; shifting all indices together gives an equivalent convention.
To prove the representation, insert each integer interior knot once, changing multiplicity three to four. A degree-four knot of multiplicity four separates Bézier curve spans while leaving their shared endpoint common. The three interior controls remain, and knot insertion constructs the shared endpoint from its neighboring controls with weights , since adjacent knot intervals have equal length. In fact,The right endpoint is obtained in the same way. Hence every extracted quartic span has exactly the five controls proved in part (b). Knot insertion leaves the curve unchanged, so the assembled quartic B-spline is identical to the original quadratic one on every span.
There is also a derivative check at each join:This is why treble knots are appropriate: degree four with interior knot multiplicity three permits continuity, exactly the generic continuity of the uniform quadratic B-spline. For a finite clamped curve, include its endpoint controls and endpoint knot multiplicities using the same degree elevation of Bernstein coefficients and knot insertion; the displayed formulas describe the long interior requested here, without imposing an unstated end condition.
Past exam of the mathematics course of the University of Cambridge 2006 iii Paper 66 6 b Solution by
Codex 0 Created 2026-10-03 Updated 2026-10-14
Use degree elevation of Bernstein coefficients. If are degree- Bézier curve controls, the identical curve has degree- controlsThis follows by multiplying each degree- Bernstein basis polynomial by and collecting the degree- terms, so the operation changes the representation, not the curve.
For the quadratic controls in part (a), the cubic controls areRaise these cubic Bézier curve controls once more. ThenThus the requested quartic Bézier curve controls, expressed in the original polygon, areEach expression is an affine combination whose coefficients sum to one. Endpoint positions and derivatives are preserved at each degree-raising step, as is every point of the span.
Past exam of the mathematics course of the University of Cambridge 2006 iii Paper 66 6 a Solution by
Codex 0 Created 2026-10-03 Updated 2026-10-14
Choose the knot origin so the span most influenced by is , and use its local parameter . The three active uniform quadratic B-spline basis functions giveThe central coefficient reaches its maximum at , so this is indeed the span centered on the strongest influence of . Express it in the quadratic Bernstein basis:Matching constant, linear and quadratic coefficients gives the quadratic Bézier curve controlsFor example, and , checking the endpoint derivatives and the joins of neighboring spans.
Past exam of the mathematics course of the University of Cambridge 2006 iii Paper 66 5 f Solution by
Codex 0 Created 2026-10-03 Updated 2026-10-14
Choose coefficients using the local subdivision matrix, not just by copying a pleasant-looking regular stencil. Because the grids alternate, form the matrix for a complete two-step cycle around the valence- extraordinary subdivision vertex, retaining a large enough neighborhood that it maps into itself. The three local coefficients enter this matrix through the specified vertex and face rules.
First require constant reproduction and commutation with affine maps: every target stencil must sum to one, and the valence-four rules must reduce to the regular ones already found. A propagation mask need not itself sum to one. For example, with an old-vertex target rule , normalization requires ; a face-centroid target rule separately has corner weights summing to one. If face weights depend on incident valences, impose their sum on each actual face, rather than incorrectly using a propagation-column normalization. Rotational and reflection symmetry around the vertex should preserve an isotropic treatment of its sectors. Nonnegative coefficients are desirable for convex hull bounds and stability, although they are not by themselves a smoothness proof.
For convergence, seek a simple eigenvalue one corresponding to the constant eigenvector, with all remaining eigenvalues of modulus below one. For a well-defined tangent plane, seek two independent, semisimple tangent modes with a common positive subdominant eigenvalue:The angular modes should be the first sine and cosine modes around the ring. On the regular lattice the full two-step tangent scale is , which provides a useful consistency check. These requirements suppress persistent unwanted modes and ensure that generic first-order geometry is dominated by a two-dimensional tangent space.
Then check that the characteristic map of a subdivision surface built from those tangent eigenvectors is regular and injective on the punctured neighborhood. A dominant tangent pair together with a regular, nonfolding characteristic map is the crucial target; eigenvalues alone are insufficient. This check rules out folds or vanishing tangent area that a spectrum cannot detect. For reasonable curvature behavior, also try to keep second-order modes at or below in modulus, with equality and appropriate mode structure when nonzero finite curvature is desired. Avoid negative or complex modes that produce visible alternating ripples, excessive shrinkage and strongly anisotropic shape response.
These are selection criteria, not a uniquely determined triple of coefficients. The disappearance of extraordinary faces after one step simplifies the subsequent local matrix, but the extraordinary vertex remains and its smoothness still needs these tests. In particular, the regular result cannot simply be assigned to arbitrary valence.
Past exam of the mathematics course of the University of Cambridge 2006 iii Paper 66 5 e Solution by
Codex 0 Created 2026-10-03 Updated 2026-10-14
A two-dimensional box spline built from spanning directions is piecewise polynomial of total degree at most . Here there are eight directions, counting multiplicities, so the regular pieces have total degree six. This is total degree, not separate degree six in each parameter.
For the box spline smoothness criterion, let be the smallest number of directions whose removal leaves a set that does not span the plane. In this direction multiset, a line can contain at most two of the eight vectors, since each of the four distinct directions appears twice. At least six vectors must therefore be removed, and removing the six outside one chosen direction does achieve loss of rank. Hence , givingIn particular all fourth partial derivatives are continuous across the piece boundaries; generic fifth derivatives need not be. The box spline criterion and this degree-six four-direction example are documented in the primary paper 4–8 Subdivision. The factor count also explains the large support: the extra smoothing comes from repeating all four directional averaging factors. This regular-grid calculation does not establish at an extraordinary subdivision vertex.
Past exam of the mathematics course of the University of Cambridge 2006 iii Paper 66 5 d Solution by
Codex 0 Created 2026-10-03 Updated 2026-10-14
The factorization of the binary subdivision mask identifies eight box spline directions. Apart from the monomial that centers the support, it isThe four normalized factors correspond respectively to averaging in the directions , each with multiplicity two. The factor four is the determinant of the binary dilation in two dimensions. The centering monomial translates the resulting box spline and changes neither its polynomial degree nor its smoothness. Thus this is the twice-smoothed four-direction box spline, rather than a tensor-product bicubic B-spline.
Past exam of the mathematics course of the University of Cambridge 2006 iii Paper 66 5 c Solution by
Codex 0 Created 2026-10-03 Updated 2026-10-14
In a regular region, moving one control point adds its displacement multiplied by a translate of the twice-smoothed four-direction box spline. Measure parameter distances in original grid-edge units, with the affected control point at the origin. The convex hull of the binary mask offsets isAfter successive binary refinements the physical displacements are scaled by . Their possible accumulated offsets therefore form . The box spline description confirms that this zonotope is the actual support, not merely a loose enclosure. Equivalently,It is an octagon with vertices . Its enclosing square is six original grid intervals wide in each direction. Cutting four right triangles of area two from this square gives area parameter-square units. Outside this octagon the control-point displacement has no effect; its closure is the support, although the basis function can vanish on its boundary.
The regular influence footprint is this width-six, area-28 parameter octagon. For a nonplanar control mesh, the affected part of the spatial surface is the image of the octagon, not necessarily a planar octagon of the same metric size. Near an extraordinary subdivision vertex, use the actual refinement neighborhood instead of assuming a globally regular lattice footprint.
Past exam of the mathematics course of the University of Cambridge 2006 iii Paper 66 5 b Solution by
Codex 0 Created 2026-10-03 Updated 2026-10-14
Write the Laurent generating function of the one-step subdivision mask asFor quincunx subdivision, . A second step gives . Setting and , its fine-grid offset is , since . Hence the binary mask is the convolution of with its -transformed copy:Expanding gives the centered binary propagation subdivision mask, with row and column offsets running from to :The numerator entries sum to , so , appropriate for a binary surface refinement. More specifically, each of the four parity classes sums to one after division by , checking constant reproduction at every type of new lattice point.
Past exam of the mathematics course of the University of Cambridge 2006 iii Paper 66 5 a Solution by
Codex 0 Created 2026-10-03 Updated 2026-10-14
The printed diagram is a propagation subdivision mask: it shows the influence of one old vertex on several new vertices. Its entries do not all belong to a single averaging stencil. The old vertex is retained, and a new vertex is inserted at each incident face centre. Reading the contributions arriving at a target givesThus each new vertex-vertex averages its old value and its four edge neighbors, while each new face-vertex is the centroid of its four old corners. Both stencils are convex combinations, reproduce constants and commute with affine maps. The neighboring contributions go to old vertices; the diagonal contributions go to face centres. The propagation coefficients sum to two because one refinement doubles the number of lattice vertices, not because either stencil fails to sum to one.
For calculations, describe this quincunx subdivision usingThe refined square lattice is rotated by and its spacing is reduced by . In its integer coordinates, the one-step mask isIndeed, a unit step in these new coordinates is an old face-centre displacement, whereas a diagonal step reaches an old edge neighbor. The even parity class contains the central and four diagonal coefficients and sums to one; the odd class contains the four axial coefficients and also sums to one. This checks the two target stencils independently.
Past exam of the mathematics course of the University of Cambridge 2006 iii Paper 66 4 b Solution by
Codex 0 Created 2026-10-03 Updated 2026-10-14
Orient the plane relative to the eye. For its affine function , assume and put . The desired closed half-space is . If the eye is on the plane, the notion of its side is undefined and a side convention must be supplied.
Apply recursive half-space clipping of a subdivision curve to each initial curve piece. Obtain a certified bounding volume , and calculate , . For a control-point convex hull, these extrema occur at its vertices, so this test is inexpensive. If , discard the piece. If , retain the whole piece and draw its chord only when its certified flatness is within the screen-space tolerance; otherwise subdivide and draw the children in parameter order. If , subdivide and repeat the classification.
At a sufficiently flat and sufficiently short terminal piece, clip the approximating chord from to against . If both endpoints are nonnegative retain the chord; if both are negative discard the chord; for opposite signs split it atRetain the portion with nonnegative . Handle an endpoint exactly on the plane without dividing by zero, and retain a coplanar chord under the closed-half-space convention. The recursion yields an ordered polyline rather than connecting endpoints of disconnected retained pieces.
Crucially, do not reject an unresolved whole curve merely because its endpoints have negative signs: it can cross the plane twice and have a visible interior excursion. The preceding terminal chord rule is a rendering approximation at an explicitly chosen spatial tolerance. A flatness bound and a diameter bound make any missed leaf-sized excursion spatially small; they do not prove exact crossing topology, especially for a near-tangent contact or an unfavorable projection. Use the actual viewing projection to enforce a screen-space tolerance, with special handling near a perspective singularity.
If exact clipping intervals are required for a spline representation, isolate all roots of , split at them and classify each intervening interval. Bernstein basis coefficient bounds, derivative bounds and recursive subdivision can isolate roots on polynomial spans, including even-multiplicity tangencies. Treat identically coplanar spans separately. For a general subdivision curve, keep unresolved straddling pieces flagged or refine to the chosen tolerance instead of claiming that a finite endpoint-sign test is exact. Certified half-space rejection combined with adaptive subdivision is the recursive drawing algorithm; exact boundary topology needs additional root isolation.
Past exam of the mathematics course of the University of Cambridge 2006 iii Paper 66 4 a Solution by
Codex 0 Created 2026-10-03 Updated 2026-10-14
A subdivision curve should support subdivision curve interrogation rather than merely supply successively larger control polygons. Its interface should provide the parameter interval, orientation and open/closed status; endpoint and limit-point evaluation to a prescribed accuracy; and tangent vector or derivative evaluation where defined. It should be possible to split a parameter interval, commonly at its midpoint, into equivalent restricted curve definitions while retaining all neighboring controls needed by the refinement rule.
For geometric algorithms, request a certified bounding volume for each restricted curve, such as a convex hull or an axis-aligned bounding box, and the minimum and maximum of a plane's linear function over that bound. Request also a certified flatness bound: the maximum distance of the restricted limit curve from its endpoint chord, together with its spatial extent. These allow safe rejection, adaptive drawing and accuracy control. A positive, constant-reproducing subdivision mask often makes a control-point convex hull a valid bound. With negative mask coefficients this must be proved separately or replaced by a padded bound; it cannot simply be assumed.
Further useful enquiries include roots of a scalar function along the curve, closest-point searches, arc length, and inversion of an arc-length parametrization. They can be implemented through evaluation, differentiation, certified bounds and recursive subdivision. Evaluation, restriction, enclosure and error bounds are the essential primitives needed for reliable clipping and rendering; an unqualified control-polygon approximation is insufficient.
Past exam of the mathematics course of the University of Cambridge 2006 iii Paper 66 3 b Solution by
Codex 0 Created 2026-10-03 Updated 2026-10-14
Use the equal-time points to estimate velocity and acceleration with centered finite differences:At the endpoints use one-sided formulas of the desired order. A differentiated path and its time parametrization can instead supply these quantities. Let denote the gravitational acceleration, directed downwards. In the accelerating camera, the effective downward vector is , so the locally felt upward vector is . For a stationary camera this gives , fixing the sign.
The apparent-gravity camera frame is obtained by orthogonal projection and a cross product:When , are perpendicular unit vectors, and completes a right-handed orthonormal basis: . Also , so the felt-up vector lies in the plane, with its transverse component pointing towards positive .
The stated exclusion of ensures , but it does not ensure . If felt-up is parallel to travel, the roll angle is undetermined rather than the construction being impossible. Every transverse orthonormal basis then has the required plane property. For continuity, project the previous into and normalize it, using . If this projection is also too small, choose a coordinate unit vector least aligned with and project that vector instead. Switch to this transported choice near the parallel case to avoid numerical amplification. A stopped vehicle likewise needs a chosen limiting travel tangent vector, since its zero velocity itself has no direction. None of this requires a Frenet frame, which can fail where curvature vanishes.
Past exam of the mathematics course of the University of Cambridge 2006 iii Paper 66 3 a Solution by
Codex 0 Created 2026-10-03 Updated 2026-10-14
Use the prescribed-speed time parametrization of a curve. On a regular part traversed in increasing , let and assume the prescribed speed is positive. The chain rule for velocity givesIntegrate this scalar ordinary differential equation with an adaptive Runge-Kutta method, arranging output at the exact times . Evaluate . Internal integration steps may be shorter than ; output interpolation must meet the same error tolerance, so variable numerical steps do not create variable frame times.
An equivalent implementation precomputesby adaptive numerical integration. This function is strictly increasing. Bracket each in the table and invert using safeguarded Newton method or interval bisection; monotonicity makes each solution unique. Stop at , with a shorter final time interval if the total travel time is not a multiple of . This accounts for changes in both the curve's parameter speed and the physical speed, unlike equal increments in .
If the specified speed vanishes, examine the reciprocal-speed integral at that event. It may diverge, giving asymptotic approach, or be integrable, giving arrival in finite time. A scalar speed does not determine whether motion reverses or how it resumes after stopping; such behavior needs the physical dynamics or a chosen continuation. The positive-speed formula applies between these events, with the direction changed if the traversal reverses.
Past exam of the mathematics course of the University of Cambridge 2006 iii Paper 64 5 e Solution by
Codex 0 Created 2026-10-03 Updated 2026-10-14
Use the real three-dimensional space of traceless matricesThus is a quadratic form of signature . The adjoint action of preserves trace and determinant. Connectedness puts its image in .
A kernel element commutes with every traceless matrix and with the identity, hence with every real matrix; it is therefore scalar. Determinant one leaves . The derivative is injective and both groups have dimension three, so the image is open and equals the identity component. Consequently
Past exam of the mathematics course of the University of Cambridge 2006 iii Paper 64 5 d Solution by
Codex 0 Created 2026-10-03 Updated 2026-10-14
The imaginary quaternions form Euclidean . Conjugation by a unit quaternion acts byIt preserves the imaginary subspace and its norm, and continuity from gives determinant . The kernel consists of quaternions commuting with all imaginary quaternions, hence is .
For a unit imaginary quaternion , take . If is perpendicular to , quaternion multiplication giveswhile the component parallel to is unchanged. This produces the rotation through angle about axis , and every element of has such an axis-angle description. The map is surjective, yieldingThe half-angle also explains why and give the same rotation.
Past exam of the mathematics course of the University of Cambridge 2006 iii Paper 64 5 c Solution by
Codex 0 Created 2026-10-03 Updated 2026-10-14
The space of real matrices has a determinant form of signature : writeThe action of preserves this determinant. Each factor is connected by polar decomposition of an invertible real matrix: its orthogonal factor lies in connected and its positive factor is an exponential of a symmetric traceless matrix. Thus the image is contained in .
If the action is trivial, gives , and fixing every makes a scalar matrix. Determinant one gives . The kernel is therefore the diagonal . Its discreteness makes the differential injective; domain and target both have dimension six. An open subgroup of connected is the whole group, soAgain the kernel is diagonal, and the target is the identity component.
Past exam of the mathematics course of the University of Cambridge 2006 iii Paper 64 5 b Solution by
Codex 0 Created 2026-10-03 Updated 2026-10-14
Identify a Minkowski vector with the Hermitian matrix representation of Minkowski four-vectorsFor , the real-linear action preserves Hermiticity and the determinant, so it preserves the Lorentz quadratic form. It also preserves the cone of positive-definite Hermitian matrices, hence the future timelike cone. The group is connected, by polar decomposition of an invertible complex matrix into and positive determinant-one Hermitian matrices. Thus its image lies in the proper orthochronous Lorentz group.
If for every Hermitian , taking makes unitary; the remaining equations then say it commutes with every Hermitian matrix. Their real span is all Hermitian matrices and their complex span is all complex matrices, so is scalar. The determinant condition leaves precisely . A discrete kernel gives an injective differential, and the real dimensions of both groups are six. The image is therefore open and equals the connected Lorentz group:The quotient does not include the disconnected time-reversing component of .
Past exam of the mathematics course of the University of Cambridge 2006 iii Paper 64 5 a Solution by
Codex 0 Created 2026-10-03 Updated 2026-10-14
Identify with the quaternions, and use the identification of unit quaternions with proved in the root Solution. The actionpreserves the Euclidean norm by multiplicativity of quaternion norms. It is a homomorphism : its domain is connected, so the orthogonal image has determinant .
An element in the kernel fixes , giving . Fixing every other means commutes with all quaternions, so is real; since it has unit norm, . Hence the kernel is the diagonal subgroup .
The differential acts as for imaginary quaternions . If it vanishes, gives , and commutation with all makes real and imaginary, hence zero. The differential is injective, and both Lie algebras have dimension six. The image is therefore an open subgroup of connected , hence all of . Thuswhere acts diagonally, not separately on the two factors.
Past exam of the mathematics course of the University of Cambridge 2006 iii Paper 62 4 d Solution by
Codex 0 Created 2026-10-03 Updated 2026-10-14
The continuity and Cosmological Euler equation in synchronous gauge combine particularly simply. Differentiate and add :The velocity terms cancel by the Cosmological Euler equation in synchronous gauge, so this step does not require setting the initial velocity exactly to zero.
For subhorizon modes deep in radiation domination, take the rapidly oscillating radiation perturbation to be negligible in the averaged gravitational forcing. Also neglect the subdominant matter self-gravity to leading order in . With and , the resulting equation isIntegrating twice giveswhere the arbitrary reference time makes the logarithm dimensionless and can be absorbed into . This is logarithmic growth of matter perturbations during radiation domination.
The neglect of matter self-gravity is needed for the displayed form to be exact within the leading radiation-background approximation. Uniform radiation alone leaves a nonzero term if the cold-matter density is retained. Relative to , its coefficient is , small deep in the radiation era but not near equality. The Mészáros equation retains that effect in a matter-plus-radiation background; its solution basis tends to a constant and a logarithm at , recovering the present leading result. It connects smoothly to matter-era growth rather than allowing the logarithmic approximation to be extrapolated indefinitely.
Galaxy-scale modes enter the Hubble radius before matter-radiation equality. The earlier radiation forcing and horizon-entry matching ordinarily generate a nonzero logarithmic coefficient, even though subsequent oscillatory radiation forcing is small. A Fourier mode with entry time accumulates before equality. Across a large scale-factor range this factor need not be small, so treating the density contrast as exactly frozen would lose an important part of the galaxy-scale seed amplitude and its scale dependence. Growth is nevertheless much slower than in matter domination. This is the Mészáros effect, and the logarithmic matching contributes to the small-scale matter cold-dark-matter transfer function.
Past exam of the mathematics course of the University of Cambridge 2006 iii Paper 62 4 c Solution by
Codex 0 Created 2026-10-03 Updated 2026-10-14
With negligible cold-dark-matter velocity, the synchronous perfect-fluid density equation gives . Differentiate and use the trace Einstein equation, taking the cold matter sound speed to vanish and its density to dominate:In a spatially flat matter-dominated universe, , , and the conformal Friedmann equation gives . HencePut . The indicial equation is . These two independent modes span the solution space, soEquivalently the growing mode is proportional to and the decaying mode to . The coefficients are set by initial data. Since synchronous gauge has residual coordinate modes, interpreting the density contrast physically requires fixing its residual freedom consistently, for example by the cold-matter rest frame and metric tensor integration convention; the mode equation alone is not a gauge-invariant observable.
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





