Past exam of the mathematics course of the University of Cambridge 2009 ib Paper 1 10F Solution Created 2026-09-24 Updated 2026-09-24
Past exam of the mathematics course of the University of Cambridge 2009 ib Paper 3 1F Solution Created 2026-09-24 Updated 2026-09-24
Past exam of the mathematics course of the University of Cambridge 2013 ib Paper 2 11G i Solution Created 2026-09-24 Updated 2026-10-07
The structure theorem for finitely generated modules over a principal ideal domain applies because a Euclidean domain is a principal ideal domain. For a finitely generated -module,where the are nonzero nonunits. The free rank and the invariant factors of a finitely generated module are unique, with each determined up to multiplication by a unit. Equivalently, the torsion submodule decomposes into cyclic modules for irreducible , with uniquely determined prime-power elementary factors.
Past exam of the mathematics course of the University of Cambridge 2013 ib Paper 2 2G Solution Created 2026-09-24 Updated 2026-10-07
Let be a Euclidean domain and a nonzero ideal. Choose minimizing the Euclidean size. For any , Euclidean division gives , where either or has smaller size than . But , so minimality forces . Consequently . The zero ideal is , proving that every Euclidean domain is a principal ideal domain.
A commutative ring is Noetherian if every ideal is finitely generated; equivalently, every ascending chain of ideals stabilizes. To see the equivalence, the union of an ascending chain is an ideal. Finitely many generators for that union already belong to one member of the chain, after which the chain is constant. Conversely, an ideal which is not finitely generated permits successive choices outside the ideals generated by previous choices, producing a strictly ascending chain.
Every principal ideal domain is therefore Noetherian. The given Euclidean domain property of the Gaussian integers yields
Past exam of the mathematics course of the University of Cambridge 2013 iii Paper 21 5 Solution Created 2026-10-03 Updated 2026-10-07
The idele group is the multiplicative restricted productIts restricted product topology has basic open sets , where is finite and contains every infinite place, and is open in . In particular, the restriction to almost all local unit groups is part of the topology, not merely the unrestricted product topology.
The diagonal map is injective and well-defined by finite support of the principal ideal's valuations; its image consists of principal ideles. To prove discreteness of principal ideles, take the neighbourhood of which requires at every finite place and in the ordinary real or complex modulus at every infinite place. A diagonal element in it is a global unit, so . If , the nonzero integer has absolute value at least one, but the archimedean bounds make its absolute value less than . This contradiction proves is a discrete subgroup of .
For a modulus of a number field, write for its finite ideal part together with any selected real places. Let be the group of fractional ideals coprime to the finite part. Let consist of principal ideals with locally at each finite place in the modulus, and at each selected real place. The ray class group isEquivalently it is the quotient , with the corresponding principal-unit factors at finite places and positive multiplicative factors at selected real places. The question now assumes that no infinite places occur.
Put . Global units map to by reduction. To map to the ray class group, choose, by the Chinese remainder theorem, an integral having the prescribed unit residues at all , and send the tuple to the ray class of . A different choice changes the ratio by an element congruent to one at every such place, so the map is well-defined and multiplicative.
The forgetful map to the ordinary ideal class group is surjective: weak approximation for number fields multiplies an ideal by a principal ideal so that all its valuations in vanish. Its kernel consists exactly of classes represented by principal ideals coprime to , and their generators supply the local unit residues. Finally, a residue tuple maps to the identity ray class precisely when its chosen differs from a congruence-one generator by a global unit. Thus the ray class exact sequence isThe leftmost arrow need not be injective, explaining the absence of an initial zero.
For , the ring of integers of Q of square root two is . Its absolute field norm is a Euclidean function. Indeed, for , choose nearest integers ; writing , , both bounded by , gives . Applying this to a quotient proves Euclidean division, hence the ring is a principal ideal domain and . This is norm-Euclideanity of the integers adjoined square root two.
Write and . Their ideal norms are and , respectively; and the residue field at is , with because . The finite local quotient product for the requested modulus isThe first factor consists of and .
The given fundamental unit and generate the global units. Their images areThe first image has order six; its cube is and its square is , generating the first factor and the order-three subgroup of the second. The second image supplies the missing order-two element of . Thus the global unit map is surjective onto all local unit residues. By the exact sequence, or the unit-surjectivity criterion for a trivial finite ray class group,There is no positivity condition here: the modulus has no infinite part, so using the unit is legitimate and essential in the surjectivity calculation.
Past exam of the mathematics course of the University of Cambridge 2014 ib Paper 4 11E a Solution Created 2026-09-24 Updated 2026-10-06
With the usual commutative, unital conventions, the chain isA field is an integral domain, and every nonzero ideal contains an invertible element and is consequently the whole ring. Its only ideals are and , so it is a principal ideal domain.
To prove the middle implication, first show that a principal ideal domain has the ascending chain condition on ideals. The union of an ascending chain is an ideal, hence is ; its generator belongs to one member of the chain, and all later members equal . Now suppose a nonzero nonunit admitted no factorization into irreducible elements. It would factor into two nonunits, at least one of which again has no such factorization. Repeating would produce a strictly increasing chain of principal ideals: if with a nonunit, , since equality and cancellation would make invertible. This contradicts the ascending chain condition. Existence of factorization follows. By the permitted fact that every irreducible element is a prime element in a principal ideal domain, any irreducible factor in one factorization divides a factor in the other; cancellation then proves uniqueness up to units and order. This is a unique factorization domain. The final implication is part of the definition of a unique factorization domain.
None of the adjacent implications reverses. The principal ideal domain is not a field, since is not invertible. The polynomial ring is a unique factorization domain, by applying the polynomial extension theorem for unique factorization domains twice, but its ideal is not principal: a generator would divide both and , so would be a unit, whereas every member of this ideal vanishes at the origin. Finally, is an integral domain as a subring of , but is not a unique factorization domain. Its multiplicative norm is . There is no element of norm or . Hence , of norms , are all irreducible: a nontrivial factorization would require one of those missing norms. The only units have norm one and are . The two factorizationsare therefore not related by associates and reordering.
Past exam of the mathematics course of the University of Cambridge 2014 iii Paper 22 5 ii Solution Created 2026-10-03 Updated 2026-10-06
First compute the Mordell-Weil group rank by two-isogeny descent. HereThe two-isogeny formula gives . If , then , andis an isomorphism over . Its -coordinate multiplier is a square in .
Use the two-torsion square-class homomorphismFor any prime ideal of the Gaussian integers, if , then is a unit and ; if , the term has strictly smallest valuation and . Hence every valuation of is even. Since the Gaussian integers form a principal ideal domain, dividing by a square leaves a unit. Their units are , whose square classes are because and is not a square in . For the latter assertion, with would imply and , hence , impossible for rational . ThusBoth classes occur, at and . This is the unit square-class bound for two-isogeny descent.
Define on similarly, with . Since multiplies nonexceptional -coordinates by a square, and preserves the exceptional classes as well, its image is also . The standard kernel identities in two-isogeny descent areHere is the dual isogeny and . These identities can be checked directly from the formulas: , and conversely a square -coordinate lets the quadratic equation for a preimage be solved using the curve equation. For example, if , the equation for is , whose discriminant is ; the -coordinate then follows from the dual formula. The exceptional points satisfy the same completed square-class criterion.
The two-isogeny index formula over a number field keeps track of a small kernel factor:In this case , where , and because . Thus , and the index is . There is only one nonzero rational 2-torsion point on : the other two would require , and has the same nonsquare class as . The Mordell-Weil theorem now givesso .
It remains to identify all torsion, rather than merely the rank. The elliptic-curve discriminant is , so the primes and have good reduction, with residue characteristics three and five. By the supplied point-count information their reduction groups have orders that are powers of two. The reduction of torsion points on an elliptic curve is injective on prime-to-residue-characteristic torsion. Every odd-primary torsion subgroup therefore injects into a group of two-power order at at least one of these two primes, and must be zero. All torsion is two-primary.
Finally, if a point had order four, its double would be . The elliptic-curve addition formula givesFor the denominator is nonzero, so , impossible in . A point of higher two-power order would have a multiple of order four, so it too is excluded. Thus the only torsion points are . Together with rank zero,
Past exam of the mathematics course of the University of Cambridge 2017 ib Paper 2 2E a Solution Created 2026-09-24 Updated 2026-10-05
A unique factorization domain is an integral domain in which every nonzero nonunit is a finite product of irreducible elements, uniquely up to reordering and multiplication of factors by a unit in a ring. A principal ideal domain is an integral domain in which every ideal is generated by one element.
Gauss lemma for polynomials says that over a unique factorization domain , the product of two primitive polynomials is primitive, and the polynomial content satisfies up to a unit. In particular a primitive polynomial of positive degree is irreducible over exactly when it is irreducible over the fraction field of . Consequently a polynomial ring over a unique factorization domain is itself a unique factorization domain.
The Eisenstein criterion says that if has and there is a prime element with , for every , and , then is irreducible over the fraction field. If is primitive, it is also irreducible in . Over one may take to be an ordinary prime number. The primitivity qualification prevents a nonunit constant content from being overlooked.
The defining distinction is unique irreducible factorization versus generation of every ideal by one element.
Past exam of the mathematics course of the University of Cambridge 2017 ib Paper 2 2E b ii Solution Created 2026-09-24 Updated 2026-10-05
For the same pair, . Since is a unique factorization domain, Gauss lemma for polynomials proves that is a unique factorization domain.
To prove that is not a principal ideal domain, consider the ideal . A generator would divide 2 and . Divisibility of 2 forces to be a nonzero constant integer; divisibility of then forces that integer to divide its coefficient 1, so . This would make . But evaluation at followed by reduction modulo 2 maps every element of to zero and maps 1 to one. Hence , a contradiction. This is the integer polynomial ring is not a principal ideal domain example, with both clauses satisfied by a single inclusion.
Past exam of the mathematics course of the University of Cambridge 2017 ib Paper 2 2E b i Solution Created 2026-09-24 Updated 2026-10-05
Take and, for the next clause, its subring . Division with remainder makes a Euclidean domain, with the degree as Euclidean size for nonzero polynomials. For completeness, a nonzero ideal of contains a polynomial of least degree; division of any member by leaves a smaller-degree remainder in the ideal, so that remainder must vanish. The ideal is therefore ; the zero ideal is already principal. Thus is a principal ideal domain.
Past exam of the mathematics course of the University of Cambridge 2017 ib Paper 3 11E c Solution Created 2026-09-24 Updated 2026-10-05
Write the Gaussian integer , with , and set . Complex conjugation preserves , because . Choose a nonzero . Then is a positive integer in . It cannot be one because is a proper prime ideal. Factoring into rational primes and applying primality repeatedly gives a prime .
The element satisfies the monic polynomial . Evaluation induces a ring homomorphism that is a surjectionThe source has elements by part (b), soIf , use instead and get at most elements. Moreover is an integral domain, so its finiteness makes it a field. This proves the finite residue-field theorem for Gaussian integer orders without incorrectly assuming that every Gaussian integer order is a principal ideal domain.