A detailed look at the Szczarba map
1. Introduction
The purpose of this note is to give a detailed explanation on how to arrive to the formulae (3.11 - 3.12) in [MRZ23] giving rise to an explicit natural transformation
between two functors that we now recall. Denote by the category of simplicial sets and by the category of categories enriched over the monoidal category of simplicial sets with cartesian product. The functor is the left adjoint of the homotopy coherent nerve functor defined by Cordier to make sense of homotopy coherent diagrams and used by Lurie to compare two models for the theory of -categories. Conceptually, provides a combinatorial construction that allows to think of a simplicial set as a category with higher structure on the morphisms described in terms of sequences of simplices connecting two vertices. The functor is the left adjoint of Kan’s classifying space construction usually denoted by , and was used by Dwyer and Kan to recast the theory of homotopy types in terms of simplicial groupoids (after formally inverting all morphisms). Conceptually, the localized version of was used in the literature to provide a combinatorial model of the path category (the many object version of the topological monoid of based loops) in terms of a simplicial set presenting a homotopy type. We recall the precise definitions of and below.
The explicit formula we shall derive for the natural transformation is reminiscent of a map defined by Szczarba in terms of certain "simplicial operators" when comparing two chain models for a fibration. [Szc61]. This is the reason why we call the Szczarba map.
This note may be taken as a companion to section 3 of [MRZ23], where we show that induces a weak equivalence after localizing both and in the context of comparing different combinatorial models for the based loop space and path category.
2. The functors and
Denote by the standard -simplex. Let us first define two poset-enriched categories and .
Definition 2.1.
The objects of are the elements of . Given , let denote the poset
For , let be the trivial poset. The idea here is that is the unique non-degenerate -simplex in , and the elements of the poset are the vertices of . Recall an -simplex in the nerve of a poset is precisely an ordered collection of elements in .
For , define
(2.1) |
and for , set , the trivial poset. The composition rule for is given by the cartesian product of sequences (i.e. freely concatenating sequences).
For example, the poset-enriched category looks like
(2.2) |
Note that every arrow in the above picture is a poset.
With the cosimplicial maps given in [MRZ23, Definition 3.2], defines a cosimplicial poset-enriched category.
Definition 2.2.
The objects of are the elements of . Given , let denote the poset whose elements are subsets of the form and we let if and only if . For , let be the trivial poset. The composition rule for is given by taking union of subsets.
For example, the poset-enriched category looks like
Note that every arrow in the above picture is a poset.
With the cosimplicial maps given in [MRZ23, Definition 3.7], defines a cosimplicial poset-enriched category.
Any poset-enriched category gives rise to a simplicial category by applying the nerve functor at the level of posets of morphisms; we denote this functor by
and define and . These constructions completely determine two functors and from to through Kan extension since the category is cocomplete. Namely, for any arbitrary simplicial set we define
and
3. An explicit formula for the Szczarba map
In [Hin07, Section 2.6.1], Hinich defines a map of cosimplicial poset-enriched categories
It is defined as the identity on objects and on posets of morphisms
is given on “indecomposable" elements by
Then on any element , with , one may define
Example 3.1.
For in , we have
The goal is to obtain an explicit formula for the morphism of simplicial categories
We shall denote this functor of simplicial categories by .
It is enough to consider the non-degenerate -simplices of . For a fixed , let and . Consider the set of non-degenerate -simplices of . There is an obvious bijection , where
For , we set , and we call the empty sequence. From now on, we identify sequences as above with non-degenerate -simplices in .
Given an -simplex
we shall describe a formula for the resulting -simplex
Therefore will have components corresponding to each for . For each fixed , we shall give a formula for the -th component , in terms of a simplicial operator that will be defined inductively. Note must be an -simplex in , so it is enough to specify all of its vertices. Lets use the notation , where , to denote the -simplex corresponding to in .
Example 3.2.
For the -simplex corresponding to
we obtain the -simplex
Writing this component-wise as
we can see that for each with , we obtain a -simplex in . These are given by
Thus for , we have , and .
For a fixed , it is easy to obtain , as it will appear in as , which corresponds to the vertex in the poset . Thus for every .
Now suppose we start with , corresponding to and and add to it. We thus wish to compute . But we will need to know the data of . In fact all the higher will depend on the sequence . We define a function
so that
As mentioned, we have .
When we add , we obtain a -simplex , which gives
Note that for , the coefficients for do not change. For , we see that the vertex corresponds to , which is the -th element of the linear ordering . Thus we have
We now compute given we have computed
This corresponds to the -simplex . In order to see which of the will be affected, we must know where appears amongst the if they are put in order.
For this we define to be the largest integer in such that . This number will tell us the lower bound for the range of for which the coefficients of will not change. Within the range , we know that the coefficient of will change to , by inspecting what happens within Hinich’s formula. This is the -th element of the linear ordering of . Outside of this range, we know that the coefficients for will not change. Thus we define
(3.1) |
For any sequence we have constructed corresponding to the -simplex in . From the sequence we wish to obtain a simplicial operator , defined inductively, such that . Namely, is the th vertex of the -simplex .
So assuming , where , we wish to know what simplicial operator we need in order to produce thinking of as . If , then this is easy, namely we need only set , since
If , we can obtain from by noticing
Then applying , where the superscript ′ means to add one to every index in the simplicial operator, will "skip over" the first and will then "cross out" everything else but , but now this will be placed after the additional , leaving
It follows that the desired operators may be defined by induction on , the length of , as follows. For the empty sequence, define
Suppose we have defined for any of length less than . If has length , define
(3.2) |
In summary, we have shown that the map
is given on any
by the formula
We finish by repeating Example 3.15 from [MRZ23].
Example 3.3.
Consider the -simplex in given by
This simplex corresponds to the sequence . So with , we compute
(3.3) |
With this we can then compute
(3.4) | ||||
A similar computation gives
We include a diagram illustrating the map .
The diagram on the left is an illustration of the nondegenerate simplices in and similarly on the right for . The red subdiagram on the right shows the image of the Szczarba map.
References
- [Hin07] Vladimir Hinich “Homotopy coherent nerve in Deformation theory”, 2007 arXiv:0704.2503 [math.QA]
- [MRZ23] Emilio Minichiello, Manuel Rivera and Mahmoud Zeinalian “Categorical models for path spaces” In Adv. Math. 415, 2023 arXiv:2201.03046
- [Szc61] Robert Henry Szczarba “The homology of twisted cartesian products” In Transactions of the American Mathematical Society 100.2 JSTOR, 1961, pp. 197–216