This paper was converted on www.awesomepapers.org from LaTeX by an anonymous user.
Want to know more? Visit the Converter page.

On Computing the Elimination Ideal Using Resultants with Applications to Gröbner Bases

Matteo Gallet (Matteo Gallet) Johann Radon Institute for Computational and Applied Mathematics (RICAM), Austrian Academy of Sciences, Altenberger Straße 69, 4040 Linz, Austria Hamid Rahkooy (Hamid Rahkooy) Research Institute for Symbolic Computation (RISC), Johannes Kepler University, Altenberger Straße 69, 4040 Linz, Austria  and  Zafeirakis Zafeirakopoulos (Zafeirakis Zafeirakopoulos) Mathematics Department, Galatasaray University, Ortaköy 34357, Istanbul, Turkey
Abstract.

Resultants and Gröbner bases are crucial tools in studying polynomial elimination theory. We investigate relations between the variety of the resultant of two polynomials and the variety of the ideal they generate. Then we focus on the bivariate case, in which the elimination ideal is principal. We study — by means of elementary tools — the difference between the multiplicity of the factors of the generator of the elimination ideal and the multiplicity of the factors of the resultant.

1. Introduction

The aim of the work presented in this paper is to study elementary relations between resultants and elimination ideals. Given an ideal II in a polynomial ring with indeterminates x1,,xnx_{1},\dotsc,x_{n}, we call first elimination ideal of II the intersection I𝕂[x2,,xn]I\cap\mathbb{K}[x_{2},\dotsc,x_{n}]. Understanding such ideals is part of the so-called elimination problem, an old and central topic in polynomial algebra.

Historically the motivation for investigating such a problem comes from the polynomial systems solving and the desire to reduce a system in nn variables to another one involving less variables. In this context, many different tools appeared, such as resultants and Gröbner bases.

The problem of defining and investigating the notion of resultant has been considered, among others, by Sylvester, Bezout, Dixon, Macaulay and van der Waerden (see [2]). Gröbner focused on elimination ideals in [4]. A modern view of the theory of resultants was given by Gelfand, Kapranov and Zelevinski in [5]. A survey paper by Emiris and Mourrain [3] discusses determinantal representations of resultants and related computational questions.

In Section 2, we focus on the case of ideals II generated by two polynomials. In this setting, it is natural to consider the resultant of the two polynomials with respect to one of the variables. We recall some well-known results in elimination theory, and provide an affine version of the result linking the variety of the resultant and the projection of the variety of the ideal II. The main result, Corollary 2.7, shows that, if the resultant is not identically zero, the variety of the elimination ideal and the projection of the variety of the ideal coincide.

In Section 3, we examine the relation between the multiplicity of each factor of the resultant of two polynomials, and the multiplicity of the corresponding factor in the generator of the first elimination ideal. In [6] Lazard gave a structure theorem for the minimal lexicographic Gröbner basis of a bivariate ideal generated by any number of polynomials, which reveals some of the factors of the generator of the elimination ideal. We provide examples exhibiting possible behaviour of these two multiplicities.

2. Elimination for two polynomials

In this section we are going to investigate some relations between the zero set of the resultant of two polynomials, the zero set of ideal they generate, and the zero set of the first elimination ideal of the latter. The main result is Corollary 2.7.

For an ideal II in 𝕂[x1,x2,,xn]\mathbb{K}[x_{1},x_{2},\ldots,x_{n}] — where 𝕂\mathbb{K} is an algebraically closed field — we denote by 𝒱(I)\mathcal{V}\left(I\right) its associated variety and by I1I_{1} the first elimination ideal of II, i.e., I1=I𝕂[x2,x3,,xn]I_{1}=I\cap\mathbb{K}[x_{2},x_{3},\dotsc,x_{n}]. We recall two main results on the connection between I1I_{1} and 𝒱(I)\mathcal{V}\left(I\right).

For f1,,fm𝕂[x1,x2,,xn]f_{1},\ldots,f_{m}\in\mathbb{K}[x_{1},x_{2},\ldots,x_{n}], we write fif_{i} in the form

(1) fi=hi(x2,,xn)x1Ni+ terms of x1-degree less than Ni,f_{i}=h_{i}(x_{2},\ldots,x_{n})x_{1}^{N_{i}}+\text{ terms of $x_{1}$-degree less than }N_{i},

for each 1im1\leq i\leq m. Consider the projection π:𝕂n𝕂n1\pi\colon\mathbb{K}^{n}\rightarrow\mathbb{K}^{n-1}:

(2) π((c1,c2,,cn))=(c2,c3,,cn).\pi\bigl{(}(c_{1},c_{2},\ldots,c_{n})\bigr{)}=\left(c_{2},c_{3},\ldots,c_{n}\right).
Theorem 2.1 (Elimination Theorem, see for example [1, Chapter 3.2, Theorem 2]).

Let I1I_{1} be the first elimination ideal of an ideal I𝕂[x1,x2,,xn]I\trianglelefteq\mathbb{K}[x_{1},x_{2},\ldots,x_{n}]. Then

𝒱(I1)=π(𝒱(I))(𝒱(h1,,hm)𝒱(I1)).\mathcal{V}\left(I_{1}\right)=\pi\bigl{(}\mathcal{V}\left(I\right)\bigr{)}\cup\bigl{(}\mathcal{V}\left(h_{1},\ldots,h_{m}\right)\cap\mathcal{V}\left(I_{1}\right)\bigr{)}.

Although the projection of the variety of an ideal and the variety of the elimination ideal are in general not the same, the latter is the Zariski closure of the former.

Theorem 2.2 (Closure Theorem, see for example [1, Chapter 3.2, Theorem 3]).

Let I1I_{1} be the first elimination ideal of an ideal I𝕂[x1,x2,,xn]I\trianglelefteq\mathbb{K}[x_{1},x_{2},\ldots,x_{n}]. Then

  • 𝒱(I1)\mathcal{V}\left(I_{1}\right) is the smallest affine variety containing π(𝒱(I))\pi\bigl{(}\mathcal{V}\left(I\right)\bigr{)}, i.e., it is the Zariski closure of π(𝒱(I))\pi\bigl{(}\mathcal{V}\left(I\right)\bigr{)}.

  • If 𝒱(I)\mathcal{V}\left(I\right)\neq\emptyset, then there is an affine variety W𝒱(I1)W\subsetneq\mathcal{V}\left(I_{1}\right) such that 𝒱(I1)Wπ(𝒱(I))\mathcal{V}\left(I_{1}\right)\setminus W\subseteq\pi\bigl{(}\mathcal{V}\left(I\right)\bigr{)}.

Theorem 2.2 implies that dimπ(𝒱(I))=dim𝒱(I1).dim\,\pi\bigl{(}\mathcal{V}\left(I\right)\bigr{)}=dim\,\mathcal{V}\left(I_{1}\right). We mention a few notes about the possible dimension of 𝒱(h1,,hm)𝕂n1\mathcal{V}\left(h_{1},\dotsc,h_{m}\right)\leavevmode\nobreak\ \subseteq\leavevmode\nobreak\ \mathbb{K}^{n-1}. In general, dim𝒱(h1,,hm)dim\,\mathcal{V}\left(h_{1},\ldots,h_{m}\right) can range from 0 to dim𝒱(I1)dim\,\mathcal{V}\left(I_{1}\right). Hereafter we give examples for such cases.

Example 2.3 (Top Dimensional Case).

For an example in which the dimension of 𝒱(h1,,hm)\mathcal{V}\left(h_{1},\ldots,h_{m}\right) is the biggest possible, take I=x1h,h2𝕂[x1,x2,,xn]I=\left\langle x_{1}h,h^{2}\right\rangle\trianglelefteq\mathbb{K}[x_{1},x_{2},\ldots,x_{n}], where h𝕂[x2,,xn]h\in\mathbb{K}[x_{2},\ldots,x_{n}] with dim𝒱(h)=n2dim\,\mathcal{V}\left(h\right)=n-2. Then I1=h2I_{1}=\left\langle h^{2}\right\rangle and 𝒱(I1)=π(𝒱(I))=𝒱(h2)=𝒱(h)\mathcal{V}\left(I_{1}\right)=\pi\bigl{(}\mathcal{V}\left(I\right)\bigr{)}=\mathcal{V}\left(h^{2}\right)=\mathcal{V}\left(h\right), which means that dim𝒱(h1,h2)=n2dim\,\mathcal{V}\left(h_{1},h_{2}\right)=n-2.

Example 2.4 (Zero Dimensional Case).

If we take I=x1x3,x2𝕂[x1,x2,x3]I=\left\langle x_{1}x_{3},x_{2}\right\rangle\trianglelefteq\mathbb{K}[x_{1},x_{2},x_{3}], then 𝒱(I)\mathcal{V}\left(I\right) consists of two lines, the x1x_{1}-axis and the x3x_{3}-axis. The projection of these lines along the x1x_{1}-axis gives us the x3x_{3}-axis, which is a line, hence of dimension 11. However 𝒱(x3,x2)={(0,0)}\mathcal{V}\left(x_{3},x_{2}\right)=\{(0,0)\} is a point, namely of dimension 0.

Also in the following example we see that we can have 𝒱(I1)=π(𝒱(I))\mathcal{V}\left(I_{1}\right)=\pi\bigl{(}\mathcal{V}\left(I\right)\bigr{)}, independently of the dimension of 𝒱(h1,,hm)\mathcal{V}\left(h_{1},\ldots,h_{m}\right).

Example 2.5.

Consider the ideal I=x1h1,x1h2𝕂[x1,x2,,xn]I=\left\langle x_{1}h_{1},x_{1}h_{2}\right\rangle\trianglelefteq\mathbb{K}[x_{1},x_{2},\ldots,x_{n}], where hi𝕂[x2,,xn]h_{i}\in\mathbb{K}[x_{2},\ldots,x_{n}]. Then independently of what h1h_{1} and h2h_{2} are, we have I1={0}I_{1}=\{0\}, which means that 𝒱(I1)=π(𝒱(I))=𝕂n1\mathcal{V}\left(I_{1}\right)=\pi\bigl{(}\mathcal{V}\left(I\right)\bigr{)}=\mathbb{K}^{n-1}.

Also, not necessarily 𝒱(h1,,hm)𝒱(I1)\mathcal{V}\left(h_{1},\ldots,h_{m}\right)\subseteq\mathcal{V}\left(I_{1}\right) is true. Note that 𝒱(h1,,hm)\mathcal{V}\left(h_{1},\ldots,h_{m}\right) is not the complement of π(𝒱(I))\pi\bigl{(}\mathcal{V}\left(I\right)\bigr{)}, but contains the complement. Moreover, the dimensions of 𝒱(h1,,hm)\mathcal{V}\left(h_{1},\ldots,h_{m}\right) and the complement are independent of each other.

As mentioned above, we will investigate the relation between the first elimination ideal and the resultant. We first introduce some notation concerning resultants. Let f1,f2𝕂[x1,x2,,xn]f_{1},f_{2}\in\mathbb{K}[x_{1},x_{2},\ldots,x_{n}] be polynomials of degree d1d_{1} and d2d_{2} respectively. Think of them as elements of 𝕂[x2,,xn][x1]\mathbb{K}[x_{2},\dotsc,x_{n}][x_{1}] and denote by fi,jf_{i,j} the coefficient of x1jx_{1}^{j} in fif_{i}. Recall that the resultant of f1f_{1} and f2f_{2} with respect to x1x_{1} is defined as

resx1(f1,f2)=det(Syl(f1,f2)),\operatorname{res}_{x_{1}}\left(f_{1},f_{2}\right)=\operatorname{det}\bigl{(}\operatorname{Syl}(f_{1},f_{2})\bigr{)},

where Syl(f1,f2)\operatorname{Syl}(f_{1},f_{2}) is the Sylvester matrix, namely

Syl(f1,f2)=(f1,d1f1,0f1,d1f1,0f2,d2f2,0f2,d2f2,0)}d2}d1\operatorname{Syl}(f_{1},f_{2})=\left(\begin{tabular}[]{ >{$}c<{$} >{$}c<{$} >{$}c<{$} >{$}c<{$} >{$}c<{$} >{$}c<{$} }f_{1,{d_{1}}}&\cdots&\cdots&f_{1,0}&&\\ &\ddots&&&\ddots&\\ &&f_{1,d_{1}}&\cdots&\cdots&f_{1,0}\\ f_{2,{d_{2}}}&\cdots&f_{2,0}&&&\\ &\ddots&&\ddots&&\\ &&\ddots&&\ddots&\\ &&&f_{2,d_{2}}&\cdots&f_{2,0}\\ \end{tabular}\right)\hskip-20.00003pt\begin{tabular}[]{ >{$}c<{$} }\left.\begin{tabular}[]{ c }\phantom{p}\\ \phantom{p}\\ \phantom{p}\\ \end{tabular}\right\}d_{2}\\ \left.\begin{tabular}[]{ c }\phantom{p}\\ \phantom{p}\\ \phantom{p}\\ \phantom{p}\\ \phantom{p}\\ \end{tabular}\right\}d_{1}\\ \end{tabular}

In the following, we consider the connection between the zero set of the resultant of two polynomials f1f_{1} and f2f_{2}, and the projection of the variety of the ideal f1,f2\left\langle f_{1},f_{2}\right\rangle. In this sense, the situation is similar to the one of the Elimination Theorem. The homogeneous version of this result is an easy consequence of the basic properties of the resultant. Hereafter we propose an affine version of it, based upon the ideas of [1, Chapter 3.6, Proposition 3].

Proposition 2.6.

Let I=f1,f2𝕂[x1,x2,,xn]I=\left\langle f_{1},f_{2}\right\rangle\in\mathbb{K}[x_{1},x_{2},\ldots,x_{n}] and =resx1(f1,f2)\mathcal{R}=\operatorname{res}_{x_{1}}\left(f_{1},f_{2}\right). Recall that we denoted by π\pi the projection 𝕂n𝕂n1\mathbb{K}^{n}\longrightarrow\mathbb{K}^{n-1} defined in Equation (2) and let h1h_{1} and h2h_{2} be as introduced in Equation (1). Then

𝒱()=𝒱(h1,h2)π(𝒱(I)).\mathcal{V}\left(\mathcal{R}\right)=\mathcal{V}\left(h_{1},h_{2}\right)\cup\pi\bigl{(}\mathcal{V}\left(I\right)\bigr{)}.
Proof.

We prove the following three statements:

  1. (1)

    First, 𝒱(h1,h2)𝒱()\mathcal{V}\left(h_{1},h_{2}\right)\subseteq\mathcal{V}\left(\mathcal{R}\right).
    It is easy to see from the Laplace expansion of the Sylvester matrix, that the greatest common divisor of h1h_{1} and h2h_{2} divides \mathcal{R}. Thus 𝒱(h1,h2)𝒱()\mathcal{V}\left(h_{1},h_{2}\right)\subseteq\mathcal{V}\left(\mathcal{R}\right).

  2. (2)

    Secondly, π(𝒱(I))𝒱()\pi\bigl{(}\mathcal{V}\left(I\right)\bigr{)}\subseteq\mathcal{V}\left(\mathcal{R}\right).
    If f1,f2𝕂[x2,,xn][x1]f_{1},f_{2}\in\mathbb{K}[x_{2},\ldots,x_{n}][x_{1}] have positive degree in x1x_{1}, then I1\mathcal{R}\in I_{1} (see [1, Chapter 3.6, Proposition 1]). Thus 𝒱(I1)𝒱()\mathcal{V}\left(I_{1}\right)\subseteq\mathcal{V}\left(\mathcal{R}\right). From the Elimination Theorem π(𝒱(I))𝒱(I1)\pi\bigl{(}\mathcal{V}\left(I\right)\bigr{)}\subseteq\mathcal{V}\left(I_{1}\right), so the claim is proved.

  3. (3)

    Thirdly, 𝒱()𝒱(h1,h2)π(𝒱(I))\mathcal{V}\left(\mathcal{R}\right)\setminus\mathcal{V}\left(h_{1},h_{2}\right)\subseteq\pi\bigl{(}\mathcal{V}\left(I\right)\bigr{)}.
    Let c𝒱(h1,h2)c\notin\mathcal{V}\left(h_{1},h_{2}\right). Then we have two cases:

    • Suppose h1(c)0h_{1}(c)\neq 0 and h2(c)0h_{2}(c)\neq 0. Then it follows that (c)=resx1(f1(x1,c),f2(x1,c))\mathcal{R}(c)=\operatorname{res}_{x_{1}}\left(f_{1}(x_{1},c),f_{2}(x_{1},c)\right). Thus

      (c)=0resx1(f1(x1,c),f2(x1,c))=0.\mathcal{R}(c)=0\quad\Leftrightarrow\quad\operatorname{res}_{x_{1}}\left(f_{1}(x_{1},c),f_{2}(x_{1},c)\right)=0.
    • Suppose that h1(c)0h_{1}(c)\neq 0 and h2(c)=0h_{2}(c)=0, or h1(c)=0h_{1}(c)=0 and h2(c)0h_{2}(c)\neq 0. Without loss of generality, assume that h1(c)0h_{1}(c)\neq 0 and h2(c)=0h_{2}(c)=0. Let d2=degx1f2d_{2}=\deg_{x_{1}}f_{2} and m=degf2(x1,c)m=\deg f_{2}(x_{1},c); then m<d2m<d_{2}. From [1, Chapter 3.6, Proposition 3] we have that

      (c)=h1(c)d2mresx1(f1(x1,c),f2(x1,c)),\mathcal{R}(c)=h_{1}(c)^{d_{2}-m}\operatorname{res}_{x_{1}}\left(f_{1}(x_{1},c),f_{2}(x_{1},c)\right),

      and since h1(c)0h_{1}(c)\neq 0,

      (c)=0resx1(f1(x1,c),f2(x1,c))=0.\mathcal{R}(c)=0\quad\Leftrightarrow\quad\operatorname{res}_{x_{1}}\left(f_{1}(x_{1},c),f_{2}(x_{1},c)\right)=0.

    So in both cases (c)=0\mathcal{R}(c)=0 if and only if resx1(f1(x1,c),f2(x1,c))=0\operatorname{res}_{x_{1}}\left(f_{1}(x_{1},c),f_{2}(x_{1},c)\right)=0. On the other hand,

    cπ(𝒱(f1,f2))\displaystyle c\in\pi\bigl{(}\mathcal{V}\left(f_{1},f_{2}\right)\bigr{)} \displaystyle\Leftrightarrow c1𝕂:(c1,c)𝒱(f1,f2)\displaystyle\exists\,c_{1}\in\mathbb{K}:(c_{1},c)\in\mathcal{V}\left(f_{1},f_{2}\right)
    \displaystyle\Leftrightarrow c1𝒱(f1(x1,c),f2(x1,c))\displaystyle\exists\,c_{1}\in\mathcal{V}\left(f_{1}(x_{1},c),f_{2}(x_{1},c)\right)
    \displaystyle\Leftrightarrow resx1(f1(x1,c),f2(x1,c))=0.\displaystyle\operatorname{res}_{x_{1}}\left(f_{1}(x_{1},c),f_{2}(x_{1},c)\right)=0.

    Thus cπ(𝒱(I))c\in\pi\bigl{(}\mathcal{V}\left(I\right)\bigr{)} and 𝒱()𝒱(h1,h2)π(𝒱(I))\mathcal{V}\left(\mathcal{R}\right)\setminus\mathcal{V}\left(h_{1},h_{2}\right)\subseteq\pi\bigl{(}\mathcal{V}\left(I\right)\bigr{)}.

The claim follows immediately from the three statements. ∎

Corollary 2.7.

If f1,f2𝕂[x,y]f_{1},f_{2}\in\mathbb{K}[x,y] and =resx(f1,f2)\mathcal{R}=\operatorname{res}_{x}\left(f_{1},f_{2}\right) is not identically zero, then

𝒱(I1)=π(𝒱(I)).\mathcal{V}\left(I_{1}\right)=\pi\bigl{(}\mathcal{V}\left(I\right)\bigr{)}.
Proof.

By assumption, \mathcal{R} is a non-zero univariate polynomial. If \mathcal{R} is constant, the claim is easily proved. Otherwise, \mathcal{R} vanishes on a finite set of points. By Proposition 2.6, also π(𝒱(I))\pi\bigl{(}\mathcal{V}\left(I\right)\bigr{)} is a finite set of points. By the Closure Theorem we have that 𝒱(I1)\mathcal{V}\left(I_{1}\right) is the Zariski closure of π(𝒱(I))\pi\bigl{(}\mathcal{V}\left(I\right)\bigr{)}. Since finite sets are Zariski closed, we have that 𝒱(I1)=π(𝒱(I))\mathcal{V}\left(I_{1}\right)=\pi\bigl{(}\mathcal{V}\left(I\right)\bigr{)}. ∎

3. Multiplicities

In Section 2 we focused on the relations between the varieties associated to an ideal and its elimination ideal. Here we want to deal with the algebraic side of the question; in particular, we are interested in the relations between the multiplicities of the factors of the resultant of two polynomials and the multiplicities of the factors of the generator of the elimination ideal.

We fix an elimination order on the polynomial ring 𝕂[x1,x2,,xn]\mathbb{K}[x_{1},x_{2},\ldots,x_{n}] such that xix1x_{i}\prec x_{1} for all i{2,,n}i\in\{2,\dotsc,n\}. The celebrated Elimination Property of Gröbner bases asserts that if GG is a Gröbner basis for an ideal II with respect to the fixed elimination order, then G𝕂[x2,x3,,xn]G\cap\mathbb{K}[x_{2},x_{3},\ldots,x_{n}] is a Gröbner basis for the elimination ideal I1I_{1} with respect to the same order.

Given two polynomials f1f_{1} and f2f_{2}, we denote by S12S_{12} their S-polynomial, which is defined as follows:

S12:=lcm(lm(f1),lm(f2))lm(f1)f1lcm(lm(f1),lm(f2))lm(f2)f2,S_{12}:=\frac{\operatorname{lcm}\bigl{(}\operatorname{lm}\left(f_{1}\right),\operatorname{lm}\left(f_{2}\right)\bigr{)}}{\operatorname{lm}\left(f_{1}\right)}f_{1}-\frac{\operatorname{lcm}\bigl{(}\operatorname{lm}\left(f_{1}\right),\operatorname{lm}\left(f_{2}\right)\bigr{)}}{\operatorname{lm}\left(f_{2}\right)}f_{2},

where lm\operatorname{lm} denotes the leading monomial.

Lemma 3.1.

Let f1,f2𝕂[x1,x2,,xn]f_{1},f_{2}\in\mathbb{K}[x_{1},x_{2},\ldots,x_{n}] and suppose that f1=hf1f_{1}=h{f_{1}}^{\prime} and f2=hf2f_{2}=h{f_{2}}^{\prime}, for some h,f1,f2h,f_{1}^{\prime},f_{2}^{\prime}. Denote by S12S_{12} the S-polynomial of f1f_{1} and f2f_{2} and by S12S_{12}^{\prime} the S-polynomial of f1f_{1}^{\prime} and f2f_{2}^{\prime}. Then

S12=hS12.S_{12}=hS_{12}^{\prime}.
Proof.

The result follows from a direct computation. Let i=lm(fi)\ell_{i}=\operatorname{lm}(f_{i}), i=lm(fi)\ell_{i}^{\prime}=\operatorname{lm}(f_{i}^{\prime}) and h=lm(h)\ell_{h}=\operatorname{lm}(h). Let =lcm(1,2)\ell=\operatorname{lcm}(\ell_{1},\ell_{2}) and =lcm(1,2)\ell^{\prime}=\operatorname{lcm}(\ell_{1}^{\prime},\ell_{2}^{\prime}). Then

S12\displaystyle S_{12} =1f12f2\displaystyle=\frac{\ell}{\ell_{1}}f_{1}-\frac{\ell}{\ell_{2}}f_{2}
=1hf12hf2=h(1f12f2).\displaystyle=\frac{\ell}{\ell_{1}}hf_{1}^{\prime}-\frac{\ell}{\ell_{2}}hf_{2}^{\prime}\;=\;h(\frac{\ell}{\ell_{1}}f_{1}^{\prime}-\frac{\ell}{\ell_{2}}f_{2}^{\prime}).

Since lcm(1,2)=hlcm(1,2)\operatorname{lcm}(\ell_{1},\ell_{2})=\ell_{h}\operatorname{lcm}(\ell_{1}^{\prime},\ell_{2}^{\prime}), we have that =h\ell=\ell^{\prime}\ell_{h}. Therefore 1=1\frac{\ell}{\ell_{1}}=\frac{\ell^{\prime}}{{\ell_{1}}^{\prime}} and

h(1f12f2)=h(1f12f2)=hS12.h\left(\frac{\ell}{\ell_{1}}f_{1}^{\prime}-\frac{\ell}{\ell_{2}}f_{2}^{\prime}\right)\;=\;h\left(\frac{\ell^{\prime}}{{\ell_{1}}^{\prime}}f_{1}^{\prime}-\frac{\ell^{\prime}}{{\ell_{2}}^{\prime}}f_{2}^{\prime}\right)\;=\;hS_{12}^{\prime}.\qed
Remark 3.2.

One could use Lemma 3.1 in Gröbner bases computations. Start by computing the greatest common divisor of each pair of generators fif_{i} and fjf_{j} at each step. Factor the greatest common divisor of fif_{i} and fjf_{j} out of fif_{i} and fjf_{j}. Then compute the S-polynomial of fif_{i} and fjf_{j} and reduce it with respect to the other polynomials in the basis. Finally, multiply the result of the reduction by the greatest common divisor of fif_{i} and fjf_{j}. This approach allows computations with smaller polynomials.

Lemma 3.1 also helps us proving the next proposition.

Proposition 3.3.

Let I=f1,f2𝕂[x1,x2,,xn]I=\left\langle f_{1},f_{2}\right\rangle\trianglelefteq\mathbb{K}[x_{1},x_{2},\ldots,x_{n}] and =resx1(f1,f2)\mathcal{R}=\operatorname{res}_{x_{1}}\left(f_{1},f_{2}\right). Then

0I1=0.\mathcal{R}\equiv 0\quad\Leftrightarrow\quad I_{1}=\left\langle 0\right\rangle.
Proof.
(\Leftarrow):

Assume that I1=0I_{1}=\left\langle 0\right\rangle. Since I1\mathcal{R}\in I_{1} we have 0\mathcal{R}\equiv 0.

(\Rightarrow):

Assume that 0\mathcal{R}\equiv 0. Then either one of fif_{i} is zero (for which the theorem is trivial) or f1f_{1} and f2f_{2} have a common factor hh with degx1(h)>0\deg_{x_{1}}\left(h\right)>0. Let SS be the normal form of S12S_{12} (after reduction with respect to f1f_{1} and f2f_{2}). If S=0S=0, then {f1,f2}\{f_{1},f_{2}\} is a Gröbner basis for the ideal II. Since f1,f2𝕂[x1,x2,,xn]𝕂[x2,x3,,xn]f_{1},f_{2}\in\mathbb{K}[x_{1},x_{2},\ldots,x_{n}]\setminus\mathbb{K}[x_{2},x_{3},\ldots,x_{n}], none of them is in I1I_{1}, and by the Elimination Property of Gröbner bases we have I1=0I_{1}=\left\langle 0\right\rangle. Now assume S0S\neq 0. Let S12S_{12}^{\prime},f1f_{1}^{\prime},f2f_{2}^{\prime} and hh be as in Lemma 3.1, and SS^{\prime} be the reduced form of S12S_{12}^{\prime} with respect to f1f_{1}^{\prime} and f2f_{2}^{\prime}. From Lemma 3.1 and the fact that reducing S12S_{12} by f1f_{1} and f2f_{2} is equivalent to reducing S12S_{12}^{\prime} by f1f_{1}^{\prime} and f2f_{2}^{\prime}, we have that S=hSS=hS^{\prime}. Therefore in the process of the Gröbner basis computation by Buchberger’s algorithm, all of the new polynomials will have hh as a factor, and since h𝕂[x1,x2,,xn]𝕂[x2,x3,,xn]h\in\mathbb{K}[x_{1},x_{2},\ldots,x_{n}]\setminus\mathbb{K}[x_{2},x_{3},\ldots,x_{n}], all the polynomials in the Gröbner basis will belong to 𝕂[x1,x2,,xn]𝕂[x2,x3,,xn]\mathbb{K}[x_{1},x_{2},\ldots,x_{n}]\setminus\mathbb{K}[x_{2},x_{3},\ldots,x_{n}]. By the Elimination Property of Gröbner bases we have I1=0I_{1}=\left\langle 0\right\rangle. ∎

Remark 3.4.

Assume that I=f1,f2𝕂[x,y]I=\left\langle f_{1},f_{2}\right\rangle\trianglelefteq\mathbb{K}[x,y] and write f1f_{1} and f2f_{2} in the following form

fi=ti+hixdi+j=1di1hijxj,f_{i}=t_{i}+h_{i}x^{d_{i}}+\sum_{j=1}^{d_{i}-1}h_{i_{j}}x^{j},

where did_{i} is the degree of fif_{i} with respect to xx, ti𝕂[y]t_{i}\in\mathbb{K}[y] is the trailing coefficient, hi𝕂[y]h_{i}\in\mathbb{K}[y] is the leading coefficient of fif_{i} and hij𝕂[y]h_{i_{j}}\in\mathbb{K}[y] are the other coefficients, for i=1,2i=1,2. If we expand the Sylvester matrix we find the following divisibility relations:

gcd(h1,h2)|,gcd(t1,t2)|,\operatorname{gcd}\left(h_{1},h_{2}\right)\,|\,\mathcal{R},\quad\operatorname{gcd}\left(t_{1},t_{2}\right)\,|\,\mathcal{R},

and

gcd(hi,ti,hi1,,hi(dk1))|,fori=1,2.\operatorname{gcd}\left(h_{i},t_{i},h_{i_{1}},\ldots,h_{i_{\left(d_{k}-1\right)}}\right)\,|\,\mathcal{R},\qquad\mathrm{for\ }i=1,2.

From now on we consider two polynomials f1,f2𝕂[x,y]f_{1},f_{2}\in\mathbb{K}[x,y]. As already mentioned, if I=f1,f2I=\left\langle f_{1},f_{2}\right\rangle and gg denotes the generator of the elimination ideal I1=I𝕂[y]I_{1}=I\cap\mathbb{K}[y], then the resultant =resx(f1,f2)\mathcal{R}=\operatorname{res}_{x}\left(f_{1},f_{2}\right) is a multiple of gg. In particular, the factors of gg are factors of \mathcal{R}. If we are given the resultant \mathcal{R} and we want to recover gg, we just need to understand what are the correct multiplicities for the factors of gg.

Let c𝕂c\in\mathbb{K} be a root of gg, and let μ\mu and ν\nu be the multiplicities of the factor corresponding to cc in gg and \mathcal{R} respectively. Clearly μν\mu\leq\nu. We exhibit some examples of situations that can arise.

Case ν=1\nu=1:

Here, either the linear factor vanishing on cc appears in gg with multiplicity 11, or it does not appear at all. Using the notation of Equation (1), such a factor appears either in gg or in gcd(h1,h2)\operatorname{gcd}\left(h_{1},h_{2}\right). Hence, if \mathcal{R} is squarefree, then g=gcd(h1,h2)g=\frac{\mathcal{R}}{\operatorname{gcd}\left(h_{1},h_{2}\right)}.

The following example shows such a situation. Let f1=xy1f_{1}=xy-1, f2=x2y+y24f_{2}=x^{2}y+y^{2}-4. Then =y(y34y+1)\mathcal{R}=y(y^{3}-4y+1) and I1=y34y+1I_{1}=\left\langle y^{3}-4y+1\right\rangle. The value 0 is a root of \mathcal{R} of multiplicity 11, but it is not a root of gg. The gcd\gcd of h1h_{1} and h2h_{2} is yy, and g=gcd(h1,h2)g=\frac{\mathcal{R}}{\operatorname{gcd}\left(h_{1},h_{2}\right)}.

[Uncaptioned image] f1\displaystyle f_{1} =\displaystyle= xy1\displaystyle xy-1 f2\displaystyle f_{2} =\displaystyle= x2y+y24\displaystyle x^{2}y+y^{2}-4 h1\displaystyle h_{1} =\displaystyle= y\displaystyle y h2\displaystyle h_{2} =\displaystyle= y\displaystyle y g\displaystyle g =\displaystyle= y34y+1\displaystyle y^{3}-4y+1 \displaystyle\mathcal{R} =\displaystyle= y(y34y+1)\displaystyle y(y^{3}-4y+1)
Case ν>1\nu>1:

Here a root of \mathcal{R} appears with multiplicity greater than 11. [Uncaptioned image] f1\displaystyle f_{1} =\displaystyle= (y+1)(xy1)\displaystyle-(y+1)(x-y-1) f2\displaystyle f_{2} =\displaystyle= x2+y21\displaystyle x^{2}+y^{2}-1 h1\displaystyle h_{1} =\displaystyle= (y+1)\displaystyle-(y+1) h2\displaystyle h_{2} =\displaystyle= 1\displaystyle 1 g\displaystyle g =\displaystyle= y(y+1)2\displaystyle y(y+1)^{2} \displaystyle\mathcal{R} =\displaystyle= 2y(y+1)3\displaystyle 2y(y+1)^{3}

The factor yy in gg is preserved with the same multiplicity as in \mathcal{R}, but the multiplicity of the factor (y+1)(y+1) drops by 11.

Remark 3.5.

Assume that no two solutions of the system given by f1f_{1} and f2f_{2} have the same yy-coordinate. Suppose that the two curves defined by f1f_{1} and f2f_{2} admit a common tangent at an intersection point PP which is parallel to the xx-axis. Then the multiplicity of the factor corresponding to (the projection of) PP in gg is strictly smaller than the multiplicity of the factor corresponding to PP in RR.

One can notice that in the case ν>1\nu>1 above we are in the situation covered by Remark 3.5, since (y+1)(y+1) and the circle have a common tangent parallel to the xx-axis at their intersection.

The multiplicity structure of isolated points can be studied by means of the dual space of the vanishing ideal of those points. In [7], the problem of understanding the differences between the multiplicities of the factors of the resultant \mathcal{R} and the generator gg of the elimination ideal has been addressed via dual spaces; there, the concept of directional multiplicity has been introduced to explain the exponents of the factors in g{g}.

Acknowledgments

The authors would like to express their gratitude to Professors B. Buchberger, H. Hong, M. Kauers, and Dr. E. Tsigaridas.

The authors were supported by the strategic program "Innovatives OÖ 2010 plus" of the Upper Austrian Government and by the Austrian Science Fund (FWF) grant W1214-N15, projects DK1, DK6 and DK9. Part of the research of the second author was carried out during a stay at the mathematics department of UC Berkeley supported by a Marshall Plan Scholarship. The third author was partially supported by Austrian Science Fund grant P22748-N18.

References

  • [1] D. Cox, J. Little, and D. O’Shea. Ideals, Varieties, and Algorithms : An Introduction to Computational Algebraic Geometry and Commutative Algebra. Springer, 7 2005.
  • [2] D. Cox, J. Little, and D. O’Shea. Using Algebraic Geometry. Springer, 2nd edition, 2005.
  • [3] I. Emiris and B. Mourrain. Matrices in elimination theory. Journal of Symbolic Computation, 28(1-2):3–44, 1999.
  • [4] W. Gröbner. Über die Eliminationtheorie. Monatschafte für Mathematik, 5:71–78, 1950.
  • [5] M. M. Kapranov I. M. Gelfand and A. V. Zelevinski. Discriminants, resultants, and Multidimensional Determinants. Birkhäuser, 1994.
  • [6] D. Lazard. Ideal bases and primary decomposition: Case of two variables. Journal of Symbolic Computation, 1(3):261 – 270, 1985.
  • [7] A. Mantzaflaris, H. Rahkooy, and Z. Zafeirakopoulos. Efficient Computation of Dual Space and Directional Multiplicity of an Isolated Point. Technical Report 15-08, RISC, Hagenberg, Austria, 2015.