Documentation

Hironaka.Resolution.Analytic.OrderReduction.TunedLemmas

Step 1 of Theorem 103: transfer between the triple and its tuned triple #

Step 1 of the proof of [Kol07, Theorem 103] replaces I by the maximal coefficient ideal W_s(I) ([Kol07, Definition 98]), for which order reduction is "equivalent to order reduction for (X, W(I), E)" ([Kol07, Corollary 101]). This module proves what the construction needs about the tuned triple of Tuned.lean:

These lemmas carry Theorem 103 (1) and (2) from the tuned triple back to the triple for the local functor in the compatible-family form (LocalFunctorFam.lean).

The tuning commutes with pull-back along a local analytic isomorphism, h^*(W_s(J)) = W_s(h^* J) ([Kol07, Definition 98] with [Kol07, Lemma 74 (4)]): stalkwise, Kollár's sum is carried by the germ algebra isomorphism term by term. Not in the sources; the ingredient of the functoriality of Step 1.

theorem Manifold.AnalyticTriple.tuned_pullback {𝕜 : Type} [RCLike 𝕜] {E : Type u_1} [NormedAddCommGroup E] [NormedSpace 𝕜 E] [FiniteDimensional 𝕜 E] {n : ℕ} {ψ₀ : E ≃L[𝕜] Fin n → 𝕜} {M : AnalyticManifold 𝕜 E} {m : ℕ} {N : AnalyticManifold 𝕜 E} (T : AnalyticTriple ψ₀ M) (hm : 1 ≤ m) (h : AnalyticMap N M) (hh : IsLocalDiffeomorph (modelWithCornersSelf 𝕜 E) (modelWithCornersSelf 𝕜 E) ⊤ ⇑h) :
(T.pullback h hh).tuned m hm = (T.tuned m hm).pullback h hh

The tuned triple of a pull-back along a local analytic isomorphism is the pull-back of the tuned triple (comap_tuning): Step 1 of the proof of [Kol07, Theorem 103] commutes with local analytic isomorphisms.

theorem Manifold.AnalyticTriple.orderReduction_tuned_iff {𝕜 : Type} [RCLike 𝕜] {E : Type u_1} [NormedAddCommGroup E] [NormedSpace 𝕜 E] [FiniteDimensional 𝕜 E] {n : ℕ} {ψ₀ : E ≃L[𝕜] Fin n → 𝕜} {M : AnalyticManifold 𝕜 E} {m : ℕ} (T : AnalyticTriple ψ₀ M) (hT : BOClass m T) (L : AnalyticManifold.BlowUpSequence ψ₀ M) :

Order reduction for (X, I, E) "is equivalent to order reduction for (X, W(I), E)" (Step 1 of the proof of [Kol07, Theorem 103]; [Kol07, Corollary 101]): a sequence of centres is a smooth blow-up sequence of order ≥ s for the tuned triple iff it is one of order ≥ m for the triple, s = tuningParam m (tuning_orderReduction_equiv; the boundary is kept by the tuning).

The output clause of Theorem 103 transfers from the tuned triple back to the triple: where the final transform of W_s(𝓘) has order < s, the final transform of 𝓘 has order < m. Along the sequence the controlled transforms are the weak transforms; the controlled transform of W_s(𝓘) lies in the tuning of the controlled transform of 𝓘 (markedTransformSeq_tuning_le), whose order is ≥ s exactly where the transform of 𝓘 has order ≥ m (le_ord_tuning_iff).