Profunctor

From The Right Wiki
Jump to navigationJump to search

In category theory, a branch of mathematics, profunctors are a generalization of relations and also of bimodules.

Definition

A profunctor (also named distributor by the French school and module by the Sydney school) ϕ from a category C to a category D, written

ϕ:CD,

is defined to be a functor

ϕ:Dop×CSet

where Dop denotes the opposite category of D and Set denotes the category of sets. Given morphisms f:dd,g:cc respectively in D,C and an element xϕ(d,c), we write xfϕ(d,c),gxϕ(d,c) to denote the actions. Using the cartesian closure of Cat, the category of small categories, the profunctor ϕ can be seen as a functor

ϕ^:CD^

where D^ denotes the category SetDop of presheaves over D. A correspondence from C to D is a profunctor DC.

Profunctors as categories

An equivalent definition of a profunctor ϕ:CD is a category whose objects are the disjoint union of the objects of C and the objects of D, and whose morphisms are the morphisms of C and the morphisms of D, plus zero or more additional morphisms from objects of D to objects of C. The sets in the formal definition above are the hom-sets between objects of D and objects of C. (These are also known as het-sets, since the corresponding morphisms can be called heteromorphisms.) The previous definition can be recovered by the restriction of the hom-functor ϕop×ϕSet to Dop×C. This also makes it clear that a profunctor can be thought of as a relation between the objects of C and the objects of D, where each member of the relation is associated with a set of morphisms. A functor is a special case of a profunctor in the same way that a function is a special case of a relation.

Composition of profunctors

The composite ψϕ of two profunctors

ϕ:CD and ψ:DE

is given by

ψϕ=LanYD(ψ^)ϕ^

where LanYD(ψ^) is the left Kan extension of the functor ψ^ along the Yoneda functor YD:DD^ of D (which to every object d of D associates the functor D(,d):DopSet). It can be shown that

(ψϕ)(e,c)=(dDψ(e,d)×ϕ(d,c))/

where is the least equivalence relation such that (y,x)(y,x) whenever there exists a morphism v in D such that

y=vyψ(e,d) and xv=xϕ(d,c).

Equivalently, profunctor composition can be written using a coend

(ψϕ)(e,c)=d:Dψ(e,d)×ϕ(d,c)

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 F:CD can be seen as a profunctor ϕF:CD by postcomposing with the Yoneda functor:

ϕF=YDF.

It can be shown that such a profunctor ϕF has a right adjoint. Moreover, this is a characterization: a profunctor ϕ:CD has a right adjoint if and only if ϕ^:CD^ factors through the Cauchy completion of D, i.e. there exists a functor F:CD such that ϕ^=YDF.

See also

References

  • Bénabou, Jean (2000), Distributors at Work (PDF)
  • Borceux, Francis (1994). Handbook of Categorical Algebra. CUP.
  • Lurie, Jacob (2009). Higher Topos Theory. Princeton University Press.
  • Profunctor at the nLab
  • Heteromorphism at the nLab