Skip to content

Quantaloid

A category with complete ordered hom-sets in which typed composition preserves arbitrary joins separately in each argument.

Version
v1 · 2026-10-31 · History
Domain-specific #
14559
Domain group
Formal Sciences
Origin domain
Mathematics
Subdomain
Enriched Category Theory → Mathematics

Core Idea

A quantaloid is a category whose hom-sets are complete join-lattices and whose typed composition preserves arbitrary joins separately in each argument. Arbitrary includes the empty join. Objects can form a proper class under a stated foundation while each hom remains a set.[1]

How would you explain it like I'm…

 

No faithful explanation at this level. All three generators agree that any five-year-old picture (roads between towns, 'putting things together') collapses a quantaloid into a vague combining-information metaphor or a single concrete map, losing that it is a category whose hom-sets are complete join-lattices with composition preserving arbitrary (including empty) joins.

Merge-and-Chain Arrows

Imagine dots with arrows between them, where you can follow one arrow and then another to make a longer trip. In a Quantaloid, the arrows between the same two dots can always be lumped together into one combined arrow, and there is even an 'empty lump' with nothing in it. The key rule is that lumping and chaining get along: chaining with a lump is the same as chaining with each arrow and then lumping the results. One example is 'who is connected to whom' lists, where lumping means putting lists together. A very different example uses distances, where lumping means picking the smallest and chaining means adding.

Join-Ordered Categories

A Quantaloid is a category, a system of objects and arrows that can be composed, with extra order structure on each collection of arrows that share a start and an end. Every family of such parallel arrows, even an infinite or empty family, has a join, a least upper bound in that order. Composition must preserve these joins in each argument separately: composing f with the join of some g's equals the join of the composites. In the category of relations, the arrows are relations and the join is union. In a one-object cost example, arrows are nonnegative numbers (or infinity) ordered backwards, so the join is the infimum and composition is addition. These are two complete instances of the same definition, not metaphors.

 

A Quantaloid is a category in which each hom-set (the arrows from a fixed source to a fixed target) is a complete lattice, so arbitrary joins of parallel arrows exist, including the empty join (a bottom arrow). Composition must preserve these arbitrary joins in each argument separately: f composed with the join of a family equals the join of f composed with each member, and likewise on the other side. Equivalently, it is a category enriched in Sup, the category of complete join-lattices and join-preserving maps. The collection of objects may be a proper class, but each individual hom must be a set; how many objects there are is not part of the definition. In Rel, objects are sets, arrows are binary relations, joins are unions and composition is relational composition. In a one-object cost quantaloid, arrows are extended nonnegative reals ordered in reverse, so joins are infima and composition is addition. Both are genuine quantaloids, not loose metaphors for combining information.

Structural Signature

  • Typed arrows: objects have hom-sets of arrows with fixed source and target; compatible arrows compose.
  • Local complete order: each hom-set has joins of all set-indexed families of parallel arrows, including a bottom arrow as the empty join.
  • Category laws: composition is associative and each object has a two-sided identity.
  • Separate join preservation: fixing an arrow on either side, composition preserves joins in the other argument. Empty joins give bottom absorption.[1]

What It Is Not

An ordinary category need not have complete ordered homs, and a complete lattice alone need not have typed category composition. A quantaloid is also distinct from a category enriched in it. Stubbe shows that the category Dist(Q), whose objects are Q-categories and whose arrows are distributors, is itself a quantaloid distinct from its base Q.[1] A one-object quantaloid is a unital quantale; an endohom of a many-object quantaloid does not contain all its other typed homs.[1]

Examples

Relations. Sets are objects and binary relations are arrows. Parallel relations join by union, composition is relational composition and equality relations are identities. Arbitrary unions are preserved separately by composition.[2]

One-object costs. Use extended nonnegative numbers in reverse numerical order for the single hom. Joins are numerical infima, composition is extended addition and the identity is zero; the empty join is infinity. This is a mathematical example, not a measured cost study.[1][2]

Reasoning and Boundary

Check types, all joins including the empty one, the category laws, and both separate composition laws. Their strength yields typed residuals for solving composition inequalities; it does not make every arrow invertible. A generic category of sets and functions does not substitute for relations: arbitrary unions of functions need not be functions.[1][2]

Neighborhood in Abstraction Space

Quantaloid sits in a sparse region of the domain-specific corpus (85th percentile for distinctiveness): few abstractions share its structure, so a faithful description tends to retrieve it precisely.

Family — Unclustered & Miscellaneous (2835 abstractions)

Nearest neighbors

Computed from structural-signature embeddings · 2026-10-31

References

[1] Isar Stubbe. (2004). “Categorical structures enriched in a quantaloid: categories, distributors and functors,” arXiv:math/0409473v1, posted 24 September 2004, manuscript dated 10 May 2004, original author preprint PDF. Relevant preprint Definition 2.1 p. 4, Lemma 2.2(1) p. 5, Example 2.4 p. 5, Definition 3.1 pp. 6–7, and Proposition 3.4 p. 8. Page numbers refer to the inspected 2004 preprint, not the later journal layout. registry ↩a ↩b ↩c ↩d ↩e ↩f

[2] Christoph Schubert. (2006). Lax Algebras — A Scenic Approach, doctoral dissertation, Universität Bremen, Lax Algebras — A Scenic Approach. Relevant pp. 13, 31, 38–39: relations, Definition 1.4.1, Example 1.5.8(3), and matrix Equations (1.10)–(1.11). Its additional commutative and nontrivial quantale conventions concern that author's chosen examples and do not define all quantaloids. registry ↩a ↩b ↩c