Documentation

Hironaka.Resolution.Algebraic.OrderReduction.Step21BoundaryClearing

Step 2.1 of order reduction: the boundary-clearing sequence #

Step 2.1 of the proof of [Kol07, Theorem 103] ([Kol07, 104, Step 2.1]) clears the boundary E = E^1 + ⋯ + E^s from the cosupport one member at a time. Starting from (X_0, I_0, E_0) = (X, I, E), the j-th round applies the boundary-clearing functor of [Kol07, Lemma 102] to the triple (X_{r(j−1)}, I_{r(j−1)}, E_{r(j−1)}) induced at the end of the sequence built so far and to the birational transform E^j_{r(j−1)} of the j-th member, extending the sequence to Π_{r(j)} : X_{r(j)} → ⋯ → X_0.

This module defines that construction and proves the two facts the recursion itself needs.

Kollár's standing hypotheses of Step 2, that I is D-balanced and MC-invariant and that a hypersurface of maximal contact exists, are not used by the construction (his Warning before Step 2.1: nothing beyond the order clause is assumed of the transforms); they enter the theorems about it in Hironaka/Resolution/Algebraic/OrderReduction/Step21MaximalContact.lean.

The total transform has at least the members of the original family (card_ι_totalTransformSeq read as an inequality).

theorem Hironaka.BO.bdClass_induced_last {k : Type u} [Field k] [CharZero k] {n m : ℕ} (T : AlgebraicGeometry.Triple k) (hn : T.HasDimLE n) (hmax : T.I.maxOrd ≤ ↑m) {S : T.X.left.BlowUpSequence} (hS : S.IsOrderSeq (T.X.left ↘ AlgebraicGeometry.Spec ↧k) T.I T.E m) (hne : S.NoEmptyCenters) {j : ℕ} (hj : j < Fintype.card T.E.ι) :

The triple induced at the last stage of a smooth blow-up sequence of order m without empty blow-ups, from a triple with dim X ≤ n and max-ord I ≤ m, lies in the boundary-clearing class BDClass n m j of [Kol07, Lemma 102] for every position j < card E.ι. This is what allows [Kol07, 104, Step 2.1] to "apply (102) to X_{r(j−1)}, I_{r(j−1)}, E_{r(j−1)}".

noncomputable def Hironaka.BO.step21Seq {k : Type u} [Field k] [CharZero k] {n m : ℕ} (T : AlgebraicGeometry.Triple k) (hn : T.HasDimLE n) (hmax : T.I.maxOrd ≤ ↑m) (bd : (j : ℕ) → BDData n m j) (j : ℕ) :

The Step 2.1 sequence after j rounds ([Kol07, 104, Step 2.1]): empty at j = 0; at j + 1, for a position j < card E.ι, the sequence after j rounds followed by BD_{n,m,j} applied to the induced triple (X_{r(j)}, I_{r(j)}, E_{r(j)}), whose j-th member is E^j_{r(j)}; unchanged beyond card E.ι. Carried with it: it is a smooth blow-up sequence of order m starting with (X, I, E) without empty blow-ups.

Equations
Instances For