# mathlibdocumentation

topology.sheaves.stalks

# Stalks #

For a presheaf F on a topological space X, valued in some category C, the stalk of F at the point x : X is defined as the colimit of the following functor

(nhds x)ᵒᵖ ⥤ (opens X)ᵒᵖ ⥤ C

where the functor on the left is the inclusion of categories and the functor on the right is F. For an open neighborhood U of x, we define the map F.germ x : F.obj (op U) ⟶ F.stalk x as the canonical morphism into this colimit.

Taking stalks is functorial: For every point x : X we define a functor stalk_functor C x, sending presheaves on X to objects of C. Furthermore, for a map f : X ⟶ Y between topological spaces, we define stalk_pushforward as the induced map on the stalks (f _* ℱ).stalk (f x) ⟶ ℱ.stalk x.

Some lemmas about stalks and germs only hold for certain classes of concrete categories. A basic property of forgetful functors of categories of algebraic structures (like Mon, CommRing,...) is that they preserve filtered colimits. Since stalks are filtered colimits, this ensures that the stalks of presheaves valued in these categories behave exactly as for Type-valued presheaves. For example, in germ_exist we prove that in such a category, every element of the stalk is the germ of a section.

Furthermore, if we require the forgetful functor to reflect isomorphisms and preserve limits (as is the case for most algebraic structures), we have access to the unique gluing API and can prove further properties. Most notably, in is_iso_iff_stalk_functor_map_iso, we prove that in such a category, a morphism of sheaves is an isomorphism if and only if all of its stalk maps are isomorphisms.

See also the definition of "algebraic structures" in the stacks project: https://stacks.math.columbia.edu/tag/007L

def Top.presheaf.stalk_functor (C : Type u) {X : Top} (x : X) :
X C

Stalks are functorial with respect to morphisms of presheaves over a fixed X.

Equations
def Top.presheaf.stalk {C : Type u} {X : Top} (ℱ : X) (x : X) :
C

The stalk of a presheaf F at a point x is calculated as the colimit of the functor nbhds x ⥤ opens F.X ⥤ C

Equations
@[simp]
theorem Top.presheaf.stalk_functor_obj {C : Type u} {X : Top} (ℱ : X) (x : X) :
= ℱ.stalk x
def Top.presheaf.germ {C : Type u} {X : Top} (F : X) {U : topological_space.opens X} (x : U) :

The germ of a section of a presheaf over an open at a point of that open.

Equations
@[simp]
theorem Top.presheaf.germ_res_apply {C : Type u} {X : Top} (F : X) {U V : topological_space.opens X} (i : U V) (x : U) (x_1 : (F.obj (opposite.op V))) :
(F.germ x) ((F.map i.op) x_1) = (F.germ (i x)) x_1
@[simp]
theorem Top.presheaf.germ_res {C : Type u} {X : Top} (F : X) {U V : topological_space.opens X} (i : U V) (x : U) :
F.map i.op F.germ x = F.germ (i x)
theorem Top.presheaf.stalk_hom_ext {C : Type u} {X : Top} (F : X) {x : X} {Y : C} {f₁ f₂ : F.stalk x Y} (ih : ∀ (U : (hxU : x U), F.germ x, hxU⟩ f₁ = F.germ x, hxU⟩ f₂) :
f₁ = f₂

A morphism from the stalk of F at x to some object Y is completely determined by its composition with the germ morphisms.

@[simp]
theorem Top.presheaf.stalk_functor_map_germ_apply {C : Type u} {X : Top} {F G : X} (U : topological_space.opens X) (x : U) (f : F G) (x_1 : (F.obj (opposite.op U))) :
.map f) ((F.germ x) x_1) = (G.germ x) ((f.app (opposite.op U)) x_1)
@[simp]
theorem Top.presheaf.stalk_functor_map_germ_assoc {C : Type u} {X : Top} {F G : X} (U : topological_space.opens X) (x : U) (f : F G) {X' : C} (f' : .obj G X') :
F.germ x .map f f' = f.app (opposite.op U) G.germ x f'
@[simp]
theorem Top.presheaf.stalk_functor_map_germ {C : Type u} {X : Top} {F G : X} (U : topological_space.opens X) (x : U) (f : F G) :
F.germ x .map f = f.app (opposite.op U) G.germ x
def Top.presheaf.stalk_pushforward (C : Type u) {X Y : Top} (f : X Y) (F : X) (x : X) :
(f _* F).stalk (f x) F.stalk x

For a presheaf F on a space X, a continuous map f : X ⟶ Y induces a morphisms between the stalk of f _ * F at f x and the stalk of F at x.

Equations
@[simp]
theorem Top.presheaf.stalk_pushforward_germ (C : Type u) {X Y : Top} (f : X Y) (F : X) (U : topological_space.opens Y) (x : U)) :
(f _* F).germ f x, _⟩ = F.germ x
@[simp]
theorem Top.presheaf.stalk_pushforward_germ_assoc (C : Type u) {X Y : Top} (f : X Y) (F : X) (U : topological_space.opens Y) (x : U)) {X' : C} (f' : F.stalk x X') :
(f _* F).germ f x, _⟩ f' = F.germ x f'
@[simp]
theorem Top.presheaf.stalk_pushforward_germ_apply (C : Type u) {X Y : Top} (f : X Y) (F : X) (U : topological_space.opens Y) (x : U)) (x_1 : ((f _* F).obj (opposite.op U))) :
x) (((f _* F).germ f x, _⟩) x_1) = (F.germ x) x_1
@[simp]
theorem Top.presheaf.stalk_pushforward.id (C : Type u) {X : Top} (ℱ : X) (x : X) :
x =
@[simp]
theorem Top.presheaf.stalk_pushforward.comp (C : Type u) {X Y Z : Top} (ℱ : X) (f : X Y) (g : Y Z) (x : X) :
(f g) x = (f _* ℱ) (f x)
@[ext]
theorem Top.presheaf.germ_ext {C : Type u} {X : Top} (F : X) {U V : topological_space.opens X} {x : X} {hxU : x U} {hxV : x V} (W : topological_space.opens X) (hxW : x W) (iWU : W U) (iWV : W V) {sU : (F.obj (opposite.op U))} {sV : (F.obj (opposite.op V))} (ih : (F.map iWU.op) sU = (F.map iWV.op) sV) :
(F.germ x, hxU⟩) sU = (F.germ x, hxV⟩) sV
theorem Top.presheaf.germ_exist {C : Type u} {X : Top} (F : X) (x : X) (t : (F.stalk x)) :
∃ (U : (m : x U) (s : (F.obj (opposite.op U))), (F.germ x, m⟩) s = t

For presheaves valued in a concrete category whose forgetful functor preserves filtered colimits, every element of the stalk is the germ of a section.

theorem Top.presheaf.germ_eq {C : Type u} {X : Top} (F : X) {U V : topological_space.opens X} (x : X) (mU : x U) (mV : x V) (s : (F.obj (opposite.op U))) (t : (F.obj (opposite.op V))) (h : (F.germ x, mU⟩) s = (F.germ x, mV⟩) t) :
∃ (W : (m : x W) (iU : W U) (iV : W V), (F.map iU.op) s = (F.map iV.op) t
theorem Top.presheaf.stalk_functor_map_injective_of_app_injective {C : Type u} {X : Top} {F G : X} (f : F G) (h : ∀ (U : , function.injective (f.app (opposite.op U))) (x : X) :
theorem Top.presheaf.section_ext {C : Type u} {X : Top} (F : X) (U : topological_space.opens X) (s t : (F.val.obj (opposite.op U))) (h : ∀ (x : U), (F.val.germ x) s = (F.val.germ x) t) :
s = t

Let F be a sheaf valued in a concrete category, whose forgetful functor reflects isomorphisms, preserves limits and filtered colimits. Then two sections who agree on every stalk must be equal.

theorem Top.presheaf.app_injective_of_stalk_functor_map_injective {C : Type u} {X : Top} {F : X} {G : X} (f : F.val G) (h : ∀ (x : X), ) (U : topological_space.opens X) :
theorem Top.presheaf.app_injective_iff_stalk_functor_map_injective {C : Type u} {X : Top} {F : X} {G : X} (f : F.val G) :
theorem Top.presheaf.app_surjective_of_injective_of_locally_surjective {C : Type u} {X : Top} {F G : X} (f : F G) (hinj : ∀ (x : X), ) (U : topological_space.opens X) (hsurj : ∀ (t : (G.val.obj (opposite.op U))) (x : U), ∃ (V : (m : x.val V) (iVU : V U) (s : (F.val.obj (opposite.op V))), (f.app (opposite.op V)) s = (G.val.map iVU.op) t) :

For surjectivity, we are given an arbitrary section t and need to find a preimage for it. We claim that it suffices to find preimages locally. That is, for each x : U we construct a neighborhood V ≤ U and a section s : F.obj (op V)) such that f.app (op V) s and t agree on V.

theorem Top.presheaf.app_surjective_of_stalk_functor_map_bijective {C : Type u} {X : Top} {F G : X} (f : F G) (h : ∀ (x : X), ) (U : topological_space.opens X) :
theorem Top.presheaf.app_bijective_of_stalk_functor_map_bijective {C : Type u} {X : Top} {F G : X} (f : F G) (h : ∀ (x : X), ) (U : topological_space.opens X) :
theorem Top.presheaf.is_iso_of_stalk_functor_map_iso {C : Type u} {X : Top} {F G : X} (f : F G) [∀ (x : X), ] :

Let F and G be sheaves valued in a concrete category, whose forgetful functor reflects isomorphisms, preserves limits and filtered colimits. Then if the stalk maps of a morphism f : F ⟶ G are all isomorphisms, f must be an isomorphism.

Let F and G be sheaves valued in a concrete category, whose forgetful functor reflects isomorphisms, preserves limits and filtered colimits. Then a morphism f : F ⟶ G is an isomorphism if and only if all of its stalk maps are isomorphisms.