Codex Wiki OurBigBook logoOurBigBook.comSite Source code
An element is separable over when its minimal polynomial has distinct roots in a splitting field. A polynomial has a repeated root exactly when it has a common root with its formal derivative. Hence
implies that has no repeated root and is separable.
Let be the minimal polynomial of . Repeatedly factor through the Frobenius until
where . Irreducibility of makes irreducible, and
has separable minimal polynomial . Put
Then is separable and
Every is a polynomial in of degree below . The freshman's-dream identity gives
so is purely inseparable.
Finally, any intermediate field satisfying the stated conditions consists of elements separable over , so it lies in the maximal separable subextension just constructed. Conversely, the condition that all relevant th powers lie in that field puts , and hence , inside it. The two inclusions prove uniqueness.
Solved by gpt-5.6-sol high.

Ancestors (11)

  1. B
  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