Is there are nice way to prove the primitive element theorem without using field extensions?


The primitive element theorem says that if $x$ and $y$ are algebraic over $F$ and $y$ is separable over $F$, then there exists a $z \in F(x,y)$ such that $F(x,y) = F(z)$. In the case where $F$ is infinite, $z$ can be expressed in the form $x + {\lambda}y$ with $\lambda \in F$. In fact, almost any $\lambda$ will do. There are only a finite number of exceptions. These exceptions are $\frac{\alpha\_i - x}{y - \beta\_j}$ where $\alpha\_i$ and $\beta\_j$ range over the (other) roots of the minimal polynomials of $x$ and $y$ respectively.


But in order to talk about $\alpha\_i$ and $\beta\_j$ we need to build a field extension where the minimal polynomials of $x$ and $y$ split. This is the step I'm hoping to avoid.


Perhaps we can build a polynomial in $F[x]$ whose roots are $\frac{\alpha\_{i\_1} - \alpha\_{i\_2}}{\beta\_{j\_1} - \beta\_{j\_2}}$ and simply avoid picking $\lambda$s which are roots of this polynomial, and then use whatever properties this polynomials has to prove that this works.


Or maybe there is another completely different way of proving the primitive element theorem while avoiding building field extensions.


I found [a nice proof](http://www.math.uconn.edu/~kconrad/blurbs/galoistheory/separable2.pdf) that $x$ is separable over $F$ if and only if every $y \in F(x)$ is separable over $F$ that avoids building field extensions. It uses derivations instead. Now I'm hoping to do the same with the primitive element theorem.


Edit: I'll try to give some motivation. Adding roots of polynomials to fields in constructive mathematics is more difficult than in classical mathematics (because irreducibility is undecidable). It only works for countable fields, and then you have no guarantee that the original field will be a decidable subset of the new field. Yes, it can be done, but it seems like a pain. There is another way too using double negation translations, but it also seems like a pain. Instead I'd rather avoid the whole issue of *building* splitting fields, if I can, and it seems tantalizingly close to possible. After all, the only reason splitting fields are used here is to build a finite set of elements *in the base field* to avoid.



Primitive element theorem without building field extensions
OK, I have a proof which meets your conditions. I relied on [this write up](http://www.math.washington.edu/~greenber/PrimElem.pdf) of the standard proof as a reference.


**Lemma 1:** Let $K/F$ be an extension of fields, and let $f(x)$ and $g(x)$ be polynomials in $F[x]$. Let $d\_F(x)$ be the GCD of $f$ and $g$ in $F[x]$ and let $d\_K(x)$ be the GCD of $f$ and $g$ in $K[x]$. Then $d\_F(x)$ and $d\_K(x)$ coincide up to a scalar factor.


**Proof:** Since $d\_F(x)|f(x)$ and $d\_F(x)|g(x)$ in $K[x]$, we have $d\_F(x)|d\_K(x)$. Now, there are polynomials $p(x)$ and $q(x)$ in $F[x]$ such that $f(x) p(x) + g(x) q(x) = d\_F(x)$. So $d\_K(x) | d\_F(X)$. Since $d\_F(x)$ and $d\_K(x)$ divide each other, they only differ by a scalar factor.


**Lemma 2:** Let $f(x)$ and $g(x)$ be polynomials with $g(0) \neq 0$. Then, for all but finitely many $t$, the polynomials $f(tx)$ and $g(x)$ have no common factor.


**Proof:** Let $f(x) = f\_m x^m + \cdots + f\_1 x + f\_0$ and $g(x) = g\_n x^n + \cdots + g\_1 x + g\_0$. If $f(tx)$ and $g(x)$ HAVE a nontrivial common factor, then there are polynomials $p(x)$ and $q(x)$, of degrees $\leq n-1$ and $\leq m-1$, such that 
$$f(tx) p(x)=g(tx) q(x).$$ 
This is $m+n$ linear equations on the $m+n$ coefficients of $p$ and $q$. 
Writing this out in coefficients, the matrix
$$\begin{pmatrix} 
f\_m t^m & \cdots & f\_1 t & f\_0 & 0 & 0 & \cdots & 0 \\
0 & f\_m t^m & \cdots & f\_1 t & f\_0 & 0 & \cdots & 0 \\
\ddots \\
0 & 0 & \cdots & 0 & f\_m t^m & \cdots & f\_1 t & f\_0 \\
g\_n & \cdots & g\_1 & g\_0 & 0 & 0 & \cdots & 0 \\
0 & g\_n & \cdots & g\_1 & g\_0 & 0 & \cdots & 0 \\
\ddots \\
0 & 0 & \cdots & 0 & g\_n & \cdots & g\_1 & g\_0
\end{pmatrix}$$
has nontrivial kernel. The determinant of this matrix is a polynomial in $t$, with leading term $(f\_m)^n (g\_0)^n t^{mn} + \cdots$. (Recall that $g\_0 \neq 0$.) So, for all but finitely many $t$, this matrix has nonzero determinant and $f(tx)$ and $g(x)$ are relatively prime. QED.


Now, we prove the primitive element theorem (for infinite fields). Let $\alpha$ and $\beta$, in $K$, be algebraic and separable over $F$, with minimal polynomials $f$ and $g$. We will show that, for all but finitely many $t$ in $F$, we have $F(\alpha - t \beta) = F(\alpha, \beta)$.


Let $f(x) = (x -\alpha) f'(x -\alpha)$ and $g(x) = (x - \beta) g'(x - \beta)$. Since $\beta$ is separable, we know that $g'(0) \neq 0$. Note that $f'$ and $g'$ have coefficients in $K$. By Lemma 2, for all but infinitely many $t$ in $F$, the polynomials $f'(ty)$ and $g'(y)$ have no common factor. Choose a $t$ for which no common factor exists. Set $F' = F(\alpha - t \beta)$; our goal is to show that $F'=F(\alpha, \beta)$.


Set $h\_t(x) = f(tx + \alpha-t \beta)$. Note that $h\_t(x)$ has coefficients in $F'$. We consider the GCD of $h\_t(x)$ and $g(x)$. 


Working in $K$, we can write $h\_t(x) = t (x - \beta) f'(t (x- \beta))$ and $g(x) = (x-\beta) g'(x-\beta)$. By the choice of $t$, the polynomials $f'(t (x- \beta))$ and $g'(x-\beta)$ have no common factor, so the GCD of $h\_t(x)$ and $g(x)$, in the ring $K[x]$, is $x-\beta$.


By Lemma 1, this shows that $x - \beta$ is in the ring $F'[x]$. In particular, $\beta$ is in $F'$. Clearly, $\alpha$ is then also in $F'$, as $\alpha= (\alpha - t \beta) + t \beta$. We have never written down an element of any field larger than $K$. QED.


