Welcome to mapoid.com on January 9 2009.
This is an internet experiment running to monitor browsing habbits of individuals through wikipedia contents.

Profunctor

From Wikipedia, the free encyclopedia

Jump to: navigation, search

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

Contents

[edit] Definition

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

\phi \colon C\nrightarrow D,

is defined to be a functor

\phi \colon D^{\mathrm{op}}\times C\to\mathbf{Set}.

Using the cartesian closure of \mathbf{Cat}, the profunctor φ can be seen as a functor

\hat{\phi} \colon C\to\hat{D}

where \hat{D} denotes the category \mathrm{Set}^{D^\mathrm{op}} of presheaves over D.

[edit] Composition of profunctors

The composite ψφ of two profunctors

\phi\colon C\nrightarrow D and \psi\colon D\nrightarrow E

is given by

\psi\phi=\mathrm{Lan}_{Y_D}(\hat{\psi})\circ\phi

where is \mathrm{Lan}_{Y_D}(\hat{\psi}) the left Kan extension of the functor \hat{\psi} along the Yoneda functor Y_D \colon D\to\hat D of D (which to every object d of D associates the functor D(-,d) \colon D^{\mathrm{op}}\to\mathrm{Set}).

It can be shown that

(\psi\phi)(e,c)=\left(\coprod_{d\in D}\psi(e,d)\times\phi(d,c)\right)\Bigg/\sim

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

y' = vy and x'v = x.

[edit] 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.

[edit] Properties

[edit] Lifting functors to profunctors

A functor F \colon C\to D can be seen as a profunctor \phi_F \colon C\nrightarrow D by postcomposing with the Yoneda functor:

\phi_F=Y_D\circ F.

It can be shown that such a functor φF has a right adjoint. Moreover, this is a characterization: a profunctor \phi \colon C\nrightarrow D has a right adjoint if and only if \hat\phi \colon C\to\hat D factors through the Cauchy completion of D, i.e. there exists a functor F \colon C\to D such that \hat\phi=Y_D\circ F.

[edit] References

[edit] See also


This category theory-related article is a stub. You can help Wikipedia by expanding it.
Personal tools

Visit joltnews for the latest headlines
Visit bloit.com for company information
Geed Media does computer consulting on long island.
This page viewed times. See Logs