What's special about the Simplex category?

Question

I have been wondering lately what makes simplicial sets 'tick'.

Edited

The category $\Delta$can be viewed as the category of standard $n$-simplices and order preserving simplicial maps. The goal of simplicial sets is to build spaces out of these building blocks by gluing, and allow maps to be defined simplex by simplex, so it makes sense to take the free cocompletion of $\Delta$, the presheaf category $[\Delta^{op},\mathbf{Set}]$. The realisation functor $R : \Delta\to \mathbf{Top}$ can be readily extended to the cocompletion, so as to make $\hat{R}$ preserve colimits.

So my questions are:

• How do we intuitively understand why $\hat{R}$ preserves finite products? (I understand that there are some subtleties with $k$-ification)
• What makes $\Delta$ special in this way, that fails for say $\Gamma=\mathbf{FinSetSkel}$, ie. "symmetric simplicial sets" and cubical sets?
• What is your philosophy of simplicial sets?

Answer 1

Intuitively, I see the product-preservation or indeed finite limit preservation of geometric realization $\hat{R}: [\Delta^{op}, \mathbf{Set}] \to \mathbf{kSpace}$ as lifting (through the forgetful functor $U: \mathbf{kSpace} \to \mathbf{Set}$) a more basic left exact left adjoint $[\Delta^{op}, \mathbf{Set}] \to \mathbf{Set}$. The basic result is that such left exact left adjoints can be seen to correspond to linear orders with distinct top and bottom, aka intervals, and the specific interval being used for geometric realization is the standard unit interval $I = [0, 1]$.

There is a famous result from topos theory called Diaconescu's theorem, where left exact left adjoints $[C^{op}, \mathbf{Set}] \to \mathbf{Set}$ correspond (in the sense of an equivalence of categories) to filtered colimits of representables $C \to \mathbf{Set}$. In the case $C = \Delta$, to understand filtered colimits of representables $\hom_\Delta([n], -)$, it helps to know that the category of finite intervals is dual to the category of finite nonempty linear orders (the equivalence $\Delta^{op} \to \text{FinInt}$ takes $[n] = \{0 < 1 < \ldots < n\}$ to the interval $\hom_\Delta([n], \{0 < 1\})$, with $n+2$ elements). For example, take the restricted representable $\hom_{\text{Int}}(i-, I)$, restricting along the subcategory $i: \text{FinInt} \hookrightarrow \text{Int}$. Like any interval, the standard unit interval $I$ can be represented as a filtered colimit of the diagram of its finite subintervals and inclusions between them, say $I = \text{colim}_{d \in D}\; I_d$ where $I_d$ is an interval with $n_d + 2$ elements. Then the functor $\hom_{\text{Int}}(i-, I)$ is a filtered colimit of representables of $\Delta$:

$$\begin{array}{lll} \hom_{\text{Int}}(i-, I) & = & \hom_{\text{Int}}(i-, \text{colim}_d\; I_d): \text{FinInt}^{op} \to \mathbf{Set} \\ & \cong & \text{colim}_d\; \hom_{\text{Int}}(i-, I_d) \\ & \cong & \text{colim}_d \hom_\Delta([n_d], -): \Delta \to \mathbf{Set} \end{array}$$

(to get to the second line, note that for any finite subinterval $J$, the functor $\hom_{\text{Int}}(J, -)$ preserves filtered colimits, i.e., $J$ is finitely presentable in the category of intervals).

Summarizing, there are three main ingredients, all of which should be considered soft and conceptual:

• $\Delta$ is dual to the category of finite intervals;

• The Ind-completion of the category of finite intervals is the category of all intervals, in which finite intervals are the finitely presentable objects;

• This implies that filtered colimits of representables $\Delta \to \mathbf{Set}$, or left exact left adjoints $[\Delta^{op}, \mathbf{Set}] \to \mathbf{Set}$, are classified by intervals, and we pick the standard interval to get (the underlying set of) geometric realization to be left exact.

In particular, the canonical continuous map

$$\hat{R}(\hom_\Delta(-, [m]) \times \hom_\Delta(-, [n])) \to \hat{R}(\hom_\Delta(-, [m])) \times \hat{R}(\hom_\Delta(-, [n]))$$

is a bijection at the underlying set level. Coupled with a brief argument that the left side is compact and the right side is Hausdorff, this map is a homeomorphism.

Then one finishes off with a formal calculation where general simplicial sets $X$ are colimits of representables:

$$\begin{array}{lll} \hat{R}(X \times Y) & \cong & \hat{R}(\text{colim}_d \; \hom(-, [n_d]) \times \text{colim}_e \; \hom(-, [n_e])) \\ & \cong & \hat{R}(\text{colim}_{d, e} \; \hom(-, [n_d]) \times \hom(-, [n_e])) \\ & \cong & \text{colim}_{d, e} \; \hat{R}(\hom(-, [n_d]) \times \hom(-, [n_e])) \\ & \cong & \text{colim}_{d, e} \; \hat{R}(\hom(-, [n_d])) \times \hat{R}(\hom(-, [n_e])) \\ & \cong & \text{colim}_d \; \hat{R}(\hom(-, [n_d])) \times \text{colim}_e \; \hat{R}(\hom(-, [n_e])) \\ & \cong & \hat{R}(\text{colim}_d \; \hom(-, [n_d)) \times \hat{R}(\text{colim}_e \; \hom(-, [n_e])) \\ & \cong & \hat{R}(X) \times \hat{R}(Y) \end{array} $$

where the crucial step is to the fifth line; this is where we use the fact that $\mathbf{kSpace}$ is cartesian closed, so that the cartesian product in $\mathbf{kSpace}$ preserves colimits in each of its two arguments (which is not the case for $\mathbf{Top}$). (The second line is similar; we use the fact that simplicial sets is cartesian closed.)

Anyway, I hope the crucial role of the order of combinatorial simplices is apparent here. I don't think I have a single philosophy of simplicial sets, because simplicial sets has many hearts. For example, the category of finite ordinals, including the empty one, is the initial monoidal category with a monoid; this is incredibly important for bar constructions. But for another, see this lovely blog post by Tom Leinster.

Answer 2

This is mostly a response to the title question and the third question in the body; I have nothing intelligent to say about finite products. The point of view I want to defend here is the following:

Simplicial objects are a natural generalization of coequalizer diagrams to higher category theory.

The story in ordinary category theory

Let $C$ be an ordinary category and let $F : J \to C$ be a diagram in $C$. For reasons that will hopefully be clear, let me write $J_0$ for the objects of $J$ and $J_1$ for the morphisms. Recall that to compute colimits in $C$ it suffices to be able to compute coproducts and coequalizers, since whenever these exist $\text{colim}(F)$ can be written as the coequalizer of the diagram

$$\bigsqcup_{j_1 \in J_1} F(\text{source}(j_1)) \rightrightarrows \bigsqcup_{j_0 \in J_0} F(j_0)$$

where the two arrows are, respectively, the identity arrows $F(\text{source}(j_1)) \to F(\text{source}(j_1))$ and the compositions $F(\text{source}(j_1)) \xrightarrow{F(j_1)} F(\text{target}(j_1))$. Thus, informally, "colimits are generated by coproducts and coequalizers."

One way to think about this construction is to think of a coequalizer diagram $E \rightrightarrows V$ as being an internal graph in a category, with $E$ being the object of edges and $V$ being the object of vertices, where the two arrows specify the source resp. the target of the edges. The coequalizer, then, is the object of connected components of this internal graph, since we identify the sources of all of the edges with the targets; in other words, it computes $\pi_0$ of the internal graph.

The above decomposition of an arbitrary colimit into coproducts and then a coequalizer is just saying that all colimits are computed by taking the coproduct of a bunch of things, then making some identifications, and that moreover these identifications can all be computed by a single coequalizer which packages together all of the identifications that need to be done using another coproduct. Before taking the coequalizer, the diagram above is an internal graph that describes all of the identifications that need to be done.

The story in higher category theory

Now let $C$ be the $(\infty, 1)$-category of spaces, although $C$ can be replaced by any $(\infty, 1)$-category, and let $F : J \to C$ be a diagram in $C$. For ease of exposition let's take $J$ to be an ordinary category although I believe $J$ can in full generality be another $(\infty, 1)$-category, and in particular can be an $\infty$-groupoid, e.g. a space. We now want to compute the $(\infty, 1)$-colimit, or equivalently the homotopy colimit, of $F$ in a way analogous to the coequalizer recipe above.

However, in the homotopical setting it is not enough to be able to compute coproducts and homotopy coequalizers. The problem is that when we take homotopy coequalizers, we never identify things; instead, we add $1$-cells between things, and in particular if we identify things multiple times we end up adding multiple $1$-cells. Some of these $1$-cells should be the "same $1$-cell" and we need to account for this; that is, we should also glue in extra $2$-cells between $1$-cells. But then we run into the same problem one level up and need to glue in extra $3$-cells between $2$-cells, and so forth.

Example. Let $J$ be the one-object category corresponding to a discrete group $G$ and let $F : J \to C$ be the trivial diagram. Then the homotopy coequalizer recipe above, when taken in spaces, takes a point and adds to it a loop for every element of $G$. In other words, we get $BF_{|G|}$, the classifying space of the free group on the underlying set of $G$, whereas the correct homotopy colimit is $BG$. The discrepancy is due to the fact that we have failed to account for the relations among the elements of $G$. If we did this by gluing in appropriate $2$-cells then we get a $2$-complex which now has the correct $\pi_1$ but the wrong higher homotopy. The discrepancy is now due to the fact that we have failed to account for the relations among the relations, and so forth.

(If $F$ is a nontrivial diagram, then the homotopy colimit computes the homotopy quotient $F(\text{pt}) \times_G EG$.)

Example. To give at least one example where $C$ isn't spaces, let $C$ be chain complexes of abelian groups. Then the correct homotopy colimit of the diagram $J$ from the previous example is (up to quasi-isomorphism) the complex computing the group cohomology of $G$ with coefficients in $\mathbb{Z}$, whereas the homotopy coequalizer only gives the zeroth and first terms $\mathbb{Z}[G] \to \mathbb{Z}$.

(If $F$ is a nontrivial diagram, then the homotopy colimit computes the group cohomology of $G$ with coefficients in $F(\text{pt})$.)

So let's follow our noses. To compute the homotopy colimit $\text{hocolim}(F)$ we might as well write down the diagram

$$\bigsqcup_{j_1 \in J_1} F(\text{source}(j_1)) \rightrightarrows \bigsqcup_{j_0 \in J_0} F(j_0)$$

to start with and then keep on fixing it. As mentioned above, the problem with this diagram is that in its homotopy coequalizer we've added in redundant $1$-cells without specifying $2$-cells relating them. These come from composition of morphisms in $J$: that is, for all composable morphisms $j_1, j_1'$ there's an identification involving $j_1$ and an identification involving $j_1'$ which makes the identification involving $j_1 \circ j_1'$ redundant. So we need to add in $2$-cells corresponding to all pairs of composable morphisms in $J$. Let me write $J_2$ for this set. Then we should extend the diagram above to a diagram

$$\bigsqcup_{j_2 \in J_2} F(\text{source}(j_2)) \substack{\longrightarrow\\[-1em] \longrightarrow \\[-1em] \longrightarrow} \bigsqcup_{j_1 \in J_1} F(\text{source}(j_1)) \rightrightarrows \bigsqcup_{j_0 \in J_0} F(j_0)$$

where the new three arrows correspond to the three morphisms $j_1, j_1', j_1 \circ j_1'$ you can write down starting from a composable pair $j_2 = (j_1, j_1')$ of morphisms, and $\text{source}(j_2)$ denotes $\text{source}(j_1)$ (my convention for composition here is opposite the usual one; for $j_1 \circ j_1'$ to be defined means that the target of $j_1$ is the source of $j_1'$); these are the three $1$-cells bounding a $2$-cell that we now want to put in to fix the redundancy we created.

But of course now we have redundant $2$-cells, and so forth. Hopefully you've anticipated the end of the story by now: in the end we need to consider the entire nerve of $J$, and to compute the homotopy colimit we compute the geometric realization of the simplicial object built from the nerve by applying $F$. Thus we can generalize "colimits are generated by coproducts and coequalizers" to, at least for the case of category-indexed diagrams in spaces, "homotopy colimits are generated by coproducts and geometric realizations."

(I haven't told you what I mean by the geometric realization of a simplicial object in an arbitrary $(\infty, 1)$-category. The tautological definition is that it is the homotopy colimit. In particular, I don't mean the thing you get by starting from an arbitrary cosimplicial object.)

Answer 3

Your question is too broad, but I think that the work of Grothendieck and Cinsinski (and of course, Maltsiniotis) should be mentioned here. Grothendieck introduced the notion of test category in Pursuing stacks (will we ever be able to fully exploit the great amount of ideas contained there?). Those are the categories that presheaves of sets over them produce models for homotopy types of CW-complexes. Therefore that is the answer to what is special about $\Delta$ (and also an answer to what is not, since there are tons of test categories). Cisinski showed that presheaves of sets over a test category have a model structure. He has an excellent book on this, that you can download from:

http://www.math.univ-toulouse.fr/~dcisinsk/ast.pdf

Answer 4

I feel one should also be somewhat eclectic and consider not only advantages but also comparative disadvantages of any candidate for a central categorical role.

I admit to special pleading here since our 2001 EMS Tract on Nonabelian algebraic topology gives a major role for a homotopical foundation of algebraic topology to cubical sets. The point is that in the usual simplicial $\infty$-category theory the emphasis is on the Kan condition. In the cubical theory, the emphasis is on compositions. This allows for the replacement of the usual formal sums in basic homology theory by actual compositions of pieces for homotopically defined functors. See this mathoverflow discussion.

Dan Kan's thesis and first (1955) paper were cubical, as best for intuition and conjectures, but severe disadvantages were found in the category of cubical sets by workers at Princeton. One disadvantage was that cubical groups, unlike simplicial groups, were not Kan complexes. Another was the realisation of the cartesian product of cubical sets, which had the wrong homotopy type, again unlike simplicial sets. So it was assumed that the cubical theory was quite unfixable.

However work at Bangor in the 1970s with Chris Spencer and Philip Higgins, starting with the relation between double groupoids and crossed modules, found it necessary to introduce a new type of "degenerate" cube based on the monoid structures max and min on the unit interval $I=[0,1]$.The standard degeneracy in cubical sets yields cubes with opposite faces the same, where these new had some adjacent faces the same, and so made the theory a bit nearer to the simplicial theory. These new structures were called connections, because of a relation with path connections in differential geometry.

As Philippe Gaucher points out, Andy Tonks proved in 1992 that cubical groups with connections were Kan complexes. In 2005, Georges Maltsiniotis proved that the geometric realisation of of the cartesian product of cubical sets with connections has the correct homotopy type.

There are two main reasons for using cubical sets. One is the formula $I^m \times I^n \cong I^{m+n}$, which makes for a good tensor product of cubical sets, and also allows a convenient and direct definition of homotopies.

The second and for our purposed major reason for using cubical sets is expressed in the slogan "algebraic inverses to subdivision", which is an elaboration of the idea of composition in cubical sets. The standard singular cubical set $S^{\Box} X$ of a topological space ie easily equipped with $n$ partial compositions in dimension $n$ giving $S^{\Box} X$ the structure of weak $\infty$-groupoid. A simple matrix/array notation $[a_{(r)}]$ allows for the expression of multiple partial compositions of $n$-cubes which are compatible in all the directions. This gives meaning to "algebraic inverses to subdivision". This is one of the basic intuitions behind the first proofs of higher versions of the Seifert-van Kampen Theorem.

It is not at all clear to me how these ideas can be expressed in simplicial terms.

There is further discussion of the intuition of these uses of cubical sets in talks I gave in Paris on June 5, 2014, and Galway, December 2014, available on my preprint page.

March, 2015: I have since learned that cubical sets with connection are used in the theory of motives in this paper. It seems that the degeneracies in cubes work better here than in simplices. Another paper compares cubical and simplicial derived functors. Both these papers use cubical sets with connections, which were introduced in JPAA 1981 by Philip Higgins and me. These additional kind of degeneracies go some way to correcting some well known deficiences of the usual cubical sets, in terms of cubical groups and geometric realisations of cartesian products - see the talks referred to above. <------->

Answer 5

Concerning your second question, indeed the realization functor from cubical sets to topological spaces does not preserve finite products. But it does by adding degeneracy maps called connection maps. The typical example of cubical set with connections is the cubical nerve of a topological space. Read the page devoted to this subject in the nLab for some explanations. Another related fact is that cubical groups are not necessarily Kan (unlike simplicial groups). But cubical groups with connections are Kan: A. Tonks, Cubical groups which are Kan, Journal of Pure and Applied Algebra 81 (1992) 83-87.