Dense subsites

We define IsCoverDense functors into sites as functors such that there exists a covering sieve that factors through images of the functor for each object in D.

We will primarily consider cover-dense functors that are also full, since this notion is in general not well-behaved otherwise. Note that https://ncatlab.org/nlab/show/dense+sub-site indeed has a weaker notion of cover-dense that loosens this requirement, but it would not have all the properties we would need, and some sheafification would be needed for here and there.

Main results

• CategoryTheory.Functor.IsCoverDense.Types.presheafHom: If G : C ⥤ (D, K) is full and cover-dense, then given any presheaf ℱ and sheaf ℱ' on D, and a morphism α : G ⋙ ℱ ⟶ G ⋙ ℱ', we may glue them together to obtain a morphism of presheaves ℱ ⟶ ℱ'.
• CategoryTheory.Functor.IsCoverDense.sheafIso: If ℱ above is a sheaf and α is an iso, then the result is also an iso.
• CategoryTheory.Functor.IsCoverDense.iso_of_restrict_iso: If G : C ⥤ (D, K) is full and cover-dense, then given any sheaves ℱ, ℱ' on D, and a morphism α : ℱ ⟶ ℱ', then α is an iso if G ⋙ ℱ ⟶ G ⋙ ℱ' is iso.
• CategoryTheory.Functor.IsCoverDense.sheafEquivOfCoverPreservingCoverLifting: If G : (C, J) ⥤ (D, K) is fully-faithful, cover-lifting, cover-preserving, and cover-dense, then it will induce an equivalence of categories of sheaves valued in a complete category.

References

• [Elephant]: Sketches of an Elephant, ℱ. T. Johnstone: C2.2.
• https://ncatlab.org/nlab/show/dense+sub-site
• https://ncatlab.org/nlab/show/comparison+lemma

structure CategoryTheory.Presieve.CoverByImageStructure {C : Type u_1} [CategoryTheory.Category.{u_4, u_1} C] {D : Type u_2} [CategoryTheory.Category.{u_5, u_2} D] (G : CategoryTheory.Functor C D) {V : D} {U : D} (f : V ⟶ U) : Type (max u_1 u_5)

An auxiliary structure that witnesses the fact that f factors through an image object of G.

• obj : C
• lift : V ⟶ G.obj self.obj
• map : G.obj self.obj ⟶ U
• fac : CategoryTheory.CategoryStruct.comp self.lift self.map = f

@[simp]

theorem CategoryTheory.Presieve.CoverByImageStructure.fac_assoc {C : Type u_1} [CategoryTheory.Category.{u_4, u_1} C] {D : Type u_2} [CategoryTheory.Category.{u_5, u_2} D] {G : CategoryTheory.Functor C D} {V : D} {U : D} {f : V ⟶ U} (self : CategoryTheory.Presieve.CoverByImageStructure G f) {Z : D} (h : U ⟶ Z) : CategoryTheory.CategoryStruct.comp self.lift (CategoryTheory.CategoryStruct.comp self.map h) = CategoryTheory.CategoryStruct.comp f h

def CategoryTheory.Presieve.coverByImage {C : Type u_1} [CategoryTheory.Category.{u_4, u_1} C] {D : Type u_2} [CategoryTheory.Category.{u_5, u_2} D] (G : CategoryTheory.Functor C D) (U : D) : CategoryTheory.Presieve U

For a functor G : C ⥤ D, and an object U : D, Presieve.coverByImage G U is the presieve of U consisting of those arrows that factor through images of G.

Equations

• CategoryTheory.Presieve.coverByImage G U f = Nonempty (CategoryTheory.Presieve.CoverByImageStructure G f)

def CategoryTheory.Sieve.coverByImage {C : Type u_1} [CategoryTheory.Category.{u_4, u_1} C] {D : Type u_2} [CategoryTheory.Category.{u_5, u_2} D] (G : CategoryTheory.Functor C D) (U : D) : CategoryTheory.Sieve U

For a functor G : C ⥤ D, and an object U : D, Sieve.coverByImage G U is the sieve of U consisting of those arrows that factor through images of G.

Equations

• CategoryTheory.Sieve.coverByImage G U = { arrows := CategoryTheory.Presieve.coverByImage G U, downward_closed := ⋯ }

theorem CategoryTheory.Presieve.in_coverByImage {C : Type u_1} [CategoryTheory.Category.{u_4, u_1} C] {D : Type u_2} [CategoryTheory.Category.{u_5, u_2} D] (G : CategoryTheory.Functor C D) {X : D} {Y : C} (f : G.obj Y ⟶ X) : CategoryTheory.Presieve.coverByImage G X f

class CategoryTheory.Functor.IsCoverDense {C : Type u_1} [CategoryTheory.Category.{u_4, u_1} C] {D : Type u_2} [CategoryTheory.Category.{u_5, u_2} D] (G : CategoryTheory.Functor C D) (K : CategoryTheory.GrothendieckTopology D) : Prop

A functor G : (C, J) ⥤ (D, K) is cover dense if for each object in D, there exists a covering sieve in D that factors through images of G.

This definition can be found in https://ncatlab.org/nlab/show/dense+sub-site Definition 2.2.

• is_cover : ∀ (U : D), CategoryTheory.Sieve.coverByImage G U ∈ K.sieves U

theorem CategoryTheory.Functor.is_cover_of_isCoverDense {C : Type u_1} [CategoryTheory.Category.{u_4, u_1} C] {D : Type u_2} [CategoryTheory.Category.{u_5, u_2} D] (G : CategoryTheory.Functor C D) (K : CategoryTheory.GrothendieckTopology D) [CategoryTheory.Functor.IsCoverDense G K] (U : D) : CategoryTheory.Sieve.coverByImage G U ∈ K.sieves U

theorem CategoryTheory.Functor.isCoverDense_of_generate_singleton_functor_π_mem {C : Type u_1} [CategoryTheory.Category.{u_4, u_1} C] {D : Type u_2} [CategoryTheory.Category.{u_5, u_2} D] (G : CategoryTheory.Functor C D) (K : CategoryTheory.GrothendieckTopology D) (h : ∀ (B : D), ∃ (X : C) (f : G.obj X ⟶ B), CategoryTheory.Sieve.generate (CategoryTheory.Presieve.singleton f) ∈ K.sieves B) : CategoryTheory.Functor.IsCoverDense G K

theorem CategoryTheory.Functor.IsCoverDense.ext {C : Type u_1} [CategoryTheory.Category.{u_7, u_1} C] {D : Type u_2} [CategoryTheory.Category.{u_6, u_2} D] {K : CategoryTheory.GrothendieckTopology D} (G : CategoryTheory.Functor C D) [CategoryTheory.Functor.IsCoverDense G K] (ℱ : CategoryTheory.SheafOfTypes K) (X : D) {s : ℱ.val.obj (Opposite.op X)} {t : ℱ.val.obj (Opposite.op X)} (h : ∀ ⦃Y : C⦄ (f : G.obj Y ⟶ X), ℱ.val.map f.op s = ℱ.val.map f.op t) : s = t

theorem CategoryTheory.Functor.IsCoverDense.functorPullback_pushforward_covering {C : Type u_1} [CategoryTheory.Category.{u_5, u_1} C] {D : Type u_2} [CategoryTheory.Category.{u_6, u_2} D] {K : CategoryTheory.GrothendieckTopology D} {G : CategoryTheory.Functor C D} [CategoryTheory.Functor.IsCoverDense G K] [CategoryTheory.Functor.Full G] {X : C} (T : ↑(K.sieves (G.obj X))) : CategoryTheory.Sieve.functorPushforward G (CategoryTheory.Sieve.functorPullback G ↑T) ∈ K.sieves (G.obj X)

@[simp]

theorem CategoryTheory.Functor.IsCoverDense.homOver_app {C : Type u_1} [CategoryTheory.Category.{u_5, u_1} C] {D : Type u_2} [CategoryTheory.Category.{u_6, u_2} D] {K : CategoryTheory.GrothendieckTopology D} {A : Type u_4} [CategoryTheory.Category.{u_7, u_4} A] {G : CategoryTheory.Functor C D} {ℱ : CategoryTheory.Functor Dᵒᵖ A} {ℱ' : CategoryTheory.Sheaf K A} (α : CategoryTheory.Functor.comp G.op ℱ ⟶ CategoryTheory.Functor.comp G.op ℱ'.val) (X : A) (X : Cᵒᵖ) : ∀ (a : (CategoryTheory.coyoneda.obj (Opposite.op X✝)).obj ((CategoryTheory.Functor.comp G.op ℱ).obj X)), (CategoryTheory.Functor.IsCoverDense.homOver α X✝).app X a = CategoryTheory.CategoryStruct.comp a (α.app X)

def CategoryTheory.Functor.IsCoverDense.homOver {C : Type u_1} [CategoryTheory.Category.{u_5, u_1} C] {D : Type u_2} [CategoryTheory.Category.{u_6, u_2} D] {K : CategoryTheory.GrothendieckTopology D} {A : Type u_4} [CategoryTheory.Category.{u_7, u_4} A] {G : CategoryTheory.Functor C D} {ℱ : CategoryTheory.Functor Dᵒᵖ A} {ℱ' : CategoryTheory.Sheaf K A} (α : CategoryTheory.Functor.comp G.op ℱ ⟶ CategoryTheory.Functor.comp G.op ℱ'.val) (X : A) : CategoryTheory.Functor.comp G.op (CategoryTheory.Functor.comp ℱ (CategoryTheory.coyoneda.obj (Opposite.op X))) ⟶ CategoryTheory.Functor.comp G.op (CategoryTheory.sheafOver ℱ' X).val

(Implementation). Given a hom between the pullbacks of two sheaves, we can whisker it with coyoneda to obtain a hom between the pullbacks of the sheaves of maps from X.

Equations

• CategoryTheory.Functor.IsCoverDense.homOver α X = CategoryTheory.whiskerRight α (CategoryTheory.coyoneda.obj (Opposite.op X))

@[simp]

theorem CategoryTheory.Functor.IsCoverDense.isoOver_hom_app {C : Type u_1} [CategoryTheory.Category.{u_5, u_1} C] {D : Type u_2} [CategoryTheory.Category.{u_6, u_2} D] {K : CategoryTheory.GrothendieckTopology D} {A : Type u_4} [CategoryTheory.Category.{u_7, u_4} A] {G : CategoryTheory.Functor C D} {ℱ : CategoryTheory.Sheaf K A} {ℱ' : CategoryTheory.Sheaf K A} (α : CategoryTheory.Functor.comp G.op ℱ.val ≅ CategoryTheory.Functor.comp G.op ℱ'.val) (X : A) (X : Cᵒᵖ) : ∀ (a : (CategoryTheory.coyoneda.obj (Opposite.op X✝)).obj ((CategoryTheory.Functor.comp G.op ℱ.val).obj X)), (CategoryTheory.Functor.IsCoverDense.isoOver α X✝).hom.app X a = CategoryTheory.CategoryStruct.comp a (α.hom.app X)

@[simp]

theorem CategoryTheory.Functor.IsCoverDense.isoOver_inv_app {C : Type u_1} [CategoryTheory.Category.{u_5, u_1} C] {D : Type u_2} [CategoryTheory.Category.{u_6, u_2} D] {K : CategoryTheory.GrothendieckTopology D} {A : Type u_4} [CategoryTheory.Category.{u_7, u_4} A] {G : CategoryTheory.Functor C D} {ℱ : CategoryTheory.Sheaf K A} {ℱ' : CategoryTheory.Sheaf K A} (α : CategoryTheory.Functor.comp G.op ℱ.val ≅ CategoryTheory.Functor.comp G.op ℱ'.val) (X : A) (X : Cᵒᵖ) : ∀ (a : (CategoryTheory.coyoneda.obj (Opposite.op X✝)).obj ((CategoryTheory.Functor.comp G.op ℱ'.val).obj X)), (CategoryTheory.Functor.IsCoverDense.isoOver α X✝).inv.app X a = CategoryTheory.CategoryStruct.comp a (α.inv.app X)

def CategoryTheory.Functor.IsCoverDense.isoOver {C : Type u_1} [CategoryTheory.Category.{u_5, u_1} C] {D : Type u_2} [CategoryTheory.Category.{u_6, u_2} D] {K : CategoryTheory.GrothendieckTopology D} {A : Type u_4} [CategoryTheory.Category.{u_7, u_4} A] {G : CategoryTheory.Functor C D} {ℱ : CategoryTheory.Sheaf K A} {ℱ' : CategoryTheory.Sheaf K A} (α : CategoryTheory.Functor.comp G.op ℱ.val ≅ CategoryTheory.Functor.comp G.op ℱ'.val) (X : A) : CategoryTheory.Functor.comp G.op (CategoryTheory.sheafOver ℱ X).val ≅ CategoryTheory.Functor.comp G.op (CategoryTheory.sheafOver ℱ' X).val

(Implementation). Given an iso between the pullbacks of two sheaves, we can whisker it with coyoneda to obtain an iso between the pullbacks of the sheaves of maps from X.

Equations

• CategoryTheory.Functor.IsCoverDense.isoOver α X = CategoryTheory.isoWhiskerRight α (CategoryTheory.coyoneda.obj (Opposite.op X))

theorem CategoryTheory.Functor.IsCoverDense.sheaf_eq_amalgamation {D : Type u_2} [CategoryTheory.Category.{u_5, u_2} D] {K : CategoryTheory.GrothendieckTopology D} {A : Type u_4} [CategoryTheory.Category.{u_6, u_4} A] (ℱ : CategoryTheory.Sheaf K A) {X : A} {U : D} {T : CategoryTheory.Sieve U} (hT : T ∈ K.sieves U) (x : CategoryTheory.Presieve.FamilyOfElements (CategoryTheory.Functor.comp ℱ.val (CategoryTheory.coyoneda.obj (Opposite.op X))) T.arrows) (hx : CategoryTheory.Presieve.FamilyOfElements.Compatible x) (t : (CategoryTheory.Functor.comp ℱ.val (CategoryTheory.coyoneda.obj (Opposite.op X))).obj (Opposite.op U)) (h : CategoryTheory.Presieve.FamilyOfElements.IsAmalgamation x t) : t = CategoryTheory.Presieve.IsSheafFor.amalgamate ⋯ x hx

noncomputable def CategoryTheory.Functor.IsCoverDense.Types.pushforwardFamily {C : Type u_1} [CategoryTheory.Category.{u_5, u_1} C] {D : Type u_2} [CategoryTheory.Category.{u_6, u_2} D] {K : CategoryTheory.GrothendieckTopology D} {G : CategoryTheory.Functor C D} {ℱ : CategoryTheory.Functor Dᵒᵖ (Type v)} {ℱ' : CategoryTheory.SheafOfTypes K} (α : CategoryTheory.Functor.comp G.op ℱ ⟶ CategoryTheory.Functor.comp G.op ℱ'.val) {X : D} (x : ℱ.obj (Opposite.op X)) : CategoryTheory.Presieve.FamilyOfElements ℱ'.val (CategoryTheory.Presieve.coverByImage G X)

(Implementation). Given a section of ℱ on X, we can obtain a family of elements valued in ℱ' that is defined on a cover generated by the images of G.

Equations

• CategoryTheory.Functor.IsCoverDense.Types.pushforwardFamily α x✝¹ x hf = ℱ'.val.map (Nonempty.some hf).lift.op (α.app (Opposite.op (Nonempty.some hf).1) (ℱ.map (Nonempty.some hf).map.op x✝¹))

@[simp]

theorem CategoryTheory.Functor.IsCoverDense.Types.pushforwardFamily_def {C : Type u_1} [CategoryTheory.Category.{u_6, u_1} C] {D : Type u_2} [CategoryTheory.Category.{u_5, u_2} D] {K : CategoryTheory.GrothendieckTopology D} {G : CategoryTheory.Functor C D} {ℱ : CategoryTheory.Functor Dᵒᵖ (Type v)} {ℱ' : CategoryTheory.SheafOfTypes K} (α : CategoryTheory.Functor.comp G.op ℱ ⟶ CategoryTheory.Functor.comp G.op ℱ'.val) {X : D} (x : ℱ.obj (Opposite.op X)) : CategoryTheory.Functor.IsCoverDense.Types.pushforwardFamily α x = fun (x_1 : D) (x_2 : x_1 ⟶ X) (hf : CategoryTheory.Presieve.coverByImage G X x_2) => ℱ'.val.map (Nonempty.some hf).lift.op (α.app (Opposite.op (Nonempty.some hf).1) (ℱ.map (Nonempty.some hf).map.op x))

theorem CategoryTheory.Functor.IsCoverDense.Types.pushforwardFamily_compatible {C : Type u_1} [CategoryTheory.Category.{u_6, u_1} C] {D : Type u_2} [CategoryTheory.Category.{u_5, u_2} D] {K : CategoryTheory.GrothendieckTopology D} {G : CategoryTheory.Functor C D} [CategoryTheory.Functor.IsCoverDense G K] [CategoryTheory.Functor.Full G] {ℱ : CategoryTheory.Functor Dᵒᵖ (Type v)} {ℱ' : CategoryTheory.SheafOfTypes K} (α : CategoryTheory.Functor.comp G.op ℱ ⟶ CategoryTheory.Functor.comp G.op ℱ'.val) {X : D} (x : ℱ.obj (Opposite.op X)) : CategoryTheory.Presieve.FamilyOfElements.Compatible (CategoryTheory.Functor.IsCoverDense.Types.pushforwardFamily α x)

(Implementation). The pushforwardFamily defined is compatible.

noncomputable def CategoryTheory.Functor.IsCoverDense.Types.appHom {C : Type u_1} [CategoryTheory.Category.{u_5, u_1} C] {D : Type u_2} [CategoryTheory.Category.{u_6, u_2} D] {K : CategoryTheory.GrothendieckTopology D} {G : CategoryTheory.Functor C D} [CategoryTheory.Functor.IsCoverDense G K] [CategoryTheory.Functor.Full G] {ℱ : CategoryTheory.Functor Dᵒᵖ (Type v)} {ℱ' : CategoryTheory.SheafOfTypes K} (α : CategoryTheory.Functor.comp G.op ℱ ⟶ CategoryTheory.Functor.comp G.op ℱ'.val) (X : D) : ℱ.obj (Opposite.op X) ⟶ ℱ'.val.obj (Opposite.op X)

(Implementation). The morphism ℱ(X) ⟶ ℱ'(X) given by gluing the pushforwardFamily.

Equations

• CategoryTheory.Functor.IsCoverDense.Types.appHom α X x = CategoryTheory.Presieve.IsSheafFor.amalgamate ⋯ (CategoryTheory.Functor.IsCoverDense.Types.pushforwardFamily α x) ⋯

@[simp]

theorem CategoryTheory.Functor.IsCoverDense.Types.pushforwardFamily_apply {C : Type u_1} [CategoryTheory.Category.{u_6, u_1} C] {D : Type u_2} [CategoryTheory.Category.{u_5, u_2} D] {K : CategoryTheory.GrothendieckTopology D} {G : CategoryTheory.Functor C D} [CategoryTheory.Functor.Full G] {ℱ : CategoryTheory.Functor Dᵒᵖ (Type v)} {ℱ' : CategoryTheory.SheafOfTypes K} (α : CategoryTheory.Functor.comp G.op ℱ ⟶ CategoryTheory.Functor.comp G.op ℱ'.val) {X : D} (x : ℱ.obj (Opposite.op X)) {Y : C} (f : G.obj Y ⟶ X) : CategoryTheory.Functor.IsCoverDense.Types.pushforwardFamily α x f ⋯ = α.app (Opposite.op Y) (ℱ.map f.op x)

@[simp]

theorem CategoryTheory.Functor.IsCoverDense.Types.appHom_restrict {C : Type u_1} [CategoryTheory.Category.{u_6, u_1} C] {D : Type u_2} [CategoryTheory.Category.{u_5, u_2} D] {K : CategoryTheory.GrothendieckTopology D} {G : CategoryTheory.Functor C D} [CategoryTheory.Functor.IsCoverDense G K] [CategoryTheory.Functor.Full G] {ℱ : CategoryTheory.Functor Dᵒᵖ (Type v)} {ℱ' : CategoryTheory.SheafOfTypes K} (α : CategoryTheory.Functor.comp G.op ℱ ⟶ CategoryTheory.Functor.comp G.op ℱ'.val) {X : D} {Y : C} (f : Opposite.op X ⟶ Opposite.op (G.obj Y)) (x : ℱ.obj (Opposite.op X)) : ℱ'.val.map f (CategoryTheory.Functor.IsCoverDense.Types.appHom α X x) = α.app (Opposite.op Y) (ℱ.map f x)

@[simp]

theorem CategoryTheory.Functor.IsCoverDense.Types.appHom_valid_glue {C : Type u_1} [CategoryTheory.Category.{u_6, u_1} C] {D : Type u_2} [CategoryTheory.Category.{u_5, u_2} D] {K : CategoryTheory.GrothendieckTopology D} {G : CategoryTheory.Functor C D} [CategoryTheory.Functor.IsCoverDense G K] [CategoryTheory.Functor.Full G] {ℱ : CategoryTheory.Functor Dᵒᵖ (Type v)} {ℱ' : CategoryTheory.SheafOfTypes K} (α : CategoryTheory.Functor.comp G.op ℱ ⟶ CategoryTheory.Functor.comp G.op ℱ'.val) {X : D} {Y : C} (f : Opposite.op X ⟶ Opposite.op (G.obj Y)) : CategoryTheory.CategoryStruct.comp (CategoryTheory.Functor.IsCoverDense.Types.appHom α X) (ℱ'.val.map f) = CategoryTheory.CategoryStruct.comp (ℱ.map f) (α.app (Opposite.op Y))

@[simp]

theorem CategoryTheory.Functor.IsCoverDense.Types.appIso_hom {C : Type u_1} [CategoryTheory.Category.{u_5, u_1} C] {D : Type u_2} [CategoryTheory.Category.{u_6, u_2} D] {K : CategoryTheory.GrothendieckTopology D} {G : CategoryTheory.Functor C D} [CategoryTheory.Functor.IsCoverDense G K] [CategoryTheory.Functor.Full G] {ℱ : CategoryTheory.SheafOfTypes K} {ℱ' : CategoryTheory.SheafOfTypes K} (i : CategoryTheory.Functor.comp G.op ℱ.val ≅ CategoryTheory.Functor.comp G.op ℱ'.val) (X : D) : ∀ (a : ℱ.val.obj (Opposite.op X)), (CategoryTheory.Functor.IsCoverDense.Types.appIso i X).hom a = CategoryTheory.Functor.IsCoverDense.Types.appHom i.hom X a

@[simp]

theorem CategoryTheory.Functor.IsCoverDense.Types.appIso_inv {C : Type u_1} [CategoryTheory.Category.{u_5, u_1} C] {D : Type u_2} [CategoryTheory.Category.{u_6, u_2} D] {K : CategoryTheory.GrothendieckTopology D} {G : CategoryTheory.Functor C D} [CategoryTheory.Functor.IsCoverDense G K] [CategoryTheory.Functor.Full G] {ℱ : CategoryTheory.SheafOfTypes K} {ℱ' : CategoryTheory.SheafOfTypes K} (i : CategoryTheory.Functor.comp G.op ℱ.val ≅ CategoryTheory.Functor.comp G.op ℱ'.val) (X : D) : ∀ (a : ℱ'.val.obj (Opposite.op X)), (CategoryTheory.Functor.IsCoverDense.Types.appIso i X).inv a = CategoryTheory.Functor.IsCoverDense.Types.appHom i.inv X a

noncomputable def CategoryTheory.Functor.IsCoverDense.Types.appIso {C : Type u_1} [CategoryTheory.Category.{u_5, u_1} C] {D : Type u_2} [CategoryTheory.Category.{u_6, u_2} D] {K : CategoryTheory.GrothendieckTopology D} {G : CategoryTheory.Functor C D} [CategoryTheory.Functor.IsCoverDense G K] [CategoryTheory.Functor.Full G] {ℱ : CategoryTheory.SheafOfTypes K} {ℱ' : CategoryTheory.SheafOfTypes K} (i : CategoryTheory.Functor.comp G.op ℱ.val ≅ CategoryTheory.Functor.comp G.op ℱ'.val) (X : D) : ℱ.val.obj (Opposite.op X) ≅ ℱ'.val.obj (Opposite.op X)

(Implementation). The maps given in appIso is inverse to each other and gives a ℱ(X) ≅ ℱ'(X).

Equations

• One or more equations did not get rendered due to their size.

@[simp]

theorem CategoryTheory.Functor.IsCoverDense.Types.presheafHom_app {C : Type u_1} [CategoryTheory.Category.{u_5, u_1} C] {D : Type u_2} [CategoryTheory.Category.{u_6, u_2} D] {K : CategoryTheory.GrothendieckTopology D} {G : CategoryTheory.Functor C D} [CategoryTheory.Functor.IsCoverDense G K] [CategoryTheory.Functor.Full G] {ℱ : CategoryTheory.Functor Dᵒᵖ (Type v)} {ℱ' : CategoryTheory.SheafOfTypes K} (α : CategoryTheory.Functor.comp G.op ℱ ⟶ CategoryTheory.Functor.comp G.op ℱ'.val) (X : Dᵒᵖ) : ∀ (a : ℱ.obj (Opposite.op X.unop)), (CategoryTheory.Functor.IsCoverDense.Types.presheafHom α).app X a = CategoryTheory.Functor.IsCoverDense.Types.appHom α X.unop a

noncomputable def CategoryTheory.Functor.IsCoverDense.Types.presheafHom {C : Type u_1} [CategoryTheory.Category.{u_5, u_1} C] {D : Type u_2} [CategoryTheory.Category.{u_6, u_2} D] {K : CategoryTheory.GrothendieckTopology D} {G : CategoryTheory.Functor C D} [CategoryTheory.Functor.IsCoverDense G K] [CategoryTheory.Functor.Full G] {ℱ : CategoryTheory.Functor Dᵒᵖ (Type v)} {ℱ' : CategoryTheory.SheafOfTypes K} (α : CategoryTheory.Functor.comp G.op ℱ ⟶ CategoryTheory.Functor.comp G.op ℱ'.val) : ℱ ⟶ ℱ'.val

Given a natural transformation G ⋙ ℱ ⟶ G ⋙ ℱ' between presheaves of types, where G is full and cover-dense, and ℱ' is a sheaf, we may obtain a natural transformation between sheaves.

Equations

• CategoryTheory.Functor.IsCoverDense.Types.presheafHom α = { app := fun (X : Dᵒᵖ) => CategoryTheory.Functor.IsCoverDense.Types.appHom α X.unop, naturality := ⋯ }

@[simp]

theorem CategoryTheory.Functor.IsCoverDense.Types.presheafIso_inv_app {C : Type u_1} [CategoryTheory.Category.{u_5, u_1} C] {D : Type u_2} [CategoryTheory.Category.{u_6, u_2} D] {K : CategoryTheory.GrothendieckTopology D} {G : CategoryTheory.Functor C D} [CategoryTheory.Functor.IsCoverDense G K] [CategoryTheory.Functor.Full G] {ℱ : CategoryTheory.SheafOfTypes K} {ℱ' : CategoryTheory.SheafOfTypes K} (i : CategoryTheory.Functor.comp G.op ℱ.val ≅ CategoryTheory.Functor.comp G.op ℱ'.val) (X : Dᵒᵖ) : ∀ (a : ℱ'.val.obj X), (CategoryTheory.Functor.IsCoverDense.Types.presheafIso i).inv.app X a = CategoryTheory.Functor.IsCoverDense.Types.appHom i.inv X.unop a

@[simp]

theorem CategoryTheory.Functor.IsCoverDense.Types.presheafIso_hom_app {C : Type u_1} [CategoryTheory.Category.{u_5, u_1} C] {D : Type u_2} [CategoryTheory.Category.{u_6, u_2} D] {K : CategoryTheory.GrothendieckTopology D} {G : CategoryTheory.Functor C D} [CategoryTheory.Functor.IsCoverDense G K] [CategoryTheory.Functor.Full G] {ℱ : CategoryTheory.SheafOfTypes K} {ℱ' : CategoryTheory.SheafOfTypes K} (i : CategoryTheory.Functor.comp G.op ℱ.val ≅ CategoryTheory.Functor.comp G.op ℱ'.val) (X : Dᵒᵖ) : ∀ (a : ℱ.val.obj X), (CategoryTheory.Functor.IsCoverDense.Types.presheafIso i).hom.app X a = CategoryTheory.Functor.IsCoverDense.Types.appHom i.hom X.unop a

noncomputable def CategoryTheory.Functor.IsCoverDense.Types.presheafIso {C : Type u_1} [CategoryTheory.Category.{u_5, u_1} C] {D : Type u_2} [CategoryTheory.Category.{u_6, u_2} D] {K : CategoryTheory.GrothendieckTopology D} {G : CategoryTheory.Functor C D} [CategoryTheory.Functor.IsCoverDense G K] [CategoryTheory.Functor.Full G] {ℱ : CategoryTheory.SheafOfTypes K} {ℱ' : CategoryTheory.SheafOfTypes K} (i : CategoryTheory.Functor.comp G.op ℱ.val ≅ CategoryTheory.Functor.comp G.op ℱ'.val) : ℱ.val ≅ ℱ'.val

Given a natural isomorphism G ⋙ ℱ ≅ G ⋙ ℱ' between presheaves of types, where G is full and cover-dense, and ℱ, ℱ' are sheaves, we may obtain a natural isomorphism between presheaves.

Equations

• CategoryTheory.Functor.IsCoverDense.Types.presheafIso i = CategoryTheory.NatIso.ofComponents (fun (X : Dᵒᵖ) => CategoryTheory.Functor.IsCoverDense.Types.appIso i X.unop) ⋯

@[simp]

theorem CategoryTheory.Functor.IsCoverDense.Types.sheafIso_hom_val {C : Type u_1} [CategoryTheory.Category.{u_5, u_1} C] {D : Type u_2} [CategoryTheory.Category.{u_6, u_2} D] {K : CategoryTheory.GrothendieckTopology D} {G : CategoryTheory.Functor C D} [CategoryTheory.Functor.IsCoverDense G K] [CategoryTheory.Functor.Full G] {ℱ : CategoryTheory.SheafOfTypes K} {ℱ' : CategoryTheory.SheafOfTypes K} (i : CategoryTheory.Functor.comp G.op ℱ.val ≅ CategoryTheory.Functor.comp G.op ℱ'.val) : (CategoryTheory.Functor.IsCoverDense.Types.sheafIso i).hom.val = (CategoryTheory.Functor.IsCoverDense.Types.presheafIso i).hom

@[simp]

theorem CategoryTheory.Functor.IsCoverDense.Types.sheafIso_inv_val {C : Type u_1} [CategoryTheory.Category.{u_5, u_1} C] {D : Type u_2} [CategoryTheory.Category.{u_6, u_2} D] {K : CategoryTheory.GrothendieckTopology D} {G : CategoryTheory.Functor C D} [CategoryTheory.Functor.IsCoverDense G K] [CategoryTheory.Functor.Full G] {ℱ : CategoryTheory.SheafOfTypes K} {ℱ' : CategoryTheory.SheafOfTypes K} (i : CategoryTheory.Functor.comp G.op ℱ.val ≅ CategoryTheory.Functor.comp G.op ℱ'.val) : (CategoryTheory.Functor.IsCoverDense.Types.sheafIso i).inv.val = (CategoryTheory.Functor.IsCoverDense.Types.presheafIso i).inv

noncomputable def CategoryTheory.Functor.IsCoverDense.Types.sheafIso {C : Type u_1} [CategoryTheory.Category.{u_5, u_1} C] {D : Type u_2} [CategoryTheory.Category.{u_6, u_2} D] {K : CategoryTheory.GrothendieckTopology D} {G : CategoryTheory.Functor C D} [CategoryTheory.Functor.IsCoverDense G K] [CategoryTheory.Functor.Full G] {ℱ : CategoryTheory.SheafOfTypes K} {ℱ' : CategoryTheory.SheafOfTypes K} (i : CategoryTheory.Functor.comp G.op ℱ.val ≅ CategoryTheory.Functor.comp G.op ℱ'.val) : ℱ ≅ ℱ'

Given a natural isomorphism G ⋙ ℱ ≅ G ⋙ ℱ' between presheaves of types, where G is full and cover-dense, and ℱ, ℱ' are sheaves, we may obtain a natural isomorphism between sheaves.

Equations

• One or more equations did not get rendered due to their size.

@[simp]

theorem CategoryTheory.Functor.IsCoverDense.sheafCoyonedaHom_app {C : Type u_1} [CategoryTheory.Category.{u_5, u_1} C] {D : Type u_2} [CategoryTheory.Category.{u_6, u_2} D] {K : CategoryTheory.GrothendieckTopology D} {A : Type u_4} [CategoryTheory.Category.{u_7, u_4} A] {G : CategoryTheory.Functor C D} [CategoryTheory.Functor.IsCoverDense G K] [CategoryTheory.Functor.Full G] {ℱ : CategoryTheory.Functor Dᵒᵖ A} {ℱ' : CategoryTheory.Sheaf K A} (α : CategoryTheory.Functor.comp G.op ℱ ⟶ CategoryTheory.Functor.comp G.op ℱ'.val) (X : Aᵒᵖ) : (CategoryTheory.Functor.IsCoverDense.sheafCoyonedaHom α).app X = CategoryTheory.Functor.IsCoverDense.Types.presheafHom (CategoryTheory.Functor.IsCoverDense.homOver α X.unop)

noncomputable def CategoryTheory.Functor.IsCoverDense.sheafCoyonedaHom {C : Type u_1} [CategoryTheory.Category.{u_5, u_1} C] {D : Type u_2} [CategoryTheory.Category.{u_6, u_2} D] {K : CategoryTheory.GrothendieckTopology D} {A : Type u_4} [CategoryTheory.Category.{u_7, u_4} A] {G : CategoryTheory.Functor C D} [CategoryTheory.Functor.IsCoverDense G K] [CategoryTheory.Functor.Full G] {ℱ : CategoryTheory.Functor Dᵒᵖ A} {ℱ' : CategoryTheory.Sheaf K A} (α : CategoryTheory.Functor.comp G.op ℱ ⟶ CategoryTheory.Functor.comp G.op ℱ'.val) : CategoryTheory.Functor.comp CategoryTheory.coyoneda ((CategoryTheory.whiskeringLeft Dᵒᵖ A (Type u_7)).obj ℱ) ⟶ CategoryTheory.Functor.comp CategoryTheory.coyoneda ((CategoryTheory.whiskeringLeft Dᵒᵖ A (Type u_7)).obj ℱ'.val)

(Implementation). The sheaf map given in types.sheaf_hom is natural in terms of X.

Equations

• One or more equations did not get rendered due to their size.

noncomputable def CategoryTheory.Functor.IsCoverDense.sheafYonedaHom {C : Type u_1} [CategoryTheory.Category.{u_5, u_1} C] {D : Type u_2} [CategoryTheory.Category.{u_6, u_2} D] {K : CategoryTheory.GrothendieckTopology D} {A : Type u_4} [CategoryTheory.Category.{u_7, u_4} A] {G : CategoryTheory.Functor C D} [CategoryTheory.Functor.IsCoverDense G K] [CategoryTheory.Functor.Full G] {ℱ : CategoryTheory.Functor Dᵒᵖ A} {ℱ' : CategoryTheory.Sheaf K A} (α : CategoryTheory.Functor.comp G.op ℱ ⟶ CategoryTheory.Functor.comp G.op ℱ'.val) : CategoryTheory.Functor.comp ℱ CategoryTheory.yoneda ⟶ CategoryTheory.Functor.comp ℱ'.val CategoryTheory.yoneda

(Implementation). sheafCoyonedaHom but the order of the arguments of the functor are swapped.

Equations

• One or more equations did not get rendered due to their size.

noncomputable def CategoryTheory.Functor.IsCoverDense.sheafHom {C : Type u_1} [CategoryTheory.Category.{u_5, u_1} C] {D : Type u_2} [CategoryTheory.Category.{u_6, u_2} D] {K : CategoryTheory.GrothendieckTopology D} {A : Type u_4} [CategoryTheory.Category.{u_7, u_4} A] {G : CategoryTheory.Functor C D} [CategoryTheory.Functor.IsCoverDense G K] [CategoryTheory.Functor.Full G] {ℱ : CategoryTheory.Functor Dᵒᵖ A} {ℱ' : CategoryTheory.Sheaf K A} (α : CategoryTheory.Functor.comp G.op ℱ ⟶ CategoryTheory.Functor.comp G.op ℱ'.val) : ℱ ⟶ ℱ'.val

Given a natural transformation G ⋙ ℱ ⟶ G ⋙ ℱ' between presheaves of arbitrary category, where G is full and cover-dense, and ℱ' is a sheaf, we may obtain a natural transformation between presheaves.

Equations

• One or more equations did not get rendered due to their size.

@[simp]

theorem CategoryTheory.Functor.IsCoverDense.presheafIso_hom_app {C : Type u_1} [CategoryTheory.Category.{u_5, u_1} C] {D : Type u_2} [CategoryTheory.Category.{u_6, u_2} D] {K : CategoryTheory.GrothendieckTopology D} {A : Type u_4} [CategoryTheory.Category.{u_7, u_4} A] {G : CategoryTheory.Functor C D} [CategoryTheory.Functor.IsCoverDense G K] [CategoryTheory.Functor.Full G] {ℱ : CategoryTheory.Sheaf K A} {ℱ' : CategoryTheory.Sheaf K A} (i : CategoryTheory.Functor.comp G.op ℱ.val ≅ CategoryTheory.Functor.comp G.op ℱ'.val) (X : Dᵒᵖ) : (CategoryTheory.Functor.IsCoverDense.presheafIso i).hom.app X = CategoryTheory.yoneda.preimage ((CategoryTheory.Functor.IsCoverDense.sheafYonedaHom i.hom).app X)

@[simp]

theorem CategoryTheory.Functor.IsCoverDense.presheafIso_inv {C : Type u_1} [CategoryTheory.Category.{u_5, u_1} C] {D : Type u_2} [CategoryTheory.Category.{u_6, u_2} D] {K : CategoryTheory.GrothendieckTopology D} {A : Type u_4} [CategoryTheory.Category.{u_7, u_4} A] {G : CategoryTheory.Functor C D} [CategoryTheory.Functor.IsCoverDense G K] [CategoryTheory.Functor.Full G] {ℱ : CategoryTheory.Sheaf K A} {ℱ' : CategoryTheory.Sheaf K A} (i : CategoryTheory.Functor.comp G.op ℱ.val ≅ CategoryTheory.Functor.comp G.op ℱ'.val) : (CategoryTheory.Functor.IsCoverDense.presheafIso i).inv = CategoryTheory.inv (CategoryTheory.Functor.IsCoverDense.sheafHom i.hom)

noncomputable def CategoryTheory.Functor.IsCoverDense.presheafIso {C : Type u_1} [CategoryTheory.Category.{u_5, u_1} C] {D : Type u_2} [CategoryTheory.Category.{u_6, u_2} D] {K : CategoryTheory.GrothendieckTopology D} {A : Type u_4} [CategoryTheory.Category.{u_7, u_4} A] {G : CategoryTheory.Functor C D} [CategoryTheory.Functor.IsCoverDense G K] [CategoryTheory.Functor.Full G] {ℱ : CategoryTheory.Sheaf K A} {ℱ' : CategoryTheory.Sheaf K A} (i : CategoryTheory.Functor.comp G.op ℱ.val ≅ CategoryTheory.Functor.comp G.op ℱ'.val) : ℱ.val ≅ ℱ'.val

Given a natural isomorphism G ⋙ ℱ ≅ G ⋙ ℱ' between presheaves of arbitrary category, where G is full and cover-dense, and ℱ', ℱ are sheaves, we may obtain a natural isomorphism between presheaves.

Equations

• CategoryTheory.Functor.IsCoverDense.presheafIso i = let_fun this := ⋯; CategoryTheory.asIso (CategoryTheory.Functor.IsCoverDense.sheafHom i.hom)

@[simp]

theorem CategoryTheory.Functor.IsCoverDense.sheafIso_inv_val {C : Type u_1} [CategoryTheory.Category.{u_5, u_1} C] {D : Type u_2} [CategoryTheory.Category.{u_6, u_2} D] {K : CategoryTheory.GrothendieckTopology D} {A : Type u_4} [CategoryTheory.Category.{u_7, u_4} A] {G : CategoryTheory.Functor C D} [CategoryTheory.Functor.IsCoverDense G K] [CategoryTheory.Functor.Full G] {ℱ : CategoryTheory.Sheaf K A} {ℱ' : CategoryTheory.Sheaf K A} (i : CategoryTheory.Functor.comp G.op ℱ.val ≅ CategoryTheory.Functor.comp G.op ℱ'.val) : (CategoryTheory.Functor.IsCoverDense.sheafIso i).inv.val = (CategoryTheory.Functor.IsCoverDense.presheafIso i).inv

@[simp]

theorem CategoryTheory.Functor.IsCoverDense.sheafIso_hom_val {C : Type u_1} [CategoryTheory.Category.{u_5, u_1} C] {D : Type u_2} [CategoryTheory.Category.{u_6, u_2} D] {K : CategoryTheory.GrothendieckTopology D} {A : Type u_4} [CategoryTheory.Category.{u_7, u_4} A] {G : CategoryTheory.Functor C D} [CategoryTheory.Functor.IsCoverDense G K] [CategoryTheory.Functor.Full G] {ℱ : CategoryTheory.Sheaf K A} {ℱ' : CategoryTheory.Sheaf K A} (i : CategoryTheory.Functor.comp G.op ℱ.val ≅ CategoryTheory.Functor.comp G.op ℱ'.val) : (CategoryTheory.Functor.IsCoverDense.sheafIso i).hom.val = (CategoryTheory.Functor.IsCoverDense.presheafIso i).hom

noncomputable def CategoryTheory.Functor.IsCoverDense.sheafIso {C : Type u_1} [CategoryTheory.Category.{u_5, u_1} C] {D : Type u_2} [CategoryTheory.Category.{u_6, u_2} D] {K : CategoryTheory.GrothendieckTopology D} {A : Type u_4} [CategoryTheory.Category.{u_7, u_4} A] {G : CategoryTheory.Functor C D} [CategoryTheory.Functor.IsCoverDense G K] [CategoryTheory.Functor.Full G] {ℱ : CategoryTheory.Sheaf K A} {ℱ' : CategoryTheory.Sheaf K A} (i : CategoryTheory.Functor.comp G.op ℱ.val ≅ CategoryTheory.Functor.comp G.op ℱ'.val) : ℱ ≅ ℱ'

Given a natural isomorphism G ⋙ ℱ ≅ G ⋙ ℱ' between presheaves of arbitrary category, where G is full and cover-dense, and ℱ', ℱ are sheaves, we may obtain a natural isomorphism between presheaves.

Equations

• One or more equations did not get rendered due to their size.

theorem CategoryTheory.Functor.IsCoverDense.sheafHom_restrict_eq {C : Type u_1} [CategoryTheory.Category.{u_6, u_1} C] {D : Type u_2} [CategoryTheory.Category.{u_7, u_2} D] {K : CategoryTheory.GrothendieckTopology D} {A : Type u_4} [CategoryTheory.Category.{u_5, u_4} A] {G : CategoryTheory.Functor C D} [CategoryTheory.Functor.IsCoverDense G K] [CategoryTheory.Functor.Full G] {ℱ : CategoryTheory.Functor Dᵒᵖ A} {ℱ' : CategoryTheory.Sheaf K A} (α : CategoryTheory.Functor.comp G.op ℱ ⟶ CategoryTheory.Functor.comp G.op ℱ'.val) : CategoryTheory.whiskerLeft G.op (CategoryTheory.Functor.IsCoverDense.sheafHom α) = α

The constructed sheafHom α is equal to α when restricted onto C.

theorem CategoryTheory.Functor.IsCoverDense.sheafHom_eq {C : Type u_1} [CategoryTheory.Category.{u_7, u_1} C] {D : Type u_2} [CategoryTheory.Category.{u_6, u_2} D] {K : CategoryTheory.GrothendieckTopology D} {A : Type u_4} [CategoryTheory.Category.{u_5, u_4} A] (G : CategoryTheory.Functor C D) [CategoryTheory.Functor.IsCoverDense G K] [CategoryTheory.Functor.Full G] {ℱ : CategoryTheory.Functor Dᵒᵖ A} {ℱ' : CategoryTheory.Sheaf K A} (α : ℱ ⟶ ℱ'.val) : CategoryTheory.Functor.IsCoverDense.sheafHom (CategoryTheory.whiskerLeft G.op α) = α

If the pullback map is obtained via whiskering, then the result sheaf_hom (whisker_left G.op α) is equal to α.

noncomputable def CategoryTheory.Functor.IsCoverDense.restrictHomEquivHom {C : Type u_1} [CategoryTheory.Category.{u_5, u_1} C] {D : Type u_2} [CategoryTheory.Category.{u_6, u_2} D] {K : CategoryTheory.GrothendieckTopology D} {A : Type u_4} [CategoryTheory.Category.{u_7, u_4} A] {G : CategoryTheory.Functor C D} [CategoryTheory.Functor.IsCoverDense G K] [CategoryTheory.Functor.Full G] {ℱ : CategoryTheory.Functor Dᵒᵖ A} {ℱ' : CategoryTheory.Sheaf K A} : (CategoryTheory.Functor.comp G.op ℱ ⟶ CategoryTheory.Functor.comp G.op ℱ'.val) ≃ (ℱ ⟶ ℱ'.val)

A full and cover-dense functor G induces an equivalence between morphisms into a sheaf and morphisms over the restrictions via G.

Equations

• CategoryTheory.Functor.IsCoverDense.restrictHomEquivHom = { toFun := CategoryTheory.Functor.IsCoverDense.sheafHom, invFun := CategoryTheory.whiskerLeft G.op, left_inv := ⋯, right_inv := ⋯ }

theorem CategoryTheory.Functor.IsCoverDense.iso_of_restrict_iso {C : Type u_1} [CategoryTheory.Category.{u_7, u_1} C] {D : Type u_2} [CategoryTheory.Category.{u_5, u_2} D] {K : CategoryTheory.GrothendieckTopology D} {A : Type u_4} [CategoryTheory.Category.{u_6, u_4} A] {G : CategoryTheory.Functor C D} [CategoryTheory.Functor.IsCoverDense G K] [CategoryTheory.Functor.Full G] {ℱ : CategoryTheory.Sheaf K A} {ℱ' : CategoryTheory.Sheaf K A} (α : ℱ ⟶ ℱ') (i : CategoryTheory.IsIso (CategoryTheory.whiskerLeft G.op α.val)) : CategoryTheory.IsIso α

Given a full and cover-dense functor G and a natural transformation of sheaves α : ℱ ⟶ ℱ', if the pullback of α along G is iso, then α is also iso.

theorem CategoryTheory.Functor.IsCoverDense.compatiblePreserving {C : Type u_1} [CategoryTheory.Category.{u_5, u_1} C] {D : Type u_2} [CategoryTheory.Category.{u_6, u_2} D] (K : CategoryTheory.GrothendieckTopology D) (G : CategoryTheory.Functor C D) [CategoryTheory.Functor.IsCoverDense G K] [CategoryTheory.Functor.Full G] [CategoryTheory.Functor.Faithful G] : CategoryTheory.CompatiblePreserving K G

A fully faithful cover-dense functor preserves compatible families.

theorem CategoryTheory.Functor.IsCoverDense.isContinuous {C : Type u_1} [CategoryTheory.Category.{u_5, u_1} C] {D : Type u_2} [CategoryTheory.Category.{u_6, u_2} D] (J : CategoryTheory.GrothendieckTopology C) (K : CategoryTheory.GrothendieckTopology D) (G : CategoryTheory.Functor C D) [CategoryTheory.Functor.IsCoverDense G K] [CategoryTheory.Functor.Full G] [CategoryTheory.Functor.Faithful G] (Hp : CategoryTheory.CoverPreserving J K G) : CategoryTheory.Functor.IsContinuous G J K

noncomputable instance CategoryTheory.Functor.IsCoverDense.fullSheafPushforwardContinuous {C : Type u_1} [CategoryTheory.Category.{u_5, u_1} C] {D : Type u_2} [CategoryTheory.Category.{u_6, u_2} D] (J : CategoryTheory.GrothendieckTopology C) (K : CategoryTheory.GrothendieckTopology D) {A : Type u_4} [CategoryTheory.Category.{u_7, u_4} A] (G : CategoryTheory.Functor C D) [CategoryTheory.Functor.IsCoverDense G K] [CategoryTheory.Functor.Full G] [CategoryTheory.Functor.IsContinuous G J K] : CategoryTheory.Functor.Full (CategoryTheory.Functor.sheafPushforwardContinuous G A J K)

Equations

• One or more equations did not get rendered due to their size.

instance CategoryTheory.Functor.IsCoverDense.faithful_sheafPushforwardContinuous {C : Type u_1} [CategoryTheory.Category.{u_5, u_1} C] {D : Type u_2} [CategoryTheory.Category.{u_6, u_2} D] (J : CategoryTheory.GrothendieckTopology C) (K : CategoryTheory.GrothendieckTopology D) {A : Type u_4} [CategoryTheory.Category.{u_7, u_4} A] (G : CategoryTheory.Functor C D) [CategoryTheory.Functor.IsCoverDense G K] [CategoryTheory.Functor.Full G] [CategoryTheory.Functor.IsContinuous G J K] : CategoryTheory.Functor.Faithful (CategoryTheory.Functor.sheafPushforwardContinuous G A J K)

Equations

• ⋯ = ⋯

instance CategoryTheory.Functor.IsCoverDense.instIsIsoSheafInstCategorySheafObjToQuiverToCategoryStructToPrefunctorCompSheafPushforwardCocontinuousSheafPushforwardContinuousIdAppCounitSheafAdjunctionCocontinuous {C : Type u} {D : Type u} [CategoryTheory.Category.{v, u} C] [CategoryTheory.Category.{v, u} D] (G : CategoryTheory.Functor C D) [CategoryTheory.Functor.Full G] [CategoryTheory.Functor.Faithful G] (J : CategoryTheory.GrothendieckTopology C) (K : CategoryTheory.GrothendieckTopology D) {A : Type w} [CategoryTheory.Category.{max u v, w} A] [CategoryTheory.Limits.HasLimits A] [CategoryTheory.Functor.IsContinuous G J K] [CategoryTheory.Functor.IsCocontinuous G J K] (Y : CategoryTheory.Sheaf J A) : CategoryTheory.IsIso ((CategoryTheory.Functor.sheafAdjunctionCocontinuous G A J K).counit.app Y)

Equations

• ⋯ = ⋯

@[simp]

theorem CategoryTheory.Functor.IsCoverDense.sheafEquivOfCoverPreservingCoverLifting_functor {C : Type u} {D : Type u} [CategoryTheory.Category.{v, u} C] [CategoryTheory.Category.{v, u} D] (G : CategoryTheory.Functor C D) [CategoryTheory.Functor.Full G] [CategoryTheory.Functor.Faithful G] (J : CategoryTheory.GrothendieckTopology C) (K : CategoryTheory.GrothendieckTopology D) (A : Type w) [CategoryTheory.Category.{max u v, w} A] [CategoryTheory.Limits.HasLimits A] [CategoryTheory.Functor.IsCoverDense G K] [CategoryTheory.Functor.IsContinuous G J K] [CategoryTheory.Functor.IsCocontinuous G J K] : (CategoryTheory.Functor.IsCoverDense.sheafEquivOfCoverPreservingCoverLifting G J K A).functor = CategoryTheory.Functor.sheafPushforwardCocontinuous G A J K

@[simp]

theorem CategoryTheory.Functor.IsCoverDense.sheafEquivOfCoverPreservingCoverLifting_inverse {C : Type u} {D : Type u} [CategoryTheory.Category.{v, u} C] [CategoryTheory.Category.{v, u} D] (G : CategoryTheory.Functor C D) [CategoryTheory.Functor.Full G] [CategoryTheory.Functor.Faithful G] (J : CategoryTheory.GrothendieckTopology C) (K : CategoryTheory.GrothendieckTopology D) (A : Type w) [CategoryTheory.Category.{max u v, w} A] [CategoryTheory.Limits.HasLimits A] [CategoryTheory.Functor.IsCoverDense G K] [CategoryTheory.Functor.IsContinuous G J K] [CategoryTheory.Functor.IsCocontinuous G J K] : (CategoryTheory.Functor.IsCoverDense.sheafEquivOfCoverPreservingCoverLifting G J K A).inverse = CategoryTheory.Functor.sheafPushforwardContinuous G A J K

noncomputable def CategoryTheory.Functor.IsCoverDense.sheafEquivOfCoverPreservingCoverLifting {C : Type u} {D : Type u} [CategoryTheory.Category.{v, u} C] [CategoryTheory.Category.{v, u} D] (G : CategoryTheory.Functor C D) [CategoryTheory.Functor.Full G] [CategoryTheory.Functor.Faithful G] (J : CategoryTheory.GrothendieckTopology C) (K : CategoryTheory.GrothendieckTopology D) (A : Type w) [CategoryTheory.Category.{max u v, w} A] [CategoryTheory.Limits.HasLimits A] [CategoryTheory.Functor.IsCoverDense G K] [CategoryTheory.Functor.IsContinuous G J K] [CategoryTheory.Functor.IsCocontinuous G J K] : CategoryTheory.Sheaf J A ≌ CategoryTheory.Sheaf K A

Given a functor between small sites that is cover-dense, cover-preserving, and cover-lifting, it induces an equivalence of category of sheaves valued in a complete category.

Equations

• CategoryTheory.Functor.IsCoverDense.sheafEquivOfCoverPreservingCoverLifting G J K A = (CategoryTheory.Adjunction.toEquivalence (CategoryTheory.Functor.sheafAdjunctionCocontinuous G A J K)).symm

@[inline, reducible]

noncomputable abbrev CategoryTheory.Functor.IsCoverDense.sheafEquivOfCoverPreservingCoverLiftingSheafificationCompatibility {C : Type u} {D : Type u} [CategoryTheory.Category.{v, u} C] [CategoryTheory.Category.{v, u} D] (G : CategoryTheory.Functor C D) [CategoryTheory.Functor.Full G] [CategoryTheory.Functor.Faithful G] (J : CategoryTheory.GrothendieckTopology C) (K : CategoryTheory.GrothendieckTopology D) (A : Type w) [CategoryTheory.Category.{max u v, w} A] [CategoryTheory.Limits.HasLimits A] [CategoryTheory.Functor.IsCoverDense G K] [CategoryTheory.Functor.IsContinuous G J K] [CategoryTheory.Functor.IsCocontinuous G J K] [CategoryTheory.HasWeakSheafify J A] [CategoryTheory.HasWeakSheafify K A] : CategoryTheory.Functor.comp ((CategoryTheory.whiskeringLeft Cᵒᵖ Dᵒᵖ A).obj G.op) (CategoryTheory.presheafToSheaf J A) ≅ CategoryTheory.Functor.comp (CategoryTheory.presheafToSheaf K A) (CategoryTheory.Functor.IsCoverDense.sheafEquivOfCoverPreservingCoverLifting G J K A).inverse

The natural isomorphism exhibiting the compatibility of sheafEquivOfCoverPreservingCoverLifting with sheafification.

Equations

• CategoryTheory.Functor.IsCoverDense.sheafEquivOfCoverPreservingCoverLiftingSheafificationCompatibility G J K A = CategoryTheory.Functor.pushforwardContinuousSheafificationCompatibility G A J K