Relative and logarithmic resolution of singularities
Michael Temkin

TL;DR
This paper reviews various canonical desingularization methods in characteristic zero, including classical, logarithmic, weighted, and broader context approaches, providing a unified overview of the field.
Contribution
It offers a comprehensive overview of known desingularization techniques, highlighting recent developments and their applications across different mathematical contexts.
Findings
Summarizes classical and modern desingularization methods.
Introduces recent logarithmic and weighted desingularization techniques.
Extends desingularization concepts to wider mathematical settings.
Abstract
These lecture notes provide a unified overview of most known canonical desingularization methods in characteristic zero. It starts with discussing the classical method, and then proceeds with the recently discovered ones: logarithmic desingularization of logarithmic schemes and morphisms, weighted methods: logarithmic and non-logarithmic ones, desingularization in wider contexts: quasi-excellent schemes and formal schemes, complex and non-archimedean spaces.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsPolynomial and algebraic computation · Advanced Differential Equations and Dynamical Systems · Advanced Numerical Analysis Techniques
Relative and logarithmic resolution of singularities
Michael Temkin
Einstein Institute of Mathematics
The Hebrew University of Jerusalem
Edmond J. Safra Campus, Giv’at Ram, Jerusalem, 91904, Israel
Key words and phrases:
Resolution of singularities, logarithmic geometry, stacks, weighted blowings up
This research is supported by BSF grants 2014365 and 2018193, ERC Consolidator Grant 770922 - BirNonArchGeom.
Contents
- 1 Introduction
- 2 General principles
- 3 Resolution of logarithmic schemes: a first attempt
- 4 The logarithmic algorithm
- 5 Resolution of morphisms
- 6 The dream algorithms
- 7 Resolution for quasi-excellent schemes and other categories
- A
1. Introduction
These notes will constitute a chapter in a book on recent advances in resolution of singularities based on a series of minicourses given at an Oberwolfach seminar. My original plan was to provide an expanded version of lecture notes of a mini-course on logarithmic resolution and semistable reduction, but while working on this I decided to widen the perspective and discuss the non-logarithmic methods too – both the classical method and the weighted (or dream) algorithm. This produces a certain intersection with the material of the other chapters, but I think that the profit is larger than this inconvenience. So, what does one gain? Primarily, when working on the exposition of the logarithmic methods I found a new perspective, which allows to relatively uniformly present and compare all four methods – the classical one, the logarithmic one, the non-logarithmic weighted method and the logarithmic weighted method. This perspective is slightly new even in the case of the classical algorithm – marked ideals are not used, but we blow up -multiple smooth centers instead – so we will start with a reinterpretation of the classical method (assuming a basic familiarity with it), and then add a logarithmic layer, a stack-theoretic layer, and a weighted layer, each time either obtaining a new algorithm or studying where an attempt fails and preparing to add one more layer to fix this failure. Not only does this presentation follows the order of discovery of these methods and layers, but I hope it also makes the exposition more accessible, since we try to introduce new tools one after another rather than all at once. Second, in any case the weighted logarithmic method of Quek should be covered by this chapter, so it makes sense to start with the non-logarithmic dream algorithm, and only then add the logarithmic layer, indicating the needed logarithmic adjustments.
Our goal is to introduce all relevant notions, constructions and techniques, and to formulate all main results, including all important intermediate results. There are no proofs in the notes. Some easier results are given as exercises and provided with hints, more difficult theorems are provided with references to the literature and a short discussion of main ideas of the proof. So these notes can be viewed as a light guide or a companion for reading research papers, where the new methods were constructed: [ATW20a], [ATW20b], [ATW19] (see also [McQ20], though it uses a different language) and [Que22].
1.1. History and motivation
Until a few years ago there was known an essentially unique basic functorial method for principalization of ideals and resolution of varieties in characteristic zero, to which we refer in the sequel as “the classical method”. It was distilled during decades from Hironaka’s original method from [Hir64], and in this joint and very long effort took part Hironaka himself (idealistic exponents), Giraud (maximal contact), Villamayor and Bierstone-Milman (canonicity), Włodarczyk (smooth functoriality), and others. In particular, until 2017 it was not clear if there exist other algorithms, especially the ones which are simpler, faster or possess better functorial properties. These questions, fundamental by themselves, are especially important in view of the fact that a similar method fails in two other classical desingularization problems: resolution in positive characteristic and resolution of vector fields (in characteristic zero). So, enriching the pool of ideas and techniques can be critical in order to achieve a substantial progress in these questions.
The first advance beyond the classical settings was done when a logarithmic analogue of the classical method was constructed for varieties in [ATW20a] and then extended to morphisms (or semistable reduction theorems) in [ATW20b]. The original motivation for this project was twofold: 1) we wanted to obtain a functorial semistable reduction theorem, which will extend, in particular, to any valuation ring, not necessarily discrete, 2) we wanted to clarify the role of log structures in the classical algorithm, where it was visible but a bit opaque. Both lines pointed in the same direction:
-
Over a general valuation ring the best one can hope for is the semistable reduction in the sense of Abramovich-Karu (see [AK00] and [ALT18]), and this indicates that one has to work with arbitrary fs log structures and not only those with free monoids . In addition, the notions of smoothness, derivations, smooth functoriality, etc. should be replaced by log smoothness, log derivations, log smooth functoriality, etc.
-
In this context it was natural to seek for principalization on general log smooth varieties as opposed to smooth varieties with an snc boundary (or the induced log structure).
All in all, one is led to replace the classical setup by the logarithmic one, and the rest, to our surprise, was rather imposed upon us (though not easy to discover). In particular, it turned out that the only sufficiently general class of logarithmic centers that preserve log smoothness are intersections of subvarieties with monomial centers. A relevant log algorithm is even simpler than the classical one because no induction on the log stratification is needed anymore, but it got stuck at one place and insisted that we also blow up centers generated by roots of monomials. Such a blowing up may be not log smooth, and to resolve this we had to refine such blowings up to stacks – adding the stack-theoretic layer is the solution which seemed to us technical but unavoidable. In fact, we just introduced a stack-theoretic refinement of the classical weighted blowing up (with a certain pattern of weights). Note that analogous obstacles were discovered earlier in resolution of vector fields, and the solution also was to consider non-representable weighted blowings up (or any equivalent tool playing the same role), see [Pan06] and [MP13].
Once a new pool of blowings up that preserve smoothness (in the setting to stacks) was discovered, the next natural question was to study which improvement to the classical algorithm can be obtained using them all. It was independently studied in [McQ20] (following [MP13]) and in [ATW19] (following [ATW20a]) and, as in the classical case, led to the same algorithm, despite different description and justification. Quite to our surprise, the natural principalization algorithm in this setting does not involve any log structure, does not have any memory, uses a simple (in fact, classical) multi-order invariant and improves it after each single weighted blowing up. Moreover, even the resulting resolution algorithm has the same properties, and it is really a non-embedded method. Finally, such an algorithm was believed not to exist (and it dose not exist in the classical setting, see § 6.4.8). For all these reasons we sometimes call it a dream algorithm, despite the fact that (unfortunately for us) some experts consider it as a variation of old ideas, which does not contain anything essentially new…
Finally, one may ask if a dream algorithm also exists in the logarithmic situation, in particular, leading to a fast and simple resolution of schemes with divisors and semistable reduction theorem. The answer is yes. The absolute case was worked out in [Que22], and it seems certain that the similar method will also apply in the relative setting.
1.2. An overview
Now let us outline the content of these notes.
1.2.1. The general principles
In Section 2 we formulate the general principles that apply to all four methods known so far. In fact, this is an excellent time for such a classification – we already have a few known functorial methods (unlike the past decades, when only the essentially unique classical method was known), but still quite a few methods, so that such a generalization is possible… In brief, quite surprisingly each algorithm seems to be quite determined by what we call the framework of the method: the class of geometric objects one works with, the relevant notions of smoothness and derivations, the admissible centers one can blow up without destroying the smoothness, and a primary classification of admissible centers by a (partially or totally) ordered set whose elements are called orders, log orders, weighted orders, etc. Resolution of is always deduced from principalization of on a manifold in which is (locally) embedded, and the principalization of is deduced from appropriate order reduction of , in which one iteratively blows up an admissible center which contains and has maximal possible order, and then factors out the pullback of from the pullback of .
It turns out that what is usually viewed as the main machinery, including the heavy one – maximal contacts, coefficient ideals, homogenization, independence of the embedding, etc. – generalizes quite easily to any setting, once an appropriate framework is chosen. And what we viewed as technical aspects in [ATW20a] and [ATW19] – extending varieties to DM stacks, introducing an appropriate formalism of new centers, such as , etc. – seems to be the main choices which one has to carefully design. A wrong or insufficient choice often leads to an ”almost” algorithm which gets stuck at an unexpected innocently, or technically looking, point.
We finish Section 2 with an illustration of these general principles on the case of the classical algorithms – first we show how far one can go without boundaries, and then add this additional layer to the framework. In this case, one gets stuck because the order can jump on the maximal contact, so one has to consider order reductions of non-maximal order, and Hironaka’s insight was that this can be done once the excess of the exceptional divisor is well controlled by the boundary. If one uses precise weighted centers, the exceptional divisor is cleared off in a more precise way, and this explains why the basic weighted algorithm uses no boundary (or log structure) at all; this is the only method known so far which does not use log structures.
A familiarity with the classical methods is assumed in our exposition, so we refer to chapter [Fru] and to the usual sources, such as [Kol07] and [Wło05]. Also, a very short and clear exposition (with some proofs omitted) can be found [BM08].
1.2.2. The logarithmic methods
In the next two sections we explain in detail the logarithmic analogue of the classical method, which was constructed in [ATW20a]. In Section 3 we proceed as much as one can within the framework of log varieties (as the reader can imagine, this was precisely our first line of research when working on [ATW20a]). The slogan of this part is to add “log” everywhere: log varieties, log smoothness, log smooth functoriality, log derivations and the associated notions of log order, log maximal contact and log coefficient ideal. The main novelty is that one can consider centers, which are powers of the centers of the form , where are regular parameters and are arbitrary monomials.
It turns out that in this fashion one almost obtains a perfect algorithm, which fails only at one point – this time the failure also happens in the log order reduction of non-maximal log order , but, in addition, the problem only pops up when the log order of is infinite. The solution this time is to allow blowings up of Kummer centers defined also by Kummer monomials like . This requires to extend both the formalism of such ideals and of their blowings up. The first task is solved in the Kummer étale topology and the second one forces one to consider stacks and non-representable modifications. The theory of Kummer centers and blowings up is developed in the beginning of Section 4, and then the same logarithmic algorithm constructed earlier works perfectly well.
Section 5 is devoted to extending the absolute logarithmic methods to morphisms, following [ATW20b]. In fact, precisely the same algorithm works once one replaces absolute log derivations by relative ones. The only serious novelty is that one should take base changes into account. On the positive side, the algorithm is compatible with arbitrary base changes with a log regular source – a new type of functoriality. However, there is no free lunch, and another new feature is that the algorithm can fail, and in order for it to succeed one has to modify the base first. Non-surprisingly, once again the failure can happen at the “simple” monomial stage. Much more surprisingly is that we could not find a simple way to prove a monomialization theorem, which guarantees that the monomial step succeeds after a large enough base change, see §5.3. The existing proof is non-canonical, and we expect further progress to be possible.
1.2.3. The weighted methods
Finally, in Section 6 we construct weighted algorithms which blow up arbitrary -regular (or weighted) centers both in the non-logarithmic and logarithmic settings. We follow [ATW19] in the non-logarithmic case and we follow [Que22] in the logarithmic ones. Note also that the same algorithm was constructed by McQuillan in [McQ20], but the presentation uses a much more coordinate dependant language, so it is rather far from ours. The main idea is that we would like to blow up centers like which might lead to a singular output, but this can be resolved by blowing up an appropriate root , obtaining a smooth stack-theoretic refinement of . In order to make sense of things like one has to introduce a new formalism of generalized ideals. In fact there exist a few ways to deal with this – valuative -ideals, -ideals (which are equivalent to Hironaka’s characteristic exponents) and Rees algebras, and we discuss them and relations between them in the first three subsections of §6.
The paradigm of blowing up general -regular ideals leads to what we call dream algorithms which introduce a simple invariant – the weighted (log) order, and improve it by a single blowing up along an -admissible -regular center of maximal possible weighted (log) order. This results in what we call dream algorithms which require no history and simply repeat the same basic operation of weighted (log) order reduction. In addition, one obtains a non-embedded resolution which acts in the absolutely same manner – one simply blows up the unique maximal -regular center contained in the scheme, and this blowing up improves the invariant. The logarithmic weighted algorithm is constructed very similarly but using the logarithmic setting. The main difference is that one also has to add a monomial part to the -regular center, and one should take such a part as small as possible.
1.2.4. Conventiones
Unless stated otherwise, we will always work over a ground field of characteristic zero.
By a blowing up we always mean a morphism with the ideal being part of the datum. Thus, the same morphism can underly different blowings up. By a slight abuse of language, saying that a morphism is a blowing up without specifying the center we always mean that underlies a blowing up along some center (in particular, it is projective).
All log schemes are fs, see [Tem22].
2. General principles
In this section we will discuss principles and features shared by all known functorial resolution algorithms. In particular, we choose a presentation which might look a bit strange to the reader familiar only with the classical algorithm, but it extends naturally to other settings. We will end the section with a short description and re-interpretation of the classical algorithm in the new framework.
2.1. Frameworks
2.1.1. Modifications
By a modification we mean a proper morphism which establishes an isomorphism of dense open subschemes (subspaces, substacks, etc.) This definition applies to non-reduced objects as well, though we will usually work with generically reduced ones. For example, a blowing up is a modification if and only if its center is nowhere dense.
2.1.2. Basic choices of an algorithm
Each algorithm makes a few basic choices that we list below and call the framework of the algorithm.
- (0)
The category of geometric objects the algorithm deals with, that will be called spaces, and the corresponding topology. For example, varieties over a fixed or varying fields, schemes with enough derivations, analytic spaces, stacks, log schemes, etc. The topology can be Zariski, étale, analytic, etc.
- (1)
The class of regular spaces that will be called manifolds, and the class of regular morphisms. For example, smooth varieties, regular schemes, log smooth log varieties, etc., and smooth morphisms of varieties over a fixed field, regular morphisms between varieties over varying fields, log smooth morphisms of log varieties, etc.
- (2)
The class of admissible modifications with and manifolds. It will always be a variant of a blowing up along an admissible center (or simply a center), so we will use the notation . In particular, the pullback is always an honest invertible ideal which defines the exceptional divisor . The center itself is an ideal in an appropriate topology, which can be rather fancy. For example, Kummer étale topology or -topology.
- (3)
A primary invariant which takes values in a totally or partially ordered set and more or less classifies different types of admissible centers. We call it the order of the center and extend to arbitrary ideals as follows: the order of on is the maximal order of an -admissible center, that is, an admissible center such that . Examples include the order of ideal, the log order and the weighted order of a weighted center .
- (4)
A theory of derivations on manifolds. This amounts to choosing large enough sheaves of derivations one works with. For example, -derivations or absolute derivations over .
Remark 2.1.3**.**
(i) Choices (0)–(2) will be called the basic framework of the method. Choices (3) and (4) seem to be dictated by the basic framework, at least to a large extent.
(ii) Concerning the choice of admissible blowings up, the general principle is that one should try to choose as large a class as possible with the restriction that the centers should possess a simple explicit description. In the cases we know, it seems that the framework essentially dictates a unique natural algorithm corresponding to it, and the larger the class of admissible blowings up is, the better algorithm one obtains. Even in the classical setting it is beneficial to consider centers of the form , where defines a smooth subvariety . Since this might look as a simple bookkeeping of the order inside the center, but we will argue that in this form the description of the algorithm becomes both more natural and more similar to the logarithmic and weighted algorithms, e.g. see Remark 2.3.2.
2.1.4. Functoriality
All methods we will consider are functorial in the following strong sense: they are compatible with surjective regular morphisms. In particular, this implies that the method can be constructed étale locally (or even smooth locally), and once this is done the method globalizes by étale descent. This fact simplifies arguments tremendously as they become essentially of a local nature (see also §2.2.4). Compatibility with non-surjective regular morphisms holds on the level of a morphism, but not a finer structure of the principalization sequence of blowings up, and we will touch on this delicate issue later.
Remark 2.1.5**.**
(i) Historically, the first canonical algorithms (i.e. compatible with automorphisms) were constructed by Bierstone-Milman in [BM97] and Villamayor in [Vil89], and Włodarczyk was the first to emphasize on smooth functoriality and use it in an essential way in constructing the algorithm, see [Wło05].
(ii) Smooth functoriality implies that the algorithm is equivariant with respect to any group scheme action, as any group scheme in characteristic zero is smooth.
2.2. Principalization and resolution
The main result of each desingularization method is an appropriate principalization theorem, and as a consequence one obtains a non-embedded desingularization theorem.
2.2.1. Functorial resolution
Let be a class of regular morphisms (usually all regular morphisms in ). By a -functorial resolution on we mean a rule which associates to each object of a modification with a regular source in such a way that for any -morphism in . The main resolution theorem for a given framework asserts that such a resolution exists. In addition, the desingularization morphisms are projective (or non-representable global quotients of projective morphisms). In fact, they are naturally equipped with a structure of a composition of explicit blowings up, but this factorization is only compatible with surjective regular morphisms.
2.2.2. Functorial principalization
Let be a manifold and an ideal on . An admissible blowing up is called -admissible if . In such a case, is contained in the invertible ideal , hence the transform is defined. An -admissible sequence is a sequence of -admissible blowings up such that and is the transform of . Such a sequence is called a principalization of if is trivial.
By a -functorial principalization on we mean a rule which associates to any ideal on a manifold in a principalization of in such a way that for any -morphism in and the sequence is obtained from the pullback of by omitting all trivial blowings up. The main principalization theorem asserts that such a principalization exists.
Remark 2.2.3**.**
If is surjective, then , but in general the blowings up along centers whose image in is disjoint from the image of are pulled back to trivial blowings up and hence ignored.
2.2.4. Synchronization
The above remark indicates that the principalization algorithm is not of local nature in the strict sense. For example, if is an open covering, one cannot reconstruct from without an additional synchronization data – what are the trivial blowings up we removed after the restriction. However, if and , then all these blowings up are kept in the sequence , and as we remarked earlier is easily reconstructed from . Informally speaking, when principalizing the method has to compare the singularities of and decide which one is blown up earlier (or simultaneously), entering trivial blowings up at the other places. This is precisely the needed synchronization datum.
Remark 2.2.5**.**
(i) The above argument shows that it is important to consider simultaneous principalization on disconnected manifolds, and the method is only “local up to disjoint unions” or quasi-local accordingly to the terminology of [ALT18].
(ii) Another way to establish a synchronization of local constructions is by use of an explicit invariant, for example, as [BM97] do. In fact, using the trick with disjoint unions is equivalent to the use of an abstract invariant, see [Tem12, Remark 2.3.4].
2.2.6. The re-embedding principle
There is one more important functoriality property satisfied by all known methods called the re-embedding principle. We say that a principalization method on satisfies the re-embedding principle if for any closed immersion of manifolds of constant codimension an ideal on and its preimage the blowing up sequence is obtained by pushing forward the blowing up sequence , that is, the centers of are the preimages of the centers of and (by induction on the length) each is the strict transform of .
2.2.7. Reduction to principalization
In all settings the appropriate desingularization theorem is a relatively easy corollary of the principalization theorem. Loosely speaking the general principle can be formulated as follows:
Principle 2.2.8**.**
If there exists a -functorial principalization on which satisfies the re-embedding principle, then there exists a -functorial desingularization on the class of locally equidimensional generically reduced spaces from which locally possess a closed immersion into a manifold.
The embeddability assumption is automatic for varieties, formal varieties or analytic spaces, and is only relevant for general excellent schemes. The local equidimensionality condition is used to construct an embedding of constant codimension. The argument in all settings is essentially the same: to resolve a space , one locally embeds it into a manifold and constructs the resolution of from the principalization . Loosely speaking, before blowing up a generic point the principalization has to guarantee that it is a generic point of an admissible center, and in all methods this amounts to resolving the Zariski closure of . Moreover, because of the codimension assumption, all generic points of are blown up simultaneously at some blowing up and its center contains a component which is the strict transform of . In particular, is the induced desingularization of . Independence of the embedding in all methods is proved by use of the re-embedding principle and a simple computation showing that an embedding of minimal possible codimension is unique étale locally (or formally locally).
Remark 2.2.9**.**
(i) The desingularization morphism is naturally a composition of blowings up , with centers . In the classical resolution each center is smooth, but the intersection can be singular. In particular, the factorization of into a composition of blowings up is not too informative.
(ii) So-called strong resolution methods construct a resolution which is a composition of blowings up along smooth centers. Perhaps the main advantage of this is that for any closed immersion into a manifold the resolution automatically extends to a modification of manifolds with a closed subscheme in : just consider the pushout of the sequence .
(iii) The only known method to construct strong resolution is to force the condition that in the principalization sequence, and hence the whole sequence is the pushforward of the sequence . In the classical case this is achieved by serious additional work building on the usual principalization (the so-called presentation of the Hilbert-Samuel function in [BM97]). We will see that in the weighted desingularization methods strong factorization is achieved just as a by-product.
2.2.10. The miracle
The reduction of resolution to a seemingly very different principalization problem is usually viewed as a brilliant trick if not a miracle. Nevertheless, we claim that this is not so surprising. An equivalent formulation of existence of resolution is that manifolds are cofinal among the set of all modifications of a generically reduced space . When one studies modifications of a manifold , it is hard (if not impossible) to explicitly describe all modifications with a manifold, so it is natural to only consider basic explicit modifications of this form – admissible blowings up and their composition. The principalization theorem asserts that for any ideal there is an admissible sequence which principalizes , and by the universal property of blowings up this happens if and only if the morphism factors through . By Chow’s lemma blowings up form a cofinal family of modifications of , hence the principalization just asserts that admissible sequences form a cofinal family of modifications of a manifold. In this form, it is rather natural to expect that the theorems are related and the principalization theorem is finer.
Remark 2.2.11**.**
One may also wonder if the following weak factorization conjecture holds: any modification of manifolds can be factored into a composition of admissible blowings up and blowings down. This conjecture provides the next level of depth. In the classical case the only known argument deduces it with a large amount of work from -equivariant principalization in the next dimension. In other settings this is still open, though we expect that an analogous approach with birational cobordisms and -equivariant principalization should work there too. It would be especially interesting to check this for semistable models and morphisms.
2.2.12. Order reduction
In first approximation, the principalization is achieved by successive order reduction procedures: reduce the order of by blowing up centers of order . In the non-weighted algorithms one reduces this problem to an order reduction on a maximal contact hypersurface. However, the order can jump under this reduction, so for inductive reasons one also has to solve the problem of reducing the order of below only by blowings up -centers for any fixed value of the invariant. This results in the accumulation of exceptional divisors in the transform, and one has to use a log structure to control this – guarantee that the exceptional divisor is monomial and deal with it mainly by combinatorial methods. In fact, this is the only place in the algorithms, where some flexibility can take place.
In weighted algorithms the order reduction is done by a single weighted blowing up, so they are what we call dream algorithms – no history is needed, each blowing up is independent of the rest and reduces the invariant further. However, the argument that a unique maximal -admissible center exists is rather complicated and, again, uses the theory of maximal contact and homogenization. In particular, it completely fails in positive characteristic.
2.3. The classical algorithm: a first attempt
The classical method was already discussed in detail in chapter [Fru], so we assume that the reader is familiar with the main ideas and constructions, and our goal is to briefly re-interpet it within the general paradigm we described earlier in this section. Later we will develop the logarithmic algorithm pretty much in the same spirit. In §2.3 we will discuss what can be done without the boundary and where this attempt fails. However, all constructions we are going to describe are relevant, and in the next subsection, we will just add the boundary as an additional layer of the framework. For simplicity, we work with -varieties.
2.3.1. The framework
One considers the category of varieties over , manifolds are smooth varieties and the algorithms will be smooth functorial. Admissible centers are of the form , where is the ideal of a submanifold and . We call such a center a -center. An admissible blowing up is the usual blowing up of the center. The derivation theory is given by the sheaves of -derivations and the sheaves of differential -operators of order at most . The primary invariant of the center is just the multiplicity of .111We use the notion of the multiplicity of a center instead of the order to avoid confusion with the general order of ideals it is used to define. This is justified because the classical multiplicity of at any its point is . The order of an arbitrary ideal at is the maximal such that . Clearly, it suffices to take the center , and then we obtain the usual definition of the order.
Remark 2.3.2**.**
Classically one only considers 1-centers, works with marked ideals and uses a -transform after blowings up along a smooth center that lies inside the locus of points where the order is at least . This is equivalent to our admissibility condition and using the usual transform with respect to the blowing up along . So, we just provide a slightly different interpretation of the classical constructions.
2.3.3. Derivations
Derivations of ideals provide a convenient way to describe all basic ingredients of the algorithm (except the boundary):
- (1)
The maximal order of on is the minimal number such that . The order of at a point is computed similarly.
- (2)
A maximal contact to at is any closed smooth subscheme which locally at is of the form with .
- (3)
The homogenized coefficient ideal is the homogenized weighted sum of derivations, which are weighted by their orders:
[TABLE]
Remark 2.3.4**.**
Usual coefficient ideals are defined using only the corresponding powers of the derivations of , but the homogenized version is integral over it, and hence can be used instead. The homogenized coefficient ideals were introduced by Kollár, see [Kol07, §3.54]. They subsume the homogenization procedure of Włodarczyk, see [Wło05, §2.9].
2.3.5. Order reduction
If , then an order -reduction of is an -admissible sequence of blowings up along -centers such that .
Remark 2.3.6**.**
Usually one talks about order reduction of a marked ideal by blowing up smooth centers, and indicates which power of the exeptional divisor to factor out on each transform. The two languages are equivalent.
2.3.7. The maximal order case
The main loop of classical principalization iteratively performs order reduction with – the so-called maximal order case. In this case, the theory of maximal contact implies that for any maximal contact (which exists locally) pushing out from to establishes a one-to-one correspondence between order -reductions of and order -reductions of , so we can apply induction on dimension. Moreover, for any other maximal contact the restrictions of to and can be taken one to another by an étale correspondence, hence the construction is independent of choices and globalizes.
2.3.8. General order -reduction
It can happen that and so the induction forces one to also consider the non-maximal order case. The trick is to reduce this to the maximal order case by controlling the accumulated exceptional divisor, and for this job one has to add one more layer to the framework – the boundary.
2.4. The classical algorithm: the boundary
2.4.1. The framework
In fact, instead of manifolds one works with pairs , where the boundary (or the exceptional divisor) is an snc divisor. In some versions, one also orders components of by a history function. One restricts the set of the admissible centers by requiring that has simple normal crossings with , and then the boundary on is combined from the preimage of (the old boundary) and the exceptional divisor of (the new boundary). This guarantees that is snc. However, one still has to struggle with two complications mainly caused by the fact that one uses all derivations rather than those that preserve , so all constructions are not well-adapted to and one has to fix this essentially by hand. Fortunately, this can be done by two tricks.
2.4.2. Removing the old boundary
The first complication is that a maximal contact does not have to be transversal to , so does not have to be a boundary. This is resolved by separating and the old boundary by iterative order reduction of along the maximal multiplicity strata of the old boundary. This trick forces one to introduce a secondary invariant – the number of the old boundary components remaining since a maximal contact was created. As a result, the (non-normalized, see below) total invariant is rather than just the string of orders .
2.4.3. The normalized degrees
In addition, one usually normalizes the orders by so that , but the other degrees can be non-integral. In particular, this choice is made by Bierstone and Milman, see [BM97], and it is made in [ATW19], but not in [ATW20a]. It is more natural, for example, is the normalized invariant of . We will use the normalized choice also in the logarithmic and weighted algorithms. In the latter case, this is a “no-brainer” choice.
2.4.4. The companion ideal
Order -reduction of is done by splitting it into the product of the maximal invertible monomial factor and the remaining non-monomial part, which will be called clean. Until we simply apply maximal order reduction to . To proceed further we should take into account and the fact that the order is affected by both and . Fortunately, the contribution of is locally constant along the strata of , so again one can design an order reduction by a careful work along the strata. Technically, this is done by a trick with the companion ideal. Finally, when one resolves by purely combinatorial methods.
Remark 2.4.5**.**
(i) The classical algorithm has more complicated structure than the recently discovered ones. Probably, the main reason for this is that the boundary is not fully built into the framework – it is not respected by the derivations and its categorical meaning is not so evident. In a sense, it is an additional layer added in an ad hoc manner, and various incompatibility problems are also solved ad hoc.
(ii) It is observed in [BM08] that the sheaf of logarithmic derivations fits various constructions, including the chain rule for transform of derivations, much better than , but one still has to work with because it computes the order.
2.4.6. The log structure
In fact, boundaries do have a categorical interpretation – what one really uses in the classical principalization is the log structure defined by , rather than a divisor. In particular, monomial ideals are defined using the log structure and admissible blowings ups are morphisms of log schemes, but not of scheme-divisor pairs. Thus, manifolds in the classical principalization are in fact log smooth log schemes with free monoids (equivalently, is smooth). Furthermore, the induced resolution automatically satisfies the following condition: the exceptional divisor of is an snc divisor. Indeed, when the strict transform of is blown up during the principalization of on a manifold , it has simple normal crossings with the boundary and is not contained in , hence is snc. Finally, starting principalization with a non-empty one can also resolve embedded log schemes such that the monoids are free.
We have illustrated that the classical algorithm possesses certain logarithmic aspects. However, it is not functorial for log smooth morphisms, it works only with log structures of a special form, and it does not use log derivations. The natural question whether one can remove the restrictions on log structures and work log smooth functorially was one of the main motivations for a research which led us to the discovery of the logarithmic algorithm, constructed in the next sections.
3. Resolution of logarithmic schemes: a first attempt
Logarithmic algorithms are obtained by switching to the logarithmic framework: log schemes, log smooth functoriality, log derivations, etc. This makes the framework more complicated, but has numerous advantages: the principalization algorithm becomes simpler and faster, the functoriality is stronger, the method extends to morphisms. The main technical complication is that one is forced to extend the category to stacks or, alternatively, consider cobordant blowings up [Wło], which increase the dimensions.
In this section we will describe all desingularization tools provided by log geometry of varieties but not involving stacks. This makes the presentation simpler and illustrates the algorithm, and it will be easy for the exposition to add a stack-theoretic layer separately in the next section. To get used to the étale topology, already in this section we do not assume that the log structure is Zariski. In the end of this section we will construct a potential algorithm and detect the only place where it fails without using stacks.
3.1. The framework
We start with describing the manifolds and the admissible blowings up of the logarithmic principalization. Again the reader is referred to Chapter [Tem22] in this volume for an introduction and general notation.
3.1.1. Log schemes
The basic geometric category we work with is the category of fs log schemes of finite type over a field of characteristic zero, in particular, all fiber products are saturated.
3.1.2. Log smooth functoriality
We will tacitly check (or at least mention) that all basic ingredients of our method are compatible with log smooth morphisms. This will guarantee that the desingularization and principalization we will construct are functorial with respect to all log smooth morphisms.
3.1.3. Manifolds
By a log manifold we mean a log smooth log variety over . Recall that these are the same as the classical toroidal varieties and étale-locally they are of the form with the log structure given by a toric monoid . By a submanifold we mean any strict closed immersion with a log manifold. Basic properties of logarithmic smoothness imply that these notions are log smooth functorial:
Lemma 3.1.4**.**
Let be a strict closed immersion of log varieties, a log smooth morphism and . If is a log manifold and is a log submanifold, then is a log manifold and is log submanifold. If is surjective, then the converse is also true.
3.1.5. Parameters
Any log manifold is log regular, so the description from [Tem22, §3.4.6] applies. Recall that the log strata are regular (and they are well-defined even if the log structure is not Zariski, see [Tem22, Exercise 3.2.2(ii)]). Let be the log stratum containing a point . We say that is a regular parameter if its image in is a regular parameter. Similarly, form a regular family of parameters at if their images in do. By a full family of parameters at we mean a regular family of parameters and a monomial chart ; the image of is denoted . The latter exists if and only if the log structure is Zariski at , so in general a full family of parameters exists only étale locally. Any element of is viewed as a monomial parameter regardless of its arithmetic properties in .
Exercise 3.1.6**.**
Let be a log manifold with a closed point and . Also, let be a monomial chart.
(i) Show that is a regular family of parameters if and only if if and only if the morphism is étale at .
(ii) Show that is a submanifold of codimension at if and only if there exist a regular family of parameters such that at .
3.1.7. Admissible centers
For an ideal let denote the integral closure of the -th power. An admissible center or simply a center is an ideal which is locally of the form , where is a partial family of regular parameters, are monomials and . Thus, as in the classical algorithm admissible centers are the ideals defined by parameters, but we have much more flexibility with the monomial generators.
Remark 3.1.8**.**
(i) Admissible centers with are also called submonomial ideals because they correspond to monomial ideals on submanifolds. They can be locally described as , where is the ideal of a submanifold and is a monomial ideal.
(ii) The monomial ideal in the above presentation is unique, while the choice of and the corresponding submanifold is not. For example, can be also presented as for any element .
3.1.9. The multiplicity
Amy admissible center which possesses a presentation as above with the power is called a -center. If , then the center is not monomial, is uniquely determined and we define the multiplicity of to be equal to . If , then the center is monomial, it is necessarily a 1-center, but can also be a -center for finitely many other powers, and we define its multiplicity to be infinite. Multiplicity provides a reasonable classification of centers, and it will be the primary invariant of the method.
Remark 3.1.10**.**
We will later see that log principalization can blindly insist to treat a monomial center as a -center with no relation between the center and . This request fails on log manifolds, and to remedy the problem we will have to switch to stacks.
3.1.11. Admissible blowings up
Let be a log manifold and let be the toroidal divisor, i.e. is the triviality locus of the log structure. Recall that the log structure of is divisorial, that is, . Let be an ideal. A center is -admissible if , and an -admissible blowing up is the normalized blowing up along an -admissible center with the log structure induced by the divisor . The transform of the ideal is defined as usual by . Note that, similarly to the boundary in the classical desingularization framework, the new log structure is induced by the old one and the exceptional divisor.
Remark 3.1.12**.**
(i) The normalized blowings up along and coincide by Corollary A.1.2. What differs are the notions of admissibility and transform. Furthermore, the transforms with respect to the blowings up along and coincide by Lemma A.1.1, but we obtain the right version of admissibility only working with . For example, principalization of can be done by blowing up either or , but unless is integrally closed, is not -admissible.
(ii) A more classical but equivalent approach is to work with marked ideals instead of ideals and only 1-centers . In such a case, is defined to be -admissible if and the transform is defined by . This is the language used in [ATW20a] and [ATW20b], but once the general weighted centers were introduced in [ATW19], our definition seems more natural.
Our choice of admissible centers is natural, but one has to do some computation to check its correctness:
Lemma 3.1.13**.**
Let be a log manifold and an admissible blowing up. Then is a log manifold too.
The proof is straightforward – a model case is dealt with by an essentially toric computation and the general case follows by an appropriate choice of a covering. With enough care this method applies to the case when is an arbitrary log regular log scheme, see [ATWo20, Lemma 5.2.3], but we stick to the case of varieties for simplicity.
Exercise 3.1.14**.**
Complete details in the following sketch of a proof of Lemma 3.1.13
(i) The question reduces to the model case when , the log structure is given by a toric monoid and the center is of the form . Indeed, the blowing up along is the same as along , so we can assume that is a 1-center, and then étale locally we can just choose parameters such that is generated by vanishing of a few parameters. Consider the induced étale morphism to the model log scheme . Then étale descent and compatibility of blowings up and normalizations with the étale morphism imply that it suffices to study the blowing up of the source along the ideal generated by the same parameters.
(ii) In the model case the blowing up is described as follows:
(a) If , then the -chart is
[TABLE]
where for , for and is the saturation of the submonoid of generated by , and the elements . The log structure is extended by .
(b) If , then the -chart is , where for , for and is the saturation of the submonoid of generated over by the elements .
The lemma can also be proved by another standard approach, which is beneficial in some situations. We will not need this, so just outline the idea in a side remark.
Remark 3.1.15**.**
We will describe in terms of a log blowing up. First, working locally one increases the log structure by the direct summand . This produces a new log scheme , which is still a log manifold. Then the center becomes monomial and one considers the saturated log blowing up . The morphism is log smooth, hence is also a log manifold. In particular, it is normal and hence is also the normalized blowing up of . In particular, and the divisor defining the log structure of is obtained from that of by removing the strict transform of divisors corresponding to – on the -chart one has that . A simple computation shows that the obtained log scheme is indeed log smooth because locally the monoids split as , where the free summand is generated by the elements such that .
3.1.16. Functoriality of admissible blowings up
Let be a log manifold. A log smooth morphism induces a smooth morphism between the log strata, and hence a family of regular parameters at pulls back to a partial family of regular parameters at any point . This implies that the pullback of an admissible center is an admissible center. Log smooth morphisms do not have to be flat, so their compatibility with blowings up is not automatic. However, using charts of log smooth morphisms and the above explicit description of admissible blowings up one easily obtains the following
Lemma 3.1.17**.**
If is a log smooth morphism of log manifolds and is an admissible center on , then is an admissible on and (with the fiber product taken in the saturated category).
3.1.18. -admissible sequences
Given an ideal , by an -admissible sequence of blowings up or simply an -admissible sequence we mean a sequence of admissible blowings up with centers such that each is -admissible, where is the transform of and .
We will also need the following special case. Let be a natural number. If each is a -center, then is called an -admissible -sequence. By an -admissible -sequence we just mean any -admissible sequence whose centers are monomial without any further restrictions. Lemma 3.1.17 easily implies functoriality of -admissible sequences:
Lemma 3.1.19**.**
If is a log smooth morphism of log manifolds, is an ideal on with , and is an -admissible sequence (resp. -sequence) with centers , then the pullback is an -admissible sequence (resp. -sequence) with centers .
3.1.20. Log principalization
A principalization of is an -admissible sequence with . The main theorem of logarithmic desingularization theory is that there exists log principalization of varieties, which is functorial with respect to all log smooth morphisms and satisfies the re-embedding principle. We will formulate it later, when the correct stack-theoretic framework will be established.
3.1.21. Uniqueness of an ambient log manifold
As in the classical case, log varieties can be embedded into log manifolds and the minimal embedding is unique up to étale covers and is essentially controlled by the tangent space. This is formulated and proved in detail in [ATW20a, §7.1], and here is a short summary and an outline of the arguments.
Lemma 3.1.22**.**
Let be an equidimensional log variety, whose log structure is Zariski at a point . Let , and the dimension of the cotangent space of at , where is the log stratum at .
(i) There exists a strict closed immersion of a neighborhood of into a log manifold .
(ii) Locally at any strict closed immersion into a manifold factors through a closed submanifold of dimension . In particular, is the minimal embedding dimension locally at .
(iii) Any two embeddings , into manifolds of dimension locally at are dominated by an embedding into a log manifold étale over and .
(iv) Given an embedding any log smooth -scheme étale locally can be embedded into a log smooth -scheme so that .
Exercise 3.1.23**.**
Prove the above lemma along the following lines:
(i) If is a monoidal chart and are elements whose images span the cotangent space to at . Then the induced morphism is unramified at and hence locally at factors through a closed immersion into an étale -scheme .
(ii) The relative cotangent space to at is of dimension , hence the minimal embedding dimension is . If the dimension of is larger than , then the map of the cotangent spaces at has a non-trivial kernel and therefore a non-zero element of this kernel lifts to an element . This is a parameter, hence is a submanifold containing .
(iii) Apply (ii) to the embedding to obtain a minimal embedding which is étale over and .
(iv) Étale locally we can factor into a composition of an étale morphism and the projection onto . The projection simply lifts to and then is the pullback of an appropriate étale morphism .
3.1.24. Reduction to log principalization
Lemma 3.1.22 reduces desingularization of log varieties to principalization on log manifolds. This is similar to the classical argument and is worked out in detail in [ATW20a, §7.2], and we outline the argument here.
Assume that is a locally eqidimensional log variety which is generically log smooth (that is, is generically reduced and the log structure is generically trivial). Since étale locally any fs log structure is Zariski, by 3.1.22(i) there exists an étale cover such that admits a strict closed immersion into a log manifold . Multiplying some components of by we can assume that is of a constant codimension in . Then the principalization of blows up all generic points of the strict transforms of simultaneously, say at the blowing up . At this stage the strict transform of is a component of the center , and it is even a log manifold because the monomial part of the center is trivial at its generic points. Thus, is a projective birational morphism of log varieties with a log smooth source.
This resolution is independent of the embedding and its codimension by 3.1.22(ii) and (iii) and the re-imbedding principle satisfied by log principalization. Moreover, such a resolution is compatible with log smooth morphisms and hence the resolution of is compatible with both projections , and by étale descent the resolution descends to a projective birational morphism . Since the log manifold is an étale over of , the latter is also a log manifold, and hence is a resolution. Finally, compatibility of the obtained resolution with arbitrary log smooth morphisms is deduced from log smooth functoriality of the log principalization by use of 3.1.22(iv).
3.2. Log derivations and log order
3.2.1. The sheaf of log derivations
The last choice of the framework is as follows: we will use log -derivations on log manifolds (see [Tem22, §4.2.3]), so we will use the notation . Note that the sheaf of log -derivations is locally free of rank , and it can be described explicitly in terms of parameters. Naturally, this description splits into a classical part – derivations corresponding to regular parameters, and a logarithmic part – log derivations corresponding to monomials.
Exercise 3.2.2**.**
Assume that is a family of parameters at .
(i) Show that for there exists a unique log derivation such that and for . We will denote this derivation or just . Show that for any additive homomorphism there exists a unique log derivation such that for any . In particular, for monomials . This log derivation will be denoted .
(ii) Furthermore, show that is a free module, and if form a basis of (or even of ), then is a basis of .
3.2.3. Logarithmic differential operators
The algebra of log differential operators on is the -algebra generated by the -module . It is naturally filtered by submodules of operators of order at most . Locally its elements are polynomials in over of degree at most . For an ideal we will often consider its -th derivation ideal . Clearly, . The compatibility of these notions with log smooth morphisms is as follows:
Lemma 3.2.4**.**
Let be a log smooth morphism of log manifolds and . Then,
(i) The sequence
[TABLE]
is an exact sequence of free -modules, and hence it splits locally.
(ii) If is an ideal on and , then for any .
The first claim follows from an explicit description of log derivations of log smooth morphisms (the description we gave for log manifolds extends to morphisms). The second claim follows because and hence by Leibnitz rule.
3.2.5. Log order
Using the sheaf one can define a logarithmic analogue of the usual order. Namely, given an ideal and a point the log order of at is the minimal number such that . If no such exists, then we set . This happens if and only if the differential saturation is non-trivial at , that is, .
Example/Exercise 3.2.6**.**
(i) Each monomial has infinite logorder because for any log derivation .
(ii) Formally locally can be presented as with and is the minimal such that .
(iii) An element is a regular parameter (resp. a unit) at if and only if its log order at equals 1 (resp. 0).
(iv) and .
Remark 3.2.7**.**
(i) The above exercise implies that the logorder at is computed using only the classical derivations (or it can be computed using the submodule generated by ), while the derivations are irrelevant. However, depends on the choice of parameters, and working with the whole avoids choices.
(ii) In addition, we want to stress that modules behave badly under transforms with respect to admissible blowings up – sometime they are too small. For example, if with the log structure , then there are no regular parameters at the origin (the log stratum is 0-dimensional) and . However, the preimage of in the monomial blowing up contains points with the log structure generated by , see [Tem22, Example 4.1.5]. Such a point also has a regular parameter and is one dimensional (and depends on the choice of the parameters).
3.2.8. Maximal log order
The maximal log order of an ideal is
[TABLE]
The definition of (maximal) log order we gave above follows [ATW20a]. However, it agrees with the multiplicity of centers and the induced primary invariant of ideals in spirit of §2.1.2(3).
Exercise 3.2.9**.**
(i) The multiplicity of an admissible center equals for any .
(ii) For any ideal on one has that equals the maximal value of such that is contained in a center of multiplicity .
3.2.10. Relation to the classical order
In fact, the log order has the following very simple geometric interpretation: the log order of an ideal is just the order of its restriction onto the log stratum.
Lemma 3.2.11**.**
Let be a log manifold, a log stratum, a point and an ideal on . Then .
Exercise 3.2.12**.**
Observe that preserves monomial ideals, hence a natural restriction map arises. Show that it is surjective and deduce that . In particular, if and only if , yielding the lemma.
Since log smooth morphisms induce smooth morphisms of log strata, the lemma and the usual smooth functoriality of the order imply log smooth functoriality of the log order:
Corollary 3.2.13**.**
If is a log smooth morphism of log manifolds, is an ideal on with the induced map , and , then .
3.3. Log order reduction
Similarly to the classical algorithm, log principalization works inductively and the primary loop decreases the maximal log order. The main difference is that there exist non-zero ideals of infinite log order. We will see that this can be remedied by a single monomial blowing up. Once the log order is finite, a direct analogue of the classical theory works, including log analogues of maximal contact and coefficient ideals.
3.3.1. Log order reduction
For any by a log order -reduction we mean an -admissible -sequence such that .
Remark 3.3.2**.**
(i) In [ATW20a] one uses an equivalent definition in the style of the classical order reduction, which encodes in the notion of marked ideals (only with a finite ) and uses only centers of multiplicity 1 or infinity, -admissibility and -transforms.
(ii) Note that if and only if there exist no -admissible -centers. Thus, a log order -reduction is just a maximal (with respect to truncations) -admissible -sequence.
(iii) The most natural and basic case is when , as in the classical algorithm we call it the maximal order case. This is the case when the maximal contact theory applies, but it is necessary to deal with the general case because of inductive reasons.
3.3.3. Monomial hull
The monomial hull of an ideal on is the minimal monomial ideal containing . By definition, it is the minimal monomial -admissible center.
Lemma 3.3.4**.**
For any ideal on a log manifold the differential saturation coincides with the monomial hull: .
Since any monomial ideal is preserved by and hence is differentially saturated, one has an inclusion . The fact that it is an equality can be checked formally-locally. One proof is given in [ATW20a, Theorem 3.4.2], we outline another one close in spirit to the argument in the proof of the first part of [ATW20b, Proposition 3.4.3]. The following exercise is rather difficult, so our hint is in fact a sketch of the whole argument.
Exercise 3.3.5**.**
Let be a sharp toric monoid, a field and . Let be the algebra of differential -operators generated by and with . Then for any the ideal coincides with the monomial ideal generated by the elements . (Hint: again, the inclusion is clear, so it suffices to show that contains each . Let be the subalgebra of operators which are also -logarithmic, that is, the subalgebra generated by the elements and . Any monomial is an eigenvector of any monomial operator
[TABLE]
Show that if is a finite sum, then there exists a monomial operator which has different eigenvalues with respect to all non-zero monomials of , and deduce that already the -linear span of the elements contains all monomials . Then remove the finiteness assumption by continuity: with and the above argument works up to a correction term lying in because . Finally, applying the derivations one clears off the powers of and obtains that each lies in .)
From Lemmas 3.3.4 and 3.2.4(ii) we obtain that the monomial hull is functorial.
Corollary 3.3.6**.**
If is a log smooth morphism of log manifolds, is an ideal on and , then .
3.3.7. Making log order finite
Non-triviality of the monomial hull detects whether the maximal log order is infinite, so it is natural to expect that blowing it up makes finite.
Lemma 3.3.8**.**
Let be a log manifold and an ideal with the monomial hull . Let be the -admissible blowing up along and let be the transform of . Then .
Indeed, the monomial blowing up is log étale, hence by Corollary 3.3.6 coincides with the invertible ideal and . Therefore, and by the minimality of the monomial hull of is trivial: . The lemma follows.
There is a more concrete way to prove the lemma. It is very instructive for understanding the mechanism of cleaning off the monomial part, so we outline it below.
Exercise 3.3.9**.**
Let be the image of , let be generators of and let be their expansions in . Then by Exercise 3.3.5, is generated by all monomials with a non-zero . Show that the transform of on the -chart of the blowing up of along is of order bounded by , and hence this blowing up achieves that the order of the transform of is finite.
3.3.10. Coefficient ideals
Once is finite we can define the (logarithmic) coefficient ideal of to be the weighted sum , where we use the following homogenized definition of the sum of ideals with a tuple of weights :
[TABLE]
Remark 3.3.11**.**
Homogenized sums are introduced in [ATW20b, §5.1.7]. In the usual definition, which is also used in [ATW20a, §5.2(1)], one considers the smaller weighted sum ideal , where . By the same reason as was mentioned in Remark 2.3.4, working with the two versions is equivalent, though technically it might be more convenient to use the homogenized version.
3.3.12. Maximal contacts
Assume that is an ideal on a log manifold and . A submanifold is called a maximal contact to if locally at any with it is of the form with . Clearly, maximal contacts exist locally at any point with : since , there exists such that contains a unit of . This element is of log order 1, hence it is a regular parameter at and is a log manifold in a neighborhood of .
3.3.13. The key results
The theory of maximal contact is summarized in the following two theorems. Here we only formulate them and discuss. The arguments are very close to their analogues in the classical algorithm and will be outlined later. The first theorem establishes induction on dimension when constructing log order reduction:
Theorem 3.3.14**.**
Assume that is a log manifold, is an ideal on and is a maximal contact to . Then an admissible -sequence of blowings up with centers is -admissible if and only if for any we have that , where is the strict transform of , and the induced admissible -sequence with centers is -admissible.
In view of Remark 3.3.2(ii), log order -reductions of are in a natural one-to-one correspondence with log order -reductions of . This reduces the log order reduction on in the maximal order case to a log order reduction problem on a hypersurface, but the latter does not have to be maximal because the log order of can be strictly larger than . In fact, it can even be infinite.
The second theorem ensures that the obtained log order reduction on is independent of the local choice of a maximal contact and hence is functorial and globalizes. It is an étale refinement of the claim that for any pair of maximal contacts, there is an isomorphism of formal completions of along them which respects the coefficient ideal.
Theorem 3.3.15**.**
Assume that is a log manifold, is an ideal on with and are two maximal contacts to . Then there exists a pair of étale covers , such that , and for any -admissible -sequence its pullbacks with respect to and coincide.
Remark 3.3.16**.**
In the classical principalization there are two ways to prove independence of maximal contact. Włodarczyk’s homogenization method, which is transferred to the log setting in the above theorem, and Hironaka’s trick with a delicate definition of equivalence of marked ideals, see [BM08]. Hironaka’s trick can be extended to the log setting too, as was worked out in [ATW20b, §7.2].
3.3.17. The non-maximal order case
The above section shows how one deals with the maximal order case. It remains to construct a general log order -reduction using the maximal order case. If this is done by splitting ideals into the product of a clean part of a finite log order and an invertible monomial ideal and is based on the following observation:
Lemma 3.3.18**.**
Let be a log manifold with an ideal , where is of maximal log order and is invertible monomial, and let . Assume that is an -admissible -sequence with centers , and let denote the transform of . Then the same sequence of morphisms underlies the -admissible -sequence with centers and its transform is of the form , where is invertible monomial.
Indeed, the claim reduces by induction to a sequence of length one, and then , where is the exceptional divisor.
In view of the lemma, one simply applies the sequences produced by the maximal order case of the log order reduction of the clean part with and replaces in this sequence the -centers, -centers, etc. by the associated -centers. This collects an invertible monomial factor, which can be removed in the end by a single blowing up.
3.4. The lacuna
At first glance we already have all necessary ingredients to combine them into a working algorithm, but there is left just one more case which we did not discuss… Namely, what happens for the log order -reduction if is infinite? Our method in the infinite order case is to blow up the monomial hull , but here the center must be a -center. And sometimes is a -center, but sometimes it is not… At first glance one might hope that the obstacle is not serious, and another method should work, so we are going to start with simplest examples which illustrate that one cannot go ahead without modifying the basic framework. Also, we will use this oportunity to make some comparison with the classical algorithm.
Example 3.4.1**.**
We will principalize ideals on with the log structure . By we denote the origin.
(i) Let . In this case, , is a maximal contact, and the ideal is monomial and hence it is principalized by blowing it up. By Theorem 3.3.14 is principalized by the single blowing up along . For comparison notice that the classical algorithm without log structures would use the same maximal contact and coefficient ideal, but would “blow up twice”, so the centers would be and .
(ii) Let . In this case, , is a maximal contact, and the ideal is monomial and principalized by blowing up the -center . Hence is principalized by the single blowing up along . The classical algorithm acts in the same way in this case. The only difference is that it can also take as the maximal contact, but this is forbidden in the logarithmic case.
(iii) Finally, let . Then , is a maximal contact, and the ideal is monomial and principalized by blowing up the center , which is not a 2-center. We are stuck. The classical algorithm acts completely differently in this case, as the usual order is 1 and the classical maximal contact is but not .
3.4.2. Consequences of log smoothness
In fact, the examples (ii) and (iii) are related by a log-étale cover. Namely, consider and as in (iii), the Kummer covering of and the ideal . By the log smooth functoriality, the principalizations of and must be compatible, and the principalization of is done by blowing up . This leaves us no choice – the principalization of should be the blowing up of the center , whatever it means, such that as fs log schemes. Fortunately, functoriality considerations not only show that the method is in a conundrum in the basic framework, it also indicates how the framework should be extended:
Remark 3.4.3**.**
(i) First, it is clear that should be the quotient of by the action of , and since the schematic quotient is not log smooth we must take a stack-theoretic quotient – this is the only way to obtain a (non-representable) modification such that in the fs category.
(ii) Second, this also suggests a way to formalize the notion of centers of the form , where is monomial. Similarly to the blowings up, they are well defined after adjoining enough roots of monomials, so we just should work Kummer étale locally (see [Tem22, §4.4]) and then any monomial center becomes a -center for any natural number . For ideals this is even a simpler formalism, which does not require to introduce stacks (but makes sense for stacks as well).
In the next section we will extend the logarithmic framework along these lines by switching to log orbifolds and introducing Kummer ideals and blowings up, and then all constructions of this section will immediately extend and give rise to a logarithmic principalization algorithm.
3.4.4. Monomial democracy
To conclude the section we deduce from the log smooth functoriality a principle which explains most of the differences between the classical and the logarithmic algorithms. If is an embedding of toric monoids, then the homomorphism is log smooth, and the functoriality implies that principalization of on should pull back to principalization of on . In particular, the information about arithmetic properties of a monomial , such as the knowledge whether is a square in , cannot be used by a log smooth functorial algorithm. Informally speaking, this means that a monomial “does not know” in which monoid it lives, and this can be also phrased as the following “monomial democracy” principle in the style of Orwell: all monomials are equal. In particular, the principle explains why, unlike the classical algorithm, we allow any set of monomial generators in the definition of admissible centers and why the log order of monomials has to be infinite. Loosely speaking, the algorithm deals with the regular parameters by the classical methods, and it does not distinguish the monomial parameters – just forms the monomial hull and blows it up at once.
Note for completeness that other orders are possible if one only constructs a smooth functorial method. For example, one orders monomial parameters by in a weighted resolution with boundary, see [Wło, Remark 2.3.14].
4. The logarithmic algorithm
Our goal now is to extend the framework by including stacks and Kummer ideals and blowings up, and then to finally describe the log principalization algorithm.
4.1. The framework
To extend the framework we have to switch to stacks and develop a bit the technique of Kummer étale localization.
4.1.1. Geometric objects
We will work with the 2-category of fs logarithmic DM stacks of finite type over , and such an will be called a log orbifold if it is log smooth. Thus log manifolds are representable log orbifolds, and log orbifolds will play the role of manifolds in the realm of log DM stacks. Log smooth substacks will be called suborbifolds and their ideals suborbifold ideals.
When working with stacks the default topology is étale, so and its ideals, the sheaves , etc., are étale sheaves. This is based on the fact that in the case of schemes , etc. are, in fact, étale sheaves (even flat sheaves) and hence their formations extend to DM stacks.
Remark 4.1.2**.**
(i) Recall that the usual definition of log structures is étale local hence extends to DM stacks. Alternatively, one can define it via a descent: if a stack has a smooth presentation and , then the log structure on is the same as a log structure on and an isomorphism of pullbacks satisfying the usual cocycle condition. The latter definition also applies to arbitrary Artin stacks.
(ii) One can consider wider or narrower categories, the main restriction is that they should be closed under Kummer blowings up defined below. In particular, one can work with arbitrary Artin stacks or one can restrict the setting to DM stacks with finite diagonalizable inertia, as one does in [ATW20a]. Our choice is the same as in [ATW20b], it is the most general case when one can still work with the étale topology and all details of the proofs are literally the same.
4.1.3. Kummer ideals
Kummer ideals are just ideals of the structure sheaf in the Kummer étale topology. For any log stack by we denote the category of log stacks over such that the morphism is Kummer étale. Declaring surjective morphisms to be covers we obtain a Grothendieck topology on . The structure presheaf defined in the usual way by is in fact a sheaf by Kummer descent results of Niziol, see [Niz08, Proposition 2.18]. A Kummer ideal is an ideal . Such ideals are subject to all usual operations: sums, products, etc. Also, the sheaves of differential operators are Kummer so one can derive ideals and we will use the same notation .
Any ideal generates the Kummer ideal and by Kummer descent, the restriction of onto is . In this case we will say that the Kummer ideal is an ordinary ideal and by an abuse of notation will denote it also by . A Kummer ideal is called monomial if it is generated by monomials Kummer-locally.
Remark 4.1.4**.**
In [ATW20a] one also assumes that the ideal is finitely generated, but this will not make any difference. We will only consider usual ideals and admissible centers, which are combined from finitely generated ideals by arithmetic operations and saturation. The output of saturation is usually not a finitely generated Kummer ideal, but it is still easily controllable.
Example/Exercise 4.1.5**.**
(i) If is a global monomial and is invertible on (which is automatically the case when the characteristic is zero), then the ideal is a -th power of the uniquely defined invertible Kummer monomial ideal which we denote . Indeed, Kummer-locally this ideal is generated by a -th root of .
(ii) Any finitely generated Kummer monomial ideal is étale-locally of the form for monomials .
(iii) More generally, for a monomial ideal let be the ideal generated by -th roots of the monomial generators of . It is a monomial Kummer ideal whose -th power is integral over .
(iv) Give an example of a finitely generated monomial ideal whose saturation as a Kummer ideal is not finitely generated. (Hint: one can take with the log structure and . Then its saturation in the Kummer topology contains all Kumer ideals of the form with and hence is not finitely generated.)
4.1.6. Admissible centers
The definitions are the same as for log schemes. A 1-center is a Kummer ideal of the form , where is a suborbifold ideal (see 4.1.1) and is a finitely generated monomial Kummer ideal. A -center is of the form , where is a 1-center. Any non-monomial center is a -center for a unique , while any monomial center is a -center for any by Exercise 4.1.5(iii). In fact, one can even describe in terms of saturation and arithmetic operations on ideals, without the need to use the more complicated integral closure operation, see [ATW20a, Lemma 4.3.2(1)].
Exercise 4.1.7**.**
Show that . (Hint: the claim is Kummer local, hence it suffices to consider the case when is a log manifold and is a monomial ideal. Then increasing the log structure by , where , the claim reduces to the standard lemma that a monomial ideal is saturated if and only if it is integrally closed.)
4.1.8. Kummer blowings up: two approaches
There are a few possible definitions. A first construction was introduced in [ATWo20, §5.4] and used in the first logarithmic principalization algorithm in [ATW20a]. This construction followed the logic of Remark 3.4.3(1) – one considers an appropriate Galois Kummer covering on which the center becomes a usual ideal, blows it up, and then divides by the Galois group. The subtle point is that in order to do this independently of the covering the quotient should be a mix of a stack-theoretic and schematic quotients (a partial coarsening of the stack-theoretic quotient). A simpler and more general definition that uses stack-theoretic Proj construction was suggested by Rydh soon after [ATW20a] was written, and this is the definition we will work with below. It was used in [ATW20b] and it can be generalized to arbitrary weighted blowings up easily. Since this definition was studied in chapter [Abr], we just quickly recall the main points.
4.1.9. The stacky Proj construction
Let be a scheme and let be a finitely generated graded -algebra. Then is a -equivariant morphism with the action on being trivial. The vanishing locus of the irrelevant ideal is the set of fixed points. In particular, the action on has stabilizers of the form and the usual scheme-theoretic quotient exists (there is no need to use GIT). The usual Proj construction associates to the scheme-theoretic quotient and forgets the information about the stabilizers. In the realm of stacks it is natural to consider the finer stacky Proj construction which outputs the stack-theoretic quotient . By definition, is the coarse moduli space of .
4.1.10. Charts and stabilizers
The stacky Proj construction is local on the base, and it is glued from charts which refine the charts of the usual Proj stack-theoretically. Details are in chapter [Abr], here we only recall them briefly.
Exercise 4.1.11**.**
Assume that and is a finitely generated graded -algebra, and let , where .
(o) For any homogeneous the -chart is an open substack of and for homogeneous elements if and only if the radical of coincides with the irrelevant ideal .
(i) Consider the -graded ring , whose -th homogeneous component is isomorphic to with any . Then , in particular, its inertia is bounded by . In addition, we see that the usual and the stacky Proj constructions coincide in the classical case when is generated in degree 1.
Example 4.1.12**.**
(i) If is an ideal on and , then is the usual blowing up of along . Blowing up we obtain the same morphism , but with the exceptional divisor multiplied by .
(ii) Using the stacky Proj we can also blow up an analogue of . Namely, consider with where the brackets denote the upper rounding to an integer. Then is the root stack obtained from by extracting -root from the exceptional divisor . This root ideal should be viewed as the exceptional divisor of the blowing up along and, indeed, is the universal morphism such that the pullback of is the -th power of an invertible ideal, though this condition should be stated carefully, see [QR, Theorem 3.2.11 and Corollary 3.2.12].
4.1.13. Extension to stacks
An important feature of the stacky Proj construction is that it extends to stacks. The usual Proj construction extends by standard étale descent, but dealing with the -quotient requires an additional argument, see chapter [Abr].
4.1.14. Kummer blowings up
Given a log DM stack , let denote the restriction of sites. Thus, given a Kummer ideal on by we denote its restriction on . For example, if is affine, then is just the ideal of . Now, we define Kummer blowing up by , where is the Rees algebra of . Clearly, when is a usual ideal, this reduces to the usual definition of a normalized blowing up. The Kummer ideal is an invertible (usual) ideal because, as in the classical case, its restriction onto the -chart , where , is the invertible idea . In particular, the exceptional divisor is defined as usual, and if the blowing up is -admissible, that is, , then the transform is defined.
Finally, as in §3.1.11 we provide with the log structure induced by the divisor , where is the blowing up and defines the log structure on (the construction of the log structure from a divisor is compatible with étale morphisms and hence extends to DM stacks). The log DM stack is called the blowing up of along the Kummer ideal and denoted .
4.1.15. Admissible blowings up
We will only use the above construction when is an admissible center. The main properties of this operation are that the source is log smooth and the blowing up is compatible with log smooth morphisms:
Theorem 4.1.16**.**
Let be a log orbifold, let be an admissible Kummer center on and let .
(i) The blowing up is a proper birational morphism with finite diagonalizable relative inertia, which is an isomorphism over the complement of .
(ii) is a log orbifold.
(iii) Log smooth functoriality: if is a log smooth morphism, then , where the product is taken in the fs category.
(iv) Étale descent: if is a strict étale cover and the pullbacks of to coincide, then is the pullback of an admissible Kummer center on and is the saturated pullback of the admissible blowing up .
Part (i) of the theorem holds for any Kummer blowing up. Parts (ii) and (iii) are proved similarly to Exercise 3.1.14 – using étale descent one reduces the claim to the case of a model scheme and admissible center and then performs an explicit (essentially toric) computation. In view of part (iii), it suffices to descend the center in part (iv). The claims is étale local on hence we can assume that it possesses a chart . Then and taking large enough we achieve that is an ideal on . By étale descent it is the pullback of an ideal on , which is easily seen to be an admissible center, and therefore it gives rise to an admissible Kummer center on .
Now, let us illustrate how the functoriality from (iii) works in a concrete case, how the stacky structure disappears for Kummer covers and how this is related to saturated pullbacks. In fact, all this is seen very well already on the log manifolds and ideals from Example 3.4.1.
Example 4.1.17**.**
(i) with the log structure generated by and . The -chart of the blowing up is computed as usual: with and the log structure generated by .
(ii) with the log structure generated by and . By the chart description in Exercise 4.1.11 the -chart of is described as follows. The Rees algebra is the graded subalgebra of the graded algebra and the -chart corresponds to the -chart. So, is the -quotient of , where
[TABLE]
We see that the new coordinates are and , quite analogously to coordinates of admissible blowings up, and acts on both and by negation because they are of grading 1. In particular, the coarse quotient with the log structure is not log smooth, while the stack theoretic refinement is log smooth (and even smooth).
(iii) Define a morphism by . Then and indeed is easily seen to be the saturation of . At first glance it looks paradoxical that is a non-representable morphism but its base change is representable, as this could not happen for étale covers, but here is log étale and the base change is saturated. In fact, in this case the non-saturated base change has a non-trivial stacky structure (the root stack associated to the square root of ), but its saturation is a scheme.
4.2. The algorithm
4.2.1. Results of §§3.2–3.3
Theorem 4.1.16 accomplishes the construction of the logarithmic principalization framework. Once this is done, almost all results and proofs of §3 extend almost verbatim because local proofs are étale-local. In particular, absolutely in the same way one defines -admissible sequences (of Kummer blowings up), principalization, log order and log order -reduction, maximal contact and coefficient ideal and establishes analogues of Theorems 3.3.14 and 3.3.15, Lemmas 3.3.4, 3.3.8, 3.2.11, etc.
4.2.2. Log order reduction
The following definitions are the same as in the classical case.
Definition 4.2.3**.**
(i) A log order -reduction of an ideal on a log orbifold is an -admissible -sequence such that . A log order reduction on the category of log orbifolds over associates to any as above a log order reduction .
(ii) A log order reduction on the category of log orbifolds over is log smooth functorial if for any as above and a log smooth morphism the log order -reduction of is the contracted pullback of the log order -reduction of , that is, is obtained from by omitting all trivial blowings up.
(iii) satisfies the re-embedding principle if for any closed immersion of log orbifolds of constant codimension and an ideal on such that the sequence is obtained by pushing forward (that is, one blows up the same Kummer centers on the strict transforms of ).
Now we can formulate the log order reduction theorem. It is the main result of the theory, which implies the log principalization and log desingularization theorems.
Theorem 4.2.4**.**
On the category of log orbifolds over there exists a log order reduction method which is log smooth functorial and satisfies the re-embedding principle.
The log principalization is defined similarly, but it depends only on and (but not on ), one is allowed to use arbitrary -admissible centers and obtains in the end (that is, ). The log smooth functoriality and the re-mebedding principle are literally the same. The log principalization theorem is an immediate corollary of Theorem 4.2.4 obtained by taking .
Theorem 4.2.5**.**
On the category of log orbifolds over there exists a logarithmic principalization method , which is log smooth functorial and satisfies the re-embedding principle.
Finally, the arguments from §3.1.24 imply the following logarithmic desingularization result.
Theorem 4.2.6**.**
There is a logarithmic desingularization method which to any generically smooth and locally equidimensional log DM stack of finite type over associates a birational morphism with a log smooth , and for any log smooth morphism one has that in the fs category.
Remark 4.2.7**.**
(i) The morphism almost always is not representable even when is a variety, in particular, it is not projective. However, it belongs to the class of morphisms which is a natural non-representable extension of the class of projective morphisms – the class of global quotients of projective morphisms. In particular, the relative coarse space is projective over . However, does not have to be log smooth and can have quotient singularities.
(ii) One can canonically resolve , and even do this on the level of stacks by the so-called destackification procedure. Namely, there is a smooth functorial way to construct a further modification such that the relative coarse space is log smooth and the morphism is projective, see [Abr]. This step cannot be done log smooth functorially.
4.2.8. The log order reduction algorithm
Our proof of Theorem 4.2.4 consists of constructing a required algorithm by induction on dimension and checking that it satisfies all required properties. So, assume that the algorithm is already constructed when and let us construct it when . The input data consists of an ideal and a natural number . The output will be an -admissible -sequence
[TABLE]
where the first and the last arrows are single monomial blowings up, and the arrows encode a whole -admissible -sequence of non-monomial blowings up and the following conditions hold: the final transform satisfies , each intermediate transform splits as , where is invertible monomial and is finite, and one has that .
The initial cleaning step. This step makes the log order finite and consists of the single blowing up along the -center , where . Clearly, is the integral closure of , hence the blowing up has the same effect and the transform is of finite log order by Lemma 3.3.8. In particular, is trivial.
The regular step. This step accepts with as an input and outputs a -sequence , which is associated in the sense of Lemma 3.3.18 to the -sequence which reduces the log order of . By Lemma 3.3.18 the sequence outputs with .
The -sequence is constructed as follows. Working étale locally we can assume that there exists a maximal contact to and by induction assumption the ideal possesses a log order -reduction with centers . We define to be the sequence with centers , where is the preimage of under the surjection . Thus, if locally on we have that and the center of is , then the center of is and the corresponding center of is .
By Theorem 3.3.14 the sequence is indeed a log order -reduction of , and by Theorem 3.3.15 it is independent of choices and descends from the étale local construction.
The final cleaning step. This is trivial – we just repeat the cleaning step, but this time , so we just blow up the -center . Thus, and is as required.
4.2.9. Justification of the algorithm
It is clear from the construction that the obtained sequence is a log order -reduction for – it first makes the log order finite, then reduces the log order of the clean part below , and then removes the invertible monomial part. Compatibility of this algorithm with log smooth morphisms follows from the fact that all basic ingredients of our construction are log smooth functorial, as was stated in Corollaries 3.3.6 and 3.2.13, Lemma 3.2.4(ii), etc. Finally, it suffices to check the re-embedding principle étale-locally, so we can assume that is a closed immersion of log orbifolds of pure codimension one and is the preimage of in . Then and is a maximal contact to , so by the regular step of the algorithm is the pushforward of , which is precisely what is claimed by the re-embedding principle.
Remark 4.2.10**.**
We already noted that the log principalization is obtained by applying the log order reduction with . Similarly to the proof of log order reduction, one can principalize just a bit faster by iteratively applying maximal order reductions. This might look more natural as there is no need to do the final cleaning step, but the drawback is that such an algorithm does not satisfy the re-embedding principle.
4.2.11. The invariant
We constructed the log order reduction as a composition of blowing up sequences , which can be parameterized by the strictly decreasing sequence . In particular, the first stage is numbered by , the last stage – by a number which is strictly smaller than and will be replaced by 0 for convenience, and all regular steps are numbered by a finite number . The first and last steps are single monomial blowings up, and each regular step corresponds to the log order -reduction of . We define the invariant of a separate blowing up of by induction on as follows: the blowing up of the first step (if non-trivial) has invariant , the blowing up of the last step (if non-trivial) has invariant , the blowings up of the -th regular sequence have invariant , where denotes the invariant of the corresponding log order -reduction sequence of .
Each non-normalized invariant is of the form , where , and , and by induction on the length of the invariant and the fact that strictly decreases, we obtain that each separate blowing up in the sequence indeed decreases the value of the invariant. Hence the same is also true for the normalized invariant , where .
Remark 4.2.12**.**
(i) The algorithm consists of nested loops: the outer loop reduces the value of the logorder , the next loop reduces the order of the coefficient ideal (and its transforms) on the first maximal contact (and its transforms), etc. The invariant just parameterizes our location in this sequence of loops.
(ii) The non-normalized invariant of the first blowing up is always of the form , where is the log order of the -iterated coefficient ideal restricted to the -th iterated maximal contact.
4.2.13. Comparison with the classical algorithm
The classical principalization algorithm is more complicated and slow, but uses simpler basic operations. Here are main differences between the algorithms:
-
The combinatorial step of the classical algorithm is rather heavy and uses the order of exceptional components. In our case its analogue is the single blowing up at the final cleaning step.
-
The classical algorithm has to separate the boundary each time it passes to a maximal contact. This happens because the maximal contact may have a bad intersection with the boundary. This separation is done by a separate loop on the number of boundary components, so the actual normalized invariant of the regular steps of the algorithm is of the form . Instead of this the logarithmic algorithm chooses maximal contact adopted to the log structure.
-
The classical algorithm uses both regular and exceptional parameters to compute the order. Because of this the clean part can be already resolved, while the order of the whole is still larger than . This forces one to work with the companion ideal rather than just the clean part. In the logarithmic algorithm, one can safely ignore the monomial factor.
) The classical algorithm never starts with the initial cleaning step and its invariant is never (unless ), but an analogue of this step is applied when the restriction of onto the maximal contact vanishes and hence its order is infinite. In the classical algorithm, this situation is also encoded by the infinite degree finishing the invariant string. This situation occurs if and only if and then the single blowing up of principalizes .
4.3. Other logarithmic frameworks
In brief, the logarithmic resolution theory works in any context of logarithmic spaces with large enough sheaves of derivations – sufficient to distinguish regular and logarithmic parameters, and the obtained methods are functorial with respect to log regular morphisms. This includes various categories of analytic spaces with log structures, and schemes or formal schemes with enough log derivations.
5. Resolution of morphisms
The goal of this section is to outline the results of [ATW20b], in which logarithmic desingularization methods were generalized to the relative setting and a functorial resolution of morphisms between log schemes was obtained. As earlier, an important part of this work is to set up the framework. In two words, one studies principalization on relative log orbifolds , with a log regular , and one uses the sheaf of relative log derivations to define the relative log order, maximal contacts and coefficient ideals. Using this language one generalizes the principalization algorithm straightforwardly. So, our exposition will be very fast and we will often just mention which argument from §3–4 should be adjusted in the relative case.
The only really new feature of the relative situation is that base changes should be incorporated into the algorithm. On the one hand, the algorithm is functorial with respect to any base changes, so it is indeed an honest relative algorithm. On the other hand, the algorithm can fail over a given , and it succeeds only after a large enough base change . The proof of this is based on a new tool – the monomialization theorem, see [ATW20b, Theorem 3.6.13]. As earlier, for simplicity we will consider the case when is of finite type, and only in the end make a few comments about more general settings.
5.1. Framework
Constructing the relative framework occupies Sections 2 and 4 in [ATW20b] and is rather heavy. To a large extent this is caused by considering log regular morphisms not necessarily of finite type. In such a case one has to require of the sheaf to be suitably “large”. In our case of DM stacks of finite type over a field, the morphisms are automatically log smooth and the sheaf is locally free of the expected rank, so the situation simplifies. Still, we prefer to briefly mention all needed ingredients and just provide references to [ATW20b].
5.1.1. Geometric objects
Naturally, a basic object this time is a morphism of fs log DM stacks of finite type over . In principle, we aim to construct a purely relative algorithm, which should apply to any target, but for technical reasons, we have to restrict to the case when is log smooth, see [ATW20b, Remarks 1.2.9 and 3.1.11]. Since in any case the algorithms succeed only after a large enough base change, essentially this just restricts us to the case of a generically log smooth target, see also [ATW20b, Remark 1.2.9]. For simplicity of exposition, we assume that is a log manifold (i.e. it is also a scheme), though using étale descent on the base one can easily extend everything to the case when is a stack.
There are two classes of morphisms between morphisms we will consider: 1) just -morphisms (the same target), 2) base change morphisms (or diagrams) , where and the product is taken in the fs category. In case (2) we will say that is a base change morphism.
We say that is a relative orbifold if it is log smooth. If, in addition, is representable we call it a relative manifold. As usual, resolution of an arbitrary morphism will be obtained by embedding it étale-locally into a relative manifold and principalizing on the relative -manifold . We will use the sheaf of relative log derivations .
5.1.2. Sharp morphisms
Some arguments in [ATW20b] apply only to log smooth morphisms of a special form that we will introduce now. We say that a morphism is sharp at a point if for a geometric point over and the homomorphism is injective. A typical example of a non-sharp log smooth morphism is a log blowing up, see [Tem22, Example 4.1.5]. So, the following fact is not so surprising.
Exercise 5.1.3**.**
Let be a morphism of log varieties over with a log smooth target. Show that there exists a log blowing up such that the base change is a sharp morphism. (Hint: first, solve such a problem for a chart of with an injective (note that the monoids do not have to be sharp). Then use quasi-compactness of and the facts that log blowings up form a filtered family and, in case of log smooth varieties, can be extended from an open subvariety because the closure of a monomial subscheme is monomial.)
Remark 5.1.4**.**
In fact, changing the base via a log blow up one can achieve much more: one can achieve that is integral in the sense that for each with , and the homomorphism is integral. The latter notions have a few equivalent formulations for which we refer to [Kat89, Proposition 4.1]. In particular, it implies that is flat (assuming is log smooth, see [Kat89, 4.5]) and set theoretically splits as , where denotes the image of in . Existence of such a log blowing up is a combinatorial analogue of the flattening theorem of Raynaud-Gruson, though its proof is rather elementary, see [ATW20b, Proposition 3.6.11(i)] and references there. We will not use the integralization theorem in these notes.
5.1.5. Parameters
Recall that we have defined in [Tem22, §5.2.10] the notion of log fibers of a morphism . The general definition uses the stacks , but for a sharp the log fibers are nothing else but the log strata of the fibers of , see [Tem22, Exercise 5.2.11].
Let be a log smooth morphism of log varieties, and assume that the log structures are Zariski at and . By a family of relative parameters of at we mean a family , where maps to a regular family of parameters at of the log fiber (which is smooth by the log smoothness assumption), and map to a basis of . We call and the regular and the monomial parameters, respectively.
5.1.6. Formal description
Sometimes sharp log smooth morphisms are more convenient to work with, in particular, because they possess a simple formal description.
Lemma 5.1.7**.**
Assume that is a log smooth morphism of log varieties, is sharp at a point , and the log structures of and are Zariski at and . Fix compatible monomial charts and , fix fields of definitions and , and fix a family of regular parameters. Then .
As in many similar statements, the natural homomorphism induced by the choices of parameters and fields of definition is easily seen to be surjective (it induces surjective homomorphisms of residue fields and cotangent spaces), and the injectivity follows by comparing relative dimensions. See the proof of [ATW20b, Lemma 2.3.14] for details.
5.1.8. Suborbifolds
A relative suborbifold of is a strict closed substack which is log smooth over . As in the absolute case, étale locally suborbifolds are given by vanishing of regular parameters. The argument is essentially the same with log fibers used instead of log stratas. The following exercise is an advertisement of stacks . For sharp morphisms one can solve it straightforwardly using only the “low tech” of log schemes and charts, but the general solution which uses the “high tech” of stacks is simpler.
Exercise 5.1.9**.**
Show that if is a log smooth morphism of log smooth varieties and is a relative -submanifold, then for any point Y there exists regular relative parameters of such that locally at . (Hint: use that and are log smooth over and their log fibers over are the fibers over .)
5.1.10. Kummer centers and blowings up
A relative -center is an ideal of the form , where is a suborbifold ideal (i.e. is a relative suborbifold of ) and is a monomial Kummer ideal. Since is a log manifold, is a log orbifold over and is its log suborbifold. In particular, is a usual -center in the sense of §4.1.6 and the Kummer blowing up along the relative center to be the Kummer blowing up along as defined in §4.1.14. This trick saves us some work in the relative case, but one still has to use that the center is in a special position with respect to in order to prove the following
Lemma 5.1.11**.**
Assume that is a relative orbifold with a log smooth , and is a relative -center on . Then is a log orbifold too.
Using étale descent the proof reduces to an explicit chart computation analogously to the argument outlined in Exercise 3.1.14. The necessary refinement is that the model case now is of the form , where and give rise to the log structures and is a family of relative parameters whose subfamily is used to define the center.
5.1.12. Relative log order
The relative log order of an ideal on a relative -orbifold at a point is defined as follows: let be the log fiber containing , then . As in the absolute case (see Exercise 3.2.12), the relative log order can be computed using relative log derivations. As earlier, we denote the maximal relative logorder of on by and view log order of as a function .
Exercise 5.1.13**.**
(i) Show that restricts to the sheaf of derivations on and deduce that is the minimal number such that . (Hint: use that log fibers and relative log derivations of the log smooth morphism are usual fibers and relative derivations of the smooth morphism .)
(ii) Assume that is a variety. Show that is a relative parameter at if and only if .
5.1.14. Base change functoriality
All basic constructions we have discussed, including relative log derivations, centers, Kummer blowings up, and relative log order are compatible with arbitrary base changes , where is smooth (due to our general restrictions), but the morphism does not have to be smooth (and can even contract to a point).
Lemma 5.1.15**.**
Let be a morphism of log -manifolds, let be a log orbifold with the pullback and the base change morphism , let be an ideal on with pullback , and let be a -center on with pullback . Then , , is a -center and .
In fact, all these properties easily follow from explicit local descriptions (of log smooth morphisms, charts of blowings up, etc.). In addition, one easily sees that if is a variety and is a family of regular and monomial relative parameters at , then their pullbacks form a family of regular and monomial relative parameters at any over . We refer to [ATW20b, 2.4.9, 2.7.2, 2.8.14(i) 4.2.20(iv)].
5.1.16. Log smooth functoriality
Similar compatibilities hold for log smooth morphisms between -orbifolds.
Lemma 5.1.17**.**
Let be a log -manifold, let and be log orbifolds, let be a log smooth -morphism, let be an ideal on with pullback , and let be a -center on with the pullback . Then the natural homomorphism is surjective and splits locally, , is a -center and .
We refer to [ATW20b, 2.4.11, 2.7.6, 2.8.15(i), 4.2.20(v)]. Compatibility with Kummer blowings up follows from its analog for logarithmic -manifolds, but the situation with relative parameters and log order is a bit subtle and requires care: if is not sharp at with , then pullbacks of some log parameters at become linearly dependent at , and hence some log parameters should be removed and some ”additional” regular parameters at should be added. Also, the relation between the log fibers of and is not that simple in this case. Nevertheless, a family of regular relative parameters at pullbacks to a subfamily of a family of regular relative parameters at , and this suffices to prove that induces regular morphisms between the log fibers, see [ATW20b, 2.7.6 and 2.7.7]. Compatibility of with relative log orders follows.
5.2. The algorithm
Once the framework is established the resolution, principalization and order reduction algorithms are constructed precisely in the same way as in Section 4.2 but using relative notions instead of the absolute ones. We will recall all these in the autopilot mode, indicate the only point, where a new phenomenon happens, and proceed to formulations of the main theorems.
5.2.1. Reduction to principalization
Let be a morphism of log varieties whose log structure is Zariski. Then for any point there exists a neighborhood which possesses a strict closed immersion into a log smooth -scheme . Indeed, working locally we can assume is modeled on a chart , where and for . Let be a family mapping to a basis of the cotangent space of the fiber of at , then the induced morphism is strict and unramified at , hence on a neighborhood of this morphism factors into a composition of a strict closed immersion and a strict étale morphism . Clearly, the relative dimension of over is minimal possible, and with a bit more care one can prove that up to an étale correspondence this minimal strict closed embedding of into a relative log -manifold is unique, see [ATW20b, §8.2].
Now, the same argument as in the classical or absolute logarithmic cases shows that functorial principalization of ideals on -manifolds implies functorial resolution of log -schemes (or stacks) which are locally equidimensional and generically log smooth over .
5.2.2. Maximal contacts and coefficient ideals
Let be a relative log manifold, an ideal and a point such that . Then the definitions of the maximal contact and coefficient ideals at are the same as in §3.3: a maximal contact to at is any , where is a regular relative parameter at ; the coefficient ideal is the homogenized sum .
Furthermore, in the maximal order case we have precise analogs of Theorems 3.3.14 and 3.3.15 on equivalence of log order -reductions of and log order -reductions of , and on uniqueness of and up to an étale correspondence. The arguments are also precisely the same.
Finally, the non-maximal order case is reduced to the maximal order case by a precise analogue of Lemma 3.3.18. To summarize, in the case of a finite relative log order the algorithm and its justification are precisely the same as in the absolute case discussed in Sections 3 and 4.
5.2.3. A complication
It remains to consider what should be the simplest case – the case when the log order is infinite, and once again this case turns out to be not so simple. In the absolute case we had to introduce Kummer blowings up to deal with it, and now it turns out that the algorithm just can fail at this step…
So, assume that and we are seeking for a relative log order -reduction. In such a case locally at any -admissible center is of infinite relative log order, that is, it is monomial. So, the only thing we can do within our framework is to blow up the whole monomial hull (or its saturation) viewed as the -center with – it is easy to see that blowing up any larger monomial ideal will not make the relative log order finite. If blowing up this ideal does not make the relative log order finite, then the algorithm fails.
On the other hand, infiniteness of the log order is detected (and controlled) by the differential saturation , which is contained in . In the absolute case, Lemma 3.3.4 guarantees that and it follows easily that the log order of the transform of drops after blowing up , see Lemma 3.3.8. In the relative case we use only the submodule of relative derivations , that is, we do not have a non-trivial way to derive pullbacks of functions on . In particular, a typical example when the algorithm fails is when is the pullback of a non-monomial ideal on .
Example 5.2.4**.**
Choose any with a proper non-zero ideal whose monomial hull is trivial: . For example, take with the trivial log structure and any proper ideal. Consider with the log structure induced from .
(i) Then the principalization fails for the ideal because but .
(ii) More generally, the principalization fails for the ideal with any . This time the first steps of the algorithm are just restrictions to the iterative maximal contacts, and then the algorithms reaches the situation described in (i) and fails. For example, if and , then the relative principalization fails for . This can be also seen directly: is not contained in any relative center: the absolute algorithm would blow up the center , but it is not a relative center (even worse, blowing up produces a log scheme which is not log smooth over ).
5.2.5. Base change
The above example also indicates a way to solve the problem: if is monomial, then is a relative center and we can freely blow it up (in particular, the result stays log smooth over the base). Therefore it is natural to expect that enlarging the log structure on we can improve the situation. Certainly such an operation can make not log smooth, so in general one should also modify the underlying scheme. It turns out that indeed, one can monomialize -saturated ideals just by modifying the base . We formulate this monomialization theorem now and postpone a discussion about its proof until §5.3. We say that a morphism between log manifolds is a blowing up along if scheme-theoretically one has that and the log structure on is induced over the log structure of by the exceptional divisor , that is, the divisors and defining the log structures are related by .
Theorem 5.2.6**.**
Let be a log manifold over , let be a log orbifold, and let be an ideal on such that . Then there exists a morphism of log manifolds such that is a blowing up and the pullback is a monomial ideal, where . Moreover, one can achieve that the center of is monomial outside of the schematic image of the support in .
Remark 5.2.7**.**
If either or is a curve and the log structure is non-trivial at any point of , then any blow up whose center is monomial outside of is trivial (because the only way to modify is to increase the log structure). Thus, in this case the theorem just claims that is monomial and when is a point we recover Lemma 3.3.4. In particular, for such a base the main results we will formulate below hold without any modification of .
5.2.8. Relative log order reduction
The first main result concerns relative log order -reduction, whose definition copies Definition 4.2.3 with -admissible centers replaced by -admissible -relative centers.
Theorem 5.2.9**.**
There exists a method which accepts as an input a log orbifold , where is a log manifold, an ideal and a number , and either fails or outputs a relative log order -reduction of such that the following conditions are satisfied.
(i) Existence: There exists a blowing up whose center outside of is monomial such that is a log manifold and does not fail on , and .
(ii) Base change functoriality: if does not fail on , then for any morphism of log manifolds with fs base change and we have that is obtained from by omitting all trivial blowings up (in particular, it does not fail).
(iii) Log smooth functoriality: if does not fail on , then for any log smooth with we have that is obtained from by omitting all trivial blowings up.
(iv) For closed immersions of constant codimension of -orbifolds the re-embedding principle is satisfied.
In the more classical language of marked ideals this is [ATW20b, Theorem 7.1.1]. The algorithm is constructed precisely as its absolute analogue (and particular case when ) in §4.2.8. The new claims in the relative algorithm are related to base changes – (i) and (ii). The proof of (ii) is straightforward because all ingredients of the framework satisfy the base change functoriality, see Lemma 5.1.15. Existence is proved inductively as follows. Recall that the algorithm in §4.2.8 produces an -admissible -sequence
[TABLE]
where the first blowing up makes the log order finite, and the sequences are constructed inductively (using maximal contacts) and reduce the log order of the clean part until it drops below .
In the relative situation each step can fail. However, the first step certainly succeeds if is monomial, and by the monomialization theorem 5.2.6 this condition is achieved after an appropriate blowing up . Thus, setting and we have that is monomial and hence the first step of does not fail. Moreover, this is also the case for any further base change . By the induction assumption, the second step of succeeds after an appropriate blowing up and then it also succeeds after any further blowing up by claim (ii) of the theorem, and so on. In the end we find a sequence of blowings up (which can be represented as a single blowing up) such that all steps except the final cleaning succeed after the base change . It remains to note that the final cleaning blows up an exceptional divisor, hence it succeeds automatically.
Remark 5.2.10**.**
Using the monomialization theorem as a black box, the required base change is dictated by in a canonical (in fact, simple algorithmic) way. However, the current proof of the monomialization theorem is existential and difficult, see the discussion in §5.3 below.
5.2.11. Relative principalization
Taking in the previous theorem one obtains the relative principalization theorem [ATW20b, Theorem 1.2.6].
Theorem 5.2.12**.**
On the category of relative log orbifolds whose targets are log manifolds over there exists a relative logarithmic principalization method , which is base change functorial and log smooth functorial, satisfies the re-embedding principle, and succeeds on each after a large enough blowing up of whose center is monomial outside of .
5.2.13. Relative desingularization
Finally, by the usual methods discussed in §5.2.1 the above theorem implies the following functorial semistable reduction theorem, see also [ATW20b, Theorem 1.2.12].
Theorem 5.2.14**.**
There exists a relative desingularization method which accepts as an input a generically log smooth morphism of -varieties with a locally equidimensional and a log smooth , and either fails or outputs a stack-theoretic modification such that is log smooth and the following condition are satisfied.
(i) Existence: There exists a blowing up such that is a log manifold, is monomial for any open log subscheme such that the restriction is log smooth, and does not fail on the base change .
(ii) Base change functoriality: if does not fail on , then for any morphism of log manifolds with fs base change we have that .
(iii) Log smooth functoriality: if does not fail on , then for any log smooth we have that .
Remark 5.2.15**.**
(i) The above theorem can be viewed as a weak form of a semistable reduction theorem over an arbitrary base. By complicated but purely combinatorial methods one can improve the log smooth morphism by a log blowing up so that is a so-called semistable morphism, see [ALT18]. When is one-dimensional this is precisely the semistable reduction of [KKMSD73].
(ii) So far Theorem 5.2.14 is the only known resolution of morphisms (or semistable reduction) compatible with base changes, even in the case when the dimension of is . In particular, using noetherian approximation on the base it implies semistable reduction theorem over any valuation ring, not necessarily discretely valued. Proving the latter was one of the main motivations for developing the logarithmic resolution methods.
5.2.16. Destackification
As in the absolute case, the relative principalization and desingularization methods output a stack-theoretic modification. Using a canonical relative destackification procedure one can obtain a further modification (resp. ) such that the relative coarse space (resp. ) is log smooth over . This provides a representable principalization and desingularization methods which are only smooth functorial, see [ATW20b, Theorem 1.2.14].
5.3. The monomialization theorem
Finally let us discuss the proof of the monomialization theorem. The argument in [ATW20b, §3] is surprisingly involved and most probably some improvements will be found in the future, so we will only outline the main ideas. Possibly the concept of a separate monomialization theorem is suboptimal, and a more natural monomialization should be intertwined with principalization. We will discuss some arguments in favor of this in the end of the section.
5.3.1. The case of
We start with the simple but already very useful case, when . Recall that the case when is a point was already established in Lemma 3.3.4 (and Exercise 3.3.5). In fact, the case of a curve is similar. Working locally on it suffices to consider the case when , where is a field or a dvr with a uniformizer and the log structure is generated by . Furthermore, monomiality satisfies formal descent: is monomial at if and only if is monomial at (we use that the completion homomorphism is flat and hence the ideal is determined uniquely by its formal completion), hence we should only prove that is monomial. Finally, the claim is étale-local on , hence we can assume that the log structure is Zariski. Now, the claim reduces to the following formal computation. This is a difficult exercise and we outline the main lines of the argument.
Exercise 5.3.2**.**
Assume that is a complete DVR provided with the log structure generated by and
[TABLE]
where is an embedding of sharp monoids and is a field extension. Consider the module generated by log derivations of two types: (i) vanishes on , , each with and satisfies , (ii) for any with the derivation vanishes on , each and restricts to on . Prove that any -stable ideal (i.e. ) is monomial. (Hint: One should adopt the proof from Exercise 3.3.5 to this situation. First, use the same argument as there to show that is generated by elements of the form , where and have the same image in (unlike Exercise 3.3.5 we cannot distinguish elements from by -derivations). Choose such that is a non-negative element in for any (informally with ), and show that for any . Deduce that for a unit , and hence is monomial.)
5.3.3. The general case
If is arbitrary one starts with the same approach but has to bypass various technical complications. A minor issue is that if is not closed in the fiber and is not algebraic over , one should also consider derivations in “constant” directions. A more serious obstruction is that derivations do not allow to control algebraic extensions and the torsion of . In the formal computation one assumes that these obstructions are trivial, and the general case is reduced to this by a Kummer descent and a cofinality argument, see [ATW20b, Lemmas 3.5.8, 3.6.3]. Furthermore, in the formal case one only shows that is generated by an ideal and this is the maximum one can get from derivations – by continuity -derivations vanish on .
Nevertheless, if is open, then it is the completion of an ideal , and blowing up on we achieve monomialization. This is automatically the case when is a finite union of closed points of , and the general case is achieved by induction on the dimension of – first one constructs a blowing up which monomializes over the generic points of , then over the generic points of the remaining bad locus, etc.
The following remark is rather technical, and can be safely skipped by the reader.
Remark 5.3.4**.**
The framework of the relative principalization is constructed for arbitrary log smooth morphisms , including morphisms which are not sharp. Sometimes this made constructions more complicated, though usually it sufficed just to work with the morphism . In contrast, the proof of the monomialization theorem only works when is sharp (and for simplicity it is even assumed to be integral at one place in [ATW20b, Section 3]). This forces one to start with a large enough monomial blowing up of the base and results in a monomializing blowing up which can be non-trivial (though monomial) outside of . We do not know if this can be improved. As a consequence, the same limitation holds in the formulation of the main theorems on relative principalization and desingularization. In fact, even if one starts principalization with a sharp morphism , typical admissible blowings up of will no longer be sharp over the base, and each time the algorithm will have to modify the base it will also modify the monomial locus over which the morphism is not sharp.
5.3.5. Canonicity of the base change
The monomialization theorem proved in [ATW20b] is existential. It is a natural question if the modification can be found in a canonical (or functorial) way. The answer seems to be positive, but working out details turned out to be really heavy and we have not brought it to satisfactory form. In addition, the resulting method, although canonical, may be difficult for a practical implementation. The main reason for this is that the problem is not local – the situation at depends on the whole fiber of over , which does not even have to be connected. Such a method cannot be analogous to usual embedded principalization.
6. The dream algorithms
The Kummer centers used in the logarithmic method are of the form
[TABLE]
where are monomials. This can also be viewed as a stack-theoretic refinement of the weighted blowing up with weights or a usual blowing along , so the following question is natural: once the stack-theoretic methods are at our disposal, can one use arbitrary weights? Can one blow up centers like ? In fact, we already saw in [Abr] that indeed, there is a natural stack-theoretic definition of such weighted blowings up of manifolds which outputs an orbifold (and will briefly recall some details below).
The next question is if including arbitrary weighted blowings up in the basic framework leads to a new algorithm. This was precisely the question we studied after discovering the logarithmic principalization, and the result was somewhat unexpected. In a sense it was too good: weighted principalization (and resolution) does not need logarithmic structure (or boundary) at all, and it works by reducing a natural simple invariant by each weighted blowing up. In other words, one obtains an “ideal” algorithm without inner structure/memory – it just iteratively finds an admissible center with largest possible invariant and blows it up. The famous example of Whitney umbrella shows that such an algorithm does not exist within the classical framework, but we saw in [ATW, §3.4] how a single weighted blowing up at the pinch point improves the singularity.
In addition, one can also consider the general weighted centers in the logarithmic setting and this leads to a logarithmic dream algorithm, which was developed by Quek in [Que22] in the absolute case.
6.1. Weighted blowings up
The main new ingredient in weighted algorithms is provided by weighted blowings up. So, we start with a brief review of their definition, historical context, and modern formalism. The principalization algorithm only blows up smooth varieties , but we will try to formulate our definitions and statements in the maximal generality, when they apply without significant changes – usually this will be the generality of reduced or normal varieties.
6.1.1. Weighted blowings up
Let be a smooth affine variety, let be functions on that form a partial family of regular parameters at any point of (in other words, is smooth of pure codimension ), and let . The classical weighted blowing up associated with and weights is glued from the charts , where is the normalization of the -subalgebra of generated by the fractions such that .
Exercise 6.1.2**.**
(i) Check that , where are chosen so that is the same number for any . In other words,
[TABLE]
(ii) Check that blowing up of along with weights creates a singularity of type (étale locally looking as ).
6.1.3. A stack theoretic refinement
In order to freely use weighted blowings up in principalization one should modify their definition so that the outcome is smooth. As in the logarithmic algorithm this can be achieved by a stack-theoretic refinement of the classical definition. The most naive way is analogous to the first approach mentioned in §4.1.8 – one (locally) considers the Galois cover generated by with and the blowing up and then defines the weighted blowing up as the stack-theoretic quotient , where .
The disadvantage of this definition is that, similarly to the classical definition of weighted blowings up, it is very ad hoc and coordinate dependent. It is even not so easy to globalize it, not to mention such notions as -admissibility, etc. This happens because intuitively the weighted blowing up center is something of the form , but the notation needs to be formalized. So the solution should start with introducing a notion of generalized ideals, where such beasts can live.
6.1.4. Valuative ideals
Similarly to Kummer ideals one can try to consider an appropriate topology on where covers generated by extracting roots of parameters are open covers and consider ideals in . Since such covers do not even have to be flat, it seems most natural to consider the -topology or the equivalent topology generated by open covers, finite covers and modifications. It turns out that points of these topologies are easily described – they are valuations on with center on , so one can use the much more down-to-earth definition of valuative ideals that we are going to recall. We start with a bit more particular case, where roots are not extracted.
Exercise 6.1.5**.**
For a reduced variety consider the Riemann-Zariski space
[TABLE]
where the limit is taken over all modifications in the category of locally ringed spaces. In particular, and is the colimit of pullbacks of to .
(0) Show that , where are the irreducible components of .
(i) Prove the following results from [Tem10, §3.2]: if is integral, then for each the ring is a valuation ring of with center on . Deduce that this provides a bijective correspondence between the points of and valuation rings of with center on .
(ii) Show that ideals in the topology generated by modifications and Zariski covers correspond bijectively to ideals of . In particular, a finitely generated ideal is generated by an ideal on some modification of . Moreover, is invertible and can be chosen invertible. (Hint: one can either use that a finitely generated ideal in a valuation ring is principal or that any ideal becomes invertible after blowing up.)
(iii) Assume that is normal. Show that two ideals induce the same ideal on if and only if . (Hint: if , then already their pullback to coincide. In the opposite direction prove that analogously to the fact that the integral closure of a domain coincides with the intersection of all valuation rings of containing .)
Furthermore, a finitely generated ideal in can be described by a section of the sheaf of values or even of its positive part . This provides the most elementary way to define such ideals, and it is easy to translate various operations on ideals into the language of sections:
Exercise 6.1.6**.**
(i) Show that the stalk at is the group of values of the valuation ring , and is the submonoid of non-negative elements.
(ii) Show that the homomorphism (resp. ) induces a bijective correspondence between finitely generated ideals of and invertible ideals of the monoid and the latter are in a bijective correspondence with the generators , which are global sections of . Prove that in the same way sections of correspond to fractional ideals of .
(iii) Let be an ideal on and the induced ideal on with the associated section . Show that , where is the section corresponding to , that is, where is the valuation of . Also show that for any the locus given by consists of the valuations centered on the -chart of
(iv) Show that and . In particular, . Also show that if and only if . (Hint: by Exercise 6.1.5(iii) if and only if .)
(v) Let . Find ideals representing and . (Hint: since , the section should be represented by something like , where . The latter can not be represented by an ideal on , but makes perfect sense on the modification .)
Remark 6.1.7**.**
The elements of are called valuative ideals. We have just seen that they really encode finitely generated ideals and the formalism of valuative ideals is extremely simple.
6.1.8. Valuative -ideals
Since valuative ideals are very simple objects one can easily extract roots from them: a valuative -ideal is a section of the sheaf , which is the saturation of in . One can use the same formalism to operate with valuative -ideals as in the previous section – the basic operations are summation, minimum and multiplication by a positive rational number.
We will not need the following remark about other interpretations of valuative -ideals.
Remark 6.1.9**.**
(i) A valuative -ideal is an effective -Cartier divisor on a fine enough modification.
(ii) In characteristic zero one can view a valuative -ideals as an -ideal.
Example 6.1.10**.**
(i) If are global functions and then we will use the suggestive notation to denote the valuative ideal .
(ii) Assume now that is smooth. If is such that locally on there exists a presentation such that the support of is smooth of codimension , then is called a -regular center on . Such a center is called a smooth weighted center if one can choose a presentation with for each , and a smooth weighted center is reduced if in addition . The tuple is called the tuple of weights.
If the support of a -regular center is of codimension 2 and higher, then there are many different ways to choose the regular parameters. For example, for any natural . However the weights are well defined.
Exercise 6.1.11**.**
Show that the multiplicities are uniquely determined by a -regular center .
6.1.12. Blowings up of valuative -ideals
To any valuative -ideal on a normal variety one associates the graded -algebra called the Rees algebra of and defined by , where . Then the blowing up of along is the stack-theoretic Proj of the Rees algebra: .
Remark 6.1.13**.**
Each is an ideal on , which is the pushforward of the -th power of the ideal . So our definition of the Rees algebra and its blowing up is a precise analogue of the definition of Kummer blowings up in 4.1.14.
Exercise 6.1.14**.**
Let be a normal variety with a valuative -ideal of the special form (these are -ideal or idealistic exponents from §6.2 below).
(i) The algebra is integrally closed and finitely generated over .
(ii) If for a usual ideal , then is the integral closure of the usual Rees algebra of . In particular, and it is singular even for the valuative center associated with .
(iii) corresponds to a usual invertible ideal on .
6.1.15. Smooth weighted blowings up
By a smooth weighted blowing up of we mean blowing up of a smooth weighted center. Such blowings up output smooth stacks, unlike the blowings up along an arbitrary -reduced center. The following result is established by a direct chart computation (e.g. see [ATW, §3.6]).
Exercise 6.1.16**.**
(i) Let be a tuple of weights and a smooth weighted center on . Then is a smooth DM stack whose stabilizers on the -th chart are subgroups of . The smooth weighted center becomes a usual invertible ideal on which will be denoted .
(ii) If and , then is the root stack obtained from by extracting the -th root from .
6.1.17. Associated weighted blowings up
The weighted algorithms use certain -regular centers including all those with natural multiplicities, which correspond to usual ideals. Blowing up such a center can output a singular variety, hence we should use a stack-theoretic refinement instead. The trick is to blow up an appropriate root of the center.
Definition 6.1.18**.**
Assume that is a -regular center. Chose the representation with and let . Then is the smooth weighted center associated with and is the associated weighted blowing up. We will use the notation .
Remark 6.1.19**.**
The blowing up is a partial coarsening of the weighted blowing up . The scaling factor is chosen so that the stack-theoretic refinement is smooth and the stacky structure is increased as little as possible.
6.2. -ideals and idealistic exponents
In principle, the formalism of valuative -ideals introduced in [ATW19] covers our needs. This section will not be used in the sequel, but it is quite enlightening to also study the smaller class of -ideals which really play a role in this story, especially because they formalize the classical notions of idealistic exponent and marked ideals. These notions are well behaved only on normal schemes, so we restrict to this generality. We also refer to [Que22, §2.2] and [Wło, §2.1].
6.2.1. -ideals
A -ideal on a normal scheme is a valuative -ideal which locally on is of the form where are functions. In other notation, . In particular, a -regular center is a -ideal. In a sense, -ideals generalize usual ideals in the same meaning as valuative -ideals generalize valuative ideals, and the following exercise formalizes this point of view.
Exercise 6.2.2**.**
(i) Let be a valuative -ideal. Show that it is a usual ideal (i.e. for an ideal ) if and only if is both a valuative ideal and a -ideal. In particular, is a -ideal if and only if is an ideal for some .
(ii) Show that the multiplicative monoid of -ideals is uniquely divisible and hence it is the divisible hull of the monoid of integrally closed ideals. In particular, -ideals can be safely presented in the form , where is an ideal (or its integral closure).
(iii) A marked ideal can be viewed as the -ideal : show that this correspondence agrees with the usual operations on marked ideals – inclusion, multiplication and summation (homogenized or not).
(iv) Give an example of a valuative ideal, which is not a -ideal. (Hint: one can take and – the valuative ideal corresponding to the ideal on . Then the minimal -ideal containing is .)
Remark 6.2.3**.**
(i) In fact, the notion of a -ideal is nothing else but a formalization of Hironaka’s notion of idealistic exponent. As we saw, this can be done in two ways – either realize them as valuative -ideals of a special form, or as roots of usual ideals considered up to integral closure.
(ii) The classical order reduction of a marked ideal can now be formalized as reducing the order of the -ideal below 1 by blowing up smooth centers and factoring out their pullback. Our interpretation in §2.3 is that one reduces below the order of itself by blowing up centers . These interpretations just differ by normalization.
6.2.4. Normalized blowings up
Normalizing blowings up of -ideals to stay in the category of normal schemes one obtains the following universal property, see [QR, Theorem 3.4.3].
Theorem 6.2.5**.**
If is a -ideal on a normal variety and is the normalized blowing up, then is an invertible ideal and is the universal morphism of normal schemes with this property: if is a morphism of normal schemes such that is dense in , then there exists at most one factorization of through and it exists if and only if is an invertible ideal.
In particular, we obtain a generalization of Exercise 6.1.16(ii).
Remark 6.2.6**.**
This universal property immediately implies that the normalized blowing up along can be described using the usual normalized blowing up and the normalized root stack construction : the first makes the pullback of invertible and the second extracts the -th root.
6.3. Rees algebras and Rees blowings up
In order to describe non-embedded resolution in the most precise way, we should also consider non-normal varieties and the weighted blowings up induced on them from weighted blowings up of the ambient manifold. This theory was developed by Rydh in his work on Nagata compactification for stacks and later by Quek-Rydh in [QR]. One has to switch to the language of arbitrary (non-normal) Rees algebras. The reader can safely skip (or just look through) this section; it will only be used to formulate the non-embedded weighted resolution in the most precise way.
6.3.1. Rees algebras
The -ideals can also be interpreted in terms of another classical object – Rees algebra. As in [QR], by a Rees algebra on a variety we mean a finitely generated graded -algebra
[TABLE]
such that and the ideals form a decreasing sequence: for (the latter condition is automatic when is normal). By the support of we mean . For any we have that , hence .
If is normal, then necessarily is normal and is integrally closed. Conversely, if is normal then the normalization of a Rees algebra is also a Rees algebra on (for general schemes one should also assume that is quasi-excellent, or, at least, Nagata). In particular, for any valuative -ideal on a normal scheme we have that is a normal Rees algebra. The natural construction in the opposite direction associates to a Rees algebra the valuative -ideal . In fact, it is a -ideal which possesses a concrete description in term of generators: if is generated over by , then .
Exercise 6.3.2**.**
Show that for any Rees algebra on a normal variety one has that is the minimal valuative -ideal whose Rees algebra equals . Deduce that the constructions and provide a one-to-one correspondence between normal Rees algebras and -ideals on . Also deduce that for any valuative -ideal with one has that is the maximal -ideal such that .
Recall that the blowing up of a -valuative ideal is determined by its Rees algebra , hence it coincides with the blowing up along the -ideal . Thus, the theory of weighted blowings up of normal varieties can be described entirely in terms of -ideals or Rees algebras. To extend this to non-normal varieties one should use non integrally closed Rees algebras.
6.3.3. Pullbacks
For any morphism of normal schemes and a -ideal on one defines its pullback which we will also denote as for shortness. It is easy to see that this operation is well defined. Also, for any morphism of schemes and a Rees algebra on one defines the pullback .
6.3.4. Rees blowings up
To any Rees algebra on a variety one associates the blowing up . It comes equipped with the exceptional divisor whose invertible ideal will be denoted . Namely, for the restriction of onto the corresponding chart corresponds to the -equivariant ideal , where .
6.3.5. The universal property of weighted blowings up
Weighted blowings up possess a certain universal property similar to the one satisfied by the usual blowings up but also more subtle. The proof is a direct computation, see [QR, Theorem 3.2.9].
Theorem 6.3.6**.**
Let be a variety and a Rees algebra on with the weighted blowing up and support . Then:
(0) is an isomorphism over .
(i) with equality holding for any divisible enough (in fact, it suffices that is divisible by the weights of a set of generators).
(ii) If is a morphism such that is schematically dense, then the category of factorizations of through is equivalent to the set of invertible ideals such that with equality holding for any divisible enough .
6.3.7. Strict transforms
If is a morphism of varieties and is a Rees algebra on with , then the strict transform of with respect to the blowing up is the schematic closure of the preimage of in . As in the classical case, the universal property easily implies the following description of strict transforms, see [QR, Corollary 3.2.14].
Corollary 6.3.8**.**
Let be the strict transform of a morphism with respect to a Rees blowing up . Then . In addition, whenever is flat, and is a closed immersion whenever is a closed immersion.
6.3.9. -regular centers
Finally, we would like to define -regular centers in an arbitrary variety . For a tuple of functions and a tuple of positive rational numbers consider the Rees algebra with each generated by all monomials with . By a -regular center of multiplicity on we mean a Rees algebra which is locally of the form so that for any the images of in are linearly independent and the image of the set
[TABLE]
in is linearly independent.
By the associated weighted blowing up we mean the blowing up of the Rees algebra obtained by shifting the weights to where is the minimal natural number such that each is of the form . Locally this algebra is generated by the elements .
These definitions are compatible with closed immersions into manifolds:
Exercise 6.3.10**.**
Keep the above notation and fix a closed immersion with a smooth .
(i) Show that extends to a -regular center on in the following sense: choose any family of parameters on which restricts to and consider the -regular center . Then . In particular, the Rees blowing up of along is the strict transform of .
(ii) Moreover, show that geometrically speaking is contained in in the sense that for .
(iii) Conversely, show that any -regular center on such that restricts to a -regular center on .
(iv) Finally, show that if is normal, then corresponds to the -ideal .
6.4. Non-logarithmic weighted algorithms
In this section we will outline the simplest dream principalization – the one without boundary.
6.4.1. Weighted framework
The geometric objects are just DM stacks of finite type over , and one uses the usual smoothness and sheaves of derivations . Admissible centers are -regular centers, and such a center is -admissible if (which informally means that ). Admissible blowings up are weighted blowings up associated with such centers.
6.4.2. Weighted order
To complete the framework it remains to classify the centers and introduce an invariant. For this we always order parameters so that the tuple of multiplicities is monotonically increasing: . Naturally, the invariant of the center is defined to be the ordered tuple , and we provide the set of invariants with the lexicographic order, where shorter sequences are larger, for example, (alternatively, one can finish each string with , making the invariant more similar to the classical one).
Exercise 6.4.3**.**
Check that the invariant is monotonic: if , then .
For an arbitrary proper ideal we define the weighted order
[TABLE]
where the maximum is over all -admissible -regular centers. The weighted order at a point is defined by taking the minimum over all neighborhoods:
[TABLE]
For completeness we also define the invariant in extreme cases: and if contains a generic point of .
6.4.4. Weighted order reduction
Now we can formulate the main properties of the weighted framework, which completely dictate what the algorithm is. In fact, it turns out that there is a unique candidate for the first weighted blowing up and already this blowing up reduces the weighted order.
Theorem 6.4.5**.**
Let be a smooth DM stack of finite type over , and let be an ideal on .
(i) The weighted order satisfies the following integrality condition: and for .
(ii) There exists a unique -admissible center such that and contains all points with .
(iii) Let be the center described by (ii), the associated weighted blowing up (Definition 6.1.18) and the transform of . Then .
(iv) The center depends smooth functorially on the pair .
6.4.6. Weighted principalization
Part (i) of the theorem implies that the set of invariants of is a well-ordered subset of , therefore iterating the weighted order reduction we arrive at the end to the only ideal with zero invariant – the unit ideal. This yields the main result about weighted principalization.
Theorem 6.4.7**.**
There exists a principalization method which associates to any ideal on a smooth DM stack of finite type over a sequence of smooth weighted blowings up such that the following conditions are satisfied.
(i) The sequence is a principalization: and each is -admissible, where and is the transform of for .
(ii) The sequence depends smooth functorially on the pair : for any smooth morphism with the sequence is obtained from the pullback sequence by omitting all empty weighted blowings up.
(iii) The method requires no history (I call this a dream method): each weighted blowing up depends only on , but not on with .
6.4.8. Examples when the dream fails
In the classical setting no dream principalization algorithm exists. Usually one argues that blowing up a pinch point on the Whitney umbrella creates another pinch point, hence without memory one goes into an endless loop. However, blowing up along resolves the singularity, which makes the case not fully convincing. Here is Włodarczyk’s favorite example which avoids this. Let and , in particular, acts on it by permuting . The singular locus of is the union of the , and -axes, and the origin is the only -invariant smooth center which contains and lies in the singular locus. As in the case of Whitney umbrella, blowing up creates another singularity of the same type (in fact, 3 singularities on different charts permuted by ). This shows that there is no memoryless smooth functorial principalization which only blows up smooth centers.
Exercise 6.4.9**.**
Show that the weighted order at [math] is , the dream algorithm blows up and the weighted order drops after this blowing up.
6.4.10. Weighted desingularization
As in the classical case, if is a closed generically reduced substack of constant codimension, then the principalization of blows up all components of the strict transform of at the same blowing up . This implies that the strict transform of is smooth, hence is a resolution. By the usual argument of uniqueness of minimal embeddings up to an étale correspondence this yields a smooth functorial desingularization method for locally-equidimensional and generically reduced stacks of finite type over .
6.4.11. Back to schemes
The stacky structure can be removed by a destackification. As a result one obtains a new desingularization method, which is more efficient than the classical one, but does not possess new theoretical properties. However, we will now see that a minor modification leads to a so-called strong desingularization method.
6.4.12. Strong weighted desingularization
When is resolved by the classical principalization of the -th center lies in the preimage of , but it does not have to be contained in the strict transforms of , and the center of is usually singular, see [BM08, Example 8.2]. The same is true for the weighted principalization: it can happen that . However, if is the weighted order reduction of , is the strict transform of , and is the transform of , then is a closed subset of , and hence . Therefore, the more economical way to resolve is to proceed at the second stage with instead of , etc. In such a way we do not achieve principalization of but just successively modify the strict transform of . Moreover, not only the -th center is contained in the -th strict transform (see Exercise 6.3.10), it depends only on the pair and then the re-embedding principle implies that in fact it only depends on . This provides the following non-embedded dream algorithm.
Theorem 6.4.13**.**
There exists a desingularization method which associates to any locally equidimensional generically reduced DM stack of finite type over a sequence of weighted blowings up with -regular centers such that the following conditions are satisfied.
(i) The sequence is a desingularization: is smooth.
(ii) The sequence depends smooth functorially on : for any smooth morphism the sequence is obtained from the pullback sequence by omitting all trivial blowings up.
(iii) The method requires no history: each weighted blowing up depends only on .
6.4.14. The geometric interpretation
The algorithm iteratively repeats the same base step: chose a canonical -regular center depending only on and blow it up. This is in fact the unique -regular center whose multiplicity is maximal possible and which contains all points of with this invariant. Furthermore, this center witnesses the non-smoothness of by the fact that it cannot be extended to a thicker center with larger multiplicities. Blowing up this obstacle we kill it, and it turns out that the blown up variety has a smaller maximal non-smoothness obstacle.
Example 6.4.15**.**
Take with . The maximal center in this case is induced by the usual ideal and its normalized Rees algebra , where is generated by monomials with and . Clearly, and the associated weighted blowing up is a stack theoretic refinement of the blowing up along . Let also be the ideal generated by the monomials with . Then the non-smoothness of is detected by the fact that the closed immersion does not extend to a square-zero thickening because .
6.4.16. Relation to the theory of maximal contact
Now let us briefly discuss the justification. As we saw, everything follows easily from Theorem 6.4.5. At first glance one might expect that such a result, once correct, should be provable in a few ways, including rather direct ones. The following example by Włodarczyk shows that one should be more careful because such a -regular center does not exist in positive characteristic, hence an argument should be subtle enough and use the zero characteristic assumption.
Example 6.4.17**.**
The example is again… a Whitney umbrella on , but this time when is perfect of characteristic 2. As in characteristic zero, the weighted order at the origin is , but this time the whole singular locus consists of pinch points because there is an automorphism which translates . Clearly, the local centers exist in this case at any point of , but they do not glue to a global one. Moreover, at the generic point the invariant is and the trouble hides in the fact that the unit is not a square. Note also that the invariant at the geometric generic point , viewed as a point of , is again . All in all, we see that no nice theory of weighted centers seems to be possible, and, maybe, imperfect residue fields and units whose value at a point is not a -th power should somehow be taken into account. My personal expectation is that the formalism of characteristic exponents might be useful but insufficient.
Given our current knowledge, when working on [ATW19] and [Que22] the fastest way was to use the classical maximal contact theory both to construct such a center and prove its uniqueness. We do expect that a more direct argument should exist, and looking for it is one of the future projects.
6.4.18. Construction of the center
By the theory of maximal contact, working locally at a point we define an iterated sequence of maximal contacts to iterated coefficient ideals. Formally speaking, we obtain a neighborhood of , a partial sequence of regular parameters and a sequence of ideals on of orders such that , each is a maximal contact to , for any , in the notation of §3.3.10 we have that
[TABLE]
is the restriction of the coefficient ideal of onto for any , and . In particular, is small enough so that each order accepts its maximum at .
Once the above choices are done, setting (in particular, ) one obtains that
[TABLE]
and the center on is . Note that this datum is very close to the one produced by the classical algorithm: the first blowing up of the non-weighted principalization is along the center and is the invariant of Bierstone-Milman for this blowing up.
Certainly, the above sketch only provides a construction and explains the integrality condition and smooth functoriality, but one has to prove that, indeed, is -admissible, of maximal weighted order, and unique. All this is done using standard results from the theory of maximal contact (e.g. [ATW19, Lemma 4.4.1]) and homogenization (needed to pass from one maximal contact to another). We refer the reader to the proof of [ATW19, Theorem 5.1.1] for details. These ideas are also recalled in chapter [ATW], and in chapter [Wło] the weighted principalization is constructed with all proofs and details in the context of cobordant blowings up, when instead of stack-theoretic blowings up one considers the canonical presentation by a torus quotient. Essentially this means that the orbifolds we consider are replaced by their torus equivariant representable covers, hence, being smooth local, the arguments and proofs are essentially the same.
6.5. Logarithmic weighted algorithms
The simplest dream algorithm does not use any log structures. In particular, one obtains a principalization of an ideal, which is just an invertible ideal, with an arbitrarily singular support. In addition, one does not obtain resolution of divisors by snc ones. There is a logarithmic refinement of the dream algorithm which addresses these issues. It should certainly exist in the relative setting, but so far the theory was only developed by Quek in [Que22] in the absolute case – the case of log varieties. This method carefully combines the logarithmic and weighted settings and many things have to be checked, but the main line is to imitate the dream algorithm when working with log varieties and using arbitrary weighted submonomial centers. The reader already saw these ideas, so we will only explain the main novelty.
6.5.1. The framework
Naturally, one works with logarithmic DM stacks of finite type over a field, logarithmic derivations and logarithmic smoothness. Admissible centers on a log orbifold are valuative -ideals which are locally at of the form , where is a regular family of parameters at , and are rational monomials. Admissible blowings up are weighted blowings up of such centers as we define below. We will use the shorter notation , where is a Kummer monomial ideal called the monomial type of . As in the non-logarithmic case, one has a certain freedom in choosing the regular parameters and the other data is fixed:
Exercise 6.5.2**.**
Show that both the multiplicity of and the monomial type are uniquely determined by .
6.5.3. Weighted submonomial blowings up
As in the non-logarithmic case, by a weighted submonomial center we mean an admissible center with for natural weights . For an admissible center with and the center is weighted and we define the weighted blowing up along to be . For any ideal on such that is -admissible the transform is defined. Again, a direct chart computation shows that a weighted submonomial blowing up of a log orbifold outputs a log orbifold , see [Que22, Lemmas 4.1 and 4.2].
6.5.4. Weighted log order and monomial type
For an admissible center set if (i.e. there is no monomial part) and if is non-empty. This invariant and the monomial type provide the following monotonicity: if , then and in the case of equality one has that
For an arbitrary ideal on we define the weighted log order by
[TABLE]
In addition, and if contains a generic point. Furthermore, we define the monomial type of to be empty if does not end with and to be the minimal (with respect to inclusion) monomial type of an -admissible such that .
6.5.5. Weighted log order reduction
Now we can formulate the main theorem about weighted submonomial centers. The only new tool when comparing it to the non-logarithmic analogue is that one should also pay attention to the monomial type of an ideal.
Theorem 6.5.6**.**
Let be a log smooth DM stack of finite type over , and let be an ideal on .
(i) The weighted log order and the monomial type are well defined and the following integrality condition is satisfied: and for , and is either or .
(ii) There exists a unique -admissible center such that for each point with one has that and .
(iii) Let be the center described by (ii), the associated weighted blowing up and the transform of . Then .
(iv) The center depends log smooth functorially on the pair .
6.5.7. Weighted log principalization
As in the non-logarithmic case iterating the weighted log order reductions one obtains a dream algorithm for log principalization.
Theorem 6.5.8**.**
There exists a log principalization method which associates to any ideal on a log smooth DM stack of finite type over a sequence of weighted blowings up such that the following conditions are satisfied.
(i) The sequence is a log principalization: and each is -admissible, where and is the transform of for .
(ii) The sequence depends log smooth functorially on the pair : for any log smooth morphism with the sequence is obtained from the pullback sequence by omitting all trivial weighted blowings up.
(iii) The method requires no history: each weighted blowing up depends only on .
6.5.9. Strong logarithmic resolution
The same argument as in the non-logarithmic case shows that applying weighted log order reduction to the strict transforms of one obtains the following non-embedded dream log desingularization algorithm
Theorem 6.5.10**.**
There exists a desingularization method which associates to any locally equidimensional and generically log smooth log DM stack of finite type over a sequence of weighted blowings up such that the following conditions are satisfied.
(i) The sequence is a log desingularization: is log smooth.
(ii) The sequence depends log smooth functorially on : for any smooth morphism the sequence is obtained from the pullback sequence by omitting all trivial blowings up.
(iii) The method requires no history: each weighted blowing up depends only on .
6.5.11. Justification
As in the non-logarithmic case described in §6.4.18, one uses the logarithmic theory of maximal contact (and the sheaf of logarithmic derivations ). Locally at a point one defines an iterated sequence of logarithmic maximal contacts to the iterated coefficient ideals, obtaining a neighborhood of , a partial sequence of regular parameters and a sequence of ideals on of orders such that , each is a logarithmic maximal contact to , for any , we have that
[TABLE]
is the restriction of the coefficient ideal of onto for any , and . Then the monomial type is defined as the monomial ideal generated by the monomials from the monomial hull of .
Once these choices are done, the invariant and the center are read off as follows:
[TABLE]
where (in particular, ), if and otherwise, and the center on is . The justification is analogous, but it works with the logarithmic theory of maximal contact and also addresses the monomial type in the end. Once again we can relate this datum to the first blowing up of the non-weighted logarithmic principalization: the latter blows up the center and the invariant at this step is , see Remark 4.2.12.
7. Resolution for quasi-excellent schemes and other categories
Throughout the notes we only worked with schemes and stacks of finite type over . In this section we will discuss resolution in the wider context of quasi-excellent schemes and other categories, such as formal schemes, and complex or non-archimedean analytic spaces. We only aim to provide a very brief survey of some tools and literature. In addition, we will discuss directions which were not fully verified so far, but we expect the results to be true. The two main methods we will discuss are via extending the framework, and via black box reduction to (appropriate) quasi-excellent schemes. Note that a rather detailed survey on the second approach can be found in [Tem11] and we will refer to it from time to time. Unfortunately [Tem11] reflects our knowledge from more than ten years ago, and hence considers only the questions of extending the classical methods to wider settings.
7.1. Reduction to quasi-excellent schemes
In this subsection we will show that desingularization of objects that look completely non-algebraizable nevertheless follows from desingularization of quasi-excellent schemes. Thus, quite surprisingly, resolution of singularities seems to be a purely algebraic phenomenon. The key observation is that the latter desingularization should be functorial with respect to all regular morphisms. Also we will see in §7.3 that within the class of qe schemes there exist various bootstraps which allow to essentially reduce the problem to resolving algebraic varieties (these methods were used in [Tem08] and [Tem12]). We start with specifying the classes of geometric objects whose desingularization we will discuss, and then we will discuss the reduction to qe schemes.
7.1.1. Analytic spaces
Resolution of singularities makes sense in various categories of geometric objects, where appropriate notions of smoothness and blowings up make sense. Probably, the most natural case is that of complex analytic spaces, and Hironaka himself outlined how his proof should be modified in that case. In [BM97] Bierstone-Milman tried to axiomatize various situations in which their desingularization algorithm applies. In particular, they claimed that it applies to algebraic spaces of finite type over a field, analytic spaces – complex, real and non-archimedean, and certain quasi-analytic objects. This is definitely true with our current knowledge, though I cannot track the original argument in some cases (one cannot use Zariski topology when working with algebraic spaces; also in Berkovich geometry sheaves of differentials are defined with respect to the -topology rather than the usual one).
7.1.2. Quasi-excellent schemes
Next, let us discuss the case of schemes not of finite type over a field. Hironaka used formal completion in his original work [Hir64], so he had to prove his results for the much wider class of schemes of finite type over local rings such that the homomorphism is regular. Recall that a morphism of noetherian schemes is regular if it is flat and has geometrically regular fibers. For morphisms of finite type this notion is equivalent to smoothness, so regularity is the natural generalization of smoothness in the case of large morphisms. Soon after this Grothendieck defined a more general class of quasi-excellent or qe rings222The terminology was introduced later. Grothendieck only used the notion of excellent schemes to denote universally catenary quasi-excellent ones. by two conditions: is qe if the following two conditions are satisfied:
- (N)
After Nagata: for any integral of finite type over the singular locus of is open.
- (G)
After Grothendieck (though we saw, that historically it should have been named after Hironaka): for any the completion homomorphism is regular.
Some discussion and examples related to these properties and their relation to resolution can be found in [Tem11, §2.3].
The main observation of Grothendieck was [Gro67, , Proposition 7.9.5] claiming that even a weakest consistent resolution theory is possible only for qe schemes: if any integral -scheme of finite type possesses a desingularization, then is qe. Already Grothendieck expressed a hope that any integral qe scheme possesses a resolution and this is widely believed to be true. In characteristic zero, this was proved in [Tem08], and stronger versions are in [Tem12] and [Tem18].333In general only resolution of qe threefolds is known, see [CP19]. Thus, when working with schemes we will always restrict to the quasi-excellent schemes of characteristic zero. By [Gro67, , Proposition 7.8.6(i)] if is excellent, then any -scheme of finite type is excellent too, and the same argument applies to qe schemes as well.
7.1.3. Stacks
A stack is called qe if it has a smooth cover by a qe scheme. We tacitly used in these notes that any smooth-functorial algorithm automatically extends from schemes of finite type over a field to stacks of finite type over a field. The same argument applies to qe schemes and stacks. Also, any method which involves stack-theoretic blowings up (e.g. logarithmic or weighted principalization) should be developed in the generality of qe stacks right ahead.
7.1.4. Formal schemes
We say that a noetherian formal scheme is a formal variety if its closed fiber , where is the maximal ideal of definition, is an algebraic variety. Naturally, when working with more general formal schemes we will have to impose a quasi-excellence restriction. A formal scheme is qe if its closed fiber is a qe scheme. This definition is really useful because of the following theorem of Gabber, see [KS21]: an -adic notherian ring is qe if and only if is qe. This is a deep fact whose proof uses a weak local resolution of singularities. In particular, it implies that quasi-excellence is preserved by formal completions, and hence also by formal localizations, passing from to , etc. Part of the difficulty stems from the fact that the G-property along is not satisfied even by passing from to .
Gabber’s theorem implies that if is qe and is of topologically finite type over , then is qe. Before the theorem was available one had to work with clumsier and ad hoc definitions, e.g. see [Tem08, §3.1]. An important property of qe formal schemes is that formal localization homomorphisms are regular. The latter condition is extremely important, since it allows to extend to qe formal schemes notions from the theory of schemes which are local with respect to the topology of regular covers. In particular, one can define the notions of singular loci, see [Tem08, §3.1], and regular morphisms. In particular, is regular if it is covered by morphisms with regular homomorphisms . The general principle is very simple – use the usual definiiton which works with rings in the affine case and use compatibility of the notion with regular morphisms to globalize.
Blowings up of formal schemes are defined in a similar fashion, see [Tem08, §2.1]. If with an -adic , then one simply blows up and -adically completes, and in general one glues the local construction using that blowings up are compatible with flat morphisms. In particular, this construction is well defined for arbitrary noetherian formal schemes.
7.1.5. Geometric spaces
For concreteness we will work with one of the following spaces:
- (1)
Quasi-excellent schemes.
- (2)
Quasi-excellent formal schemes.
- (3)
Complex analytic spaces.
- (4)
Non-archimedean analytic spaces introduced by Berkovich, see [Ber93].
Certainly there are other possibilities - rigid or adic analytic spaces, Nash spaces, etc.
7.1.6. Affinoid spaces
In §7.1.4 we saw how constructions from the scheme theory can be transferred to formal schemes. It turns out that one can study analytic spaces similarly. This is not surprising in the non-archimedean setting, since Berkovich spaces are pasted from affinoid spaces , which are spectra of -affinoid algebras. Affinoid algebras are excellent and for any subdomain embedding the homomorphism is regular by results of Ducros, see [Duc09] or [AT19, §§6.2–6.3].
Nevertheless, an analogous theory also exists for complex analytic spaces. Each such space is covered by so-called semi-algebraic Stein compacts (for example, closed subdomains of polydiscs), the ring of overconvergent functions on is excellent and controls well enough. Again, if , then the homomorphism is regular. In detail, these claims are checked in [AT19, Appendix B], and a relative GAGA over Stein compacts is established in [AT19, Appendix C]. In particular, GAGA implies that, as in the formal case, complex blowings up are obtained by analytifying the algebraic ones.
7.1.7. Reduction to qe schemes
The general principle is very simple: any desingularization, principalization, etc. method , which is functorial with respect to arbitrary regular morphisms, automatically extends to analytic spaces and qe formal schemes. The construction is as follows:
- (0)
Cover the space with affinoid/affine subspaces corresponding to qe rings . If comes equipped with an ideal one also obtains an ideal , etc. Also, cover each with affinoid/affine subspaces .
- (1)
Consider the blowing up tower of and apply the analytification/completion functor to produce a blowing up tower of . This step uses the relative GAGA as we need to analytify ideals on blowing up in the tower.
- (2)
Show that the obtained towers are compatible on intersections because respects the regular morphisms .
In each case some minor details should be spelled out. In particular, this reduction scheme was used in [Tem12], [Tem18], and [AT19, §6], but it is the latter reference where all details were carefully spelled out (in the case of the factorization functor), a relative GAGA for complex spaces was constructed, etc.
7.1.8. Non-compact objects
Finally, we note that functorial methods can be also extended to non-compact spaces, including locally noetherian qe schemes. Clearly, the only way to do this is to cover by affine subspaces and glue the blowing up sequences for different . The technical complication is that the resulting sequence can be infinite; for example, this happens when and the resolution of takes steps. However, one can naturally define infinite ordered sequences of blowing up (called hypersequences in [Tem12, §5.3]) with the following local finiteness condition: over any compact subspace of the sequence contains only finitely many non-trivial blowings up. For such a sequence a composition is well defined, and gluing local resolutions of the subspaces one obtains a hypersequence of blowings up of in general, see [Tem12, §5.3].
7.2. Extending the framework
The second method to extend algorithms developed for algebraic varieties is to directly adopt it to another category. For example, this is what Bierstone and Milman did for the classical method and the categories of analytic spaces. This line of research is very natural, as it just explores in which generality the methods work. Nevertheless, it seems that it is almost not presented in the literature, so I will just express my expectations. In brief, absolutely in line with the philosophy of frameworks I expect that once the framework of the method extends to a wider setting, the method extends as well. So, one should construct appropriate blowings up, generalized ideals and derivation theory. In case of non-embedded resolution one should also worry that embedding into a smooth space exists. Note also that the theories of orbifolds and logarithmic analytic spaces are folklore and were partially developed in the literature. Now, let us discuss case by case.
7.2.1. Analytic spaces
I expect that, excluding resolution of morphisms, all methods we discussed in these notes extend to complex and non-archimedean analytic spaces. One should use the usual analytic differentials and derivations. Perhaps the shortest way to introduce weighted blowings up is via -ideals and Rees algebras. I do not expect any serious complication.
As for principalization on relative orbifolds and resolution of morphisms of analytic spaces, there is one major obstacle – the monomialization theorem, see §5.3. For example, let , and is a curve in which cannot be extended to . Let with coordinates and the ideal on given by . Then principalization of over goes by blowing up in , which increases the log structure by and then blowing up the ideal . However, once trying to principalize on one is stuck.
I expect that except the monomialization the whole algorithm works fine. As for monomialization there are two hopes/questions which, at the very least, do not contradict any example we know: Does the monomialization theorem holds true when is proper? Does the monomialization theorem holds for an arbitrary smooth morphism of smooth analytic spaces if one allows base changes of the following more general form: is a cover for the topology generated by modifications and open covers?
7.2.2. Schemes with enough derivations
Arbitrary qe schemes may have too nasty absolute derivation theory. Not only, the sheaf does not have to be quasi-coherent, already for with a DVR it can happen that the sheaf has a zero stalk at the closed point, see [Tem11, Example 2.3.5(ii)]. Certainly, all methods of these notes cannot apply to schemes with such derivation theory, so one should consider only qe schemes whose derivation theory is reach enough.
The following definition was suggested already in [Tem12, Remark 1.3.1(iii)]: a scheme has enough derivations if for any point all elements of the cotangent space are distinguished by elements of . In other words, the homomorphism to the tangent space is onto. Note that since is not quasi-coherent, can be strictly smaller than so this condition asserts that there exist enough derivations in a neighborhood of . It can be shown that schemes with enough derivations are qe and their class is closed under passage to schemes of finite type. I expect that non-logarithmic principalization methods – classical and weighted, work for general schemes with enough derivations (in the classical case this was conjectured in [Tem12]) and are functorial with respect to arbitrary regular morphisms. Similarly, I expect that the non-embedded methods work for schemes which are étale-locally embeddable into regular schemes with enough derivations.
I expect that the same holds true for logarithmic methods and log schemes with enough log derivations, where the latter means that log derivations distinguish both regular and monoidal parameters. In the non-weighted case this was proved in [ATW20b] as the particular case of [ATW20b, Theorem 1.2.6] when the target is just . In fact, [ATW20b] is the only paper I am aware of, where the notion of enough derivations was seriously explored. It even studied resolution of morphisms with enough relative derivations, and showed that it works whenever . In the case of a higher dimensional a much stronger restriction on derivations is needed – the so-called abundance of derivations, which also takes into account derivations in “constant directions” which distinguish elements of a transcendence basis of . This condition cannot be borrowed to analytic spaces, and this explains why our monomialization theorem does not extend to analytic spaces when .
Finally, we note that, beyond algebraic varieties, the most important case of schemes with enough derivations are schemes of finite type over noetherian complete local rings. We will later see, why this class (or its certain subclasses) are so important.
7.2.3. Formal schemes
The treatment of formal schemes should be analogous to schemes, namely, I expect that the methods extend to formal schemes with enough (log) derivations. The most important case is that of formal varieties.
7.3. Desingularization for quasi-excellent schemes
Finally, let us describe the situation with arbitrary qe (formal) schemes. The tools we have described so far do not suffice to establish resolution for them, and it seems that the only way is to use a certain descent from the formal completion via the (G) property. Thus, at first stage one should construct a desingularization or principalization method on the class of (formal) schemes of finite type over complete local rings or its suitable subclasses (for example, by the method of §7.2), and at the second step one applies descent. The classical solution uses descent of open ideals, and necessarily constructs a new method , which is more complicated even on the schemes from . This method is called localization or induction on codimension, it goes back to Hironaka’s original paper, and (due to my ignorance) it was re-invented in [Tem08]. A natural alternative would be to try to descent more general ideals, since this would just extend from to the class of all qe schemes. The only known result in this direction is McQuillan’s proof that weighted centers indeed satisfy this descent, and hence the weighted resolution and principalization algorithms extend to arbitrary qe schemes, see [McQ20, Section VII].
7.3.1. Induction on codimension
The method is very robust and applies to all algorithms, see [Hir64, Chapter IV, §1] and [Tem11] (see also [Tem12, §4] and [Tem18, §3.4]). In addition, this method is also used in the proof of the monomialization theorem. However, for the sake of concreteness we will only illustrate the idea on the case of principalization.
Assume first that is a local regular qe scheme and is supported at the closed point . Then the formal completion at the maximal ideal is a regular scheme and is supported at the closed point . The principalization of , which exists by step one, only blows up centers contained in the fiber over . They correspond to ideals open in the -adic topology, hence all these ideals algebraize and the tower is obtained by -adic completion of a tower of blowings up with centers . It then easily follows by descent that the latter sequence principalizes .
In the general case one proceeds by induction on codimension of the image of non-principalized locus in . First, one considers the finite set of points of minimal codimension, principalizes the pullback of to by the method from the previous paragraph and then just blows up the schematic closure of the centers, obtaining a blowing up sequence which principalizes over . The centers do not have to be smooth over specializations of , but by induction assumption we can assume that principalization (and hence also resolution) has been already constructed for them. Thus, one simply resolves each center before blowing it up. This inserts intermediate blowings up in the sequence and the algorithm becomes more complicated, but this does not affect the situation over . At the next step one considers the image of , where is the transform of . It is a closed subset of . Choose points of minimal codimension, find a sequence which principalizes over the preimages of , etc.
Remark 7.3.2**.**
(i) As an input for the induction on codimension scheme it suffices to take a principalization method which applies to regular schemes of finite type over the spectrum of a complete local ring and ideals such that is contained in the preimage of the closed point. This is a serious restriction, which allows to obtain via a black box construction from principalization of varieties. Indeed, such a scheme can locally be realized as a completion of a variety and algebraizes to an ideal on the variety, so one can just pullback principalization on the algebraization. The subtle point in this method is independence of algebraization, which is based on a theorem of Elkik, see [Tem11, §4]. This method was implemented in [Tem12, §3], though nowadays I think that extending the framework to schemes with enough derivations would be a better solution since it is more robust and easy to generalize to other situations.
(ii) In order to prove that the obtained method is functorial with respect to all regular morphisms one should prove that this is true for the input algorithm which operates with varieties. This turns out to be a bit subtle because there are regular morphisms between varieties defined over different fields , and the classical method uses only -derivations. One solution is to extend the framework by working with absolute derivations over . However, there is also a black box argument which proves that the classical method (and all methods we constructed in these notes) are compatible with arbitrary regular morphisms between varieties. This was worked out in [BMT11].
7.3.3. Direct descent
Finally, let us discuss a hypothetical direct descent. Assume, again that is a local regular qe scheme and is its completion, but this time consider an arbitrary ideal on with completion . The fact that comes from makes it reasonable to hope that any regular functorial principalization of should descent to . We illustrate this with a wrong argument: if would be noetherian and qe, then the two pullbacks of the principalization to the completion would coincide with the principalization of (the projections are regular in such case), and hence the principalization would descend to by the flat descent. Unfortunately, is usually very far from being noetherian so a completely different argument is needed, but the question if some other form of descent to is possible seems very natural. I expect that if such descent works in the local case, then one should be able to patch the local solutions on an arbitrary qe using the N-property.
Appendix A
A.1. Integral closure
Recall that the integral closure of an ideal consists of all elements satisfying a monic equation with . Any ideal with is called *integral * over . Both notions are compatible with localizations and hence extend to sheaves of ideals on schemes. If is integral over an ideal on a scheme and is a morphism, then is integral over .
Lemma A.1.1**.**
Let be a normal scheme with an invertible ideal . Then for any ideal with , one has that . In other words, is integrally closed and it is the integral closure only of itself.
Proof.
The claim can be checked locally, so assume that is a local normal domain, is principal and is an ideal with . If is integral over , then it satisfies an equation and hence satisfies a monic equation over . By the normality of we have that , that is . Thus, .
Assume that . Then , but it is integral over and we take a monic equation with and minimal possible . By the minimality of each element is not a unit, as otherwise would be an equation of smaller degree. Hence we obtain that , where is a unit, and this yields a contradiction. ∎
The normality assumption is necessary in the lemma. For example, in the principal ideal has a non-invertible integral closure .
Corollary A.1.2**.**
If and are ideals on a normal scheme such that , then .
Proof.
The claim easily follows from the two particular cases: when , and when is integral over . In the first case, for any modification we have that is invertible if and only if is invertible. So, by the universal property of blowings up . If is integral over , then is integral over , so if is normal and one of these ideals is principle, then the other is (and both coincide) by Lemma A.1.1. The second case follows. ∎
The reference list from the paper itself. Each links out to its DOI / PubMed record.
- 1[Abr] Dan Abramovich, Stacks for everyone who cares about varieties and singularities , In preparation.
- 2[AK 00] Dan Abramovich and Kalle Karu, Weak semistable reduction in characteristic 0 , Invent. Math. 139 (2000), no. 2, 241–273. MR 1738451 (2001 f:14021)
- 3[ALT 18] K. Adiprasito, G. Liu, and M. Temkin, Semistable reduction in characteristic 0 , November 2018, http://arxiv.org/abs/1810.03131 .
- 4[AT 19] Dan Abramovich and Michael Temkin, Functorial factorization of birational maps for qe schemes in characteristic 0 , Algebra Number Theory 13 (2019), no. 2, 379–424. MR 3927050
- 5[ATW] Dan Abramovich, Michael Temkin, and Jarosław Włodarczyk, Birational goemetry using weighted blowing up , In preparation.
- 6[ATW 19] Dan Abramovich, Michael Temkin, and Jarosław Włodarczyk, Functorial embedded resolution via weighted blowings up , ar Xiv e-prints (2019), ar Xiv:1906.07106.
- 7[ATW 20a] Dan Abramovich, Michael Temkin, and Jarosław Włodarczyk, Principalization of ideals on toroidal orbifolds , J. Eur. Math. Soc. (JEMS) 22 (2020), no. 12, 3805–3866. MR 4176781
- 8[ATW 20b] Dan Abramovich, Michael Temkin, and Jarosław Włodarczyk, Relative desingularization and principalization of ideals , ar Xiv e-prints (2020), ar Xiv:2003.03659.
