The past few posts have been focused on a discussion of Lurie’s version of the Dold-Kan correspondence in stable \infty-categories. I’ve made these posts more detailed than usual: while I’ve been trying to treat such category theory as a black box on this blog, it should be interesting (at least for me) to see how the machines work beneath the surface, in some specific examples. In previous posts, I stated the result, and described an important lemma on the structure of simplicial objects in a stable \infty-category, which depended on the combinatorics of cubes.

The goal of this post is to (finally) prove the result, an equivalence of {\infty}-categories

\displaystyle \mathrm{Fun}(\Delta^{op}, \mathcal{C}) \simeq \mathrm{Fun}( \mathbb{Z}_{\geq 0}, \mathcal{C}),

valid for any stable {\infty}-category {\mathcal{C}}. As before, the intuition behind this version of the Dold-Kan correspondence is that a simplicial object determines a filtered object by taking successive geometric realizations of the {n}-truncations. The fact that one can go in reverse, and reconstruct the simplicial object from the geometric realizations of the truncations, is specific to the stable case. (more…)

Let {\mathcal{C}} be a stable {\infty}-category. In the previous post, we needed to consider cubical diagrams

\displaystyle f: (\Delta^1)^{n+1} \rightarrow \mathcal{C}.

These diagrams come with an initial object and a terminal object: in fact, they are the cones on smaller diagrams. For instance, {(\Delta^1)^{n+1}} is the nerve of all subsets of {[n]}, which is the cone on the nerve of all nonempty subsets of {[n]}, and also the cone on the nerve of all proper subsets of {[n]}. So it makes sense to talk about whether {f} is a limit diagram, or whether {f} is a colimit diagram.

The main result is:

Proposition 11 (Cube lemma) If {\mathcal{C}} is stable, then {f: (\Delta^1)^{n+1} \rightarrow \mathcal{C}} is a limit diagram if and only if it is a colimit diagram.


When {n = 0}, this is automatic: any diagram {\Delta^1 \rightarrow \mathcal{C}} is a limit diagram if and only if it is an equivalence, and ditto for colimit diagrams. When {n = 1}, this is particular to the stable case: a square is a push-out if and only if it is a pull-back. We took this as more or less axiomatic, though it can be deduced from much weaker axioms, as in “Higher Algebra.”

The purpose of this post is to work through the proof of the “cube lemma.” This is more or less a piece of an attempt to work through Lurie’s version of the Dold-Kan correspondence. I’ve been doing it in a fair bit of detail for my own benefit — this means that the posts are a little more detailed than usual. In any event, the present post should stand alone from the others. (more…)

Let {\mathcal{C}} be a stable {\infty}-category. For us, this means that we have three important properties:

  1. {\mathcal{C} } admits finite limits and colimits.
  2. {\mathcal{C}} has a zero object: that is, the initial object is also final.
  3. A square in {\mathcal{C}} is a pull-back if and only if it is a push-out.

This is equivalent to the stability of {\mathcal{C}}. Actually, stability is usually defined using slightly weaker conditions, and then it takes a little work to show that these stronger ones are implied. We’ll just work with these. Stability can be thought of as a higher-categorical version of being triangulated; a general stable \infty-category has many of the properties (in a higher categorical sense) of the homotopy category of spectra, or the (classical) derived category.

Our goal is to show that in this case, we have an equivalence of {\infty}-categories

\displaystyle \mathrm{Fun}(\Delta^{op}, \mathcal{C}) \simeq \mathrm{Fun}(\mathbb{Z}_{\geq 0}, \mathcal{C})

between simplicial objects in {\mathcal{C}} and filtered (nonnegatively) objects in {\mathcal{C}}. The idea here is that the geometric realization of a simplicial object comes with a canonical filtration, given by geometric realizing the {n}-truncations for each {n}. This is going to give the associated filtered object. (We don’t know that the geometric realization exists, but the realizations of the truncations will.)

We will actually prove something stronger: for each {n}, there is an equivalence

\displaystyle \mathrm{Fun}(\Delta^{op}_{\leq n}, \mathcal{C}) \simeq \mathrm{Fun}( [0, n], \mathcal{C}), \ \ \ \ \ (1)

where {[0, n] \subset \mathbb{Z}_{\geq 0}} is the subcategory of elements {\leq n}. In other words, {n}-truncated simplicial objects are the same as {n}-filtered objects of {\mathcal{C}}. (Note that, as a simplicial set, the nerve of {[0, n]} is {\Delta^n}.) These equivalences will be compatible, and taking inverse limits will give the Dold-Kan correspondence. (more…)