In category theory, a branch of mathematics, profunctors are a generalization of relations and also of bimodules.
Contents |
Definition
A profunctor (also named distributor by the French school and module by the Sydney school) <math>\,\phi</math> from a category <math>C</math> to a category <math>D</math>, written
- <math>\phi:C\nrightarrow D</math>,
is defined to be a functor
- <math>\phi:D^{\mathrm{op}}\times C\to\mathbf{Set}</math>.
Using the cartesian closure of <math>\mathbf{Cat}</math>, the profunctor <math>\phi</math> can be seen as a functor
- <math>\hat{\phi}:C\to\hat{D}</math>
where <math>\hat{D}</math> denotes the category <math>\mathrm{Set}^{D^\mathrm{op}}</math> of presheaves over <math>D</math>.
Composition of profunctors
The composite <math>\psi\phi</math> of two profunctors
- <math>\phi:C\nrightarrow D</math> and <math>\psi:D\nrightarrow E</math>
is given by
- <math>\psi\phi=\mathrm{Lan}_{Y_D}(\hat{\psi})\circ\phi</math>
where is <math>\mathrm{Lan}_{Y_D}(\hat{\psi})</math> the left Kan extension of the functor <math>\hat{\psi}</math> along the Yoneda functor <math>Y_D:D\to\hat D</math> of <math>D</math> (which to every object <math>d</math> of <math>D</math> associates the functor <math>D(-,d):D^{\mathrm{op}}\to\mathrm{Set}</math>). It can be shown that
- <math>(\psi\phi)(e,c)=\left(\coprod_{d\in D}\psi(e,d)\times\phi(d,c)\right)/\sim</math>
where <math>\sim</math> is the least equivalence relation such that <math>(y',x')\sim(y,x)</math> whenever there exists a morphism <math>v</math> in <math>B</math> such that
- <math>y'=vy</math> and <math>x'v=x</math>.
The bicategory of profunctors
Composition of profunctors is associative only up to isomorphism (because the product is not strictly associative in Set). The best one can hope is therefore to build a bicategory Prof whose
- 0-cells are small categories,
- 1-cells between two small categories are the profunctors between those categories,
- 2-cells between two profunctors are the natural transformations between those profunctors.
Properties
Lifting functors to profunctors
A functor <math>F:C\to D</math> can be seen as a profunctor <math>\phi_F:C\nrightarrow D</math> by postcomposing with the Yoneda functor:
- <math>\phi_F=Y_D\circ F</math>.
It can be shown that such a functor <math>\phi_F</math> has a right adjoint. Moreover, this is a characterization: a profunctor <math>\phi:C\nrightarrow D</math> has a right adjoint if and only if <math>\hat\phi:C\to\hat D</math> factors through the Cauchy completion of <math>D</math>, i.e. there exists a functor <math>F:C\to D</math> such that <math>\hat\phi=Y_D\circ F</math>.
References
- Bénabou, Jean (2000). "Distributors at Work".
- Borceux, Francis (1994). Handbook of Categorical Algebra. CUP.
