Past exam of the mathematics course of the University of Cambridge 2006 ib Paper 1 9H Solution Created 2026-09-24 Updated 2026-10-14
For a linear map , its rank of a linear map is , and its nullity is . Choose a basis of its kernel and extend it to a basis of . Then span its image. They are linearly independent: a linear combination mapped to zero would belong to the kernel, contradicting independence of the extended basis unless all its coefficients vanish. Hence , provingFor endomorphisms of , define and . The image of the sum lies in the sum of the two images. ThusTo prove the product inequality, restrict to . This map has kernel and image : every vector in the intersection has a preimage in . Applying the rank-nullity theorem to the restricted map givesNow put and . If both equalities hold, , while forces . Therefore , the sum has full rank, and the product has nullity . The sum is an isomorphism and the product is zero.
Conversely, if , then , giving . If the sum is also an isomorphism, its rank is . Thus , and the two inequalities become equalities. This proves the equality in the rank-sum and nullity-product inequalities in both directions.
Past exam of the mathematics course of the University of Cambridge 2006 ib Paper 3 3F Solution Created 2026-09-24 Updated 2026-10-14
The function is Fréchet differentiable at when there is a linear map such thatIf it exists, , as is seen by taking increments along each coordinate axis.
To prove differentiability from continuous partial derivatives, take a small rectangle in the given neighbourhood and split the increment along its sides. The one-variable mean value theorem givesfor some when the corresponding increment is nonzero. If an increment is zero, its term is simply omitted. The required one-variable continuity follows from existence of the corresponding partial derivative on the segment. Subtracting gives a remainder whose absolute value, by continuity of both partial derivatives at , is at mostfor sufficiently small increments. Since is arbitrary, the normalized remainder tends to zero. Thus the function is differentiable at , with the displayed derivative.
Past exam of the mathematics course of the University of Cambridge 2006 iii Paper 33 2 Solution Created 2026-10-03 Updated 2026-10-14
A linear map is a completely positive map if sends every positive operator to a positive operator for every finite-dimensional auxiliary system . Positivity of alone tests only inputs without an auxiliary system and is weaker.
For the Kraus representation, let be any operator on the auxiliary system and the input system. ThenFor any vector , its expectation is . Every amplification is therefore positive, proving the Kraus-form map is completely positive. No normalization condition on the is needed for this positivity proof. To make it a deterministic quantum channel, one additionally requires ; a physical outcome branch instead obeys .
Transposition is positive on one system: for any positive and any , is the complex conjugate of , hence is real and nonnegative. It fails complete positivity already for a qubit. Apply partial transposition to the second subsystem of the Bell state . The resulting operator isOn the antisymmetric vector , its eigenvalue is . Thus the partial transpose is not positive on this entangled input, andThe same witness embeds into any larger input dimension; in the exceptional one-dimensional case transposition is simply the identity.
Past exam of the mathematics course of the University of Cambridge 2006 iii Paper 50 1 Solution Created 2026-10-03 Updated 2026-10-14
For , define the Adjoint representation of a Lie algebra by . The Jacobi identity gives, for every ,Thus preserves brackets and is a Lie algebra representation. Its Killing form isUsing the representation identity and the cyclic property of the trace,The Killing form is also symmetric by cyclicity.
In a basis , write . The lowered structure constants satisfyThe first expression is antisymmetric in and the second in . These transpositions generate all permutations, so is totally antisymmetric.
An invariant subspace of under its Adjoint representation of a Lie algebra is exactly an ideal of a Lie algebra: . A simple Lie algebra has no nonzero proper ideal, proving the adjoint representation is irreducible.
Put . The same trace calculation proves invariance of the Trace form of a Lie algebra representation:Because the are anti-Hermitian, is a real symmetric bilinear form. The Killing form of a simple compact Lie algebra is negative definite. Define a real linear map by . Invariance of both forms implies that commutes with every , while symmetry makes self-adjoint for the positive inner product . By the spectral theorem, its real eigenspaces are invariant under the Adjoint representation of a Lie algebra. Irreducibility forces a single eigenvalue, so and . This also avoids the extra care needed when applying the complex form of the Schur lemma to a real vector space.
The kernel of is an ideal of a Lie algebra. It cannot be all of : a trivial representation of dimension greater than one is reducible. Simplicity therefore makes faithful. For every nonzero ,Hence the positive trace index for a compact simple Lie algebra givesin the adapted basis.
For the cubic trace tensor of a Lie algebra representation, the identityexpands toSet , , , . Cyclicity of converts to and to . Thus the invariance identity for a cubic trace tensor is
For the final contraction, it is important to keep the specified index-raising convention. In the adapted basis write . Then , while raising the last two indices with gives . Total antisymmetry and the definition of the Killing form implyOnly the antisymmetric part of in contributes, soConsequently the Killing-normalized contraction of a cubic trace tensor isThe negative sign printed in the last requested identity is incompatible with raising indices by the inverse Killing form. The opposite sign is obtained if one instead defines the lowered structure constants using the positive Euclidean metric, a different convention from the one specified.
For a concrete check, take the two-dimensional representation of with , where the are Pauli matrices. ThenTheir contraction is , confirming the positive sign with and providing a counterexample to the printed sign.
Past exam of the mathematics course of the University of Cambridge 2006 iii Paper 51 2 Solution Created 2026-10-03 Updated 2026-10-14
Use for inverse temperature, to distinguish it from the order-parameter critical exponent . In a translation-invariant pure thermodynamic phase, the connected two-point correlation function isFor finite correlation length, at it decays exponentially, possibly with an algebraic prefactor; is the asymptotic exponential decay rate. Below an ordered transition the pure phase is selected by taking the thermodynamic limit before or . A zero-field symmetric mixture of the two ordered phases has a nondecaying connected term and does not describe the usual pure-phase magnetic susceptibility.
Let denote extensive physical free energy and . Since the field contributes to the statistical Hamiltonian, differentiation givesExpanding the variance and using translation invariance proves the correlation-function susceptibility sum rule:The sum includes . If the source is instead defined as the dimensionless quantity , the corresponding derivative omits the displayed inverse-temperature factor.
A real-space renormalization group step of length factor uses a local blocking kernel satisfying . For example, a deterministic majority-spin rule assigns one coarse Ising spin to each block; tied blocks can be resolved with equal probabilities. Define the blocked statistical Hamiltonian byThe spacing becomes . All generated interactions, including multispin terms and the field-independent constant, must be retained for an exact transformation. Summing over uses normalization to prove . Iteration gives and .
The coarse probability law is the exact marginal law of these block variables. Indeed, for any coarse observable , its expected value is the microscopic expected value of . A blocking rule that retains the long-wavelength order-parameter mode, with source and observable transformations tracked, therefore retains long-distance response and correlation functions. Their field normalization may change, while their physical length scales and critical singularities do not. Partition-function equality alone would not justify this assertion for an arbitrary kernel that discards all slow variables. Truncating the generated operator family is likewise an approximation.
For the free-energy recursion use dimensionless free energy per site,in the thermodynamic limit. Exact partition-function invariance gives . If one step sends to , the coefficient records the identity-operator contribution from eliminated fluctuations and normalization. ConsequentlyRepeated substitution derives the additive free-energy recursion under blocking:In physical energy units, divide this convention by . The additive term is essential for absolute free energies even when it does not affect the leading critical powers.
A renormalization-group fixed point satisfies . Linearize in scaling coordinates so that . A relevant operator has , an irrelevant operator has , and a marginal operator has with behaviour decided by nonlinear terms. Thus the eigenvalues of the discrete linear map are ; the sign criterion applies to the generator exponents , not to the discrete multipliers. The critical surface is the stable manifold on which every relevant scaling field has been tuned away. Irrelevant coordinates flow to the renormalization-group fixed point along it. A repulsive renormalization-group trajectory leaves the renormalization-group fixed point along an unstable relevant direction, ultimately entering a noncritical phase or another scaling regime.
Local renormalization-group flow in the zero-field slice: attraction along the critical surface and repulsion in the thermal direction
. Details. To separate the singular free-energy density from its regular background, suppose the eliminated-mode contribution is analytic near the renormalization-group fixed point. Look for an analytic background satisfying . Then satisfies . In linear thermal and field coordinates, an analytic monomial has background coefficientprovided the denominator is nonzero. This explicitly explains when analytic subtraction of an inhomogeneous renormalization recursion works. The printed inhomogeneous equation may describe the free-energy function before this subtraction, or a singular part defined only up to analytic terms. The inhomogeneous sum need not be small compared with the full free energy: an analytic constant can dominate a vanishing singular contribution. It can be omitted in deriving leading singular powers after regular subtraction, provided no renormalization-group free-energy resonance, marginal logarithm or dangerously irrelevant coupling obstructs the homogeneous critical asymptotics. At a renormalization-group free-energy resonance , additive logarithms can remain, so simply dropping the term would miss them.
Suppose there are exactly two relevant scaling fields, thermal and magnetic , with positive exponents , and the remaining fields approach a regular limit. Physical reduced temperature and magnetic field agree with these coordinates to leading order, up to nonuniversal metric factors. The homogeneous scaling hypothesis for critical phenomena isas an asymptotic scaling equation. Choose to make the thermal argument or . Defining givesThe two functions describe respectively and : approaching the transition from disordered and ordered sides need not give the same function. In particular the ordered zero-field function has one-sided derivatives associated with spontaneous magnetization. Metric factors multiply this formula in different microscopic normalizations.
The correlation length in Bravais lattice units obeys . At , the same choice of gives . Two thermal derivatives of give . One and two field derivatives give, respectively, and , assuming the relevant branch amplitudes are nonzero. At , choose ; then , so . HenceSimple algebra now gives the Rushbrooke scaling relation and the hyperscaling relation . Also , giving the Widom scaling relation. These statements refer to leading singular contributions with the homogeneous two-field scaling assumptions. Above the upper critical dimension, the quartic coupling is dangerously irrelevant because it is still needed to stabilize the ordered phase; ordinary mean-field critical exponents then satisfy Rushbrooke and Widom but generally not hyperscaling. Marginal logarithms also require qualifications at the upper critical dimension.
For the connected-correlation scaling form , the function tends to a finite nonzero value as and decays exponentially at large , up to powers of , in a massive short-range phase. The scaling ansatz alone does not fix that prefactor. If the usual massive Gaussian field correlation tail applies, matching the powers gives , with a correlation-length-dependent amplitude in fixed by matching the critical scaling form.
In physical coordinates the lattice sum has site-density factor . Its long-distance singular part therefore giveswhere is the area of the unit sphere in dimensions. For , finite , an integrable exponential tail and a nonzero integral, the last factor tends to a finite nonzero constant as . Microscopic distances contribute a regular background. Thus , proving the Fisher scaling relationEquivalently the field has scaling dimension , so its conjugate field has , which gives the same identity from the exponent formulas above.
Past exam of the mathematics course of the University of Cambridge 2006 iii Paper 6 1 Solution Created 2026-10-03 Updated 2026-10-14
First scale the stated unit-ball approximation. For every nonzero residual , apply the hypothesis to and multiply the resulting vector by . This gives withFor zero residual use . Start with , choose by this rule for , and set . Inductively,The Banach space therefore contains the sum , withThe partial sums satisfy . Boundedness of gives convergence of the left side to , while gives . Thus is surjective with the stated lifting bound. This geometric correction for approximate surjectivity used completeness of , not any unproved completeness of .
Put . Given a Cauchy sequence in , choose a subsequence such that for . Lift each difference to with and . Lift to . The sum exists in , and its image is the limit of the subsequence. A Cauchy sequence with a convergent subsequence converges to the same limit: use the triangle inequality between an arbitrary late term, a later subsequence term, and the limit. This proves is complete, the completeness forced by uniformly bounded lifting principle.
The open mapping theorem states that a bounded surjective linear operator between Banach spaces maps open sets to open sets. In particular a bounded linear bijection between Banach spaces has a bounded inverse. To deduce the closed graph theorem, let be an everywhere-defined linear map between Banach spaces with closed graph. Its graph is a closed subspace of the Banach product , with norm , so it is itself Banach. The projectionis a bounded linear bijection. The open mapping theorem makes its inverse bounded. Composing that inverse with the bounded second projection proves that is bounded. This is the required closed graph conclusion, rather than a continuity assumption on .
Finally consider the identity map . If in the new norm and uniformly, each assumed continuous point evaluation functional gives , while uniform convergence gives . Hence . Since both spaces are metric, this sequential argument proves the graph is closed. Both norms are complete, so the closed graph theorem makes bounded. Its inverse is bounded by the open mapping theorem. Consequently there are constants such thatThis proves Banach norm rigidity from continuous point evaluations. Pointwise continuity alone would not give a common bound on all evaluations; completeness supplies that through the closed graph argument.
Past exam of the mathematics course of the University of Cambridge 2006 iii Paper 64 4 Solution Created 2026-10-03 Updated 2026-10-14
A principal bundle with structure group has a smooth free right -action, each fibre is a single orbit, and it is locally equivariantly isomorphic to . A representation defines the associated vector bundleLocal sections of identify with , and changes of section act by on the fibre coordinates.
A principal bundle is trivial if and only if it has a global smooth section. Given , the map is an equivariant isomorphism : freeness and transitivity give its unique inverse on each fibre, and local trivializations make that inverse smooth. Conversely a product bundle has section . This proves principal bundle trivialization by a global section. A contractible paracompact base is a sufficient condition for triviality of such a bundle; local sections alone are insufficient on a general base.
A manifold is parallelizable when its tangent bundle is trivial, equivalently when it possesses a global smooth frame. The circle is an example, with its nowhere-vanishing unit tangent field. The sphere is another: regard it as the unit quaternions. At a unit quaternion , the three tangent vectors are independent and smoothly depend on . Quaternion multiplication preserves the norm, so these form an orthonormal frame. This gives the quaternionic left-invariant frame on the three-sphere.
For any Lie group of dimension , choose a basis of . Left translations defineThese fields are smooth; at every , the differential of the diffeomorphism is invertible, so they are a basis of . Hence every Lie group manifold is parallelizable, as in parallelization of a Lie group by left translations.
For a real semisimple Lie group, let be the Killing form. It is nondegenerate and invariant under the adjoint action. Left translating gives a bi-invariant pseudo-Riemannian metric. For left-invariant fields, the Koszul formula reduces toThus . The curvature convention of Question 1 givesTo obtain the Ricci tensor, trace the linear map . Since ,This proves the Killing-form Einstein metric construction for every real semisimple group. If is compact semisimple, is positive definite and its Ricci tensor is , giving a Riemannian Einstein metric. For a noncompact semisimple group the general Killing-form construction is indefinite. Thus the unrestricted assertion is understood in the pseudo-Riemannian sense appropriate here; positive definiteness is not obtained by simply taking in the noncompact case.
Past exam of the mathematics course of the University of Cambridge 2006 iii Paper 64 5 Solution 2026-10-14
The two unheaded requests are addressed here; the individual group-cover calculations are in the scoped parts below. A quaternion has norm . Thus the unit quaternions form exactly the sphere , with quaternion multiplication giving its smooth group structure. The explicit identification with the special unitary group isThe matrices representing satisfy the quaternion multiplication relations. The displayed matrix obeys and ; conversely every matrix has that form with . Hence is the manifold of unit quaternions, and its group is .
For the exterior-square double cover of SO(3,3), fix a basis and volume element . Define the symmetric bilinear form on the six-dimensional exterior square byIt is symmetric because two-forms commute under the wedge product. PutThen and . The Gram matrix is : the vectors have norm , while have norm . Therefore the quadratic form has signature .
For ,Thus preserves . The special linear group is connected: polar decomposition of an invertible real matrix writes with and positive definite of determinant one, and both factors can be joined to the identity. The image consequently lies in .
If , then for every pair, so preserves every two-plane. A line is an intersection of two such planes, hence every line is preserved. A linear map preserving every line is scalar: apply it to basis vectors and then to their pairwise sums. Thus , and forces . The kernel is exactly . It is discrete, so the derivative of is injective. Both Lie algebras have dimension , making the image open; an open subgroup of a connected group is the whole group. HenceThe identity-component restriction is essential. The same principle of an explicit form-preserving representation, kernel calculation and dimension argument supplies the five remaining covers.
Past exam of the mathematics course of the University of Cambridge 2007 ia Paper 1 6C i Solution Created 2026-09-24 Updated 2026-10-14
Write , with . The linear map sends to and sends to . On the perpendicular plane, and are perpendicular vectors of equal length. ThusThe expression in parentheses is a rotation in three dimensions by about the oriented axis, with the positive direction fixed by the cross product. Therefore the map scales the axial component by , scales the perpendicular component by , and rotates the perpendicular plane by . Since , the angle lies between zero and . This is an axis-angle decomposition, with different axial and transverse scale factors.
Past exam of the mathematics course of the University of Cambridge 2007 ib Paper 1 11H Solution Created 2026-09-24 Updated 2026-10-14
Differentiability at means there is a linear map such thatThis is the Fréchet derivative definition; the same linear approximation must work in every direction, not merely along coordinate axes.
The chain rule says that if is differentiable at and is differentiable at , then is differentiable at andFor its proof, put , , and . Since a linear map between these finite-dimensional normed spaces is bounded, . Differentiability of gives with . ThereforeIf , take ; otherwise . This proves the required full linear approximation.
For the Euclidean norm, at every the ordinary one-coordinate differentiation givesAt the origin its difference quotient in direction is , whose right and left limits are and . Thus none of its coordinate partial derivatives exists at the origin.
Past exam of the mathematics course of the University of Cambridge 2007 ib Paper 3 10G ii Solution Created 2026-09-24 Updated 2026-10-14
Regard as a linear map and as a linear map (the same argument holds over any field). ThenIts dimension cannot exceed either or , since applying a linear map cannot increase dimension. The rank bound for a matrix product is thereforeThe bound is attained whenTheir product has an block and zeros elsewhere, so its rank of a matrix is . Thus the bound depending only on the given matrix sizes is sharp.
Past exam of the mathematics course of the University of Cambridge 2007 ib Paper 3 10G i Solution Created 2026-09-24 Updated 2026-10-14
The row rank of a matrix is the dimension of the linear span of its row vectors. Its column rank is the dimension of the linear span of its column vectors, equivalently the dimension of the image of the corresponding linear map. The equality of row rank and column rank states that these two numbers are equal for every matrix. Their common value is the rank of a matrix.
Past exam of the mathematics course of the University of Cambridge 2007 ib Paper 4 1G Solution Created 2026-09-24 Updated 2026-10-14
The dual map reverses the direction of the linear map:Here the dual spaces consist of complex-linear functionals. Composition with is linear both as a functional on and as an operation on , so this does define a linear map between the dual spaces.
Let and be the chosen bases, and let and be their dual bases. If represents , then . ThereforeThe coefficient in row , column of the matrix of is thus , giving the matrix transpose . This calculation introduces no complex conjugation: the algebraic dual map uses complex-linear functionals, whereas a Hermitian transpose belongs to the inner-product adjoint construction.
Past exam of the mathematics course of the University of Cambridge 2007 iii Paper 29 2 b Solution Created 2026-10-03 Updated 2026-10-14
A weight- modular form gives an invariant tensor differentialbecause cancels its automorphy factor. Assume first . At an ordinary quotient point this differential is holomorphic. At an elliptic point of order , use and from part (a), and write the pullback as , with holomorphic. Its invariance says , so a nonzero term has . Sincethe exponent in the descended coefficient is the integer . With , it is at least . At the modular cusp, and has a power series with nonnegative exponents, so has a pole of order at most .
Consequently the linear map injects into the meromorphic sections of with poles bounded byThis section space is . It is finite-dimensional on a compact Riemann surface by the Riemann-Roch theorem. Concretely choose one nonzero meromorphic section of the line bundle; dividing by it identifies these sections with a Riemann-Roch space with a fixed finite divisor bound. This proves the requested finite-dimensionality by compact-surface theory.
In fact the injection is an isomorphism. If a descended coefficient has order at least , its pulled-back exponent is nonnegative; the modular cusp pole bound likewise gives a holomorphic Fourier expansion of a modular form. These pullbacks therefore recover modular forms. Since is the Riemann sphere, , and a line bundle of degree on the sphere has sections. HenceFor negative , the valence formula excludes a nonzero holomorphic modular form because all its orders would be nonnegative but their sum would be ; the space is zero. The mechanism behind finite-dimensionality is modular forms as meromorphic differentials on X(1), with explicit elliptic and modular cusp pole bounds.
Past exam of the mathematics course of the University of Cambridge 2008 ib Paper 2 1E Solution Created 2026-09-24 Updated 2026-10-14
A linear map preserves linear combinations: for all vectors and real scalars. The rank-nullity theorem gives . For an endomorphism of the same finite-dimensional vector space, surjectivity means rank , equivalent to zero kernel and hence injectivity.
If , then every lies in the image, so is surjective and consequently injective. Now ; injectivity implies for every . Thus the right inverse is also a left inverse: . This is the one-sided inverses of finite-dimensional endomorphisms property.
Apply it to the linear maps on represented by and : implies . Equal finite dimensions are essential to the argument.
Past exam of the mathematics course of the University of Cambridge 2008 ib Paper 3 3F Solution Created 2026-09-24 Updated 2026-10-14
Differentiability means existence of a linear map such thatThis is the Fréchet derivative. Substituting increments on the coordinate axes shows . For the unit direction , the remainder is . Dividing the increment by proves differentiability of the restricted function and gives its directional derivative:For the supplied rational function, both coordinate-axis restrictions are zero, so . Any Fréchet derivative would therefore be the zero map. But , and hence for nonzero . This contradicts the required vanishing remainder. ThusIn fact every directional derivative exists: along it equals . These values do not depend linearly on the direction, illustrating why existence of directional derivatives is weaker than differentiability.
Past exam of the mathematics course of the University of Cambridge 2008 iii Paper 23 5 Solution Created 2026-10-03 Updated 2026-10-14
An affine algebraic group is a linearly reductive algebraic group if every finite-dimensional rational representation is completely reducible; equivalently the functor of invariants is exact. It is a geometrically reductive algebraic group if, whenever , there is a homogeneous invariant polynomial of positive degree with . Linear reductivity permits degree one; geometric reductivity allows higher degree.
Over the algebraically closed field, an algebraic torus is . Its coordinate ring is the Laurent polynomial ring. A rational action writes the coaction of a vector as a finite sum . The coaction identity and linear independence of Laurent monomials give and . ThusEach weight space has scalar action, so any vector-space complement within each weight space is invariant. This proves complete reducibility, and hence tori are linearly reductive in every characteristic. The argument uses characters themselves, not their Lie algebra differentials, which could coincide modulo .
We now prove geometric reductivity of by determinant separation for positive-characteristic SL2. Fix a rational -module and a nonzero fixed vector . For the diagonal torus, choose a weight-zero functional with , using the torus decomposition just proved. Define matrix coefficientsThese are regular functions on , and makes equivariant for left translations. Moreover because is torus-invariant. Thus maps into for the right torus action, and .
Write a matrix's two columns as and , with . Right torus multiplication scales these columns by and . Every right-torus-invariant regular function has a weight-zero polynomial lift, hence a sum of polynomials of bidegrees in . To see that a weight-zero lift exists, take any lift and retain its zero-weight component; the ideal is torus-stable and the quotient map preserves weights. Multiply each piece by to put the entire sum in bidegree without changing its restriction to .
Let be the space of degree- polynomials in one column. Restriction gives an injective equivariant map . Indeed if a bidegree- polynomial vanishes on determinant-one matrices, scale the first column of any invertible matrix to make its determinant one. Homogeneity then makes the polynomial vanish on every invertible matrix, a dense open subset, so it is zero. Denote the image by . These spaces increase because multiplication by realizes , and their union is . The finite-dimensional image therefore lies in one , and in any sufficiently larger filtration piece.
Choose with at least that bound, and set . The identity in characteristic givesThe invariant tensortherefore defines an invertible equivariant linear map : its matrix is anti-diagonal with all entries nonzero. Interpret any tensor as a map and send it to . Equivariance of makes this identification intertwine the diagonal tensor action with conjugation on endomorphisms. Crucially, restricts to the constant function on , and is sent to the identity endomorphism.
Under the resulting equivariant linear map , the vector is sent to . Since , the endomorphism determinant is a homogeneous polynomial of positive degree , invariant under conjugation. Pull it back to . The resulting polynomial satisfiesThis constructs the required invariant for every fixed nonzero vector and proves is geometrically reductive, including characteristic two. No averaging by a group order or division by is used; those operations would fail in the field's characteristic.
Past exam of the mathematics course of the University of Cambridge 2008 ii Paper 2 22F Solution Created 2026-09-24 Updated 2026-10-14
The Uniform boundedness principle states that a pointwise bounded family of bounded linear maps from a Banach space to a normed space is uniformly bounded in operator norm. Define closed sets . Pointwise boundedness makes their union . The Baire category theorem gives a ball for some . For , both and lie in , so for every . Scaling yields , proving the principle.
For the separately continuous bilinear map, consider with . Each is bounded and linear. For fixed , continuity of the other linear map gives . Apply the Uniform boundedness principle to this family to getBilinearity then gives ; the bound proves joint continuity.
For the trilinear map, fix . The just-proved bilinear result bounds . Thus the bounded linear maps , for , are pointwise bounded. Apply the Uniform boundedness principle once more to obtain . Expansion of the difference in three slots proves joint continuity. Separate continuity suffices for these multilinear maps.
Past exam of the mathematics course of the University of Cambridge 2008 ii Paper 3 4G Solution Created 2026-09-24 Updated 2026-10-14
One choice of the Hamming code of length seven is the linear mapover . Its image is the kernel of the parity-check matrixIndeed , the encoder is injective because positions recover its inputs, and has rank three. Its columns are nonzero and pairwise distinct. Hence no nonzero codeword has Hamming weight one or two. The word has weight three, proving that the minimum Hamming distance is three.
If is received with one erroneous bit, its syndrome is column of . These seven columns are distinct, so the syndrome identifies the bit to flip. A zero syndrome indicates no error under the assumption of at most one error.
For the extended Hamming code, append . Every extended codeword has even weight. Since every original nonzero word has weight at least three, its extended weight is at least four; the weight-three example attains four. ThusThe minimum-distance error-detection and correction guarantee gives detection of up to three errors and correction of one error. Detection here means rejecting a word outside the code, rather than simultaneously identifying and correcting every detected pattern; the usual combined decoder corrects single errors and flags double errors.
Past exam of the mathematics course of the University of Cambridge 2009 ia Paper 1 7A b Solution Created 2026-09-24 Updated 2026-10-14
Use the conventionfor the characteristic polynomial. Choosing instead multiplies it by and leaves the requested zero identity unchanged. For each eigenvector , induction gives , including . Thusbecause has the nonzero kernel vector and therefore has zero determinant. Part (a) supplies a basis consisting of these eigenvectors. A linear map vanishing on every basis vector vanishes everywhere. ConsequentlyThis proves the Cayley-Hamilton theorem identity directly in the distinct-eigenvalue case assumed here.
