Computing final polynomials and final syzygies using Buchberger's Gröbner bases method (Q2639107)

From MaRDI portal
scientific article
Language Label Description Also known as
English
Computing final polynomials and final syzygies using Buchberger's Gröbner bases method
scientific article

    Statements

    Computing final polynomials and final syzygies using Buchberger's Gröbner bases method (English)
    0 references
    0 references
    0 references
    1989
    0 references
    The author uses Gröbner basis algorithm to obtain certain algebraic relations between a finite family of polynomials. More precisely, let \({\mathcal F}=\{f_ 1(X),...,f_ m(X)\}\subset K[X]\), where \(X=(X_ 1,...,X_ n)\) is a vector of variables. Then the author deals with two situations: (a) A final polynomial for \({\mathcal F}\) is a polynomial P(X,Y)\(\in K[X,Y]\), \(Y=(Y_ 1,...,Y_ m)\), such that \(P(X,f_ 1(X),...,f_ m(X))=0\) and \(P(X,0,...,0)=1\). Notice that if \(K={\mathbb{C}}\), then a final polynomial for \({\mathcal F}\) exists if and only if the zero set of \({\mathcal F}\) is empty, or equivalently 0 is not in the image of the map \({\mathcal F}:{\mathbb{C}}^ n\to {\mathbb{C}}^ n:\;x\mapsto (f_ 1(x),...,f_ m(x)).\) In this case a final polynomial gives an explicit representation of 1 as an algebraic combination of \(f_ 1(X),...,f_ m(X).\) (b) A syzygy for \({\mathcal F}\) is a polynomial Q(Y)\(\in K[Y]\) such that \(Q(f_ 1(X),...,f_ m(X))=0\). A syzygy is called final if it is also a final polynomial. Then, for \(K={\mathbb{C}}\) the author remarks that a final syzygy for \({\mathcal F}\) exists if and only if 0 is not in the Zariski closure of the image of the map \({\mathcal F}.\) The method proposed to produce final polynomials and syzygies for \({\mathcal F}\) is the following: consider \(\hat {\mathcal F}=\{\hat f_ 1(X,Y),...,\hat f_ m(X,Y)\}\), where \(\hat f_ i(X,Y)=f_ i(X)-Y_ i\). Let \(\hat {\mathcal G}\) be a Gröbner basis for \(\hat {\mathcal F}\) with respect to the purely lexicographic ordering induced by \(Y_ 1<...<Y_ m<X_ 1<...<X_ n\). Then a final polynomial for \({\mathcal F}\) (resp. syzygy) exists if and only if \(\hat {\mathcal G}\) contains a final polynomial (resp. syzygy). The author works out some examples and application of this method to different situations. In particular he shows that the Sylvester-Gallai- theorem (among any n points in the real euclidean plane, not all in a line, there exist two points such that no other point is collinear with them) fails in the complex plane.
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    Gröbner basis algorithm
    0 references
    final polynomial
    0 references
    syzygy
    0 references
    Sylvester-Gallai- theorem
    0 references