We denote by the category of simplicial sets equipped with the Kan-Quillen model structure. It has various special properties over the other frequently-used model categories in simplicial homotopy theory and -category theory, and many of these come from the existence and properties of Kan's functor. This blog post discusses and proves some of these results, often in a more pedestrian manner than some of the standard references.
Remark 1 (conventions). For the purposes of this post, we use the following conventions:
-
A Kan fibration is a morphism of simplicial sets with the RLP against horn inclusions for and . A Kan complex is a simplicial set such that is a Kan fibration.
-
An anodyne extension is a morphism of simplicial sets with the LLP against all Kan fibrations; equivalently, by the small object argument, it is an element of the smallest saturated class of monomorphisms containing the horn inclusions for and .
-
A weak homotopy equivalence is a morphism of simplicial sets such that for each Kan complex , the induced map
between -homotopy classes of maps is bijective.
-
We will assume that in the model category :
- Cofibrations are monomorphisms.
- All anodyne maps are trivial cofibrations.
- The weak equivalences are weak homotopy equivalences.
- The fibrant objects are Kan complexes, and the fibrations between Kan complexes are precisely Kan fibrations.
But we will not assume that all trivial cofibrations are anodyne - this will be a consequence of our results. In particular, we won't at the beginning assume that a Kan fibration between arbitrary objects is a fibration of .
The subdivision functor
Defining and
We begin by defining a functor which acts as barycentric subdivision of simplicial sets.
- If is a poset, we define its subdivision to be the poset of all finite, nonempty, totally ordered subsets of , ordered by inclusion.
- If is an order-preserving map, there is an induced order-preserving map sending . This defines a functor from posets to posets.
- For each , there is a canonical map sending , and this defines a natural transformation because taking maxima commutes with order-preserving maps.
Based on this, there is a functor given by , and we define the functor
to be its extension by colimits. In particular, it is characterized by being colimit-preserving and satisfying , and it comes equipped with a right adjoint written
such that . The natural maps in provide a map natural in , and thus by adjunction a map natural in . We observe that the map is an epimorphism split by , so is a split epimorphism, and thus is a monomorphism.
Diagram TeX source
\[\begin{tikzcd}[column sep=small,row sep=scriptsize]
&&& {\{2\}} &&& \\
&& {\{0,2\}} && {\{1,2\}} \\
&&& {\{0,1,2\}} \\
{\{0\}} &&& {\{0,1\}} &&& {\{1\}}
\arrow[from=1-4, to=2-3]
\arrow[from=1-4, to=2-5]
\arrow[from=1-4, to=3-4]
\arrow[from=2-3, to=3-4]
\arrow[from=2-5, to=3-4]
\arrow[color={rgb,255:red,51;green,82;blue,255}, from=4-1, to=2-3]
\arrow[color={rgb,255:red,51;green,82;blue,255}, from=4-1, to=3-4]
\arrow[color={rgb,255:red,88;green,227;blue,79}, from=4-1, to=4-4]
\arrow[color={rgb,255:red,255;green,68;blue,51}, from=4-4, to=3-4]
\arrow[color={rgb,255:red,255;green,68;blue,51}, from=4-7, to=2-5]
\arrow[color={rgb,255:red,255;green,68;blue,51}, from=4-7, to=3-4]
\arrow[from=4-7, to=4-4]
\end{tikzcd}\]Definition 2 (Sd and Ex). We define , and for each inductively
equipped with sequences of natural maps
In particular . Finally, we define the functor
equipped with natural monomorphisms for .
We remark that although isn't a right adjoint to anything, the fact that is implies that preserves finite limits, since filtered colimits in commute with finite limits.
Observation 3. In the poset , there is a chain
of length (among others), which is clearly maximal. Therefore is -skeletal, and it follows that depends only on the skeleton , i.e. the inclusion induces an isomorphism .
We will now ignore the higher 's and 's and focus on each of the cases individually.
Basic observations about
Let's begin with some easy observations which follow directly from the definition:
-
, meaning that the inclusion is a bijection on objects.
-
, so a morphism in is a cospan in . The map is the map , so the inclusion sends a morphism to .
-
Let . Then the inclusion views a totally ordered subset of as one of . As subsets of we have
because a subset of excludes iff it excludes and . Taking nerves shows that .
Example 4.¶ Apply the observation above to the defining coequalizer
corresponding to the decomposition . Then we deduce that and that the union is taken as subobjects of . In particular is a monomorphism for all . Since preserves colimits, the morphisms of simplicial sets for which is a monomorphism form a saturated class, and therefore preserves all monomorphisms. In particular we have
as well inside of .
Remark 5.¶ Even after applying once, the resulting subdivisions of and already become nerves of posets. Indeed, write for the subset . Then we claim that
as subcomplexes of . Indeed, the inclusion is clear because ; conversely, a non-degenerate -simplex on the RHS is a chain of subsets of where . Hence for some , meaning that the chain is contained in . Likewise, define to consist of the subsets such that doesn't contain (i.e. so that ). Then the same argument shows that .
We can generalize some of the observations above. For each and poset , the canonical map
gives a map natural in , and hence a map natural in .
Proposition 6.¶ For each poset , the natural map is an isomorphism of simplicial sets.
Proof. By definition it is an isomorphism when for each . Since every finite nonempty totally ordered set is isomorphic to , it is also an isomorphism if .
For arbitrary , note that , because an -simplex is contained in the nerve of the chain . Applying to the corresponding coequalizer gives the top row of the diagram:
Diagram TeX source
\begin{tikzcd}
{\coprod_{E,E'} \Sd N(E\cap E')} & {\coprod_{E}\Sd N(E)} & {\Sd N(P)} \\
{\coprod_{E,E'}N(s(E\cap E'))} & {\coprod_E N(sE)} & {N(sP)}
\arrow[shift left, from=1-1, to=1-2]
\arrow[shift right, from=1-1, to=1-2]
\arrow["\cong"', from=1-1, to=2-1]
\arrow[from=1-2, to=1-3]
\arrow["\cong"', from=1-2, to=2-2]
\arrow[from=1-3, to=2-3]
\arrow[shift left, from=2-1, to=2-2]
\arrow[shift right, from=2-1, to=2-2]
\arrow[from=2-2, to=2-3]
\end{tikzcd}In particular it will complete the proof to show that the bottom row is a coequalizer, or in other words that with intersections . The former is clear: if is an -simplex in , then it is also an -simplex in .
For the latter, since preserves intersections, it suffices to see that . Indeed a nonempty totally ordered subset is contained in if and only if it is contained in and in . □
Key properties of
Let us prove our first few nontrivial results. We will use the following standard lemma, which comes from basic properties of joins.
Lemma 7.¶ Let be an anodyne extension and be a monomorphism. Then:
- The induced map is an anodyne extension.
- The induced map is (right) anodyne.
Proof. For (1), we may by the colimit-preserving properties of joins reduce to showing that is anodyne for . Hence the same reasoning allows us to further reduce to the case
for and . This is precisely the inclusion .
For (2), we similarly reduce to for , which is just the inclusion . □
Example 8.¶ If is a poset with a greatest element , then any map is anodyne. Indeed, we may factorize it as
The first map is the horn inclusion and the second is obtained from Lemma 7(2) applied to the monomorphism . This works as long as is not the inclusion of itself; in that case, the same reasoning works with .
Proposition 9.¶ For each simplicial set , the canonical map is a weak homotopy equivalence. In particular preserves weak homotopy equivalences, and
is a Quillen equivalence.
Proof. Because and are colimit-preserving functors which send monomorphisms to cofibrations, we can use the saturated-by-monomorphisms trick to reduce to showing that is a weak equivalence for each . Choose any point of the source, which yields a commutative diagram:
Diagram TeX source
\begin{tikzcd}
& {\D^0} & \\
{\Sd(\D^n)} && {\D^n}
\arrow[from=1-2, to=2-1]
\arrow[from=1-2, to=2-3]
\arrow[from=2-1, to=2-3]
\end{tikzcd}Since and have terminal objects ( and respectively), the vertical maps are anodyne extensions by Example 8, yielding a horizontal weak equivalence.
Since is natural in , it immediately follows from 2-out-of-3 that preserves weak equivalences. Since it already preserves monomorphisms, is left Quillen for the Kan-Quillen model structure. Then the natural map descends to a morphism of derived functors , and the first statement shows that its components are all isomorphisms. In particular is isomorphic to an equivalence of categories. □
At this point we know that preserves trivial cofibrations in , but we don't yet know that these coincide with anodyne extensions. The next theorem proves the anodyne extension case explicitly. We recall the notion of a generalized horn: If is a nonempty subset, then we set
We will use this notion in the proof of the following result.
Theorem 10.¶ The functor preserves anodyne extensions.
Proof. Since preserves colimits, it suffices to show that the inclusion is anodyne for . We will more generally prove by induction on that is anodyne for any .
If , the map is either of the endpoint inclusions , so this case follows from Example 8. Assuming , our first goal is to find an anodyne map . If , then , so we can already do this by Example 8. Otherwise, pick and consider . There is a pushout diagram:
Diagram TeX source
\begin{tikzcd}[sep=2.25em]
{\Lambda^{n-1}_{S'}} & {\Lambda^{[n]\setminus\{k\}}_{S}} & {\Lambda^n_{S\cup\{k\}}} \\
{\D^{n-1}} & {\D^{[n]\setminus k}} & {\Lambda^n_{S}}
\arrow[equals, from=1-1, to=1-2]
\arrow[hook, from=1-1, to=2-1]
\arrow[hook, from=1-2, to=1-3]
\arrow[hook, from=1-2, to=2-2]
\arrow[hook, from=1-3, to=2-3]
\arrow[equals, from=2-1, to=2-2]
\arrow[hook, from=2-2, to=2-3]
\arrow["\lrcorner"{anchor=center, pos=0.125, rotate=180}, draw=none, from=2-3, to=1-2]
\end{tikzcd}This is because , so is the preimage of under . Now apply : by induction, is anodyne, and we can repeat this process with until we obtain an anodyne extension with . The case we started with then provides the anodyne extension .
Here's how we can finish the inductive step. From Remark 5, we know that
since is the terminal object of . Let denote this vertex ; we factor the inclusion as
noting that the last map is anodyne by Lemma 7. The first map is a pushout of which is a horn inclusion, hence anodyne. Lemma 7(1) implies that the second map is anodyne, applied to and . □
The extension functor
Here is a simple consequence of our results in the previous section:
Corollary 11.¶ The functors for preserve Kan fibrations and trivial fibrations.
Proof. For all finite , it suffices to prove the case that . By adjunction, this is equivalent to the question of whether preserves monomorphisms and anodyne extensions, which we know is true by Example 4 and Theorem 10.
For , we may therefore show that the classes of Kan fibrations and trivial fibrations are both stable under filtered colimits. This follows from the more general statement that if is an inclusion of finite simplicial sets, then is closed under filtered colimits.
Indeed, suppose that is a morphism of filtered diagrams such that each has the RLP against . In other words
is surjective for each . Finiteness means that and preserve filtered colimits, and since finite limits commute with filtered colimits we deduce that
where and . Taking of Equation (1) gives the result, as surjections are stable under filtered colimits. □
This is the first of many nice properties enjoyed by . We will discuss the other major ones next. We will need to use a slightly nontrivial result about bisimplicial sets, which we prove now.
The diagonal lemma
Definition 12. A bisimplicial set is a functor
and we define to be the category of bisimplicial sets. Moreover:
- If is a bisimplicial set, we write and for the simplicial sets and , respectively.
- If is a bisimplicial set, we write for the simplicial set .
- If and are simplicial sets, then we write for the bisimplicial set given by .
Observe that in a bisimplicial set, we have face and degeneracy maps and which are maps of simplicial sets, rather than of sets. Bisimplicial sets come up somewhat frequently in the theory of simplicial sets, often in proofs whose statements involve only ordinary simplicial sets. There are good model structures on which interact well with simplicial sets, and such techniques are one way to prove the following theorem. Here we present an elementary version of the proof.
Theorem 13 (diagonal lemma).¶ Let be a morphism of bisimplicial sets. If is a weak homotopy equivalence for each , then the induced map is a weak homotopy equivalence.
Of course, the automorphism flipping the factors in induces an automorphism of , and under this we see that the above lemma works if is a weak equivalence for all .
Remark 14. This proof is the most technical and least geometric part of this post. I recommend skipping to Ex ∞ as a fibrant replacement to see how one applies this result first.
The proof will take a couple steps, each of which is elementary individually; we phrase them in terms of ordinary simplicial sets.
Lemma 15.¶ Let be a morphism of simplicial sets and a finite set. We further assume that:
-
We have decompositions and such that .
-
For each nonempty , the induced map
is a weak homotopy equivalence.
Then is a weak homotopy equivalence.
Proof. We prove this simultaneously for all maps by induction on . If there is nothing to prove, so assume . Choose , and consider the commutative diagram
Diagram TeX source
\begin{tikzcd}[sep=large]
{\bigcup_{i\neq j}X_i} & {\bigcup_{i\neq j}X_i\cap X_j} & {X_j} \\
{\bigcup_{i\neq j}Y_i} & {\bigcup_{i\neq j}Y_i\cap Y_j} & {Y_j}
\arrow[from=1-1, to=2-1]
\arrow[hook', from=1-2, to=1-1]
\arrow[hook, from=1-2, to=1-3]
\arrow[from=1-2, to=2-2]
\arrow[from=1-3, to=2-3]
\arrow[hook', from=2-2, to=2-1]
\arrow[hook, from=2-2, to=2-3]
\end{tikzcd}The right-hand map is a weak equivalence by assumption, and the left-hand map is a weak equivalence by the inductive hypothesis. Moreover, the inductive hypothesis also applies to the middle map because the finite intersections of are all finite intersections of . Finally, since all horizontal maps are cofibrations, the induced map
between pushouts of the two spans is a weak equivalence. □
The next two results concern degeneracies.
Lemma 16.¶ Let be a simplicial set and . For , the following subsets of are equal:
- The intersection .
- The image of , where is the unique surjection identifying and for .
- The image .
Proof. Clearly because in . Now (under the Eilenberg-Zilber lemma) identify with pairs of non-degenerate simplices and surjections . Then lies in iff , thus it lies in iff for . This is equivalent to factoring through , which is in turn equivalent to . □
Lemma 17.¶ Let be a simplicial set. For each , there is a canonical pushout diagram
Diagram TeX source
\begin{tikzcd}
{A^\degn_n\times(\D^n)_k\cup A_n\times(\partial\D^n)_k} & {(\Sk_{n-1}A)_k} \\
{A_n\times(\D^n)_k} & {(\Sk_{n}A)_k}
\arrow[""{name=0, anchor=center, inner sep=0}, from=1-1, to=1-2]
\arrow[from=1-1, to=2-1]
\arrow[from=1-2, to=2-2]
\arrow[from=2-1, to=2-2]
\arrow["\lrcorner"{anchor=center, pos=0.125, rotate=180}, draw=none, from=2-2, to=0]
\end{tikzcd}for all .
Proof. The lower map sends . We have a diagram
Diagram TeX source
\begin{tikzcd}
{A_n^\nd\times(\partial\D^n)_k} & {A^\degn_n\times(\D^n)_k\cup A_n\times(\partial\D^n)_k} & {(\Sk_{n-1}A)_k} \\
{A^\nd_n\times(\D^n)_k} & {A_n\times(\D^n)_k} & {(\Sk_{n}A)_k}
\arrow[hook, from=1-1, to=1-2]
\arrow[hook, from=1-1, to=2-1]
\arrow[""{name=0, anchor=center, inner sep=0}, from=1-2, to=1-3]
\arrow[hook, from=1-2, to=2-2]
\arrow[hook, from=1-3, to=2-3]
\arrow[hook, from=2-1, to=2-2]
\arrow[from=2-2, to=2-3]
\arrow["\lrcorner"{anchor=center, pos=0.125, rotate=180}, draw=none, from=2-3, to=0]
\end{tikzcd}where the outer rectangle is the evaluation at of the skeletal filtration pushout associated to . The left-hand square is cartesian because , and it is hence cocartesian because the corresponding union is evidently all of . Thus the pasting lemma shows that the right-hand square is cocartesian. □
We can now finally prove the diagonal lemma.
Proof (of Theorem 13). For a bisimplicial set , we write for the simplicial set . It is indeed a simplicial set because we have
Our first observation is that is a weak homotopy equivalence for all . To prove this we are going to apply Lemma 15, which says that it is enough to show that
is a weak homotopy equivalence for every sequence . By Lemma 16, this map is isomorphic to the top row of
Diagram TeX source
\begin{tikzcd}
{X_{\bullet,n-k}} & {Y_{\bullet,n-k}} \\
{X_{\bullet,n}} & {Y_{\bullet,n}}
\arrow[from=1-1, to=1-2]
\arrow["{s^{i_1\dots i_k,*}}"', from=1-1, to=2-1]
\arrow["{s^{i_1\dots i_k,*}}", from=1-2, to=2-2]
\arrow[from=2-1, to=2-2]
\end{tikzcd}as the vertical maps are induced by split surjections. We have assumed that this is a weak homotopy equivalence.
Next, write for the bisimplicial set with
namely it is the -skeleton with respect to the second direction. For , there is a skeletal pushout diagram:
Diagram TeX source
\begin{tikzcd}
{L_nX\times\D^n\cup X_{\bullet,n}\times\partial\D^n} & {\diag\Sk_{n-1}^{(2)}X} \\
{X_{\bullet,n}\times\D^n} & {\diag\Sk_{n}^{(2)}X}
\arrow[""{name=0, anchor=center, inner sep=0}, from=1-1, to=1-2]
\arrow[hook, from=1-1, to=2-1]
\arrow[hook, from=1-2, to=2-2]
\arrow[from=2-1, to=2-2]
\arrow["\lrcorner"{anchor=center, pos=0.125, rotate=180}, draw=none, from=2-2, to=0]
\end{tikzcd}Indeed, evaluating at provides the diagram
Diagram TeX source
\begin{tikzcd}
{(X_{k,\bullet})^{\degn}_n\times(\D^n)_k\cup X_{k,n}\times(\partial\D^n)_k} & {\Sk_{n-1}(X_{k,\bullet})_k} \\
{X_{k,n}\times(\D^n)_k} & {\Sk_{n}(X_{k,\bullet})_k}
\arrow[""{name=0, anchor=center, inner sep=0}, from=1-1, to=1-2]
\arrow[hook, from=1-1, to=2-1]
\arrow[hook, from=1-2, to=2-2]
\arrow[from=2-1, to=2-2]
\arrow["\lrcorner"{anchor=center, pos=0.125, rotate=180}, draw=none, from=2-2, to=0]
\end{tikzcd}which is exactly the pushout of Lemma 17 applied to the simplicial set .
To conclude, write . The diagram
Diagram TeX source
\begin{tikzcd}
{L_nX\times\D^n} & {L_nX\times\partial\D^n} & {X_{\bullet,n}\times\partial\D^n} \\
{L_nY\times\D^n} & {L_nY\times\partial\D^n} & {Y_{\bullet,n}\times\partial\D^n}
\arrow[from=1-1, to=2-1]
\arrow[hook', from=1-2, to=1-1]
\arrow[hook, from=1-2, to=1-3]
\arrow[from=1-2, to=2-2]
\arrow[from=1-3, to=2-3]
\arrow[hook', from=2-2, to=2-1]
\arrow[hook, from=2-2, to=2-3]
\end{tikzcd}has rows all cofibrations and vertical maps weak equivalences (by the first observation). Thus the induced map on pushouts is a weak equivalence. We use this to prove by induction that
is a weak equivalence for all . When , note that
so the map is just which is a weak equivalence. For , the commutative diagram
Diagram TeX source
\begin{tikzcd}
{X_{\bullet,n}\times\D^n} & {P_nX} & {\diag\Sk_{n-1}^{(2)}X} \\
{Y_{\bullet,n}\times\D^n} & {P_nY} & {\diag\Sk_{n-1}^{(2)}Y}
\arrow[from=1-1, to=2-1]
\arrow[hook', from=1-2, to=1-1]
\arrow[from=1-2, to=1-3]
\arrow[from=1-2, to=2-2]
\arrow[from=1-3, to=2-3]
\arrow[hook', from=2-2, to=2-1]
\arrow[from=2-2, to=2-3]
\end{tikzcd}has vertical maps weak equivalences, and the first horizontal map in each row a cofibration. Hence the induced map on pushouts
is a weak equivalence, completing the inductive step.
Lastly, we have assembled a morphism of direct systems
Diagram TeX source
\begin{tikzcd}
{\diag\Sk_{0}^{(2)}X} & {\diag\Sk_{1}^{(2)}X} & {\diag\Sk_{2}^{(2)}X} & \cdots \\
{\diag\Sk_{0}^{(2)}Y} & {\diag\Sk_{1}^{(2)}Y} & {\diag\Sk_{2}^{(2)}Y} & \cdots
\arrow[hook, from=1-1, to=1-2]
\arrow[from=1-1, to=2-1]
\arrow[hook, from=1-2, to=1-3]
\arrow[from=1-2, to=2-2]
\arrow[hook, from=1-3, to=1-4]
\arrow[from=1-3, to=2-3]
\arrow[hook, from=2-1, to=2-2]
\arrow[hook, from=2-2, to=2-3]
\arrow[hook, from=2-3, to=2-4]
\end{tikzcd}in which all vertical maps are weak equivalences and horizontal maps are cofibrations. Thus is a weak equivalence. Since preserves monomorphisms and colimits are computed degreewise, clearly both sides are exactly and , so we're done. □
as a fibrant replacement
In this section we get to the two main results of this post.
Theorem 18.¶ Let be a simplicial set. Then is a Kan complex.
Proof. Let be a horn. Since the source is a finite simplicial set, the map factors through for some . Thus it suffices to find a commutative diagram of the form:
Diagram TeX source
\begin{tikzcd}
{\Lambda^n_k} & {\Ex^r(X)} \\
{\D^n} & {\Ex^{r+1}(X)}
\arrow[from=1-1, to=1-2]
\arrow[hook, from=1-1, to=2-1]
\arrow[hook, from=1-2, to=2-2]
\arrow[dashed, from=2-1, to=2-2]
\end{tikzcd}By adjunction, this is in correspondence with commutative diagrams of the form:
Diagram TeX source
\begin{tikzcd}
{\Sd^2\Lambda^n_k} & {\Sd\Lambda^n_k} \\
{\Sd^2\D^n} & {\Ex^{r-1}(X)}
\arrow[from=1-1, to=1-2]
\arrow[hook, from=1-1, to=2-1]
\arrow[from=1-2, to=2-2]
\arrow[dashed, from=2-1, to=2-2]
\end{tikzcd}Therefore it will suffice to show that there is a diagonal map making the left-hand triangle commute. In other words, under Proposition 6, we may find a commutative triangle:
Diagram TeX source
\begin{tikzcd}
{s(\Lambda_ks[n])} & \\
{s(s[n])} & {\Lambda_ks[n]}
\arrow[hook, from=1-1, to=2-1]
\arrow[curve={height=-12pt}, from=1-1, to=2-2]
\arrow["\psi", from=2-1, to=2-2]
\end{tikzcd}We can define this explicitly as follows. First define an auxiliary function by if , and otherwise. Then we define
The following checks are in order:
- First view as a map to . Then it is obviously order-preserving (since is ordered by inclusion).
- If we have (i.e. ), then by definition of , . This says precisely that the triangle above commutes.
- It remains to see that for all . If then we already know this from (2); otherwise, we must have , so we just have to show that .
- Let be the largest element of in (if no element lies in then ). Then every satisfies , meaning . Hence , and since excludes some , also excludes .
We have found the requisite diagram, proving the horn-lifting property for . □
In the next result, we will use some basic properties of -homotopies and -homotopy equivalences (which we recall is stronger than being a weak homotopy equivalence). Most importantly:
-
Let be a -homotopy between and . Then for all simplicial sets we have an induced map
which corresponds (by adjunction) to a homotopy of the form
between and . In particular, if a map is a -homotopy equivalence, then so too is for all .
-
Let be a small category with a terminal object . For each object , the terminal map commutes with all other maps, meaning that it gives a natural transformation (where is the constant functor). In other words this is a homotopy , and it exhibits as a -homotopy equivalence with inverse . 1
Theorem 19.¶ Let be a simplicial set. For , the canonical map
is a weak homotopy equivalence. In particular, is a functorial fibrant replacement in .
Proof. It suffices to prove the case; indeed this will imply that is a Kan-Quillen trivial cofibration, and so the composite
(where possibly ) is a transfinite composition of trivial cofibrations, hence a trivial cofibration.
We define two bisimplicial sets as follows:
By definition, they fit into a canonical commutative diagram
Diagram TeX source
\begin{tikzcd}
{\D^0\boxtimes X} & {D(X)} \\
{\D^0\boxtimes \Ex{X}} & {E(X)}
\arrow[from=1-1, to=1-2]
\arrow[from=1-1, to=2-1]
\arrow[from=1-2, to=2-2]
\arrow[from=2-1, to=2-2]
\end{tikzcd}of bisimplicial sets, where on the top map is induced by projection, and the other map is
also induced by projection. If we apply to the square, the left-hand map becomes , so we want to show that the other three maps become weak equivalences. The trick will be to apply the diagonal lemma (Theorem 13) to each of these three arrows, but changing the parity for one.
-
Top arrow: Note that , so we use that
is a weak homotopy equivalence because is a -homotopy equivalence, as explained above. Then the diagonal lemma ensures that the induced diagonal map is a weak equivalence.
-
Bottom arrow: Now , and the map is
so for this case it suffices to see that preserves -homotopies. Indeed given we have the composite
as preserves products, giving the required homotopy.
-
Right arrow: This time we consider and apply the opposite of the diagonal lemma. This map is the lower arrow in the triangle:
Diagram TeX source
\begin{tikzcd} & X & \\ {\iHom(\D^n,X)} && {\iHom(\Sd\D^n,X)} \arrow[from=1-2, to=2-1] \arrow[from=1-2, to=2-3] \arrow[from=2-1, to=2-3] \end{tikzcd}Both legs of the triangle are applied to the -homotopy equivalences and (because and have terminal objects), hence are -homotopy equivalences. In particular the bottom map is a weak equivalence.
As explained, this implies that is a weak homotopy equivalence, completing the proof. □
Consequences for the Kan-Quillen model structure
Here are some of the immediate corollaries of the existence of as fibrant replacement. We begin with a simple but very useful one.
Example 20. If is a simplicial set, recall that we define the set as the coequalizer of . In other words, it is the quotient of by the equivalence relation generated by the existence of an edge between vertices. For instance, by definition for any and , so if is a Kan complex then this also equals . Evidently preserves colimits.
A fact which isn't immediate from the definitions is that sends arbitrary weak homotopy equivalences to bijections. To see this, first note that for a weak homotopy equivalence of Kan complexes, it is clear because
So for the general case we may prove that induces a bijection on . Since preserves colimits, it suffices to show that is a bijection, which is obvious: an edge between in provides one in , and an edge in between provides a zig-zag between and in .
Example 21. A fun immediate application of the previous example is that the following conditions are equivalent for a map :
- is a -homotopy equivalence.
- is a bijection for all .
- is a weak homotopy equivalence for all .
Indeed, the equivalence of the first two is clear, for instance by the Yoneda lemma applied to the quotient of by the congruence of -homotopy. We already showed that (1) implies that the map of (3) is a -homotopy equivalence, hence a weak equivalence. Conversely applying and the previous example to (3) yields (2).
Corollary 22.¶ The functors for and preserve and reflect homotopy (co)limits.
Proof. This is a completely general fact about a functor from a model category to itself, for which there is a natural transformation (or ) that is a pointwise weak equivalence. (The functors listed satisfy these conclusions by Proposition 9 and Theorem 19).
E.g. let's do the case of and homotopy limits, as the other cases are identical. Assuming the injective model structure on exists, let be a diagram and a cone. Because of our natural transformation, we have a commutative diagram
Diagram TeX source
\begin{tikzcd}
X & {\mathbf{R}\varprojlim D} \\
FX & {\mathbf{R}\varprojlim FD}
\arrow[from=1-1, to=1-2]
\arrow["\simeq", from=1-1, to=2-1]
\arrow["\simeq", from=1-2, to=2-2]
\arrow[from=2-1, to=2-2]
\end{tikzcd}in . The left-hand map is an isomorphism by assumption, and the morphism in is a weak equivalence (because they are pointwise in the injective model structure), hence induces an isomorphism in . □
Corollary 23.¶ If is a Kan fibration, then a commutative square of simplicial sets of the form
Diagram TeX source
\begin{tikzcd}
{X'} & {Y'} \\
X & Y
\arrow[from=1-1, to=1-2]
\arrow[from=1-1, to=2-1]
\arrow[from=1-2, to=2-2]
\arrow[from=2-1, to=2-2]
\end{tikzcd}is homotopy cartesian in if and only if the induced map
is a weak homotopy equivalence.
Proof. By Corollary 22, the diagram is homotopy cartesian iff the same is true after applying . Moreover since preserves finite limits, the new induced map
is obtained from applying to the old one; the pointwise weak equivalence also means that preserves and reflects weak equivalences. Therefore by Theorem 18 and Corollary 11, we may assume that , and are all Kan complexes. In this case we know that the claim holds in any model category. □
Example 24.¶ The most common use case of this result is the assertion that the pullback of a weak homotopy equivalence by a Kan fibration is a weak homotopy equivalence. Indeed, Corollary 23 shows that the corresponding cartesian square is homotopy cartesian, so the result follows.
Theorem 25. The fibrations in the Kan-Quillen model structure are precisely Kan fibrations, and the trivial cofibrations are precisely the anodyne extensions.
Proof. The two statements are equivalent, and we claim that it is enough to show that a Kan fibration which is a weak equivalence is a trivial fibration. Indeed if is a trivial cofibration, factor it as where is anodyne and is a Kan fibration. Then is a trivial fibration, so is a retract of by the retract lemma, hence anodyne.
Let be a Kan fibration which is a weak homotopy equivalence, and suppose that
Diagram TeX source
\begin{tikzcd}
{\partial\D^n} & X \\
{\D^n} & Y
\arrow["a", from=1-1, to=1-2]
\arrow[hook, from=1-1, to=2-1]
\arrow["p", from=1-2, to=2-2]
\arrow["\sigma", from=2-1, to=2-2]
\end{tikzcd}is a lifting problem. Let be the corresponding fiber, and note that Corollary 23 says that the defining square for is homotopy cartesian. In particular is both a weak equivalence and a Kan fibration between Kan complexes, hence a trivial fibration. We now move the lifting problem into the contractible fiber.
Let be the standard nullhomotopy with and . First we perform two lifts as in the diagrams below:
Diagram TeX source
\begin{tikzcd}
{\{1\}\times\partial\D^n} && X & {\partial\D^n} & F \\
{\D^1\times\partial\D^n} && Y & {\D^n} & {\D^0}
\arrow["a", from=1-1, to=1-3]
\arrow[hook, from=1-1, to=2-1]
\arrow["p", from=1-3, to=2-3]
\arrow["{\wt{h}_0}", from=1-4, to=1-5]
\arrow[from=1-4, to=2-4]
\arrow[from=1-5, to=2-5]
\arrow["{\wt{h}}"{description}, dashed, from=2-1, to=1-3]
\arrow["{\sigma h\rvert_{\partial\D^n}}"', from=2-1, to=2-3]
\arrow["c"{description}, dashed, from=2-4, to=1-5]
\arrow[from=2-4, to=2-5]
\end{tikzcd}On the left, commutativity is because we chose , and the lift exists because is anodyne. In particular , so factors through the fiber , and the right-hand diagram makes sense. Now we may form:
Diagram TeX source
\begin{tikzcd}
{\D^1\times\partial\D^n\cup\{0\}\times\D^n} && X \\
{\D^1\times\D^n} && Y
\arrow["{\wt{h}\cup c}", from=1-1, to=1-3]
\arrow[hook, from=1-1, to=2-1]
\arrow["p", from=1-3, to=2-3]
\arrow["g"{description}, dashed, from=2-1, to=1-3]
\arrow["{\sigma h}"', from=2-1, to=2-3]
\end{tikzcd}Here and agree on by construction, and restricts to on by construction. Likewise it restricts to on . Since the left-hand map above is anodyne, a lift exists. In particular the map satisfies
providing a solution to the initial lifting problem. □
References
- Denis-Charles Cisinski Higher Categories and Homotopical Algebra.
- Vihaan Dheer, Stable ∞-categories in algebraic geometry.
Footnotes
-
This also holds for an -category . Indeed, is a terminal object iff is a trivial fibration, so we can use a section to obtain . This corresponds to a map starting at the identity and ending at the constant map at . ↩︎