Past exam of the mathematics course of the University of Cambridge 2025 iii Paper 166 2 h Solution Created 2026-09-24 Updated 2026-10-03
For an integer , let be a root ofIts roots areThe polynomial is irreducible over : its discriminant is , and the product of the coprime consecutive integers and cannot be a square unless both are squares, which is impossible for consecutive positive squares beyond .
The height-Mahler measure formula givesBoth algebraic conjugates of exceed , soConsequentlyFix, for example, . For all sufficiently large , the ratio is larger than by a fixed margin, while . Hence, for every , some sufficiently large satisfies
An algebraic element is a separable algebraic element over if its minimal polynomial of an algebraic element has distinct roots in a splitting field. A field extension is a separable extension if all its elements are separable algebraic elements.
The formal derivative is additive and satisfies . For monomials, . Distributing over the finitely many coefficients proves the product rule over any field. If in an extension, the rule gives , so , including in characteristic two. If were relatively prime in , the Bézout's identity for polynomials would give , whose evaluation at is impossible. Hence they are not relatively prime.
In characteristic zero, the formal derivative of a positive-degree irreducible polynomial is nonzero and has smaller degree. Thus , since an irreducible polynomial has no proper nonconstant factor. By the previous argument, has no repeated root. Every element of a finite field extension is algebraic, so the extension is a separable extension.
For , let . The characteristic- identity gives , so is already a splitting field. It is a proper extension by the allowed no-root fact. More precisely, the minimal polynomial of an algebraic element divides and, over , equals for some . If , its next-to-leading coefficient is , forcing because in , a contradiction. Hence its minimal polynomial of an algebraic element is , with its one root repeated times. The extension is therefore inseparable, of degree .
By contrast, every finite field extension is a separable extension. If , then . Lagrange's theorem in its nonzero multiplicative group gives for all . Thus every element is a root of , whose formal derivative is ; it has no repeated roots. Every minimal polynomial of an algebraic element divides this separable polynomial, proving the assertion.
Dedekind factorization theorem states that if with integral and does not divide , then a factorization of its minimal polynomial of an algebraic element into distinct monic irreducible polynomials over givesThe factors are distinct prime ideals; the residue degrees and ramification indices satisfy . Unique prime ideal factorization holds in the ring of integers.
For a square-free integer , , so the index condition is automatic. If , the polynomial reduces to modulo . HenceTherefore . By unique prime ideal factorization, .
Let be a nonempty proper subset and put . For , and is a square-free integer. If , its ideal norm givesThe inequality forces , leaving , impossible for a square-free integer greater than one. Thus every such subproduct is nonprincipal.
These are ramified prime classes for discriminant minus four d. The ideal classes have order dividing two. Their product is the identity, and the preceding proof rules out every other nonempty subset relation. The homomorphism defined by these classes consequently has kernel exactly . Its image is thereforeThe boundary case has and makes the printed exponent meaningless; its field is with trivial ideal class group. The subgroup statement is understood for , while the prime-factor and proper-subset statements are empty for .
Minkowski convex body theorem states that a centrally symmetric convex measurable subset of with volume greater than times the covolume of a full Euclidean lattice contains a nonzero lattice point. The equivalent closed-boundary form follows by compactness for compact convex bodies.
The set is centrally symmetric. It is convex because for , the triangle inequality gives . It is a diamond of area . For the embedded nonzero integral ideal , the given covolume is . Hence Minkowski convex body theorem applies whenFor the resulting nonzero , write , . ThenDecrease to . A fixed slightly larger diamond contains only finitely many lattice points, so one nonzero recurs along a sequence of such values. Passing to the limit provesGiven a target ideal class , choose an integral ideal in . Since , the ideal is integral, belongs to , and has ideal normFor , every ideal class thus has an integral representative of norm at most . The only possibilities are norms one, two or three. The prime two ramifies, giving the unique ideal of norm two . The element has field norm , so , making it principal. The prime three is inert because is an irreducible polynomial; its prime ideal has norm nine, so there is no ideal of norm three. Every possible small representative is principal, proving class number one for Q square root of fourteen. Therefore
For an irreducible polynomial , take and let be the class of . The quotient is a field, is generated by over , and satisfies . Its degree is , with basis .
A splitting field is a field generated over by all roots of the polynomial and in which the polynomial is a product of linear factors. Prove existence and the factorial bound together by induction on the degree. Constant nonzero polynomials and linear polynomials require no extension. For a reducible degree- polynomial write with positive degrees . Split by induction, then split over that field. The resulting field is generated by all roots of , and its degree over is at most . If is irreducible, adjoin one root in degree , divide out its linear factor, and split the degree- quotient over that extension. The tower formula gives degree at most . This also works in inseparable characteristic and proves the required bound without assuming Galoisness.
For the sextic with constant term three, Eisenstein's criterion at three gives degree six. Choose a root , so is a square root of . Thensatisfies , and is a primitive sixth root of unity: and . The six distinct roots are for , all in . Hence the simple extension is itself the splitting field and .
For the constant term two, Eisenstein at two gives for a root . Its splitting field is . The supplied noncontainment of a root of means that adjoining has degree two. Thus
The Galois group is the group of all field automorphisms of fixing every element of , with composition as its operation. A finite extension is a Galois extension if it is both normal and separable; equivalently, it is a splitting extension of separable polynomials, or its group has order . Normality means that every irreducible polynomial over with a root in splits there.
The polynomial is an irreducible polynomial over , so . This intermediate field is real, so it does not contain . Hence has no root in it and adjoining has degree two. The tower law givesA basis is . Square-bracket adjoining notation in this algebraic example gives the same field as round-bracket adjoining notation.
If with both factors of positive degree, evaluation gives . Since is a field, one factor vanishes at , contrary to the minimal degree of . Thus is an irreducible polynomial over .
For the final unnumbered request, satisfies . The monic quadratic has no rational root, since its discriminant is . It is therefore an irreducible polynomial over , and
The polynomial identityshows that the roots are the ninth roots of unity which are not third roots. These are precisely the primitive ninth roots of unity, all powers of . Thus the splitting field is . The supplied irreducibility statement makes the displayed degree-six polynomial the minimal polynomial of , giving
An irreducible polynomial has positive degree, so its ideal is proper: otherwise would contradict degrees. Every nonzero class has a representative not divisible by . Irreducibility gives , and the Euclidean algorithm supplies polynomials with . Passing to the quotient gives . Thus the quotient is a nonzero commutative ring in which every nonzero element has an inverse, hence a field. Constants embed injectively because no nonzero constant lies in the positive-degree ideal .
A splitting field of over is a field extension in which is a product of linear factors and which is generated over by its roots. The generation condition rules out adjoining unrelated elements.
For existence, induct on the degree of a polynomial. Choose an irreducible polynomial divisor of . The quotient ring is a field because is a maximal ideal; the class of is a root of , hence of . Over this field extension, divide out and apply induction to the remaining polynomial. This gives an extension in which splits. Inside it, the subfield generated by all roots is a splitting field. The induction starts with a linear polynomial, whose splitting field is already . Thus every positive-degree polynomial has a splitting field; being monic is unnecessary for existence.
The cubic has no root in , since its values at and are both . A cubic over a field is irreducible precisely when it has no root. Consequentlyis a field extension of degree , with eight elements. The Frobenius endomorphism takes a root of a polynomial over to another root, so the roots are . They are distinct: equality between any two would make the Frobenius endomorphism orbit have length less than , contradicting the minimal polynomial of . They all lie in , and one of them generates . Hence
A monic quadratic polynomial over a field is irreducible exactly when it has no root in that field. Testing the nine choices of its two coefficients in givesFor clarity, a zero constant term gives a root at zero. Among constant term one, only the zero linear coefficient avoids roots at . Among constant term two, precisely the linear coefficients one and two avoid roots. This exhausts all choices.
Put . Its values at are respectively , so it has no linear factor. If this quartic were reducible, absence of a linear factor would force a factorization into two irreducible quadratics. Division by the three candidates above gives remainders respectively , all nonzero. Thus is an irreducible polynomial.
The quotient by an irreducible polynomial is a field consequently gives a field of elements. Its nonzero elements form a multiplicative group of a finite field of order . In this field, . Successive squaring givesThe latter is not one: otherwise the nonzero polynomial of degree below four would vanish at , contradicting its minimal polynomial. By Lagrange's theorem, . Since five is prime, its order is exactly five. Hence one answer isIts other nonidentity powers are the remaining primitive fifth roots. It is unnecessary to prove that itself generates the entire multiplicative group.
A monic quadratic polynomial over a field is irreducible exactly when it has no root in that field. Testing the nine choices of its two coefficients in givesFor clarity, a zero constant term gives a root at zero. Among constant term one, only the zero linear coefficient avoids roots at . Among constant term two, precisely the linear coefficients one and two avoid roots. This exhausts all choices.
Put . Its values at are respectively , so it has no linear factor. If this quartic were reducible, absence of a linear factor would force a factorization into two irreducible quadratics. Division by the three candidates above gives remainders respectively , all nonzero. Thus is an irreducible polynomial.
The quotient by an irreducible polynomial is a field consequently gives a field of elements. Its nonzero elements form a multiplicative group of a finite field of order . In this field, . Successive squaring givesThe latter is not one: otherwise the nonzero polynomial of degree below four would vanish at , contradicting its minimal polynomial. By Lagrange's theorem, . Since five is prime, its order is exactly five. Hence one answer isIts other nonidentity powers are the remaining primitive fifth roots. It is unnecessary to prove that itself generates the entire multiplicative group.
The degree of a field extension is the dimension of as a vector space over . The tower law states that for finite extensions ,If the left side is prime, one factor is one. Degree one forces equality of the corresponding fields, so there is no proper intermediate field.
Let have 32 elements. Its prime field is , and its dimension over that field is five, since a dimension- vector space over has elements. Every element outside has minimal polynomial of degree five: its generated intermediate field has degree greater than one and dividing five.
Every element of satisfies , by the multiplicative group of a field of order 31 for nonzero elements. Hence splits completely over and has no repeated roots, since its derivative is minus one. Conversely any irreducible polynomial over gives a quotient ring with 32 elements. Its defining element satisfies , so divides that polynomial and therefore has all five distinct roots in .
The 30 elements of are thus partitioned into disjoint five-element root sets of the irreducible polynomials. Their number isNo classification of the six individual polynomials is needed; the tower degree and separability already count them all.
The polynomial has no root in , so it is an irreducible polynomial. The quotient ring of by the ideal it generates is therefore a field with eight elements. The seven nonzero elements form a group of order seven, so each satisfies by Lagrange's theorem. Thus this field splits . A root different from one has order seven; it cannot lie in and generates this degree-three field extension, since three is prime and the tower law applies. Therefore
Since and the extension is finite, the element is algebraic. Its minimal polynomial is irreducible, and evaluation gives an isomorphism . If its degree is , the powers form a basis. Comparing with gives .
A splitting field of over is an extension field in which factors into linear factors and which is generated over by those roots. The generation requirement excludes unnecessary extra elements.
For existence, induct on the degree. An irreducible factor of gives a field , since an irreducible polynomial generates a maximal ideal in the polynomial ring over a field. The class of is a root of and hence of . By the factor theorem, over , with . Induction gives a splitting field of over . It contains all roots of ; taking the subfield generated by these roots over gives exactly a splitting field of . The degree-one case is immediate. Thus
If , then is a scalar matrix. Its invariant factors of a linear operator are four copies of , so its rational canonical form isHere and , including when .
Now let and putOn each two-dimensional invariant block, satisfies . The vectors form a cyclic vector basis, since their coordinate matrix is with determinant . Directly,Applying this basis change to both blocks givesThus and . In particular there are two invariant factors , rather than a single block for . Also for every real , so it is an irreducible polynomial over . This is an instance of rational canonical form under an affine change.
Finally implies . Substituting , in the preceding result gives , and henceIts minimal polynomial is and its characteristic polynomial is . The normalized reciprocal of is also , agreeing with rational canonical form of an inverse.
Past exam of the rings and modules course of the University of Oxford 2021 1 a ii Solution 2026-10-25
Regard as the polynomial ring . The coefficient ring is a Euclidean domain, hence a principal ideal domain. The element is a prime element: the quotient ring is an integral domain.
The monic polynomial has its other coefficients divisible by , while . Part (a)(i), with playing the role of and the indeterminate, proves that is an irreducible polynomial.
Now use the automorphism of a polynomial ringIts inverse fixes and sends to . A ring isomorphism preserves units and factorizations, hence preserves irreducible elements. Sincewe obtainApplying the Eisenstein criterion directly to the second expression with the prime element would fail, since ; the change of indeterminate supplies the required argument.