Tight closure/Text exponent/Introduction/Section

From Wikiversity
Jump to navigation Jump to search

The problem with an algorithmic computation of tight closure is that we have to check infinitely many conditions. For a test element (a well established theory) a test exponent is a number such that for all and implies . This makes also sense for a restricted class of ideals. But even for parameter ideals nothing substantial is known.

The following variant is more promising and has the same computational effect: Let denote the test ideal of . We call a test ideal exponent (for a class of ideals) if

and for all and implies . For this one has to know the test ideal, but this is known in many cases. For the class of parameter ideals in the Gorenstein case this works, because then and so we can take even as test ideal exponent.

The methods from above allow us to extend this to homogeneous primary ideals in a standard-graded two-dimensional domain over a finite field. The test ideal exponent is however huge and not suitable for computations. It depends on the genus, the number of ideal generators and most importantly on the number of elements in the field (via the finite number of semistable bundles in the moduli space).

Let be a standard-graded, two-dimensional (geometrically) normal Gorenstein domain over a finite field. Fix and suppose that , where is the genus of the curve. Then there exists a test ideal exponent for the class of primary homogeneous ideals generated by elements.

The finite field assumption in the last two statements is necessary. Both proofs rely on the fact that for fixed rank and degree there exists only finitely many semistable sheaves defined over the field with these numerical data.