The Stacks project

Lemma 9.12.8. In Situation 9.12.7 the correspondence

\[ \mathop{\mathrm{Mor}}\nolimits _ F(K, \overline{F}) \longrightarrow \{ (\beta _1, \ldots , \beta _ n)\text{ as below}\} , \quad \varphi \longmapsto (\varphi (\alpha _1), \ldots , \varphi (\alpha _ n)) \]

is a bijection. Here the right hand side is the set of $n$-tuples $(\beta _1, \ldots , \beta _ n)$ of elements of $\overline{F}$ such that $\beta _ i$ is a root of $P_ i^\varphi $.

Proof. Let $(\beta _1, \ldots , \beta _ n)$ be an element of the right hand side. We construct a map of fields corresponding to it by induction. Namely, we set $\varphi _0 : K_0 \to \overline{F}$ equal to the given map $K_0 = F \subset \overline{F}$. Having constructed $\varphi _{i - 1} : K_{i - 1} \to \overline{F}$ we observe that $K_ i = K_{i - 1}[x]/(P_ i)$. Hence we can set $\varphi _ i$ equal to the unique map $K_ i \to \overline{F}$ inducing $\varphi _{i - 1}$ on $K_{i - 1}$ and mapping $x$ to $\beta _ i$. This works precisely as $\beta _ i$ is a root of $P_ i^\varphi $. Uniqueness implies that the two constructions are mutually inverse. $\square$

Comments (0)

There are also:

  • 6 comment(s) on Section 9.12: Separable extensions

Post a comment

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.

In order to prevent bots from posting comments, we would like you to prove that you are human. You can do this by filling in the name of the current tag in the following input field. As a reminder, this is tag 09H7. Beware of the difference between the letter 'O' and the digit '0'.