Past exam of the mathematics course of the University of Cambridge 2012 iii Paper 19 4 Solution Created 2026-10-03 Updated 2026-10-07
The multiplicative norm first rules out zero divisors: if and , then forces . If the dimension is zero the claimed bound already holds, so suppose it is positive.
It is worth checking that the printed description of a ring with an underlying real vector space really permits differentiation of multiplication. This follows from the norm identity even if compatibility with real scalars is not separately stated. For fixed , the map is additive by distributivity, andIt is therefore continuous. Additivity gives rational linearity. Approximating a real number by rationals and using continuity proves for every real . The same argument holds in the other variable. This is automatic real bilinearity from a multiplicative norm, so multiplication is a bilinear map between finite-dimensional vector spaces, and hence is smooth.
Let be the unit sphere of the given positive-definite bilinear form. It is a copy of . The squaring mapis well defined because , and is smooth. Commutativity gives its derivativeFor and , the norm identity gives , so the derivative is injective, including on the tangent space . It takes tangent vectors into since maps the sphere to itself. Alternatively, polarization of gives , so directly.
The only identifications under squaring are antipodal:The factorization uses commutativity, and the last implication uses the absence of zero divisors. Conversely . It follows that induces an injective smooth mapThe antipodal quotient map is a local diffeomorphism, so the injectivity of implies injectivity of . Since Real projective space is compact, the stated compact injective immersion is an embedding theorem makes a closed embedding.
For its source and target have the same dimension . The inverse function theorem makes its image open as well as closed in the connected sphere . It is nonempty, so the image is the whole sphere; consequently is a diffeomorphism. But for this is impossible:Indeed, the antipodal two-sheeted covering map has simply connected total space in this range, and is its universal cover, with deck group . A sphere of dimension at least two is simply connected. These fundamental groups cannot be those of homeomorphic spaces.
We have obtained the dimension bound for a commutative Euclidean normed algebra:The real numbers and complex numbers with their usual products and Euclidean norms attain dimensions one and two. In dimension two, the induced map is entirely compatible with the argument: the circle squaring map identifies exactly the two antipodal preimages. We neither assume a multiplicative identity nor use a classification of real division algebras; the squaring argument proves the bound from the supplied hypotheses.
Past exam of the mathematics course of the University of Cambridge 2012 iii Paper 29 2 Solution Created 2026-10-03 Updated 2026-10-07
For the unit-modulus prime values in this question, the Granville-Soundararajan distance isThe second identity uses . Thus it is the Euclidean distance between the finite weighted vectors and . Nonnegativity, symmetry and the triangle inequality follow from that norm representation, and it vanishes exactly when the two prime-value vectors agree. This proves the prime-restriction metric for pretentious distance.
On whole arithmetic functions at fixed it is a pseudometric. For example and have identical values at every prime and zero distance for every , but different values at four. Thus the literal identity-of-indiscernibles assertion needs the prime-restriction quotient.
Since ,For completeness, partial summation and the prime-counting form of the Prime number theorem giveTo verify the constant and the error, replace by in the first expression. Differentiating shows its two contributions combine to plus a constant. The error integral converges absolutely because , and . This proves the Mertens second theorem in the form needed here. In particular the pretentious distance between one and the Möbius function satisfies
For the last request, retain the earlier prime normalization ; the proof also works with the weaker assumption . Without a bound on prime values, the original definition and the absolute convergence of the displayed measure need not apply to an unrestricted multiplicative arithmetic function. For example is multiplicative and squarefree-supported, but for the displayed measure has infinite positive mass: its prime terms alone are , which diverges by the Prime number theorem.
Put , , and use the Fourier transform convention . Since is supported on squarefree integers, the defining property of a multiplicative arithmetic function gives the absolutely convergent Euler productThe bound on prime values gives for squarefree , so the total variation norm of a measure is bounded by ; thus is a finite measure. Expanding the logarithm of the modulus, with an absolute remainder since , givesAll constants here are uniform in . Moreoverusing the pole of the Riemann zeta function. The nonnegative deficits giveIndeed, the replacement of by for costs at mostby the Mertens first theorem, while discarding the terms costs nothing in this lower bound. Thus the large Fourier coefficient criterion for pretentiousness isIn particular,The comparison function is the Archimedean character with this sign because our Fourier transform uses .
Past exam of the mathematics course of the University of Cambridge 2012 iii Paper 36 1 a Solution Created 2026-10-03 Updated 2026-10-07
A statistical path through is a family , defined on an open interval containing zero, with . Write and . Its differentiability in quadratic mean at zero means that there is a square-integrable function such thatThe function is the score function of the statistical path. Thus it is the derivative of the square-root probability density function, multiplied by two and divided by where . The score function is determined only -almost everywhere. The displayed definition also controls any probability mass entering a region where ; a pointwise derivative of the log probability density function alone would not do that. The required derivative is in the square-root-density norm.
Past exam of the mathematics course of the University of Cambridge 2012 iii Paper 48 1 Solution Created 2026-10-03 Updated 2026-10-07
Set and let . A concrete irreducible spin representation is the symmetric powerStart with copies of the defining SU(2) doublet and restrict their tensor product representation to the completely symmetric subspace. Its orthonormal basis consists of symmetric states with up components and down components, where . There are such states. The total generators are , acting on this subspace, where are the Pauli matrices. This also constructs the trivial representation when .
The spin ladder operators satisfyThe Casimir operator commutes with every generator. On the highest-weight vector , the identity gives its eigenvalue . With phases chosen to make the lowering coefficients positive,The squared norm of the lowered state follows from . The ladder stops exactly at . Every weight is connected to every other by these operators, and has distinct eigenvalues. Hence any invariant subspace contains a weight vector and then the whole ladder: the representation is irreducible.
For , successive lowering has squared normThus the normalized highest-weight lowering formula isAll factorial arguments are nonnegative integers, including for half-integral .
The unitary representation of an isospin rotation isIts matrix in the weight basis is . Insert the completeness relation between two operators to obtainThese verify the group representation and unitarity properties, and the ladder argument gives irreducibility. Here rotations carry their SU(2) lifts: . Integer descends to the ordinary SO(3) group; half-integral is a representation of its double cover, not a single-valued representation of .
For , order the basis as . The lowering and raising coefficients give the spin-one half-turn matrixMultiplication shows . Reduce the matrix exponential using this identity:At it becomesThus its matrix elements are . In the pion phases , , this isospin rotation exchanges the two charged states with positive coefficients and negates the neutral state.
Charge conjugation is linear and unitary here. Similarity preserves commutators, soConsequently the conjugated generators obey the same Lie algebra. The specified signs also give . Since and the neutral state has positive charge conjugation eigenvalue,The signs depend on the chosen charged-state phases, which have been fixed by the ladder convention.
Conjugation by changes to , exactly as charge conjugation does. Their product, the G parity operator, therefore satisfiesThe Schur lemma makes scalar on each irreducible isospin multiplet, hence independent of . On the neutral pion, . Therefore the pion G-parity is
Past exam of the mathematics course of the University of Cambridge 2012 iii Paper 48 2 Solution Created 2026-10-03 Updated 2026-10-07
Use the full definition of the special unitary group: and . The determinant condition is essential for the alternating tensors; unitarity alone would instead define . Assume when discussing proper invariant subspaces.
Let be the fundamental representation. A tensor belongs to . Its SU(n) tensor transformation isSince , complex conjugation exchanges upper fundamental and lower dual factors. Reordering the two index groups shows that is a tensor.
The invariant tensors follow directly. The Kronecker delta transforms to . For the alternating tensors, the determinant expansion givesThe lower tensor is preserved in the same way using . Thus , and are invariant.
When , the permutation of two upper slots commutes with the tensor product representation. Its and eigenspaces are nonzero proper invariant subspaces. The same argument uses two lower slots when . The remaining rank-two case splits into scalar multiples of and traceless second-rank tensors, since tensor contraction is equivariant. This covers every case except the fundamental, dual fundamental and scalar cases specified in the question. Those three are irreducible: the special unitary group acts transitively on unit vectors in its fundamental space, so a nonzero invariant subspace must be the full space, and the dual has the same property.
A symmetric tensor of upper rank has one component for each multiplicity vector with nonnegative entries and . Equivalently it is a homogeneous degree- polynomial in variables. Counting these monomials givesFor a totally antisymmetric tensor, any repeated index gives zero and the remaining components are indexed by increasing -element subsets. HenceThese are the dimensions of the symmetric power and exterior power, respectively.
For SU(4), the two-index antisymmetric representation has complex dimension six. To establish a six-dimensional real representation, one must exhibit a real structure; simply counting six complex components would give twelve real components. Normalize and define the antilinear mapThe invariant Hermitian form identifies the conjugate indices with lower indices, and the invariant volume tensor then returns an upper pair. Thus commutes with SU(4). The identitygives . Its fixed space hasThree arbitrary complex entries specify all the others, giving exactly six real degrees of freedom. The real structure of the SU4 exterior square therefore provesThe ordinary Hermitian norm restricts to an invariant positive real inner product on this fixed space.
Irreducible representations classify states because an exact symmetry commutes with the Hamiltonian, preserving energy eigenspaces. Irreducible multiplets are the smallest sets closed under all symmetry transformations; their labels and Casimir operators provide quantum numbers. Approximate flavour symmetry gives approximate multiplets and mass relations, with splittings caused by its breaking. Spin and internal quantum numbers are distinct labels.
For the light-quark flavour symmetry in Quantum chromodynamics, the quark flavours form . Their Triple tensor decomposition for the defining sl3 representation isThis algebraic decomposition alone does not determine the allowed ground-state baryons. The three-quark colour singlet is antisymmetric. The no-orbital-excitation ground state has a symmetric spatial wavefunction, so the Pauli exclusion principle requires the combined spin-flavour wavefunction to be symmetric. The three spin-one-half factors haveHere the four-dimensional spin representation has spin , while each doublet has spin . Symmetric decuplet flavour pairs with symmetric spin . The two flavour-octet copies and two spin-doublet copies carry the two-dimensional standard permutation multiplicity space; its tensor square contains one symmetric singlet. Their invariant pairing therefore supplies one octet with spin , not two independent ground-state octets. Antisymmetric flavour would need a completely antisymmetric three-quark spin state, which does not exist.
Equivalently the symmetric spin-flavour SU6 representation hasThus the Pauli constraint on three-quark flavour multiplets gives the concise spectrum classificationThese are the baryon octet and baryon decuplet. The three-quark flavour singlet requires a different spatial permutation symmetry and belongs to excited states, outside the symmetric ground-state approximation used here. If low-lying spatially excited states are also included while their orbital labels are merely suppressed, singlets can occur; the full flavour tensor cube has types . The absence of the singlet from the unexcited ground multiplet is a permutation-symmetry constraint, not a prohibition by alone. Light-quark mass differences make the flavour symmetry approximate rather than exact.
Past exam of the mathematics course of the University of Cambridge 2012 iii Paper 70 6 a Solution Created 2026-10-03 Updated 2026-10-14
An orthonormal multiresolution analysis consists of closed subspaces of a Hilbert space of the Hilbert space such thatThere is a scaling function whose integer function translations form an orthonormal basis of . Consequently form an orthonormal basis of ; in particular is invariant under integer function translations.
Let be the orthogonal complement of in . Nesting, density and the trivial intersection imply the orthogonal direct sumFor example, telescoping and letting , gives this decomposition; the corresponding orthogonal projections converge strongly to zero and the identity by the intersection and density properties.
To construct the orthonormal wavelet, use to write the scaling refinement equation , with and . Put . The orthonormal translates and Fourier periodization criterion proved in part (b), applied to the scaling refinement equation, yieldsThis is the quadrature mirror filter identity. DefineThe Fourier series of is , and . The two rows and form a unitary matrix almost everywhere: both have squared norm one and their inner product is zero. This wavelet completion of a multiresolution filter proves not just orthogonality but completeness. Splitting a finer-scale coefficient Fourier series into its values at and , this invertible two-channel matrix resolves it into a coarse-scale channel and its complementary channel. Thus the integer function translations of form an orthonormal basis of .
The dilated functions therefore form an orthonormal basis of each . The orthogonal direct sum proves the conclusion: every orthonormal multiresolution analysis produces an orthonormal wavelet basis of .
Past exam of the mathematics course of the University of Cambridge 2012 iii Paper 82 5 Solution Created 2026-10-03 Updated 2026-10-14
We first construct a genuinely compact Besicovitch set; a sequence of unrelated small-area sets would not suffice. The compact Kakeya construction from small projections below gives the limiting compact set together with its segments.
Let consist of nonempty compact sets whose horizontal projection is exactly . With the Hausdorff metric this is a complete metric space. Indeed a Hausdorff-Cauchy sequence is eventually contained in one bounded closed rectangle and converges there to a nonempty compact set; horizontal projection is Lipschitz for Hausdorff distance, so its value is preserved in the limit.
For put and . The function is upper semicontinuous. To verify this, cover the compact set by finitely many open intervals with total length less than . Joint continuity of the compact images in the Hausdorff metric puts every sufficiently nearby image inside the same cover. This proves the required upper bound, uniformly over a compact parameter interval when a strict bound holds throughout it.
Fix and . The setis open. It is also dense, by the following explicit finite approximation. Given and tolerance , partition into equal subintervals and choose at each left endpoint. Above that subinterval put the segmentEach segment lies within of its chosen point in . Add a finite -net of points of to their union, ensuring the reverse Hausdorff inclusion. For large the resulting compact set belongs to and has Hausdorff distance less than from . The image of each segment under has length , and the added points contribute zero length. Henceso .
Take a finite grid of 's whose -neighborhoods cover . The finite intersection of the open dense sets is dense and implies . Thusis open and dense. The Baire category theorem gives a compact , and therefore for every .
DefineThis is the continuous image of the compact set , hence compact. Its section at horizontal coordinate is , of measure zero. The Fubini theorem gives . For every slope , horizontal surjectivity supplies , and contains the segment , , of length . Four rotated copies, through angles , cover all unoriented directions. Their finite union is compact, has area zero, and contains a unit subsegment in every direction:The point-line dual construction is the mechanism in Körner's construction; the density calculation above supplies the needed proof, rather than assuming that small-area sets automatically admit a suitable nested limit.
For the multiplier discussion, define by . The Plancherel theorem gives boundedness on . We explain why a putative bound, , would contradict Kakeya packing; duality of Lp spaces then treats .
First, such a bound would force the vector-valued inequalityfor arbitrary directions , where is the half-plane Fourier projection onto the half-plane . To see the important curvature step, let project onto the radius- disk and modulate by . Its conjugated symbol is , tending almost everywhere to . Dilations give the same putative norm bound for every . Apply this common operator to , average over independent random signs, and use the Khintchine inequality. Letting gives the displayed estimate by convergence and Fatou lemma, first for finitely many smooth function functions and then by approximation. The disk has a boundary normal in every direction; a fixed polygon does not.
The geometric input for this overview is the standard finite Perron tree packing used in Fefferman's original proof: for arbitrarily small one obtains long thin rectangles with and , while fixed longitudinal translates are pairwise disjoint. This is a quantitative finite arrangement, stronger than merely having a compact null set. The splitting/sliding procedure subdivides an angular triangle into narrow triangles and overlaps their bases; the extensions along their axes separate in reverse order. Its area estimate has the form relative to the original total triangle area: the merged central part shrinks by at each generation, and the accumulated caps contribute at most . Taking close to one and then large makes the ratio arbitrarily small. Inscribed rectangular portions retain a fixed proportion of the total area. The reflected extensions explain why the translates can be disjoint even though the original rectangles overlap strongly.
Here is the analytic contradiction, with the relevant powers explicit. Take . In coordinates parallel and perpendicular to the long axis , the directional Hilbert transform integrates only along that axis. If the longitudinal interval is , then outside itOn a fixed translate such as , this has magnitude at least . Since up to the harmless choice of half-plane sign, on . Their disjointness gives a lower bound for the vector-valued output norm.
Writing , Hölder's inequality for givesThe putative vector-valued inequality would implywhich is impossible as . The disk multiplier is self-adjoint, so a bound for would give one for its conjugate exponent below two. Thus the disk multiplier is bounded only at among . This explains both the random-sign step and the precise geometric amplification; it is not an assertion that frequency rectangles by themselves produce a logarithmic norm blow-up.
Past exam of the mathematics course of the University of Cambridge 2013 ia Paper 1 5C ii Solution Created 2026-09-24 Updated 2026-10-07
When , the squared norm of their sum is . ThereforeThe minimizing vector is indeed a unit vector. All three pairwise scalar products then equal , so these three unit vectors lie in a plane, separated by degrees.
Past exam of the mathematics course of the University of Cambridge 2013 ia Paper 1 5C Solution 2026-10-07
Two nonzero vectors are linearly independent when forces . Their linear span then has dimension two. If they are linearly dependent, one is a nonzero scalar multiple of the other, and their span has dimension one. Thus the two requested dimensions are .
The Euclidean scalar product and its norm are and . To prove the Cauchy-Schwarz inequality, first handle trivially. Otherwise the squared normgivesEquality holds exactly when the residual vector is zero, meaning the vectors are linearly dependent; this includes the zero-vector cases. Expanding and applying Cauchy-Schwarz then givesTaking nonnegative square roots proves the triangle inequality.
For the unit-vector optimization, let . Independence ensures . The variable part of is , which Cauchy-Schwarz bounds below by . Equality occurs only for the antiparallel unit vector. ThusThis is minimizing a linear functional on a sphere. The two consequences follow below.
Past exam of the mathematics course of the University of Cambridge 2013 ia Paper 1 8B c Solution Created 2026-09-24 Updated 2026-10-07
Use the orthonormal right-handed basisDirect multiplication gives , and . Thus the matrix in this basis isThe last two columns are orthogonal and both have squared norm . Therefore is an orthogonal matrix precisely when , giving the unique positive valueIts determinant is , so it is a proper rotation matrix, not a reflection. The transverse block has cosine and sine both . ConsequentlyWith the oriented axis , the angle is positive by the right-hand rule, since . The axis also follows from the unit-eigenvalue eigenspace. As a check, .
Past exam of the mathematics course of the University of Cambridge 2013 ib Paper 2 3F Solution Created 2026-09-24 Updated 2026-10-07
Both maxima exist by continuity on the compact set . Their sum is nonnegative and vanishes only for . The identities and the triangle inequality follow by applying the corresponding supremum norm facts to and . This proves that is a norm.
For , . Hence the first unit ball has image contained in : derivative evaluation is a bounded linear functional for this norm.
For the supremum norm alone, take . These smooth functions satisfy , but . Thus the second image is unbounded. The distinction is the unboundedness of derivative evaluation in the supremum norm, not a failure of differentiability of the individual functions.
Past exam of the mathematics course of the University of Cambridge 2013 iii Paper 15 2 Solution Created 2026-10-03 Updated 2026-10-07
A Riemannian metric is a smooth field of positive-definite symmetric bilinear forms on the tangent spaces, equivalently a smooth section of with that positivity. Its musical isomorphism isNondegeneracy makes every fiber map an isomorphism. In coordinates the map has matrix , and its inverse has matrix . Smoothness of the inverse follows from the inverse-matrix formula and the nonvanishing determinant. Both maps cover the identity on , giving a smooth vector bundle isomorphism.
For local flattening of a Riemannian metric, choose a manifold chart neighborhood around with closure contained in , and let on . Choose a smooth bump function , with compact support in and equal to one on a smaller neighborhood of . SetThe formulas glue smoothly because the modification is supported strictly inside . A convex combination of positive-definite forms is positive definite. On the metric is exactly , so gives an isometry to a Euclidean open subset. Outside the original metric remains unchanged.
Geodesic completeness means that every geodesic with arbitrary initial point and tangent vector extends for every real affine parameter. On each connected component, the Hopf-Rinow theorem equates this with completeness of the Riemannian distance.
The Euclidean-end claim needs a compact-core interpretation that is absent from its literal hypotheses. Indeed, with , and satisfy those hypotheses. The geodesic reaches the missing unit sphere at and cannot continue within . Thus the printed assumptions alone do not prove completeness.
Here is the intended compact-core completeness for a Euclidean end. Write for the end coordinates and assume additionally thatis compact for every sufficiently large . Choose such an beyond the metric transition and large enough to include the initial point of a geodesic. Its speed is constant. On every segment outside , the Euclidean radius changes at a rate at most , so over a finite parameter interval it cannot exceed . The full segment therefore stays in the compact set . Its velocities also stay in a compact subset of , since their metric norm is fixed and the base set is compact. The smooth geodesic ordinary differential equation consequently extends past any supposed finite endpoint. The reversed-time argument is identical. This proves completeness under the compact-core condition, and explains exactly what the exterior-of-a-ball counterexample lacks.
For upward stability of Riemannian completeness, lengths of all curves satisfy , hence . A -Cauchy sequence is therefore -Cauchy and has a limit because is complete. Smooth positive-definite metrics induce the manifold topology. More explicitly, on a small coordinate ball around , has a bounded largest matrix eigenvalue, so the coordinate straight segment gives . Thus convergence to is also in . That distance is complete, and Hopf-Rinow yieldsFor disconnected , apply this argument on each component.
Past exam of the mathematics course of the University of Cambridge 2013 iii Paper 16 2 Solution Created 2026-10-03 Updated 2026-10-07
Construct the Euclidean lattices in an orthogonal coordinate system whose squared axis lengths areThus an integer coordinate vector has squared norm . These four numbers are linearly independent over : the four sign changes of in their field extension isolate the four coefficients of a rational relation. The independence will distinguish the two flat tori; equality of their length spectra will hold for every positive choice of axis weights.
LetHere and below these integer coordinates are interpreted in the weighted orthogonal axes. Direct multiplication gives , , andIn particular both are full-rank Euclidean lattices. Denote their four generator columns by . Modulo the two matrices have the same columns, and the nonzero words of the given ternary tetracode are exactlyThese are the reductions of , respectively. The first and fourth displayed words are the specified generators, and the middle two arise from their sum and difference, up to sign. Thus reduction modulo maps either Euclidean lattice onto precisely .
To construct a length-preserving correspondence, find the kernels of this reduction. The inverse matrix is . Hence exactly when . These congruences are equivalent toFor clarity, the first congruence is ; subtracting the others gives evenness of each required pair sum. For the matrix the first congruence is ; the remaining congruences again give equality of the four parities. Substitution proves the converse in each case.
Let be the orthogonal reflection changing only coordinate . If the coordinates of are even, this changes their sum by a multiple of ; if all are odd, it changes the sum by modulo . ThereforeEach Euclidean lattice is the disjoint union of its kernel and the eight cosets , since has nine words. Define a map by using on and on each of and . Each piece maps bijectively onto the corresponding coset. Thus is a bijection satisfyingIt also commutes with . The closed geodesics of a flat torus have lengths for nonzero translation vectors in its Euclidean lattice. Consequently the two length spectra agree, including the multiplicities of translation classes and with either consistent orientation convention. If only primitive closed geodesics are counted, the same conclusion follows by removing iterates in increasing order of length: the total multiplicity at is the sum of primitive multiplicities at , and there are only finitely many such contributions below any fixed length. The correspondence need not itself preserve primitiveness to give this conclusion.
It remains to prove the two flat tori are not isometric. An isometry of flat tori lifts to an affine Euclidean isometry; its linear part of an affine map must carry onto . In integer coordinates write this part as . For every , both and have integer coordinates and have equal squared norms. Rational independence of the impliesApply this to for all . Two squared linear forms agreeing on all integer points agree as polynomials; their difference factors, so one form is the other or its negative. Since is invertible, is consequently a diagonal sign change .
Modulo , such a must preserve . Each nonzero word of has exactly three nonzero coordinates, and for each choice of zero coordinate there are just two such words, differing by an overall sign. Preserving these words forces the three signs on each support to agree. The four overlapping supports then force . Thus only and are possible. Neither changes .
Finally : it has the same ternary word as , but their difference is , which fails the congruence defining . Hence and no such linear isometry exists. This completes the tetracode length-isospectral lattice construction.
Past exam of the mathematics course of the University of Cambridge 2013 iii Paper 36 1 b Solution Created 2026-10-03 Updated 2026-10-07
First the null space property implies sparse injectivity. If a nonzero had at most nonzero coordinates, partition its support of a vector into disjoint with . Applying the null space property to each of these sets yieldswhich is impossible. Hence the null space contains no nonzero sparse vector of order .
The feasible vector has , where the L0 sparsity count counts its nonzero coordinates. Any different feasible with would give a nonzero null space vector with at most nonzero coordinates, contrary to sparse injectivity. Consequently every different feasible has strictly larger L0 sparsity count. The unique sparsest feasible vector is :This proof does not treat the L0 sparsity count as a genuine norm; no triangle inequality for it is needed.