Step 2 on an open: independence of the chain and compatibility under restriction #
The value of Step 2 on a relatively compact open U (step2SeqFamOn, Step22Fam.lean) is Step 2
along the chain of exhaustion opens (hfStep2SeqFamOn_eq_along, Step2Along.lean): the chain of
Step 2.1 with the value of Step 2.2 appended at the last link, restricted to U, with its empty
blow-ups deleted. This module proves that the value does not depend on the admissible chain of
opens, and derives the compatibility of the values under restriction, the clause (4) of
[Wlo09, Theorem 2.0.3] that makes them a compatible family:
BO.hfStep2SeqFamAlong_rel— along two admissible chains the two values of Step 2 agree on every common open: the chains of Step 2.1 agree on the intersection of the next-to-last opens (step21FamAux_filter_rel,ChainIndep.lean); the link of Step 2.2 on each chain is compared, through the state over that intersection, with the link on the other (hfStep22Link_relalong the identity,Step2LinkTransport.lean), the two intermediate links being the same sequence; then both are restricted to the common open (eraseEmpty_pullback_restrict_congr).hfStep2SeqFamOn_compat— forU ≤ V, the value of Step 2 onUis the value onVrestricted toUwith its empty blow-ups deleted: independence of the chain, for the chain ofVread onU. This is the second clause of [Kol07, 34.1] (pull-back along an open embedding, up to empty blow-ups) in the per-open form, the counterpart for Step 2 ofstep21FamOn_compat(Step21FamIndep.lean).
The hf… declarations are the general forms over data d : HFData ψ₀ s of Step 2
(HFamData.lean); the plain forms are their instances at Lemma 102's data. The compatibility is
the field compat of the compatible family of the local functor (LocalFunctorFam.lean).
Along two admissible chains of opens the values of Step 2 agree on every common open
([Kol07, 34.1] for the choice of the chain; over data d): the chains of Step 2.1 agree on the
intersection of the next-to-last opens (step21FamAux_filter_rel, applied to the same list of
members); the link of Step 2.2 on each chain is compared, through the state over that intersection
(restrictEraseId), with the link on the other (hfStep22Link_rel along the identity; the two
intermediate links are the same sequence); then both are restricted to the common open
(eraseEmpty_pullback_restrict_congr).
Compatibility of Step 2 under restriction ([Wlo09, Theorem 2.0.3 (4)]; the second clause of
[Kol07, 34.1] per open; over data d): for U ≤ V the value on U is the value on V restricted
to U with its empty blow-ups deleted, by the independence of the chain
(hfStep2SeqFamAlong_rel) for the chain of V read on U.