4.8.8 Categorically Connective Morphisms of Simplicial Sets
Using Theorem 4.8.7.3, we can give an alternative characterization of categorical connectivity.
Proposition 4.8.8.1. Let $F: \operatorname{\mathcal{A}}\rightarrow \operatorname{\mathcal{B}}$ be a functor of $\infty $-categories and let $n$ be an integer. The following conditions are equivalent:
- $(1)$
The functor $F$ is categorically $n$-connective (Definition 4.8.5.1).
- $(2)$
For every $n$-faithful functor of $\infty $-categories $U: \operatorname{\mathcal{C}}\rightarrow \operatorname{\mathcal{D}}$, the diagram
\[ \xymatrix@R =50pt@C=50pt{ \operatorname{Fun}(\operatorname{\mathcal{B}}, \operatorname{\mathcal{C}}) \ar [r]^-{\circ F} \ar [d]^{U \circ } & \operatorname{Fun}( \operatorname{\mathcal{A}}, \operatorname{\mathcal{C}}) \ar [d]^{ U \circ } \\ \operatorname{Fun}( \operatorname{\mathcal{B}}, \operatorname{\mathcal{D}}) \ar [r]^-{\circ F} & \operatorname{Fun}( \operatorname{\mathcal{A}}, \operatorname{\mathcal{D}}) } \]
is a categorical pullback square.
- $(3)$
For every $(n-1)$-categorical isofibration $U: \operatorname{\mathcal{C}}\rightarrow \operatorname{\mathcal{B}}$, precomposition with $F$ induces an equivalence of $\infty $-categories
\[ \theta _{\operatorname{\mathcal{C}}}: \operatorname{Fun}_{ / \operatorname{\mathcal{B}}}( \operatorname{\mathcal{B}}, \operatorname{\mathcal{C}}) \rightarrow \operatorname{Fun}_{ / \operatorname{\mathcal{B}}}( \operatorname{\mathcal{A}}, \operatorname{\mathcal{C}}). \]
Proof.
The implication $(1) \Rightarrow (2)$ is a restatement of Corollary 4.8.5.23, and the implication $(2) \Rightarrow (3)$ follows from Corollary 4.5.3.31. To show that $(3)$ implies $(1)$, we may assume without loss of generality that $F$ is an isofibration. Then the comparison map $G: \operatorname {h}_{\mathit{\leq {}n-1}}{\mathit{(\operatorname{\mathcal{A}}/\operatorname{\mathcal{B}})}} \rightarrow \operatorname{\mathcal{B}}$ is an $(n-1)$-categorical isofibration (Propositions 4.8.6.17 and 4.8.6.23). If $U: \operatorname{\mathcal{C}}\rightarrow \operatorname{\mathcal{B}}$ is another $(n-1)$-categorical isofibration, then we can use Proposition 4.8.6.20 to identify $\theta _{\operatorname{\mathcal{C}}}$ with the functor $\operatorname{Fun}_{ / \operatorname{\mathcal{B}}}( \operatorname{\mathcal{B}}, \operatorname{\mathcal{C}}) \rightarrow \operatorname{Fun}_{ / \operatorname{\mathcal{B}}}( \operatorname {h}_{\mathit{\leq {}n-1}}{\mathit{(\operatorname{\mathcal{A}}/\operatorname{\mathcal{B}})}}, \operatorname{\mathcal{C}})$ given by precomposition with $G$. If condition $(3)$ is satisfied, then $G$ is an equivalence of $\infty $-categories, so that $F$ is categorically $n$-connective by virtue of Corollary 4.8.6.27.
$\square$
Motivated by Proposition 4.8.8.1, we introduce a generalization of Definition 4.8.5.1.
Definition 4.8.8.2. Let $f: A \rightarrow B$ be a morphism of simplicial sets and let $n$ be an integer. We say that $f$ is categorically $n$-connective if, for every $n$-faithful functor of $\infty $-categories $U: \operatorname{\mathcal{C}}\rightarrow \operatorname{\mathcal{D}}$, the diagram
\[ \xymatrix@R =50pt@C=50pt{ \operatorname{Fun}(B, \operatorname{\mathcal{C}}) \ar [r]^-{\circ f} \ar [d]^{U \circ } & \operatorname{Fun}(A, \operatorname{\mathcal{C}}) \ar [d]^{ U \circ } \\ \operatorname{Fun}( B, \operatorname{\mathcal{D}}) \ar [r]^-{\circ f} & \operatorname{Fun}( A, \operatorname{\mathcal{D}}) } \]
is a categorical pullback square.
If $f: A \rightarrow B$ is any morphism of simplicial sets, then we can use Proposition 4.1.3.2 to choose a commutative diagram
\[ \xymatrix@R =50pt@C=50pt{ A \ar [d]^{f} \ar [r] & \operatorname{\mathcal{A}}\ar [d]^{F} \\ B \ar [r] & \operatorname{\mathcal{B}}} \]
where the horizontal maps are categorical equivalences and $F$ is a functor of $\infty $-categories. Combining $(1)$ and $(2)$, we see that $f$ is categorically $n$-connective if and only if the functor $F$ is $m$-full for $m \leq n$.
To prove these assertions, we can use Remark 4.8.8.4 to reduce to the case where $A$, $B$, and $C$ are $\infty $-categories, in which case the result follows from Proposition 4.8.5.15
Proposition 4.8.8.10. Let $n$ be an integer and let $\operatorname{\mathcal{W}}_ n$ denote the full subcategory of $\operatorname{Fun}( [1], \operatorname{Set_{\Delta }})$ spanned by those morphisms of simplicial sets $f: A \rightarrow B$ which are categorically $n$-connective. Then $\operatorname{\mathcal{W}}_ n$ is closed under the formation of filtered colimits in $\operatorname{Fun}( [1], \operatorname{Set_{\Delta }})$.
Proof.
By virtue of Corollary 4.1.3.3, there exists a functor $Q: \operatorname{Set_{\Delta }}\rightarrow \operatorname{Set_{\Delta }}$ which commutes with filtered colimits and a natural transformation of functors $u: \operatorname{id}_{\operatorname{Set_{\Delta }}} \rightarrow Q$ with the property that, for every simplicial set $A$, the simplicial set $Q(A)$ is an $\infty $-category and the morphism $u_ A: A \rightarrow Q(A)$ is inner anodyne. For every morphism of simplicial sets $f: A \rightarrow B$, we have a commutative diagram
\[ \xymatrix@R =50pt@C=50pt{ A \ar [d]^{f} \ar [r]^-{ u_{A} } & Q(A) \ar [d]^{ Q(f) } \\ B \ar [r]^-{ u_{B} } & Q(B) } \]
where the horizontal maps are categorical equivalences. It follows that $f$ is categorically $n$-connective if and only if $Q(f)$ is categorically $n$-connective. The desired result now follows from the analogous statement for filtered colimits of $\infty $-categories (Remark 4.8.5.11).
$\square$
Corollary 4.8.8.11. Let $\operatorname{\mathcal{W}}$ denote the full subcategory of $\operatorname{Fun}( [1], \operatorname{Set_{\Delta }})$ spanned by those morphisms of simplicial sets $f: X \rightarrow Y$ which are categorical equivalences. Then $\operatorname{\mathcal{W}}$ is closed under the formation of filtered colimits in $\operatorname{Fun}( [1], \operatorname{Set_{\Delta }})$.
Proof.
Combine Proposition 4.8.8.10 with Remark 4.8.8.7.
$\square$
Proposition 4.8.8.12. Suppose we are given a categorical pushout square of simplicial sets
4.91
\begin{equation} \begin{gathered}\label{equation:pushout-of-categorically-connective} \xymatrix@C =50pt@R=50pt{ A \ar [d]^{f} \ar [r] & A' \ar [d]^{f'} \\ B \ar [r] & B', } \end{gathered} \end{equation}
where $f$ is categorically $n$-connective. Then $f'$ is also categorically $n$-connective.
Proof.
Let $U: \operatorname{\mathcal{C}}\rightarrow \operatorname{\mathcal{D}}$ be an $n$-faithful functor of $\infty $-categories, and consider the cubical diagram
\[ \xymatrix@C =50pt@R=50pt{ \operatorname{Fun}(B', \operatorname{\mathcal{C}}) \ar [dr] \ar [rr] \ar [dd] & & \operatorname{Fun}(B, \operatorname{\mathcal{C}}) \ar [dr] \ar [dd] & \\ & \operatorname{Fun}(B', \operatorname{\mathcal{D}}) \ar [rr] \ar [dd] & & \operatorname{Fun}(B, \operatorname{\mathcal{D}}) \ar [dd] \\ \operatorname{Fun}(A', \operatorname{\mathcal{C}}) \ar [rr] \ar [dr] & & \operatorname{Fun}(A, \operatorname{\mathcal{C}}) \ar [dr] & \\ & \operatorname{Fun}(A', \operatorname{\mathcal{D}}) \ar [rr] & & \operatorname{Fun}(A, \operatorname{\mathcal{D}}). } \]
Our assumption that $f$ is categorically $n$-connective guarantees that the right face is a categorical pullback square, and our assumption on (4.91) guarantees that the front and back faces are categorical pullback squares. Applying Proposition 4.5.3.19, we conclude that the left face is also a categorical pullback square.
$\square$
Corollary 4.8.8.13. Let $n$ be an integer and suppose we are given a commutative diagram of simplicial sets
\[ \xymatrix@R =50pt@C=50pt{ X \ar [rr]^{f} \ar [dr] & & Y \ar [dl] \\ & S & } \]
with the following property: for every simplex $\sigma : \Delta ^ k \rightarrow S$, the induced map $f_{\sigma }: \Delta ^ k \times _{S} X \rightarrow \Delta ^ k \times _{S} Y$ is categorically $n$-connective. Then $f$ is categorically $n$-connective.
Proof.
We will prove the following stronger assertion: for every morphism of simplicial sets $S' \rightarrow S$, the induced map
\[ f_{S'}: S' \times _{S} X \rightarrow S' \times _{S} Y \]
is categorically $n$-connective. By virtue of Corollary 4.8.8.11 (and Remark 1.1.4.4), we may assume without loss of generality that $S'$ has dimension $\leq k$ for some integer $k \geq -1$. We proceed by induction on $k$. In the case $k=-1$, the simplicial set $S'$ is empty and there is nothing to prove. Assume therefore that $k \geq 0$. Let $S''$ denote the $(k-1)$-skeleton of $S'$ and let $I$ be the set of nondegenerate $k$-simplices of $S'$, so that Proposition 1.1.4.12 supplies a pushout diagram of simplicial sets
\[ \xymatrix@R =50pt@C=50pt{ \underset { i \in I }{\coprod } \operatorname{\partial \Delta }^{k} \ar [r] \ar [d] & \underset { i \in I }{\coprod } \Delta ^{k} \ar [d] \\ S'' \ar [r] & S', } \]
where the horizontal maps are monomorphisms. It follows that the front and back faces of the diagram
\[ \xymatrix@R =50pt@C=40pt{ (\underset { i \in I }{\coprod } \operatorname{\partial \Delta }^{k}) \times _{S} X \ar [rr] \ar [dd] \ar [dr]^{u} & & \underset { i \in I }{\coprod } (\Delta ^{k} \times _{S} X) \ar [dd] \ar [dr]^{v} & \\ & \underset { i \in I }{\coprod } (\operatorname{\partial \Delta }^{k} \times _{S} Y) \ar [dd] \ar [rr] & & \underset { i \in I }{\coprod } (\Delta ^{k} \times _{S} Y) \ar [dd] \\ S'' \times _{S} X \ar [rr] \ar [dr]^{f_{S''}} & & S' \times _{S} X \ar [dr]^{ f_{S'} } & \\ & S'' \times _{S} Y \ar [rr] & & S' \times _{S} Y } \]
are categorical pushout squares (Proposition 4.5.5.11). Consequently, to show that $f_{S'}$ is categorically $n$-connective, it will suffice to show that $f_{S''}$, $u$, and $v$ are categorically $n$-connective (Proposition 4.8.8.12). In the first two cases, this follows from our inductive hypothesis. We may therefore replace $S'$ by the coproduct $\coprod _{i \in I} \Delta ^{k}$, and thereby reduce to the case where $S'$ is a coproduct of simplices. Using Remark 4.8.8.9, we can further reduce to the case where $S' \simeq \Delta ^{k}$ is a standard simplex, in which case the desired result follows from our hypothesis on $f$.
$\square$
Corollary 4.8.8.14. Suppose we are given a commutative diagram of simplicial sets
\[ \xymatrix@R =50pt@C=50pt{ X \ar [rr]^{f} \ar [dr] & & Y \ar [dl] \\ & S & } \]
with the following property: for every simplex $\sigma : \Delta ^ k \rightarrow S$, the induced map $f_{\sigma }: \Delta ^ k \times _{S} X \rightarrow \Delta ^ k \times _{S} Y$ is a categorical equivalence of simplicial sets. Then $f$ is a categorical equivalence of simplicial sets.
Proof.
Combine Corollary 4.8.8.13 with Remark 4.8.8.7.
$\square$
Proposition 4.8.8.15. Let $f: A \hookrightarrow B$ be a monomorphism of simplicial sets and let $n$ be an integer. The following conditions are equivalent:
- $(1)$
The morphism $f$ is categorically $n$-connective.
- $(2)$
For every $n$-faithful functor of $\infty $-categories $U: \operatorname{\mathcal{C}}\rightarrow \operatorname{\mathcal{D}}$, the restriction map
\[ V: \operatorname{Fun}(B, \operatorname{\mathcal{C}}) \rightarrow \operatorname{Fun}(A, \operatorname{\mathcal{C}}) \times _{ \operatorname{Fun}(A, \operatorname{\mathcal{D}}) } \operatorname{Fun}(B, \operatorname{\mathcal{D}}) \]
is an equivalence of $\infty $-categories.
- $(3)$
For every $n$-faithful isofibration of $\infty $-categories $U: \operatorname{\mathcal{C}}\rightarrow \operatorname{\mathcal{D}}$, the functor $V$ is a trivial Kan fibration.
- $(4)$
Every lifting problem
\[ \xymatrix@C =50pt@R=50pt{ A \ar [d] \ar [r] & \operatorname{\mathcal{C}}\ar [d]^{U} \\ B \ar@ {-->}[ur] \ar [r] & \operatorname{\mathcal{D}}} \]
admits a solution, provided that $U$ is an $n$-faithful isofibration of $\infty $-categories.
Proof.
The equivalences $(1) \Leftrightarrow (2) \Leftrightarrow (3)$ follow from Remarks 4.8.5.24 and 4.8.8.3, and the implication $(3) \Rightarrow (4)$ is immediate. We will complete the proof by showing that $(4)$ implies $(3)$. Assume that condition $(4)$ is satisfied, and let $U: \operatorname{\mathcal{C}}\rightarrow \operatorname{\mathcal{D}}$ be an $n$-faithful isofibration of $\infty $-categories. We wish to show that, for every simplicial set $B'$ and every simplicial subset $A' \subseteq B'$, every lifting problem
4.92
\begin{equation} \begin{gathered}\label{equation:categorically-connective-monomorphism} \xymatrix@C =50pt@R=50pt{ A' \ar [r] \ar [d] & \operatorname{Fun}(B, \operatorname{\mathcal{C}}) \ar [d]^{V} \\ B' \ar@ {-->}[ur] \ar [r] & \operatorname{Fun}(A, \operatorname{\mathcal{C}}) \times _{ \operatorname{Fun}(A, \operatorname{\mathcal{D}}) } \operatorname{Fun}(B, \operatorname{\mathcal{D}}) } \end{gathered} \end{equation}
admits a solution. Unwinding the definitions, we can rewrite (4.92) as a lifting problem
\[ \xymatrix@C =50pt@R=50pt{ A \ar [r] \ar [d]^{f} & \operatorname{Fun}(B', \operatorname{\mathcal{C}}) \ar [d]^{V'} \\ B \ar@ {-->}[ur] \ar [r] & \operatorname{Fun}(A', \operatorname{\mathcal{C}}) \times _{ \operatorname{Fun}(A', \operatorname{\mathcal{D}}) } \operatorname{Fun}(B', \operatorname{\mathcal{D}}). } \]
The existence of a solution follows from $(4)$, since $V'$ is also an $n$-faithful isofibration of $\infty $-categories (Corollary 4.8.4.14 and Proposition 4.4.5.1).
$\square$
Example 4.8.8.16. Let $B$ be a simplicial set and let $A \subseteq B$ be a simplicial subset which contains the $n$-skeleton of $B$. Then the inclusion map $A \hookrightarrow B$ is categorically $n$-connective. In particular, for every simplicial set $B$, the inclusion map $\operatorname{sk}_{n}(B) \hookrightarrow B$ is categorically $n$-connective. This follows from Proposition 4.8.8.15 and Proposition 4.8.4.13.
Proposition 4.8.8.17. Let $n \geq 0$ be an integer and let $f: A \rightarrow B$ be a morphism of simplicial sets which is bijective on simplices of dimension $< n$ and surjective on $n$-simplices. Then $f$ is categorically $n$-connective.
Proof.
Using Proposition 1.1.4.12, we can choose a simplicial subset $A' \subseteq \operatorname{sk}_{n}(A)$ which contains the $(n-1)$-skeleton of $A$, such that $f$ restricts to an isomorphism of $A'$ with the $n$-skeleton of $B$. It follows from Example 4.8.8.16 that $f|_{A'}$ is categorically $n$-connective, and that the inclusion map $A' \hookrightarrow A$ is categorically $(n-1)$-connective. Applying Remark 4.8.8.6, we deduce that $f$ is categorically $n$-connective.
$\square$