The composite of two family functors along induced triples: the functor #
ComposeInduced.lean built the link of the composite of F : AnalyticFamilyFunctor ψ₀ Dom₁
with G : AnalyticFamilyFunctor ψ₀ Dom₂ at the induced triples (alongList over a pair of opens
closure V ⊆ W, its order clause, its relation alongList_rel along a local analytic
isomorphism). This module makes the composite a family functor on Dom₁, following the
assembly of the second step of the order reduction (Step2Assembly.lean, Step2AssemblyComm.lean)
with its link replaced by the generic one:
composeAlong F G s … T hT W V hW hV hVW U hUV : CenterList ψ₀ (M.restrict U), the composite over(W, V)restricted toU ≤ V, with the empty blow-ups deleted;composeAlong_eq_joinandcomposeAlong_rel, the independence from the chain: two pairs of opens aboveUgive the same value (alongList_relat the identity, against the common refinement(W ⊓ W′, V ⊓ V′));composeOn F G s … T hT U hU, the value onUalong the canonical pair(chainOpens (exhaustion M) n₀ 1 0, chainOpens (exhaustion M) n₀ 1 1)withn₀ = exhaustionIdx _ hU(the exhaustion index ofhfStep2FamOn);composeOn_compat(the second condition of [Kol07, 34.1], [Wlo09, Theorem 2.0.3 (4)]) by the independence from the chain for the canonical pair of the larger open read on the smaller;composeInduced F G s … : AnalyticFamilyFunctor ψ₀ Dom₁, the functor, withcomposeInduced_isOfOrderGe(the order clause at the marks, fromalongList_isOfOrderGe),composeInduced_commutesWithLocalIsos(alongList_relalonggagainst the trace of the canonical pair ofg(U′)intersected with the canonical pair ofU′) andcomposeInduced_indifferentToEmptyMembers(the indifference ofFfor the first list, that ofGthroughIndifferentToEmptyMembers.seqOn_induced_indifffor the appended value:alongList_indiff).
The hypotheses are the properties of the two functors and the class hypotheses of
ComposeInduced.lean: hF, hFG, hFc, hG, hG', hDom, hDomE, and
hDom₁ : ClassPullbackClosed Dom₁ (the triple pulled back along the identity, the pivot of the
argument for the independence from the chain, stays in the class of F).
The composite over (W, V) read on U ≤ V, with the empty blow-ups deleted.
Equations
- F.composeAlong G s hF hFG T hT W V hW hV hVW U hUV = ((F.alongList G s ⋯ ⋯ T hT W hW V hV hVW).pullback (M.restrictLE hUV) ⋯).eraseEmpty
Instances For
The composite over (W, V) read on U is the composite over any smaller pair (W₀, V₀) above
U, for the triple pulled back along the identity, pulled back to U and cleaned: alongList_rel
at the identity.
Independence from the chain: two pairs of opens above U give the same composite on U,
both being the composite over the common refinement (W ⊓ W′, V ⊓ V′) (composeAlong_eq_join).
The composite on U, along the canonical pair of opens above U,
chainOpens (exhaustion M) n₀ 1 0 ⊇ closure (chainOpens (exhaustion M) n₀ 1 1) ⊇ … ⊇ U with
n₀ = exhaustionIdx (exhaustion M) hU (the exhaustion index of hfStep2FamOn).
Equations
- One or more equations did not get rendered due to their size.
Instances For
The value of the composite has no empty centres [Kol07, 32].
The compatibility of the composite under restriction (the second condition of
[Kol07, 34.1]; [Wlo09, Theorem 2.0.3 (4)]): for U ≤ V the value on U is the value on V
restricted to U with its empty blow-ups deleted (the independence from the chain, for the
canonical pair of V read on U).
The order clause of the value of the composite at the mark s, from those of F (hF) and G
(hGo): alongList_isOfOrderGe pulled back to U (isOfOrderGe_pullback,
pullback_inclusion_restrictLE) and cleaned (isOfOrderGe_eraseEmpty).
The counterpart, for boundary members, of the empty blow-up convention [Kol07, 32], for the
composite over (W, V): deleting empty boundary members of T does not change the composite.
The indifference of F identifies the first lists, that of G
(IndifferentToEmptyMembers.seqOn_induced_indiff) the appended values at the induced triples of the
common first list (the restricted triple of T with its boundary replaced is the restricted triple
with the restricted replacement, definitionally).
The functor and its clauses #
The composite family functor on Dom₁: composeOn on every relatively compact open,
without empty centres, compatible under restriction (composeOn_compat).
Equations
- One or more equations did not get rendered due to their size.
Instances For
The order clause of the composite functor at the mark s (composeOn_isOfOrderGe).
[Kol07, 34.1] for the composite functor: it commutes with local analytic isomorphisms; the
value on U′ for the pulled-back triple is the value on g(U′) pulled back along g|_{U′} and
cleaned. The independence from the chain on the source manifold moves the canonical pair of U′
to the trace (g⁻¹(W) ⊓ W₁, g⁻¹(V) ⊓ V₁) of the canonical pair (W, V) of g(U′);
alongList_rel along g relates the composites over the two pairs; the pull-backs are composed
(pullback_comp) and compared (pullback_congr).
The counterpart, for boundary members, of the empty blow-up convention [Kol07, 32], for the
composite functor: indifference to empty boundary members, from that of F (hFi) and of G
(hG') through alongList_indiff (the canonical pair depends on the open only).