Past exam of the mathematics course of the University of Cambridge 2014 iii Paper 24 2 Solution Created 2026-10-03 Updated 2026-10-06
The inverse different is the trace-dual latticeThe integral closure is finite free over the complete discrete valuation ring . Choose an integral basis and use the nondegenerate trace pairing to form its dual basis over . This exhibits as a full, finite -lattice. It is stable under multiplication by , because for , and bounded denominators make it a fractional ideal of . Integral elements have integral field traces, so . A nonzero fractional ideal of a discrete valuation ring is invertible; its inverse is consequently an integral ideal, the different ideal .
Assume now , with monic separable minimal polynomial of degree . Lagrange interpolation at its distinct roots givesIndeed, these are the leading coefficients in the interpolation formula for . For any element of , this trace is the coefficient of in its degree-less-than- representative modulo . The resulting pairing on the basis is integral and unimodular: reversing the order of one basis makes its matrix triangular with diagonal ones, since entries vanish when the exponent sum is less than . Thus it identifies with its full -dual. Translating back to the trace pairing proves
For a totally ramified extension of degree , any uniformizer is an Eisenstein generator of a totally ramified extension, and . To see the latter equality, use the common residue field to expand an integral element in powers of with digits from ; reduce powers using its Eisenstein polynomial and take limits in the finite complete -module generated by . Write that polynomial as , with for . When , the derivative's leading term has valuation , while every other nonzero derivative term has valuation at least . There can be no cancellation of the unique smallest term. Therefore
For the prime-power p-adic cyclotomic extension, put and . Modulo , the shifted cyclotomic polynomial is , while its constant term is , not a multiple of . It is therefore Eisenstein, so is a uniformizer and . Fromwe obtain, by differentiating the numerator at ,The denominator is a primitive- root of unity minus one and has -valuation . The different exponent is consequently , givingThis includes : the extension is trivial and its different exponent is zero.
Past exam of the mathematics course of the University of Cambridge 2015 ii Paper 3 16F i Solution Created 2026-09-24 Updated 2026-10-06
If is an irreducible polynomial, any two roots have the same minimal polynomial. Thus the map carrying to is a field embedding. The extension theorem for field embeddings extends it to an embedding of the splitting field into an algebraic closure. Since is normal, its image is , so it is an element of the Galois group.
Conversely, factor into irreducible factors over . An automorphism preserves the vanishing of each factor, so it cannot send a root of one factor to a root of another. Since there are no repeated roots, different factors have disjoint root sets. Transitivity on all roots therefore forces a single irreducible factor. This proves the equivalence.
Past exam of the mathematics course of the University of Cambridge 2016 ib Paper 1 1F b Solution Created 2026-09-24 Updated 2026-10-06
Write for a size- Jordan block. The characteristic polynomial fixes the total dimensions at and , while the minimal polynomial fixes the largest Jordan block at each eigenvalue. Consequently, the blocks for have total size four, largest size two, and at least one size-two block. The blocks for both have size one. The complete list, up to similarity, isThese Jordan normal forms are inequivalent because their -eigenspaces have different dimensions, two and three.
Past exam of the mathematics course of the University of Cambridge 2016 ib Paper 3 11E a Solution Created 2026-09-24 Updated 2026-10-06
An algebraic integer is a complex number satisfying a monic polynomial with integer coefficients. Let be the monic minimal polynomial of . It is irreducible over . If is a monic polynomial vanishing at , then divides over . Gauss lemma for polynomials implies that monic rational factors of a monic integer polynomial have integer coefficients. Thus , and its irreducibility over implies irreducibility in .
For with , division by the monic works in , giving with . Since , minimality forces . Conversely each multiple of vanishes at . ThereforeWriting , division by expresses every element uniquely as with integer coefficients. A relation among these powers would be a nonzero vanishing polynomial of degree less than . Hence form a basis of the free module over .
Past exam of the mathematics course of the University of Cambridge 2016 ib Paper 3 11E b Solution Created 2026-09-24 Updated 2026-10-06
The polynomial satisfies the Eisenstein criterion at the prime two: every nonleading coefficient is divisible by two, and the constant coefficient is not divisible by four. Thus it is irreducible over and is the minimal polynomial of every one of its roots. Part (a) givesButIn the quotient, the two nonzero classes of and multiply to zero. They are nonzero because their nonzero representative degrees are less than five. The quotient is not an integral domain, so is not a prime ideal.
For ring homomorphisms preserving the identity, an image of in the Gaussian integers would satisfy . The minimal polynomial of over would then be , of degree five. This is impossible because has degree at most two. Thus there is no unital homomorphism . If homomorphisms are instead allowed not to preserve the identity, the zero map exists; every nonzero homomorphism into this integral domain is unital, because the image of one is a nonzero idempotent and hence one.
Past exam of the mathematics course of the University of Cambridge 2016 iii Paper 123 2 b Solution Created 2026-10-03 Updated 2026-10-06
Let and let be a primitive cube root of unity. The splitting field is . The polynomial is an Eisenstein polynomial, so . Meanwhile shows that is quadratic: is not a square because its valuation is odd. A quadratic field cannot lie in the degree-three field. Consequently , and the action on the three roots identifies its Galois group with the symmetric group .
A useful uniformizer isSince , we obtainThus is a root of the Eisenstein polynomial . Its degree is six, so , the extension is totally ramified, and is a uniformizer. With ,This is the Eisenstein sextic presentation of the splitting field of X3 minus 3 over Q3.
Let , , and let , . Then has order three, has order two, and . Their actions on the uniformizer areThe two nonidentity elements of therefore satisfyEach transposition sends to for some , so its displacement has valuation one: is a unit, reducing to modulo the maximal ideal. The uniformizer criterion for lower ramification groups now givesFor real indices, this is on , on , and for . In particular the lower breaks are and .
On the index is two; beyond three it is six. Thus the Herbrand function isThe positive lower break becomes the upper break . ThereforeThe fractional upper break is allowed because the full extension is nonabelian. As a check, the different exponent from ramification groups is . The derivative of the minimal polynomial gives the same result: . This is the case of ramification groups of the splitting field of Xp minus p over the p-adic numbers.
Past exam of the mathematics course of the University of Cambridge 2016 iii Paper 123 3 b Solution Created 2026-10-03 Updated 2026-10-06
The denominator is ; dividing by removes the zero at . A uniformizer of a degree- totally ramified extension generates the field: its valuation over is , so already has ramification index at least . Hence , its minimal polynomial has degree , and its conjugates are the distinct for .
Factor the minimal polynomial over . The reduced ramification polynomial isEvery displayed root is nonzero and integral, since two uniformizers have a difference of valuation at least one. Thus is monic of degree , has nonzero constant coefficient, and belongs to . For it is the constant polynomial , with no slopes and no ramification jumps.
Here is also a justification of the uniformizer criterion for lower ramification groups in this setting. The powers are a -basis. In an expansion , the nonzero terms have valuations , distinct modulo ; therefore there is no cancellation at the least valuation. If is integral, all those values are nonnegative, which forces . Thus . For , is divisible by , with the remaining factor integral. Consequently every has valuation at least , and equality is attained at .
For a nonidentity automorphism, write . By the defining inequality for the lower ramification numbering,The Newton polygon root valuation theorem therefore proves the ramification breaks from a reduced ramification polygon relation:The segment's horizontal length is exactly . Equivalently, in the reflected Newton polygon convention required for a positive-slope formulation,All occurring root valuations are nonnegative integers. For negative indices, extend ; total ramification means that there are no negative-index jumps, so the reflected formulation remains true for all integers.
The sign distinction is substantive. Using the uniformizer from question 2, whose minimal polynomial is , givesIts coefficient valuations are , because . The usual lower hull has vertices and slopes , of lengths . These correspond exactly to the drops and . With the reflected axis the slopes are , as in the printed positive- wording. If the coefficient-exponent definition is used throughout, the printed assertion needs the minus sign shown above.
Past exam of the mathematics course of the University of Cambridge 2017 ib Paper 4 11E a Solution Created 2026-09-24 Updated 2026-10-05
The structure theorem for finitely generated modules over a principal ideal domain applies in particular to a Euclidean domain : every finitely generated module has an isomorphismwith each nonzero and a nonunit. The rank of a free module and the invariant factors of a finitely generated module are unique up to multiplication by units; empty sums are allowed. This is the classification theorem being used, without a proof of that theorem.
The rational canonical form theorem states that for a linear operator on a finite-dimensional vector space over any field , there are unique monic nonconstant polynomials such that some basis givesHere, for , the companion matrix has ones on its subdiagonal and last column . The empty matrix covers a zero-dimensional space. Two linear operators have matrix similarity exactly when they have the same invariant factors of a linear operator.
For the proof, make an -module by . It is a finitely generated module, since a vector-space basis also generates it as a module. It is a torsion module: the powers of have linear dependence in the finite-dimensional space , so some nonzero polynomial annihilates every vector. Because is a Euclidean domain, the classification theorem givesThere is no free summand, since a nonzero free module over is not a torsion module. Choose monic generators of the ideals. On , the classes of form an -basis by polynomial division. Multiplication by is exactly in that basis, proving existence. Uniqueness in the classification theorem proves uniqueness of the rational canonical form. Finally, an -module isomorphism is precisely an invertible -linear map intertwining the operators, establishing the assertion about matrix similarity. In particular the characteristic polynomial is and the minimal polynomial is for nonzero .
Past exam of the mathematics course of the University of Cambridge 2017 ii Paper 1 17I a Solution Created 2026-09-24 Updated 2026-10-05
A splitting field of a nonzero polynomial over is an extension in which splits into linear factors and which is generated over by all its roots. For a constant nonzero polynomial the splitting field is ; the zero polynomial does not have a root-generated splitting field in this standard definition.
Given two splitting fields , enumerate the roots generating and extend a -embedding one root at a time. If an embedding is defined on , the minimal polynomial of the next root divides over that field. Its image under the embedding therefore divides over the corresponding subfield of , and has a root in . The quotient construction extends the embedding to that root. The polynomial need not be a separable polynomial.
Past exam of the mathematics course of the University of Cambridge 2017 ii Paper 1 19H a Solution Created 2026-09-24 Updated 2026-10-05
Choose a nonzero . It is an algebraic integer, with monic minimal polynomialIts constant coefficient is nonzero, since otherwise the polynomial would have the root zero and be divisible by its variable, contradicting irreducibility and . Rearranging gives . The expression in parentheses lies in the ring of integers of a number field, so the ideal property gives . Hence
Past exam of the mathematics course of the University of Cambridge 2017 ii Paper 2 16I a Solution Created 2026-09-24 Updated 2026-10-05
A finite field extension is a separable field extension if every element of has a minimal polynomial over with distinct roots in an algebraic closure. The primitive element theorem says that a finite separable field extension is for some .
If is finite, then so is . The multiplicative group of a finite field is cyclic, so a generator of generates as a field. To justify the group fact, a finite subgroup of a field's multiplicative group is cyclic: in a finite abelian group its exponent is attained as an element order, while the polynomial root bound forces its size to be at most that exponent.
If is infinite, first consider . The minimal polynomials of and have distinct roots in an algebraic closure. Choose , , avoiding the finitely many values for which for a pair other than . Set . Over , the polynomials and have precisely one common root, . Their monic greatest common divisor is therefore , so and . Thus . Induct over finitely many generators of the finite separable field extension. This proves every finite separable extension is simple.
Past exam of the mathematics course of the University of Cambridge 2017 ii Paper 2 16I b Solution Created 2026-09-24 Updated 2026-10-05
Put , and . Since , the identity givesThus . The latter has degree : is not a square and is real, whereas is not real. Squaring gives its monic degree- minimal polynomial
Past exam of the mathematics course of the University of Cambridge 2017 ii Paper 2 16I c Solution Created 2026-09-24 Updated 2026-10-05
In characteristic , let and , with having algebraic independence. The monomials , , form a -basis, so . Their independence follows by grouping polynomial monomials according to their exponents modulo , after clearing rational-function denominators.
Every has , so its minimal polynomial divides and . Thus this finite purely inseparable extension has no primitive element. It demonstrates why the separable field extension hypothesis cannot simply be removed.
Past exam of the mathematics course of the University of Cambridge 2017 ii Paper 2 18H a Solution Created 2026-09-24 Updated 2026-10-05
For a number field with real embeddings and conjugate pairs of complex embeddings , use the logarithmic embedding of number field unitsIt is a group homomorphism from multiplication to addition. A unit has field norm , so the coordinates sum to zero. Deleting one coordinate identifies this hyperplane with and gives the desired map.
If its image coordinates remain in a bounded set, the omitted coordinate is bounded too, and every conjugate of has bounded absolute value. The coefficients of its monic minimal polynomial are integers and elementary symmetric expressions in at most bounded conjugates. They are therefore bounded integers. Only finitely many such polynomials, and finitely many roots of them, exist. Thus the inverse image of every bounded set is finite. In particular the kernel is finite and the image is discrete. This argument includes the zero-dimensional target case; it does not yet assert the full-rank part of Dirichlet unit theorem.
Past exam of the mathematics course of the University of Cambridge 2018 ib Paper 4 11G c Solution Created 2026-09-24 Updated 2026-10-03
The characteristic polynomial is . For , one finds but , so the minimal polynomial is . Hence the invariant factors are and , and the rational canonical form is
Past exam of the mathematics course of the University of Cambridge 2018 iii Paper 123 2 a Solution Created 2026-10-03 Updated 2026-10-05
Give the unique extension of the absolute value of . We use two standard facts: a complete non-Archimedean absolute value extends uniquely to every finite algebraic extension, and any two embeddings of a finite separable extension into an algebraic closure are conjugate by an automorphism of that algebraic closure.
A -embedding pulls back this absolute value to a finite place of a number field on extending the given place of . By the permitted equivalence of places and primes, it determines a prime ideal above . Every element of preserves the absolute value by uniqueness, so is constant on each orbit.
Every prime above occurs: its completion of a number field at a prime ideal is a finite extension of and admits a -embedding into . Composing with gives an embedding inducing .
Conversely, suppose two embeddings induce the same prime. Their pulled-back absolute values have the same normalization on , so they extend continuously to embeddings of the same field . To see that their images are still inside the algebraic closure rather than only its completion, the closure of is exactly the finite complete field . The two resulting embeddings of are conjugate by the stated separable-extension fact. Restricting the conjugacy to proves that the original embeddings are in the same orbit. Thus the prime ideals and local embedding orbits are naturally identified:
If , an embedding is determined by the image of , which may be any root of its minimal polynomial . The orbits on these roots are exactly the root sets of the monic irreducible factors of over . HenceIf corresponds to , then and . This is the local factorization and extended absolute values correspondence and does not require an integral power basis.
