nLab
pseudofunctor

Context

2-category theory

Higher category theory

higher category theory

Basic concepts

Basic theorems

Applications

Models

Morphisms

Functors

Universal constructions

Extra properties and structure

1-categorical presentations

Pseudofunctors

Idea

A pseudofunctor is a specific algebraic notion of weak 22-functor between bicategories (including strict 2-categories), i.e. a functor which preserves composition and identities only up to coherent specified isomorphism.

In general, there is not much reason to say “pseudofunctor” instead of “functor,” since by far the most important type of functor between arbitrary bicategories is weak. However, if the domain and codomain are known to be strict 2-categories (including ordinary 11-categories), it can be helpful to say “pseudofunctor” or “weak functor” to emphasize that it is not a strict 2-functor. Note that if the codomain is a 11-category, then there is no difference.

Pseudo or weak functors are also to be distinguished from lax functors and oplax functors, which preserve identities and composition only up to a transformation in one direction or the other, which may be non-invertible.

An older terminology, which should probably be avoided at all costs, uses “homomorphism of bicategories” for a weak functor and “morphism of bicategories” for a lax one.

Definition

Given bicategories CC and DD, a pseudofunctor (or weak 22-functor, or just functor) P:CDP\colon C \to D consists of:

  • for each object xx of CC, an object P xP_x of DD;
  • for each hom-category C(x,y)C(x,y) in CC, a functor P x,y:C(x,y)D(P x,P y)P_{x,y}\colon C(x,y) \rightarrow D(P_x,P_y);
  • for each object xx of CC, an invertible 2-morphism (22-cell) P id x:id P xP x,x(id x)P_{\id_x}\colon \id_{P_x} \Rightarrow P_{x,x}(\id_x);
  • for each triple x,y,zx,y,z of CC-objects, a isomorphism (natural in f:xyf\colon x \to y and g:yzg\colon y \to z) P x,y,z(f,g):P x,y(f);P y,z(g)P x,z(f;g)P_{x,y,z}(f,g)\colon P_{x,y}(f) ; P_{y,z}(g) \Rightarrow P_{x,z}(f;g);
  • for each hom-category C(x,y)C(x,y),
    id P x;P x,y(f) P id x;id P x,y(f) λ P x,y(f) P x,x(id x);P x,y(f) P x,y(f) P x,x,y(id x,f) P x,y(λ f) P x,y(id x;f) \array { & & \id_{P_x} ; P_{x,y}(f) \\ & {}^{P_{\id_x};\id_{P_{x,y}(f)}}\swArrow & & \seArrow^{\lambda_{P_{x,y}(f)}} \\ P_{x,x}(\id_x) ; P_{x,y}(f) & & & & P_{x,y}(f) \\ & {}_{P_{x,x,y}(\id_x,f)}\seArrow & & \neArrow_{P_{x,y}(\lambda_f)} \\ & & P_{x,y}(\id_x;f) \\ }

    and

    P x,y(f);id P y id P x,y(f);P id y ρ P x,y(f) P x,y(f);P y,y(id y) P x,y(f) P x,y,y(f,id y) P x,y(ρ f) P x,y(f;id y) \array { & & P_{x,y}(f) ; \id_{P_y} \\ & {}^{\id_{P_{x,y}(f)};P_{\id_y}}\swArrow & & \seArrow^{\rho_{P_{x,y}(f)}} \\ P_{x,y}(f) ; P_{y,y}(\id_y) & & & & P_{x,y}(f) \\ & {}_{P_{x,y,y}(f,\id_y)}\seArrow & & \neArrow_{P_{x,y}(\rho_f)} \\ & & P_{x,y}(f;\id_y) \\ }

    commute; and

  • for each quadruple w,x,y,zw,x,y,z of CC-objects,
    (P w,x(f);P x,y(g));P y,z(h) α P w,x(f),P x,y(g),P y,z(h) P w,x(f);(P x,y(g);P y,z(h)) P w,x,y(f,g);id P y,z(h) id P w,x(f);P x,y,z(g,h) P w,y(f;g);P y,z(h) P w,x(f);P x,z(g;h) P w,y,z(f;g,h) P w,x,z(f,g;h) P w,z((f;g);h) P w,z(α f,g,h) P w,z(f;(g;h)) \array { \big(P_{w,x}(f) ; P_{x,y}(g)\big) ; P_{y,z}(h) & \overset{\alpha_{P_{w,x}(f),P_{x,y}(g),P_{y,z}(h)}}\Rightarrow & P_{w,x}(f) ; \big(P_{x,y}(g) ; P_{y,z}(h)\big) \\ \mathllap{P_{w,x,y}(f,g);\id_{P_{y,z}(h)}}\Downarrow & & \Downarrow\mathrlap{\id_{P_{w,x}(f)};P_{x,y,z}(g,h)} \\ P_{w,y}(f;g) ; P_{y,z}(h) & & P_{w,x}(f) ; P_{x,z}(g;h) \\ \mathllap{P_{w,y,z}(f;g,h)}\Downarrow & & \Downarrow\mathrlap{P_{w,x,z}(f,g;h)} \\ P_{w,z}\big((f;g);h\big) & \underset{P_{w,z}(\alpha_{f,g,h})}\Rightarrow & P_{w,z}\big(f;(g;h)\big) \\ }

    commutes.

Pseudofunctors versus lax functors

If we remove the requirement that P id xP_{\id_x} and P x,y,z(f,g)P_{x,y,z}(f,g) be invertible, then we have the definition of lax functor. Thus, a pseudofunctor may be defined as a lax functor whose comparison constraints are invertible.

If in the definition of lax functor we reverse the direction of the constraints, then we have an oplax functor. Thus, if we consider the inverses of the constraints of a pseudofunctor, we obtain an oplax functor. Because there is little difference between specifying an invertible morphism and specifying its invertible inverse, one could equally well define a pseudofunctor to be an oplax functor whose constraints are invertible (i.e. reverse the direction of the isomorphisms P id xP_{\id_x} and P x,y,z(f,g)P_{x,y,z}(f,g) above), and in the literature one sometimes finds this definition instead.

Of course, in particular applications, one direction or the other may be slightly more “natural”. For instance, when a Grothendieck fibration EBE\to B gives rise to a pseudofunctor B opCatB^{op} \to Cat, the natural comparison maps (induced by the universal property of cartesian arrows) go in the “lax direction”. Dually, when a Grothendieck opfibration EBE\to B gives rise to a pseudofunctor BCatB\to Cat, the natural comparison maps go in the “oplax direction”.

Strictification

For CC a strict 2-category, there is a universal procedure for replacing pseudofunctors F:CCatF \colon C \to Cat with strict 2-functors F^:CCat\hat{F} \colon C \to Cat, where “universal” is in the following sense:

Proposition

For any pseudofunctor F:CCatF \colon C \to Cat, there is a strict 2-functor F^:CCat\hat{F}\colon C\to Cat and a pseudonatural equivalence η F:FF^\eta_F\colon F\to \hat{F}. Moreover, for any strict 2-functor G:CCatG \colon C \to Cat, composing with η F\eta_F yields an isomorphism between the category of pseudonatural transformations FGF \to G and modifications between them, and the category of strict natural transformations F^G\hat{F} \to G and modifications between them.

Proof (Sketch)

For each object cc of CC, define F^(c)\hat{F}(c) to be the category whose objects are pairs (f,x)(f, x) with f:dcf \colon d \to c in CC and xOb(F(d))x \in Ob(F(d)), and whose morphisms (f,x)(f,x)(f, x) \to (f', x') are morphisms F(f)(x)F(f)(x)F(f)(x) \to F(f')(x') in F(c)F(c). For g:ccg \colon c \to c' in CC, the functor F^(g):F^(c)F^(c)\hat{F}(g) \colon \hat{F}(c) \to \hat{F}(c') takes (f,x)(f, x) to (gf,x)(g f, x); notice F^()\hat{F}(-) preserves compositions ggg' \circ g strictly since composition in CC is strictly associative. (Strictly speaking we have only defined the functor F^(g)\hat{F}(g) at the object level. However, the extension to morphisms θ:F(f)(x)F(f)(x)\theta \colon F(f)(x) \to F(f)(x') is the obvious one, where

F^(g)(θ)(F(gf)(x)F(g)(F(f)(x))F(g)(θ)F(g)(F(f)(x))F(gf)(x))\hat{F}(g)(\theta) \coloneqq (F(g f)(x) \cong F(g)(F(f)(x)) \stackrel{F(g)(\theta)}{\to} F(g)(F(f)(x')) \cong F(g f)(x'))

preserves compositions θθ\theta' \circ \theta by naturality of the structural constraints F(g)F(f)F(gf)F(g)F(f) \cong F(g f).) Similarly, for 2-cells α:gg\alpha: g \to g', the natural transformation F^(α):F^(g)F^(g)\hat{F}(\alpha) \colon \hat{F}(g) \to \hat{F}(g') is defined by taking its component at an object (f,x)(f, x) to be given by pasting in the first component: F(αf)(x):F(gf)(x)F(gf)(x)F(\alpha \cdot f)(x) \colon F(g f)(x) \to F(g' f)(x).

One easily checks that F^\hat{F} is pseudonaturally equivalent to FF

The construction of the strictification is a special case of a general strictification construction due to Power. Later Steve Lack showed that the strictifications obtained from Power’s coherence theorem always have a universal property analogous to that of the result above.

History

Historically the term ‘pseudofunctor’ was conceived by Grothendieck who weakened, around 1957, the concept of a contravariant functor from a 1-category to Cat, by effectively replacing the 11-category Cat by the 2-category CatCat and allowing (contravariant) functoriality up to coherent 22-cells. This was recorded in his Bourbaki seminar on descent via pseudofunctors. Later in SGA1 Grothendieck (with the assistance of Pierre Gabriel) replaced pseudofunctors in the treatment of descent by more invariant fibered categories. Benabou, in his 1967 treatise introducing bicategories, generalized the pseudofunctors of Grothendieck to pseudofunctors between arbitrary bicategories but under the name ‘homomorphism of bicategories’.

References

  • Jean Bénabou, Introduction to bicategories, Springer LNM 47 (1967), 1-77.
  • A. J. Power, A general coherence result, JPAA Vol. 57 Iss. 2 (1989), 165-173. (web)
  • Stephen Lack, Codescent objects and coherence, JPAA Vol. 175 (2002), 223-241. (web)

Revised on January 24, 2013 22:31:13 by Urs Schreiber (82.113.99.233)