Past exam of the mathematics course of the University of Cambridge 2018 ii Paper 2 18I Solution Created 2026-09-24 Updated 2026-10-03
The splitting field of is the smallest extension in which is a product of linear factors; equivalently, is generated over by all its roots of a polynomial. To prove existence and uniqueness of splitting fields, adjoin a root of an irreducible polynomial dividing and repeat until splits. If and are two resulting fields, an embedding between the fields generated so far extends by sending each newly adjoined root to a root of its transformed minimal polynomial. Repetition gives a -embedding , whose image contains every root of and is therefore all of . Thus the splitting field exists and is unique up to -isomorphism.
Now write , and let the distinct irreducible factors of have degrees . The irreducible factors of a finite-field Frobenius polynomial show that a root of the degree- factor lies in exactly when . Hence the splitting field over a finite field isEvery finite field is a perfect field, so is separable; it is normal because it is a splitting field. It is consequently a Galois extension. More explicitly, the Galois group of a finite field extension is the cyclic group of order generated by the finite-field Frobenius automorphism .
Finally, let denote the number of monic irreducible polynomials over a finite field of degree over . Sinceand , , , we obtain
Past exam of the mathematics course of the University of Cambridge 2018 ii Paper 2 20G a Solution Created 2026-09-24 Updated 2026-10-03
The cyclotomic polynomial of the primitive th root isBy the irreducibility of cyclotomic polynomials, this is the minimal polynomial of over . The prime cyclotomic field degree therefore gives
Past exam of the mathematics course of the University of Cambridge 2019 ib Paper 2 10F c Solution Created 2026-09-24 Updated 2026-09-29
Past exam of the mathematics course of the University of Cambridge 2019 ib Paper 2 10F d Solution Created 2026-09-24 Updated 2026-09-29
For every nonnegative integer ,Consequently, if , thenBy the divisibility characterization of the minimal polynomial,Interchanging and also gives . Therefore the Minimal polynomials of AB and BA can differ only in the exponent of the factor , and that exponent differs by at most one.
If is diagonalizable, its minimal polynomial has no repeated roots. The preceding divisibility says that every nonzero Jordan block of has size one and every zero-eigenvalue block has size at most two. Squaring preserves the one-dimensional nonzero blocks and sends every size-at-most-two nilpotent block to zero. Thus the Jordan normal form of is diagonal, so
Past exam of the mathematics course of the University of Cambridge 2019 ii Paper 3 18F Solution Created 2026-09-24 Updated 2026-10-03
Let be a splitting field of over . Its formal derivative isThe assumption on the characteristic of says that in . Any root of is nonzero, and hence . Thus and have no common root, so is a separable polynomial. Since it has degree and splits over , it has exactly distinct roots. This is the separability of roots of unity.
Fix a primitive root of unity . Define the th cyclotomic polynomial byIt is monic and has degree given by the Euler totient function . Partitioning all th roots of unity according to their exact multiplicative order gives the cyclotomic factorizationWe now prove by mathematical induction that . The base case is . If the result holds for every proper divisor of , thenis monic and belongs to . Polynomial division of by the monic integer polynomial produces a quotient and remainder in . The factorization over says that the remainder is zero and the quotient is , proving the claim.
It remains to prove irreducibility of cyclotomic polynomials. Let be a monic irreducible polynomial dividing , let be a root of , and write . We claim that is a root of for every prime number . Otherwise is a root of , so is a root of . Since is the minimal polynomial of over , Gauss lemma for polynomials givesAfter reduction of an integer polynomial modulo a prime, the Frobenius endomorphism givesChoose an irreducible factor of the nonconstant monic polynomial . Then , so . The cyclotomic factorization would then make divide over . This is impossible because its derivative is coprime to it when .
Thus for every prime . Iterating this fact over a prime factorization shows that whenever . These are all primitive th roots, soBecause divides , equality holds and . Hence every cyclotomic polynomial is irreducible over .
Finally, direct multiplication givesAlsoApplying the cyclotomic factorization to the two factors on the right givesand thereforeSince , cancellation yieldsThe thirtieth cyclotomic polynomial is irreducible over by the theorem just proved, so is irreducible.
Past exam of the mathematics course of the University of Cambridge 2020 ib Paper 1 9G Solution Created 2026-09-24 Updated 2026-09-29
The structure theorem for finitely generated modules over a principal ideal domain applies because every Euclidean domain is a principal ideal domain. It says that a finitely generated -module is isomorphic towhere the nonzero nonunits are unique up to multiplication by units. They are the invariant factors.
For , multiplication by is the linear map . Since is finite-dimensional over , is a finitely generated torsion module over the polynomial ring , so it has no free summand. Choosing each invariant factor to be monic givesThe basis of each cyclic summand makes multiplication by a companion matrix. Concatenating these bases therefore puts in rational canonical form.
On , a polynomial annihilates multiplication by exactly when it is divisible by . It follows that the minimal polynomial and characteristic polynomial areThe second identity follows blockwise from the characteristic polynomial of a companion matrix. Since every divides , the product annihilates every cyclic summand. Thus , which is the Cayley-Hamilton theorem.
For the displayed matrix, the given generators of are the columns ofElementary row and column operations over give the Smith normal formConsequently the nonunit invariant factors areand, as a check,
Past exam of the mathematics course of the University of Cambridge 2020 ib Paper 2 9G Solution Created 2026-09-24 Updated 2026-09-29
Gauss lemma for polynomials states that the product of two primitive polynomials over a unique factorization domain is primitive. In particular, a primitive polynomial in is reducible over exactly when it is reducible over .
Eisenstein criterion says that a primitive polynomialis irreducible over if there is a prime such that , for every , and . To prove it, suppose with both factors of positive degree. After removing contents, Gauss's lemma lets us take primitive. Reduction modulo givesso both reduced factors are monomials of positive degree. Their constant terms are therefore divisible by , making divide , a contradiction.
An algebraic integer is a complex number satisfying a monic polynomial in . Let be one and let be its monic minimal polynomial. The usual proof using polynomial content shows that . The setis the kernel of the polynomial-evaluation ring homomorphism, hence an ideal. Every is divisible by in . Because is monic, polynomial division of by takes place in , and the remainder must vanish by minimality. Thereforewhere is monic and irreducible.
Fortranslation givesThis is Eisenstein at , so and therefore are irreducible over . HenceIrreducibility and Gauss's lemma also show that is a prime ideal of , soIt is not a field. The class of is nonzero but not a unit: reducing further modulo gives a nonzero quotientin which the image of is zero, whereas a unit must remain a unit under every unital quotient map. Thus
Past exam of the mathematics course of the University of Cambridge 2021 ib Paper 2 8E a Solution Created 2026-09-24 Updated 2026-09-25
A direct determinant calculation givesMoreover,has rank one, so its kernel has dimension two, while and . Hence the minimal polynomial isThere are two Jordan blocks, because the eigenspace has dimension two, and the largest has size two, because the minimal polynomial has exponent two. Thus
Past exam of the mathematics course of the University of Cambridge 2022 ib Paper 3 9F a Solution Created 2026-09-24 Updated 2026-09-25
The minimal polynomial is the unique monic polynomial of least positive degree such that . The Cayley-Hamilton theorem says that satisfies its characteristic polynomial, so such polynomials exist. Dividing any two monic candidates of least degree shows uniqueness.
Past exam of the mathematics course of the University of Cambridge 2022 ib Paper 3 9F c i Solution Created 2026-09-24 Updated 2026-09-25
SetFor every ,Consequently contains as a polynomial factor and is zero. By the divisibility property of the minimal polynomial,
Past exam of the mathematics course of the University of Cambridge 2022 ii Paper 2 18H a Solution Created 2026-09-24 Updated 2026-09-25
If the minimal polynomial of has degree , then
has elements and is an intermediate field of
. The tower law for field extensions givesso .
has elements and is an intermediate field of
. The tower law for field extensions givesso .
The multiplicative group of a finite field is cyclic. Choose a generator
of , of order . If lay in a proper intermediate field of degree , its order would divide , a contradiction. Thus
and its minimal polynomial has degree .
of , of order . If lay in a proper intermediate field of degree , its order would divide , a contradiction. Thus
and its minimal polynomial has degree .
For arbitrary , let be the splitting field of
over . Its roots form a field: the Frobenius endomorphism shows they are closed under addition, subtraction, multiplication, and inversion. The derivative is , so there are exactly distinct roots. Thus this root field has order . Applying the preceding generator argument supplies an element whose minimal polynomial over has degree , proving that an irreducible polynomial of every positive degree exists.
over . Its roots form a field: the Frobenius endomorphism shows they are closed under addition, subtraction, multiplication, and inversion. The derivative is , so there are exactly distinct roots. Thus this root field has order . Applying the preceding generator argument supplies an element whose minimal polynomial over has degree , proving that an irreducible polynomial of every positive degree exists.
Past exam of the mathematics course of the University of Cambridge 2022 ii Paper 2 18H b Solution Created 2026-09-24 Updated 2026-09-25
An element is separable over when its minimal polynomial has distinct roots in a splitting field. A polynomial has a repeated root exactly when it has a common root with its formal derivative. Hence
implies that has no repeated root and is separable.
implies that has no repeated root and is separable.
Let be the minimal polynomial of . Repeatedly factor through the Frobenius untilwhere . Irreducibility of makes irreducible, and
has separable minimal polynomial . PutThen is separable andEvery is a polynomial in of degree below . The freshman's-dream identity givesso is purely inseparable.
has separable minimal polynomial . PutThen is separable andEvery is a polynomial in of degree below . The freshman's-dream identity givesso is purely inseparable.
Finally, any intermediate field satisfying the stated conditions consists of elements separable over , so it lies in the maximal separable subextension just constructed. Conversely, the condition that all relevant th powers lie in that field puts , and hence , inside it. The two inclusions prove uniqueness.
Past exam of the mathematics course of the University of Cambridge 2022 ii Paper 2 20H b Solution Created 2026-09-24 Updated 2026-09-25
The Dedekind factorization theorem says that, when a rational prime does not divide the index of an order , a factorizationof the minimal polynomial modulo gives
Let with square-free , and let be odd. The resulting splitting of rational primes in a quadratic field is:
Finally suppose and
has norm , with integers
chosen coprime. ThenIf an odd ramified, then . Reduction modulo gives
. Since is not a square modulo such a prime, . Dividing the equation's divisibility shows as well (use that square-free has -adic valuation one), contradicting coprimality. Hence no prime ramifies.
has norm , with integers
chosen coprime. ThenIf an odd ramified, then . Reduction modulo gives
. Since is not a square modulo such a prime, . Dividing the equation's divisibility shows as well (use that square-free has -adic valuation one), contradicting coprimality. Hence no prime ramifies.
Past exam of the mathematics course of the University of Cambridge 2022 ii Paper 3 18H a Solution Created 2026-09-24 Updated 2026-09-25
The automorphisms are distinct and hence linearly independent as maps by the linear independence of distinct field embeddings. Therefore the operatoris not the zero map. Choose for which . Reindexing the sum and using givesThis is the Lagrange resolvent eigenvector for a cyclic field automorphism.
Let be the fixed field. Since , the element is a root ofIts orbit under isand these elements are distinct because and is a primitive root of unity. Hence the minimal polynomial has at least distinct roots. It also divides the displayed degree- polynomial, so
Past exam of the mathematics course of the University of Cambridge 2022 ii Paper 3 18H c Solution Created 2026-09-24 Updated 2026-09-25
Because , the finite extension is separable. By the primitive element theorem, write . The minimal polynomial of over has a root in the algebraically closed field , so sending to that root defines a -field embedding .
The cyclic group acts faithfully on after replacing by the order of . The Artin fixed-field theorem givesand says that is a finite Galois extension with cyclic Galois group . The image is an intermediate field. Every subgroup of a cyclic group is normal, so the normal subextension criterion shows that is Galois, and its Galois group is a quotient of , hence cyclic. Transporting this structure through proves that is Galois with cyclic Galois group. This is the finite extensions of the fixed field of a finite-order automorphism of an algebraically closed field theorem.
Algebraic closedness is necessary. Take and , so , and let . The extension has degree three but is not normal, since the two nonreal roots of do not belong to . It is therefore not Galois.
Past exam of the mathematics course of the University of Cambridge 2023 ib Paper 4 9E Solution Created 2026-09-23 Updated 2026-10-03
Letbe a primitive polynomial. The Eisenstein criterion states that if a prime number satisfiesthen is an irreducible polynomial in , equivalently in by Gauss lemma for polynomials.
To prove it, suppose that with of positive degree. Primitivity and Gauss's lemma let us take such an integral factorisation if a factorisation over exists. Reducing modulo givesBecause does not divide the leading coefficient of , neither factor loses degree on reduction. The polynomial ring is a unique factorization domain, so both reductions are monomials of positive degree. In particular, divides both constant terms and . It follows that dividesa contradiction. This proves the criterion.
For a prime , translate the geometric sum by one:Its leading coefficient is one, every other coefficient is divisible by , and its constant coefficient is , which is not divisible by . It is therefore Eisenstein at . Translation is an automorphism of , soThis is the geometric-sum irreducibility criterion.
The evaluation homomorphismhas image and contains in its kernel. Since is monic, division by in writes every as with . If , then ; the irreducibility of says that is the minimal polynomial of , so . Thus , and the first isomorphism theorem for rings gives
Now take . Then , and the Eisenstein integers areComplex conjugation sends to , so the field norm isGiven , choose integers with . For ,For with , apply this to and put . ThenHence the norm is a Euclidean function, proving that is a Euclidean domain. This is the Euclidean norm on the Eisenstein integers.
Finally suppose satisfies . Make the free abelian group into a -module by definingThis is well-defined precisely because obeys the same polynomial relation as . The module is finitely generated. It is also torsion-free module: if and , multiplication by the conjugate of gives , and the additive group has no nonzero integer torsion.
A Euclidean domain is a principal ideal domain, and the structure theorem for finitely generated modules over a principal ideal domain says that a finitely generated torsion-free module over one is free. Thusfor some . Since has free module basis over , comparison of abelian ranks gives . There can consequently be no such matrix when is odd.
If , choose a -basis . Thenis a -basis, and . In this basis the matrix of is a direct sum of copies ofEvery admissible matrix is therefore conjugate in to . Hence there is exactly one conjugacy class for even , and none for odd . This is the classification of integral matrices satisfying the third cyclotomic polynomial.
Past exam of the mathematics course of the University of Cambridge 2023 ii Paper 1 18I a Solution Created 2026-09-24 Updated 2026-09-25
A finite extension is normal when every irreducible polynomial in having one root in splits completely over .
Suppose first that is normal. Choose with , and let be the minimal polynomial of over . Every splits in by normality, and is generated by their roots because it is already generated by the particular roots . Thus is the splitting field of .
Conversely, suppose that is the splitting field of . Every -embedding permutes the roots of , so . By the embedding characterization of normality, is normal. This proves the finite normal extension as a splitting field criterion.