Docsity
Docsity

Prepare for your exams
Prepare for your exams

Study with the several resources on Docsity


Earn points to download
Earn points to download

Earn points by helping other students or get them with a premium plan


Guidelines and tips
Guidelines and tips

VIGRE Senior Seminar: Understanding Resultants of Polynomials through Khetan's Theorem - P, Study notes of Mathematics

The concept of resultants of polynomials and how they can be expressed as determinants of certain matrices. The document focuses on the case where the polynomials have the same degree and provides an example using two polynomials. It also mentions the work of sylvester and b´ezout in this area and the more recent contributions of amit khetan for the cases where the polynomials do not have the same degree. The seminar mentioned in the document aims to explore the mathematics behind khetan's theorem, covering topics such as spectral sequences, the koszul complex, the tate resolution, and beilinson resolution and spectral sequence.

Typology: Study notes

Pre 2010

Uploaded on 08/18/2009

koofers-user-d5m
koofers-user-d5m 🇺🇸

10 documents

1 / 1

Related documents


Partial preview of the text

Download VIGRE Senior Seminar: Understanding Resultants of Polynomials through Khetan's Theorem - P and more Study notes Mathematics in PDF only on Docsity! Math 499/699: VIGRE Senior Seminar Let f1, . . . , fn+1 be n + 1 polynomials in n variables. The resultant is a polynomial in the coefficients of the fi which vanishes whenever the fi have a common zero. The problem of finding explicit formulas for resultants is classical. Sylvester and Bézout developed determinantal formulas, i.e. formulas that express the resultant as the determinant of some matrix, for n = 1, 2, 3 when the n + 1 polynomials all have the same degree. For example, let n = 1 and consider p(x) = a0x2 + a1x + a2 = 0 and q(x) = b0x3 + b1x2 + b2x + b3 = 0. In matrix form we have: ( 0 a0 a1 a2 b0 b1 b2 b3 )  x3 x2 x 1  =  0 0 0 0  Since square matrices have some very nice properties, we translate this into an equivalent system involving a square matrix. With respect to common zeroes, it will not matter if equations like xip(x) = 0 and xjq(x) = 0 are added to the system. So, in this particular case, we can add xp(x) = 0, x2p(x) = 0 and xq(x) = 0 which gives the following matrix equation: 0 0 a0 a1 a2 0 a0 a1 a2 0 a0 a1 a2 0 0 0 b0 b1 b2 b3 b0 b1 b2 b3 0   x4 x3 x2 x 1  =  0 0 0 0 0  Such a square matrix equation has nontrivial solutions only when the determinant of the matrix is zero. This system has a solution if p(x) and q(x) have a common solution. Consequently, the determinant will vanish whenever p(x) and q(x) have a common solution. When the n + 1 polynomials do not have the same degree, the situation was less understood classically. Note that the procedure given above for n = 1 doesn’t care about the degrees of the two polynomials; however, the results of Sylvester and Bézout do not extend to n = 2, 3. Just recently, Amit Khetan has given formulas for the n = 2, 3 cases. For n = 2 Khetan’s theorem is that the resultant of a system f1, f2, f3 ∈ C[x1, x2, x3, x−11 , x −1 2 ] with common Newton polygon Q is the determinant of the block matrix:( B L L̃ 0 ) where L and L̃ are linear terms and the entries of B are cubic forms in the coefficients of the polynomials. In this seminar, we will develop the mathematics behind Khetan’s result. In particular, we will cover spectral sequences, the Koszul complex, the Tate resolution, Beilinson resolution and spectral sequence, etc. 1
Docsity logo



Copyright © 2024 Ladybird Srl - Via Leonardo da Vinci 16, 10126, Torino, Italy - VAT 10816460017 - All rights reserved