ScalingStacks

[009Z]

Definition 5.3.1.

Consider a morphism \(\mathcal C\xrightarrow{F} \mathcal D\) in \(\mathrm{Cat}_{(\infty, {k})}\) for some \(k \geq 0\) and let \(n\geq -2\).

  1. We declare that any \(F\) is \((-2)\)-surjective and that \(F\) is \((-2)\)-faithful if it is an equivalence.

  2. If \(k=0\), we say that \(F\) is \(n\)-surjective if it is \(n\)-connected and \(n\)-faithful if it is \(n\)-truncated.27

  3. For \(n > -2\) and \(k > 0\), we inductively define \(F\) to be

    1. \(n\)-surjective if it is surjective on objects and for every \(c,c' \in \mathcal C\) the morphism \(\underline{\mathrm{Hom}}_\mathcal C(c,c') \rightarrow\underline{\mathrm{Hom}}_\mathcal D(Fc,Fc')\) in \(\mathrm{Cat}_{(\infty, {k-1})}\) is \((n-1)\)-surjective, and

    2. \(n\)-faithful if for every \(c,c' \in \mathcal C\) the morphism \(\underline{\mathrm{Hom}}_\mathcal C(c,c') \rightarrow\underline{\mathrm{Hom}}_\mathcal D(Fc,Fc')\) in \(\mathrm{Cat}_{(\infty, {k-1})}\) is \((n-1)\)-faithful.

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

Yu Leon Liu, Aaron Mazel-Gee, David Reutter, Catharina Stroppel, Paul Wedrich

Original source: arXiv:2401.02956v2

Original source · 2401.02956v2