Past exam of the mathematics course of the University of Cambridge 2024 ii Paper 1 25F Solution Created 2026-09-23 Updated 2026-09-25
A nonempty topological space is irreducible when it is not the union of two proper closed subsets, equivalently when any two nonempty open subsets intersect.
The Zariski topology on is Noetherian because satisfies the ascending chain condition on ideals. Suppose a closed set that is not a finite union of irreducible closed sets were minimal among such counterexamples. It is reducible, say with both proper closed subsets. Minimality expresses each as a finite union of irreducible closed sets, and combining those decompositions contradicts the choice of . Thus every closed has a finite irreducible decomposition.
Using , the second defining polynomial reduces toConsequentlyEach component is the image of and is isomorphic to , hence irreducible. In characteristic two the two displayed components coincide.
Suppose a polynomial vanishes on every . Thenas an entire function. These exponential-polynomial functions are linearly independent: applying kills the term with largest exponent, while it acts injectively on for ; induction on the number of terms finishes the proof. Hence every is zero, so no nonzero polynomial vanishes on the graph. Its Zariski closure is all of .
Finally refine an open cover of an affine variety by distinguished opens , choosing one inside an original member around each point. Since these distinguished opens cover,The Hilbert Nullstellensatz implies that the generate the unit ideal. Thusfor finitely many of them, so cover . The corresponding original open sets form a finite subcover. This is quasi-compactness of an affine variety.
Past exam of the mathematics course of the University of Cambridge 2024 ii Paper 3 35B b Solution Created 2026-09-24 Updated 2026-10-03
Past exam of the mathematics course of the University of Cambridge 2024 ii Paper 4 20F a Solution Created 2026-09-24 Updated 2026-09-25
Past exam of the mathematics course of the University of Cambridge 2024 ii Paper 4 20F b Solution Created 2026-09-24 Updated 2026-10-03
The equality of residue-field sizes says that the residue degree is one. Since , the principal ideal factorization of has valuation one at and zero at every other prime. Taking the relative ideal norm givesThus .
Past exam of the mathematics course of the University of Cambridge 2024 ii Paper 4 20F Solution Created 2026-09-23 Updated 2026-10-03
For a nonzero ideal , its norm isFor and embeddings , defineThe field discriminant is the discriminant of any integral basis of . If is a -basis of , then
Multiplication by on an integral basis has integer matrix . Its image lattice is , soThe determinant of this -linear map is the field norm , proving
Past exam of the mathematics course of the University of Cambridge 2025 ib Paper 2 16B Solution Created 2026-09-23 Updated 2026-09-25
Taking curls givesBoth have zero divergence and curl, so they satisfy the static vacuum equations. Their upward fluxes through the loop areFor clockwise current , the net force is zero in , while in
Put . Motion in changes no flux, so no current is induced and . In , using counterclockwise current as positive,ThusWith , the velocity tends to andAt terminal speed, , so Joule loss equals gravitational-energy loss. For , Ohm's quasistatic formula is singular: flux is conserved, persistent current stores magnetic energy, and ideal motion has no resistive terminal state (inductance must be retained).
Past exam of the mathematics course of the University of Cambridge 2025 ib Paper 2 1E a Solution Created 2026-09-24 Updated 2026-09-25
An integral domain is a nonzero commutative ring with identity and no zero divisors. A ring is Noetherian when every ideal is finitely generated, equivalently every ascending ideal chain stabilizes. A principal ideal domain is an integral domain in which every ideal is generated by one element.
Past exam of the mathematics course of the University of Cambridge 2025 ib Paper 2 9E a Solution Created 2026-09-24 Updated 2026-09-25
Past exam of the mathematics course of the University of Cambridge 2025 ib Paper 4 11E b Solution Created 2026-09-24 Updated 2026-09-25
A hyperbolic triangle is bounded by three hyperbolic geodesic segments or rays. Its vertices may lie in the hyperbolic plane; an ideal vertex is their endpoint on the boundary at infinity. Every ideal angle is zero. Gauss-Bonnet theorem with curvature givesso an all-ideal triangle has area .
For fixed admissible angles, hyperbolic trigonometry determines all three side lengths from the angles, for exampleThus two such triangles are congruent. An orientation-preserving isometry can send one chosen vertex and oriented tangent to the corresponding data of the other, and the determined side lengths and angles then send the entire triangle to it. Since the orientation-preserving isometry group is , represented by , the stated action is transitive.
Past exam of the mathematics course of the University of Cambridge 2025 ib Paper 4 9E a ii Solution Created 2026-09-24 Updated 2026-09-25
Past exam of the mathematics course of the University of Cambridge 2025 ib Paper 4 9E b ii Solution Created 2026-09-24 Updated 2026-09-25
The prime ideals of are and the maximal ideals generated by the monic irreduciblesFor a nonzero prime , use the residue classes of , where . Multiplication by on is represented by the companion matrix of the monic polynomial . In particular, for this may equivalently be written as one size- Jordan block with eigenvalue . The ideal does not give a finite-dimensional quotient.
Past exam of the mathematics course of the University of Cambridge 2025 ii Paper 2 3K Solution Created 2026-09-23 Updated 2026-09-25
The received word has Hamming distances from and from , soAfter multiplying by the priors, the unnormalized posterior probabilities are and . Thus the ideal observer decodes as , while maximum-likelihood and minimum-distance decoding both choose .
The ideal observer minimizes average error but needs priors and channel statistics. Maximum likelihood needs the channel law but not priors, and can be suboptimal for unequal codeword probabilities. Minimum distance is simple and agrees with maximum likelihood for a binary symmetric channel with crossover probability below , but ignores unequal priors and general channel asymmetry.