nLab
profunctor

Redirected from "distributor".

Contents

Definition

Let V be a symmetric closed monoidal category and C, D, enriched categories over V. Then a profunctor or (bi)module or distributor from C to D is a V-functor from CD op to V, we write

F:CD:CD opV.F : C ⇸ D : C\otimes D^{op} \to V \,.

Such profunctors are composed by using a coend to “trace out” the middle variable:

for F:CD and G:DE profunctors, their composite GF:CE is defined to be

GF:= dDF(,d)G(d,).G \circ F := \int^{d \in D} F(-,d)\otimes G(d,-) \,.

This yields a bicategory VMod with

  • objects are V-enriched categories;

  • morphisms are profunctors with the above composition;

  • 2-morphisms are natural transformations.

At least for V=Set a morphism in SetMod is often called a profunctor and the bicategory SetMod is then often denoted Prof.

Alternative definitions

In terms of colimit-preserving functors on presheaf categories

A basic fact (e.g. Kashiwara, Schapira, Categories and Sheaves, corollary 2.7.4, page 63) is that for A a cocomplete category, colimit-preserving functors from presheaves on some category C to A are canonically equivalent to functors from C to A: we have an equivalence of functor categories

Cocont(PSh(C),A)Func(C,A).Cocont(PSh(C),A) \simeq Func(C,A) \,.

This may be thought of as a consequence of the co-Yoneda lemma (and hence, of course, of the Yoneda lemma) which says that every presheaf is colimit over representables, i.e. over objects in the image of the Yoneda embedding Y:CPSh(C). This immediate implies that a colimit-preserving functor on PSh(C) is already determined by its restriction along Y to C.

Now, profunctors CD opV are adjunct to functors C[D op,V]PSh(D). Hence by the above, profunctors are equivalent to colimit-preserving functors

PSh(C)PSh(D).PSh(C) \to PSh(D) \,.

Indeed, there is an equivalence of bicategories VMod and that of categories and colimit-preserving functors and natural transformation between their presheaf categories.

An explicit statement of this can be found for instance as prop. 4.2.4

  • Gian Luca Cattani, PhD thesis from BRICS, University of Aarhus (pdf)

This formulation plays a big role also in the context of (∞,1)-categories. A presentable (∞,1)-category is one equivalent to a localization of some (∞,1)-category of (∞,1)-presheaves (i.e. some reflective (∞,1)-subcategory of the latter). The collection of all presentable (∞,1)-categories and colimit-preserving (∞,1)-functors betweem them forms the symmetric monoidal (∞,1)-category of presentable (∞,1)-categories, whose tensor product is the “bilinear” tensor product coming from interpreting colimit-preserving functors as “linear” (reading: colimit sum).

This (,1)-category Pr L therefore is an (,1)-analog of Set-Mod. In geometric ∞-function theory one finds (see section 4 there) that morphisms in Pr L encode the “correspondence operations” such as Fourier-Mukai and its generalizations. See in that context also the examples below.

Examples

  • Recall that a one-object Vect-enriched category is just an algebra, while a general Vect-enriched category is an algebroid. The full sub-bicategory of VectMod on one-object Vect-enriched categories is the familiar category of algebras, bimodules and bimodule homomorphisms.

  • For V=(Set,×), SetMod is the bicategory of locally small categories, profunctors and transformations.

    The full sub-bicategory on discrete categories is that of sets, spans of sets and morphisms of spans:

    SetMod discSpan(Set).Set\Mod_{disc} \simeq Span(Set) \,.
  • Accordingly for S=(Set op,×) we get the bicategory of cospans

    Set opMod discSpan(Set op)=Cospan(Set).Set^{op}\Mod_{disc} \simeq Span(Set^{op}) = Cospan(Set) \,.

Remarks

  • Every ordinary V-functor f:CD yields a profunctor F̂:CD which is the adjunct of the postcomposition

    CfDY[D op,V]C \stackrel{f}{\to} D \stackrel{Y}{\to} [D^{op},V]

    with the Yoneda embedding under the Hom-adjunction. This extends to a bifunctor

    VCatVMod.V\Cat \to V\Mod \,.
    • For V=Vect this is the generalization of how every morphism AB of algebras induces the A-B bimodule which as a vector space is B with obvious right B action and left A-action induced by first mapping A to B via f and then using multiplication in B.

    • For V=Set this is the fact that every map f:CD of sets induces the span

C Id f C D\array{ && C \\ & {}^{Id}\swarrow && \searrow^{f} \\ C &&&& D }

References

(what is a good comprehensive reference?)

Some exposition at

  • John Baez, Re: Klein 2-Geometry VII (blog)

The common generalization of bimodules and spans in terms of profunctors has been discussed on the blog at

  • John Baez, Bimodules versus spans (blog)

There is a discussion of profunctors in the recently republished:

  • J.-M. Cordier and T. Porter, (1989), Shape Theory: Categorical Methods of Approximation, Mathematics and its Applications, Ellis Horwood. Reprinted Dover (2008).

Excellent notes from a course on distributors given by Jean Bénabou in June 2000 at TU Darmstadt, and prepared by Thomas Streicher, are available from his website http://www.mathematik.tu-darmstadt.de/~streicher.


Notation

Profunctors are often notated with a slashed or barred arrow, as in CD, which is U+21F8 in Unicode. It is not always obvious how to draw this character, so here are some hints.

  • On the nLab (or anywhere that accepts SGML character entities, including raw HTML on the web), it can be found using a Unicode entity:

    ⇸
  • In LaTeX, one can use \nrightarrow (producing ‘’) in a pinch, but a nice-looking extensible barred arrow command can also be produced with the following preamble code (modified from amsmath’s \xrightarrow):

    \makeatletter
    \def\slashedarrowfill@#1#2#3#4#5{%
      $\m@th\thickmuskip0mu\medmuskip\thickmuskip\thinmuskip\thickmuskip
       \relax#5#1\mkern-7mu%
       \cleaders\hbox{$#5\mkern-2mu#2\mkern-2mu$}\hfill
       \mathclap{#3}\mathclap{#2}%
       \cleaders\hbox{$#5\mkern-2mu#2\mkern-2mu$}\hfill
       \mkern-7mu#4$%
    }
    \def\rightslashedarrowfill@{%
      \slashedarrowfill@\relbar\relbar\mapstochar\rightarrow}
    \newcommand\xslashedrightarrow[2][]{%
      \ext@arrow 0055{\rightslashedarrowfill@}{#1}{#2}}
    \makeatother
  • In Xypic, a barred arrow (to the right, in this example) can be produced with

    \ar[r]|-@{|}

Discussion

On a previous version of this entry with opposite convention on where to put the op Todd has remarked

Todd: There is an inevitable debate here about whether one should use C opDV or CD opV. My own convention is to use the latter. For example, every functor CD yields a profunctor by composition with the Yoneda embedding on D.

Mike: My convention is D opC. I agree with your reasoning for why D should be contravariant; I like to put it first because in the hom-functor C(,) the contravariant variable appears first.