A simplified proof of desingularization and applications

From MaRDI portal
Publication:2583386



Abstract: This paper contains a short and simplified proof of desingularization over fields of characteristic zero, together with various applications to other problems in algebraic geometry (among others, the study of the behavior of desingularization of families of embedded schemes, and a formulation of desingularization which is stronger than Hironaka's). Our proof avoids the use of the Hilbert-Samuel function and Hironaka's notion of normal flatness: First we define a procedure for principalization of ideals (i.e. a procedure to make an ideal invertible), and then we show that desingularization of a closed subscheme X is achieved by using the procedure of principalization for the ideal mathcalI(X) associated to the embedded scheme (X). The paper intends to be an introduction to the subject, focused on the motivation of ideas used in this new approach, and particularly on applications, some of which do not follow from Hironaka's proof.


The problem of existence and construction of a resolution of singularities is one of the central tasks in algebraic geometry: Given a variety \(X\) over a field \(K\), a resolution of singularities of \(X\) is a proper birational morphism \(\pi:Y\to X\) such that \(Y\) is a non--singular variety. If \(K\) is a field of characteristic \(0\) the existence of resolution of singularities has been proved by \textit{H. Hironaka} [Ann. Math. (2) 79, 109--326 (1964; Zbl 0122.38603)]. His proof is highly non--constructive. Important contributions to find algorithms for the resolution of singularities have been made independently by the groups of \textit{E. Bierstone} and \textit{P. Milman} [Invent. Math. 128, 207--302 (1997; Zbl 0896.14006)] and of O. Villamayor and S. Encinas. The paper contains a short and simplified proof of the desingularization theorem (slightly stronger than Hironaka's version: strong factori\-zing desingularization). The resolution process is given by a sequence of blowing ups at carefully chosen centers. The choice of these centers is achieved without use of the Hilbert--Samuel function and Hironaka's notion of normal flatness. The proof of the desingularization theorem leads to an algorithm which has been implemented in Maple and \textsc{Singular}.



Cites work


Cited in
(62)


Describes a project that uses

Uses Software






This page was built for publication: A simplified proof of desingularization and applications

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2583386)