In this section I shall formulate some of the basic questions and problems arising in algebraic geometry and provide ingredients for certain algorithms. I shall restrict myself to those algorithms where I am somehow familiar with their implementations and which have turned out to be useful in practical applications.
Let me first recall the most basic but also most important applications of Gröbner bases to algebraic constructions (called ``Gröbner basics'' by Sturmfels). Since these can be found in more or less any textbook dealing with Gröbner bases, I just mention them:
1) The hypersurface V(x2+y3-t2y2)
2) The variety V(xz, yz)
3) The space curve V(xz, xy, yz)
4) The set of points V(y4-y2, xy3-xy, x3y-xy, x4-x2)
The next questions and problems lead to algorithms which are slightly more (some of them much more) involved. They are, nevertheless, still very basic and quite natural. I should like to illustrate them by means of four simple examples, shown in the pictures of this section, referred to as Example 1) - 4):
Assume we are given an ideal by a set of generators . Consider the following questions and problems:
Example 1) is irreducible, Example 2) has two components (one of dimension 2 and one of dimension 1), Example 3) has three (one-dimensional) and Example 4) has nine (zero-dimensional) components.
In Examples 1) - 3) is radical while in Example 4) , which is much simpler than . In this example the central point corresponds to which is a fat point, that is, it is a solution of of multiplicity ( ) bigger than 1 (equal to 3). All other points have multiplicity 1, hence the total number of solutions (counted with multiplicity) is 11. This is a typical example of the kind Buchberger (resp. Gröbner) had in mind at the time of writing his thesis.
These relations form a submodule of , which is called the syzygy module of and is denoted by syz. It is the kernel of the -linear map
A direct geometric interpretation of syzygies is not so clear, but there are instances where properties of syzygies have important geometric consequences cf. Sch3.
In Example 1) we have syz, in Example 2), syz, in Example 3), syz and in Example 4), syz is generated by .
Geometrically, is the smallest variety containing which is the (Zariski) closure of .
In Example 2) we have and in Example 3) , which gives, in both cases, equations for the complement of the -axis . In Example 4) we get which is the zero set of the eight points with centre removed.
Projecting the varieties of Examples 1) - 3) to the -plane is, in the first two cases, surjective and in the third case it gives the two coordinate axes in the -plane. This corresponds to the fact that the intersection with of the first two ideals is 0, while the third one is .
Projecting the 9 points of Example 4) to the -axis we get, by eliminating , the polynomial , describing the three image points. From a set theoretical point of view this is nice, however it is not satisfactory if we wish to count multiplicities. For example, the two border points are the image of three points each, hence should appear with multiplicity three. That this is not the case can be explained by the fact that elimination computes the annihilator ideal of considered as -module (and not the Fitting ideal). This is related to the well-known fact that elimination is not compatible with base change.
For singular complex varieties this is not true in general, but those for which the two removable theorems hold are called normal. Moreover, each reduced variety has a normalisation and there is a morphism with finite fibres from the normalisation to the variety, which is an isomorphism outside the singular locus.
The problem is, given a variety , find a normal variety and a polynomial map inducing the normalisation map .
The problem can be reduced to irreducible varieties (but need not be, as we shall see) and then the equivalent algebraic problem is to find the normalisation of , that is the integral closure of in the quotient field of and present this ring as an affine ring for some and .
For Examples 1) - 4) it can be shown that the normalisation of the first three varieties is smooth, the last two are the disjoint union of the (smooth) components. The corresponding rings are . The fourth example has no normalisation as it is not reduced.
A related problem is to find, for a non-normal variety , an ideal such that is the non-normal locus of . The normalisation algorithm described below solves also this problem.
In the examples, the non-normal locus is equal to the singular locus.
A singularity of a variety is a point which has no neighbourhood in which the Jacobian matrix of the generators has constant rank.
In Example 1) the whole -axis is singular, in the three other examples only the origin.
One task is to compute generators for the ideal of the singular locus, which is itself a variety. This is just done by computing sub-determinants of the Jacobian matrix, if there are no components of different dimensions. In general, however, we need, additionally, to compute either the equidimensional part and ideal quotients or a primary decomposition.
In Examples 1) - 4), the singular locus is given by , respectively.
Now all the problems we considered above can be formulated for ideals in and modules over instead of .
The geometric problems should be interpreted as properties of the variety in a neighbourhood of the origin, or more generally, the given point.
It should not be surprising that all the above problems have algorithmic and computational solutions, which use, at some place, Gröbner basis methods. Moreover, algorithms for most of these have been implemented quite efficiently in several computer algebra systems, such as CoCoA, cf. CNR, Macaulay2, cf. GS and SINGULAR, cf. GPS, the latter also being able to handle, in addition, local questions systematically.
The most complicated problem is the primary decomposition, the latest achievement is the normalisation, both being implemented in SINGULAR.
At first glance, it seems that computation in the localisation requires computation with rational functions. It is an important fact that this is not necessary, but that basically the same algorithms which were developed for can be used for . This is achieved by the choice of a special ordering on the monomials of where, loosely speaking, the monomials of lower degree are considered to be bigger.
However, such orderings are no longer well-orderings and the classical Buchberger algorithm would not terminate. Mora discovered, cf. Mo, that a different normal form algorithm, or, equivalently, a different division with remainders, leads to termination. Thus, Buchberger's algorithm with Mora's normal form is able to compute in without denominators.
Several algorithms for use elimination of (some auxiliary extra) variables. But variables to be eliminated have, necessarily, to be well-ordered. Hence, to be able to apply the full power of Gröbner basis methods also for the local ring , we need mixed orders, where the monomial ordering restricted to some variables is not a well-ordering, while restricted to other variables it is. In GP1 and Getal, the authors described a modification of Mora's normal form, which terminates for mixed ordering, and more generally, for any monomial ordering which is compatible with the natural semigroup structure.