Past exam of the mathematics course of the University of Cambridge 2026 iii Paper 166 2 d Solution Created 2026-09-24 Updated 2026-09-25
Suppose, for a contradiction, that suitable nonzero polynomials vanish at both and . If , then the primitive minimal polynomial divides . The multiplicativity of Mahler measure and the Mahler measure bounded by polynomial length give
If , then, using , this inequality contradicts . Hence is a proper intermediate field of . Its degree divides the prime by the tower law, so . Applying the same argument to is even stronger and gives . Since ,contrary to . At least one of the two proposed values of therefore has no such polynomial relation.
For an inseparable example, take and . Eisenstein's criterion at the prime in , followed by Gauss lemma for polynomials, proves irreducibility over its fraction field. Its derivative is zero, and in a splitting field it is , so it is inseparable.
Now let be a separable splitting extension of a nonzero polynomial . Every irreducible factor of has a root , and is a scalar multiple of the minimal polynomial of . Separability of makes this polynomial separable. Therefore every irreducible factor of is separable, which proves the requested conclusion in the factorwise convention. The squarefree qualification under the alternative convention is explained in part (a).
Past exam of the number theory course of the University of Oxford 2010 A 1 iii a Solution 2026-10-31
First, the number of embeddings extending a prescribed base embedding is at most the extension degree. Prove this for any finite extension by choosing finitely many algebraic generators and applying part (i) successively. At each step the number of extensions is at most the degree of that simple step; multiplication and the tower law for field extensions give the total bound.
If is not separable, choose with inseparable minimal polynomial of degree . Its image under has strictly fewer than distinct roots in any target field: inseparability is preserved under the coefficient embedding. Thus there are embeddings of extending . Each extends to in at most ways, giving at mostIf instead does not split in , it again has fewer than distinct roots in , and exactly the same estimate applies. Hence either obstruction makes the embedding count strictly less than .
Past exam of the number theory course of the University of Oxford 2010 A 1 iii b Solution 2026-10-31
Set , beginning with . Suppose extends . The minimal polynomial of over divides its minimal polynomial over . Its image under therefore divides , which splits into distinct linear factors in . It consequently has exactly distinct roots in . Part (i) supplies exactly this many extensions of to .
Starting with the unique prescribed map on , multiply these branching counts:For the final assertion, let be a splitting field of a separable polynomial and embed it in an algebraic closure . It is generated by roots whose minimal polynomials are separable and split in . Applying the just-proved count with gives embeddings. Were inseparable, part (a) would give strictly fewer. Thus the splitting extension is separable. This works for the factorwise convention as well, since the generators' minimal polynomials divide the separable irreducible factors.
The cyclotomic polynomial isBy the allowed irreducibility, this is the minimal polynomial of and its degree is . The field contains every th root of unity and is the splitting field of . This polynomial has no repeated roots in characteristic zero, so the extension is Galois.
An automorphism sends to another primitive root , where is a unit modulo . Conversely each such conjugate defines an embedding, and it is an automorphism of because has an inverse modulo . Composition corresponds to multiplication of exponents. Therefore
Let the monic minimal polynomial of over have coefficients , and put . Each coefficient is algebraic over , so adjoining these finitely many coefficients successively gives . The same polynomial makes algebraic over , giving . The tower law for field extensions yields . Its subfield therefore also has finite degree over . This holds for every , proving is algebraic.
The Kummer-Dedekind theorem states the following. If with integral and , factor the minimal polynomial modulo as into distinct monic irreducible factors. ThenThe index restriction is essential.
For the proposed ideal relation, reflexivity uses and symmetry interchanges . If and , multiplication gives . All multipliers remain nonzero. Thus it is an equivalence relation, namely equality of ideal classes.
Put . The minimal polynomial is and the given full power basis makes every prime eligible for the theorem. Modulo its roots are ; modulo and it is irreducible; modulo its roots are . ConsequentlyThe two inert ideals have norms and ; each split factor has norm equal to its rational prime.
For , quadratic reciprocity and its supplementary laws give . Thus has two distinct roots modulo , giving distinct prime ideals withThe given principal ideal domain property makes for some integers . Taking norms, which are positive here, gives .
Let , whose minimal polynomial is . For , the cyclic group has a nontrivial cube root of unity . Then and are distinct roots of . By the Kummer-Dedekind theorem,Since the given ring of integers is a principal ideal domain, write . Its norm isMultiplication by completes the square:Thus and supply the required integers.
An element is algebraic over when some nonzero polynomial in vanishes at it. Its minimal polynomial is the monic polynomial of least positive degree with this property; scaling a least-degree nonzero vanishing polynomial makes it monic.
If are two such polynomials, they have the same least degree. Their difference has smaller degree because both are monic, and it also vanishes at . Minimality forces the difference to be zero. Hence the monic minimal polynomial is unique.
Put . The tower law for field extensions shows that both and divide . Since are coprime, their product divides , so .
The minimal polynomial of over has degree and is still an annihilating polynomial over . The minimal polynomial over divides it, soThe upper and lower bounds agree:Coprimality is the step forcing the lower bound to equal the product; without it the two generated fields can overlap substantially.
The degree is the dimension of as a vector space over . The tower theorem states that for intermediate fields in a finite extension,If the degree is prime, one factor must be one, forcing or ; no strictly intermediate field exists.
Let have 32 elements. Its prime subfield is and . Every element outside that subfield has minimal polynomial of degree five, by the tower theorem. Also every member of satisfies : nonzero elements form a group of order 31. Hence splits over , with distinct roots because its derivative is in characteristic two.
Every irreducible degree-five polynomial over divides . Indeed its quotient field has 32 elements, and its residue class of satisfies that equation. Thus every such polynomial splits into five distinct roots in . Conversely each of the 30 elements outside has one such minimal polynomial, and different minimal polynomials have disjoint root sets. Consequently the number isThere is no extra leading-coefficient factor, since every nonzero leading coefficient over is one.
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
The notation means that is the smallest subfield containing both and , namely the simple field extension generated by . Its elements can be expressed as rational functions in with coefficients in and nonzero denominator.
Write . The element is a root of , so its minimal polynomial over has degree at most two. Since , that degree cannot be one. The degree of the simple field extension equals the degree of the minimal polynomial, givingIn particular form an -basis, so every element is uniquely . This argument also works in characteristic two; separability is not needed for this part.
The tower law for field extensions states that, for with both successive degrees finite,Indeed, if form an -basis of and form a -basis of , their products form an -basis of : expansion gives spanning, and independence follows first over and then over .
Starting from a unit segment, every straightedge and compass construction introduces coordinates by solving linear or quadratic equations over the coordinates already available. Thus a constructible number belongs to a tower of field extensions whose successive degrees are one or two; the total degree is a power of two. Doubling the volume of a unit cube would require the edge length . Its minimal polynomial over is , irreducible by Eisenstein's criterion at the prime number two. Thus . If that number lay in a construction field of degree , the tower law would make three divide , a contradiction. Therefore doubling the cube by straightedge and compass is impossible.
The tower law for field extensions states that, for with both successive degrees finite,Indeed, if form an -basis of and form a -basis of , their products form an -basis of : expansion gives spanning, and independence follows first over and then over .
Starting from a unit segment, every straightedge and compass construction introduces coordinates by solving linear or quadratic equations over the coordinates already available. Thus a constructible number belongs to a tower of field extensions whose successive degrees are one or two; the total degree is a power of two. Doubling the volume of a unit cube would require the edge length . Its minimal polynomial over is , irreducible by Eisenstein's criterion at the prime number two. Thus . If that number lay in a construction field of degree , the tower law would make three divide , a contradiction. Therefore doubling the cube by straightedge and compass is impossible.
Map the integers into a field by . Its kernel is a prime ideal of , since the image has no zero divisors. Thus the kernel is either zero or for a prime . In the zero case, the map extends injectively to the rational numbers by taking quotients of nonzero integers. In the other case, its image is the field . This proves the prime-field assertion.
A finite field cannot contain the infinite rational field, so it has characteristic . It is a finite-dimensional vector space over its prime field , say of dimension , and choosing a basis counts its elements asFor existence, put and take a splitting field of over . Its derivative is , so it has exactly distinct polynomial roots. The polynomial roots are closed under addition and multiplication because the Frobenius identity gives and . They include , are closed under additive inverses, and for a nonzero polynomial root , . They therefore form a field of exactly elements. Indeed this field is the splitting field because it contains all polynomial roots and is generated by them.
In order 4, characteristic is 2. For , the multiplicative group has order 3, so and . Factorization of gives . The quadratic has no polynomial root in and is the minimal polynomial. Write . The complete tables areFor an element in order 8, the tower law makes divide3. It is not1, so its minimal polynomial is an irreducible monic cubic. Its constant term must be1. A cubic has no polynomial root at 1 exactly when , and absence of a polynomial root is equivalent to cubic irreducibility. Consequently the two possibilities areBoth occur: together with and they factor over , whose distinct polynomial roots are exactly the eight elements of the field. Each cubic contributes its three polynomial roots.
A primitive seventh root generates all seventh roots, so the splitting field is . Its minimal polynomial is the given irreducible cyclotomic polynomial . Therefore .
For a simple field extension, the powers form a basis when the minimal polynomial has degree : reduction modulo that polynomial spans the extension, and a relation of smaller degree would contradict minimality. Hence . The field is , whose dimension is , giving .
The characteristic of a field is the least positive integer with , or zero if none exists. In a finite field a positive such integer exists because the sequence must repeat.
The prime subfield is the intersection of all subfields of , equivalently the subfield generated by . In characteristic it is the copy of formed by the multiples of . Every field automorphism preserves and addition, so it fixes every element of this subfield.
Finally, once the order- Frobenius automorphism below is established, all its powers are distinct. Any automorphism fixes and is determined by its value at the generator . That value must be a root of the degree- minimal polynomial of , so there are at most automorphisms. Hence
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