# Sheaves taking values in a category #

If C is a category with a Grothendieck topology, we define the notion of a sheaf taking values in an arbitrary category A. We follow the definition in https://stacks.math.columbia.edu/tag/00VR, noting that the presheaf of sets "defined above" can be seen in the comments between tags 00VQ and 00VR on the page https://stacks.math.columbia.edu/tag/00VL. The advantage of this definition is that we need no assumptions whatsoever on A other than the assumption that the morphisms in C and A live in the same universe.

• An A-valued presheaf P : Cᵒᵖ ⥤ A is defined to be a sheaf (for the topology J) iff for every E : A, the type-valued presheaves of sets given by sending U : Cᵒᵖ to Hom_{A}(E, P U) are all sheaves of sets, see CategoryTheory.Presheaf.IsSheaf.
• When A = Type, this recovers the basic definition of sheaves of sets, see CategoryTheory.isSheaf_iff_isSheaf_of_type.
• A alternate definition in terms of limits, unconditionally equivalent to the original one: see CategoryTheory.Presheaf.isSheaf_iff_isLimit.
• An alternate definition when C is small, has pullbacks and A has products is given by an equalizer condition CategoryTheory.Presheaf.IsSheaf'. This is equivalent to the earlier definition, shown in CategoryTheory.Presheaf.isSheaf_iff_isSheaf'.
• When A = Type, this is definitionally equal to the equalizer condition for presieves in CategoryTheory.Sites.SheafOfTypes.
• When A has limits and there is a functor s : A ⥤ Type which is faithful, reflects isomorphisms and preserves limits, then P : Cᵒᵖ ⥤ A is a sheaf iff the underlying presheaf of types P ⋙ s : Cᵒᵖ ⥤ Type is a sheaf (CategoryTheory.Presheaf.isSheaf_iff_isSheaf_forget). Cf https://stacks.math.columbia.edu/tag/0073, which is a weaker version of this statement (it's only over spaces, not sites) and https://stacks.math.columbia.edu/tag/00YR (a), which additionally assumes filtered colimits.

## Implementation notes #

Occasionally we need to take a limit in A of a collection of morphisms of C indexed by a collection of objects in C. This turns out to force the morphisms of A to be in a sufficiently large universe. Rather than use UnivLE we prove some results for a category A' instead, whose morphism universe of A' is defined to be max u₁ v₁, where u₁, v₁ are the universes for C. Perhaps after we get better at handling universe inequalities this can be changed.

def CategoryTheory.Presheaf.IsSheaf {C : Type u₁} [] {A : Type u₂} [] (P : ) :

A sheaf of A is a presheaf P : Cᵒᵖ => A such that for every E : A, the presheaf of types given by sending U : C to Hom_{A}(E, P U) is a sheaf of types.

https://stacks.math.columbia.edu/tag/00VR

Equations
Instances For
def CategoryTheory.Presheaf.IsSeparated {C : Type u₁} [] {A : Type u₂} [] (P : ) :

Condition that a presheaf with values in a concrete category is separated for a Grothendieck topology.

Equations
• One or more equations did not get rendered due to their size.
Instances For
@[simp]
theorem CategoryTheory.Presheaf.conesEquivSieveCompatibleFamily_symm_apply_app {C : Type u₁} [] {A : Type u₂} [] (P : ) {X : C} (S : ) (E : Aᵒᵖ) (x : { x : CategoryTheory.Presieve.FamilyOfElements (P.comp (CategoryTheory.coyoneda.obj E)) S.arrows // x.SieveCompatible }) (f : S.arrows.categoryᵒᵖ) :
( x).app f = x f.unop.obj.hom
@[simp]
theorem CategoryTheory.Presheaf.conesEquivSieveCompatibleFamily_apply_coe {C : Type u₁} [] {A : Type u₂} [] (P : ) {X : C} (S : ) (E : Aᵒᵖ) (π : (S.arrows.diagram.op.comp P).cones.obj E) (Y : C) (f : Y X) (h : S.arrows f) :
f h = π.app { unop := { obj := , property := h } }
def CategoryTheory.Presheaf.conesEquivSieveCompatibleFamily {C : Type u₁} [] {A : Type u₂} [] (P : ) {X : C} (S : ) (E : Aᵒᵖ) :
(S.arrows.diagram.op.comp P).cones.obj E { x : CategoryTheory.Presieve.FamilyOfElements (P.comp (CategoryTheory.coyoneda.obj E)) S.arrows // x.SieveCompatible }

Given a sieve S on X : C, a presheaf P : Cᵒᵖ ⥤ A, and an object E of A, the cones over the natural diagram S.arrows.diagram.op ⋙ P associated to S and P with cone point E are in 1-1 correspondence with sieve_compatible family of elements for the sieve S and the presheaf of types Hom (E, P -).

Equations
• One or more equations did not get rendered due to their size.
Instances For
def CategoryTheory.Presieve.FamilyOfElements.SieveCompatible.cone {C : Type u₁} [] {A : Type u₂} [] {P : } {X : C} {S : } {E : Aᵒᵖ} {x : CategoryTheory.Presieve.FamilyOfElements (P.comp (CategoryTheory.coyoneda.obj E)) S.arrows} (hx : x.SieveCompatible) :
CategoryTheory.Limits.Cone (S.arrows.diagram.op.comp P)

The cone corresponding to a sieve_compatible family of elements, dot notation enabled.

Equations
• hx.cone = { pt := E.unop, π := .invFun x, hx }
Instances For
def CategoryTheory.Presheaf.homEquivAmalgamation {C : Type u₁} [] {A : Type u₂} [] {P : } {X : C} {S : } {E : Aᵒᵖ} {x : CategoryTheory.Presieve.FamilyOfElements (P.comp (CategoryTheory.coyoneda.obj E)) S.arrows} (hx : x.SieveCompatible) :
(hx.cone P.mapCone S.arrows.cocone.op) { t : (P.comp (CategoryTheory.coyoneda.obj E)).obj { unop := X } // x.IsAmalgamation t }

Cone morphisms from the cone corresponding to a sieve_compatible family to the natural cone associated to a sieve S and a presheaf P are in 1-1 correspondence with amalgamations of the family.

Equations
• One or more equations did not get rendered due to their size.
Instances For
theorem CategoryTheory.Presheaf.isLimit_iff_isSheafFor {C : Type u₁} [] {A : Type u₂} [] (P : ) {X : C} (S : ) :
Nonempty (CategoryTheory.Limits.IsLimit (P.mapCone S.arrows.cocone.op)) ∀ (E : Aᵒᵖ), CategoryTheory.Presieve.IsSheafFor (P.comp (CategoryTheory.coyoneda.obj E)) S.arrows

Given sieve S and presheaf P : Cᵒᵖ ⥤ A, their natural associated cone is a limit cone iff Hom (E, P -) is a sheaf of types for the sieve S and all E : A.

theorem CategoryTheory.Presheaf.subsingleton_iff_isSeparatedFor {C : Type u₁} [] {A : Type u₂} [] (P : ) {X : C} (S : ) :
(∀ (c : CategoryTheory.Limits.Cone (S.arrows.diagram.op.comp P)), Subsingleton (c P.mapCone S.arrows.cocone.op)) ∀ (E : Aᵒᵖ), CategoryTheory.Presieve.IsSeparatedFor (P.comp (CategoryTheory.coyoneda.obj E)) S.arrows

Given sieve S and presheaf P : Cᵒᵖ ⥤ A, their natural associated cone admits at most one morphism from every cone in the same category (i.e. over the same diagram), iff Hom (E, P -)is separated for the sieve S and all E : A.

theorem CategoryTheory.Presheaf.isSheaf_iff_isLimit {C : Type u₁} [] {A : Type u₂} [] (P : ) :
∀ ⦃X : C⦄, SJ.sieves X, Nonempty (CategoryTheory.Limits.IsLimit (P.mapCone S.arrows.cocone.op))

A presheaf P is a sheaf for the Grothendieck topology J iff for every covering sieve S of J, the natural cone associated to P and S is a limit cone.

theorem CategoryTheory.Presheaf.isSeparated_iff_subsingleton {C : Type u₁} [] {A : Type u₂} [] (P : ) :
(∀ (E : A), CategoryTheory.Presieve.IsSeparated J (P.comp (CategoryTheory.coyoneda.obj { unop := E }))) ∀ ⦃X : C⦄, SJ.sieves X, ∀ (c : CategoryTheory.Limits.Cone (S.arrows.diagram.op.comp P)), Subsingleton (c P.mapCone S.arrows.cocone.op)

A presheaf P is separated for the Grothendieck topology J iff for every covering sieve S of J, the natural cone associated to P and S admits at most one morphism from every cone in the same category.

theorem CategoryTheory.Presheaf.isLimit_iff_isSheafFor_presieve {C : Type u₁} [] {A : Type u₂} [] (P : ) {X : C} (R : ) :
Nonempty (CategoryTheory.Limits.IsLimit (P.mapCone .arrows.cocone.op)) ∀ (E : Aᵒᵖ), CategoryTheory.Presieve.IsSheafFor (P.comp (CategoryTheory.coyoneda.obj E)) R

Given presieve R and presheaf P : Cᵒᵖ ⥤ A, the natural cone associated to P and the sieve Sieve.generate R generated by R is a limit cone iff Hom (E, P -) is a sheaf of types for the presieve R and all E : A.

theorem CategoryTheory.Presheaf.isSheaf_iff_isLimit_pretopology {C : Type u₁} [] {A : Type u₂} [] (P : ) (K : ) :
∀ ⦃X : C⦄, RK.coverings X, Nonempty (CategoryTheory.Limits.IsLimit (P.mapCone .arrows.cocone.op))

A presheaf P is a sheaf for the Grothendieck topology generated by a pretopology K iff for every covering presieve R of K, the natural cone associated to P and Sieve.generate R is a limit cone.

def CategoryTheory.Presheaf.IsSheaf.amalgamate {C : Type u₁} [] {A : Type u₂} [] {E : A} {X : C} {P : } (hP : ) (S : J.Cover X) (x : (I : S.Arrow) → E P.obj { unop := I.Y }) (hx : ∀ (I : S.Relation), CategoryTheory.CategoryStruct.comp (x I.fst) (P.map I.g₁.op) = CategoryTheory.CategoryStruct.comp (x I.snd) (P.map I.g₂.op)) :
E P.obj { unop := X }

This is a wrapper around Presieve.IsSheafFor.amalgamate to be used below. If Ps a sheaf, S is a cover of X, and x is a collection of morphisms from E to P evaluated at terms in the cover which are compatible, then we can amalgamate the xs to obtain a single morphism E ⟶ P.obj (op X).

Equations
• hP.amalgamate S x hx = .amalgamate (fun (Y : C) (f : Y X) (hf : S.sieve.arrows f) => x { Y := Y, f := f, hf := hf })
Instances For
@[simp]
theorem CategoryTheory.Presheaf.IsSheaf.amalgamate_map_assoc {C : Type u₁} [] {A : Type u₂} [] {E : A} {X : C} {P : } (hP : ) (S : J.Cover X) (x : (I : S.Arrow) → E P.obj { unop := I.Y }) (hx : ∀ (I : S.Relation), CategoryTheory.CategoryStruct.comp (x I.fst) (P.map I.g₁.op) = CategoryTheory.CategoryStruct.comp (x I.snd) (P.map I.g₂.op)) (I : S.Arrow) {Z : A} (h : P.obj { unop := I.Y } Z) :
@[simp]
theorem CategoryTheory.Presheaf.IsSheaf.amalgamate_map {C : Type u₁} [] {A : Type u₂} [] {E : A} {X : C} {P : } (hP : ) (S : J.Cover X) (x : (I : S.Arrow) → E P.obj { unop := I.Y }) (hx : ∀ (I : S.Relation), CategoryTheory.CategoryStruct.comp (x I.fst) (P.map I.g₁.op) = CategoryTheory.CategoryStruct.comp (x I.snd) (P.map I.g₂.op)) (I : S.Arrow) :
CategoryTheory.CategoryStruct.comp (hP.amalgamate S x hx) (P.map I.f.op) = x I
theorem CategoryTheory.Presheaf.IsSheaf.hom_ext {C : Type u₁} [] {A : Type u₂} [] {E : A} {X : C} {P : } (hP : ) (S : J.Cover X) (e₁ : E P.obj { unop := X }) (e₂ : E P.obj { unop := X }) (h : ∀ (I : S.Arrow), CategoryTheory.CategoryStruct.comp e₁ (P.map I.f.op) = CategoryTheory.CategoryStruct.comp e₂ (P.map I.f.op)) :
e₁ = e₂
theorem CategoryTheory.Presheaf.IsSheaf.hom_ext_ofArrows {C : Type u₁} [] {A : Type u₂} [] {P : } (hP : ) {I : Type u_1} {S : C} {X : IC} (f : (i : I) → X i S) (hf : CategoryTheory.Sieve.ofArrows (fun (i : I) => X i) f J.sieves S) {E : A} {x : E P.obj { unop := S }} {y : E P.obj { unop := S }} (h : ∀ (i : I), CategoryTheory.CategoryStruct.comp x (P.map (f i).op) = CategoryTheory.CategoryStruct.comp y (P.map (f i).op)) :
x = y
theorem CategoryTheory.Presheaf.IsSheaf.exists_unique_amalgamation_ofArrows {C : Type u₁} [] {A : Type u₂} [] {P : } (hP : ) {I : Type u_1} {S : C} {X : IC} (f : (i : I) → X i S) (hf : CategoryTheory.Sieve.ofArrows (fun (i : I) => X i) f J.sieves S) {E : A} (x : (i : I) → E P.obj { unop := X i }) (hx : ∀ ⦃W : C⦄ ⦃i j : I⦄ (a : W X i) (b : W X j), CategoryTheory.CategoryStruct.comp (x i) (P.map a.op) = CategoryTheory.CategoryStruct.comp (x j) (P.map b.op)) :
∃! g : E P.obj { unop := S }, ∀ (i : I), CategoryTheory.CategoryStruct.comp g (P.map (f i).op) = x i
def CategoryTheory.Presheaf.IsSheaf.amalgamateOfArrows {C : Type u₁} [] {A : Type u₂} [] {P : } (hP : ) {I : Type u_1} {S : C} {X : IC} (f : (i : I) → X i S) (hf : CategoryTheory.Sieve.ofArrows (fun (i : I) => X i) f J.sieves S) {E : A} (x : (i : I) → E P.obj { unop := X i }) (hx : ∀ ⦃W : C⦄ ⦃i j : I⦄ (a : W X i) (b : W X j), CategoryTheory.CategoryStruct.comp (x i) (P.map a.op) = CategoryTheory.CategoryStruct.comp (x j) (P.map b.op)) :
E P.obj { unop := S }

If P : Cᵒᵖ ⥤ A is a sheaf and f i : X i ⟶ S is a covering family, then a morphism E ⟶ P.obj (op S) can be constructed from a compatible family of morphisms x : E ⟶ P.obj (op (X i)).

Equations
• hP.amalgamateOfArrows f hf x hx =
Instances For
@[simp]
theorem CategoryTheory.Presheaf.IsSheaf.amalgamateOfArrows_map_assoc {C : Type u₁} [] {A : Type u₂} [] {P : } (hP : ) {I : Type u_1} {S : C} {X : IC} (f : (i : I) → X i S) (hf : CategoryTheory.Sieve.ofArrows (fun (i : I) => X i) f J.sieves S) {E : A} (x : (i : I) → E P.obj { unop := X i }) (hx : ∀ ⦃W : C⦄ ⦃i j : I⦄ (a : W X i) (b : W X j), CategoryTheory.CategoryStruct.comp (x i) (P.map a.op) = CategoryTheory.CategoryStruct.comp (x j) (P.map b.op)) (i : I) {Z : A} (h : P.obj { unop := X i } Z) :
CategoryTheory.CategoryStruct.comp (hP.amalgamateOfArrows f hf x hx) (CategoryTheory.CategoryStruct.comp (P.map (f i).op) h) =
@[simp]
theorem CategoryTheory.Presheaf.IsSheaf.amalgamateOfArrows_map {C : Type u₁} [] {A : Type u₂} [] {P : } (hP : ) {I : Type u_1} {S : C} {X : IC} (f : (i : I) → X i S) (hf : CategoryTheory.Sieve.ofArrows (fun (i : I) => X i) f J.sieves S) {E : A} (x : (i : I) → E P.obj { unop := X i }) (hx : ∀ ⦃W : C⦄ ⦃i j : I⦄ (a : W X i) (b : W X j), CategoryTheory.CategoryStruct.comp (x i) (P.map a.op) = CategoryTheory.CategoryStruct.comp (x j) (P.map b.op)) (i : I) :
CategoryTheory.CategoryStruct.comp (hP.amalgamateOfArrows f hf x hx) (P.map (f i).op) = x i
theorem CategoryTheory.Presheaf.isSheaf_of_iso_iff {C : Type u₁} [] {A : Type u₂} [] {P : } {P' : } (e : P P') :
theorem CategoryTheory.Presheaf.isSheaf_of_isTerminal {C : Type u₁} [] {A : Type u₂} [] {X : A} (hX : ) :
structure CategoryTheory.Sheaf {C : Type u₁} [] (A : Type u₂) [] :
Type (max (max (max u₁ u₂) v₁) v₂)

The category of sheaves taking values in A on a grothendieck topology.

Instances For
theorem CategoryTheory.Sheaf.cond {C : Type u₁} [] {A : Type u₂} [] (self : ) :

the condition that the presheaf is a sheaf

theorem CategoryTheory.Sheaf.Hom.ext {C : Type u₁} :
∀ {inst : } {J : } {A : Type u₂} {inst_1 : } {X Y : } (x y : X.Hom Y), x.val = y.valx = y
theorem CategoryTheory.Sheaf.Hom.ext_iff {C : Type u₁} :
∀ {inst : } {J : } {A : Type u₂} {inst_1 : } {X Y : } (x y : X.Hom Y), x = y x.val = y.val
structure CategoryTheory.Sheaf.Hom {C : Type u₁} [] {A : Type u₂} [] (X : ) (Y : ) :
Type (max u₁ v₂)

Morphisms between sheaves are just morphisms of presheaves.

• val : X.val Y.val

a morphism between the underlying presheaves

Instances For
@[simp]
theorem CategoryTheory.Sheaf.instCategorySheaf_comp_val {C : Type u₁} [] {A : Type u₂} [] :
∀ {X Y Z : } (f : X Y) (g : Y Z), .val = CategoryTheory.CategoryStruct.comp f.val g.val
@[simp]
theorem CategoryTheory.Sheaf.instCategorySheaf_id_val {C : Type u₁} [] {A : Type u₂} [] :
∀ (x : ),
instance CategoryTheory.Sheaf.instCategorySheaf {C : Type u₁} [] {A : Type u₂} [] :
Equations
• CategoryTheory.Sheaf.instCategorySheaf =
instance CategoryTheory.Sheaf.instInhabitedHom {C : Type u₁} [] {A : Type u₂} [] (X : ) :
Inhabited (X.Hom X)
Equations
• X.instInhabitedHom = { default := }
theorem CategoryTheory.Sheaf.hom_ext {C : Type u₁} [] {A : Type u₂} [] {X : } {Y : } (x : X Y) (y : X Y) (h : x.val = y.val) :
x = y
@[simp]
theorem CategoryTheory.sheafToPresheaf_obj {C : Type u₁} [] (A : Type u₂) [] (self : ) :
.obj self = self.val
@[simp]
theorem CategoryTheory.sheafToPresheaf_map {C : Type u₁} [] (A : Type u₂) [] :
∀ {X Y : } (f : X Y), .map f = f.val
def CategoryTheory.sheafToPresheaf {C : Type u₁} [] (A : Type u₂) [] :

The inclusion functor from sheaves to presheaves.

Equations
• = { obj := CategoryTheory.Sheaf.val, map := fun {X Y : } (f : X Y) => f.val, map_id := , map_comp := }
Instances For
@[reducible, inline]
abbrev CategoryTheory.sheafSections {C : Type u₁} [] (A : Type u₂) [] :

The sections of a sheaf (i.e. evaluation as a presheaf on C).

Equations
• = .flip
Instances For
@[simp]
theorem CategoryTheory.fullyFaithfulSheafToPresheaf_preimage_val {C : Type u₁} [] (A : Type u₂) [] :
∀ {X Y : } (f : .obj X .obj Y), (.preimage f).val = f
def CategoryTheory.fullyFaithfulSheafToPresheaf {C : Type u₁} [] (A : Type u₂) [] :
.FullyFaithful

The functor Sheaf J A ⥤ Cᵒᵖ ⥤ A is fully faithful.

Equations
• One or more equations did not get rendered due to their size.
Instances For
@[reducible, inline]
abbrev CategoryTheory.Sheaf.homEquiv {C : Type u₁} [] {A : Type u₂} [] {X : } {Y : } :
(X Y) (X.val Y.val)

The bijection (X ⟶ Y) ≃ (X.val ⟶ Y.val) when X and Y are sheaves.

Equations
• CategoryTheory.Sheaf.homEquiv = .homEquiv
Instances For
instance CategoryTheory.instFullSheafFunctorOppositeSheafToPresheaf {C : Type u₁} [] (A : Type u₂) [] :
.Full
Equations
• =
instance CategoryTheory.instFaithfulSheafFunctorOppositeSheafToPresheaf {C : Type u₁} [] (A : Type u₂) [] :
.Faithful
Equations
• =
theorem CategoryTheory.Sheaf.Hom.mono_of_presheaf_mono {C : Type u₁} [] (A : Type u₂) [] {F : } {G : } (f : F G) [h : CategoryTheory.Mono f.val] :

This is stated as a lemma to prevent class search from forming a loop since a sheaf morphism is monic if and only if it is monic as a presheaf morphism (under suitable assumption).

instance CategoryTheory.Sheaf.Hom.epi_of_presheaf_epi {C : Type u₁} [] (A : Type u₂) [] {F : } {G : } (f : F G) [h : CategoryTheory.Epi f.val] :
Equations
• =
@[simp]
theorem CategoryTheory.sheafOver_val {C : Type u₁} [] {A : Type u₂} [] (ℱ : ) (E : A) :
().val = .val.comp (CategoryTheory.coyoneda.obj { unop := E })
def CategoryTheory.sheafOver {C : Type u₁} [] {A : Type u₂} [] (ℱ : ) (E : A) :

The sheaf of sections guaranteed by the sheaf condition.

Equations
• = { val := .val.comp (CategoryTheory.coyoneda.obj { unop := E }), cond := }
Instances For
theorem CategoryTheory.Presheaf.IsSheaf.isSheafFor {C : Type u₁} [] {P : } (hP : ) {X : C} (S : ) (hS : S J.sieves X) :
@[simp]
theorem CategoryTheory.sheafEquivSheafOfTypes_counitIso {C : Type u₁} [] :
.counitIso = CategoryTheory.NatIso.ofComponents (fun (X : ) => CategoryTheory.Iso.refl (({ obj := fun (S : ) => { val := S.val, cond := }, map := fun {X Y : } (f : X Y) => { val := f.val }, map_id := , map_comp := }.comp { obj := fun (S : ) => { val := S.val, cond := }, map := fun {X Y : } (f : X Y) => { val := f.val }, map_id := , map_comp := }).obj X))
@[simp]
theorem CategoryTheory.sheafEquivSheafOfTypes_functor_obj_val {C : Type u₁} [] (S : ) :
(.functor.obj S).val = S.val
@[simp]
theorem CategoryTheory.sheafEquivSheafOfTypes_inverse_map_val {C : Type u₁} [] :
∀ {X Y : } (f : X Y), (.inverse.map f).val = f.val
@[simp]
theorem CategoryTheory.sheafEquivSheafOfTypes_inverse_obj_val {C : Type u₁} [] (S : ) :
(.inverse.obj S).val = S.val
@[simp]
theorem CategoryTheory.sheafEquivSheafOfTypes_functor_map_val {C : Type u₁} [] :
∀ {X Y : } (f : X Y), (.functor.map f).val = f.val

The category of sheaves taking values in Type is the same as the category of set-valued sheaves.

Equations
• One or more equations did not get rendered due to their size.
Instances For
Equations
• CategoryTheory.instInhabitedSheafBotGrothendieckTopologyType = { default := .inverse.obj default }
def CategoryTheory.Sheaf.isTerminalOfBotCover {C : Type u₁} [] {A : Type u₂} [] (F : ) (X : C) (H : J.sieves X) :
CategoryTheory.Limits.IsTerminal (F.val.obj { unop := X })

If the empty sieve is a cover of X, then F(X) is terminal.

Equations
Instances For
instance CategoryTheory.sheafHomHasZSMul {C : Type u₁} [] {A : Type u₂} [] {P : } {Q : } :
SMul (P Q)
Equations
• CategoryTheory.sheafHomHasZSMul = { smul := fun (n : ) (f : P Q) => { val := { app := fun (U : Cᵒᵖ) => n f.val.app U, naturality := } } }
instance CategoryTheory.instSubHomSheaf {C : Type u₁} [] {A : Type u₂} [] {P : } {Q : } :
Sub (P Q)
Equations
• CategoryTheory.instSubHomSheaf = { sub := fun (f g : P Q) => { val := f.val - g.val } }
instance CategoryTheory.instNegHomSheaf {C : Type u₁} [] {A : Type u₂} [] {P : } {Q : } :
Neg (P Q)
Equations
• CategoryTheory.instNegHomSheaf = { neg := fun (f : P Q) => { val := -f.val } }
instance CategoryTheory.sheafHomHasNSMul {C : Type u₁} [] {A : Type u₂} [] {P : } {Q : } :
SMul (P Q)
Equations
• CategoryTheory.sheafHomHasNSMul = { smul := fun (n : ) (f : P Q) => { val := { app := fun (U : Cᵒᵖ) => n f.val.app U, naturality := } } }
instance CategoryTheory.instZeroHomSheaf {C : Type u₁} [] {A : Type u₂} [] {P : } {Q : } :
Zero (P Q)
Equations
• CategoryTheory.instZeroHomSheaf = { zero := { val := 0 } }
instance CategoryTheory.instAddHomSheaf {C : Type u₁} [] {A : Type u₂} [] {P : } {Q : } :
Equations
• CategoryTheory.instAddHomSheaf = { add := fun (f g : P Q) => { val := f.val + g.val } }
@[simp]
theorem CategoryTheory.Sheaf.Hom.add_app {C : Type u₁} [] {A : Type u₂} [] {P : } {Q : } (f : P Q) (g : P Q) (U : Cᵒᵖ) :
(f + g).val.app U = f.val.app U + g.val.app U
instance CategoryTheory.Sheaf.Hom.addCommGroup {C : Type u₁} [] {A : Type u₂} [] {P : } {Q : } :
Equations
instance CategoryTheory.instPreadditiveSheaf {C : Type u₁} [] {A : Type u₂} [] :
Equations
def CategoryTheory.Presheaf.isLimitOfIsSheaf {C : Type u₁} [] {A : Type u₂} [] (P : ) {X : C} (S : J.Cover X) (hP : ) :

When P is a sheaf and S is a cover, the associated multifork is a limit.

Equations
Instances For
theorem CategoryTheory.Presheaf.isSheaf_iff_multifork {C : Type u₁} [] {A : Type u₂} [] (P : ) :
∀ (X : C) (S : J.Cover X), Nonempty (CategoryTheory.Limits.IsLimit (S.multifork P))
theorem CategoryTheory.Presheaf.isSheaf_iff_multiequalizer {C : Type u₁} [] {A : Type u₂} [] (P : ) [∀ (X : C) (S : J.Cover X), CategoryTheory.Limits.HasMultiequalizer (S.index P)] :
∀ (X : C) (S : J.Cover X), CategoryTheory.IsIso (S.toMultiequalizer P)
def CategoryTheory.Presheaf.firstObj {C : Type u₁} [] {A : Type u₂} [] {U : C} (R : ) (P : ) :
A

The middle object of the fork diagram given in Equation (3) of [MM92], as well as the fork diagram of https://stacks.math.columbia.edu/tag/00VM.

Equations
• = ∏ᶜ fun (f : (V : C) × { f : V U // R f }) => P.obj { unop := f.fst }
Instances For
def CategoryTheory.Presheaf.forkMap {C : Type u₁} [] {A : Type u₂} [] {U : C} (R : ) (P : ) :
P.obj { unop := U }

The left morphism of the fork diagram given in Equation (3) of [MM92], as well as the fork diagram of https://stacks.math.columbia.edu/tag/00VM.

Equations
Instances For
def CategoryTheory.Presheaf.secondObj {C : Type u₁} [] {A : Type u₂} [] {U : C} (R : ) (P : ) :
A

The rightmost object of the fork diagram of https://stacks.math.columbia.edu/tag/00VM, which contains the data used to check a family of elements for a presieve is compatible.

Equations
Instances For
def CategoryTheory.Presheaf.firstMap {C : Type u₁} [] {A : Type u₂} [] {U : C} (R : ) (P : ) :

The map pr₀* of https://stacks.math.columbia.edu/tag/00VM.

Equations
• One or more equations did not get rendered due to their size.
Instances For
def CategoryTheory.Presheaf.secondMap {C : Type u₁} [] {A : Type u₂} [] {U : C} (R : ) (P : ) :

The map pr₁* of https://stacks.math.columbia.edu/tag/00VM.

Equations
• One or more equations did not get rendered due to their size.
Instances For
theorem CategoryTheory.Presheaf.w {C : Type u₁} [] {A : Type u₂} [] {U : C} (R : ) (P : ) :
def CategoryTheory.Presheaf.IsSheaf' {C : Type u₁} [] {A : Type u₂} [] (P : ) :

An alternative definition of the sheaf condition in terms of equalizers. This is shown to be equivalent in CategoryTheory.Presheaf.isSheaf_iff_isSheaf'.

Equations
• One or more equations did not get rendered due to their size.
Instances For
def CategoryTheory.Presheaf.isSheafForIsSheafFor' {C : Type u₁} [] {A : Type u₂} [] (P : ) (s : CategoryTheory.Functor A (Type (max v₁ u₁))) [(J : Type (max v₁ u₁)) → ] (U : C) (R : ) :

(Implementation). An auxiliary lemma to convert between sheaf conditions.

Equations
• One or more equations did not get rendered due to their size.
Instances For
theorem CategoryTheory.Presheaf.isSheaf_iff_isSheaf' {C : Type u₁} [] {A' : Type u₂} [] (P' : ) :

The equalizer definition of a sheaf given by isSheaf' is equivalent to isSheaf.

theorem CategoryTheory.Presheaf.isSheaf_of_isSheaf_comp {C : Type u₁} [] {A : Type u₂} [] {B : Type u₃} [] (P : ) (s : ) [] (h : CategoryTheory.Presheaf.IsSheaf J (P.comp s)) :
theorem CategoryTheory.Presheaf.isSheaf_comp_of_isSheaf {C : Type u₁} [] {A : Type u₂} [] {B : Type u₃} [] (P : ) (s : ) [] (h : ) :
theorem CategoryTheory.Presheaf.isSheaf_iff_isSheaf_comp {C : Type u₁} [] {A : Type u₂} [] {B : Type u₃} [] (P : ) (s : ) [] [] [s.ReflectsIsomorphisms] :
theorem CategoryTheory.Presheaf.isSheaf_iff_isSheaf_forget {C : Type u₁} [] {A' : Type u₂} [] (P' : ) (s : CategoryTheory.Functor A' (Type (max v₁ u₁))) [s.ReflectsIsomorphisms] :

For a concrete category (A, s) where the forgetful functor s : A ⥤ Type v preserves limits and reflects isomorphisms, and A has limits, an A-valued presheaf P : Cᵒᵖ ⥤ A is a sheaf iff its underlying Type-valued presheaf P ⋙ s : Cᵒᵖ ⥤ Type is a sheaf.

Note this lemma applies for "algebraic" categories, eg groups, abelian groups and rings, but not for the category of topological spaces, topological rings, etc since reflecting isomorphisms doesn't hold.