Past exam of the mathematics course of the University of Cambridge 2009 ii Paper 2 25H a Solution by
Codex 0 Created 2026-09-24 Updated 2026-10-14
For an arclength-parametrized curve define the Frenet frame by , , and . Differentiating the unit lengths gives diagonal frame-derivative coefficients zero. Also implies , while . Define the torsion of a space curve by . Orthogonality then givesThese are the Frenet formulae. Differentiating also verifies the chosen torsion sign; equivalently .
Past exam of the mathematics course of the University of Cambridge 2009 ii Paper 2 23G b Solution by
Codex 0 Created 2026-09-24 Updated 2026-10-18
The monodromy theorem states that a germ admitting analytic continuation along every path in a simply connected domain extends to a single-valued holomorphic function there. Equivalently continuations along homotopic paths with fixed endpoints agree. For a biholomorphism between the two tori, lift its composition with through the second covering. Simple connectivity, or monodromy applied to local inverse charts, yields a holomorphic lift .
Lift the inverse similarly. The compositions of the lifts differ from the identity by lattice translations; adjusting the lifts shows that is bijective. By the allowed classification, with . For , its two arguments represent the same torus point, so . Thus . Apply the inverse lift to obtain the reverse inclusion. ThereforeThe translation affects the chosen origin, not the period lattice.
Past exam of the mathematics course of the University of Cambridge 2009 ii Paper 2 23G a Solution by
Codex 0 Created 2026-09-24 Updated 2026-10-14
An elliptic function for a lattice is a meromorphic function on satisfying for all . Its order is the number of poles, counted with multiplicity, in a fundamental parallelogram, equivalently the degree of its map from the torus to the Riemann sphere. Differentiation preserves the periods. If the distinct poles have orders , the derivative has exactly the same pole locations with orders . ThereforeThe bounds use , valid for a nonconstant elliptic function.
For the Weierstrass elliptic function , has a single pole of order five, so its derivative has order six. For the second example choose not a critical value of and choose away from zero and the two points where . Thenhas a double pole at and three simple poles: the quotient has residue at zero and residue 1 at each of its two other poles. No locations overlap. Hence its order is five and its derivative has order , as required.
Past exam of the mathematics course of the University of Cambridge 2009 ii Paper 2 22H c Solution by
Codex 0 Created 2026-09-24 Updated 2026-10-14
Assume is nonempty; without that necessary hypothesis the assertion is false. Put and choose with . Convexity gives , so its distance to is at least . Apply the supplied uniform-convexity inequality to and :Thus the minimizing sequence is Cauchy. Completeness of the Banach space gives ; closedness gives , and continuity of the norm gives . The minimum distance is attained. This is the nearest point in a uniformly convex Banach space property. The same inequality applied to two minimizers shows uniqueness, though existence alone was requested.
Past exam of the mathematics course of the University of Cambridge 2009 ii Paper 2 22H b Solution by
Codex 0 Created 2026-09-24 Updated 2026-10-14
Apply Hölder's inequality to the finite sum with the second sequence :Divide by the last power if the sum is nonzero. The resulting bound is independent of , so passing to the limit proves both membership in and the Minkowski inequality
Past exam of the mathematics course of the University of Cambridge 2009 ii Paper 2 22H a Solution by
Codex 0 Created 2026-09-24 Updated 2026-10-14
Let . The scalar Young inequality follows by maximizing over , obtaining . If both norms are nonzero, apply it to and , and sum over a finite initial segment. Passing to the increasing limit givesZero norms give the trivial case. This proves Hölder's inequality without assuming convergence of the product series in advance.
Past exam of the mathematics course of the University of Cambridge 2009 ii Paper 2 20H iii Solution by
Codex 0 Created 2026-09-24 Updated 2026-10-14
Suppose . Its positive left side gives . Reduction modulo four shows that is odd and even. Moreover would make the valuation of at 3 equal to one, impossible for a cube. The same argument excludes .
In , factor . Any common prime ideal divisor divides both and , so must lie above 2, 3 or 7. The odd norm excludes 2, and the previous divisibility arguments exclude 3 and 7. The two ideals are therefore coprime. Unique factorization of ideals gives . The class group has exponent two, so implies . Thus , and the only units, , can be absorbed into a cube. It follows thatComparing the coefficient of gives , an impossibility over the integers. Consequently there are no integer solutions: this is the no integer solutions of the Mordell equation with constant minus twenty-one result. The class-group argument is essential: element factorization was not assumed to be unique.
Past exam of the mathematics course of the University of Cambridge 2009 ii Paper 2 20H ii Solution by
Codex 0 Created 2026-09-24 Updated 2026-10-14
For the ideal class group of the imaginary quadratic field of discriminant minus eighty-four, write . Here , , and the Minkowski bound for ideal classes is . Thus every class has a representative of norm at most five. The relevant prime ideals areThe first two are ramified: and . Also , as both sides have norm 25 and . The element has norm 30 andThere are no elements of norms 2, 3, 5 or 6, since the element norm is . Hence the classes of , and their product are all nontrivial and distinct. The relation makes the last product equal to the class of . Ideals of norm four are principal, and the two primes above five have the same class of order two. The norm bound therefore gives no further classes. Thus
Past exam of the mathematics course of the University of Cambridge 2009 ii Paper 2 20H i Solution by
Codex 0 Created 2026-09-24 Updated 2026-10-14
Choose a nonzero integral ideal in the inverse of any desired ideal class. For the nonzero element supplied by the norm bound, is integral, belongs to the desired class and satisfiesThere are only finitely many integral ideals of bounded norm: identify with as an additive group, so ideals of norm are among its subgroups of index , of which there are finitely many. Since every ideal class has one of these bounded-norm representatives, the ideal class group is finite.
Past exam of the mathematics course of the University of Cambridge 2009 ii Paper 2 19F iii Solution by
Codex 0 Created 2026-09-24 Updated 2026-10-14
Use the given square-class assignments and , . The character values, in the specified class order, areFor example the fourth entry of is , and that of is . A class of centralizer order has size , so a character norm is the sum of its squared moduli divided by these centralizer orders. ThereforeBoth are genuine characters by their symmetric/exterior-square construction. A character norm is the sum of squares of its irreducible multiplicities, so both characters are irreducible.
Past exam of the mathematics course of the University of Cambridge 2009 ii Paper 2 19F ii Solution by
Codex 0 Created 2026-09-24 Updated 2026-10-14
For a representation space , let and be the characters on and . If the eigenvalues of are , the respective traces are and . Since and , this givesFinite-order matrices over are diagonalizable, so this eigenvalue argument applies to every group element. Equivalently the symmetric and antisymmetric projections on are .
Past exam of the mathematics course of the University of Cambridge 2009 ii Paper 2 19F i Solution by
Codex 0 Created 2026-09-24 Updated 2026-10-14
If affords an irreducible character , entrywise complex conjugation gives a representation with character . An invariant complex subspace for the conjugate representation conjugates back to one for , so irreducibility is preserved. If representations afford , their tensor product has trace , proving that their product is a character.
With the usual character inner product,The character orthogonality and the first assertion therefore make this equal to one if and zero otherwise. This also counts the invariant vectors in the tensor-product representation.
Past exam of the mathematics course of the University of Cambridge 2009 ii Paper 2 17F ii Solution by
Codex 0 Created 2026-09-24 Updated 2026-10-14
For , join a clique on vertices to an independent set on vertices. The resulting complete -partite graph hasIts largest clique has size . Every missing edge joins two vertices of the independent set; adding it produces a with the original -clique. It is therefore maximal -free. For its part sizes are unbalanced, so its edge count is strictly less than that of .
For the construction is a star with edges. Every maximal triangle-free graph on vertices is connected: an edge between distinct components would create no triangle. A connected graph has at least edges, so the minimum is , attained by the star. Literally the requested construction is impossible for , since has zero edges. The nontrivial assertion thus requires the customary hypothesis.
Past exam of the mathematics course of the University of Cambridge 2009 ii Paper 2 17F i Solution by
Codex 0 Created 2026-09-24 Updated 2026-10-14
The Turán graph is the complete -partite graph with part sizes differing by at most one. Turan theorem states that a graph on vertices containing no has at most edges, with equality precisely for that balanced complete multipartite graph.
Here is a symmetrization proof, including equality. Choose a -free graph with the maximum number of edges. Replacing a vertex by a nonadjacent twin of a nonadjacent vertex preserves -freeness: a clique using the replacement would give the same clique using . Thus nonadjacent vertices must have equal degrees, or cloning the higher-degree vertex increases the edge count. In fact their neighborhoods are identical. Otherwise choose adjacent to but not . Cloning to preserves the total number of edges but lowers 's degree by one, leaving 's degree unchanged. The still nonadjacent pair now has unequal degrees, allowing an edge-increasing clone and contradicting maximality.
Nonadjacency is consequently an equivalence relation, and the extremal graph is complete multipartite. It has at most parts because choosing one vertex from each part forms a clique. For , using fewer parts cannot be extremal if a part can be split. Finally its number of edges is , maximized uniquely by balanced sizes: moving a vertex from a part at least two larger than another decreases the sum of squares. This proves the theorem and its equality characterization. The cases with fewer vertices than the forbidden clique are immediate.
Past exam of the mathematics course of the University of Cambridge 2009 ii Paper 2 16G ii Solution by
Codex 0 Created 2026-09-24 Updated 2026-10-14
Add to the group axioms the sentences for every . Their models are precisely the torsion-free groups. This theory is not finitely axiomatizable. If a finite sentence or finite theory were equivalent to it, the compactness theorem would imply that finitely many of these power axioms already entailed the proposed axiomatization. A cyclic group of prime order greater than all the finitely listed exponents satisfies those power axioms but is not torsion-free, a contradiction.
The class of all torsion groups is not first-order axiomatizable at all. If a theory axiomatized it, add a new constant and the sentences for all . Every finite subset has a model: use a cyclic group of sufficiently large prime order, with a generator. Compactness gives a model of all of in which has infinite order, contradicting the claimed torsion property. These conclusions concern the ordinary first-order language of groups.
Past exam of the mathematics course of the University of Cambridge 2009 ii Paper 2 16G i Solution by
Codex 0 Created 2026-09-24 Updated 2026-10-14
One Hilbert axiomatization of classical propositional logic uses the schemas , and , with modus ponens as its inference rule. Other connectives can be defined from implication and negation. Syntactic entailment means that a finite formal proof derives from the schemas and members of . Consistency means that no formula and its negation are both derivable, equivalently no contradiction is derivable.
Use the standard deduction theorem, closure of derivability under modus ponens, and the maximal-consistency properties: a maximal consistent set contains exactly one of , is closed under derivability, and satisfies exactly when or . These follow from the deduction theorem and the classical schemas; in particular adjoining a missing formula to a maximal set must yield a contradiction. Define iff . Induction on formula construction now provesFor negation use the exactly-one property, and for implication use its displayed membership rule, which is precisely the Boolean truth table. Thus every member of is true under , providing the required valuation.
Past exam of the mathematics course of the University of Cambridge 2009 ii Paper 2 15E ii Solution by
Codex 0 Created 2026-09-24 Updated 2026-10-14
For , the upright angle has and is unstable. There is one nonzero equilibrium in ,Differentiate the right side of the nutation equation at this angle. Since the bracket vanishes there, the derivative is . Therefore it is stable, withThis equilibrium represents steady precession, not a top with all Euler angles stationary. The equality case is excluded by the two cases in the question and requires a nonlinear marginal analysis.
Past exam of the mathematics course of the University of Cambridge 2009 ii Paper 2 15E i Solution by
Codex 0 Created 2026-09-24 Updated 2026-10-14
Put . There is no nonzero equilibrium angle because . The upright angle is stable: its linearized equation is . HenceThese are small nutational oscillations of the rapidly spinning top. No downward equilibrium belongs to the momentum level under consideration.
Past exam of the mathematics course of the University of Cambridge 2009 ii Paper 2 14C ii Solution by
Codex 0 Created 2026-09-24 Updated 2026-10-14
Split the real contour at zero and rotate its positive part to angle and its negative part to angle . Rotate the two rays of to these same angles, preserving orientation. The initial-transform pole at is not crossed by either real-contour rotation, while has its pole at , outside the upper half-plane. The apparent poles in are removable.
On the rotated rays, both and . The initial-data factor has Gaussian decay . For the boundary term, retain the integral formwhich is there. Multiplication by gives exponential decay as for every fixed . Thus all integrands are exponentially damped on the deformed contours; the endpoint boundary value at is taken afterwards, rather than claiming uniform exponential decay there.
Past exam of the mathematics course of the University of Cambridge 2009 ii Paper 2 14C i Solution by
Codex 0 Created 2026-09-24 Updated 2026-10-14
Use the half-line transform and let . Integrating the heat equation twice by parts givesHere andwith removable singularities at the apparent denominator zeros. Let , and orient its boundary from infinity on the ray to zero and then out on the ray. Transform inversion and contour deformation giveTo eliminate the unknown boundary derivative, evaluate the transform identity at : . The resulting extra contour integral of vanishes by analyticity and decay in the upper half-plane. This proves that the boxed expression involves only the prescribed data. It is intended for , with boundary and initial values obtained as limits.
There are unlisted articles, also show them or only show them.