On Computing the Elimination Ideal Using Resultants with Applications to Gröbner Bases
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 in a polynomial ring with indeterminates , we call first elimination ideal of the intersection . 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 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 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 . 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 in — where is an algebraically closed field — we denote by its associated variety and by the first elimination ideal of , i.e., . We recall two main results on the connection between and .
For , we write in the form
| (1) |
for each . Consider the projection :
| (2) |
Theorem 2.1 (Elimination Theorem, see for example [1, Chapter 3.2, Theorem 2]).
Let be the first elimination ideal of an ideal . Then
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 be the first elimination ideal of an ideal . Then
-
•
is the smallest affine variety containing , i.e., it is the Zariski closure of .
-
•
If , then there is an affine variety such that .
Theorem 2.2 implies that We mention a few notes about the possible dimension of . In general, can range from to . Hereafter we give examples for such cases.
Example 2.3 (Top Dimensional Case).
For an example in which the dimension of is the biggest possible, take , where with . Then and , which means that .
Example 2.4 (Zero Dimensional Case).
If we take , then consists of two lines, the axis and the axis. The projection of these lines along the -axis gives us the -axis, which is a line, hence of dimension . However is a point, namely of dimension .
Also in the following example we see that we can have , independently of the dimension of .
Example 2.5.
Consider the ideal , where . Then independently of what and are, we have , which means that .
Also, not necessarily is true. Note that is not the complement of , but contains the complement. Moreover, the dimensions of 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 be polynomials of degree and respectively. Think of them as elements of and denote by the coefficient of in . Recall that the resultant of and with respect to is defined as
where is the Sylvester matrix, namely
In the following, we consider the connection between the zero set of the resultant of two polynomials and , and the projection of the variety of the ideal . 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.
Proof.
We prove the following three statements:
-
(1)
First, .
It is easy to see from the Laplace expansion of the Sylvester matrix, that the greatest common divisor of and divides . Thus . -
(2)
Secondly, .
If have positive degree in , then (see [1, Chapter 3.6, Proposition 1]). Thus . From the Elimination Theorem , so the claim is proved. -
(3)
Thirdly, .
Let . Then we have two cases:-
•
Suppose and . Then it follows that . Thus
-
•
Suppose that and , or and . Without loss of generality, assume that and . Let and ; then . From [1, Chapter 3.6, Proposition 3] we have that
and since ,
So in both cases if and only if . On the other hand,
Thus and .
-
•
The claim follows immediately from the three statements. ∎
Corollary 2.7.
If and is not identically zero, then
Proof.
By assumption, is a non-zero univariate polynomial. If is constant, the claim is easily proved. Otherwise, vanishes on a finite set of points. By Proposition 2.6, also is a finite set of points. By the Closure Theorem we have that is the Zariski closure of . Since finite sets are Zariski closed, we have that . ∎
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 such that for all . The celebrated Elimination Property of Gröbner bases asserts that if is a Gröbner basis for an ideal with respect to the fixed elimination order, then is a Gröbner basis for the elimination ideal with respect to the same order.
Given two polynomials and , we denote by their S-polynomial, which is defined as follows:
where denotes the leading monomial.
Lemma 3.1.
Let and suppose that and , for some . Denote by the S-polynomial of and and by the S-polynomial of and . Then
Proof.
The result follows from a direct computation. Let , and . Let and . Then
Since , we have that . Therefore and
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 and at each step. Factor the greatest common divisor of and out of and . Then compute the S-polynomial of and 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 and . This approach allows computations with smaller polynomials.
Lemma 3.1 also helps us proving the next proposition.
Proposition 3.3.
Let and . Then
Proof.
- ():
-
Assume that . Since we have .
- ():
-
Assume that . Then either one of is zero (for which the theorem is trivial) or and have a common factor with . Let be the normal form of (after reduction with respect to and ). If , then is a Gröbner basis for the ideal . Since , none of them is in , and by the Elimination Property of Gröbner bases we have . Now assume . Let ,, and be as in Lemma 3.1, and be the reduced form of with respect to and . From Lemma 3.1 and the fact that reducing by and is equivalent to reducing by and , we have that . Therefore in the process of the Gröbner basis computation by Buchberger’s algorithm, all of the new polynomials will have as a factor, and since , all the polynomials in the Gröbner basis will belong to . By the Elimination Property of Gröbner bases we have . ∎
Remark 3.4.
Assume that and write and in the following form
where is the degree of with respect to , is the trailing coefficient, is the leading coefficient of and are the other coefficients, for . If we expand the Sylvester matrix we find the following divisibility relations:
and
From now on we consider two polynomials . As already mentioned, if and denotes the generator of the elimination ideal , then the resultant is a multiple of . In particular, the factors of are factors of . If we are given the resultant and we want to recover , we just need to understand what are the correct multiplicities for the factors of .
Let be a root of , and let and be the multiplicities of the factor corresponding to in and respectively. Clearly . We exhibit some examples of situations that can arise.
- Case :
-
Here, either the linear factor vanishing on appears in with multiplicity , or it does not appear at all. Using the notation of Equation (1), such a factor appears either in or in . Hence, if is squarefree, then .
The following example shows such a situation. Let , . Then and . The value is a root of of multiplicity , but it is not a root of . The of and is , and .
- Case :
-
Here a root of appears with multiplicity greater than .
The factor in is preserved with the same multiplicity as in , but the multiplicity of the factor drops by .
Remark 3.5.
Assume that no two solutions of the system given by and have the same -coordinate. Suppose that the two curves defined by and admit a common tangent at an intersection point which is parallel to the -axis. Then the multiplicity of the factor corresponding to (the projection of) in is strictly smaller than the multiplicity of the factor corresponding to in .
One can notice that in the case above we are in the situation covered by Remark 3.5, since and the circle have a common tangent parallel to the -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 and the generator 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 .
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.