ScalingStacks

6. The categories Θn\Theta_{n} and Υn\Upsilon_{n}[0MLU]

For many purposes, it is unwieldy to contemplate all gaunt nn-categories (or even all compact gaunt nn-categories). The critical structural features of nn-categories are already captured by far smaller categories. One such smaller category is Joyal’s category Θn\Theta_{n} of ‘nn-disks’ (Definition 6.1):

[0MIH]

Definition 6.1 ([9, Definition 3.1]). Let CC be a small category. The wreath product Δ≀C\Delta\wr C is the category

  • •

    whose objects consist of tuples ([n],c1,…,cn)([n];c_{1},\dots,c_{n}) where [n]∈Δ[n]\in\Delta and ci∈Cc_{i}\in C, and

  • •

    whose morphisms from ([m],a1,…,am)([m];a_{1},\dots,a_{m}) to ([n],b1,…,bn)([n];b_{1},\dots,b_{n}) consist of tuples (ϕ;ϕi​j)(\phi;\phi_{ij}), where ϕ:[m]→[n]\phi:[m]\to[n], and ϕi​j:ai→bj\phi_{ij}:a_{i}\to b_{j} where 0<i≤m0<i\leq m, and ϕ⁡(i−1)<j≤ϕ⁡(i)\phi(i-1)<j\leq\phi(i).

The category Θn\Theta_{n} is now defined inductively as a wreath product: Θ1=Δ\Theta_{1}=\Delta, and Θn=Δ≀Θn−1\Theta_{n}=\Delta\wr\Theta_{n-1}. In particular this gives rise to embeddings σ:Θn−1→Θn\sigma:\Theta_{n-1}\to\Theta_{n}, given by σ⁡(o)=([1],o)\sigma(o)=([1];o), and ι:Δ→Θn\iota:\Delta\to\Theta_{n} given by ι⁡([n])=([n],([0]),…,([0]))\iota([n])=([n];([0]),\dots,([0])).

There is a fully-faithful embedding i:Θn↪Gauntni\colon\Theta_{n}\hookrightarrow\gaunt_{n} as a dense subcategory [9, Th. 3.7]. The image under ii of ([m],a1,…,am)([m];a_{1},\dots,a_{m}) may be described inductively as the following colimit:

i([m];o1,…,om)=σ(i(o1))∪C0σ(i(o2))∪C0⋯∪C0σ(i(om)).i([m];o_{1},\dots,o_{m})=\sigma(i(o_{1}))\cup^{C_{0}}\sigma(i(o_{2}))\cup^{C_{0}}\cdots\cup^{C_{0}}\sigma(i(o_{m})).

This colimit, taken in Gauntn\gaunt_{n}, is a series of pushouts in which C0C_{0} is embedded into σ⁡(i⁡(ok))\sigma(i(o_{k})) via ⊤\top and into σ⁡(i⁡(ok+1))\sigma(i(o_{k+1})) via ⊥\bot as described after Ex. 2.5. There is no possible confusion by the meaning of σ\sigma, as i⁡(σ⁡(o))=σ⁡(i⁡(o))i(\sigma(o))=\sigma(i(o)) for all o∈Θn−1o\in\Theta_{n-1}.

Since we will be concerned with the study of correspondences, it is convenient to enlarge Θn\Theta_{n} to contain products of correspondences:

[0MII]

Definition 6.2. The category Υn\Upsilon_{n} is the smallest full subcategory of Gauntn\gaunt_{n} that contains Θn\Theta_{n} and is closed under products of correspondences, (M,N)↦M×CkN(M,N)\mapsto M\times_{C_{k}}N.

[0MIJ]

Remark 6.3. We now examine the fiber products of cells in detail. We aim to express these fiber products as simple iterated colimits of cells. Let φ:Ci→Cj\varphi:C_{i}\to C_{j} and ψ:Ck→Cj\psi:C_{k}\to C_{j} be a pair of functors (i,j,k≥0i,j,k\geq 0). A map of cells φ:Ci→Cj\varphi:C_{i}\to C_{j} either factors as a composite Ci→C0→CjC_{i}\to C_{0}\to C_{j} or is a suspension φ=σ⁡(ξ)\varphi=\sigma(\xi) of some map ξ:Ci−1→Cj−1\xi:C_{i-1}\to C_{j-1}.

We thus begin by contemplating the case in which φ\varphi is not the suspension of a map of lower dimensional cells. In this case we have a diagram of pullback squares

Ci×FC_{i}\times FCiC_{i}FFC0C_{0}CkC_{k}CjC_{j}ψ\psi⌜\ulcorner⌜\ulcorner

Here FF is the fiber of ψ:Ck→Cj\psi:C_{k}\to C_{j} over the unique object in the image of φ\varphi. There are four possibilities:

  1. (A)

    The image of ψ\psi may be disjoint from the image of φ\varphi, in which case F=∂C0=∅F=\partial C_{0}=\emptyset. Hence FF and also Ci×FC_{i}\times F are the empty colimit of cells.

  2. (B)

    The fiber may be a zero cell, F=C0F=C_{0}, in which case Ci×F≅CiC_{i}\times F\cong C_{i} is trivially a colimit of cells.

  3. (C)

    The fiber may be the kk-cell F≅CkF\cong C_{k}, but we have i=0i=0. In this case Ci×F≅F≅CkC_{i}\times F\cong F\cong C_{k} is again trivially a colimit of cells.

  4. (D)

    The fiber may be an kk-cell F≅CkF\cong C_{k}, and we have i≥1i\geq 1. In this case we have (cf. [34, Proposition 4.9])

    Ci×Ck≅(Ci∪C0Ck)∪σ⁡(Ci−1×Ck−1)(Ck∪C0Ci)C_{i}\times C_{k}\cong(C_{i}\cup^{C_{0}}C_{k})\cup^{\sigma(C_{i-1}\times C_{k-1})}(C_{k}\cup^{C_{0}}C_{i})

    where for each pushout Cx∪C0CyC_{x}\cup^{C_{0}}C_{y}, the object C0C_{0} is included into the final object of CxC_{x} and the initial object of CyC_{y}.

As the suspension functor σ\sigma commutes with pullback squares, a general pullback of cells is the suspension of one of the types just considered. Moreover, as the suspension functor also commutes with pushout squares, the above considerations give a recipe for writing any fiber product of cells as an iterated pushout of cells. This will be made precise in Lemma 6.7.

[0MIK]

Notation 6.4. The inclusion Υn↪Gauntn\Upsilon_{n}\hookrightarrow\gaunt_{n} induces a fully faithful nerve functor

ν:Gauntn↪Fun⁡(Υnop,Set).\nu:\gaunt_{n}\hookrightarrow\Fun(\Upsilon_{n}^{\mathrm{op}},\set).

In particular, we may regard gaunt nn-categories as particular presheaves of sets on the category Υn\Upsilon_{n} (precisely which presheaves will be determined in Corollary 10.2). Note that the nerve functor commutes with all limits, hence in particular fiber products.

[0MIL]

Notation 6.5. Let S00S_{00} consist of the union A∪B∪C∪DA\cup B\cup C\cup D of the following four finite sets of maps of presheaves on Υn\Upsilon_{n}:

A:={νCi−1∪ν⁡(∂Ci−1)νCi−1→ν(∂Ci)| 0≤i≤n−1}A\mathrel{\mathop{:}}=\left\{\nu C_{i-1}\cup^{\nu(\partial C_{i-1})}\nu C_{i-1}\to\nu(\partial C_{i})\;|\;0\leq i\leq n-1\right\}

(when i=0i=0, we interpret this as the empty presheaf mapping to the nerve of the empty nn-category),

B:={νCj∪ν​CiνCj→ν(Cj∪CiCj)| 0≤i<j≤n},B\mathrel{\mathop{:}}=\left\{\nu C_{j}\cup^{\nu C_{i}}\nu C_{j}\to\nu(C_{j}\cup^{C_{i}}C_{j})\;|\;0\leq i<j\leq n\right\},
C:={ν(Ci+j∪CiCi+k)∪ν​σi+1​(Cj−1×Ck−1)ν(Ci+k∪CiCi+j)→ν(Ci+j×CiCi+k)| 0≤i≤n, 0<j,k≤n−i},\begin{split}C\mathrel{\mathop{:}}=\Big\{\nu(C_{i+j}\cup^{C_{i}}C_{i+k})\cup^{\nu\sigma^{i+1}(C_{j-1}\times C_{k-1})}\nu(C_{i+k}&\cup^{C_{i}}C_{i+j})\to\nu(C_{i+j}\times_{C_{i}}C_{i+k})\\ &\Big|\;0\leq i\leq n\textrm{, }0<j,k\leq n-i\Big\},\end{split}

and, lastly,

D:={νσk(Δ3)∪ν​σk​(Δ{0,2}⊔Δ{1,3})νσk(Δ0⊔Δ0)→νCk| 0≤k≤n}.D\mathrel{\mathop{:}}=\left\{\nu\sigma^{k}(\Delta^{3})\cup^{\nu\sigma^{k}(\Delta^{\{0,2\}}\sqcup\Delta^{\{1,3\}})}\nu\sigma^{k}(\Delta^{0}\sqcup\Delta^{0})\to\nu C_{k}\;|\;0\leq k\leq n\right\}.

Now let S0S_{0} be the smallest class of morphisms U→VU\to V in Fun⁡(Υnop,Set)\Fun(\Upsilon_{n}^{\mathrm{op}},\set) that (a) is closed under isomorphism, (b) contains S00S_{00}, and (c) is closed under the operation −×CkN-\times_{C_{k}}N for any functor V→CkV\to C_{k} and any kk-correspondence N→CkN\to C_{k} with N∈ΥnN\in\Upsilon_{n}.

[0MIM]

Lemma 6.6. Suppose XX a gaunt nn-category. Then the presheaf ν​X:Υnop→Set\nu X:\Upsilon_{n}^{\mathrm{op}}\to\set is local with respect to the morphisms of S0S_{0}.

[0MIN]

Proof. Forming each of the pushouts of S00S_{00} in Gauntn\gaunt_{n} yields an equivalence, so XX is local with respect to S00S_{00}.

Now let S0′⊆S0S_{0}^{\prime}\subseteq S_{0} denote the class of morphisms f:U→Vf:U\to V in S0S_{0} such that ν​X\nu X is local with respect to ff for any gaunt XX. We have observed that S0′S_{0}^{\prime} contains S00S_{00}. It is also visibly closed under isomorphism.

We complete the proof by showing that S0′S^{\prime}_{0} is closed under the operation −×CiN-\times_{C_{i}}N for any N∈ΥnN\in\Upsilon_{n}. Indeed, suppose U→VU\to V a morphism of S0′S_{0}^{\prime}. We claim that for any morphism V→CkV\to C_{k} and any functor N→CkN\to C_{k}, the map

Υn​(V×CkN,X)→Υn​(U×CkN,X)\Upsilon_{n}(V\times_{C_{k}}N,X)\to\Upsilon_{n}(U\times_{C_{k}}N,X)

is a bijection. For each W∈ΥnW\in\Upsilon_{n}, we have

Gauntn⁡(W×CiN,X)\displaystyle\gaunt_{n}(W\times_{C_{i}}N,X) ≅(Gauntn/Ck)​(W×CkN,X×Ck)\displaystyle\cong(\gaunt_{n}/C_{k})(W\times_{C_{k}}N,X\times C_{k})
≅(Gauntn/Ck)​(W,Hom¯Ck⁡(N,X×Ck)),\displaystyle\cong(\gaunt_{n}/C_{k})(W,\uHom_{C_{k}}(N,X\times C_{k})),

where Hom¯Ck⁡(N,−)\uHom_{C_{k}}(N,-) denotes the right adjoint of Lemma 5.6. The claim now follows from the observation that as Hom¯Ci⁡(N,X×Ci)\uHom_{C_{i}}(N,X\times C_{i}) is gaunt, it is local with respect to U→VU\to V. ∎

[0MIP]

Lemma 6.7. Let

𝒞:=S00−1​Fun⁡(Υnop,Set)\mathcal{C}\mathrel{\mathop{:}}=S_{00}^{-1}\Fun(\Upsilon_{n}^{\mathrm{op}},\set)

denote the full subcategory of presheaves of sets which are local with respect to the the morphisms of S00S_{00}. Let φ:Ci→Cj\varphi:C_{i}\to C_{j} and ψ:Ck→Cj\psi:C_{k}\to C_{j} be an arbitrary pair of maps (i,j,k≥0i,j,k\geq 0). Then ν⁡(Ci×CjCk)\nu(C_{i}\times_{C_{j}}C_{k}) is contained in the smallest full subcategory of 𝒞\mathcal{C} that contains the nerves of cells and is closed under the formation of colimits.

[0MIQ]

Proof. Recall that ν\nu commutes with limits. Let mm (≤i,j,k\leq i,j,k) be the largest integer such that φ=σm​(g)\varphi=\sigma^{m}(g) and ψ=σm​(f)\psi=\sigma^{m}(f) are both mm-fold suspensions of maps, g:Ci−m→Cj−mg:C_{i-m}\to C_{j-m} and f:Ck−m→Cj−mf:C_{k-m}\to C_{j-m}.

Suppose, without loss of generality, that φ\varphi is not an (m+1)(m+1)-fold suspension of a map. We thus have an mm-suspension of the situation considered in Rk. 6.3; that is, we have a diagram of pullback squares

σm​(Ci−m×C0F)\sigma^{m}(C_{i-m}\times_{C_{0}}F)Ci=σm​(Ci−m)C_{i}=\sigma^{m}(C_{i-m})σm​(F)\sigma^{m}(F)Cm=σm​(C0)C_{m}=\sigma^{m}(C_{0})CkC_{k}Cj,C_{j},ψ=σm​(f)\psi=\sigma^{m}(f)σm​(g)\sigma^{m}(g)σm(!)\sigma^{m}(!)⌜\ulcorner⌜\ulcorner

where as above FF denotes the fiber of f:Ck−m→Cj−mf:C_{k-m}\to C_{j-m} over the image of gg. So let us consider each of the cases A-D of Rk. 6.3 in turn.

  1. (A)

    If F=∅F=\emptyset, then

    Ci×CjCk≅σm​(Ci−m×C0F)≅σm​(∅)≅∂Cm.C_{i}\times_{C_{j}}C_{k}\cong\sigma^{m}(C_{i-m}\times_{C_{0}}F)\cong\sigma^{m}(\emptyset)\cong\partial C_{m}.

    In this case, the morphisms of A⊂S00A\subset S_{00} provide an iterative construction of ν​∂Cm\nu\partial C_{m} as a colimit in S00−1​Fun⁡(Υnop,Set)S_{00}^{-1}\Fun(\Upsilon_{n}^{\mathrm{op}},\set) of cells.

  2. (B)

    Next, if F≅C0F\cong C_{0}, then

    Ci×CjCk≅σm​(Ci−m×C0F)≅σm​(Ci−m)≅CiC_{i}\times_{C_{j}}C_{k}\cong\sigma^{m}(C_{i-m}\times_{C_{0}}F)\cong\sigma^{m}(C_{i-m})\cong C_{i}

    is already a cell.

  3. (C)

    Similarly, if F≅Ck−mF\cong C_{k-m}, but i=mi=m, then

    Ci×CjCk≅σm​(C0×C0F)≅σm​(Ck−m)≅CkC_{i}\times_{C_{j}}C_{k}\cong\sigma^{m}(C_{0}\times_{C_{0}}F)\cong\sigma^{m}(C_{k-m})\cong C_{k}

    is again already a cell.

  4. (D)

    Finally, let us suppose that F≅CℓF\cong C_{\ell} with i=m+pi=m+p and k=m+ℓk=m+\ell for p>0p>0. In this case we have,

    Ci×CjCk≅Cm+p×CmCm+ℓC_{i}\times_{C_{j}}C_{k}\cong C_{m+p}\times_{C_{m}}C_{m+\ell}

    is precisely the fiber product considered in the set C⊂S00C\subset S_{00}. One readily observes that morphisms of BB and CC provide an inductive construction of this fiber product as an iterated colimit of cells in 𝒞\mathcal{C}.∎

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