Rel, bicategory of relations, allegory
left and right euclidean;
extensional, well-founded relations.
In category theory, an allegory is a category with properties meant to reflect properties that hold in a category Rel of relations. The notion was first introduced (as far as we know) and certainly first made famous in the book Categories, Allegories (Freyd-Scedrov).
Freyd and Scedrov argue that a categorical calculus of relations is an alternative and often more amenable framework for developing concepts traditionally couched in “functional” language (i.e., concepts which apply to sets and functions); for instance, a principal raison d’etre for regular categories is precisely that one can do relational calculus in them (as had been long known, e.g., Saunders MacLane showed how to calculate with relations to do diagram chases in abelian categories). Allegories, and correlative notions such as bicategories of relations, also offer a smooth approach to regular and exact completions, as used for example in the construction of realizability toposes.
A signal feature of allegories is emphasis on the modular law (see def. 1 below), which generalizes the modular law in lattices to more general relations, and which generalizes also so-called Frobenius reciprocity in categorical logic.
An allegory is a (1,2)-category $A$ equipped with an involution $(-)^o \colon A^{op} \to A$ which is the identity on objects, such that
If $C$ is a regular category and $Rel(C)$ is the locally posetal bicategory of relations, then $Rel(C)$ is an allegory.
Any first-order hyperdoctrine with equality similarly gives rise to an allegory, as does any abstract bicategory of relations in the sense of Carboni-Walters.
Any modular lattice can be regarded as a one-object allegory if we take composition to be union and the involution to be the identity.
A map in an allegory is a morphism that has a right adjoint. If $r \dashv s$, then $s = r^o$ (hint: use the modular law to show $r \dashv s \cap r^o$ and $r \cap s^o \dashv s$).
Any 2-category has a bicategory of maps. In an allegory, the ordering between maps is discrete, meaning that if $f \leq g$ then $f = g$. Consequently, the bicategory of maps of an allegory is a category.
A tabulation of a morphism $\phi$ is a pair of maps $f,g$ such that $\phi = g^o f$ and $f^o f \cap g^o g = 1$. An allegory is tabular if every morphism has a tabulation, and pretabular if every morphism is contained in one that has a tabulation.
Every regular category, and indeed every locally regular category, has a tabular allegory of internal binary relations. Conversely, by restricting to the morphisms with left adjoints (“maps”) in a tabular allegory, we obtain a locally regular category. These constructions are inverse, so tabular allegories are equivalent to locally regular categories.
A locally regular category has finite products if and only if its tabular allegory of relations has top elements in its hom-posets.
Finally, a unit in an allegory is an object $U$ such that $1_U$ is the greatest morphism $U\to U$, and every object $X$ admits a morphism $\phi\colon X\to U$ such that $1_X\le \phi^o\phi$. A locally regular category has a terminal object (hence is regular) if and only if its tabular allegory of relations has a unit.
Thus, regular categories are equivalent to unital (or unitary) tabular allegories. For more details, see Categories, Allegories, the Elephant, or Theory of units and tabulations in allegories.
A union allegory is an allegory whose hom-posets have finite joins that are preserved by composition. Thus a union allegory is locally a lattice. If additionally it is locally a distributive lattice, it is called a distributive allegory. The category of maps in a unitary tabular union allegory is a coherent category (a “pre-logos”), and conversely the bicategory of relations in a coherent category is a (unitary tabular) distributive allegory. In particular, every unitary tabular union allegory is distributive, but in the non-tabular case this can fail: for instance, any modular lattice can be regarded as a one-object union allegory and need not be distributive.
A division allegory is a distributive allegory in which composition on one (and therefore the other) side has a right adjoint (left or right division). That is: given $r: A \to B$ and $s \colon A \to C$, there exists $r/s: B \to C$ such that
(so that $- \circ r$ has right adjoint $-/r$: an example of a right Kan extension). Composition on the other side, $r \circ -$, has a right adjoint (an example of a right Kan lift) given by
In the bicategory of sets and relations, with notation as above, we have
where $r(a, b)$ is shorthand for “$(a, b)$ belongs to $r$”.
The category of maps (functional relations) of a unitary/unital tabular division allegory is a logos, and conversely the bicategory of relations in a logos is a unitary tabular division allegory. (Categories, Allegories, 2.32, page 227.)
A power allegory is, more or less, an allegory $\mathcal{A}$ such that the inclusion functor $i: Map(\mathcal{A}) \to \mathcal{A}$ has a right adjoint $P$. The idea is that $P$ assigns to an object $A$ a power object $P(A)$, as in topos theory; if we summarize the notion of topos as a regular category $\mathbf{E}$ for which the inclusion $i: \mathbf{E} \to Rel(\mathbf{E})$ has a right adjoint $P$, then it becomes apparent that the notion of power allegory is similar except that it takes the “relation side” as primary and derives the “function side” as $Map(\mathcal{A})$, whereas in topos theory it’s just the other way around. But in either case the adjunction $i \dashv P$ is fundamental.
Since the inclusion $i$ is the identity on objects, the counit of the adjunction $i \dashv P$ at an object $B$ may be written
and we have a kind of comprehension scheme that to each $r: A \to B$ there is a unique map $\chi_r: A \to P(B)$, the characteristic map of $r$, such that $r = \ni_B \circ \chi_r$. (If $A$ and $B$ are related by a property $r$, then for each $a$ there is a subobject $\chi_r(a)$ of $B$ consisting of elements $b$ so related to $a$.) In the case $r = 1_A: A \to A$, the characteristic map $\chi_{1_A}: A \to P(A)$ is called the singleton map of $A$, and more general $\chi_r$ may be defined as $P(r) \sigma_A$.
The exact definition of power allegory is a matter for consideration. One can get a certain distance just by adopting the naive definition suggested above, that a power allegory is nothing more than an allegory for which the inclusion $Map(\mathcal{A}) \to \mathcal{A}$ has a right adjoint $P$. (Below we introduce a similar notion that we call a $P$-allegory.) But it seems hard to develop a theory from the naive notion that rises to a level comparable to topos theory.
Freyd and Scedrov start with a structure of division allegory (thus packing in a good amount of internal logic from the start) and introduce the fundamental adjunction $i \dashv P$ in terms of that structure. For them, a power allegory is defined to be a division allegory which associates to each object $B$ a morphism $\ni_B \colon P(B) \to B$ such that for all $r \colon A \to B$
which expresses the truth of the formula $\forall_{a \colon A} \exists_{S: P(B)} \forall_{b \colon B} S \ni_B b \Leftrightarrow r(a, b)$, and
which internalizes an axiom of extensionality, which reads $\forall_{b \colon B} (S \ni_B b) \Leftrightarrow (T \ni_B b) \vdash S = T$. Given those axioms, and given $r: A \to B$, one may define
which internalizes the formula-definition $\chi_r(a, S) \coloneqq \forall_b S \ni_B b \Leftrightarrow r(a, b)$, and then show $\chi_r$ is a map. (See Categories, Allegories, pp. 235-236.)
The bicategory of relations in a topos is a power allegory; conversely, the category of maps in a unitary tabular power allegory is a topos.
Nevertheless, the spare elegance of the naive definition gives one something to shoot for. It appears that quite a decent theory can be developed just by adding the assumption of coproducts in an allegory: a reasonable and fairly mild assumption. (Most allegories don’t admit many colimits; for example having coequalizers is pretty rare. But the standard examples do have finite coproducts, coinciding with coproducts on the maps/functional side.)
A $P$-allegory is an allegory $\mathcal{A}$ with finite coproducts^{1} for which the inclusion $i: Map(\mathcal{A}) \to \mathcal{A}$ has a right adjoint $P$.
As before, the counit is denoted $\ni: i P \to 1_{\mathcal{A}}$. It is perhaps surprising that the notion of $P$-allegory is at least as strong as power allegory in the Freyd-Scedrov sense:
Any $P$-allegory is a division allegory in which the Freyd-Scedrov conditions on $\ni$ are satisfied.
For now we content ourselves with a description of the division structure. Let $r: A \to C$ and $s: B \to C$ be morphisms; we construct a right Kan lift $s \backslash r$ of $r$ through $s$. This means that for all $t: A \to B$ we have $s \circ t \leq r$ if and only if $t \leq s \backslash r$. We begin by constructing the right Kan lift for the case $r = s = \ni_C: P C \to C$.
Define the internal union $\bigcup_C$ by $\bigcup_C = P(\ni_C): P P C \to P C$, and define an internal order relation $[\Rightarrow]_C: P C \to P C$ by $P C \stackrel{\in_{P C}}{\to} P P C \stackrel{\bigcup_C}{\to} P C$. (Here $\in \coloneqq \ni^o$.) Define $[\Leftarrow]_C \coloneqq [\Rightarrow]_C^o$.
We now show $[\Leftarrow]_C = \ni_C \backslash \ni_C$. That is, for $R: P C \to P C$, we show $\ni_C R \leq \ni_C$ is equivalent to $R \leq [\Leftarrow]$. The backward implication is easy; for the forward implication, one may prove it first for reflexive $R$ where we have an actual equation $\ni_C R = \ni_C$. It follows that $P(\ni_C) P(R) = P(\ni_C)$, whence $P(R) \leq \bigcup_C^o \bigcup_C$. A short calculation then yields $R = \ni_C P(R) \sigma_{P C} = \ni_C \bigcup_C^o \bigcup_C \sigma_{P C} = \ni_C \bigcup_C^o = [\Leftarrow]$. The case for general $R$ reduces to the reflexive case: form the reflexive completion $1 \vee R$ as the composite
which is where coproducts come in; here $\nabla$ is the codiagonal and we use the fact that $C + C$ in an allegory is a biproduct to form the pairing for the first arrow. It is easy to show that $\ni_C(1 \vee R) = \ni_C \vee \ni_C R = \ni_C$, and then we derive $R \leq 1 \vee R \leq [\Leftarrow]$ from before. Thus we have shown $[\Leftarrow]_C = \ni_C \backslash \ni_C$.
For general $r: A \to C, s: B \to C$, we claim the right Kan lift $s \backslash r: A \to B$ is given by $\chi_s^o (\ni_C \backslash \ni_C) \chi_r$. For, we have $r = \ni_C \chi_r$, whence
thus proving the claim.
Further details may be found here.
Thus the notion of $P$-category is just as strong as the Freyd-Scedrov notion of power allegory, and one can then piggy-back on their further developments.
Let $T$ be a regular theory. There is then an allegory $\mathcal{A}_T$ given as follows:
the objects are finite strings of sorts of $T$;
a morphism $\vec X \to \vec Y$ is a predicate $P(\vec x, \vec y)$ of sort $\vec X, \vec Y$ (or rather a provable-equivalence class of such predicates);
the identity $\vec X \to \vec X$ is (named by) $x_1 = x_1 \wedge x_2 = x_2 \wedge \cdots \wedge x_n = x_n$;
the composite of $R \colon \vec X \to \vec Y$ and $S \colon Y \to \vec X$ is named by $\exists \vec y. R(\vec x, \vec y) \wedge S(\vec y, \vec z)$.
That $\mathcal{A}_T$ is an allegory is B.311 in Freyd–Scedrov; that it is in fact unitary and pre-tabular is B.312.
Further structure on $T$ gives rise to further structure on $\mathcal{A}_T$ (B.313): if $T$ is a coherent, first-order or higher-order theory, then $\mathcal{A}_T$ will be a distributive, division or power allegory respectively.
Every pre-tabular allegory has a tabular completion, given by splitting its coreflexive morphisms (i.e. those endomorphisms $R$ such that $R \subset id$). The category of maps in the coreflexive splitting of $\mathcal{A}_T$ is precisely the syntactic category of $T$.
There are two possible ways to interpret a regular formula of the form $\exists y. R(x,y) \wedge S(y,z)$ in a unitary pre-tabular allegory, if $R$ and $S$ are interpreted as $r \colon X \to Y$ and $s \colon Y \to Z$ respectively: as the composite $s \cdot r$, or more ‘literally’ by:
pulling $r$ and $s^o$ back to the same hom set and taking their intersection: $(p_1^o r p_1) \cap (p_2^o s^o p_2) \colon X \times Z \to Y \times Y$;
then forcing the two $Y$s to be equal by post-composing with $\Delta_Y^o \colon Y \times Y \to Y$, applying the existential quantifier by post-composing with the unique map $!_Y$ to the unit, and post-composing with $!_Z^o$ to get a morphism into $Z$;
then forcing the $Z$ in the domain to be equal to the $Z$ in the codomain by taking the meet with $p_2 \colon X \times Z \to Z$;
and finally pulling back along (precomposing with the right adjoint of) $p_1 \colon X \times Z \to X$ to get a morphism $X \to Z$.
We would like to know that these morphisms are equal, so that an existential formula will have a unique interpretation:
We show inclusion in each direction.
Firstly, $s r = s r \cap p_2 p_1^o$, because the product projections tabulate the top morphism. Notice also that the RHS above is equal to
where $\top_{Y Z}$ is the top morphism $Y \to Z$.
Now we can calculate:
In the other direction, we have
and we are back to where we started. In the fourth-last step we used the fact that if $p_1, p_2 \colon Z \times Z \to Z$ are the projections, then $p_1 \cap p_2 = \Delta^o$. But $\Delta = \langle id, id \rangle$, and from lemma 1 here we have that $\langle id, id \rangle = p_1^o \cap p_2^o$.
Other attempted axiomatizations of the same idea “something that acts like the category of relations in a regular category” include:
bicategory of relations (a special sort of cartesian bicategory)
Discussion of the relation between pretabular unitary allegories and bicategories of relations, and also between tabular unitary allegories and regular categories is in
The standard monograph is
The notion is discussed also in chapter A3 of
In
it is shown that any bicategory of relations is an allegory.
See also
An introduction headed towards applications in computer science and, in particular, fuzzy controllers can be found in
We mean coproducts as certain conical colimits qua $Pos$-enriched categories. ↩
Last revised on March 27, 2017 at 04:58:30. See the history of this page for a list of all contributions to it.