Next: Moduli spaces and invariants Up: Applications of Computer Algebra Previous: Introduction

Monodromy and Gauß-Manin connection

The monodromy of a morphism between complex spaces or algebraic schemes/, which we suppose to be a differentiable fibre bundle outside the discriminant , describes the action of the fundamental group of on the cohomology of the general fibre. The Gauß-Manin connection may be considered as an algebraic description of the monodromy action by means of differential forms. Finally, the mixed Hodge structure is an analytic structure on generalising the Hodge decomposition of compact, smooth algebraic varieties. These concepts have many applications and were widely studied in the global situation for proper maps as well as in the local situation for isolated singularities, for a survey see [Ku]. Here we shall only consider the local case.

Let be a convergent power series (in practice a polynomial) with isolated singularity at 0 and the Milnor number of . Then defines in an -ball around 0 a holomorphic function , and, by a theorem of Milnor, there exists a small -disc in around such that is a -fibre bundle so that the general fibre , , is homotopy equivalent to a bouquet of -dimensional spheres.

The simple, counterclockwise path in around induces a -diffeomorphism of () and an automorphism of the singular cohomology group which is a -dimensional -vector space. The automorphism is called the local Picard-Lefschetz monodromy of . We address the problem of computing the eigenvalues and the Jordan normal form of .

The first important theorem is the monodromy theorem, due to Deligne in the global and to Brieskorn in the local situation which says that the eigenvalues of are roots of unity, that is, we have , where is a complex matrix with eigenvalues in .

Hence, we are left with the problem of computing the eigenvalues and the Jordan normal form of . Since is a complex Stein manifold, its complex cohomology can be computed, via the holomorphic de Rham theorem, by using holomorphic differential forms, which is the starting point of Brieskorn's algorithm for computing the monodromy. To cut a long story short, we just mention that the Brieskorn lattices (cf. [Br])

are free -modules of rank . Here denotes the complex of holomorphic differential forms in . We define the local Gauß-Manin connection of as

Extending to an endomorphism of and describing it with respect to a basis, we see immediately that the kernel of , together with a basis of , is the same as the solutions of a rank system of ordinary differential equations

in a neighbourhood of in . The connection matrix has a pole at and is holomorphic for . If is a fundamental system of solutions at a point , then the analytic continuation of along the path transforms into another fundamental system which satisfies for some matrix .

It is a fundamental fact that the Picard-Lefschetz monodromy coincides with the monodromy of the Gauß-Manin connection.

Brieskorn [Br] used this fact to describe the essential steps for an algorithm to compute the characteristic polynomial of . Results of Gerard and Levelt [GL] allowed the extension of this algorithm to compute the Jordan normal form of . An implementation of Schulze in SINGULAR is able to compute interesting examples (including the uni- and bimodal singularities, [Sch]).

The algorithm uses the regularity theorem which says that there exists a basis of some lattice in such that the connection matrix has a pole of order 1.

Basically, if has a simple pole, then is the monodromy (this holds if the eigenvalues of do not differ by integers which can be achieved algorithmically).

SINGULAR example for computing the monodromy (omitting the output):


> LIB "mondromy.lib";
> ring R = 0,(x,y),ds;
> poly f = x2y2+x6+y6;     //example of A'Campo (monodromy is not
> matrix M = monodromy(f); //diagonalisable)
> print(jordanform(M));    //prints Jordan normalform of monodromy

Ingredients for the implementation of Brieskorn's algorithm:

1. Computation of standard bases and normal forms for local orderings;
2. find so that and express as linear combination of ;
3. computation of the connection matrix on increasing lattices in up to sufficiently high order (until saturation) by linear algebra over ;
4. computation of the transformation matrix to a simple pole by linear algebra over .
The most expensive parts are certain normal form computations for a local ordering and the linear algebra part because here one has to deal iteratively with matrices with several thousand rows and columns.

In the remaining part of this section we describe a new algorithm, developed by M. Schulze, based on the theory of -modules ( ): the complex with differential defined by

is a complex of -modules with -action

The -module is called the Gauß-Manin system of . The operator is invertible on . For , let

and be the image of under the canonical map . This defines a filtration on called the Hodge filtration. By the De Rham and Poincaré lemma, . We denote by

the ring of micro-differential operators with constant coefficients and abbreviate . Then is a free -module of rank . By definition, is isomorphic to the Jacobian ideal of , and to the Milnor algebra. Using Gröbner basis methods, one can compute a monomial -basis of , inducing a section of the projection and an isomorphism , by Nakayama's lemma. We define the matrix

of multiplication by this respect to , i.e., . An easy computation shows that is the basis representation of with respect to .

By definition of the differential , computing up to order amounts to expressing times an element of in the basis and , which is the Jacobian ideal of . This can be done using Gröbner basis methods. To do the -th step in the computation of the saturation of , one has to compute up to order . To compute the residue of on , whose eigenvalues are the eigenvalues of monodromy, one has to compute up to sufficiently high order and compute a -basis of as well as the basis representation of the images of this basis under with respect to this basis. This can also be done using Gröbner basis methods.

Compared to the Brieskorn algorithm, we have interchanged the roles of and . The -structure of is much more natural and there are many advantages of this new algorithm: There are no problems with estimations, no huge linear algebra problems, we need not to lift a power of in the Jacobian ideal, the basis of is easier to compute, and so on. The main point is that we can continue the computation when we have to increase the order of . In the Brieskorn algorithm, we have to start again almost from the beginning. Nevertheless, the three components of this new algorithm explained above also require difficult computations, especially the first one. The new algorithm can be extended to compute the Jordan normal form of the monodromy in a similar way as it was done in [Sch].

Problems:

1. Generalise the algorithm of M. Schulze to isolated complete intersection singularities.

2. Find an algorithm to compute the -filtration of the mixed Hodge structure of an isolated hypersurface singularity.

3. Compute the spectrum, resp. the spectral pairs, of an isolated hypersurface singularity.
The last problem was solved (and implemented in SINGULAR) by S. Endraß for nondegenerate singularities. M. Schulze has made progress in attacking 2. and 3.

Next: Moduli spaces and invariants Up: Applications of Computer Algebra Previous: Introduction
Christoph Lossen
2001-03-21