ScalingStacks

[0MHZ]

Proof. The proper retracts of CnC_{n} are precisely the cells CkC_{k} for 0≤k<n0\leq k<n, and, as before, each CkC_{k} is distinguished as the unique such retract such that, up to isomorphism, there exists precisely kk other objects which occur as further proper retracts (the cells CsC_{s} for s<ks<k). Thus it is enough to show that F⁡(Cn)≅CnF(C_{n})\cong C_{n} for the nn-cell alone, as this implies the analogous statement F⁡(Ck)≅CkF(C_{k})\cong C_{k} for all 0≤k≤n0\leq k\leq n.

Recall that a generator of a category 𝒞\mathcal{C} is an object XX such that the corepresentable functor 𝒞⁡(X,−):𝒞→Set\mathcal{C}(X,-):\mathcal{C}\to\set is faithful [30, pg. 127]. The collection of generators is preserved under any autoequivalence. The nn-cell CnC_{n} is a generator for Catn\cat_{n} and hence also Gauntn\gaunt_{n}, however the kk-cells CkC_{k} for k<nk<n are not generators. Thus no proper retract of CnC_{n} is a generator. We claim that in fact CnC_{n} is the unique generator such that every proper retract is not a generator. If this characterization holds, then any autoequivalence necessarily preserves the nn-cell up to automorphism and the lemma follows.

In fact we will prove a stronger statement: we claim that the nn-cell CnC_{n} is a retract of every generator of Gauntn\gaunt_{n}. Now consider the gaunt nn-category ∂Cn+1\partial C_{n+1}. This may be written as

∂Cn+1=Cn∪∂CnCn.\partial C_{n+1}=C_{n}\cup^{\partial C_{n}}C_{n}.

There are exactly two non-identity nn-morphisms in ∂Cn+1\partial C_{n+1}; call them a,b:Cn→∂Cn+1a,b:C_{n}\to\partial C_{n+1}. Observe that these two functors differ only on the unique nontrivial nn-morphism of CnC_{n}. The unique non-trivial nn-morphism of CnC_{n}, viewed as a map Cn→CnC_{n}\to C_{n}, corresponds to the element id∈Gauntn⁡(Cn,Cn)\id\in\gaunt_{n}(C_{n},C_{n}).

Suppose now that XX is a generator of Gauntn\gaunt_{n}. Then there must exist a functor X→CnX\to C_{n} such that the induced map Xn→Gauntn⁡(Cn,Cn)X_{n}\to\gaunt_{n}(C_{n},C_{n}) contains the element id∈Gauntn⁡(Cn,Cn)\id\in\gaunt_{n}(C_{n},C_{n}) in its image, for otherwise 𝒞⁡(X,−)\mathcal{C}(X,-) would not be able to distinguish aa and bb, contradicting the fact that XX is a generator. Thus there exists an nn-morphism ff of XX which maps via this functor to id∈Gauntn⁡(Cn,Cn)\id\in\gaunt_{n}(C_{n},C_{n}). Corresponding to ff is a section Cn→XC_{n}\to X that carries the unique nontrivial nn-morphism of CnC_{n} to ff. This exhibits CnC_{n} as a retract of XX, as desired. ∎

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