Compatibility, commutation with local isomorphisms and indifference to empty members #
The value of the monomial procedure on a relatively compact open (monomialStep3SeqOn,
BMO/Step3Monomial/Value.lean) is the realised run of the input piece family, the traces on U of
the ambient components meeting closure U. Three further properties are required of it: it is
compatible under restriction to a smaller open (for U ≤ V the value on U is the value on V
pulled back and cleaned of its empty blow-ups, [Wlo09, Theorem 2.0.3 (4)]); it commutes with local
analytic isomorphisms up to empty blow-ups ([Kol07, 34.1], [Wlo09, Theorem 3.5.1 (1)–(2)]); and it
is unchanged when empty members of the boundary are deleted. Each is an instance of one theorem,
that the run of a piece family refining another along a local analytic isomorphism is the pull-back
of the run with its empty blow-ups erased (RefinesAlong.realize_pullback_eraseEmpty,
BMO/Step3Monomial/RealizePullback.lean), once the two input families are shown to refine one
another along the map in question. This file proves the three refinements and reads off the three
properties.
- One lemma for the three refinements (
refinesAlong_inputFamily_of_componentMap): a mapφof ambient components, compatible with an order embedding of the members, that carries meeting components to meeting components, preserves the exponents, maps the trace of a component into the trace of its image, covers every point over a component and separates two components with the same image, induces a refinement of the input families; the parent map re-indexes through the enumerations and the label map factors the sorted enumerations of the members (exists_labelMap_factor). - The three component maps: for
U ≤ Vthe identity (a component meetingclosure Umeetsclosure V); along a local analytic isomorphismg, a connected component ofg⁻¹(Eʲ)maps into one connected component ofEʲ(parentIndex), with the same exponent; for the deletion of empty members, the bijection of componentsBMOmod.emptyExtIdxofModified/NonmonomialIndiff.lean.
The theorem is applied with the input family's own boundary family, so the boundary data need not be transported: the run is a function of the pieces, their exponents and the order of the labels alone.
Sorted enumerations of nested finite sets factor (the label maps) #
Two order embeddings of Fin a and Fin b into a linear order, the range of the first inside
the range of the second: the first factors through the second by an order embedding
Fin a ↪o Fin b.
The factor of exists_orderEmbedding_factor as a map ℕ → ℕ on the labels below a: bounded
by b and strictly monotone there, and factoring the enumerations.
Components of a pulled-back family: the parent map #
The map from a member of the pulled-back boundary family into the member.
Equations
- Hironaka.Manifold.BMO.comapMemberMap g F j x = ⟨g ↑x, ⋯⟩
Instances For
The parent of a component of the pulled-back family: the same member, and the connected component into which the image of the component maps (a connected set maps into one connected component).
Equations
- Hironaka.Manifold.BMO.parentIndex F hg i' = ⟨i'.fst, ⋯.connectedComponentsLift i'.snd⟩
Instances For
Every point over a component lies on a component of the pulled-back family whose parent is that component.
Two distinct components of one member are disjoint.
The index of a meeting piece in the enumeration #
The index of a meeting piece in the enumeration meetingPiece.
Equations
- Hironaka.Manifold.BMO.meetingIndex T U hU hi = (Hironaka.Manifold.BMO.meetingPieces T U hU).equivFin ⟨i, hi⟩
Instances For
The refinements between input families #
The common form of the three refinements: a map φ of ambient components, compatible with an
order embedding eMem of the members, carrying meeting components to meeting components,
preserving the exponents, mapping the trace of a component into the trace of its image, covering
every point over a component, and separating two components with the same image, induces a
refinement of the input families along ρ with some parent map p and label map σ.
For U ≤ V the input family of U refines the input family of V along the open inclusion:
one child per parent, its trace.
For T' the pull-back of T along a local analytic isomorphism g and U' ⊆ N relatively
compact, the input family of (T', U') refines the input family of (T, g(U')) along g|_{U'}:
the connected components of g⁻¹(Eʲ) over one component of Eʲ are the children of that component.
The input families of T and of T with its empty boundary members deleted refine one another
along the identity: a bijection of the pieces, the labels through the order embedding e.
The three properties of the value #
Compatibility under restriction: the value on U is the value on V ⊇ U pulled back to U
with its empty blow-ups erased ([Wlo09, Theorem 2.0.3 (4)]).
Commutation with local analytic isomorphisms ([Kol07, 34.1]): for T' the pull-back of T
along a local analytic isomorphism g and a relatively compact open U', the value on U' is the
value on g(U') pulled back along g|_{U'} with its empty blow-ups erased.
Indifference to empty boundary members: deleting the empty members of the boundary does not change the value.