Independence of the shrinking open; the principalization family functor #
The value of the principalization family on a relatively compact open U was defined with a
shrinking open W ⊇ closure U (principalizationValueOn,
Hironaka/Resolution/Analytic/Principalization/Assembly.lean). This module proves it does not
depend on W and assembles the compatible family and the family functor:
principalizationValueOn_eq_of_le: forW ≤ W', the disjoining list overW'pulled back toWis the disjoining list overWat the (larger) bound ofW'(disjoinList_pullback,AnalyticTriple.pullback_inclusion_restrictLE), so the value atW'is the value atWcomputed with that bound (valueOf_pullback, the disjoined triple being natural under pull-back), which is the value atW's own bound by padding with empty blow-ups (valueOf_disjoinList_eq);principalizationValueOn_eq: two arbitrary shrinking opens compare through their union;principalizationValue_compat: the values onU ≤ Vcompare at the common shrinking open ofV(principalizationValueOn_restrict) — the compatibility of the family under restriction (Kollár's functoriality for open embeddings [Kol07, 34.1]; Włodarczyk's compatibility of the factorizations over nested opens [Wlo09, Theorem 2.0.3 (4)]);principalizationFam: the family functor on all triples (Dom := fun _ => True).
Transports along equalities of the base triple and the list #
Transport of the snc hypothesis on the boundary along equalities of the list and the family.
Transport of the disjointness hypothesis on the original members along equalities of the list and the family.
The value built from the disjoined triple is compatible with equalities of the base triple and of the list.
Canonicity of the shrinking open #
The value does not depend on the shrinking open, for W ≤ W': the disjoining list over
W' pulled back to W is the disjoining list over W at W''s bound; the value at W' is the
value at W with that bound (valueOf_pullback), which is the value at W's own bound
(valueOf_disjoinList_eq).
The value does not depend on the shrinking open: two admissible shrinking opens compare through their union.
The compatible family and the functor #
The compatibility clause of the principalization family ([Kol07, 34.1];
[Wlo09, Theorem 2.0.3 (4)], per open): the value on U ≤ V is the value on V pulled back along
the open inclusion with the empty rounds deleted. Both values are computed at the shrinking open of
V (principalizationValueOn_eq), where they restrict (principalizationValueOn_restrict).
The principalization family functor on all triples ([Kol07, Theorem 35] built as in
[Kol07, 72], in the compatible-family form): the value on each relatively compact open is
principalizationValue (no empty centres; compatible under restriction).
Equations
- One or more equations did not get rendered due to their size.