MathOverflow is a question and answer site for professional mathematicians. It's 100% free, no registration required.

Sign up
Here's how it works:
  1. Anybody can ask a question
  2. Anybody can answer
  3. The best answers are voted up and rise to the top

What maps of simplicial sets exist between

  • the image under the Dold-Kan correspondence of a chain complex shifted up in degree

  • and the image under the right adjoint to simplicial looping of the DK-image of the unshifted complex


Here is the same question in detail:


$$ (G \dashv \bar W) : sGrp \stackrel{\leftarrow}{\underset{\bar W}{\to}} sSet_0 \hookrightarrow sSet $$

for the adjunction between simplicial groups and reduced simplicial sets whose left adjoint is the simplicial loop group functor (as for instance in Goerss-Jardine, chapter V);

and write

$$ Ch_\bullet^+ \overset{\Xi}{\to} sAbGrp \hookrightarrow sGrp \overset{U}{\to} sSet $$

for the Dold-Kan correspondence, where in both cases I care about the images as simplicial sets.

Then for $V \in Ch_\bullet^+$ a chain complex and $V[1]$ (or $V[-1]$ if you prefer) its shift up in degree (its delooping as a chain complex) the two simplicial sets

$$ U \Xi (V[1]) $$


$$ \bar W (\Xi V) $$

should have the same homotopy type. What nice natural maps of simplicial sets do we have between them?

share|cite|improve this question
up vote 3 down vote accepted

There's an explicit natural isomorphism between the two functors.

Rick Jardine says as much, but for the image of the functors in the category of chain complexes (i.e. after applying the normalization). You can find this in Goerss, Jardine Remark III.5.6, or in greater depth in section 4.6 of Jardine's book on Generalized Etale Cohomology.

The combinatorics for the isomorphism in simplicial abelian groups means that the isomorphism takes a little longer to state, but I could send you a pdf with everything written out if this would be useful.

share|cite|improve this answer
Thanks! I should have seen this. – Urs Schreiber Jun 27 '11 at 19:49

Your Answer


By posting your answer, you agree to the privacy policy and terms of service.

Not the answer you're looking for? Browse other questions tagged or ask your own question.