Definition

Let C\mathcal C be a and let UU be an object of C\mathcal C. A sieve on UU is a collection SS of with codomain UU that is closed under precomposition: if f:VUf:V\to U belongs to SS and g:WVg:W\to V is any morphism, then

fg:WUf\circ g:W\longrightarrow U

also belongs to SS. Thus a sieve remembers a collection of ways to map into UU, together with every refinement of each such map.

Generated and maximal sieves

The maximal sieve on UU contains every morphism into UU. A family {fi:UiU}\{f_i:U_i\to U\} generates the smallest sieve containing all the fif_i; it consists of the morphisms into UU that factor through at least one fif_i.

Pullback

If f:VUf:V\to U is a morphism, the pullback sieve fSf^*S on VV consists of the morphisms g:WVg:W\to V for which fgf\circ g belongs to SS:

fS={g:WVfgS}.f^*S=\{g:W\to V\mid f\circ g\in S\}.

A specifies which sieves count as covering. Equivalently, a is one whose generated sieve is covering.

Why sieves are useful

A covering family is a chosen list of local charts. Its generated sieve also includes every chart obtained by refining one of them, so it is independent of redundant choices in the original list. This makes sieves the natural categorical form of “all local probes compatible with this cover.”