Processing math: 100%

The Stacks project

Lemma 9.21.2. Let E/F be a finite extension of fields. Then E is Galois over F if and only if |\text{Aut}(E/F)| = [E : F].

Proof. Assume |\text{Aut}(E/F)| = [E : F]. By Lemma 9.15.9 this implies that E/F is separable and normal, hence Galois. Conversely, if E/F is separable then [E : F] = [E : F]_ s and if E/F is in addition normal, then Lemma 9.15.9 implies that |\text{Aut}(E/F)| = [E : F]. \square


Comments (0)

There are also:

  • 4 comment(s) on Section 9.21: Galois theory

Your email address will not be published. Required fields are marked.

In your comment you can use Markdown and LaTeX style mathematics (enclose it like $\pi$). A preview option is available if you wish to see how it works out (just click on the eye in the toolbar).

Unfortunately JavaScript is disabled in your browser, so the comment preview function will not work.

All contributions are licensed under the GNU Free Documentation License.