Recovering the Good Component of the Hilbert Scheme
نویسنده
چکیده
We give an explicit construction, for a flat map X → S of algebraic spaces, of an ideal in the n’th symmetric product of X over S. Blowing up this ideal is then shown to be isomorphic to the schematic closure in the Hilbert scheme of length n subschemes of the locus of n distinct points. This generalises Haiman’s corresponding result ([13]) for the affine complex plane. However, our construction of the ideal is very different from that of Haiman, using the formalism of divided powers rather than representation theory. In the non-flat case we obtain a similar result by replacing the n’th symmetric product by the n’th divided power product. The Hilbert scheme, HilbnX/S , of length n subschemes of a scheme X over some S is in general not smooth even if X → S itself is smooth. Even worse, it may not even be (relatively) irreducible. In the case of the affine plane over the complex numbers (where the Hilbert scheme is smooth and irreducible) Haiman (cf., [13]) realised the Hilbert scheme as the blow-up of a very specific ideal of the n’th symmetric product of the affine plane. It is the purpose of this article to generalise Haiman’s construction. As the Hilbert scheme in general is not irreducible while the symmetric product is (for a smooth geometrically irreducible scheme over a field say) it does not seem reasonable to hope to obtain a Haiman like description of all of HilbnX/S and indeed we will only get a description of the schematic closure of the open subscheme of n distinct points. With this modification we get a general result which seems very close to that of Haiman. The main difference from the arguments of Haiman is that we need to define the ideal that we want to blow up in a general situation and Haiman’s construction seems to be too closely tied to the 2-dimensional affine space in characteristic zero. As a bonus we get that our constructions work very generally. We have thus tried to present our results in a generality that should cover reasonable applications (encouragement from the referee has made us make it more general than we did in a previous version of this article). There are some rather immediate consequences of this generality. The first one is that we have to work with algebraic spaces instead 2000 Mathematics Subject Classification. 14C05.
منابع مشابه
Reproducing Kernel Hilbert Space(RKHS) method for solving singular perturbed initial value problem
In this paper, a numerical scheme for solving singular initial/boundary value problems presented.By applying the reproducing kernel Hilbert space method (RKHSM) for solving these problems,this method obtained to approximated solution. Numerical examples are given to demonstrate theaccuracy of the present method. The result obtained by the method and the exact solution are foundto be in good agr...
متن کاملEquilibrium problems and fixed point problems for nonspreading-type mappings in hilbert space
In this paper by using the idea of mean convergence, weintroduce an iterative scheme for finding a common element of theset of solutions of an equilibrium problem and the fixed points setof a nonspreading-type mappings in Hilbert space. A strongconvergence theorem of the proposed iterative scheme is establishedunder some control conditions. The main result of this paper extendthe results obtain...
متن کاملApproximation of fixed points for a continuous representation of nonexpansive mappings in Hilbert spaces
This paper introduces an implicit scheme for a continuous representation of nonexpansive mappings on a closed convex subset of a Hilbert space with respect to a sequence of invariant means defined on an appropriate space of bounded, continuous real valued functions of the semigroup. The main result is to prove the strong convergence of the proposed implicit scheme to the unique solutio...
متن کاملA Non-MDS Erasure Code Scheme for Storage Applications
This paper investigates the use of redundancy and self repairing against node failures indistributed storage systems using a novel non-MDS erasure code. In replication method, accessto one replication node is adequate to reconstruct a lost node, while in MDS erasure codedsystems which are optimal in terms of redundancy-reliability tradeoff, a single node failure isrepaired after recovering the ...
متن کاملA Novel Design of Two Loosely Coupled Bandpass Filter Based on Hilbert-zz Resonator with Higher Harmonic Suppression
New characteristics of fractal design scheme has been introduced to generate compact two poles capacitively coupled microstrip bandpass filter by using additional coupling stubs for different wireless applications. The presented fractal scheme is based on specific type of Hilbert space-filling curve which is called Hilbert-zz fractal geometry. The performance of generated bandpass filter struct...
متن کامل