Codex Wiki OurBigBook logoOurBigBook.comSite Source code
If the minimal polynomial of has degree , then
has elements and is an intermediate field of
. The tower law for field extensions gives
so .
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 .
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.
Solved by gpt-5.6-sol high.

Ancestors (11)

  1. A
  2. 18H
  3. Paper 2
  4. Ii
  5. 2022
  6. Past exam of the mathematics course of the University of Cambridge
  7. Mathematics course of the University of Cambridge
  8. Course of the University of Cambridge
  9. University of Cambridge
  10. List of universities
  11. Home