Documentation

Hironaka.Resolution.Analytic.Functor.ModifiedMarkedFam

The modified marked resolution as its own object: BMOmodFam #

The proof of [Wlo09, Theorem 7.4.1] runs the marked resolution of (M, I_Y, ∅, 1) with a modified algorithm: in its second step the monomial part (M(I), 1) is resolved first, by blow-ups at exceptional divisors of maximal ρ; in its first step the run is stopped at a germ where the current controlled transform is the ideal (u) of a smooth hypersurface of maximal contact, and otherwise restricted to a hypersurface of maximal contact and repeated; it terminates with the controlled transform of (I, 1) locally equal to I″ = (u₁, …, u_k), the u_i coordinates transversal to the exceptional divisors; the procedure is canonical and glues from germs at compact sets (compare the proof of [Wlo05, Theorem 4.7.1]). This library makes the modified run its own object: the structure BMOmodFam 𝕜 n, in the family form of Hironaka.Resolution.Analytic.Functor.Family (a CompatibleFamily on every relatively compact open), whose fields are the clauses of that proof read per open on the restricted marked triple, and its instance concreteBMOmodFam (Hironaka.Resolution.Analytic.Wlo09.Concrete); the embedded-desingularization functor bedanFamOfInput is the restriction of its functor to the class of reduced closed subspaces with empty boundary.

This file provides the two tools the clauses need and the structure:

The composite of blow-downs between two stages (the vocabulary of the stop rule) #

def AnalyticManifold.FiniteSuccession.stageMapAdd {𝕜 : Type} [RCLike 𝕜] {E : Type u_1} [NormedAddCommGroup E] [NormedSpace 𝕜 E] {M : AnalyticManifold 𝕜 E} (S : M.FiniteSuccession) (i k : ℕ) (h : i + k < S.length + 1) :
AnalyticMap (S.stage ⟨i + k, h⟩) (S.stage ⟨i, ⋯⟩)

The composite σ_{i+1} ∘ ⋯ ∘ σ_{i+k} : U_{i+k} → U_i of the blow-downs between the stages i and i + k, by recursion on k exactly as stageMapAux (the case i = 0 is stageMap, up to 0 + k = k). A point y ∈ U_{i+k} lies over x ∈ U_i when S.stageMapAdd i k h y = x.

Equations
Instances For
    @[simp]
    theorem AnalyticManifold.FiniteSuccession.stageMapAdd_zero {𝕜 : Type} [RCLike 𝕜] {E : Type u_1} [NormedAddCommGroup E] [NormedSpace 𝕜 E] {M : AnalyticManifold 𝕜 E} (S : M.FiniteSuccession) (i : ℕ) (h : i + 0 < S.length + 1) :

    The composite over no blow-down is the identity of the stage.

    theorem AnalyticManifold.FiniteSuccession.stageMapAdd_succ {𝕜 : Type} [RCLike 𝕜] {E : Type u_1} [NormedAddCommGroup E] [NormedSpace 𝕜 E] {M : AnalyticManifold 𝕜 E} (S : M.FiniteSuccession) (i k : ℕ) (h : i + (k + 1) < S.length + 1) :
    S.stageMapAdd i (k + 1) h = ContMDiffMap.comp (S.stageMapAdd i k ⋯) (S.map ⟨i + k, ⋯⟩)

    One more blow-down: σ_{i+1} ∘ ⋯ ∘ σ_{i+k+1} = (σ_{i+1} ∘ ⋯ ∘ σ_{i+k}) ∘ σ_{i+k+1}.

    Locally the ideal of a smooth submanifold transversal to the boundary #

    def Manifold.HypersurfaceFamily.IsSmoothTransversalIdealAt {𝕜 : Type} [RCLike 𝕜] {E : Type u_1} [NormedAddCommGroup E] [NormedSpace 𝕜 E] {n : ℕ} (ψ : E ≃L[𝕜] Fin n → 𝕜) {M : Type u} [TopologicalSpace M] [ChartedSpace E M] (F : HypersurfaceFamily M) (J : IdealSheaf (structureSheaf 𝕜 E M)) (x : M) :

    J is at x locally the ideal of a smooth submanifold with coordinates transversal to F — there are a chart φ of the maximal atlas through x which is an snc chart of F at x with component coordinates cidx (IsSncChartAt: the components of F through x are the coordinate hyperplanes z_{cidx j} = 0 on φ.source), and k = c coordinate indices σ, such that on the whole source of φ the stalks of J are spanned by the coordinate germs u_i = z_{σ i} ∘ φ (coord; the vocabulary of IsIdealSheafOf) and no u_i is a component coordinate (cidx j ≠ σ i: the u_i are transversal to the components through x). The zero set of J on φ.source is then the coordinate subspace {z_σ = 0}, smooth of codimension c, and {z_σ = 0} ∪ ⋃ F has simple normal crossings there. Membership of x in the zero set is not demanded by a separate clause: at c = 0 the equation reads J = 0 on φ.source (the zero ideal, excluded by the triples' isNonzeroEverywhere), and a point OFF the zero set satisfies the predicate only with c ≥ 1 through a chart whose source misses {z_σ = 0} (there J = 𝒪 is spanned by the unit u₁) — the germ with nothing left to resolve. The output clause quantifies over the support 1 ≤ ord, and in the stop rule the predicate is the hypothesis.

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

      The structure BMOmodFam at the standard model #

      structure Hironaka.Manifold.BMOmodFam (𝕜 : Type) [RCLike 𝕜] (n : ℕ) :
      Type (u + 1)

      The modified marked resolution of the proof of [Wlo09, Theorem 7.4.1] as its own object (compare the proof of [Wlo05, Theorem 4.7.1]; the family record BMOanFam is the template): a family functor on the marked class BMOClass 1 at the standard model 𝕜ⁿ with the clauses of that proof read per relatively compact open U on the restricted marked triple T.pullback (M.inclusion U) _ along the value L := (functor.fam T hT).seqOn U hU: the run is a blow-up sequence of order ≥ 1 for (𝓘, 1) ([Kol07, Definition 66, (2′)–(4′)], kept from BMOanFam); every centre lies in the support of the current controlled transform ([Wlo09, Definition 3.2.4, (1)]); the final controlled transform is, at every point of its support, locally the ideal of a smooth submanifold with coordinates transversal to the exceptional divisors (the output of the run; not a marked-resolution clause, since the modified run does not reach order < 1, so the ord_lt of BMOanFam is the one clause dropped); the stop rule read globally, for a run canonical and glued from germs: at a point of a stage where the current controlled transform is locally the ideal of a smooth submanifold transversal to the exceptional divisors, no later centre contains the images of that point; commutation with local analytic isomorphisms ([Wlo09, Theorem 6.0.6, (2)]) and indifference to empty boundary members. The value's noEmptyCenters and compat are CompatibleFamily's own. Not fields: the descent identity of the maximal-contact recursion (the definition of the run), the monomial-first trigger, and the identification of the components of the final support with the strict transforms of the components of Y. Its functor restricted to DomBEDan is bedanFamOfInput. Type (u+1) as BMOanFam.

      Instances For