Resultant as a product over roots ($\mathrm{Res}(f,g)=a_m^n{\prod }_{i=1}^{m}g({\alpha }_i)$)

Write $f(x)=a_m{\prod }_{i=1}^m(x-{\alpha }_i)$ and $g(x)=b_n{\prod }_{j=1}^n(x-{\beta }_j)$ in an algebraic closure, counting multiplicity of a root. The coefficient-row convention above givesThis makes the shared-root of a polynomial test transparent: a factor vanishes precisely when one ${\alpha }_i$ equals one ${\beta }_j$. Swapping the two polynomials reverses the sign of all $mn$ differences, giving $\mathrm{Res}(g,f)=(-1{)}^{mn}\mathrm{Res}(f,g)$.^[ref]

The value measures an algebraic product, not a normalized geometric distance. Replacing $f$ by $cf$ for nonzero $c\in K$ leaves its roots of a polynomial unchanged but multiplies the resultant by $c^n$. Therefore a small numerical resultant alone does not quantify how close two sets of roots of a polynomial are. Exact zero testing and numerical sensitivity are different questions.

A multiple root of a polynomial is also a root of a polynomial of its formal derivative. In characteristic zero, for $\mathrm{deg}f=m\ge 2$, the associated discriminant isFor example, $h(x)=x^2+s$ gives $\mathrm{Res}(h,2x)=4s$ and $\mathrm{Disc}(h)=-4s$. The two roots of a polynomial merge precisely at $s=0$.^[ref]