I'm trying to find a general proof to an exercise given in Garrity et al's book, Algebraic Geometry: A problem-solving approach.
The problem is this: Given two polynomials f and g, show that for each pair of roots, f(r) = 0, g(s) = 0, that (r - s) divides the resultant.
There is a book of selected answers, but somewhat disappointingly, the solution is given as a brutal appeal to algebra. Moreover, the result is only given for quadratic polynomials.
It seems cited in a few places that the resultant, defined as the determinant of the Sylvester matrix of two polynomials f=λ1∏(x−ri) and g=λ2∏(x−si), is equal to the product ∏ri−si. But so far, I have been unable to find a general proof of this fact.
Would anyone either mind sketching the proof, or else pointing me to a resource which does?
Answer
The following is really only a sketch. Feel free to ask for more details.
The coefficients of a polynomial f are equal to elementary symmetric polynomials in the roots of f. Since the resultant is a polynomial function in the coefficients of two polynomials f and g, it is a symmetric polynomial function in the roots of f and g. The definition of the resultant is made in such a way that res(f,g)=0 if (and only if) f and g share a common root. Now, we use the following:
Lemma. Let R be an integral domain and denote by K the algebraic closure of its quotient field. Let p∈R[X,Y] a polynomial such that p(a,a)=0 for all a∈K. Then, (Y−X) divides p.
Proof. Write p∈R[X][Y] as a polynomial in Y, i.e. p=∑ni=0piYi with certain pi∈R[X]. In this integral domain, perform division with remainder of p by Y−X to obtain p=q(Y−X)+r for q∈R[Y,X] and r∈R[X]⊆R[X,Y]. Since
r(a)=r(a,a)=p(a,a)=0 for all a∈K, we must have r=0. Indeed, K is an infinite field because it is algebraically closed and any nonzero polynomial has only finitely many roots. Consequently, p=(X−Y)⋅q as required.
Applying this lemma to the resultant as a polynomial in the zeros of f and g, you get the desired statement.
No comments:
Post a Comment