Sylvester matrix

Uses your system voice; voice and rate in settings.

Snapshot

≈ 6 min read

Names in other languages

No names in other languages are held for this entry yet.

Article bodies are English and are not machine-translated. A name in another language is not a translation of the article.

In mathematics, a Sylvester matrix is a matrix associated to two univariate polynomials that have coefficients in a commutative ring (such as an integral domain or a field). 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 who first used them in 1853.[1]

Definition

edit edit source

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

p(z)=p0+p1z+p2z2+⋯+pmzm,q(z)=q0+q1z+q2z2+⋯+qnzn.

The Sylvester matrix associated to p and q is then the (n+m)×(n+m) matrix constructed as follows:

  • if n > 0, the first row is:
(pmpm−1⋯p1p00⋯0).
  • 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:
(qnqn−1⋯q1q00⋯0).
  • the following rows are obtained the same way as before.

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

Sp,q=(p4p3p2p1p0000p4p3p2p1p0000p4p3p2p1p0q3q2q1q00000q3q2q1q00000q3q2q1q00000q3q2q1q0).

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, and a determinant (resultant) equal to 1.

A variant

edit edit source

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).[2] This is thus a 2max⁡(n,m)×2max⁡(n,m)-matrix containing max⁡(n,m) pairs of rows. Assuming m>n, it is obtained as follows:

  • the first pair is:
(pmpm−1⋯pn⋯p1p00⋯00⋯0qn⋯q1q00⋯0).
  • the second pair is the first pair, shifted one column to the right; the first elements in the two rows are zero.
  • the remaining max(n,m)−2 pairs of rows are obtained the same way as above.

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

(p4p3p2p1p00000q3q2q1q00000p4p3p2p1p00000q3q2q1q00000p4p3p2p1p00000q3q2q1q00000p4p3p2p1p00000q3q2q1q0).

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 pmm−n (still supposing m≥n).

Applications

edit edit source

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

Sp,qT⋅(xy)=(00)

where x is a vector of size n and y has size m, comprise the coefficient vectors of those and only those pairs x,y of polynomials (of degrees n−1 and m−1, respectively) which fulfill

x(z)⋅p(z)+y(z)⋅q(z)=0,

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 deg⁡x<deg⁡q and deg⁡y<deg⁡p.

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

deg⁡(gcd⁡(p,q))=m+n−rank⁡Sp,q.

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

See also

edit edit source

References

edit edit source
  1. ^ Sylvester, James Joseph (1853-12-31). "XVIII. On a theory of the syzygetic relations of two rational integral functions, comprising an application to the theory of Sturm's functions, and that of the greatest algebraical common measure". Philosophical Transactions of the Royal Society of London (143): 407–548. doi:10.1098/rstl.1853.0018. ISSN 0261-0523. Wikipedia revision 1376497366, retrieved 2026-11-19
  2. ^ Akritas, A.G.; Malaschonok, G.I.; Vigklas, P.S. (2014). "Sturm Sequences and Modified Subresultant Polynomial Remainder Sequences". Serdica Journal of Computing. 8 (1): 29–46. doi:10.55630/sjc.2014.8.29-46. hdl:10525/2428.
Matrix classesExplicitly constrained entries Constant Conditions on eigenvalues or eigenvectors Satisfying conditions on products or inverses With specific applications Used in statistics Used in graph theory Used in science and engineering Related terms

Text derived from https://en.wikipedia.org/w/index.php?oldid=1376497366 under CC BY-SA 4.0; modifications have been made.

Provenance

snapshot enwiki-001376497366 · captured 1790252218.0 · version history

Cite this page as: encyclopegia.org, “Sylvester matrix”, snapshot enwiki-001376497366. https://encyclopegia.org/a/sylvester-matrix