The canonical topology on a category

We define the finest (largest) Grothendieck topology for which a given presheaf P is a sheaf. This is well defined since if P is a sheaf for a topology J, then it is a sheaf for any coarser (smaller) topology. Nonetheless we define the topology explicitly by specifying its sieves: A sieve S on X is covering for finestTopologySingle P iff for any f : Y ⟶ X, P satisfies the sheaf axiom for S.pullback f. Showing that this is a genuine Grothendieck topology (namely that it satisfies the transitivity axiom) forms the bulk of this file.

This generalises to a set of presheaves, giving the topology finestTopology Ps which is the finest topology for which every presheaf in Ps is a sheaf. Using Ps as the set of representable presheaves defines the canonicalTopology: the finest topology for which every representable is a sheaf.

A Grothendieck topology is called Subcanonical if it is smaller than the canonical topology, equivalently it is subcanonical iff every representable presheaf is a sheaf.

References

• https://ncatlab.org/nlab/show/canonical+topology
• https://ncatlab.org/nlab/show/subcanonical+coverage
• https://stacks.math.columbia.edu/tag/00Z9
• https://math.stackexchange.com/a/358709/

theorem CategoryTheory.Sheaf.isSheafFor_bind {C : Type u} [CategoryTheory.Category.{v, u} C] {X : C} (P : CategoryTheory.Functor Cᵒᵖ (Type v)) (U : CategoryTheory.Sieve X) (B : ⦃Y : C⦄ → ⦃f : Y ⟶ X⦄ → U.arrows f → CategoryTheory.Sieve Y) (hU : CategoryTheory.Presieve.IsSheafFor P U.arrows) (hB : ∀ ⦃Y : C⦄ ⦃f : Y ⟶ X⦄ (hf : U.arrows f), CategoryTheory.Presieve.IsSheafFor P (B hf).arrows) (hB' : ∀ ⦃Y : C⦄ ⦃f : Y ⟶ X⦄ (h : U.arrows f) ⦃Z : C⦄ (g : Z ⟶ Y), CategoryTheory.Presieve.IsSeparatedFor P (CategoryTheory.Sieve.pullback g (B h)).arrows) : CategoryTheory.Presieve.IsSheafFor P (CategoryTheory.Sieve.bind U.arrows B).arrows

To show P is a sheaf for the binding of U with B, it suffices to show that P is a sheaf for U, that P is a sheaf for each sieve in B, and that it is separated for any pullback of any sieve in B.

This is mostly an auxiliary lemma to show isSheafFor_trans. Adapted from [Elephant], Lemma C2.1.7(i) with suggestions as mentioned in https://math.stackexchange.com/a/358709/

theorem CategoryTheory.Sheaf.isSheafFor_trans {C : Type u} [CategoryTheory.Category.{v, u} C] {X : C} (P : CategoryTheory.Functor Cᵒᵖ (Type v)) (R : CategoryTheory.Sieve X) (S : CategoryTheory.Sieve X) (hR : CategoryTheory.Presieve.IsSheafFor P R.arrows) (hR' : ∀ ⦃Y : C⦄ ⦃f : Y ⟶ X⦄, S.arrows f → CategoryTheory.Presieve.IsSeparatedFor P (CategoryTheory.Sieve.pullback f R).arrows) (hS : ∀ ⦃Y : C⦄ ⦃f : Y ⟶ X⦄, R.arrows f → CategoryTheory.Presieve.IsSheafFor P (CategoryTheory.Sieve.pullback f S).arrows) : CategoryTheory.Presieve.IsSheafFor P S.arrows

Given two sieves R and S, to show that P is a sheaf for S, we can show:

• P is a sheaf for R
• P is a sheaf for the pullback of S along any arrow in R
• P is separated for the pullback of R along any arrow in S.

This is mostly an auxiliary lemma to construct finestTopology. Adapted from [Elephant], Lemma C2.1.7(ii) with suggestions as mentioned in https://math.stackexchange.com/a/358709

def CategoryTheory.Sheaf.finestTopologySingle {C : Type u} [CategoryTheory.Category.{v, u} C] (P : CategoryTheory.Functor Cᵒᵖ (Type v)) : CategoryTheory.GrothendieckTopology C

Construct the finest (largest) Grothendieck topology for which the given presheaf is a sheaf.

This is a special case of https://stacks.math.columbia.edu/tag/00Z9, but following a different proof (see the comments there).

Equations

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

def CategoryTheory.Sheaf.finestTopology {C : Type u} [CategoryTheory.Category.{v, u} C] (Ps : Set (CategoryTheory.Functor Cᵒᵖ (Type v))) : CategoryTheory.GrothendieckTopology C

Construct the finest (largest) Grothendieck topology for which all the given presheaves are sheaves.

This is equal to the construction of .

Equations

• CategoryTheory.Sheaf.finestTopology Ps = sInf (CategoryTheory.Sheaf.finestTopologySingle '' Ps)

theorem CategoryTheory.Sheaf.sheaf_for_finestTopology {C : Type u} [CategoryTheory.Category.{v, u} C] {P : CategoryTheory.Functor Cᵒᵖ (Type v)} (Ps : Set (CategoryTheory.Functor Cᵒᵖ (Type v))) (h : P ∈ Ps) : CategoryTheory.Presieve.IsSheaf (CategoryTheory.Sheaf.finestTopology Ps) P

Check that if P ∈ Ps, then P is indeed a sheaf for the finest topology on Ps.

theorem CategoryTheory.Sheaf.le_finestTopology {C : Type u} [CategoryTheory.Category.{v, u} C] (Ps : Set (CategoryTheory.Functor Cᵒᵖ (Type v))) (J : CategoryTheory.GrothendieckTopology C) (hJ : ∀ P ∈ Ps, CategoryTheory.Presieve.IsSheaf J P) : J ≤ CategoryTheory.Sheaf.finestTopology Ps

Check that if each P ∈ Ps is a sheaf for J, then J is a subtopology of finestTopology Ps.

def CategoryTheory.Sheaf.canonicalTopology (C : Type u) [CategoryTheory.Category.{v, u} C] : CategoryTheory.GrothendieckTopology C

The canonicalTopology on a category is the finest (largest) topology for which every representable presheaf is a sheaf.

See

Equations

• CategoryTheory.Sheaf.canonicalTopology C = CategoryTheory.Sheaf.finestTopology (Set.range CategoryTheory.yoneda.toPrefunctor.obj)

theorem CategoryTheory.Sheaf.isSheaf_yoneda_obj {C : Type u} [CategoryTheory.Category.{v, u} C] (X : C) : CategoryTheory.Presieve.IsSheaf (CategoryTheory.Sheaf.canonicalTopology C) (CategoryTheory.yoneda.toPrefunctor.obj X)

yoneda.obj X is a sheaf for the canonical topology.

theorem CategoryTheory.Sheaf.isSheaf_of_representable {C : Type u} [CategoryTheory.Category.{v, u} C] (P : CategoryTheory.Functor Cᵒᵖ (Type v)) [CategoryTheory.Functor.Representable P] : CategoryTheory.Presieve.IsSheaf (CategoryTheory.Sheaf.canonicalTopology C) P

A representable functor is a sheaf for the canonical topology.

def CategoryTheory.Sheaf.Subcanonical {C : Type u} [CategoryTheory.Category.{v, u} C] (J : CategoryTheory.GrothendieckTopology C) : Prop

A subcanonical topology is a topology which is smaller than the canonical topology. Equivalently, a topology is subcanonical iff every representable is a sheaf.

Equations

• CategoryTheory.Sheaf.Subcanonical J = (J ≤ CategoryTheory.Sheaf.canonicalTopology C)

theorem CategoryTheory.Sheaf.Subcanonical.of_yoneda_isSheaf {C : Type u} [CategoryTheory.Category.{v, u} C] (J : CategoryTheory.GrothendieckTopology C) (h : ∀ (X : C), CategoryTheory.Presieve.IsSheaf J (CategoryTheory.yoneda.toPrefunctor.obj X)) : CategoryTheory.Sheaf.Subcanonical J

If every functor yoneda.obj X is a J-sheaf, then J is subcanonical.

theorem CategoryTheory.Sheaf.Subcanonical.isSheaf_of_representable {C : Type u} [CategoryTheory.Category.{v, u} C] {J : CategoryTheory.GrothendieckTopology C} (hJ : CategoryTheory.Sheaf.Subcanonical J) (P : CategoryTheory.Functor Cᵒᵖ (Type v)) [CategoryTheory.Functor.Representable P] : CategoryTheory.Presieve.IsSheaf J P

If J is subcanonical, then any representable is a J-sheaf.