Proposition 3.19.6. (Finite coverings and inverse images of germ reductions). Let be a good germ and let be finitely many good subdomain germs covering it. Then For a morphism of good germs and a subdomain germ , reduction of the inverse image is the inverse image of under restriction of graded valuations. Intersections and finite unions of subdomain germs are consequently compatible with reduction. Here the reduction of a general subdomain germ of a good germ is the union of the reductions in any finite affinoid cover; this union is independent of that cover.
Proof
Proof. Use Lemma 3.19.5 to refine the cover and shrink an affinoid representative of so that the members have the form All the functions may be made invertible near . Let be the tuples with at least one , and put , . The rational domains cover , by choosing a largest . They refine the . Indeed fix with and , and choose with . If , the tuples replacing by first show . Replacing also by then gives for every . If this already holds. Thus . Write for the initial value of . Lemma 3.19.5 identifies the reductions of the with These rational valuation sets cover : any finite list of nonzero homogeneous elements admits a largest member in the divisibility preorder of a valuation ring. Since each lies in the reduction of the corresponding , the covering assertion follows.
Define the reduction of a subdomain germ by the stated finite union. Each affinoid piece gives an open containment locus by Proposition 3.19.4, quasi-compact by Proposition 3.19.2. The finite union is thus a quasi-compact open. Two such covers have a common finite refinement by affinoid subdomain germs: refine their pairwise intersections. The proved covering assertion on each original affinoid piece identifies all three unions. Thus the definition is independent of the cover. For an active Weierstrass inequality, inverse image simply replaces its defining function by its pullback. The isometric embedding preserves its initial value and degree. The displayed formula of Lemma 3.19.5 therefore proves the inverse-image assertion for each such inequality, and hence for finite intersections of them. Refine a general subdomain by these pieces and use the proved finite-cover assertion. Intersection is the particular case of inverse image by a subdomain inclusion; finite union follows from finite covers. ◻