Refinement of a piece family along an analytic map #
To compare the monomial procedure run on a restricted or pulled-back triple with the run on the
original, the piece families of the two are related by a refinement: Ψ on X refines Φ on
Y along ρ : X → Y with parent map p on the pieces and label map σ when every piece of Ψ
lies in the preimage of its parent, the preimage of a parent is the union of its children, children
of one parent are disjoint, labels pass through the strictly monotone σ, and exponents through p
(PieceFamily.RefinesAlong). No order on the pieces is assumed; only the order of the labels is
preserved, which is all the lexicographic comparison of member tuples in [Kol07, 111, Step 3] uses.
The label map is an embedding rather than the identity because two open sets carry different sets of
labels.
The file proves the elementary consequences: the face through x maps bijectively onto the face
through ρ x, so the exponent sums agree (total_faceAt); faces map to faces and a face with a
point over X lifts; the preimage of the centre of a set of faces is the centre of the faces of Ψ
mapping into it (preimage_centerOf), empty when there are none. It also provides the pull-back
family Φ.pullbackFamily ρ (the same pieces, labels and exponents, the pieces replaced by their
whole preimages), which refines Φ with the identity maps and whose state is a sub-state of the
state of Φ in the sense of the combinatorial model (Hironaka.Monomial.MonomialState.Sub), and
the relabelling Ψ.relabel σ L, whose state is related to the state of Ψ by the renaming of
labels Hironaka.Monomial.MonomialState.Rel and refines the state of the pull-back family
(Hironaka.Monomial.MonomialState.Refines). These are the three relations through which the
combinatorial model compares the two runs (BMO/Step3Monomial/RealizePullback.lean).
Ψ on X refines Φ on Y along ρ : X → Y, with parent map p on pieces and label map
σ, strictly monotone on the labels in use: every piece of Ψ lies in the preimage of its parent,
the preimage of a parent is the union of its children, children of one parent are disjoint, labels
pass through σ and exponents through p. A parent may have no child (its preimage is then empty)
or several; a label of Φ off the range of σ has no child, so its members are empty over X.
Parents of live children are live.
The label map lands in
Φ's label range.- σ_strictMonoOn : StrictMonoOn σ (Set.Iio Ψ.nextLabel)
The label map is an order embedding of the label range.
Labels pass through
σ.Exponents pass through
p.A child lies in the preimage of its parent.
- preimage_eq (c : ℕ) : c < Φ.nextComp → ⇑ρ ⁻¹' Φ.piece c = ⋃ c' ∈ {c' ∈ Finset.range Ψ.nextComp | p c' = c}, Ψ.piece c'
The preimage of a parent is the union of its children.
- disjoint (c c' : ℕ) : c < Ψ.nextComp → c' < Ψ.nextComp → c ≠ c' → p c = p c' → Disjoint (Ψ.piece c) (Ψ.piece c')
Children of one parent are disjoint.
Instances For
A point of X in the preimage of a parent lies in one of its children.
The parent map sends the face through x onto the face through ρ x.
The parent map is injective on the face through x, children of one parent being disjoint.
The exponent sums of the faces through x and through ρ x agree.
A face of Ψ maps to a face of Φ, and the parent map is injective on it.
A face of Φ with a point over X lifts to a face of Ψ through that point.
The preimage of the centre of a set S of faces of Φ is the centre of the faces of Ψ
mapping into S.
A centre none of whose faces is the image of a face of Ψ has empty preimage; the corresponding
blow-up is then deleted from the run over X ([Kol07, 32]).
The pull-back family #
The pull-back of Φ along ρ: the same pieces, labels and exponents, the pieces replaced
by their whole preimages (possibly empty, possibly disconnected).
Equations
Instances For
The pull-back family refines Φ along ρ with the identity maps: one child per parent.
The nerve of the pull-back family is the set of faces of Φ with a point over X.
The invariants of the state pass to the pull-back family: a sub-nerve closed under nonempty subsets.
The state of the pull-back family is a sub-state of the state of Φ: the same data and a
sub-nerve (Hironaka.Monomial.MonomialState.Sub).
The relabelling and the chain of states #
The relabelling of a piece family along a label map into a larger label range; the pieces are unchanged.
Equations
Instances For
The relabelled family has the nerve of Ψ, its pieces being unchanged.
The nerve of the state of the relabelled family is the nerve of Ψ.
The state of the relabelled family is the state of Ψ with the labels renamed by the order
embedding σ, the pieces untouched (Hironaka.Monomial.MonomialState.Rel).
The relabelled state refines the state of the pull-back family along the parent map
(Hironaka.Monomial.MonomialState.Refines): faces map injectively to faces, and every face with a
point over X lifts.