ScalingStacks

5. Correspondences and the category Gauntn\gaunt_{n}[0MLT]

The category Catn\cat_{n} is cartesian closed, which means that for each strict nn-category XX, the endo-functor (−)×X(-)\times X admits a right adjoint, Hom¯⁡(X,−)\uHom(X,-). The strict nn-categories Hom¯⁡(X,Y)\uHom(X,Y) make Catn\cat_{n} enriched in itself, and thus it can be regarded as a large strict (n+1)(n+1)-category.

The category Gauntn\gaunt_{n}, as a full subobject of Catn\cat_{n}, is likewise a large strict (n+1)(n+1)-category. Moreover the nn-category Hom¯⁡(X,Y)\uHom(X,Y) is gaunt whenever YY is gaunt, making Gauntn\gaunt_{n} itself cartesian closed. In fact, if we replace Gauntn\gaunt_{n} by a skeleton, then it is a large gaunt (n+1)(n+1)-category, though we will not need this observation.

If XX is a strict nn-category (possibly large) then we may consider the slice category (Gauntn/X)(\gaunt_{n}/X) of gaunt nn-categories equipped with a functor to XX. This is naturally enriched in Catn\cat_{n} as well and hence also a (large) (n+1)(n+1)-category. If p0:A0→Xp_{0}:A_{0}\to X and p1:A1→Xp_{1}:A_{1}\to X are in (Gauntn/X)(\gaunt_{n}/X), then the Catn\cat_{n}-enriched hom from p0p_{0} to p1p_{1} is given by the following pull-back:

Hom¯⁡(p0,p1)\uHom(p_{0},p_{1})Hom¯⁡(A0,A1)\uHom(A_{0},A_{1})pt\mathrm{pt}Hom¯⁡(A0,X)\uHom(A_{0},X)p0p_{0}(p1)∗(p_{1})_{*}⌜\ulcorner
[0MI9]

Definition 5.1. A correspondence (or kk-correspondence, for clarity) of gaunt nn-categories is an object of the overcategory (Gauntn/Ck)(\gaunt_{n}/C_{k}). In other words, a kk-correspondence of gaunt nn-categories is a gaunt nn-category MM along with a functor M→CkM\to C_{k}.

[0MIA]

Remark 5.2. By Lemma 3.5 Gauntn\gaunt_{n} is locally finitely presentable. It follows (see [1, Corollary 2.44, 2.47]) that each of the categories of kk-correspondence is also locally finitely presentable.

Given two kk-correspondences M→CkM\to C_{k} and N→CkN\to C_{k}, we may form the product correspondence M×CkNM\times_{C_{k}}N. This is the product in the category (Gauntn/Ck)(\gaunt_{n}/C_{k}) of kk-correspondences.

The terminology and connection to the classical theory of correspondences is made more clear by introducing the following category.

[0MIB]

Definition 5.3. Define Corrn0:=Gauntn\corr_{n}^{0}\mathrel{\mathop{:}}=\gaunt_{n}, and for k>0k>0, define Corrnk\corr_{n}^{k} recursively as follows. The objects are triples (X0,X1,F)(X_{0},X_{1},F) consisting of two gaunt nn-categories X0X_{0} and X1X_{1} and a functor

F:X0op×X1→Corrn−1k−1.F\colon X_{0}^{\mathrm{op}}\times X_{1}\to\corr_{n-1}^{k-1}.

(Here op=ρ⁡(1,0,…,0)\mathrm{op}=\rho(1,0,\dots,0) is the opposite obtained by reversing just the 1-morphisms of X0X_{0}.) A morphism (X0,X1,F)→(Y0,Y1,G)(X_{0},X_{1},F)\to(Y_{0},Y_{1},G) is a triple (f0,f1,α)(f_{0},f_{1},\alpha) consisting of functors f0:X0→Y0f_{0}\colon X_{0}\to Y_{0} and f1:X1→Y1f_{1}\colon X_{1}\to Y_{1} and a natural transformation

α:F→G∘(f0op×f1).\alpha\colon F\to G\circ(f_{0}^{\mathrm{op}}\times f_{1}).
[0MIC]

Lemma 5.4. There is a natural equivalence of categories

ϕnk:(Gauntn/Ck)≃Corrnk.\phi_{n}^{k}\colon(\gaunt_{n}/C_{k})\simeq\corr_{n}^{k}.
[0MID]

Proof. The functor ϕn0\phi_{n}^{0} is simply the identity. We now define ϕnk\phi_{n}^{k} recursively. Suppose that k>0k>0, and assume that the equivalence ϕn−1k−1\phi_{n-1}^{k-1} has been defined.

Let us define the functor ϕnk:(Gauntn/Ck)→Corrnk\phi_{n}^{k}\colon(\gaunt_{n}/C_{k})\to\corr_{n}^{k}. For any object p:X→Ckp\colon X\to C_{k} of (Gauntn/Ck)(\gaunt_{n}/C_{k}), let ϕnk​(p)\phi_{n}^{k}(p) be the triple (X0,X1,F)(X_{0},X_{1},F), where X0X_{0} and X1X_{1} are the fibers of pp over 00 and 11, respectively, and the functor F:X0op×X1→Corrn−1k−1F\colon X_{0}^{\mathrm{op}}\times X_{1}\to\corr_{n-1}^{k-1} is the composite ϕn−1k−1∘F′\phi_{n-1}^{k-1}\circ F^{\prime}, where the functor

F′:X0op×X1→(Gauntn−1/Ck−1)F^{\prime}\colon X_{0}^{\mathrm{op}}\times X_{1}\to(\gaunt_{n-1}/C_{k-1})

is defined as follows:

  • •

    For any objects (x0,x1)∈X0op×X1(x_{0},x_{1})\in X_{0}^{\mathrm{op}}\times X_{1}, let F⁡(x0,x1)F(x_{0},x_{1}) be the (n−1)(n-1)-category X⁡(x0,x1)X(x_{0},x_{1}), equipped with the functor X⁡(x0,x1)→Ck​(0,1)=Ck−1X(x_{0},x_{1})\to C_{k}(0,1)=C_{k-1} induced by pp.

  • •

    For any objects (x0,x1)(x_{0},x_{1}) and (y0,y1)(y_{0},y_{1}) of X0op×X1X_{0}^{\mathrm{op}}\times X_{1}, the functor

    X0​(y0,x0)×X1​(x1,y1)→Fun/Ck−1⁡(X⁡(x0,x1),X⁡(y0,y1))X_{0}(y_{0},x_{0})\times X_{1}(x_{1},y_{1})\to\Fun_{/C_{k-1}}(X(x_{0},x_{1}),X(y_{0},y_{1}))

    is simply composition.

For any commutative triangle

X{\lx@inpgf@ignorespaces X}Y{\lx@inpgf@ignorespaces Y}Ck{\lx@inpgf@ignorespaces C_{k}}ffppqq

of gaunt nn-categories, we define

ϕnk​(f):=(f0,f1,α):ϕnk​(p)=(X0,X1,F′∘ϕnk)→(Y0,Y1,G′∘ϕnk)=ϕnk​(q),\phi_{n}^{k}(f)\mathrel{\mathop{:}}=(f_{0},f_{1},\alpha)\colon\phi_{n}^{k}(p)=(X_{0},X_{1},F^{\prime}\circ\phi_{n}^{k})\to(Y_{0},Y_{1},G^{\prime}\circ\phi_{n}^{k})=\phi_{n}^{k}(q),

where f0f_{0} and f1f_{1} are the restrictions of ff to the fibers, and α\alpha is the composite ϕn−1k−1∗α′\phi_{n-1}^{k-1}\ast\alpha^{\prime}, in which the natural transformation α′\alpha^{\prime} is the one whose components are given by the functor X⁡(x0,x1)→Y⁡(f⁡(x0),f⁡(x1))X(x_{0},x_{1})\to Y(f(x_{0}),f(x_{1})) induced by ff.

We now construct a quasi-inverse ψnk:Corrnk→(Gauntn/Ck)\psi_{n}^{k}\colon\corr_{n}^{k}\to(\gaunt_{n}/C_{k}) to ϕnk\phi_{n}^{k}. Again, when k=0k=0, we let ψn0\psi_{n}^{0} be the identity, and we proceed recursively. We assume k>0k>0 and that the quasi-inverse ψn−1k−1\psi_{n-1}^{k-1} to ϕn−1k−1\phi_{n-1}^{k-1} has been defined.

For any object (X0,X1,F)∈Corrnk(X_{0},X_{1},F)\in\corr_{n}^{k}, define a gaunt nn-category U⁡(X0,X1,F)U(X_{0},X_{1},F) with object set ob​X0⊔ob​X1\mathrm{ob}X_{0}\sqcup\mathrm{ob}X_{1} and

U⁡(X0,X1,F)​(a,b):={X0​(a,b) if ​a,b∈X0X1​(a,b) if ​a,b∈X1ψn−1k−1​(F⁡(a,b)) if ​a∈X0,b∈X1∅elseU(X_{0},X_{1},F)(a,b)\mathrel{\mathop{:}}=\begin{cases}X_{0}(a,b)&\textrm{ if }a,b\in X_{0}\\ X_{1}(a,b)&\textrm{ if }a,b\in X_{1}\\ \psi_{n-1}^{k-1}(F(a,b))&\textrm{ if }a\in X_{0},b\in X_{1}\\ \varnothing&\textrm{else}\end{cases}

The composition in U⁡(X0,X1,F)U(X_{0},X_{1},F) is the obvious one, and it is clear that this defines a functor U:Corrnk→GauntnU\colon\corr_{n}^{k}\to\gaunt_{n}. We now apply this functor to the terminal object of Corrnk\corr_{n}^{k}, namely the triple (C0,C0,ϕn−1k−1​(Ck−1))(C_{0},C_{0},\phi_{n-1}^{k-1}(C_{k-1})). Since U⁡(C0,C0,ϕn−1k−1​(Ck−1))=CkU(C_{0},C_{0},\phi_{n-1}^{k-1}(C_{k-1}))=C_{k}, it follows that UU factors through a functor ψnk:Corrnk→(Gauntn/Ck)\psi_{n}^{k}\colon\corr_{n}^{k}\to(\gaunt_{n}/C_{k}).

It is now a simple matter to observe that ψnk\psi_{n}^{k} is indeed quasi-inverse to ϕnk\phi_{n}^{k}. ∎

[0MIE]

Remark 5.5. Unwinding the functor ϕnk\phi_{n}^{k} in the argument above, one finds that the product in the category Corrnk\corr_{n}^{k} may be written recursively in the following manner:

(X0,X1,F)×(Y0,Y1,G)≅(X0×Y0,X1×Y1,F⊗G)(X_{0},X_{1},F)\times(Y_{0},Y_{1},G)\cong(X_{0}\times Y_{0},X_{1}\times Y_{1},F\otimes G)

where F⊗GF\otimes G is defined as the composite:

(X0×Y0)op×(X1×Y1)≅(X0op×X1)×(Y0op×Y1)⟶(F,G)Corrn−1k−1×Corrn−1k−1⟶×Corrn−1k−1.(X_{0}\times Y_{0})^{\mathrm{op}}\times(X_{1}\times Y_{1})\cong(X_{0}^{\mathrm{op}}\times X_{1})\times(Y_{0}^{\mathrm{op}}\times Y_{1})\stackrel{{\scriptstyle(F,G)}}{{\longrightarrow}}\corr_{n-1}^{k-1}\times\corr_{n-1}^{k-1}\stackrel{{\scriptstyle\times}}{{\longrightarrow}}\corr_{n-1}^{k-1}.
[0MIF]

Lemma 5.6. The category (Gauntn/Ck)(\gaunt_{n}/C_{k}) of kk-correspondences is cartesian closed.

[0MIG]

Proof. The claim is that for any kk-correspondence N→CkN\to C_{k}, the functor

−×CkN:(Gauntn/Ck)→(Gauntn/Ck)-\times_{C_{k}}N\colon(\gaunt_{n}/C_{k})\to(\gaunt_{n}/C_{k})

admits a right adjoint Hom¯Ck⁡(N,−)\uHom_{C_{k}}(N,-).

Since Gauntn/Ck\gaunt_{n}/C_{k} is locally finitely presentable, it is cocomplete and admits a strong generator [1, Th. 1.20] and is co-wellpowered [1, Th. 1.58]. Thus by the special adjoint functor theorem [30, Sect. V.8] the functor

−×CkN:(Gauntn/Ck)→(Gauntn/Ck)-\times_{C_{k}}N\colon(\gaunt_{n}/C_{k})\to(\gaunt_{n}/C_{k})

admits a right adjoint precisely if it commutes with colimits.

When k=0k=0, this follows from the fact that Gauntn\gaunt_{n} itself is cartesian closed.

For k>0k>0, suppose (Gauntn−1/Ck−1)(\gaunt_{n-1}/C_{k-1}) is cartesian closed. To prove that the category (Gauntn/Ck)(\gaunt_{n}/C_{k}) is cartesian closed, we require a description of colimits in terms of the equivalent category Corrnk\corr_{n}^{k}. For any small category Λ\Lambda and any diagram X:Λ→CorrnkX\colon\Lambda\to\corr_{n}^{k} with

Xλ=(Xλ,0,Xλ,1,Fλ),X_{\lambda}=(X_{\lambda,0},X_{\lambda,1},F_{\lambda}),

it is easy to see that the colimit is given by the triple (X0,X1,F)(X_{0},X_{1},F) where

X0=colimλ∈ΛXλ,0​ and ​X1=colimλ∈ΛXλ,1,X_{0}=\colim_{\lambda\in\Lambda}X_{\lambda,0}\text{\quad and\quad}X_{1}=\colim_{\lambda\in\Lambda}X_{\lambda,1},

and F:X0op×X1→Corrn−1k−1F\colon X_{0}^{\mathrm{op}}\times X_{1}\to\corr_{n-1}^{k-1} is the enriched left Kan extension of

colimλ∈ΛFλ:colimλ∈Λ(Xλ,0op×Xλ,1)→Corrn−1k−1\colim_{\lambda\in\Lambda}F_{\lambda}\colon\colim_{\lambda\in\Lambda}(X_{\lambda,0}^{\mathrm{op}}\times X_{\lambda,1})\to\corr_{n-1}^{k-1}

along the diagonal

colimλ∈Λ(Xλ,0op×Xλ,1)→X0op×X1.\colim_{\lambda\in\Lambda}(X_{\lambda,0}^{\mathrm{op}}\times X_{\lambda,1})\to X_{0}^{\mathrm{op}}\times X_{1}.

Now for any object Y=(Y0,Y1,G)∈CorrnkY=(Y_{0},Y_{1},G)\in\corr_{n}^{k}, we wish to compare (colimλ∈ΛXλ)×Y(\colim_{\lambda\in\Lambda}X_{\lambda})\times Y and colimλ∈Λ(Xλ×Y)\colim_{\lambda\in\Lambda}(X_{\lambda}\times Y). In light of our descriptions of products in Corrnk\corr_{n}^{k}, we see that the former is (X0×Y0,X1×Y1,F⊗G)(X_{0}\times Y_{0},X_{1}\times Y_{1},F\otimes G), and the latter is the colimit of the diagram Z:Λ→CorrnkZ\colon\Lambda\to\corr_{n}^{k} that carries λ\lambda to

(Xλ,0×Y1,Xλ,1×Y1,Fλ⊗G).(X_{\lambda,0}\times Y_{1},X_{\lambda,1}\times Y_{1},F_{\lambda}\otimes G).

Note that, since Gauntn\gaunt_{n} is cartesian closed, one has

colimλ∈Λ(Xλ,0×Y0)≅X0×Y0​ and ​colimλ∈Λ(Xλ,1×Y1)≅X1×Y1;\colim_{\lambda\in\Lambda}(X_{\lambda,0}\times Y_{0})\cong X_{0}\times Y_{0}\text{\quad and\quad}\colim_{\lambda\in\Lambda}(X_{\lambda,1}\times Y_{1})\cong X_{1}\times Y_{1};

hence our description of colimits in Corrnk\corr_{n}^{k} exhibits the colimit of ZZ as (X0×Y0,X1×Y1,(F⊗G)′)(X_{0}\times Y_{0},X_{1}\times Y_{1},(F\otimes G)^{\prime}), where (F⊗G)′(F\otimes G)^{\prime} is the enriched left Kan extension of

colimλ∈Λ(Fλ⊗G):colimλ∈Λ((Xλ,0×Y0)op×(Xλ,1×Y1))→Corrn−1k−1\colim_{\lambda\in\Lambda}(F_{\lambda}\otimes G)\colon\colim_{\lambda\in\Lambda}((X_{\lambda,0}\times Y_{0})^{\mathrm{op}}\times(X_{\lambda,1}\times Y_{1}))\to\corr_{n-1}^{k-1}

along the diagonal

colimλ∈Λ((Xλ,0×Y0)op×(Xλ,1×Y1))→(X0×Y0)op×(X1×Y1).\colim_{\lambda\in\Lambda}((X_{\lambda,0}\times Y_{0})^{\mathrm{op}}\times(X_{\lambda,1}\times Y_{1}))\to(X_{0}\times Y_{0})^{\mathrm{op}}\times(X_{1}\times Y_{1}).

Our induction hypothesis is that Corrn−1k−1\corr_{n-1}^{k-1} is cartesian closed; so this enriched left Kan extension can be identified with the composition of the enriched left Kan extension of

colimλ∈Λ(Fλ,G):colimλ∈Λ(Xλ,0op×Xλ,1)×(Y0op×Y1)→Corrn−1k−1×Corrn−1k−1\colim_{\lambda\in\Lambda}(F_{\lambda},G)\colon\colim_{\lambda\in\Lambda}(X_{\lambda,0}^{\mathrm{op}}\times X_{\lambda,1})\times(Y_{0}^{\mathrm{op}}\times Y_{1})\to\corr_{n-1}^{k-1}\times\corr_{n-1}^{k-1}

along the diagonal

colimλ∈Λ(Fλ,G):colimλ∈Λ(Xλ,0op×Xλ,1)×(Y0op×Y1)→(X0op×X1)×(Y0op×Y1).\colim_{\lambda\in\Lambda}(F_{\lambda},G)\colon\colim_{\lambda\in\Lambda}(X_{\lambda,0}^{\mathrm{op}}\times X_{\lambda,1})\times(Y_{0}^{\mathrm{op}}\times Y_{1})\to(X_{0}^{\mathrm{op}}\times X_{1})\times(Y_{0}^{\mathrm{op}}\times Y_{1}).

But now this left Kan extension is simply the product of GG with the left Kan extension that defines FF. In other words, we have an isomorphism (F⊗G)′≅F⊗G(F\otimes G)^{\prime}\cong F\otimes G, whence the proof is complete. ∎

Original mathematics by the credited authors. Source collection and HTML conversion remain in progress.

Clark Barwick, Christopher Schommer-Pries

Original source: arXiv:1112.0040v6

Original source · 1112.0040v6