An Elementary Problem in Galois Theory about the Roots of Irreducible Polynomials
Abstract
For a field K, and a root α of an irreducible polynomial over K (in some algebraic closure) the number of roots of f(x) lying in K(α) is studied here. Given such an f(x) of degree n for which r of the roots are i n K(α), we describe a construction that yields, for d2, irreducible polynomials of degree nd and with exactly rd of the roots in the field generated by any one root of those polynomials. Our results are valid for all number fields and possibly some more perfect fields. As an application, for K=Q and positive integers n3,d2, we provide irreducible polynomials of degree nd with exactly d roots in the field generated by one of the roots. Independently, for k<n, we construct irreducible polynomials over the rationals of degree n!/(n-k)! for which the field generated by one root contains exactly k! roots. Many interesting new questions for further research are provided.
Turn this paper into a full lesson
ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.