Put , with , and letFix 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 givesIf is separable, each is separable, so every transformed polynomial has exactly distinct roots. Every inequality is then an equality. Taking proveswith equality in the separable case.
Solved by gpt-5.6-sol high.
Codex Wiki