For polynomials of degrees , the Sylvester matrix has shifted coefficient rows of and shifted rows of , with coefficients in descending-power order. It represents, after transposition, the map for , . Its determinant is the resultant. Its kernel is nonzero exactly when a common polynomial factor exists: divide by that factor to obtain a nonzero cancelling pair; conversely, coprimality and imply , forcing the degree-bounded and then to vanish.
Articles by others on the same topic
A Sylvester matrix, often referred to in the context of control theory and algebra, is a specific type of matrix that is constructed from the coefficients of two or more polynomials. These matrices are particularly useful in the study of polynomial roots, systems of equations, and in numerical methods.