English
The inverse app interactions with restriction maps are natural with respect to inclusions between opens.
Русский
Обратная аппроксимация взаимодейcтвует с ограничениями согласно вложениям между открытыми множествами (натурализм).
LaTeX
$$X.presheaf.map i ≫ H.invApp _ (unop V) = invApp f (unop U) ≫ Y.presheaf.map (opensFunctor f |>.op.map i)$$
Lean4
/-- For an open immersion `f : X ⟶ Y` and an open set `U ⊆ X`, we have the map `X(U) ⟶ Y(U)`. -/
noncomputable def invApp (U : Opens X) : X.presheaf.obj (op U) ⟶ Y.presheaf.obj (op (opensFunctor f |>.obj U)) :=
X.presheaf.map (eqToHom (by simp [Opens.map, Set.preimage_image_eq _ H.base_open.injective])) ≫
inv (f.c.app (op (opensFunctor f |>.obj U)))