Documentation

Hironaka.Resolution.Algebraic.MaximalContact.Basic

Hypersurfaces of maximal contact: the definitions #

Following [Kol07, 51] and [Kol07, Definitions 78 and 79]. For an ideal sheaf I on a smooth variety X with m = max-ord I, order reduction for I should follow from order reduction for (I|_H, m) on a smooth hypersurface H; for this the points where the birational transforms of I have order ≥ m must stay on the birational transforms of H ([Kol07, 13.3 and 51.1]). The tool is the derivative ideal.

Kollár's standing hypothesis "H a smooth hypersurface" is not a clause of either predicate: it is AlgebraicGeometry.IsSmoothDivisor H ([Kol07, Definition 24]), carried as a hypothesis by the theorems that use it (Theorem 80, going down), so that the predicates have no smoothness clause whose locality would have to be proved separately. The mark m is an explicit parameter and m = max-ord I a hypothesis where used; MC f I 0 = I.

RegularCoords.MC c I m := c.Dpow (m - 1) I (Hironaka/Algebra/Local/MaximalContact.lean) is the same Definition 79 in coordinates on a regular local ring, not a duplicate: at a stalk the two meet through stalkIdeal_derivativeIter and derivativeIter_eq_Dpow.

noncomputable def AlgebraicGeometry.Scheme.IdealSheafData.MC {k : Type u} [Field k] {X : Scheme} (f : X ⟶ Spec ↧k) (I : X.IdealSheafData) (m : ℕ) :

The maximal contact ideal MC(I) := D^{m-1}(I) of I with respect to the mark m (Kollár: m = max-ord I), the iterated derivative ideal sheaf ([Kol07, Definition 79]).

Equations
Instances For
    theorem AlgebraicGeometry.Scheme.IdealSheafData.MC_eq {k : Type u} [Field k] {X : Scheme} (f : X ⟶ Spec ↧k) (I : X.IdealSheafData) (m : ℕ) :
    MC f I m = derivativeIter f (m - 1) I

    MC(I) unfolds to D^{m-1}(I) (definitional).

    theorem AlgebraicGeometry.Scheme.IdealSheafData.MC_succ {k : Type u} [Field k] {X : Scheme} (f : X ⟶ Spec ↧k) (I : X.IdealSheafData) (m : ℕ) :
    MC f I (m + 1) = derivativeIter f m I

    With the mark m + 1, MC(I) = D^m(I) (definitional; m + 1 - 1 = m in ℕ).

    @[simp]
    theorem AlgebraicGeometry.Scheme.IdealSheafData.MC_zero {k : Type u} [Field k] {X : Scheme} (f : X ⟶ Spec ↧k) (I : X.IdealSheafData) :
    MC f I 0 = I

    The boundary case m = 0 (outside Kollár's m = max-ord I ≥ 1): MC f I 0 = I, since 0 - 1 = 0 in ℕ.

    @[simp]
    theorem AlgebraicGeometry.Scheme.IdealSheafData.MC_one {k : Type u} [Field k] {X : Scheme} (f : X ⟶ Spec ↧k) (I : X.IdealSheafData) :
    MC f I 1 = I

    The case m = 1: MC(I) = D^0(I) = I.

    The static form (the hypothesis of [Kol07, Theorem 80 (1)]; [Wlo05, Definition 2.7.5]; [BM08, Corollary 4.1]): H is of maximal contact for (I, m) when 𝒪_X(−H) ⊆ MC(I), i.e. locally H = (h = 0) with h ∈ MC(I). Kollár's "smooth hypersurface" is the separate hypothesis AlgebraicGeometry.IsSmoothDivisor H.

    Equations
    Instances For

      The static form unfolded: 𝒪_X(−H) ⊆ MC(I) as the inclusion of ideal sheaves H ≤ MC f I m.

      The dynamic form ([Kol07, Definition 78]): H is a hypersurface of maximal contact for (I, m) when, for every open subscheme j : X⁰ ⟶ X and every smooth blow-up sequence of order m starting with (X⁰, I|_{X⁰}) (with the empty divisorial part, Kollár's "for now we ignore E"), the center of every blow-up lies in the birational (strict) transform of H⁰ := H|_{X⁰}: S.strictTransformSeq (H.comap j) i ≤ S.center i as ideal sheaves (V(Z_i) ⊆ V(H_i)). Kollár's "smooth hypersurface" is the separate hypothesis AlgebraicGeometry.IsSmoothDivisor H.

      Equations
      • One or more equations did not get rendered due to their size.
      Instances For

        The dynamic form unfolded: for every open immersion j : Y ⟶ X and every smooth blow-up sequence of order m for (Y, I|_Y) with the empty divisor family, every centre lies in the strict transform of H|_Y.

        The order of MC(I) ([Kol07, Lemma 74 (3)]) #

        theorem AlgebraicGeometry.Scheme.IdealSheafData.mem_support_MC_iff {k : Type u} [Field k] {X : Scheme} (f : X ⟶ Spec ↧k) [CharZero k] (n : ℕ) [SmoothOfRelativeDimension n f] (I : X.IdealSheafData) {m : ℕ} (hm : 1 ≤ m) (x : ↥X) :
        x ∈ (MC f I m).support ↔ ↑m ≤ I.ord x

        Kollár's "cosupp MC(I) = cosupp (I, m)" ([Kol07, Definition 79]): a point lies on V(MC(I)) iff ord_x I ≥ m (le_ord_iff_mem_support_derivativeIter).

        theorem AlgebraicGeometry.Scheme.IdealSheafData.coe_support_MC {k : Type u} [Field k] {X : Scheme} (f : X ⟶ Spec ↧k) [CharZero k] (n : ℕ) [SmoothOfRelativeDimension n f] (I : X.IdealSheafData) {m : ℕ} (hm : 1 ≤ m) :
        ↑(MC f I m).support = {x : ↥X | ↑m ≤ I.ord x}

        cosupp MC(I) = cosupp (I, m) ([Kol07, Definition 79]).

        theorem AlgebraicGeometry.Scheme.IdealSheafData.one_le_ord_MC_iff {k : Type u} [Field k] {X : Scheme} (f : X ⟶ Spec ↧k) [CharZero k] (n : ℕ) [SmoothOfRelativeDimension n f] (I : X.IdealSheafData) {m : ℕ} (hm : 1 ≤ m) (x : ↥X) :
        1 ≤ (MC f I m).ord x ↔ ↑m ≤ I.ord x

        [Kol07, Lemma 74 (3)] at r = 1: MC(I) has order ≥ 1 at x iff ord_x I ≥ m (the point lies on V(MC(I))).

        theorem AlgebraicGeometry.Scheme.IdealSheafData.two_le_ord_MC_iff {k : Type u} [Field k] {X : Scheme} (f : X ⟶ Spec ↧k) [CharZero k] (n : ℕ) [SmoothOfRelativeDimension n f] (I : X.IdealSheafData) {m : ℕ} (hm : 1 ≤ m) (x : ↥X) :
        2 ≤ (MC f I m).ord x ↔ ↑(m + 1) ≤ I.ord x

        [Kol07, Lemma 74 (3)] at r = 2: MC(I) has order ≥ 2 at x iff ord_x I ≥ m + 1; so at a point of order exactly m the order of MC(I) is exactly 1.

        theorem AlgebraicGeometry.Scheme.IdealSheafData.ord_MC_eq_one {k : Type u} [Field k] {X : Scheme} (f : X ⟶ Spec ↧k) [CharZero k] (n : ℕ) [SmoothOfRelativeDimension n f] (I : X.IdealSheafData) {m : ℕ} (hm : 1 ≤ m) {x : ↥X} (hx : I.ord x = ↑m) :
        (MC f I m).ord x = 1

        MC(I) has order 1 at a point of order m.

        theorem AlgebraicGeometry.Scheme.IdealSheafData.ord_MC_eq_zero {k : Type u} [Field k] {X : Scheme} (f : X ⟶ Spec ↧k) [CharZero k] (n : ℕ) [SmoothOfRelativeDimension n f] (I : X.IdealSheafData) {m : ℕ} {x : ↥X} (hx : I.ord x < ↑m) :
        (MC f I m).ord x = 0

        MC(I) has order 0 at a point of order < m.