nLab
cartesian bicategory

Idea

A cartesian bicategory is a bicategory with properties that make it behave like a bicategory of generalized relations. The bicategory of relations of a regular category, the bicategory of spans in a finitely complete category, and the bicategory of modules (profunctors) in a finitely complete category are all examples of cartesian bicategories.

The rough idea is that a cartesian bicategory, viewed as an abstract bicategory of relations, should possess a tensor product which behaves like cartesian product on relations, and therefore like a categorical product for relations that are “functional”. The structure of such a tensor is property-like (is essentially unique when it exists). Like allegories, cartesian bicategories provide a convenient abstract setting in which to study the calculus of relations, but unlike allegories they embrace other important examples like Span and Mod.

The original idea, as explained by Carboni and Walters in their paper, clearly had these various examples in mind but was initially confined to the locally posetal case; in part this was due to the lack at the time (circa 1987) of a complete definition of symmetric monoidal bicategories. In more recent years a full bicategorical treatment has emerged, due principally to Carboni, Kelly, Verity, and Wood. The alternative treatment we give below has not yet appeared in the literature as far as this author (Todd Trimble) is aware.

Technical preliminaries

Note: All compositions will be written in the traditional order, in which application proceeds from right to left.

We work with familiar notions of the theory of bicategories (which, for reasons of consonance with 2-terminology, we also call 2-categories) but in some cases under new names. We calculate with pasting diagrams in 2-categories as if they were strict 2-categories.

Our notion of morphism between 2-categories has gone under various names: “homomorphism” in the sense of Bénabou, also known as “pseudofunctor” or weak 2-functor, where the structural constraints are isomorphisms. Here they are simply called 2-functors.

Each 2-category B gives rise to a hom 2-functor hom:B op×BCat, which we denote by B(,), with the contravariant argument in the first place as is customary.

Given 2-functors F,G:BC, it is for our purposes convenient to use the lax notion of morphism θ:FG between 2-functors for which the structural cells θf (for 1-cells f:ab in B) point in the direction

Fa θa Ga Ff θf Gf Fb θb Gb\array{F a & \overset{\theta a}{\to} & G a\\ F f \downarrow & \overset{\theta \cdot f}{\Rightarrow} & \downarrow G f\\ F b & \underset{\theta b}{\to} & G b }

These are called “oplax transformations” by some authors such as Bénabou and “lax transformations” by other authors such as Johnstone; on this page we will simply call them (2-)transformations. A transformation is strong if the structural cells θf are isomorphisms.

There is a well-known notion of morphism between transformation which has been called modification. We retain this usage, but as an aside we counsel against inventing a new term (e.g., “perturbation” between modifications) every time a new level of morphism is reached – a more uniform terminology is called for. The term “transfor” (due to Sjoerd Crans) has been tentatively adopted elsewhere on this site; modifications may then be called 2-transfors.

In any case, given 2-categories B and C, there is a 2-category of 2-functors, strong transformations and modifications from B to C; this will be denoted Hom s(B,C). We have also the 2-category of 2-functors, transformations, and modifications; this will be denoted Hom l(B,C).

2-adjunctions between 2-categories

A 2-adjunction FG consists of 2-functors F:BC, G:CB, and an adjoint equivalence

C(F,)B(,G)C(F -, -) \simeq B(-, G -)

in the 2-category Hom s(B op×C,Cat). In more elementary terms, the data of a 2-adjunction is given by strong transformations

η:1 BGFε:FG1 C\eta: 1_B \to G F \qquad \varepsilon: F G \to 1_C

and invertible modifications (called triangulators)

G ηG GFG F Fη FGF 1 G s Gε 1 F t εF G 1 G G F 1 F F\array{G & \overset{\eta G}{\to} & G F G & & & & F & \overset{F\eta}{\to} & F G F\\ 1_G \downarrow & \overset{s}{\Rightarrow} & \downarrow G \varepsilon & & & & 1_F \downarrow & \overset{t}{\Leftarrow} & \downarrow \varepsilon F\\ G & \underset{1_G}{\to} & G & & & & F & \underset{1_F}{\to} & F }

such that the triangulator coherence conditions hold: there are pasting diagram equalities

1 B η GF 1 GF GF η ηη GFη 1 GF GF ηGF GFGF Gt GF = 1 η 1 GF sF GεF 1 GF GF 1 GF GF 1 GF GF\array{1_B & \overset{\eta}{\to} & G F & \overset{1_{G F}}{\to} & G F\\ \eta \downarrow & \overset{\eta \cdot \eta}{\Rightarrow} & \downarrow G F \eta & & \downarrow 1_{G F}\\ G F & \underset{\eta G F}{\to} & G F G F & \overset{G t}{\Rightarrow} & G F & & & = & 1_{\eta}\\ 1_{G F} \downarrow & & \overset{s F}{\Rightarrow} & G \varepsilon F \searrow & \downarrow 1_{G F} \\ G F & \underset{1_{G F}}{\to} & G F & \underset{1_{G F}}{\to} & G F }

FG 1 FG FG 1 FG FG 1 FG FηG tG 1 FG FG Fs FGFG εFG FG = 1 ε 1 FG FGε εε ε FG 1 FG FG ε 1\array{F G & \overset{1_{F G}}{\to} & F G & \overset{1_{F G}}{\to} & F G\\ 1_{F G} \downarrow & F \eta G \searrow & \overset{t G}{\Rightarrow} & & \downarrow 1_{F G}\\ F G & \overset{F s}{\Rightarrow} & F G F G & \overset{\varepsilon F G}{\to} & F G & & & = & 1_{\varepsilon}\\ 1_{F G} \downarrow & & F G \varepsilon \downarrow & \overset{\varepsilon \cdot \varepsilon}{\Rightarrow} & \downarrow \varepsilon\\ F G & \underset{1_{F G}}{\to} & F G & \underset{\varepsilon}{\to} & 1 }

Lax adjunctions between 2-categories

A lax adjunction is defined in the same way as a 2-adjunction, except that we relax (remove) the assumptions that η and ε are strong and that s, t are invertible; the triangulator coherence conditions are still in effect. In that case, for objects b of B and c of C, there is a local adjunction between hom-categories

(L:B(b,Gc)C(Fb,c))(R:C(Fb,c)B(b,Gc))(L: B(b, G c) \to C(F b, c)) \dashv (R: C(F b, c) \to B(b, G c))

given by L(g:bGc)=(FbFgFGcεcc) and R(f:Fbc)=(bηbGFbGfGc). The unit of LR at g:bGc is given by the pasting

b g Gc 1 Gc Gc ηb ηg ηGc sc 1 Gc GFb GFg GFGc Gε Gc\array{b & \overset{g}{\to} & G c & \overset{1_{G c}}{\to} & G c\\ \eta b \downarrow & \overset{\eta \cdot g}{\Leftarrow} & \downarrow \eta G c & \overset{s c}{\Leftarrow} & \downarrow 1_{G c}\\ G F b & \underset{G F g}{\to} & G F G c & \underset{G \varepsilon}{\to} & G c }

and the counit of LR at f:Fbc is given by the pasting

Fb Fηb FGFb FGf FGc 1 Fb tb εFb εf εc Fb 1 Fb Fb f c\array{F b & \overset{F \eta b}{\to} & F G F b & \overset{F G f}{\to} & F G c\\ 1_{F b} \downarrow & \overset{t b}{\Leftarrow} & \downarrow \varepsilon F b & \overset{\varepsilon \cdot f}{\Leftarrow} & \downarrow \varepsilon c\\ F b & \underset{1_{F b}}{\to} & F b & \underset{f}{\to} & c }

The triangular equations for LR follow from the triangulator coherence conditions. (Warning: it is not generally true that a lax adjunction induces an adjoint pair in Hom l(B op×C,Cat). Cf. lemma 1 below.)

The 2-category Map(B)

Let B be a 2-category. Following Carboni and Walters, we define a map in B to be a 1-cell in B that possesses a right adjoint. It is useful to think of them as playing the role of “functional relations” in an ambient 2-category of relations. We let Map(B) be the locally full sub-2-category whose 0-cells are those of B and whose 1-cells are the maps in B. We observe that every 2-functor F:BC restricts to a 2-functor F:Map(B)Map(C), and by the following proposition, every transformation θ:FG restricts to a strong transformation θ in Hom s(Map(B),C):

Proposition 1: If f:bc is a map in B, then θf is invertible.

Proof: Let f * denote a right adjoint of f. It is easily verified that the diagram

Fb Ff Fc θc Gc 1 Gc Gc 1 Fb Ff * θf * Gf * 1 Gc Fb 1 Fb Fb θb Gb Gf Gc\array{F b & \overset{F f}{\to} & F c & \overset{\theta c}{\to} & G c & \overset{1_{G c}}{\to} & G c\\ 1_{F b} \downarrow & \Rightarrow & F f^* \downarrow & \overset{\theta \cdot f^*}{\Rightarrow} & \downarrow G f^* & \Rightarrow & \downarrow 1_{G c}\\ F b & \underset{1_{F b}}{\to} & F b & \underset{\theta b}{\to} & G b & \underset{G f}{\to} & G c }

pastes to give the inverse (θf) 1, where the left and right squares are the unit and counit of adjunctions FfFf *, GfGf *.

A transformation θ:FG:BC is map-valued if each 1-cell θb is a map in C. By the previous proposition, a map-valued transformation θ in Hom l(B,C) restricts to a strong transformation θ:FG in Hom s(Map(B),Map(C)).

Definition of cartesian structure and basic results

A cartesian structure on a bicategory B consists of the following data:

  • 2-functors :B×BB and I:1B, where 1 is the terminal 2-category;

  • Map-valued transformations

    δ:1 BΔ,π:Δ1 B×B,ε:1 BI!\delta: 1_B \to \otimes \Delta, \qquad \pi: \Delta \otimes \to 1_{B \times B}, \qquad \varepsilon: 1_B \to I !

    where Δ:BB×B is the diagonal 2-functor and !:B1 is the unique 2-functor;

  • Invertible modifications

    δ Δ Δ Δδ ΔΔ I εI I!I 1 s π 1 Δ t πΔ 1 I u Iid 1 Δ 1 Δ Δ I 1 I I\array{\otimes & \overset{\delta \otimes}{\to} & \otimes \Delta \otimes & & & & \Delta & \overset{\Delta \delta}{\to} & \Delta \otimes \Delta & & & & I & \overset{\varepsilon I}{\to} & I ! I\\ 1_{\otimes} \downarrow & \overset{s}{\Rightarrow} & \downarrow \otimes \pi & & & & 1_{\Delta} \downarrow & \overset{t}{\Leftarrow} & \downarrow \pi \Delta & & & & 1_{I} \downarrow & \overset{u}{\Rightarrow} & \downarrow I \cdot id\\ \otimes & \underset{1_{\otimes}}{\to} & \otimes & & & & \Delta & \underset{1_{\Delta}}{\to} & \Delta & & & & I & \underset{1_I}{\to} & I }

    satisfying the triangulator coherence conditions.

The crucial observation is that, by proposition 1, this data restricts to give 2-adjunctions

(Map(B)ΔMap(B)×Map(B))(Map(B)×Map(B)Map(B))(Map(B) \overset{\Delta}{\to} Map(B) \times Map(B)) \dashv (Map(B) \times Map(B) \overset{\otimes}{\to} Map(B))
(Map(B)!1)(1IMap(B))(Map(B) \overset{!}{\to} \mathbf{1}) \dashv (\mathbf{1} \overset{I}{\to} Map(B))

making the restriction of to Map(B) a 2-product on Map(B) with 2-terminal object I. Naturally this finite 2-product structure on Map(B) is property-like: is uniquely determined up to equivalence which is uniquely specified up to unique isomorphism.

A little later we will argue that cartesian structure on the full bicategory B is also property-like; the main thing is to see that the way in which acts on 1-cells is essentially uniquely determined.

Symmetric monoidal structure via cartesian structure

We now argue that a cartesian bicategory B carries a symmetric monoidal structure whose tensor product is

:B×BB\otimes: B \times B \to B

The proof is pretty easy to sketch, once the fact is admitted that the induced 2-product structure makes Map(B) a symmetric monoidal bicategory. This fact about 2-products, while never in dispute, was given a complete proof only in the past few years by the late Max Kelly, and we freely take advantage of it below.

First, given objects a,b,c of B, we may regard them as objects of Map(B), where there is an associativity constraint

α a,b,c:(ab)ca(bc)\alpha_{a, b, c}: (a \otimes b) \otimes c \to a \otimes (b \otimes c)

on Map(B) which is definable by exploiting 2-universal properties of the 2-product. The associativity thus has an expression in terms of , δ, and π which are globally defined on B, hence α is globally defined as a transformation on B. By similar considerations, the symmetry and unit constraints on Map(B) also extend to globally defined transformations on B. We argue in a moment that these constraints are strong (adjoint) equivalences.

Symmetric monoidal structure on B also demands various structural modifications (such as a Yang-Baxter modification R ,) satisfying various coherence conditions, but the components of such modifications (R ab,c, say) are defined by regarding their components a,b,c as objects of Map(B) and using the corresponding modifications there. Again, each such modification on Map(B) is defined in terms of 2-adjunction data , I, δ, π, ε, s, t, u which are globally defined on B, so each such structure is a modification on B. Various coherence conditions on the modifications must be checked, but the conditions hold at every choice of objects of B by regarding them as objects of Map(B) and using the symmetric monoidal structure there, so the conditions hold on B.

Now we check that the structural transformations α are strong adjoint equivalences. Indeed, when regarded as being defined on Map(B), the constraint α is an equivalence and so has a left adjoint (with invertible unit and counit) α with components

α a,b,c :a(bc)(ab)c\alpha_{a, b, c}^{-}: a \otimes (b \otimes c) \to (a \otimes b) \otimes c

and just like α, α is definable in terms of global structure on B, making α a transformation on B. Then α, and by similar reasoning the symmetry and unit constraints, are strong transformations on B by the following lemma:

Lemma 1: If α is a right adjoint in Hom l(C,B), then the transformation α is strong. Consequently, if α α is an adjoint equivalence, so that both α α and αα , then α α is a strong adjoint equivalence in Hom s(C,B).

Proof: Only the first statement requires proof. Given r:cd in C, let ev c:Hom l(C,B)B denote the 2-functor which evaluates at c (keep in mind that the 1-cells in Hom l(C,B) are transformations which are oplax in the sense of Bénabou), and let ev r:ev cev d denote the evident transformation; this is lax in the sense of Bénabou. Then, by dualizing proposition 1, ev r(α)=αr is an isomorphism if α is a right adjoint. Since αr is an isomorphism for all 1-cells r in C, it follows that α is strong.

This completes the argument that the symmetric monoidal structure on Map(B) extends to B.

Comparison with Carboni-Walters

Let us begin unpacking the terse definition of cartesian bicategory so that it becomes more recognizable. For the sake of notational convenience, we use the fact that as a monoidal bicategory, a cartesian bicategory may be strictified and replaced by a (monoidally biequivalent) Gray monoid B. That is to say, if G denotes the tensor product of the symmetric monoidal closed category Gray, then there is firstly a biequivalence B×BB GB, and we may transfer the data of the cartesian structure across this biequivalence to get a Gray monoid multiplication

:B GBB\otimes: B \otimes_G B \to B

together with a corresponding diagonal

BΔB×BB GBB \overset{\Delta}{\to} B \times B \simeq B \otimes_G B

which we again denote by Δ. In that case, given a 1-cell r:ab in B, we may write structure cells δr for the transformation δ:1 BΔ in the form

a δa aa r δr rr b δb bb\array{a & \overset{\delta a}{\to} & a \otimes a\\ r \downarrow & \overset{\delta \cdot r}{\Rightarrow} & \downarrow r \otimes r\\ b & \underset{\delta b}{\to} & b \otimes b }

where to be definite we make the convention that rr:=(r1)(1r).

An object c of B, viewed as an object of a 2-category Map(B) with 2-products, naturally carries a 2-comonoid (or pseudocomonoid) structure; the unit of the 2-adjunction Δ is the diagonal map

δc:ccc,\delta c: c \to c \otimes c,

i.e., the 2-comonoid comultiplication. The unit of the 2-adjunction !I is the projection to the 2-terminal object

εc:cI,\varepsilon c: c \to I,

i.e., the 2-comonoid counit. (It is more usual to denote a (2-)terminal object by the symbol 1, and from here on we will follow that practice, writing the projection as εc:c1, and forget I.)

Spelling this out a little further, let us turn attention to the transformation π:Δ1 B GB. The components of the transformation take the form

π(a,b)=π 1,π 2:(ab,ab)(a,b)\pi (a, b) = \langle \pi_1, \pi_2 \rangle: (a \otimes b, a \otimes b) \to (a, b)

where, as a consequence of how the 2-product on Map(B) is defined, we have the following formulas for the projections π 1, π 2:

π 1=(ab1 aεa1a);π 2=(abε1 b1bb\pi_1 = (a \otimes b \overset{1_a \otimes \varepsilon}{\to} a \otimes 1 \cong a); \qquad \pi_2 = (a \otimes b \overset{\varepsilon \otimes 1_b}{\to} 1 \otimes b \cong b

Thus, the unit and counit data δ, π are expressible in terms of the symmetric monoidal 2-category structure and the comonoid structures on the objects therein.

Finally, for a given 1-cell r:cd in B, the structure cells

c δc cc c εc 1 r δr rr r εr id 1 d δd dd d εd 1\array{c & \overset{\delta c}{\to} & c \otimes c & & & & c & \overset{\varepsilon c}{\to} & 1\\ r \downarrow & \overset{\delta \cdot r}{\Rightarrow} & \downarrow r \otimes r & & & & r \downarrow & \overset{\varepsilon \cdot r}{\Rightarrow} & \downarrow id_1\\ d & \underset{\delta d}{\to} & d \otimes d & & & & d & \underset{\varepsilon d}{\to} & 1 }

exhibit r:cd as a colax morphism of 2-comonoids; if r is a map, then δr and εr are isomorphisms and r becomes a strong morphism of 2-comonoids. This may be appreciated more fully by considering specific examples such as B=Rel (where maps are functions, which become comonoid morphisms by virtue of naturality of diagonal and projection maps), and B=Mod.

Carboni and Walters define a cartesian bicategory to be a symmetric monoidal bicategory in which each object carries a 2-comonoid structure (for which the comultiplication and counit are maps), and each 1-cell is a colax morphism between the corresponding comonoid structures. However, spelling this approach out in full detail leads to a rather largish definition; it seems more efficient to approach the definition by taking advantage of some high-level 2-categorical algebra as we have done here, and deriving the structures envisaged by Carboni and Walters as a consequence.

Local cartesian products

The definition of cartesian structure a fortiori involves lax adjunctions (in the sense explained earlier)

Δ lax:B×BB! laxI:1B\Delta \dashv_{lax} \otimes: B \times B \to B \qquad ! \dashv_{lax} I: \mathbf{1} \to B

and by our earlier discussion of lax adjunctions, this means we have local 1-adjunctions of the form

(B(a,bc)(B×B)(a,a,b,c))(B×B)(a,a,b,c))B(a,bc))(B(a, b \otimes c) \to (B \times B)(\langle a, a \rangle, \langle b, c \rangle)) \dashv (B \times B)(\langle a, a \rangle, \langle b, c \rangle)) \to B(a, b \otimes c))

Been sitting on this for weeks doing nothing; will return to it soon.