Documentation

Hironaka.Resolution.Algebraic.Wlo05.EmbeddedEndBridge

The clauses from the end data of the loop #

Clause (c) of [Wlo05, Theorem 1.0.2] and the fine form of clause (e) for BED, derived from the end data EmbeddedEnd ⟨TX, 1⟩ (componentIdeals TX) ∅ (BED TX) taken as a hypothesis h; the proof of the theorem obtains the end data from CP1–CP6 (embeddedEnd_BED_of_invCE, Hironaka.Resolution.Algebraic.Wlo05.EmbeddedCPBridge).

It also proves the elementary identity iInf_componentIdeals_eq: a reduced ideal is the intersection of the reduced ideals of the irreducible components of its support. Used in Hironaka.Resolution.Algebraic.Wlo05.EmbeddedFunctorClauses.

A reduced ideal is the intersection of the reduced ideals of the irreducible components of its support (the decomposition of Y in [Wlo05, Theorem 4.7.1]): the Galois connection between supports and vanishing ideals (vanishingIdeal_iSup), the union coe_support_eq_biUnion_componentIdeals and vanishingIdeal_support_of_isReduced.

The final strict transforms of the irreducible components of Y are pairwise disjoint ([Wlo05, Theorem 4.7.1]), from the end data.

The final strict transform of Y is the product of the final strict transforms of its irreducible components, from the end data.

Clause (c) of [Wlo05, Theorem 1.0.2], second part, from the end data: the final total transform of the boundary has simple normal crossings with the final strict transform of Y.

Clause (e) of [Wlo05, Theorem 1.0.2] in the fine form of [Wlo05, Theorem 4.7.1], from the end data: the pull-back of I_Y to the end result is the final strict transform of Y times the ideal of a simple normal crossing divisor supported on the final boundary.