A simplified proof of desingularization and applications (Q2583386): Difference between revisions

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}.