Pseudo-functor

From HandWiki
Short description: Category mapping


In mathematics, a pseudofunctor F is a mapping from a category to the category Cat of (small) categories that is just like a functor except that F(fg)=F(f)F(g) and F(1)=1 do not hold as exact equalities but only up to coherent isomorphisms.

A typical example is an assignment to each pullback Ff=f*, which is a contravariant pseudofunctor since, for example for a quasi-coherent sheaf , we only have: (gf)*f*g*.

Since Cat is a 2-category, more generally, one can also consider a pseudofunctor between 2-categories, where coherent isomorphisms are given as invertible 2-morphisms.

The Grothendieck construction associates to a contravariant pseudofunctor a fibered category, and conversely, each fibered category is induced by some contravariant pseudofunctor. Because of this, a contravariant pseudofunctor, which is a category-valued presheaf, is often also called a prestack (a stack minus effective descent).

Definition

A pseudofunctor F from a category C to Cat consists of the following data

  • a category F(x) for each object x in C,
  • a functor Ff for each morphism f in C,
  • a set of coherent isomorphisms for the identities and the compositions; namely, the invertible natural transformations
    F(fg)FfFg,
    F(idx)idF(x) for each object x
such that
F(fgh)F(fg)FhFfFgFh is the same as F(fgh)FfF(gh)FfFgFh,
F(idx)FfF(idxf)=Ff is the same as F(idx)FfidF(x)Ff=Ff,
and similarly for FfF(idx).[1]

Higher category interpretation

The notion of a pseudofunctor is more efficiently handled in the language of higher category theory. Namely, given an ordinary category C, we have the functor category as the ∞-category

Fct(C,Cat).

Each pseudofunctor CCat belongs to the above, roughly because in an ∞-category, a composition is only required to hold weakly, and conversely (since a 2-morphism is invertible).

See also

References

  1. Vistoli 2008, Definition 3.10.