Resolution of Singularities in Characteristic Zero

4.2. Algebraic schemes🔗

Lean names in this section are shown relative to AlgebraicGeometry.Scheme.IdealSheafData, AlgebraicGeometry.Scheme, AlgebraicGeometry, CategoryTheory.

The theorems of this chapter are the algebraic main theorems of the library. They are about algebraic schemes over a field k of characteristic zero, and all but Main Theorem I and its weak form produce a finite succession of blow-ups, a BlowUpSequence (Definition 2.4.1.1).

Every scheme in these statements is an algebraic k-scheme, an object X : AlgScheme k whose underlying scheme X.left is separated and of finite type over \operatorname{Spec} k (algebraic k-schemes, Definition 2.1.1.2). Closed subschemes are given by their ideal sheaves (Mathlib's X.IdealSheafData), the monoidal transformation with centre D is the blow-up D.blowUp (Definition 2.2.2.2), and "non-singular" is IsRegular, every local ring regular (Definition 2.1.2.1), except in the hypotheses of Main Theorems II and II(N) and Corollaries 1 and 3, where it is smoothness over k.

The theorems come in four groups.

  • Hironaka's Main Theorems II and II(N) and his Corollaries 1 and 3: order reduction, principalization, the trivialization of a system of ideal sheaves and the simplification of a boundary, each by one succession of blow-ups with conditions on its centres, weak transforms and boundaries.

  • Kollár's functorial principalization and resolution: a single assignment of blow-up sequences to all inputs at once (Blow-up sequence functors), compatible with smooth morphisms and with change of the base field (Definition 4.2.4.3, Definition 4.2.4.4); and his strong resolution of a variety, read off the functorial resolution.

  • Hironaka's Main Theorem I and its weak form: one blow-up resolves a reduced irreducible algebraic scheme.

  • Włodarczyk's embedded desingularization with smooth centres, in functorial form.

Main Theorems II and II(N) and Corollary 1 are derived from Kollár's order reduction [Kol07, Theorem 68]; Corollary 3 from functorial principalization; Kollár's Theorem 27 and Main Theorem I from functorial resolution, together with Hironaka's remark that a finite succession of monoidal transformations is a single monoidal transformation [Hir64, pp. 132–133]; and the weak form of Main Theorem I from Main Theorem I.

The section of each theorem states, before the theorem, the properties it asserts of its successions or of its functor and the inputs particular to it. A property asserted by several theorems is stated at the first of them in this chapter, and the later ones refer back to it.

4.2.1. Main Theorem II: order reduction🔗

Main Theorem II is one round of order reduction. Its statement uses two of Hironaka's conditions on a succession of blow-ups, one on its centres and one on its boundaries, which Main Theorem II(N) and Corollary 1 use again.

Hironaka's conditions on centres and boundaries.

uses 1
Used by 3
Reverse dependency previews
Preview
Theorem 4.2.1.2
Loading preview
Reverse dependency preview content is loaded from the rendered-fragment cache.
✓L∃∀N

Two conditions of Hironaka's Main Theorems II and II(N) and of his Corollary 1, for a succession S of a scheme X:

Lean code for Definition4.2.1.1●2 definitions
Statement uses 8
Statement dependency previews
Preview
Definition 2.1.1.1
Loading preview
Statement dependency preview content is loaded from the rendered-fragment cache.
used by 0✓L∃∀N

Let X be a smooth algebraic k-scheme, k of characteristic zero, J an ideal sheaf on X with nonzero stalks, d the maximum over the points x of the orders \nu(J_x), and E_0 a reduced closed subscheme having only normal crossings. Then there is a finite succession of monoidal transformations f_i \colon X_{i+1} \to X_i with centres D_i \subseteq X_i such that

  1. every centre D_i is non-singular and irreducible;

  2. the weak transform J_i of J has order at least d at every point of D_i;

  3. the boundary E_i, defined by E_{i+1} = \mathrm{red}(f_i^{-1}(E_i) \cup f_i^{-1}(D_i)), has only normal crossings with D_i;

  4. the last boundary E_r has only normal crossings, and the last weak transform J_r has order less than d at every point of X_r.

This is one round of order reduction: it lowers the maximal order of the ideal while keeping the accumulated exceptional divisor, together with the original boundary, a normal crossings divisor. Iterating it gives Main Theorem II(N) (Theorem 4.2.2.1). The statement includes the degenerate case d = 0, in which J = \mathcal{O}_X and condition (4) can hold only on an empty X_r; blowing up the irreducible components of X one after another achieves it, since Hironaka's monoidal transformation is empty over a centre that is a whole component.

Condition (1) is HasRegularIrreducibleCenters, and condition (3) with the first half of (4) is HasSncBoundaries (Definition 4.2.1.1). The statement also uses the order \nu(J_x) (Definition 2.1.3.2), stalks and nonzero stalks (Definition 2.1.3.1), Hironaka's normal crossings (Definition 2.1.5.1), and the weak transforms and boundaries along a succession (Definition 2.4.1.2, Definition 2.2.5.2).

Lean code for Theorem4.2.1.2●1 theorem
Proof for Theorem 4.2.1.2
Proof uses 2
Proof dependency previews
Preview
Definition 2.1.2.1
Loading preview
Proof dependency preview content is loaded from the rendered-fragment cache.

For 0 < d: on each irreducible component of X on which the order d is attained, one round of Kollár's order reduction of order d [Kol07, Theorem 68] on the triple (component, J, E_0), with E_0 read as the simple normal crossings family of its irreducible components. Its value is a smooth blow-up sequence of order d [Kol07, Definition 66] whose last weak transform has maximal order less than d. Its centres are smooth but possibly reducible; blowing up their (disjoint) irreducible components one after another gives irreducible centres with the same composite, last weak transform and last boundary. Hironaka's conditions are read off Kollár's Definition 66; the successions of the components, each extended by the unit ideal across the complement, are concatenated, and the conditions, all pointwise, transport along the stage lifts and the untouched opens. In the degenerate case d = 0 the succession blows up the irreducible components of X one after another: they are pairwise disjoint on the smooth X, the blow-up along a whole component deletes it and is an open immersion elsewhere, so the last stage is empty, condition (2) reads 0 \le \nu, and condition (4) is vacuous.

4.2.2. Main Theorem II(N): principalization🔗

Statement uses 8
Statement dependency previews
Preview
Definition 2.1.1.1
Loading preview
Statement dependency preview content is loaded from the rendered-fragment cache.
used by 0✓L∃∀N

Let X be a smooth algebraic k-scheme, J an ideal sheaf with nonzero stalks and E a reduced closed subscheme having only normal crossings. Then there is a finite succession of monoidal transformations with centres B_i such that

  1. every centre B_i is non-singular and irreducible;

  2. for each i there is a positive integer d_i which is the maximal order of the weak transform J_i and is its order at every point of B_i;

  3. the boundary E_i has only normal crossings with B_i;

  4. E_r has only normal crossings and J_r = \mathcal{O}_{X_r}.

This is principalization: after the succession the weak transform of J is the unit ideal, so the total transform of J is a product of powers of the exceptional divisors. Every centre lies in the locus of maximal order of the current weak transform. Hironaka writes the boundaries as \mathrm{red}(f_i^{-1}(E_i \cup B_i)), Main Theorem II as \mathrm{red}(f_i^{-1}(E_i) \cup f_i^{-1}(D_i)): the same reduced subscheme. For J = \mathcal{O}_X the empty succession satisfies every condition.

Conditions (1), (3) and the first half of (4) are those of Main Theorem II (Definition 4.2.1.1).

Lean code for Theorem4.2.2.1●1 theorem
Proof for Theorem 4.2.2.1

By induction on a bound for the maximal order of J, iterating the order reduction of Main Theorem II (Theorem 4.2.1.2): if the maximal order is 0 then J is the unit ideal and the empty succession does; otherwise one round of order d = \max \operatorname{ord} J lowers the maximal order of the weak transform, and the induction hypothesis applies at its last stage. Condition (2) at the stages of a round is the order-d condition on its centres, which is why Kollár's Theorem 68 rather than his Theorem 35 is iterated. Hironaka instead deduces Main Theorem II(N) from his fundamental theorem II₂^N, applied on each irreducible component to the resolution datum (E_1, \dots, E_\alpha \mid 0, \dots, 0 \mid J, 1) [Hir64, pp. 176–177]; that route is not followed.

4.2.3. Corollary 1: trivialization of a system of ideal sheaves🔗

Corollary 1 makes one of finitely many ideal sheaves the unit ideal at every point. Its centres satisfy the condition of Main Theorem II (Definition 4.2.1.1), and along them the order of every weak transform is constant and positive.

Constant positive order along the centres.

uses 1used by 1✓L∃∀N

For a succession S of a scheme X and an ideal sheaf J on X, S.HasConstantPositiveOrderAlongCenters J says that for every i there is a positive integer c that is the order of the weak transform J_i (Definition 2.4.1.2, Definition 2.1.3.2) at every point of the centre D_i [Hir64, Corollary 1 (1)].

Lean code for Definition4.2.3.1●1 definition
Statement uses 7
Statement dependency previews
Preview
Definition 2.1.1.1
Loading preview
Statement dependency preview content is loaded from the rendered-fragment cache.
used by 0✓L∃∀N

Let X be a smooth algebraic k-scheme, k of characteristic zero, and J_1, \dots, J_e (e \ge 1) ideal sheaves on X with nonzero stalks. Then there is a finite succession of monoidal transformations f_i \colon X_{i+1} \to X_i with non-singular irreducible centres D_i \subseteq X_i such that

  1. every weak transform J_j(i) of every J_j has a constant positive order along D_i;

  2. at every point of the end result X_r at least one of the weak transforms J_j(r) is the unit ideal.

This is Hironaka's trivialization of a system of coherent sheaves of ideals: after the succession the common cosupport of the weak transforms is empty. The constant of (1) may depend on i and j. The condition on the centres is HasRegularIrreducibleCenters (Definition 4.2.1.1), and condition (1) is HasConstantPositiveOrderAlongCenters for each J_j (Definition 4.2.3.1); the weak transforms are those of Main Theorem II (Definition 2.4.1.2).

Lean code for Theorem4.2.3.2●1 theorem
Proof for Theorem 4.2.3.2

For X smooth of a single relative dimension, Hironaka's own argument: induction on the maximal order d of \prod_j J_j on the common cosupport \bigcap_j |J_j|, each step one round of the order reduction of Main Theorem II (Theorem 4.2.1.2) on the open set X \setminus S, S being Hironaka's closed set of the points of T = \{\nu(\prod_j J_j) \ge d\} at which some J_j is already trivial, extended back across S. The orders of the factors add up to that of the product, so each factor has constant positive order along the centres, and the induction ends when the common cosupport is empty, that is, when at every point some factor is trivial. A general smooth X is treated component by component: its irreducible components are disjoint closed opens, each smooth of one relative dimension, and their successions, extended by the unit ideal across the complement, are concatenated.

4.2.4. Functorial principalization🔗

Kollár's functorial principalization assigns a succession of blow-ups to every triple at once, by one rule. It asserts of each value that it principalizes the triple, and of the rule that it commutes with smooth morphisms, with change of the base field and, for an empty boundary, with closed embeddings. Functorial resolution and embedded desingularization assert some of these properties again.

Triples.

Definition4.2.4.1source[Kol07, Notation 64] ↗
Statement uses 4
Statement dependency previews
Preview
Definition 2.1.1.1
Loading preview
Statement dependency preview content is loaded from the rendered-fragment cache.
Used by 3
Reverse dependency previews
Preview
Definition 4.2.4.2
Loading preview
Reverse dependency preview content is loaded from the rendered-fragment cache.
✓L∃∀N

A Triple k is Kollár's triple (X, I, E), the input of functorial principalization (Theorem 4.2.4.6): a smooth, equidimensional algebraic k-scheme X (smooth of a single relative dimension over k), an ideal sheaf I with nonzero stalks, and a simple normal crossings divisor family E with ordered index set (Definition 2.4.2.2). A morphism (Y, J, F) \to (X, I, E) is a k-morphism h \colon Y \to X with J = h^* I and F = h^{-1} E, so that the source is the pull-back of the target [Kol07, 34.1]. A base change along \sigma \colon k \to L is a cartesian square over \operatorname{Spec} \sigma along which the ideal sheaf and the boundary pull back.

Lean code for Definition4.2.4.1●7 definitions

Principalization of a triple.

Definition4.2.4.2source[Kol07, Theorem 35 (1)–(3)] ↗
Statement uses 5
Statement dependency previews
Preview
Definition 2.1.1.1
Loading preview
Statement dependency preview content is loaded from the rendered-fragment cache.
Used by 2
Reverse dependency previews
Preview
Theorem 4.2.4.6
Loading preview
Reverse dependency preview content is loaded from the rendered-fragment cache.
✓L∃∀N

S.HasSmoothSncCenters E: every centre of S is smooth over k and has simple normal crossings with the total transform of the divisor family E at its stage (Definition 2.4.2.4) [Kol07, Theorem 35 (1)]. A triple T = (X, I, E) is principalized by a succession with composite \Pi (T.IsPrincipalizedBy S) when (1) S.HasSmoothSncCenters E; (2) \Pi^* I is the ideal sheaf of a simple normal crossings divisor (IsIdealOfSncDivisor, Definition 2.4.2.3); (3) \Pi is an isomorphism over X \setminus (\operatorname{cosupp} I \cup \operatorname{Sing} E).

Lean code for Definition4.2.4.2●2 definitions

Commuting with smooth morphisms. Kollár's condition [Kol07, 34.1] on a blow-up sequence functor B (Definition 2.4.4.1) is an equality of successions: for every smooth morphism of inputs h \colon Y \to X,

B(Y) = \bigl(h^* B(X)\bigr)_{\text{empty blow-ups deleted}}

(((B X).pullback h).eraseEmpty, Definition 2.4.3.1). The deletion is needed because a restriction can contain empty blow-ups; taking h to be the identity shows that B(X) has none. Since the centres are closed subschemes and their pull-back is a function, the equality is literal, not up to isomorphism. For open immersions it makes B local: B(X) can be computed on an open cover and glued [Kol07, Proposition 37]. Commuting with change of fields (34.2) is the same equality along the base change X_L \to X for a field extension k \to L, which is why B is one family of functors for all fields of characteristic zero.

Definition4.2.4.3source[Kol07, 34.1] ↗
uses 1
Used by 3
Reverse dependency previews
Preview
Theorem 4.2.4.6
Loading preview
Reverse dependency preview content is loaded from the rendered-fragment cache.
✓L∃∀N

A blow-up sequence functor B commutes with smooth morphisms (CommutesWithSmoothMorphisms B, [Kol07, 34.1]) if, for every morphism of inputs h \colon Y \to X with smooth underlying morphism, B(Y) is the pull-back h^* B(X) when h is surjective, and h^* B(X) with the blow-ups with empty centre deleted in general (Definition 2.4.3.1). These are Kollár's two bullets. The first follows from the second when B(X) has no empty blow-ups, since a surjective h pulls back no nonempty centre to an empty one; and the second, for h the identity, says that B(X) has no empty blow-ups. Kollár states both, and so does the definition.

Lean code for Definition4.2.4.3●1 definition

Commuting with change of fields.

Definition4.2.4.4source[Kol07, 34.2] ↗
uses 1
Used by 4
Reverse dependency previews
Preview
Theorem 4.2.4.6
Loading preview
Reverse dependency preview content is loaded from the rendered-fragment cache.
✓L∃∀N

HasChangeOfFields C, for a family of categories of inputs indexed by the fields, says what a base change of an input along a field extension is: IsFieldBaseChange σ p for inputs X over k, XL over L and a morphism p of underlying schemes says that p exhibits XL as X \times_{\operatorname{Spec} k} \operatorname{Spec} L with its extra structure (Definition 4.2.4.1, Definition 4.2.6.1).

A family B of blow-up sequence functors, one for each field of characteristic zero, commutes with change of fields (CommutesWithChangeOfFields B, [Kol07, 34.2]) if, for a field extension \sigma \colon k \to L and an input over L exhibited as the base change of an input X over k by p, the value over L is p^* B_k(X). The ring map \sigma may be an automorphism of k, so the condition includes invariance under the automorphisms of k, as Kollár's does.

Lean code for Definition4.2.4.4●3 definitions

Commuting with closed embeddings.

Definition4.2.4.5source[Kol07, 34.3] ↗
Statement uses 2
Statement dependency previews
Preview
Definition 2.4.4.1
Loading preview
Statement dependency preview content is loaded from the rendered-fragment cache.
used by 1✓L∃∀N

A blow-up sequence functor B on triples commutes with closed embeddings of empty boundary (CommutesWithClosedEmbeddingsOfEmptyBoundary B, [Kol07, 34.3] for E = \emptyset) if, for a closed embedding j \colon Y \hookrightarrow X and triples (Y, I_Y, \emptyset) and (X, j_* I_Y, \emptyset), B(X, j_* I_Y, \emptyset) = j_* B(Y, I_Y, \emptyset), the push-forward of a succession along j (Definition 2.4.3.1). Kollár states 34.3 for a boundary having simple normal crossings with Y; his Theorem 35 (5) asserts it only for E = \emptyset.

Lean code for Definition4.2.4.5●1 definition
Theorem4.2.4.6source[Kol07, Theorem 35] ↗
Statement uses 6
Statement dependency previews
Preview
Definition 2.4.4.1
Loading preview
Statement dependency preview content is loaded from the rendered-fragment cache.
used by 0✓L∃∀N

There is a family BP of blow-up sequence functors on triples, one for each field k of characteristic zero, assigning a succession of blow-ups \Pi \colon X_r \to X to every triple (X, I, E) of a smooth equidimensional algebraic k-scheme, an ideal sheaf with nonzero stalks and a simple normal crossings divisor family, such that

  1. every centre is smooth over k and has simple normal crossings with the total transform of E at its stage;

  2. \Pi^* I is the ideal sheaf of a simple normal crossings divisor;

  3. \Pi is an isomorphism over X \setminus (\operatorname{cosupp} I \cup \operatorname{Sing} E);

  4. BP commutes with smooth morphisms h \colon Y \to X (the value on the pulled-back triple is h^* BP(X, I, E), with empty blow-ups deleted when h is not surjective) and with change of the base field;

  5. when E = \emptyset, BP commutes with closed embeddings.

What distinguishes Kollár's theorem from Main Theorem II(N) (Theorem 4.2.2.1) is that the succession is chosen for all inputs at once, by one rule, and the rule is compatible with smooth morphisms and field extensions; this is what lets the resolution of an arbitrary scheme be glued from local pieces (Theorem 4.2.6.3).

Conditions (1)–(3) are Triple.IsPrincipalizedBy (Definition 4.2.4.2); condition (4) is CommutesWithSmoothMorphisms and CommutesWithChangeOfFields (Definition 4.2.4.3, Definition 4.2.4.4), and condition (5) CommutesWithClosedEmbeddingsOfEmptyBoundary (Definition 4.2.4.5). The inputs are triples (Definition 4.2.4.1), and the vocabulary is that of blow-up sequences and their functors (Definition 2.4.1.1, Definition 2.4.3.1, Definition 2.4.4.1), divisor families and simple normal crossings (Definition 2.4.2.1, Definition 2.4.2.2, Definition 2.4.2.4).

Lean code for Theorem4.2.4.6●1 theorem
Proof for Theorem 4.2.4.6
Proof uses 6
Proof dependency previews
Preview
Definition 2.1.1.1
Loading preview
Proof dependency preview content is loaded from the rendered-fragment cache.

The functor is Kollár's construction [Kol07, 72]: blow up the intersections of the components of E, which makes them disjoint, then run the order reduction BMO_1 of [Kol07, Theorem 69] on the resulting triple, deleting the empty blow-ups [Kol07, 32]. Each of the five conditions is a separate theorem of the library about this functor.

4.2.5. Corollary 3: simplification of a boundary🔗

Statement uses 6
Statement dependency previews
Preview
Definition 2.1.1.1
Loading preview
Statement dependency preview content is loaded from the rendered-fragment cache.
used by 0✓L∃∀N

Let X be a smooth algebraic k-scheme, k of characteristic zero, and W a nowhere dense closed subscheme of X. Then there is a finite succession of monoidal transformations f_i \colon X_{i+1} \to X_i with non-singular centres D_i \subseteq X_i such that

  1. the end result X_r is non-singular;

  2. every centre lies over W: D_i \subseteq \bar f_i^{-1}(W), where \bar f_i = f_0 \circ \cdots \circ f_{i-1} \colon X_i \to X;

  3. the associated reduced scheme \mathrm{red}(\bar f_r^{-1}(W)) of \bar f_r^{-1}(W) is defined by an invertible sheaf of ideals on X_r and has only normal crossings.

This is the simplification of an algebraic boundary: after blowing up over W only, the inverse image of W becomes a normal crossings divisor. Hironaka asks nothing of W beyond nowhere density; W may be empty, for which the empty succession satisfies every condition.

The statement uses regularity (Definition 2.1.2.1), invertible ideal sheaves (Definition 2.1.4.1) and Hironaka's normal crossings (Definition 2.1.5.1).

Lean code for Theorem4.2.5.1●1 theorem
Proof for Theorem 4.2.5.1
uses 0

For X smooth of a single relative dimension, Kollár's functorial principalization (Theorem 4.2.4.6) applied to the triple (X, I_W, \emptyset) rather than, as in Hironaka, Main Theorem II. Nowhere density of the support makes I_W nonzero on every irreducible component, as a triple requires; the centres of the principalization lie over V(I_W), its end result is smooth over k and hence non-singular, and its condition (2) writes the pull-back of I_W as a product of powers of the members of a simple normal crossings family, whose radical is the reduced union of the members that occur, invertible and with only normal crossings. Every smooth X is treated component by component, the final conditions read on the stalks.

4.2.6. Functorial resolution🔗

Kollár's functorial resolution assigns a succession of blow-ups to every reduced equidimensional algebraic k-scheme. It asserts of each value that it is a strong resolution, and of the rule that it commutes with smooth morphisms and with change of the base field, as functorial principalization does (Definition 4.2.4.3, Definition 4.2.4.4).

Reduced equidimensional schemes.

Definition4.2.6.1source[Kol07, Theorem 36] ↗
Statement uses 4
Statement dependency previews
Preview
Definition 2.1.1.1
Loading preview
Statement dependency preview content is loaded from the rendered-fragment cache.
Used by 3
Reverse dependency previews
Preview
Theorem 4.2.6.3
Loading preview
Reverse dependency preview content is loaded from the rendered-fragment cache.
✓L∃∀N

ReducedEquidimensionalScheme k is the full subcategory of AlgScheme k of the schemes X that are reduced and equidimensional (Scheme.IsReducedEquidimensional: X is reduced and its smooth locus over k is smooth of a single relative dimension). The irreducible components of such an X may meet: the two axes xy = 0 in the plane are an input, and so is every reduced simple normal crossings scheme. These are the inputs of Kollár's functorial resolution (Theorem 4.2.6.3); the equidimensionality is that of [Kol07, Notation 64 (1)], transported from smooth to reduced schemes through the smooth locus. For a reduced X of finite type over a field of characteristic zero the smooth locus is dense and contains every generic point, so the condition says that all irreducible components of X have the same dimension; it is phrased through the smooth locus because the intrinsic form needs the dimension of an integral scheme of finite type over k to be the transcendence degree of its function field, which Mathlib does not provide. A base change along a field extension \sigma \colon k \to L is a cartesian square over \operatorname{Spec} \sigma (hasChangeOfFields). The class is stable under open subschemes and under finite disjoint unions of open subschemes of one input; it is also stable under change of fields and under étale morphisms (a reduced scheme of finite type over a field of characteristic zero is geometrically reduced, and smoothness is stable under base change and local in the fpqc topology on the base), facts the library records but does not formalize.

Lean code for Definition4.2.6.1●4 definitions

Strong resolutions.

Definition4.2.6.2source[Kol07, (2) and (3)] ↗
Statement uses 3
Statement dependency previews
Preview
Definition 2.1.1.1
Loading preview
Statement dependency preview content is loaded from the rendered-fragment cache.
Used by 2
Reverse dependency previews
Preview
Theorem 4.2.6.3
Loading preview
Reverse dependency preview content is loaded from the rendered-fragment cache.
✓L∃∀N

For a succession S of an algebraic k-scheme X with composite \Pi \colon X_r \to X:

  • S.IsResolution [Kol07, (2)]: X_r is smooth over k, \Pi is projective (IsProjective, Definition 2.3.3.1; hence proper), and \Pi is birational, an isomorphism over a dense open subset of X. Reading birationality as an isomorphism over a dense open subset is right for a reduced X, the case of the theorems.

  • S.IsStrongResolution [Kol07, (3)], conditions (1)–(3) of Theorem 36: a resolution that is an isomorphism over the smooth locus X^{ns} (Mathlib's smoothLocus of the structure morphism) and such that \Pi^{-1}(\operatorname{Sing} X), \operatorname{Sing} X the complement of the smooth locus, is a simple normal crossings divisor (IsSncDivisor, Definition 2.4.2.3). Over a field of characteristic zero the smooth locus is the set of points with regular local ring (Scheme.mem_smoothLocus_iff_isRegularAt), so the smooth and the regular readings of Kollár's conditions agree; and for a reduced X the smooth locus is dense, so the isomorphism over it already gives the birationality asked of a resolution.

Lean code for Definition4.2.6.2●2 definitions

Kollár's resolution functor. Kollár's resolution functor [Kol07, (4)] is a resolution \Pi_X \colon R(X) \to X of every X together with, for every smooth h \colon Y \to X, a morphism R(h) \colon R(Y) \to R(X) over h, functorial in h, such that every square is cartesian: R(Y) \cong R(X) \times_X Y over Y. A blow-up sequence functor B that commutes with smooth morphisms (Definition 4.2.4.3) and whose values are resolutions gives this, with R(X) the last stage of B(X) and \Pi_X its composite: the stages of h^* B(X) are fibre products, so R(h) is the projection from R(X) \times_X Y, and deleting empty blow-ups does not change the composite, an empty blow-up being an isomorphism. Conversely R(h) is determined by the values: two morphisms R(Y) \to R(X) over h agree over the smooth locus of Y, which h maps into that of X, where \Pi_X is an isomorphism; its preimage is dense in the smooth R(Y), and R(X) is separated, so they agree everywhere. Hence R(h) is unique, its functoriality is automatic, and a functor commuting with smooth morphisms amounts to its values together with the property \Pi_Y \cong h^* \Pi_X [Kol07, 34]; this is why Kollár specifies R by its values alone, and why the library states it as an assignment of successions with a property. Smooth morphisms are the most one can ask for: the quotient map \mathbb{A}^2 \to (uv = w^2) does not lift to resolutions [Kol07, Example 3.4].

Theorem4.2.6.3source[Kol07, Theorem 36] ↗
Statement uses 7
Statement dependency previews
Preview
Definition 2.1.1.1
Loading preview
Statement dependency preview content is loaded from the rendered-fragment cache.
used by 1✓L∃∀N

There is a family BR of blow-up sequence functors, one for each field k of characteristic zero, assigning a succession of blow-ups \Pi \colon X_r \to X to every reduced equidimensional algebraic k-scheme X over k, such that

  1. X_r is smooth over k;

  2. \Pi is an isomorphism over the smooth locus of X;

  3. \Pi^{-1}(\operatorname{Sing} X) is the support of a simple normal crossings divisor;

  4. BR commutes with smooth morphisms and with change of the base field.

Moreover \Pi is projective and birational. This is resolution of singularities in its functorial form: a smooth X_r mapping onto X, changing nothing over the smooth points, with exceptional locus a simple normal crossings divisor, and compatible with the smooth morphisms between inputs — every open subscheme and every étale cover by inputs among them — so that it is local on X in the smooth topology as far as inputs reach. A smooth equidimensional scheme is an input, and \Pi may then be the identity; the irreducible components of an input may meet.

Conditions (1)–(3) are BlowUpSequence.IsStrongResolution (Definition 4.2.6.2), and condition (4) is CommutesWithSmoothMorphisms and CommutesWithChangeOfFields (Definition 4.2.4.3, Definition 4.2.4.4); the inputs are the objects of ReducedEquidimensionalScheme (Definition 4.2.6.1).

Lean code for Theorem4.2.6.3●1 theorem
Proof for Theorem 4.2.6.3
Proof uses 3
Proof dependency previews
Preview
Definition 2.1.2.1
Loading preview
Proof dependency preview content is loaded from the rendered-fragment cache.

On an affine input the functor embeds X in a smooth affine scheme A and runs the principalization BP(A, I_X, \emptyset) (Theorem 4.2.4.6), restricted to X and truncated at the first centre containing the strict transform of X, as in the proof of [Kol07, Corollary 22]. That centre contains the strict transform of every irreducible component of X at once. The centre absorbing a component C has a point over every point of C, in particular over a smooth closed point of C; a centre that comes before the absorption of another component C' has no point over the generic point of C', hence none over a general smooth closed point of C'. But when all components have one dimension, any two smooth closed points of X are étale equivalent as embedded points of A, through a pair of étale neighbourhoods, along which the run pulls back (Theorem 4.2.4.6, (4)); so a centre has a point over one exactly when it has one over the other, and no component is absorbed before another. How the components meet plays no role. On any input the functor is obtained by descent along the smooth surjection from a finite affine cover [Kol07, Proposition 37 and Warning 38]; independence of the embedding is [Kol07, Lemma 39], and condition (4) uses Kollár's reduction of (34.1) to Theorem 35 through [Kol07, Lemma 41]. \Pi is projective as a composite of blow-ups of a Noetherian scheme: the composite is a single blow-up (Hironaka's remark after Main Theorem I; [TSPA, Tag 080B]), and a blow-up is a closed subscheme of the projective bundle of its ideal sheaf (Definition 2.3.3.1).

4.2.7. Strong resolution of a variety🔗

Theorem4.2.7.1source[Kol07, Theorem 27] ↗
Statement uses 4
Statement dependency previews
Preview
Definition 2.1.1.1
Loading preview
Statement dependency preview content is loaded from the rendered-fragment cache.
used by 0✓L∃∀N

Let X be a variety, an integral algebraic k-scheme, over a field k of characteristic zero. Then there is a birational and projective morphism \Pi \colon X' \to X, the composite of a succession of blow-ups of X, such that

  1. X' is smooth over k;

  2. \Pi is an isomorphism over the smooth locus X^{ns};

  3. \Pi^{-1}(\operatorname{Sing} X) is the support of a simple normal crossings divisor.

This is resolution of singularities in its usual, strong form [Kol07, (3)]: a smooth X' with a projective birational morphism to X, here a succession of blow-ups. Kollár's weaker form [Kol07, Corollary 22], a smooth X' with a birational projective morphism to X and no conditions (2) and (3), is the part IsResolution of the conclusion. The conclusion is BlowUpSequence.IsStrongResolution (Definition 4.2.6.2), the same as in functorial resolution (Theorem 4.2.6.3); birationality is the isomorphism over a dense open subset of X, here the smooth locus.

Lean code for Theorem4.2.7.1●1 theorem
  • theorem exists_strong_resolution {k : Type u} [Field k] [CharZero k]
      (X : AlgScheme k) [AlgebraicGeometry.IsIntegral X.left] :
      ∃ S, S.IsStrongResolution
    theorem exists_strong_resolution {k : Type u}
      [Field k] [CharZero k] (X : AlgScheme k)
      [AlgebraicGeometry.IsIntegral X.left] :
      ∃ S, S.IsStrongResolution

    Kollár's strong resolution of singularities [Kol07, Theorem 27]. Let X be a variety (an integral algebraic k-scheme) over a field k of characteristic zero. Then there is a birational and projective morphism Π : X' → X, the composite S.composite of a succession of blow-ups S of X, that is a strong resolution of X (BlowUpSequence.IsStrongResolution): (1) X' is smooth over k; (2) Π is an isomorphism over the smooth locus X^{ns}; (3) Π⁻¹(Sing X) is the support of a simple normal crossing divisor. Projectivity and birationality are part of BlowUpSequence.IsResolution; birationality is the isomorphism over a dense open subset of X, here the smooth locus.

    This is resolution of singularities in its usual form: a smooth X' with a projective birational morphism to X, here a succession of blow-ups. Kollár's weaker form [Kol07, Corollary 22], a smooth X' with a birational projective morphism to X and no conditions (2) and (3), is the part BlowUpSequence.IsResolution of the conclusion.

    Source statement: [Kol07, Theorem 27]

Proof for Theorem 4.2.7.1
Proof uses 5
Proof dependency previews
Preview
Definition 2.4.4.1
Loading preview
Proof dependency preview content is loaded from the rendered-fragment cache.

An integral X is an input of Kollár's functorial resolution (Theorem 4.2.6.3): it is reduced, and its smooth locus is a nonempty integral open subscheme, smooth of one relative dimension. The succession is the value BR(X).

4.2.8. Main Theorem I🔗

Statement uses 4
Statement dependency previews
Preview
Definition 2.1.1.1
Loading preview
Statement dependency preview content is loaded from the rendered-fragment cache.
used by 1✓L∃∀N

Let k be a field of characteristic zero and X a reduced and irreducible algebraic k-scheme. Then there is a closed subscheme D \subseteq X whose set of points is exactly the singular locus of X, and such that the monoidal transformation of X with centre D is non-singular.

In words: one blow-up, with a centre supported exactly on the singular points, resolves X. When X is already non-singular the singular locus is empty, D is the empty subscheme (the unit ideal sheaf) and its blow-up is X itself. The centre D need not be reduced: it comes from a finite succession of blow-ups, which is a single blow-up with a suitably chosen centre.

The definitions the statement uses are the singular locus and regularity (Definition 2.1.2.1), the monoidal transformation, which is the blow-up (Definition 2.2.2.2), and, underneath it, the construction of the blow-up (Definition 2.2.2.1, Definition 2.2.1.2, Definition 2.2.1.1).

Lean code for Theorem4.2.8.1●1 theorem
Proof for Theorem 4.2.8.1

The library derives the theorem from functorial resolution (Theorem 4.2.6.3) and functorial principalization (Theorem 4.2.4.6). The integral scheme X is an input of the resolution functor, whose value is a finite succession of blow-ups with smooth last stage; its centres lie over the singular locus, since the principalization functor from which it is built never blows up over a smooth point. It is followed by a principalization of the pull-back of the reduced ideal \mathcal{J} of the singular locus. By Hironaka's remark [Hir64, pp. 132–133] the composite is one blow-up K.blowUp, with K supported in the singular locus. Then D = K \cdot \mathcal{J} has support the whole singular locus, and its blow-up is that of K followed by the blow-up of an invertible ideal, an isomorphism; so it is smooth over k, hence non-singular.

4.2.9. Main Theorem I, weak form🔗

Statement uses 4
Statement dependency previews
Preview
Definition 2.1.1.1
Loading preview
Statement dependency preview content is loaded from the rendered-fragment cache.
used by 0✓L∃∀N

Let k be a field of characteristic zero and X a reduced and irreducible algebraic k-scheme. Then there is a closed subscheme D with dense open complement U such that the monoidal transformation f \colon X' \to X with centre D restricts to an isomorphism f^{-1}(U) \to U and X' is non-singular.

Hironaka states this form in the paragraph after Main Theorem I, by weakening condition (i). The density of U excludes the trivial centre D = X. As in Main Theorem I, "reduced and irreducible" is IsIntegral.

Lean code for Theorem4.2.9.1●1 theorem
Proof for Theorem 4.2.9.1

Hironaka's derivation from Main Theorem I (Theorem 4.2.8.1) by weakening its first condition [Hir64, p. 132]: for the centre D of Main Theorem I, with |D| = \operatorname{Sing} X, the blow-up is an isomorphism over the complement of its centre, and that complement is open and contains the generic point of the irreducible X, whose local ring is a field, so it is dense.

4.2.10. Embedded desingularization with smooth centres🔗

Włodarczyk's embedded desingularization assigns a succession of blow-ups to every embedded pair. It asserts of each value that it desingularizes the pair, and of the rule a form of commuting with smooth morphisms adapted to the embedded subscheme.

Embedded pairs.

Definition4.2.10.1source[Wlo05, Theorem 1.0.2] ↗
Statement uses 3
Statement dependency previews
Preview
Definition 2.1.1.1
Loading preview
Statement dependency preview content is loaded from the rendered-fragment cache.
Used by 3
Reverse dependency previews
Preview
Definition 4.2.10.2
Loading preview
Reverse dependency preview content is loaded from the rendered-fragment cache.
✓L∃∀N

An EmbeddedPair k is a reduced closed subscheme Y of a smooth, equidimensional algebraic k-scheme X, given by its ideal sheaf: the input of Włodarczyk's embedded desingularization (Theorem 4.2.10.4). A morphism (X', Y') \to (X, Y) is a k-morphism h \colon X' \to X along which the ideal sheaf of Y pulls back to that of Y'.

Lean code for Definition4.2.10.1●5 definitions

Embedded desingularization of a pair.

Statement uses 3
Statement dependency previews
Preview
Definition 2.1.1.1
Loading preview
Statement dependency preview content is loaded from the rendered-fragment cache.
used by 1✓L∃∀N

An embedded pair P = (X, Y) is desingularized by a succession S with composite \sigma \colon X_r \to X (P.IsDesingularizedBy S) when, with exceptional divisors E_i (the total transforms of the empty divisor family) and strict transforms Y_i of Y (Definition 2.4.1.2, Definition 2.4.2.4):

  • every centre C_i is smooth over k and has simple normal crossings with E_i (S.HasSmoothSncCenters of the empty family, Definition 4.2.4.2);

  • (a) every E_i, the last included, is a simple normal crossings family;

  • (b) no point of C_i \cap Y_i lies over a point of \operatorname{Reg}(Y), the image in X of the smooth locus of Y \to \operatorname{Spec} k;

  • (c) \tilde Y = Y_r is smooth over k and has simple normal crossings with E_r;

  • (e) \sigma^*(I_Y) = I_{\tilde Y} \cdot J for the ideal sheaf J of a simple normal crossings divisor supported in E_r.

Lean code for Definition4.2.10.2●1 definition

Commuting with smooth morphisms meeting the components.

Definition4.2.10.3source[Wlo05, Theorem 1.0.2 (d)] ↗
Statement uses 2
Statement dependency previews
Preview
Definition 2.4.4.1
Loading preview
Statement dependency preview content is loaded from the rendered-fragment cache.
used by 1✓L∃∀N

A blow-up sequence functor B on embedded pairs commutes with smooth morphisms meeting the components (CommutesWithSmoothMorphismsMeetingComponents B) if, for every morphism of embedded pairs h \colon (X', Y') \to (X, Y) with smooth underlying morphism, B(X', Y') is the pull-back h^* B(X, Y) when h is surjective, and h^* B(X, Y) with the blow-ups with empty centre deleted when the image of h meets every irreducible component of Y (Definition 2.4.3.1). This is Włodarczyk's [Wlo05, Theorem 1.0.2 (d)] in the form proved here; Kollár's commuting with smooth morphisms (Definition 4.2.4.3) asks the second equality for every smooth h.

Lean code for Definition4.2.10.3●1 definition
Theorem4.2.10.4source[Wlo05, Theorem 1.0.2] ↗
Statement uses 4
Statement dependency previews
Preview
Definition 2.4.4.1
Loading preview
Statement dependency preview content is loaded from the rendered-fragment cache.
used by 0✓L∃∀N

There is a family ED of blow-up sequence functors on embedded pairs, one for each field k of characteristic zero, assigning a succession of blow-ups \sigma \colon X_r \to X to every reduced closed subscheme Y of a smooth equidimensional algebraic k-scheme X, such that, with E_i the exceptional divisors and Y_i the strict transforms of Y:

  • every centre C_i is smooth over k;

  • (a) every E_i is a simple normal crossings family, and C_i has simple normal crossings with E_i;

  • (b) no point of C_i \cap Y_i lies over a smooth point of Y;

  • (c) the final strict transform \tilde Y = Y_r is smooth and has simple normal crossings with E_r;

  • (e) \sigma^*(I_Y) = I_{\tilde Y} \cdot J with J the ideal of a simple normal crossings divisor supported on E_r;

  • (d) for a morphism of embedded pairs h \colon (X', Y') \to (X, Y) with smooth underlying morphism, ED(X', Y') is h^* ED(X, Y) if h is surjective, and h^* ED(X, Y) with the empty blow-ups deleted if the image of h meets every irreducible component of Y.

Embedded desingularization resolves Y inside its ambient X while keeping everything in normal crossings position, and condition (b) says that nothing is blown up over the smooth part of Y. If Y = X, (b) forces every centre to be empty; if Y is empty or smooth, the conditions other than (d) hold for the empty succession.

The conditions other than (d) are EmbeddedPair.IsDesingularizedBy (Definition 4.2.10.2) and (d) is CommutesWithSmoothMorphismsMeetingComponents (Definition 4.2.10.3); the inputs are embedded pairs (Definition 4.2.10.1). The statement uses strict and total transforms along a succession (Definition 2.4.1.2, Definition 2.4.2.4) and simple normal crossings (Definition 2.4.2.2).

Lean code for Theorem4.2.10.4●1 theorem
  • theorem exists_functorial_embeddedDesingularization :
      ∃ ED,
        (∀ (k : Type u) [inst : Field k] [inst_1 : CharZero k]
            (P : EmbeddedPair k), P.IsDesingularizedBy (ED k P)) ∧
          ∀ (k : Type u) [inst : Field k] [inst_1 : CharZero k],
            CommutesWithSmoothMorphismsMeetingComponents (ED k)
    theorem exists_functorial_embeddedDesingularization :
      ∃ ED,
        (∀ (k : Type u) [inst : Field k]
            [inst_1 : CharZero k]
            (P : EmbeddedPair k),
            P.IsDesingularizedBy (ED k P)) ∧
          ∀ (k : Type u) [inst : Field k]
            [inst_1 : CharZero k],
            CommutesWithSmoothMorphismsMeetingComponents
              (ED k)

    Włodarczyk's embedded desingularization with smooth centres [Wlo05, Theorem 1.0.2]. There is a family ED of blow-up sequence functors on embedded pairs (BlowUpSequenceFunctor (EmbeddedPair k)), one for each field k of characteristic zero, such that

    • every value S = ED(X, Y), with composite σ : X_r → X, exceptional divisors E_i (the total transforms of the empty divisor family) and strict transforms Y_i of Y, is an embedded desingularization of the pair (EmbeddedPair.IsDesingularizedBy): every centre C_i is smooth over k; (a) every E_i, the last included, is a simple normal crossing family, and C_i has simple normal crossings with E_i; (b) no point of C_i ∩ Y_i lies over a point of Reg(Y), the image in X of the smooth locus of Y → Spec k (the points where Y, not Y_i, is smooth); (c) Ỹ = Y_r is smooth over k and has simple normal crossings with E_r; (e) σ^*(I_Y) = I_Ỹ · J for the ideal sheaf J of a simple normal crossing divisor supported in E_r;

    • (d) for a morphism of embedded pairs h : (X', Y') ⟶ (X, Y) whose underlying morphism is smooth, ED(X', Y') is the pull-back h^* S if h is surjective, and h^* S with the empty blow-ups deleted if the image of h meets every irreducible component of Y (CommutesWithSmoothMorphismsMeetingComponents).

    An embedded pair (EmbeddedPair) is a reduced closed subscheme Y of a smooth, equidimensional algebraic k-scheme X (smooth of one relative dimension over k); a morphism (X', Y') ⟶ (X, Y) is a k-morphism h : X' → X along which the ideal sheaf of Y pulls back to that of Y'. If Y = X (the ideal sheaf ⊥), (b) forces every centre to be empty. If Y is empty or smooth, the clauses on S alone hold for the empty succession.

    Source statement: [Wlo05, Theorem 1.0.2]

Proof for Theorem 4.2.10.4
Proof uses 7
Proof dependency previews
Preview
Definition 2.1.1.1
Loading preview
Proof dependency preview content is loaded from the rendered-fragment cache.

The functor is the stop rule of Włodarczyk's modification of the canonical resolution of the marked ideal (X, I_Y, \emptyset, 1) [Wlo05, §4.6–4.7]: run Kollár's order reduction BMO_1 [Kol07, Theorem 69] until a centre would contain the strict transform of a component of Y, stop before it, divide the ideal by the reduced ideal of the absorbed strict transforms, and restart with the remaining components, until none remain; his reordering of the monomial part is not transcribed.