Past exam of the mathematics course of the University of Cambridge 2008 ib Paper 1 1E iii Solution Created 2026-09-24 Updated 2026-09-24
Past exam of the mathematics course of the University of Cambridge 2008 ib Paper 1 6D Solution Created 2026-09-24 Updated 2026-09-24
Past exam of the mathematics course of the University of Cambridge 2012 ia Paper 1 2A Solution Created 2026-09-24 Updated 2026-10-07
All the transformations below fix the origin. A planar rotation preserves lengths and angles and turns every vector through one common oriented angle. Its rotation matrix isAn orthogonal reflection in a line fixes that line and reverses its perpendicular direction; reflection in the horizontal axis has reflection matrix . A uniform dilation multiplies every vector by the same positive scale , represented by ; for example doubles lengths. A shear mapping fixes one line pointwise and shifts vectors parallel to that line by an amount proportional to their transverse coordinate. A horizontal shear mapping has matrixwith a nontrivial example.
The first given matrix is the clockwise planar rotation through , namely . Direct multiplication givesThus is a horizontal shear mapping of strength . Because ,So is the composition of that shear mapping followed by an anticlockwise planar rotation through ; order matters. It is not individually one of the four elementary types under these definitions. In particular, its determinant is , but it is not an orthogonal matrix, excluding both a planar rotation and an orthogonal reflection. It is not a scalar matrix, excluding a uniform dilation; its eigenvalues and exclude a pure shear mapping, whose eigenvalues are both . As a symmetric positive-definite matrix, can also be described as stretching two perpendicular principal directions by these reciprocal factors, preserving area.
Past exam of the mathematics course of the University of Cambridge 2012 ia Paper 2 6A Solution Created 2026-09-24 Updated 2026-10-07
Completing squares reveals the geometry of the sheared quartic double-well gradient flow:The critical points satisfy and , so they are , and . The Hessian matrix isAt the origin its determinant is , so is a saddle point, with . At either other critical point, the determinant is and the upper-left entry is , so it is a positive-definite matrix. They are strict local minima; the completed squares show that both are global minima, with .
A contour at level obeysThere are no contours for , two isolated minimum points for , and two separate closed ovals for . At the two lobes meet at the saddle point; near the origin their tangents are . For one closed contour surrounds both minima.
Sheared quartic potential contours and the trajectory to the positive-x minimum
. Along the gradient flow, the gradient-flow dissipation identity isAt the stated initial point, . Its trajectory stays in the invariant sublevel set . This set is compact because is a coercive function. It also excludes every point with , where ; continuity therefore keeps the trajectory in its positive- component.
To justify its limit rather than merely infer it from the sketch, integrate the dissipation identity: is finite. On this compact set the gradient and its time derivative are bounded, so is uniformly continuous. A nonnegative uniformly continuous function with finite integral tends to zero: otherwise separated intervals of a fixed positive height and width would force an infinite integral. Every accumulation point is consequently a critical point. In the positive- component below this energy level the only one is . Compactness then implies convergence, andThis is a compact gradient-flow trapping criterion; the drawn trajectory illustrates, rather than replaces, the convergence proof.
Past exam of the mathematics course of the University of Cambridge 2012 iii Paper 38 2 Solution Created 2026-10-03 Updated 2026-10-07
The autocovariance of an MA(1) process comes directly from shared noise terms:Work with the zero-mean white noise convention and . Put . Suppose the preceding finite-past innovations are mutually orthogonal. Their triangular relation to the observations means that they span the same finite past. For , is a linear combination of , so . Moreover,Projection onto this orthogonal basis therefore has only its last coefficient nonzero:The residual is orthogonal to the entire preceding span, proving the induction. Expanding its variance givesThe initialization is , , and . Each finite covariance matrix is a positive-definite matrix: the last observation in any nonzero finite linear combination contains a noise term absent from earlier observations. Thus all the projection denominators are positive. These are the finite-sample innovations of an MA(1) process, requiring no Gaussian assumption.
Substituting the covariances into the recursion givesThe denominator has a positive limit when . Taking limits gives . The permitted interval selectsFor , every coefficient is zero; at , the roots coincide. This is the limiting MA(1) innovations coefficient. The limiting innovation variance is correspondingly .
For the observed numerical case, and . The exact innovation calculations areTherefore the predictor of based on the two observations and its error variance areFor , the available information is still only . Since its covariances with both and are zero, its orthogonal projection onto that span is zero:This is two-step prediction for an MA(1) process. Applying the next one-step recursion would instead use an observed , which is not available here.
Past exam of the mathematics course of the University of Cambridge 2012 iii Paper 68 3 Solution Created 2026-10-03 Updated 2026-10-07
A Schwartz function is a smooth function for which every seminormis finite. These seminorms define the Fréchet topology of the Schwartz space . The tempered distributions form its continuous linear dual . We use bilinear distribution pairing, with no complex conjugation on the test function.
Differentiation under the Fourier integral and integration by parts giveTherefore each Schwartz seminorm of is bounded by a finite sum of norms of polynomially weighted derivatives of . Insert the integrable weight to bound those norms by finitely many Schwartz seminorms. This proves that is continuous.
To justify inversion without a merely formal exchange of integrals, insert in the inverse integral. The Gaussian Fourier integral givesThe normalized Gaussian is an approximate identity, so the right side tends to ; the left side converges by dominated convergence theorem since is integrable. It follows thatReflection is continuous in Schwartz seminorms, so is continuous as well. This proves the Fourier transform isomorphism of the Schwartz space.
Define the distributional Fourier transform byIt agrees with the ordinary integral transform whenever Fubini applies. Transposing the Schwartz inverse gives an inverse on , and the same squared-transform identity holds. For the usual strong dual topology, a seminorm is for a bounded set . Since a continuous linear Schwartz map takes bounded sets to bounded sets, proves continuity, and similarly for the inverse. Continuity also holds in the weak dual topology. Thus the transform is a continuous isomorphism on tempered distributions, with the stated normalization.
For a real symmetric positive-definite matrix , there is with . The reciprocal is locally integrable in dimension three: the radial factor near zero is . At infinity, rapid decay of a Schwartz test function makes it integrable. More quantitatively,This single seminorm bound proves a tempered distribution. No principal-value extension is needed at the origin.
First calculate the isotropic transform. For and , spherical integration and the supplied sine-integral identity giveThe original functions converge in to by dominated convergence theorem against tests. The transforms are bounded by , which is locally integrable in three dimensions and integrable against Schwartz functions at infinity. HenceLet . The Jacobian is and the dual vector is . The Fourier transform of a reciprocal positive quadratic form is consequentlyThe frequency-origin value is understood distributionally; there is no additional delta term.
For the complex extension use a symmetric matrix with real symmetric and positive real part . Symmetry is natural for a quadratic form; a skew-symmetric part contributes nothing. The bound again gives a regular tempered reciprocal. Both sides of the prospective formula depend holomorphically on the matrix while its real part is positive: compact parameter sets give a common bound for pairing and differentiated integrands. Continue from the real positive matrices along . In a complex neighborhood of , imaginary gives real positive matrices, so the one-variable identity theorem supplies the equality; connected continuation along reaches .
The analytic determinant square root for accretive symmetric matrices must follow that continuation, rather than an arbitrary scalar principal root of . Explicitly, put and let its real eigenvalues be . Thenwhere each factor has positive real part. This is the determinant square root normalized positively on real positive matrices. AlsoThus the quadratic-form square root has the unambiguous branch with positive real part. The accretive complex quadratic reciprocal Fourier transform isUniform local integrability of the right side justifies its analytic continuation as a tempered distribution, not merely pointwise away from the origin.
For the particular form,Substitution gives the required normalized expressionFor every nonzero real , the radicand has positive real part, so the specified square root exists uniquely. Both sides are regular tempered distributions, despite their locally integrable singularities at zero.
