Documentation

Hironaka.Resolution.Analytic.OrderReduction.HFamData

The data consumed by Step 2.2 of the proof of Theorem 103 #

Step 2.2 of the proof of [Kol07, Theorem 103] ([Kol07, 104, Step 2.2]) applies, at the last stage of the sequence of Step 2.1, Lemma 102 to the triple (X_r, I_r, H_r + E_r) at the member H_r, the transform of the hypersurface of maximal contact. Kollár declares H the first member of H + E; the library appends it as the greatest member of the boundary, and the class stepHClass (Step22Defs.lean) is that of triples with a greatest member. What the machinery of Step 2.2 in the compatible-family form (Step22Fam.lean to LocalFunctorFam.lean) uses of the family applied at that member is four of the clauses of BDanFamData (FamilyData.lean): the value, the order clause in the form "of order ≥ s" ([Kol07, Definition 66 (1′)–(4′)]; it enters the uniqueness of the hypersurface of maximal contact, [Kol07, Theorem 97]), the commutation with local analytic isomorphisms and the indifference to empty boundary members. Neither the exactness of the order nor Lemma 102 (1) is used there. This matters because the modified algorithm of Włodarczyk (the proof of [Wlo09, Theorem 7.4.1]: the components on which the ideal has become the ideal of a smooth hypersurface are left alone) supplies data for the same step which satisfy the four clauses but not the other two.

The assembly of Step 2 over HFData is in Step22Fam.lean and its successors; the data of Włodarczyk's modified step at the mark 1 are BMOmod.hFamDataMod (Modified/StepBData.lean).

structure Hironaka.Manifold.HFamData {𝕜 : Type} [RCLike 𝕜] {E : Type u_1} [NormedAddCommGroup E] [NormedSpace 𝕜 E] {n : ℕ} (ψ₀ : E ≃L[𝕜] Fin n → 𝕜) (s : ℕ) :
Type (max (u + 1) u_1)

The data consumed by Step 2.2 of the proof of [Kol07, Theorem 103] at the mark s: a compatible family on every triple of the class of BO_{n,s} and every member of its boundary, which on every relatively compact open is a smooth blow-up sequence of order ≥ s for the restricted triple ([Kol07, Definition 66 (1′)–(4′)]), commutes with local analytic isomorphisms (both bullets of [Kol07, 34.1] in one clause per open) and is indifferent to empty boundary members. These are the clauses of BDanFamData without the exactness of the order and without Lemma 102 (1).

Instances For
    def Hironaka.Manifold.BDanFamData.toHFamData {𝕜 : Type} [RCLike 𝕜] {E : Type u_1} [NormedAddCommGroup E] [NormedSpace 𝕜 E] {n : ℕ} {ψ₀ : E ≃L[𝕜] Fin n → 𝕜} {s : ℕ} (bd : BDanFamData ψ₀ s) :
    HFamData ψ₀ s

    Lemma 102's family data satisfy the four clauses of HFamData (its exact order gives the order clause).

    Equations
    Instances For
      structure Hironaka.Manifold.HFData {𝕜 : Type} [RCLike 𝕜] {E : Type u_1} [NormedAddCommGroup E] [NormedSpace 𝕜 E] {n : ℕ} (ψ₀ : E ≃L[𝕜] Fin n → 𝕜) (s : ℕ) :
      Type (max (u + 1) u_1)

      The data of Step 2 of the proof of [Kol07, Theorem 103] in the compatible-family form, at the mark s: the data of Step 2.1 (Lemma 102's family at the mark s, Kol07, Theorem 103, Step 2.1) and the data for the hypersurface step of Step 2.2 at the re-tuned mark tuningParam s ([Kol07, 104, Step 2.2]: "we can again replace I by W(I)"). Kollár takes both from Lemma 102's data at every mark (HFData.ofBDanFamData); Włodarczyk's modified algorithm (the proof of [Wlo09, Theorem 7.4.1]) takes the second from the modified marked resolution (BMOmod.hFamDataMod).

      Instances For
        def Hironaka.Manifold.HFData.ofBDanFamData {𝕜 : Type} [RCLike 𝕜] {E : Type u_1} [NormedAddCommGroup E] [NormedSpace 𝕜 E] {n : ℕ} {ψ₀ : E ≃L[𝕜] Fin n → 𝕜} (bd : (s : ℕ) → BDanFamData ψ₀ s) (s : ℕ) :
        HFData ψ₀ s

        The data of Step 2 as Kollár takes them: Lemma 102's family data at the mark s and at the re-tuned mark.

        Equations
        Instances For
          @[simp]
          theorem Hironaka.Manifold.HFData.ofBDanFamData_bd₁ {𝕜 : Type} [RCLike 𝕜] {E : Type u_1} [NormedAddCommGroup E] [NormedSpace 𝕜 E] {n : ℕ} {ψ₀ : E ≃L[𝕜] Fin n → 𝕜} (bd : (s : ℕ) → BDanFamData ψ₀ s) (s : ℕ) :
          (ofBDanFamData bd s).bd₁ = bd s
          @[simp]
          theorem Hironaka.Manifold.HFData.ofBDanFamData_hf {𝕜 : Type} [RCLike 𝕜] {E : Type u_1} [NormedAddCommGroup E] [NormedSpace 𝕜 E] {n : ℕ} {ψ₀ : E ≃L[𝕜] Fin n → 𝕜} (bd : (s : ℕ) → BDanFamData ψ₀ s) (s : ℕ) :
          theorem Hironaka.Manifold.HFamData.fam_congr_seqOn {𝕜 : Type} [RCLike 𝕜] {E : Type u_1} [NormedAddCommGroup E] [NormedSpace 𝕜 E] {n : ℕ} {ψ₀ : E ≃L[𝕜] Fin n → 𝕜} {s : ℕ} (hf : HFamData ψ₀ s) {M : AnalyticManifold 𝕜 E} {T₁ T₂ : Manifold.AnalyticTriple ψ₀ M} (e : T₁ = T₂) (h₁ : Manifold.AnalyticTriple.BOClass s T₁) (h₂ : Manifold.AnalyticTriple.BOClass s T₂) (j₁ : T₁.F.ι) (j₂ : T₂.F.ι) (hj : j₁ ≍ j₂) (U : TopologicalSpace.Opens M.carrier) (hU : IsCompact (closure ↑U)) :
          (hf.fam T₁ h₁ j₁).seqOn U hU = (hf.fam T₂ h₂ j₂).seqOn U hU

          The value of the family depends only on the triple and the member: transport along an equality of triples and a matching equality of members.

          noncomputable def Hironaka.Manifold.HFamData.hstepFunctor {𝕜 : Type} [RCLike 𝕜] {E : Type u_1} [NormedAddCommGroup E] [NormedSpace 𝕜 E] {n : ℕ} {ψ₀ : E ≃L[𝕜] Fin n → 𝕜} {s : ℕ} (hf : HFamData ψ₀ s) :

          The family applied at the greatest member of the boundary, as a family functor on the class stepHClass s of triples of BOClass s with a greatest member; stepHFamFunctor (Step22Fam.lean) is this functor at Lemma 102's data.

          Equations
          • One or more equations did not get rendered due to their size.
          Instances For
            theorem Hironaka.Manifold.HFamData.hstepFunctor_fam {𝕜 : Type} [RCLike 𝕜] {E : Type u_1} [NormedAddCommGroup E] [NormedSpace 𝕜 E] {n : ℕ} {ψ₀ : E ≃L[𝕜] Fin n → 𝕜} {s : ℕ} (hf : HFamData ψ₀ s) {M : AnalyticManifold 𝕜 E} (T : Manifold.AnalyticTriple ψ₀ M) (hT : BO.stepHClass s T) :
            hf.hstepFunctor.fam T hT = hf.fam T ⋯ (BO.greatestIdx hT)