Step 2.1 on an open: independence of the chain, compatibility, functoriality #
Three clauses of Step 2.1 of the proof of [Kol07, Theorem 103] in the compatible-family form
(Step21Fam.lean), all from the two-chain lemma step21FamAux_filter_rel of ChainIndep.lean:
step21FamOn_chain_indep— the value of Step 2.1 onUdoes not depend on the admissible chain of opens along which it is computed: the fixed chain ofstep21FamOnand any other, over the same member list, agree onUup to empty blow-ups;step21FamOn_compat— the compatibility under restriction of [Wlo09, Theorem 2.0.3 (4)]: forU ≤ V, the value onUis the value onVrestricted toUwith the empty blow-ups deleted (the independence of the chain for the chain ofV, read onU);step21FamOn_commutesWithLocalIsos— the commutation with local analytic isomorphisms in the form ofAnalyticFamilyFunctor.CommutesWithLocalIsos(the functoriality of Step 2.1 noted in [Kol07, 104, Step 2.3]): along a local analytic isomorphismg : N → M, the chain overNfor the pulled-back triple over the member list filtered of the members emptied bygis, up to empty blow-ups, the chain over the full member list along a chain of opens carried into the chain ofg(U')(step21FamAux_filter_rel; a member emptied bygcontributes nothing, given that the family's value at an empty member is the trivial family, the hypothesishnil), which is the pull-back of the chain overMlink by link (step21FamAux_rel_along,link_rel).
The three clauses enter the compatible family of Step 2.1 and its functor in Step22Fam.lean.
The list of nonempty members has no empty member: filtering keeps it.
The members of the list of nonempty members are nonempty, so the hypothesis on empty members of the two-chain lemma is never needed for it.
Step 2.1 on U does not depend on the chain of opens: the two-chain lemma
(step21FamAux_filter_rel) for the given chain and the fixed one, over the list of nonempty
members, read on U.
Compatibility of Step 2.1 under restriction ([Wlo09, Theorem 2.0.3 (4)]): for U ≤ V the
value on U is the value on V restricted to U with the empty blow-ups deleted; the independence
of the chain (step21FamOn_chain_indep) for the chain of V, read on U.
Along g, the chain over N for the pulled-back triple is, up to empty blow-ups, the
pull-back of the chain over M, link by link (link_rel), for chains of opens with
g(W'_k) ⊆ W_k processing the same members (the functoriality of Step 2.1,
[Kol07, 104, Step 2.3]).
Step 2.1 commutes with local analytic isomorphisms on the opens (the functoriality of
[Kol07, 104, Step 2.3] in the form of AnalyticFamilyFunctor.CommutesWithLocalIsos): the chain
over N for the filtered member list is the chain over the full list along opens carried into the
chain of g(U') (step21FamAux_filter_rel), which is the pull-back of that chain
(step21FamAux_rel_along); restricting to U' and deleting the empty blow-ups gives the
statement.