The notion of sieve is a generalization of that of (right) ideal in a monoid from monoids to categories: a sieve on an object in a category is a collection of morphisms with codomain that are closed under precomposition with morphisms in .
Sometimes one says that a sieve in a category is a full subcategory closed under precomposition with morphisms in (Lurie, def. 22.214.171.124). If so, then a sieve on an object is a sieve in the slice category . But a sieve in a category is also naturally taken to be a collection of sieves on various objects. On the other hand, most authors speak just about sieves on an object anyway.
The notion of sieve is usually used when certain such subobjects are singled out as covers of a (sifted) coverage: the singled out subobjects then correspond to covering sieves. Accordingly, the classical examples of sieves on an object are Grothendieck topologies, used to present the presheaves that behave like coverings. They are used to say which presheaves are actually sheaves with respect to a given coverage or Grothendieck topology.
A choice of collections of morphism into an object for each reminds one of the representable functor presheaf which assigns to each the set of all morphisms from to . Every choice of covers of is therefore for each a subset of the value of this functor evaluated at . This begins to look like an monic natural transformation into this functor. Indeed, it turns out that one can assume without restriction of generality that the assignment of covers of can always be extended to such a monic natural transformation, and hence one formalizes the notion of “collection of covers” of as a subobject of the functor represented by : a sieve at .
A dual notion is a cosieve.
Let be a small category.
A sieve on an object is a sieve in the slice category .
Spelling this out, we arrive at the traditional definition of a sieve on an object:
A sieve on an object is a subset of the set of objects of the over category over which is closed under precomposition: it has the property that whenever and then the composition is in .
This is probably called a sieve because it “sifts out” the ‘special’ maps into from the set of all maps into . (Note that ‘sieve’ is the noun, while ‘sift’ is the verb.)
The French term for a sieve is crible.
Sometimes the condition of a sieve being closed under the operation of precomposing with an arbitrary morphism is called a “saturation condition”. Given any collection of morphisms targeted at , one can always close it up, or saturate it, to obtain a sieve on .
There is a canonical way to create subfunctors from sieves and sieves from subfunctors.
A subfunctor is a subobject in a functor category. Here, specifically, one is interested in subobjects in a presheaf category of representable functors. It’s these subfunctors of representable functors that are in bijection with sieves.
Given a sieve on , the subfunctor defined by the sieve is the presheaf
that assigns to each object the set ;
that assigns to each morphism the function induced on elements by precomposition with .
Given a subfunctor , the sieve defined by the subfunctor is given by
These two definitions establish a bijection between sieves on and subobjects of .
For every sieve we have
and for every subfunctor we have
The construction of makes sense for every morphism of presheaves . The sieve is sensitive precisely to the image of this map,
The pullback of a subfunctor along any morphism is again a subfunctor of , hence sieves are closed under pulling back. Concretely,
A sieve on , for a subfunctor, may be described as a function which assigns to each object a collection of morphisms into . Naturality of the inclusion means that whenever belongs to the sieve and is any morphism, then also belongs to the sieve.
The subfunctor corresponding to a sieve is the coimage of the morphism out of the disjoint union of all objects (regarded as representable presheaves) in the sieve:
If the sieve is generated by (is the saturation of) a collection of morphisms then the same statement remains true with being the coproduct over just these .
where all objects appearing (at least in the first lines) are implicitly regarded as presheaves under the Yoneda embedding.
But this colimit now manifestly computes the set
where the equivalence relation is
So the set is just the set of maps from to that factor through one of the , which is precisely the set assigned by the subfunctor corresponding to the sieve.
The following is a pedagogical step-by-step description of the crucial aspects of sieves as covers.
To start with the simplest example that already contains in it all the relevant aspects, consider a topological space with an open subset that is covered by two open subsets in that the union in coincides with :
This is the coproduct in the category of open subsets of , but that behaves very differently from the disjoint coproducts that we are used to from categories like Set. On the other hand, when one comes to a category of presheaves or sheaves (a Grothendieck topos), this topos does have disjoint coproducts.
The union is again obtained from this by removing in the above diagram the bottom right corner and then forming the pushout over the resulting diagram: this is again , i.e. the diagram
The important point about (covering) sieves is that they show up when the above situation is sent via the Yoneda embedding from to presheaves on . The crucial aspect here that gives rise to the peculiarities of sieves is that
As a result, the above discussion goes through equivalently for the presheaves represented by our open subsets all the way up to the last pushout. In that last pushout reproduced the open subset . In it instead reproduces the sieve on generated by and .
Let’s go through this in detail. First of all notice that in all limits and colimits do exist (see limits and colimits by example for more on that); in particular the coproduct
exists. Here denotes the Yoneda embedding which we here indicate explicitly, even though often and elsewhere, notably elsewhere in this entry here, it is notationally suppressed.
For the following it is helpful to say explicitly what the presheaf is like. Since, as described at limits and colimits by example, colimits of presheaves are computed objectwise, we know that this presheaf evaluated on any open set yields the set
where the coproducts on the right are just those in Set which are just ordinary disjoint unions of sets.
So this says that is the presheaf that assigns to any open set the disjoint union of the collections of maps from to and those from to in . (Since is a poset there is either none or one such map in each case, but it is helpful to speak generally of “sets of all maps”, since that is the general intuition useful for presheaf categories. just happens to be a particularly simple example.)
Notice that in particular a given map which factors both through as well as through will appear as two distinct elements in the set . This we’ll come back to in a minute.
But first consider the fiber product from before, now after having applied the Yoneda embedding. Since we know from general nonsense that this preserves fiber products, we know that the pullback presheaf in
is the same as .
But this is also easily checked explicitly. We go through this because this kind of reasoning for computing limits and colimits of presheaves will be needed throughout here: since for any the covariant hom-functor preserves limits (by the very definition of limit!) we have for every a pullback diagram of sets
Again by the Yoneda lemma this is simply
This being a pullback diagram now says in words:
The set is the set of those pairs of maps and that coincide as maps and to .
Clearly, this set is the same as the set of maps into the intersection , so indeed
So far so long-winded. Now let’s see what happens when we now form the pushout over
that will go, for a moment, by its canonical but lengthy name
Again, we can figure out what this presheaf is by computing objectwise what it does to any open subset : since colimits of presheaves are computed objectwise, the diagram
must be a colimit in Set. Again, this is easily read out in words:
The set is the quotient of the disjoint union of the collection of maps from into and those from into , by the equivalence relation which identifies two such maps and if they both factor through a map , i.e. if they both land in the intersection and coincide there.
But this just means that contrary to the plain coproduct , two maps and that coincide as maps are no longer regarded as different elements of our set given by the pushout presheaf, but are regarded as being the same.
So this means we find that
But this is by definition the assignment of the subfunctor coresponding to the sieve on generated by and .
So we find that
Given that we made it to this point, we should go one small step further that will be very useful.
In the present simple example we worked with a cover given by just two objects and . Of course in general the cover will consist of more than just two objects. Then the above kind of notation becomes a bit cumbersome. But there is a simple reformulation that makes everything look nice again.
Namely, let’s come back to the observation that the coproduct does exist. Let’s just call this presheaf (not in general a representable!).
Then it is easy to see by the same kind of objectwise reasoning that the colimiting presheaf that we are after is equivalently the colimit over the pair of parallel morphisms
This description now has an evident direct generalization to the case where instead of just and we have an arbitrary collection of open sets covering . One finds again with
is the presheaf that to every assigns the set of all maps that factor through any one of the .
It is in this way that sieves and their associated subfunctors encapsulate the notion of cover of an object : they tell us which of all the maps into do factor through the cover.
And, to end this pedagocial piece with an outlook to indicate the gain in understanding this achieves:
once we start forming there is no stopping. We can keep forming higher and higher such fiber products
When one passes from just presheaves to (∞,1)-presheaves, then covering presheaves will be given by the right kind of colimit over these simplicial diagrams (namely the homotopy colimit). More on that is at descent.
We now show that the subfunctor associated with a sieve coming from a cover is the right kind of morphism to require a sheaf to be a local object for, by demonstrating that using it the usual sheaf condition on a presheaf with respect to the cover is reproduced:
From the above detailed discuss recall that is precisely the coequalizer of the obvious pair of morphisms
Here the domain of this parallel pair is the pullback of the evident map
along itself, and the two parallel arrows are the projection maps out of this pullback:
Thus for any presheaf, maps are precisely the same as maps which coequalize the parallel pair. Applying to the colimit diagram
yields the limit diagram
which using Yoneda is the equalizer diagram
For a topological space let be the category of open subsets of and consider presheaves on . For any open subset let be a cover of by open subsets in the ordinary sense (i.e. each is an open subset of and their joint union is , ), then (with the Yoneda embedding) is a local epimorphism of presheaves on and its image – or equivalently its coimage – is the subfunctor that sends each to the set of maps that factor through one of the . The collection of all such maps for all choice of is the corresponding covering sieve .
The situation for more general sites other than is literally the same as above, with etc. objects of .
A standard textbook account on sieves in category theory is in
In the context of (∞,1)-categories sieves are discussed around def. 126.96.36.199 of