TOPICS
Search

Principal Subresultant Coefficient


A principal subresultant coefficient is the coefficient of x^j in the jth subresultant S_j(f,g) of two univariate polynomials. For f,g in K[x] of degrees m>=n>0 over a field K, write

 s_j(f,g)=[x^j]S_j(f,g),
(1)

where [x^j] denotes coefficient extraction. Using the terminal convention S_n=b_n^(m-n-1)g, where b_n is the leading coefficient of g, gives s_n=b_n^(m-n)!=0. In particular, s_0 is the resultant.

A principal subresultant coefficient can vanish even when the corresponding subresultant is nonzero, since S_j may have degree less than j. For example,

 S_1(x^2+1,x^2+2)=1,
(2)

so s_1=0, although s_0=1.

The initial vanishing coefficients determine the degree of the polynomial greatest common divisor. Its degree is d iff

 s_0=...=s_(d-1)=0 and s_d!=0,
(3)

where 0<=d<=n and the vanishing condition is empty when d=0 (El Kahoui 2003, pp. 290-291). Over Q, for example, the pair

f(x)=x^3-3x+2=(x-1)^2(x+2)
(4)
g(x)=x^2+2x-3=(x-1)(x+3),
(5)

has principal subresultant coefficients {0,4,1} and subresultants {0,4x-4,x^2+2x-3}. Thus d=1 and GCD(f,g)=x-1. Over an algebraic closure of K, common roots are counted with the minimum of their two multiplicities, so a common multiple root can make more than one initial coefficient vanish.

The principal subresultant coefficients are computed in the Wolfram Language using Subresultants[f, g, x].


See also

Polynomial Greatest Common Divisor, Resultant, Subresultant

Explore with Wolfram|Alpha

References

Brown, W. S. and Traub, J. F. "On Euclid's Algorithm and the Theory of Subresultants." J. ACM 18, 505-514, 1971. https://doi.org/10.1145/321662.321665.El Kahoui, M. "An Elementary Approach to Subresultants Theory." J. Symb. Comput. 35, 281-292, 2003. https://doi.org/10.1016/S0747-7171(02)00135-9.

Cite this as:

Weisstein, Eric W. "Principal Subresultant Coefficient." From MathWorld--A Wolfram Resource. https://mathworld.wolfram.com/PrincipalSubresultantCoefficient.html

Subject classifications