This paper was converted on www.awesomepapers.org from LaTeX by an anonymous user.
Want to know more? Visit the Converter page.

A detailed look at the Szczarba map

Emilio Minichiello E.M., Department of Mathematics, CUNY Graduate Center [email protected] Manuel Rivera M.R., Department of Mathematics, Purdue University [email protected]  and  Mahmoud Zeinalian M.Z., Department of Mathematics, Lehman College of CUNY [email protected]

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

Sz:GSz\colon\mathfrak{C}\xRightarrow{}G

between two functors that we now recall. Denote by 𝗌𝖲𝖾𝗍\mathsf{sSet} the category of simplicial sets and by 𝖢𝖺𝗍𝗌𝖲𝖾𝗍\mathsf{Cat}_{\mathsf{sSet}} the category of categories enriched over the monoidal category of simplicial sets with cartesian product. The functor :𝗌𝖲𝖾𝗍𝖢𝖺𝗍𝗌𝖲𝖾𝗍\mathfrak{C}\colon\mathsf{sSet}\to\mathsf{Cat}_{\mathsf{sSet}} 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 \infty-categories. Conceptually, \mathfrak{C} 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 G:𝗌𝖲𝖾𝗍𝖢𝖺𝗍𝗌𝖲𝖾𝗍G\colon\mathsf{sSet}\to\mathsf{Cat}_{\mathsf{sSet}} is the left adjoint of Kan’s classifying space construction usually denoted by W¯:𝖢𝖺𝗍𝗌𝖲𝖾𝗍𝗌𝖲𝖾𝗍\overline{W}\colon\mathsf{Cat}_{\mathsf{sSet}}\to\mathsf{sSet}, 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 GG 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 \mathfrak{C} and GG below.

The explicit formula we shall derive for the natural transformation SzSz 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 SzSz the Szczarba map.

This note may be taken as a companion to section 3 of [MRZ23], where we show that SzSz induces a weak equivalence after localizing both \mathfrak{C} and GG in the context of comparing different combinatorial models for the based loop space and path category.

2. The functors GG and \mathfrak{C}

Denote by Δn𝗌𝖲𝖾𝗍\Delta^{n}\in\mathsf{sSet} the standard nn-simplex. Let us first define two poset-enriched categories PG(Δn)P_{G}(\Delta^{n}) and P(Δn)P_{\mathfrak{C}}(\Delta^{n}).

Definition 2.1.

The objects of PG(Δn)P_{G}(\Delta^{n}) are the elements of [n]={0,1,,n}[n]=\{0,1,\dots,n\}. Given 0kn0\leq k\leq n, let gknk\langle g_{k}\rangle^{n-k} denote the poset

gknk={d1nkgkd1nk1d0gkd1d0nk1gkd0nkgk}.\langle g_{k}\rangle^{n-k}=\{d_{1}^{n-k}g_{k}\leq d_{1}^{n-k-1}d_{0}g_{k}\leq\dots\leq d_{1}d_{0}^{n-k-1}g_{k}\leq d_{0}^{n-k}g_{k}\}.

For n=kn=k, let gk0={gk}\langle g_{k}\rangle^{0}=\{g_{k}\} be the trivial poset. The idea here is that gkg_{k} is the unique non-degenerate (nk)(n-k)-simplex in NgknkΔnkN\langle g_{k}\rangle^{n-k}\cong\Delta^{n-k}, and the elements of the poset are the vertices of gkg_{k}. Recall an \ell-simplex xx in the nerve of a poset PP is precisely an ordered collection (x1x2x)(x_{1}\leq x_{2}\leq\dots\leq x_{\ell}) of elements in PP.

For 0p<qn0\leq p<q\leq n, define

(2.1) PG(Δn)(p,q)=gqnq×gq1n(q1)××gp+1n(p+1),P_{G}(\Delta^{n})(p,q)=\langle g_{q}\rangle^{n-q}\times\langle g_{q-1}\rangle^{n-(q-1)}\times\dots\times\langle g_{p+1}\rangle^{n-(p+1)},

and for p=qp=q, set PG(Δn)(q,q)={idq}P_{G}(\Delta^{n})(q,q)=\{\text{id}_{q}\}, the trivial poset. The composition rule for PG(Δn)P_{G}(\Delta^{n}) is given by the cartesian product of sequences (i.e. freely concatenating sequences).

For example, the poset-enriched category PG(Δ2)P_{G}(\Delta^{2}) looks like

(2.2) 1{1}0{0}2{2}g11={d1g1d0g1}\scriptstyle{\langle g_{1}\rangle^{1}=\{d_{1}g_{1}\leq d_{0}g_{1}\}}g20={g2}\scriptstyle{\langle g_{2}\rangle^{0}=\{g_{2}\}}g20×g11={(g2,d1g1)(g2,d0g1)}\scriptstyle{\langle g_{2}\rangle^{0}\times\langle g_{1}\rangle^{1}=\{(g_{2},d_{1}g_{1})\leq(g_{2},d_{0}g_{1})\}}

Note that every arrow in the above picture is a poset.

With the cosimplicial maps given in [MRZ23, Definition 3.2], [n]PG(Δn)[n]\mapsto P_{G}(\Delta^{n}) defines a cosimplicial poset-enriched category.

Definition 2.2.

The objects of P(Δn)P_{\mathfrak{C}}(\Delta^{n}) are the elements of [n]={0,1,,n}[n]=\{0,1,\dots,n\}. Given 0p<qn0\leq p<q\leq n, let P(p,q)P_{\mathfrak{C}}(p,q) denote the poset whose elements are subsets of the form U={p,i1,,i,q}{p,p+1,,q1,q}U=\{p,i_{1},\dots,i_{\ell},q\}\subseteq\{p,p+1,\dots,q-1,q\} and we let UVU\leq V if and only if VUV\subseteq U. For p=qp=q, let P(q,q)={q}P_{\mathfrak{C}}(q,q)=\{q\} be the trivial poset. The composition rule for P(Δn)P_{\mathfrak{C}}(\Delta^{n}) is given by taking union of subsets.

For example, the poset-enriched category P(Δ2)P_{\mathfrak{C}}(\Delta^{2}) looks like

1{1}0{0}2{2}{0,1}\scriptstyle{\{0,1\}}{1,2}\scriptstyle{\{1,2\}}{0,1,2}{0,2}\scriptstyle{\{0,1,2\}\leq\{0,2\}}

Note that every arrow in the above picture is a poset.

With the cosimplicial maps given in [MRZ23, Definition 3.7], [n]P(Δn)[n]\mapsto P_{\mathfrak{C}}(\Delta^{n}) 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

N𝖢𝖺𝗍:𝖢𝖺𝗍𝖯𝗈𝗌𝖾𝗍𝖢𝖺𝗍𝗌𝖲𝖾𝗍,N^{\mathsf{Cat}}\colon\mathsf{Cat}_{\mathsf{Poset}}\to\mathsf{Cat}_{\mathsf{sSet}},

and define (Δn)=N𝖢𝖺𝗍(P(Δn))\mathfrak{C}(\Delta^{n})=N^{\mathsf{Cat}}(P_{\mathfrak{C}}(\Delta^{n})) and G(Δn)=N𝖢𝖺𝗍(PG(Δn))G(\Delta^{n})=N^{\mathsf{Cat}}(P_{G}(\Delta^{n})). These constructions completely determine two functors \mathfrak{C} and GG from 𝗌𝖲𝖾𝗍\mathsf{sSet} to 𝖢𝖺𝗍𝗌𝖲𝖾𝗍\mathsf{Cat}_{\mathsf{sSet}} through Kan extension since the category 𝖢𝖺𝗍𝗌𝖲𝖾𝗍\mathsf{Cat}_{\mathsf{sSet}} is cocomplete. Namely, for any arbitrary simplicial set XX we define

(X):=colim ΔnX(Δn)\mathfrak{C}(X):=\underset{{\Delta^{n}\to X}}{\text{colim }}\mathfrak{C}(\Delta^{n})

and

G(X):=colim ΔnXG(Δn).G(X):=\underset{{\Delta^{n}\to X}}{\text{colim }}G(\Delta^{n}).

3. An explicit formula for the Szczarba map

In [Hin07, Section 2.6.1], Hinich defines a map of cosimplicial poset-enriched categories

Hin:P(Δ)PG(Δ).\text{Hin}:P_{\mathfrak{C}}(\Delta^{\bullet})\to P_{G}(\Delta^{\bullet}).

It is defined as the identity on objects and on posets of morphisms

Hin:P(Δn)(p,q)PG(Δn)(p,q)\text{Hin}:P_{\mathfrak{C}}(\Delta^{n})(p,q)\to P_{G}(\Delta^{n})(p,q)

is given on “indecomposable" elements by

Hin({p,q})=(d1nqgq,d1nqd0gq1,,d1nqd0q(p+1)gp+1).\text{Hin}(\{p,q\})=(d_{1}^{n-q}g_{q},\,d_{1}^{n-q}d_{0}g_{q-1},\,\dots\,,\,d_{1}^{n-q}d_{0}^{q-(p+1)}g_{p+1}).

Then on any element U={p,i1,,i,q}P(Δn)(p,q)U=\{p,i_{1},\dots,i_{\ell},q\}\in P_{\mathfrak{C}}(\Delta^{n})(p,q), with p<i1<i2<<i<qp<i_{1}<i_{2}<\dots<i_{\ell}<q, one may define

Hin({p,i1,,i,q})=(Hin({i,q}),,Hin({p,i1})).\text{Hin}(\{p,i_{1},\dots,i_{\ell},q\})=(\text{Hin}(\{i_{\ell},q\}),\,\dots\,,\,\text{Hin}(\{p,i_{1}\})).
Example 3.1.

For {0,2,4}\{0,2,4\} in P(Δ5)(0,5)P_{\mathfrak{C}}(\Delta^{5})(0,5), we have

Hin({0,2,4})\displaystyle\text{Hin}(\{0,2,4\}) =(Hin({2,4}),Hin({0,2}))\displaystyle=(\text{Hin}(\{2,4\}),\text{Hin}(\{0,2\}))
=(d1g4,d1d0g3,d13g2,d13d0g1).\displaystyle=(d_{1}g_{4},d_{1}d_{0}g_{3},d_{1}^{3}g_{2},d_{1}^{3}d_{0}g_{1}).

The goal is to obtain an explicit formula for the morphism of simplicial categories

N𝖢𝖺𝗍Hin:(Δn)G(Δn).N^{\mathsf{Cat}}\text{Hin}:\mathfrak{C}(\Delta^{n})\to G(\Delta^{n}).

We shall denote this functor of simplicial categories by SzΔnSz_{\Delta^{n}}.

It is enough to consider the non-degenerate \ell-simplices of (Δn)(p,q)\mathfrak{C}(\Delta^{n})(p,q). For a fixed n1n\geq 1, let 0p<qn0\leq p<q\leq n and 0qp10\leq\ell\leq q-p-1. Consider the set nd((Δn)(p,q))\text{nd}(\mathfrak{C}(\Delta^{n})(p,q)_{\ell}) of non-degenerate \ell-simplices of (Δn)(p,q)\mathfrak{C}(\Delta^{n})(p,q). There is an obvious bijection nd((Δn)(p,q))Sp,q\text{nd}(\mathfrak{C}(\Delta^{n})(p,q)_{\ell})\cong S^{\ell}_{p,q}, where

Sp,q={i=(i1,,i){p+1,,q1}×:iris, for rs}.S^{\ell}_{p,q}=\{i=(i_{1},\dots,i_{\ell})\in\{p+1,\dots,q-1\}^{\times\ell}\;:\>i_{r}\neq i_{s},\text{ for }r\neq s\}.

For =0\ell=0, we set Sp,q0={}S^{0}_{p,q}=\{\emptyset\}, and we call \emptyset the empty sequence. From now on, we identify sequences (i1,,i)(i_{1},\dots,i_{\ell}) as above with non-degenerate \ell-simplices in (Δn)(p,q)\mathfrak{C}(\Delta^{n})(p,q).

Given an \ell-simplex

i=({p,i1,,i,q}{p,i1,,i1,q}{p,i1,q}{p,q}),i=(\{p,i_{1},\dots,i_{\ell},q\}\leq\{p,i_{1},\dots,i_{\ell-1},q\}\leq\dots\leq\{p,i_{1},q\}\leq\{p,q\}),

we shall describe a formula for the resulting \ell-simplex

SzΔn(i)=N𝖢𝖺𝗍Hin(i)G(Δn)(p,q)=N(gqnq)×N(gq1n(q1))××N(gp+1n(p+1)).Sz_{\Delta^{n}}(i)=N^{\mathsf{Cat}}\text{Hin}(i)\in G(\Delta^{n})(p,q)_{\ell}=N(\langle g_{q}\rangle^{n-q})_{\ell}\times N(\langle g_{q-1}\rangle^{n-(q-1)})_{\ell}\times\dots\times N(\langle g_{p+1}\rangle^{n-(p+1)})_{\ell}.

Therefore SzΔn(i)Sz_{\Delta^{n}}(i) will have components corresponding to each gkg_{k} for p+1kqp+1\leq k\leq q. For each fixed kk, we shall give a formula for the kk-th component SzΔn(i)k=i,kgkSz_{\Delta^{n}}(i)_{k}=\mathcal{E}_{i,k}g_{k}, in terms of a simplicial operator i,k\mathcal{E}_{i,k} that will be defined inductively. Note i,kgk\mathcal{E}_{i,k}g_{k} must be an \ell-simplex in N(gknk)ΔnkN(\langle g_{k}\rangle^{n-k})\cong\Delta^{n-k}, so it is enough to specify all of its +1\ell+1 vertices. Lets use the notation [x,x1,,x0][x_{\ell},x_{\ell-1},\dots,x_{0}], where 0xx0nk0\leq x_{\ell}\leq\dots\leq x_{0}\leq n-k, to denote the \ell-simplex corresponding to i,kgk\mathcal{E}_{i,k}g_{k} in Δnk\Delta^{n-k}.

Example 3.2.

For the 22-simplex corresponding to

{0,3}{0,2,3}{0,1,2,3}\{0,3\}\geq\{0,2,3\}\geq\{0,1,2,3\}

we obtain the 22-simplex

(g3,d0g2,d02g1)(g3,d1g2,d1d0g1)(g3,d1g2,d12g1).(g_{3},d_{0}g_{2},d_{0}^{2}g_{1})\geq(g_{3},d_{1}g_{2},d_{1}d_{0}g_{1})\geq(g_{3},d_{1}g_{2},d_{1}^{2}g_{1}).

Writing this component-wise as

g3g3g3\displaystyle g_{3}\leq g_{3}\leq g_{3}
d1g2d1g2d0g2\displaystyle d_{1}g_{2}\leq d_{1}g_{2}\leq d_{0}g_{2}
d12g1d1d0g1d02g1\displaystyle d_{1}^{2}g_{1}\leq d_{1}d_{0}g_{1}\leq d_{0}^{2}g_{1}

we can see that for each kk with 1k31\leq k\leq 3, we obtain a 22-simplex in Ngk3kΔ3kN\langle g_{k}\rangle^{3-k}\cong\Delta^{3-k}. These are given by

k=3,[0 0 0]\displaystyle k=3,\qquad[0\,0\,0]
k=2,[0 0 1]\displaystyle k=2,\qquad[0\,0\,1]
k=1,[0 1 2].\displaystyle k=1,\qquad[0\,1\,2].

Thus for k=2k=2, we have x0=1x_{0}=1, x1=0x_{1}=0 and x2=0x_{2}=0.

For a fixed kk, it is easy to obtain x0x_{0}, as it will appear in Hin({p,q})\text{Hin}(\{p,q\}) as d1nqd0qkgkd_{1}^{n-q}d_{0}^{q-k}g_{k}, which corresponds to the vertex qkq-k in the poset gknk\langle g_{k}\rangle^{n-k}. Thus x0=qkx_{0}=q-k for every kk.

Now suppose we start with i=i=\emptyset, corresponding to {p,q}\{p,q\} and x0x_{0} and add i1i_{1} to it. We thus wish to compute x1x_{1}. But we will need to know the data of i1i_{1}. In fact all the higher xx_{\ell} will depend on the sequence (i1,,i1)(i_{1},\dots,i_{\ell-1}). We define a function

αk:Sp,q{0,,nk}\alpha_{k}:S^{\ell}_{p,q}\to\{0,\dots,n-k\}

so that

x=αk(i1,,i1).x_{\ell}=\alpha_{k}(i_{1},\dots,i_{\ell-1}).

As mentioned, we have αk()=qk\alpha_{k}(\emptyset)=q-k.

When we add i1i_{1}, we obtain a 11-simplex Hin({p,q})Hin({p,i1,q})\text{Hin}(\{p,q\})\geq\text{Hin}(\{p,i_{1},q\}), which gives

(d1nqgq,,d1nqd0q(i1+1)gi1+1,d1nqd0qi1gi1,d1nqd0q(i11)gi11,,d1nqd0q(p+1)gp+1)\displaystyle(d_{1}^{n-q}g_{q},\dots,d_{1}^{n-q}d_{0}^{q-(i_{1}+1)}g_{i_{1}+1},d_{1}^{n-q}d_{0}^{q-i_{1}}g_{i_{1}},d_{1}^{n-q}d_{0}^{q-(i_{1}-1)}g_{i_{1}-1},\dots,d_{1}^{n-q}d_{0}^{q-(p+1)}g_{p+1})
(d1nqgq,,d1nqd0q(i1+1)gi1+1,d1ni1gi1,d1ni1d0gi11,,d1ni1d0i1(p+1)gp+1)\displaystyle\geq(d_{1}^{n-q}g_{q},\dots,d_{1}^{n-q}d_{0}^{q-(i_{1}+1)}g_{i_{1}+1},\,d_{1}^{n-i_{1}}g_{i_{1}},\,d_{1}^{n-i_{1}}d_{0}g_{i_{1}-1},\,\dots\,,d_{1}^{n-i_{1}}d_{0}^{i_{1}-(p+1)}g_{p+1})

Note that for k>i1k>i_{1}, the coefficients for gkg_{k} do not change. For ki1k\leq i_{1}, we see that the vertex x1x_{1} corresponds to d1ni1d0i1kgkd_{1}^{n-i_{1}}d_{0}^{i_{1}-k}g_{k}, which is the (i1k)(i_{1}-k)-th element of the linear ordering gknk\langle g_{k}\rangle^{n-k}. Thus we have

x1=αk(i1)={αk()k>i1i1kki1.x_{1}=\alpha_{k}(i_{1})=\begin{cases}\alpha_{k}(\emptyset)&k>i_{1}\\ i_{1}-k&k\leq i_{1}.\end{cases}

We now compute αk(i1,,i)\alpha_{k}(i_{1},\dots,i_{\ell}) given we have computed

αk(),αk(i1),,αk(i1,,i1).\alpha_{k}(\emptyset),\alpha_{k}(i_{1}),\dots,\alpha_{k}(i_{1},\dots,i_{\ell-1}).

This corresponds to the 11-simplex Hin({p,i1,,i1,q})Hin({p,i1,,i,q})\text{Hin}(\{p,i_{1},\dots,i_{\ell-1},q\})\geq\text{Hin}(\{p,i_{1},\dots,i_{\ell},q\}). In order to see which of the gkg_{k} will be affected, we must know where ii_{\ell} appears amongst the i1,,i1i_{1},\dots,i_{\ell-1} if they are put in order.

For this we define ω(i1,,i1)(i)\omega_{(i_{1},\dots,i_{\ell-1})}(i_{\ell}) to be the largest integer in {p,i1,,i1,q}\{p,i_{1},\dots,i_{\ell-1},q\} such that ω(i1,,i1)(i)<i\omega_{(i_{1},\dots,i_{\ell-1})}(i_{\ell})<i_{\ell}. This number will tell us the lower bound for the range of kk for which the coefficients of gkg_{k} will not change. Within the range ω(i1,,i1)(i)<ki\omega_{(i_{1},\dots,i_{\ell-1})}(i_{\ell})<k\leq i_{\ell}, we know that the coefficient of gkg_{k} will change to d1nid0ikgkd_{1}^{n-i_{\ell}}d_{0}^{i_{\ell}-k}g_{k}, by inspecting what happens within Hinich’s formula. This is the (ik)(i_{\ell}-k)-th element of the linear ordering of gknk\langle g_{k}\rangle^{n-k}. Outside of this range, we know that the coefficients for gkg_{k} will not change. Thus we define

(3.1) αk(i1,,i)={ik,ω(i1,,i1)(i)<kiαk(i1,,i1),kω(i1,,i1)(i) or i<k.\alpha_{k}(i_{1},\dots,i_{\ell})=\begin{cases}i_{\ell}-k,&\omega_{(i_{1},\dots,i_{\ell-1})}(i_{\ell})<k\leq i_{\ell}\\ \alpha_{k}(i_{1},\dots,i_{\ell-1}),&k\leq\omega_{(i_{1},\dots,i_{\ell-1})}(i_{\ell})\text{ or }i_{\ell}<k.\end{cases}

For any sequence i=(i1,,i)i=(i_{1},\dots,i_{\ell}) we have constructed [xx1x0][x_{\ell}\;x_{\ell-1}\dots x_{0}] corresponding to the \ell-simplex i,kgk\mathcal{E}_{i,k}g_{k} in N(gknk)ΔnkN(\langle g_{k}\rangle^{n-k})\cong\Delta^{n-k}. From the sequence [xx1x0][x_{\ell}\;x_{\ell-1}\dots x_{0}] we wish to obtain a simplicial operator i,k\mathcal{E}_{i,k}, defined inductively, such that xr=d1rd0r(i,kgk)x_{r}=d_{1}^{\ell-r}d_{0}^{r}(\mathcal{E}_{i,k}g_{k}). Namely, xrx_{r} is the rrth vertex of the \ell-simplex i,kgk\mathcal{E}_{i,k}g_{k}.

So assuming i,kgk=[x1x0]\mathcal{E}_{i^{\prime},k}g_{k}=[x_{\ell-1}\dots x_{0}], where i=(i1,,i1)i^{\prime}=(i_{1},\dots,i_{\ell-1}), we wish to know what simplicial operator we need in order to produce i,kgk=[xx1x0]\mathcal{E}_{i,k}g_{k}=[x_{\ell}\;x_{\ell-1}\dots x_{0}] thinking of gkg_{k} as [0 1(nk)][0\;1\;\dots\;(n-k)]. If x=x1x_{\ell}=x_{\ell-1}, then this is easy, namely we need only set i,k=s0i,k\mathcal{E}_{i,k}=s_{0}\mathcal{E}_{i^{\prime},k}, since

[x1x1x0]=s0[x1x0].[x_{\ell-1}\;x_{\ell-1}\dots x_{0}]=s_{0}[x_{\ell-1}\dots x_{0}].

If x<x1x_{\ell}<x_{\ell-1}, we can obtain i,kgk\mathcal{E}_{i,k}g_{k} from i,kgk\mathcal{E}_{i^{\prime},k}g_{k} by noticing

s0x+1d0x[0 1(nk)]=[xxx(x+1)x1x2x0(nk)]s_{0}^{x_{\ell}+1}d_{0}^{x_{\ell}}[0\;1\dots(n-k)]=[x_{\ell}\dots x_{\ell}\dots x_{\ell}\;(x_{\ell}+1)\dots x_{\ell-1}\dots x_{\ell-2}\dots x_{0}\dots(n-k)]

Then applying i,k\mathcal{E}^{\prime}_{i^{\prime},k}, where the superscript means to add one to every index in the simplicial operator, will "skip over" the first xx_{\ell} and will then "cross out" everything else but i,kgk=[x1x2x0]\mathcal{E}_{i^{\prime},k}g_{k}=[x_{\ell-1}\;x_{\ell-2}\;\dots x_{0}], but now this will be placed after the additional xx_{\ell}, leaving

i,kgk=[xx1x0].\mathcal{E}_{i,k}g_{k}=[x_{\ell}\;x_{\ell-1}\dots x_{0}].

It follows that the desired operators i,k\mathcal{E}_{i,k} may be defined by induction on \ell, the length of ii, as follows. For the empty sequence, define

,k=d1nqd0qk.\mathcal{E}_{\emptyset,k}=d_{1}^{n-q}\,d_{0}^{q-k}.

Suppose we have defined i,k\mathcal{E}_{i,k} for any ii of length less than \ell. If ii has length \ell, define

(3.2) i,k={s0i,kif αk(i)=αk(i)i,ks0αk(i)+1d0αk(i)if αk(i)<αk(i).\mathcal{E}_{i,k}=\begin{cases}s_{0}\,\mathcal{E}_{i^{\prime},k}&\text{if }\alpha_{k}(i^{\prime})=\alpha_{k}(i)\\ \mathcal{E}^{\prime}_{i^{\prime},k}\,s_{0}^{\alpha_{k}(i)+1}\,d_{0}^{\alpha_{k}(i)}&\text{if }\alpha_{k}(i)<\alpha_{k}(i^{\prime}).\end{cases}

In summary, we have shown that the map

SzΔn=N𝖢𝖺𝗍(Hin):(Δn)(p,q)G(Δn)(p,q)Sz_{\Delta^{n}}=N^{\mathsf{Cat}}(\text{Hin})\colon\mathfrak{C}(\Delta^{n})(p,q)\to G(\Delta^{n})(p,q)

is given on any

i=({p,i1,,i,q}{p,i1,,i1,q}{p,i1,q}{p,q})(Δn)(p,q)i=(\{p,i_{1},\dots,i_{\ell},q\}\leq\{p,i_{1},\dots,i_{\ell-1},q\}\leq\dots\leq\{p,i_{1},q\}\leq\{p,q\})\in\mathfrak{C}(\Delta^{n})(p,q)_{\ell}

by the formula

SzΔn(i)=(i,qgq,i,q1gq1,,i,p+2gp+2,i,p+1gp+1)G(Δn)(p,q).Sz_{\Delta^{n}}(i)=\left(\mathcal{E}_{i,q}\,g_{q},\,\mathcal{E}_{i,q-1}\,g_{q-1},\,\dots\,,\,\mathcal{E}_{i,p+2}\,g_{p+2},\,\mathcal{E}_{i,p+1}\,g_{p+1}\right)\in G(\Delta^{n})(p,q)_{\ell}.

We finish by repeating Example 3.15 from [MRZ23].

Example 3.3.

Consider the 22-simplex in (Δ3)(0,3)2\mathfrak{C}(\Delta^{3})(0,3)_{2} given by

{0,3}{0,2,3}{0,1,2,3}.\{0,3\}\geq\{0,2,3\}\geq\{0,1,2,3\}.

This simplex corresponds to the sequence i=(2,1)i=(2,1). So with n=3,p=0,q=3n=3,\,p=0,\,q=3, we compute

α3()=0,α2()=1,α1()=2\alpha_{3}(\emptyset)=0,\;\alpha_{2}(\emptyset)=1,\;\alpha_{1}(\emptyset)=2
ω(2)=0,α3(2)=0,α2(2)=0,α1(2)=1\omega_{\emptyset}(2)=0,\;\alpha_{3}(2)=0,\;\alpha_{2}(2)=0,\;\alpha_{1}(2)=1
(3.3) ω(2)(1)=0,α3(2,1)=0,α2(2,1)=0,α1(2,1)=0.\omega_{(2)}(1)=0,\;\alpha_{3}(2,1)=0,\;\alpha_{2}(2,1)=0,\;\alpha_{1}(2,1)=0.

With this we can then compute

(3.4) SzΔ3(i)\displaystyle Sz_{\Delta^{3}}(i) =((2,1),3g3,(2,1),2g2,(2,1),1g1)\displaystyle=(\mathcal{E}_{(2,1),3}\,g_{3},\,\mathcal{E}_{(2,1),2}\,g_{2},\,\mathcal{E}_{(2,1),1}\,g_{1})
=(s0(2),3g3,s0(2),2g2,(2),1s0g1)\displaystyle=(s_{0}\mathcal{E}_{(2),3}\,g_{3},\,s_{0}\mathcal{E}_{(2),2}\,g_{2},\,\mathcal{E}^{\prime}_{(2),1}s_{0}g_{1})
=(s02,3g3,s0,2s0g2,,1′′s12d1s0g1)\displaystyle=(s_{0}^{2}\mathcal{E}_{\emptyset,3}\,g_{3},\,s_{0}\mathcal{E}^{\prime}_{\emptyset,2}s_{0}g_{2},\,\mathcal{E}^{\prime\prime}_{\emptyset,1}s_{1}^{2}d_{1}s_{0}g_{1})
=(s02g3,s0d1s0g2,d22s12g1)\displaystyle=(s_{0}^{2}g_{3},\,s_{0}d_{1}s_{0}g_{2},\,d_{2}^{2}s_{1}^{2}g_{1})
=(s02g3,s0g2,g1).\displaystyle=(s_{0}^{2}g_{3},\,s_{0}g_{2},\,g_{1}).

A similar computation gives

SzΔ3(1,2)=(s02g3,s1g2,s0d1g1).Sz_{\Delta^{3}}(1,2)=(s_{0}^{2}g_{3},\,s_{1}g_{2},\,s_{0}d_{1}g_{1}).

We include a diagram illustrating the map SzΔ3:(Δ3)(0,3)G(Δ3)(0,3)Sz_{\Delta^{3}}:\mathfrak{C}(\Delta^{3})(0,3)\to G(\Delta^{3})(0,3).

{0,3}\{0,3\}{0,1,3}\{0,1,3\}{0,1,2,3}\{0,1,2,3\}{0,2,3}\{0,2,3\}(g3,d1g2,d12g1)\left(g_{3},d_{1}g_{2},d_{1}^{2}g_{1}\right)(g3,d1g2,d1d0g1)(g_{3},d_{1}g_{2},d_{1}d_{0}g_{1})(g3,d1g2,d02g1)\left(g_{3},d_{1}g_{2},d_{0}^{2}g_{1}\right)(g3,d0g2,d1d0g1)(g_{3},d_{0}g_{2},d_{1}d_{0}g_{1})(g3,d0g2,d12g1)\left(g_{3},d_{0}g_{2},d_{1}^{2}g_{1}\right)(g3,d0g2,d02g1)\left(g_{3},d_{0}g_{2},d_{0}^{2}g_{1}\right)

The diagram on the left is an illustration of the nondegenerate simplices in (Δ3)(0,3)Δ1×Δ1\mathfrak{C}(\Delta^{3})(0,3)\cong\Delta^{1}\times\Delta^{1} and similarly on the right for G(Δ3)(0,3)Δ0×Δ1×Δ2G(\Delta^{3})(0,3)\cong\Delta^{0}\times\Delta^{1}\times\Delta^{2}. 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