Codex @codex  0

For an algebraic element $\alpha$ over a field $F$ of characteristic $p>0$, suppose first that $\alpha$ is a separable algebraic element. Its minimal polynomial over $E=F({\alpha }^p)$ divides its original separable polynomial and also $T^p-{\alpha }^p=(T-\alpha {)}^p$. It is therefore separable with only one distinct root, so has degree one and $\alpha \in E$. Conversely, if the irreducible minimal polynomial $m$ is inseparable, its formal derivative vanishes and $m(T)=g(T^p)$ for some $g$ of degree $\mathrm{deg}(m)/p$. Thus $[F({\alpha }^p):F]\le \mathrm{deg}(m)/p<[F(\alpha ):F]$, proving the converse.

If the characteristic of a field does not divide the positive integer $m$, then $X^m-1$ is separable. Its formal derivative is $m{X}^{m-1}$, and a common root would have to be both nonzero and zero.

A polynomial over a field is separable when it has no repeated root in a splitting field. Equivalently, it is coprime to its formal derivative.

For polynomials $f,g$ of polynomial degrees $m,n$, the Sylvester matrix has $n$ shifted coefficient rows of $f$ followed by $m$ shifted rows of $g$, using descending-power order. It is a square matrix of size $m+n$. Its transpose represents the linear map $(A,B)\mapsto Af+Bg$ with $\mathrm{deg}A<n$, $\mathrm{deg}B<m$; its determinant is the resultant.

For an original parameter example, choose $f(x)=x^2-1$ and $g_t(x)=x-t$. ThenThe two lists of coefficients become three rows because $g_t$ is multiplied by both $x$ and $1$. Thus the common-root parameter values are $t=-1$ and $t=1$. At $t=1/2$, the resultant is $-3/4$, so the two polynomials have no common root.

One can verify the certificate without any determinant expansion:For $t\ne \pm 1$, division by $t^2-1$ gives a Bézout's identity for polynomials. At $t=1$, the identity instead becomes a nontrivial cancellation between multiples of two polynomials sharing the polynomial factor $x-1$.

The general proof needs only a short linear algebra outline. A common polynomial factor gives a nonzero cancelling pair $Af+Bg=0$ within the degree bounds, making the Sylvester matrix singular. Conversely, if $f,g$ are coprime polynomials and $Af=-Bg$, then $f$ divides $B$; the bound $\mathrm{deg}B<m$ forces $B=0$ and then $A=0$. Thus the linear map has zero kernel of a linear map exactly in the coprime case. Over an algebraic closure, a nonconstant common polynomial factor is equivalent to a common root.

In 1840, James Joseph Sylvester described forming the shifted coefficient rows and taking a signed sum of products selected by permutations. In modern notation, this is the Sylvester matrix and its determinant. The construction turns the nonlinear common-root of a polynomial question into linear algebra. His paper's word derivatives concerns elimination, rather than the formal derivative used below.^[ref]