# Sylvester matrix

In mathematics, a **Sylvester matrix** is a matrix associated to two univariate polynomials with coefficients in a field or a commutative ring. The entries of the Sylvester matrix of two polynomials are coefficients of the polynomials. The determinant of the Sylvester matrix of two polynomials is their resultant, which is zero when the two polynomials have a common root (in case of coefficients in a field) or a non-constant common divisor (in case of coefficients in an integral domain).
Sylvester matrices are named after James Joseph Sylvester.

## Definition

Formally, let *p* and *q* be two nonzero polynomials, respectively of degree *m* and *n*. Thus:

- [math]\displaystyle{ p(z)=p_0+p_1 z+p_2 z^2+\cdots+p_m z^m,\;q(z)=q_0+q_1 z+q_2 z^2+\cdots+q_n z^n. }[/math]

The **Sylvester matrix** associated to *p* and *q* is then the [math]\displaystyle{ (n+m)\times(n+m) }[/math] matrix constructed as follows:

- if
*n*> 0, the first row is:

- [math]\displaystyle{ \begin{pmatrix} p_m & p_{m-1} & \cdots & p_1 & p_0 & 0 & \cdots & 0 \end{pmatrix}. }[/math]

- the second row is the first row, shifted one column to the right; the first element of the row is zero.
- the following
*n*− 2 rows are obtained the same way, shifting the coefficients one column to the right each time and setting the other entries in the row to be 0. - if
*m*> 0 the (*n*+ 1)th row is:

- [math]\displaystyle{ \begin{pmatrix} q_n & q_{n-1} & \cdots & q_1 & q_0 & 0 & \cdots & 0 \end{pmatrix}. }[/math]

- the following rows are obtained the same way as before.

Thus, if *m* = 4 and *n* = 3, the matrix is:

- [math]\displaystyle{ S_{p,q}=\begin{pmatrix} p_4 & p_3 & p_2 & p_1 & p_0 & 0 & 0 \\ 0 & p_4 & p_3 & p_2 & p_1 & p_0 & 0 \\ 0 & 0 & p_4 & p_3 & p_2 & p_1 & p_0 \\ q_3 & q_2 & q_1 & q_0 & 0 & 0 & 0 \\ 0 & q_3 & q_2 & q_1 & q_0 & 0 & 0 \\ 0 & 0 & q_3 & q_2 & q_1 & q_0 & 0 \\ 0 & 0 & 0 & q_3 & q_2 & q_1 & q_0 \end{pmatrix}. }[/math]

If one of the degrees is zero (that is, the corresponding polynomial is a nonzero constant polynomial), then there are zero rows consisting of coefficients of the other polynomial, and the Sylvester matrix is a diagonal matrix of dimension the degree of the non-constant polynomial, with the all diagonal coefficients equal to the constant polynomial. If *m* = *n* = 0, then the Sylvester matrix is the empty matrix with zero rows and zero columns.

## A variant

The above defined Sylvester matrix appears in a Sylvester paper of 1840. In a paper of 1853, Sylvester introduced the following matrix, which is, up to a permutation of the rows, the Sylvester matrix of *p* and *q*, which are both considered as having degree max(*m*, *n*).^{[1]}
This is thus a [math]\displaystyle{ 2\max(n, m)\times 2\max(n, m) }[/math]-matrix containing [math]\displaystyle{ \max(n, m) }[/math] pairs of rows. Assuming [math]\displaystyle{ m \gt n, }[/math] it is obtained as follows:

- the first pair is:

- [math]\displaystyle{ \begin{pmatrix} p_m & p_{m-1} &\cdots & p_n & \cdots & p_1 & p_0 & 0 & \cdots & 0 \\ 0 & \cdots & 0 & q_n & \cdots & q_1 & q_0 & 0 & \cdots & 0 \end{pmatrix}. }[/math]

- the second pair is the first pair, shifted one column to the right; the first elements in the two rows are zero.
- the remaining [math]\displaystyle{ max(n, m)-2 }[/math] pairs of rows are obtained the same way as above.

Thus, if *m* = 4 and *n* = 3, the matrix is:

- [math]\displaystyle{ \begin{pmatrix} p_4 & p_3 & p_2 & p_1 & p_0 & 0 & 0 & 0\\ 0 & q_3 & q_2 & q_1 & q_0 & 0 & 0 & 0\\ 0 & p_4 & p_3 & p_2 & p_1 & p_0 & 0 & 0\\ 0 & 0 & q_3 & q_2 & q_1 & q_0 & 0 & 0\\ 0 & 0 & p_4 & p_3 & p_2 & p_1 & p_0 & 0\\ 0 & 0 & 0 & q_3 & q_2 & q_1 & q_0 & 0\\ 0 & 0 & 0 & p_4 & p_3 & p_2 & p_1 & p_0\\ 0 & 0 & 0 & 0 & q_3 & q_2 & q_1 & q_0\\ \end{pmatrix}. }[/math]

The determinant of the 1853 matrix is, up to sign, the product of the determinant of the Sylvester matrix (which is called the resultant of *p* and *q*) by [math]\displaystyle{ p_m^{m-n} }[/math] (still supposing [math]\displaystyle{ m\ge n }[/math]).

## Applications

These matrices are used in commutative algebra, e.g. to test if two polynomials have a (non-constant) common factor. In such a case, the determinant of the associated **Sylvester matrix** (which is called the resultant of the two polynomials) equals zero. The converse is also true.

The solutions of the simultaneous linear equations

- [math]\displaystyle{ {S_{p,q}}^\mathrm{T}\cdot\begin{pmatrix}x\\y\end{pmatrix} = \begin{pmatrix}0\\0\end{pmatrix} }[/math]

where [math]\displaystyle{ x }[/math] is a vector of size [math]\displaystyle{ n }[/math] and [math]\displaystyle{ y }[/math] has size [math]\displaystyle{ m }[/math], comprise the coefficient vectors of those and only those pairs [math]\displaystyle{ x, y }[/math] of polynomials (of degrees [math]\displaystyle{ n-1 }[/math] and [math]\displaystyle{ m-1 }[/math], respectively) which fulfill

- [math]\displaystyle{ x(z) \cdot p(z) + y(z) \cdot q(z) = 0, }[/math]

where polynomial multiplication and addition is used. This means the kernel of the transposed Sylvester matrix gives all solutions of the Bézout equation where [math]\displaystyle{ \deg x \lt \deg q }[/math] and [math]\displaystyle{ \deg y \lt \deg p }[/math].

Consequently the rank of the Sylvester matrix determines the degree of the greatest common divisor of *p* and *q*:

- [math]\displaystyle{ \deg(\gcd(p,q)) = m+n-\operatorname{rank} S_{p,q}. }[/math]

Moreover, the coefficients of this greatest common divisor may be expressed as determinants of submatrices of the Sylvester matrix (see Subresultant).

## See also

## References

- ↑ Akritas, A.G., Malaschonok, G.I., Vigklas, P.S.:
*Sturm Sequences and Modified Subresultant Polynomial Remainder Sequences*. Serdica Journal of Computing, Vol. 8, No 1, 29--46, 2014

Original source: https://en.wikipedia.org/wiki/Sylvester matrix.
Read more |