Next: 5. Singularities and standard Up: 4. Some global algorithms Previous: 1. primary decomposition   Contents

## 2. Normalisation

Another important algorithm is the normalisation of where is a radical ideal. It can be used as a step in the primary decomposition, as proposed in EHV, but is also of independent interest. Several algorithms have been proposed, especially by Se, Sto, GT, Va1. It had escaped the computer algebra community, however, that GR had given a constructive proof for the ideal of the non-normal locus of a complex space. Within this proof they provide a normality criterion which is essentially an algorithm for computing the normalisation, cf. Jo. Again, to make the algorithm efficient needed some extra work which is described in DGJP. The Grauert-Remmert algorithm is implemented in SINGULAR and seems to be the only full implementation of the normalisation.

Criterion [Grauert and Remmert1971]: Let with a radical ideal. Let be a radical ideal containing a non-zero divisor of such that contains the non-normal locus of . Then is normal if and only if    Hom.

For we may take any ideal so that contains the singularities of . Since normalisation commutes with localisation, we obtain

Corollary: Ann Hom is an ideal describing the non-normal locus of .

Now Hom is a ring containing and if    Hom we can continue with instead of and obtain an increasing sequence of rings .

After finitely many steps the sequence becomes stationary (because the normalisation of is finite over ) and we reach the normalisation of by the criterion of Grauert and Remmert.

Ingredients for the normalisation (which is a highly recursive algorithm):

1. Computation of the ideal of the singular locus of the ideal ;
2. computation of a non-zero divisor for ;
3. ring structure on Hom;
4. syzygies, normal forms, ideal quotient.

SINGULAR commands for computation of the normalisation:

  LIB "normal.lib"; ring S = 0,(x,y,z),dp; ideal I = y2-x2z; list nor = normal(I); def R = nor[1]; setring R; normap; ==> normap[1]=T(1) ==> normap[2]=T(1)*T(2) ==> normap[3]=T(2)^2 

In the preceding picture, , the normalisation of , is just the polynomial ring in two variables and . (The handle'' of Whitney's umbrella is invisible in the parametric picture since it requires an imaginary parameter .)

In several cases the normalisation of a variety is smooth (for example, the normalisation of the discriminant of a versal deformation of an isolated hypersurface singularity) sometimes even an affine space. In this case, the normalisation map provides a parametrisation of the variety. This is the case for the Whitney umbrella: .

Next: 5. Singularities and standard Up: 4. Some global algorithms Previous: 1. primary decomposition   Contents
| ZCA Home | Reports |