The naturality of the sequence over an open: compatibility, local isomorphisms, indifference #
Beyond the order and erasure facts, the structure BMOanFam reads three properties of the
sequence bmoSeqOn over a relatively compact open:
- compatibility (
CompatibleFamily.compat): the sequence overU ≤ Vis the sequence overVrestricted toUand cleaned of empty blow-ups ([Wlo09, Theorem 2.0.3 (4)], [Wlo09, Definition 3.2.6]); - commutation with local analytic isomorphisms (
CommutesWithLocalIsos): for a pull-backT'of the triple along a local analytic isomorphismg, the sequence overU'is the sequence overg(U')pulled back alongg|_{U'}and cleaned ([Kol07, Theorem 107 (2)], [Kol07, 34.1]); - indifference to empty boundary members (
IndifferentToEmptyMembers): replacing the boundary by an empty extension does not change the sequence (the counterpart, for boundary members, of [Kol07, 32]).
The substance is the alignment of two runs of the three steps, the argument behind the second
condition of [Kol07, 34.1]. For the first step it is made by a virtual descent over a pair of
opens: a chain which maps into the canonical chains of both opens link by link, on which a third
run is aligned with each of the two real runs (descentStateAux_rel). Here the virtual run is
continued through the separation and monomial steps (step23Aux_rel, step23Aux_L_indiff):
- compatibility. For
U ≤ Vthe virtual descent of the first step runs over the join chainstepAJoin U hU V hVfrom the larger of the two bounds. It is continued alongbmoJoinCont: the exit open of the join descent, then the shrinkings ofclosure Uinside it met with both canonical continuation chains, so that it maps into each of them link by link;step23Aux_relalong the identity carries the alignment to the terminal states (bmoJoinTerminal_rel_left,bmoJoinTerminal_rel_right). Both real sequences are then read off the one virtual terminal state onU(valueOn_eq_of_rel_id), andvalueOn_restrict, the compatibility for one terminal state, closes. - local isomorphisms. The same over the source manifold, with the pre-join chain
preJoinof the pairU' ⊆ N,g(U') ⊆ Mfor the pulled-back triple, continued alongbmoPreJoinCont(met with the canonical continuation ofU'and theg-preimage of that ofg(U')); the alignments along the identity (bmoPreJoinTerminal_rel_left) and alongg(bmoPreJoinTerminal_rel_right, the triple of the virtual run being the pulled-back triple byIsPullbackOf.eq), thenvalueOn_eq_of_rel_idandvalueOn_pullback_of_rel'. - indifference. The canonical chains of
Tand of the boundary-extended triple coincide, the bound being read on the nonmonomial ideal, which does not see the empty members (step2ChainOpens_withBoundary, fromroundOrderOn_withBoundary); along the common chain from the common bound the two descents have the same lists (descentStateAux_L_indiff), and so do the two continuations (step23Aux_L_indiff).bmoTerminal_L_indiffstates this as a heterogeneous equality across the propositionally equal chains, which the value discharges by substituting the terminal open.
Three more transports of the value #
The value on a smaller open is the value on the larger open restricted and cleaned: the
compatibility for one terminal state (pullback_comp, eraseEmpty_pullback_eraseEmpty).
The identity form of valueOn_pullback_of_rel: a terminal state for the triple pulled back
along the identity, whose cleaned list is the cleaned pull-back of the list of a terminal state
along the inclusion W' ⊆ W, has the same value on every U' ≤ W': the inclusion composed with
the restriction to U' is the restriction to U' (pullback_comp, pullback_congr,
eraseEmpty_pullback_eraseEmpty).
valueOn_pullback_of_rel for any triple equal to the pull-back, the form in which the alignment
facts descentStateAux_rel and step23Aux_rel are stated.
The three naturality exports of the sequence #
Every export is the corresponding proof for the first step (stepAFamOn_compat,
stepAFamOn_pullback, stepAFamOn_indiff) with the continuation appended: the virtual descent of
the pair (over the join chain stepAJoin, over the pre-join chain preJoin) is continued through
the separation and monomial steps along a virtual continuation chain which maps into both real
continuation chains link by link, the alignment of the first step (descentStateAux_rel) feeds
that of the continuation (step23Aux_rel), and the transports of valueOn read the two real
sequences off the one virtual terminal state.
The canonical terminal state, named #
The canonical terminal state of the three steps over U at the threshold m
(step23ChainState with its terminal bound); bmoSeqOn is its value on U.
Equations
- Hironaka.Manifold.BMO.bmoTerminal T m hT bo hcomp hid hidN st3 U hU = { toChainState := Hironaka.Manifold.BMO.step23ChainState T m hT bo ⋯ ⋯ ⋯ st3 m ⋯ ⋯ U hU, ord_lt := ⋯ }
Instances For
Compatibility: the virtual join chain of the pair U ≤ V, continued #
The number of links of the virtual descent of the first step on the join chain, its bound the larger of the two.
Equations
- Hironaka.Manifold.BMO.bmoJoinLinks T m U hU V hV = Hironaka.Manifold.BMOmod.stepAJoinBound T U hU V hV + 1 - m
Instances For
The virtual continuation chain: the exit open of the join descent, then the shrinkings of
closure U inside it met with both real continuation chains, so that it maps into each of them
link by link.
Equations
- One or more equations did not get rendered due to their size.
- Hironaka.Manifold.BMO.bmoJoinCont T m U hU V hV hUV 0 = Hironaka.Manifold.BMOmod.stepAJoin U hU V hV (Hironaka.Manifold.BMO.bmoJoinLinks T m U hU V hV)
Instances For
The virtual descent of the first step for the pair (for T pulled back along the identity, on
the join chain from the larger bound), read at its exit bound m − 1.
Equations
- One or more equations did not get rendered due to their size.
Instances For
The virtual terminal state of the pair: the separation and monomial steps along the virtual continuation chain.
Equations
- One or more equations did not get rendered due to their size.
Instances For
The alignment of the first step along the identity (descentStateAux_rel at the offset of
bounds stepAJoinBound − stepABound, then alignRHS_congr to the number of links of U): the
cleaned list of the virtual exit state is the cleaned pull-back of that of the real exit state of
U.
The relation carried through the separation and monomial steps (step23Aux_rel along the
identity).
The compatibility CompatibleFamily.compat on the values ([Wlo09, Theorem 2.0.3 (4)],
[Wlo09, Definition 3.2.6]; [Kol07, 34.1]): the sequence over U ≤ V is the sequence over V
restricted to U and cleaned. Both are the virtual terminal state of the pair read on U
(valueOn_eq_of_rel_id twice, then valueOn_restrict).
Local isomorphisms: the virtual pre-join chain of U' ⊆ N and g(U') ⊆ M, continued #
The number of links of the virtual descent on the pre-join chain.
Equations
- Hironaka.Manifold.BMO.bmoPreJoinLinks T m g hg U' hU' = Hironaka.Manifold.BMOmod.preJoinBound T g hg U' hU' (Hironaka.Manifold.AnalyticMap.imageOpens g hg U') ⋯ + 1 - m
Instances For
The virtual continuation chain over N: the exit open of the pre-join descent, then the
shrinkings of closure U' met with the real continuation of U' and the g-preimage of the real
continuation of g(U').
Equations
- One or more equations did not get rendered due to their size.
Instances For
The virtual descent of the first step for the pair (for the pulled-back triple pulled back once
more along the identity, on the pre-join chain from the larger bound), read at its exit bound
m − 1.
Equations
- One or more equations did not get rendered due to their size.
Instances For
The virtual terminal state of the pair over N.
Equations
- One or more equations did not get rendered due to their size.
Instances For
The virtual terminal state aligned with the real terminal state of U' (for the pulled-back
triple), along the identity of N (descentStateAux_rel and step23Aux_rel along the
identity).
The virtual terminal state aligned with the real terminal state of g(U') (for T), along g
(descentStateAux_rel and step23Aux_rel along g; the triple of the virtual descent is the
pulled-back triple by IsPullbackOf.eq, which is substituted inside).
The commutation with local analytic isomorphisms ([Kol07, Theorem 107 (2)], [Kol07, 34.1]) in
the form CommutesWithLocalIsos requires: for T' a pull-back of T along a local analytic
isomorphism g, the sequence over U' is the sequence over g(U') pulled back along g|_{U'}
and cleaned. Both are the virtual terminal state of the pair read on U' (valueOn_eq_of_rel_id
along the identity of N, valueOn_pullback_of_rel' along g).
Indifference: the same chain from the same bound for the boundary-extended triple #
The canonical chains of T and of the boundary-extended triple coincide: the bound is read on
the nonmonomial ideal, which does not see the empty members (roundOrderOn_withBoundary), and the
chain is the shrink chain from it (substituting through the dependent inclusion proof).
The terminal lists agree across the propositionally equal canonical chains: the descents
of the first step from the equal bounds have the same lists (descentStateAux_L_indiff, after
substituting the bound and the number of links), and the continuations along the same chain from
states with the same list have the same list (step23Aux_L_indiff, after substituting the
chain).
The indifference to empty boundary members (the counterpart, for boundary members, of
[Kol07, 32]) on each open, for the triple with the
boundary replaced by F': the canonical chain and bound do not see the empty members, and the two
runs along them have the same lists (bmoTerminal_L_indiff), so the values on U agree (the
heterogeneous equality is discharged by substituting the terminal open).