[guided]It remains to count the complex roots of $p_\alpha \in \mathbb{Q}[x]$, a polynomial of degree $n$. Two facts are needed:
1. $p_\alpha$ has $n$ roots in $\mathbb{C}$ counted with multiplicity.
2. The roots are in fact distinct (no repeated roots).
**Step A: counting with multiplicity.** By the [Fundamental Theorem of Algebra](/theorems/???), $\mathbb{C}$ is algebraically closed: every non-constant polynomial in $\mathbb{C}[x]$ has a root in $\mathbb{C}$. As a consequence, any polynomial $g \in \mathbb{C}[x]$ of degree $d$ splits completely over $\mathbb{C}$ into $d$ linear factors (iterate: peel off a root, divide, repeat). Applied to $p_\alpha$, viewed as an element of $\mathbb{C}[x] \supseteq \mathbb{Q}[x]$:
\begin{align*}
p_\alpha(x) = \prod_{i=1}^n (x - \alpha_i) \qquad \text{for some } \alpha_i \in \mathbb{C}.
\end{align*}
The $\alpha_i$ are the roots of $p_\alpha$ in $\mathbb{C}$, counted with multiplicity.
**Step B: distinctness.** The $\alpha_i$ might a priori coincide (be repeated roots). We rule this out using separability.
**Irreducibility of $p_\alpha$ in $\mathbb{Q}[x]$**: if $p_\alpha = g h$ in $\mathbb{Q}[x]$ with $1 \leq \deg g, \deg h < \deg p_\alpha$, then in the integral domain $L$ we have $g(\alpha) h(\alpha) = p_\alpha(\alpha) = 0$, so $g(\alpha) = 0$ or $h(\alpha) = 0$. Either contradicts the minimality of $\deg p_\alpha$. Hence $p_\alpha$ is irreducible in $\mathbb{Q}[x]$.
**Separability of $p_\alpha$**: a polynomial is [separable](/pages/???) if it has no multiple roots in a splitting field. Over a field of characteristic $0$ (like $\mathbb{Q}$), every irreducible polynomial is separable:
- Argument: if $p_\alpha$ has a multiple root $\alpha_j$ in its splitting field $M$, then $p_\alpha$ and its formal derivative $p_\alpha' \in \mathbb{Q}[x]$ share the root $\alpha_j$ in $M$. Hence $\gcd(p_\alpha, p_\alpha')$ in $\mathbb{Q}[x]$ (computed via the Euclidean algorithm, which is the same in $\mathbb{Q}[x]$ and $M[x]$) has degree $\geq 1$.
- $p_\alpha$ is irreducible of degree $n$, so any divisor of $p_\alpha$ of degree $\geq 1$ is an associate of $p_\alpha$ itself, i.e. has degree exactly $n$. So $\gcd(p_\alpha, p_\alpha')$ has degree $n$.
- But $\deg p_\alpha' = n - 1$ (taking formal derivative drops the degree by one, and $n - 1 \geq 0$ for $n \geq 1$; in characteristic $0$ the leading term does not vanish). So the gcd has degree $\leq n - 1 < n$, contradiction.
Hence $p_\alpha$ has $n$ **distinct** roots in $\mathbb{C}$.
**Combining**:
\begin{align*}
\#\{\beta \in \mathbb{C} : p_\alpha(\beta) = 0\} = n.
\end{align*}
And by the bijection $\Psi: \operatorname{Hom}_{\mathbb{Q}\text{-alg}}(L, \mathbb{C}) \xrightarrow{\sim} \{\beta \in \mathbb{C} : p_\alpha(\beta) = 0\}$ from the previous step:
\begin{align*}
\#\{\sigma: L \hookrightarrow \mathbb{C}\} = n = [L:\mathbb{Q}].
\end{align*}
Concretely, the $n$ embeddings are
\begin{align*}
\sigma_i: L &\hookrightarrow \mathbb{C}, \\
\alpha &\mapsto \alpha_i, \qquad i = 1, \ldots, n,
\end{align*}
each determined by sending the primitive element $\alpha$ to the $i$-th root of its minimal polynomial.
**A failure mode to note**: if $\mathbb{Q}$ were replaced by a field of positive characteristic $p$ and $L/\mathbb{Q}$ were not separable, then $p_\alpha$ could have repeated roots, and the count of embeddings into a suitable algebraic closure would be strictly less than $[L:\mathbb{Q}]$. The equality "$\#$ embeddings $ = n$" is a statement about separable extensions specifically, and it holds for all number fields because characteristic $0$ forces separability.[/guided]