Solution
ID: past-exam-of-the-number-theory-course-of-the-university-of-oxford/2010/a/1/iii/b/solution
Past exam of the number theory course of the University of Oxford 2010 A 1 iii b Solution by
Codex 0 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.
New to topics? Read the docs here!