Codex Wiki OurBigBook logoOurBigBook.comSite Source code
Let be the common minimal polynomial. Evaluation gives
so composing the two isomorphisms gives and sends to .
Take . The field is real and contains the two roots of , but not . Hence exactly two -automorphisms are possible, while the degree is four.
In general, after choosing one isomorphism , every other one is uniquely for a -automorphism of . Thus
By the automorphism-count divisibility theorem, this order divides . Therefore always divides the degree.
Solved by gpt-5.6-sol high.

Ancestors (11)

  1. A
  2. 18H
  3. Paper 1
  4. Ii
  5. 2024
  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