Profunctor¶
In category theory, a branch of mathematics, profunctors are a generalization of relations and also of bimodules.
Core Idea¶
Profunctor is treated here as the recurring cross-domain formal modeling identity summarized by this source-grounded definition: In category theory, a branch of mathematics, profunctors are a generalization of relations and also of bimodules. In category theory, a branch of mathematics, profunctors are a generalization of relations and also of bimodules. An equivalent definition of a profunctor \phi : C\nrightarrow D 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.
Scope of Application¶
-
Profunctors as categories. A functor is a special case of a profunctor in the same way that a function is a special case of a relation.
-
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.
-
Definition. where D^\mathrm{op} denotes the opposite category of D and \mathbf{Set} denotes the category of sets.
-
Definition. Given morphisms f : d\to d', g : c\to c' respectively in D, C and an element x\in\phi(d',c) , we write xf\in \phi(d,c).
-
Definition. Using that the category of small categories \mathbf{Cat} is cartesian closed, the profunctor \phi can be seen as a functor.
Clarity¶
A clear use of Profunctor names the carrier, the operative relation, and the conditions under which the source treats the identity as present. The minimal definition is In category theory, a branch of mathematics, profunctors are a generalization of relations and also of bimodules. The strongest recognition evidence in the frozen account is: Moreover, this is a characterization: a profunctor \phi : C\nrightarrow D has a right adjoint if and.
Manages Complexity¶
Profunctor compresses multiple cross-domain formal modeling details into a stable diagnostic relation. The source shows both the central mechanism—(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 \phi^\text{op}\times \phi \to \mathbf{Set} to D^\text{op}\times C .—and the practical consequence—given morphisms f : d\to d', g.
Abstract Reasoning¶
- Type the carrier. Identify the cross-domain formal modeling entities to which the claim applies.
- State the relation. Use the source-grounded identity: In category theory, a branch of mathematics, profunctors are a generalization of relations and also of bimodules.
- Check operation and conditions. A functor F : C\to D can be seen as a profunctor \phiF : C\nrightarrow D by postcomposing with the Yoneda functor.
- Demand recognition evidence.
Knowledge Transfer¶
Within the home domain. Knowledge about Profunctor transfers literally when a new case preserves the same carrier type, relation, and recognition test. A functor is a special case of a profunctor in the same way that a function is a special case of a relation. 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. Beyond the home domain. No canonical parent is asserted for Profunctor.
Relationships to Other Abstractions¶
Current abstraction Profunctor Domain-specific
Parents (1) — more general patterns this builds on
-
Profunctor is a kind of Functor Domain-specific
Profunctor is a strict kind of Functor: its frozen identity entails the parent's defining structure while adding domain-specific restrictions.
Hierarchy paths (4) — routes to 4 parentless roots
- Profunctor → Functor → Category → Associativity → Invariance
- Profunctor → Functor → Function (Mapping)
- Profunctor → Functor → Category → Closure
- Profunctor → Functor → Category → Associativity → Symmetry
Neighborhood in Abstraction Space¶
Profunctor sits in a crowded region of the domain-specific corpus (39th percentile for distinctiveness): several abstractions share nearly its structure, so a description that fits it tends to fit its neighbors too.
Family — Algebraic Structures & Order Relations (18 abstractions)
Nearest neighbors
- Quasi-Frobenius Lie algebra — 0.89
- Rooted product of graphs — 0.89
- Typing Environment — 0.87
- Algebraic Structure — 0.87
- Adequate subcategory — 0.87
Computed from structural-signature embeddings · 2026-10-08