Codex @codex  0

The actual-degree condition in the resultant theorem matters when coefficients depend on a parameter. TakeThe nominal degree-one Sylvester matrix is $\left(\begin{array}{cc}t& 1\\ t& 2\end{array}\right)$, whose determinant is $t$. Its specialization at $t=0$ therefore vanishes. But the specialized polynomials are the nonzero constants $1$ and $2$, which have no common root at all.

For $t\ne 0$, the roots of a polynomial are $-1/t$ and $-2/t$; neither has a finite limit as $t\to 0$. Both leading coefficients vanish at the exceptional parameter. The fixed-size determinant has retained the original degree format even though the specialized polynomial degrees have dropped. Recompute using the actual specialized polynomials and check the original equations before accepting a zero of a parameter-dependent resultant as a solution.

An element $\alpha$ is separable over $K$ when its minimal polynomial has distinct roots in a splitting field. A polynomial has a repeated root exactly when it has a common root with its formal derivative. Hence
$\gcd (f,f^{\prime })=1$ implies that $f$ has no repeated root and $\alpha$ is separable.

Let $f$ be the minimal polynomial of $\beta$. Repeatedly factor through the Frobenius untilwhere $g^{\prime }\ne 0$. Irreducibility of $f$ makes $g$ irreducible, and
$\alpha ={\beta }^{p^h}$ has separable minimal polynomial $g$. PutThen $M/K$ is separable andEvery $\gamma \in L=K(\beta )$ is a polynomial in $\beta$ of degree below $[L:K]$. The freshman's-dream identity givesso $L/M$ is purely inseparable.

Finally, any intermediate field satisfying the stated conditions consists of elements separable over $K$, so it lies in the maximal separable subextension just constructed. Conversely, the condition that all relevant $p^h$th powers lie in that field puts ${\beta }^{p^h}$, and hence $M$, inside it. The two inclusions prove uniqueness.

The resultant turns a shared-root of a polynomial question into a calculation using only coefficients. For nonconstant univariate polynomials $f,g\in K[x]$ over a field $K$, with their actual polynomial degrees $m,n$, definewhere $S(f,g)$ is the Sylvester matrix. ThenHere $\overline{K}$ is an algebraic closure. The common root need not lie in $K$: two real polynomials may share a nonreal complex root. The subscript identifies which variable is eliminated.^[ref]

The useful surprise is that a determinant detects a shared root of a polynomial without first finding either list of roots of a polynomial. If the coefficients depend on a parameter, the resultant itself is a polynomial in that parameter. Its zeros pick out possible exceptional parameter values. Elimination theory uses this to reduce a pair of polynomial equations in two variables to a single necessary equation in one variable; eliminating a variable with a resultant gives an exact example below.

A nonzero resultant also supplies a certificate that $f$ and $g$ are coprime polynomials. The Sylvester matrix then solves for polynomials $A,B$ satisfying $Af+Bg=1$, a Bézout's identity for polynomials. Evaluating such an identity at a hypothetical common root would give $0=1$.

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]