Past exam of the mathematics course of the University of Cambridge 2008 ii Paper 1 26I vi Solution by
Codex 0 Created 2026-09-24 Updated 2026-10-14
Write for , with a common positive constant , and put . The infinitesimal generator matrix is symmetric because the graph is undirected. Thus the uniform distribution satisfies detailed balance, and the continuous-time random walk is reversible when started uniformly.
Its jump chain chooses a link uniformly from those incident to its current vertex:The flux is symmetric, so this random walk on a multigraph is also reversible. The continuous-time equilibrium is uniform because higher-degree vertices have shorter holding times; at jump times the equilibrium is degree-weighted. If the intended proportionality constant depends on the starting vertex, , reversibility still holds with , and the same jump chain results.
Past exam of the mathematics course of the University of Cambridge 2008 ii Paper 1 26I v Solution by
Codex 0 Created 2026-09-24 Updated 2026-10-14
Use the equilibrium correspondence from the preceding part. For ,Consequently the detailed balance equations for the jump chain hold exactly when those for the continuous-time Markov chain hold. The reversibility characterizations already given prove the equivalence. Both chains here are started in their respective stationary distributions, which generally differ.
Past exam of the mathematics course of the University of Cambridge 2008 ii Paper 1 26I iv Solution by
Codex 0 Created 2026-09-24 Updated 2026-10-14
The jump chain records the successive states visited at actual jumps of the continuous-time Markov chain. Put . For an irreducible chain with at least two states, all , and its transition probabilities are for , with . The holding time in state is exponential with mean .
If , set and . ThenConversely, implies that , normalized to sum one, satisfies . ThereforeJump observations overrepresent states with short holding times. A one-state chain has no actual jumps; its trivial equilibrium can be handled separately, without using this division by .
Past exam of the mathematics course of the University of Cambridge 2008 ii Paper 1 26I iii Solution by
Codex 0 Created 2026-09-24 Updated 2026-10-14
A Discrete-time Markov chain with initial distribution is reversible if and have the same law for every . Its detailed balance equations are . These equations are equivalent to reversibility. Indeed, reversing every factor in the probability gives the reverse path probability; the converse follows by taking .
Past exam of the mathematics course of the University of Cambridge 2008 ii Paper 1 26I ii Solution by
Codex 0 Created 2026-09-24 Updated 2026-10-14
Let be a probability vector satisfying detailed balance. Since each row of the infinitesimal generator matrix sums to zero,Thus , and for all . This proves that is an stationary distribution. The diagonal term causes no problem because its detailed balance equation is an identity.
Past exam of the mathematics course of the University of Cambridge 2008 ii Paper 1 26I i Solution by
Codex 0 Created 2026-09-24 Updated 2026-10-14
A continuous-time Markov chain started with distribution is reversible if its finite-dimensional distributions are unchanged by reversing time: for every , and have the same law. In particular, reversibility includes stationarity. The detailed balance equations areFor a finite continuous-time Markov chain, these equations are equivalent to reversibility with initial distribution . Equivalently, they imply for every transition matrix .
Past exam of the mathematics course of the University of Cambridge 2008 ii Paper 1 24H c Solution by
Codex 0 Created 2026-09-24 Updated 2026-10-14
For , the singular set is the point , a zero-dimensional submanifold. For , every elementary matrix is singular and the smooth curve lies in through zero. If were a submanifold, all would belong to and span . Its dimension at zero would therefore be , making locally open there. But arbitrarily small matrices are invertible, a contradiction. ThusThe failure is at the zero matrix; fixed-rank pieces of the singular set can separately be smooth submanifolds.
Past exam of the mathematics course of the University of Cambridge 2008 ii Paper 1 24H b Solution by
Codex 0 Created 2026-09-24 Updated 2026-10-14
For an invertible , factor . The determinant's permutation expansion gives . Differentiating at zero yieldsAt a determinant-one matrix choose ; the derivative is one. Thus one is a regular value of the smooth determinant map on . The regular level set theorem makes a submanifold of codimension of a submanifold one, withThis includes , when has dimension zero.
Past exam of the mathematics course of the University of Cambridge 2008 ii Paper 1 24H a Solution by
Codex 0 Created 2026-09-24 Updated 2026-10-14
The determinant is continuous and is open in . Every open subset inherits the ambient smooth charts, so it is a submanifold and
Past exam of the mathematics course of the University of Cambridge 2008 ii Paper 1 21F iii Solution by
Codex 0 Created 2026-09-24 Updated 2026-10-14
A geometric circle is an unknot. Compactify to , and carry the circle to . Its complement has coordinates and , making it homeomorphic to . It deformation retracts to . Removing the additional point at infinity does not change the fundamental group: van Kampen for a small ball about that point uses a simply connected punctured ball, homotopy equivalent to . ThusA meridian linking the circle once generates it. This uses “circle” in its geometric sense; the complement of an arbitrary knotted embedded copy of need not have this group.
Past exam of the mathematics course of the University of Cambridge 2008 ii Paper 1 21F ii Solution by
Codex 0 Created 2026-09-24 Updated 2026-10-14
Choose open neighborhoods of the sphere and circle in the wedge, each enlarged by a small contractible neighborhood of the attaching point in the other piece. They deformation retraction to and and have contractible intersection. Van Kampen therefore givesThe generator traverses the circle once; the sphere contributes no fundamental-group generator.
Past exam of the mathematics course of the University of Cambridge 2008 ii Paper 1 21F i Solution by
Codex 0 Created 2026-09-24 Updated 2026-10-14
The van Kampen theorem says: if with open and path connected, path connected, and a base point in the intersection, then is the free product modulo the normal subgroup generated by identifying the two images of every element of . Equivalently it is the pushout of the two inclusion-induced fundamental-group maps.
Past exam of the mathematics course of the University of Cambridge 2008 ii Paper 1 20G b Solution by
Codex 0 Created 2026-09-24 Updated 2026-10-14
The element satisfies , so is an algebraic integer. Conversely, write an algebraic integer as with rational. Its trace gives , and its field norm implies . If in lowest terms, divides 23, forcing . The integral field norm condition modulo four then makes have the same parity. Therefore it equals , provingBoth reductions of modulo two and three split into the distinct roots zero and one. The index is one, so ideal factorization givesTheir norms are two and three respectively. The product is generated by . All are multiples of , using ; and belongs to the product. HenceThe Minkowski bound is , in fact about . Every class therefore has a representative of ideal norm one, two or three. The displayed primes and their conjugates exhaust those possibilities. Their classes are all , with , because and conjugation inverts a quadratic ideal class. There are at most three classes.
There is no element of field norm two: , which exceeds two for and is a square for . Thus is not principal. Moreover , and belongs to but not its conjugate, so . Consequently has order three, and
Past exam of the mathematics course of the University of Cambridge 2008 ii Paper 1 20G a Solution by
Codex 0 Created 2026-09-24 Updated 2026-10-14
The ideal class group of a number field is the group of nonzero fractional ideals of its ring of integers under multiplication, modulo the subgroup of principal fractional ideals. For degree and pairs of complex embeddings, the Minkowski bound for ideal classes states that each class contains an integral ideal withThere are only finitely many integral ideals of bounded ideal norm: as sublattices of the free abelian group of integers, they have bounded index, and finitely many subgroups have any fixed index. Thus the ideal class group is finite.
Past exam of the mathematics course of the University of Cambridge 2008 ii Paper 1 18H iii Solution by
Codex 0 Created 2026-09-24 Updated 2026-10-14
The splitting field over is , and it contains the unique subfield . Over , Frobenius is the square of the order-four Frobenius, so it has two orbits of length two on the four roots. Thus factors into two irreducible quadratics, andgenerated by on .
Past exam of the mathematics course of the University of Cambridge 2008 ii Paper 1 18H i Solution by
Codex 0 Created 2026-09-24 Updated 2026-10-14
Over a finite field , the splitting field is a finite extension , where is the least common multiple of the degrees of the distinct irreducible factors. Its Galois group is cyclic of order , generated by .
Over , the polynomial has no linear factor: its values at zero and one are both one. The only irreducible quadratic is ; reduction modulo it gives , not zero. A reducible quartic without linear factors would split into quadratics, so is irreducible. Thus its splitting field is and
Past exam of the mathematics course of the University of Cambridge 2008 ii Paper 1 17F iii Solution by
Codex 0 Created 2026-09-24 Updated 2026-10-14
True for finite connected simple graphs. average degree of a graph at most two implies . A spanning tree has edges, leaving at most one extra edge. Hence the graph is a tree or unicyclic. trees are planar, and a unicyclic graph is a cycle with trees attached to its vertices, which can also be embedded in the plane. Connectedness is essential to this argument: a disconnected nonplanar component can be diluted by isolated vertices.
Past exam of the mathematics course of the University of Cambridge 2008 ii Paper 1 17F ii Solution by
Codex 0 Created 2026-09-24 Updated 2026-10-14
False. Attach 594 pendant vertices to one vertex of . The connected graph still contains the nonplanar , but has , , and average degree of a graph . Attaching more leaves lowers the average further toward two without making the graph planar.
Past exam of the mathematics course of the University of Cambridge 2008 ii Paper 1 17F i Solution by
Codex 0 Created 2026-09-24 Updated 2026-10-14
False. The complete bipartite graph has chromatic number two, but is nonplanar. For example a simple bipartite plane graph has , because all facial cycles have length at least four; has , .
Past exam of the mathematics course of the University of Cambridge 2008 ii Paper 1 15E ii Solution by
Codex 0 Created 2026-09-24 Updated 2026-10-14
Separate fluid conservation gives , hence after normalization at today. For , the conservation equation gives . ThusAssume both densities are positive and set , . On the expanding flat branch, . With this becomes . Choosing the Big Bang at and integrating givesThe normalization requires ; equivalently . Thus the age and the two positive densities are not independent once this normalization and bang time are fixed.
As , , the matter-dominated law. As , and , giving accelerated dark-energy expansion. Direct differentiation gives , so acceleration begins once . If dark energy vanishes, the limiting matter-only solution must be taken instead; negative dark-energy density would not have the stated late-time accelerating form.
There are unlisted articles, also show them or only show them.