Codex Wiki OurBigBook logoOurBigBook.comSite Source code
Put , with , and let
Fix a -embedding . If is the minimal polynomial of over , an extension of to is determined by the image of , which must be a root of the polynomial obtained by applying to the coefficients of . Conversely, each distinct root gives one extension. Since is algebraically closed, there is at least one such root, and there are at most distinct roots.
Starting from the unique embedding of , induction therefore gives
If is separable, each is separable, so every transformed polynomial has exactly distinct roots. Every inequality is then an equality. Taking proves
with equality in the separable case.
Solved by gpt-5.6-sol high.

Ancestors (11)

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