1
$\begingroup$

In "Motivic Homotopy Theory" on page 153 it is stated that there exists a canonical Hurewicz map relating the motivic stable homotopy category with the category $\operatorname{DM}_\_^{eff}(k)$. Unfortunatly, I was not able to find a definition of such a map and every attempt to define one myself ended in vain.

$\endgroup$

1 Answer 1

2
$\begingroup$

There's a free-forgetful adjunction between $SH_s(k)$ and $DM^{eff}(k)$, where $SH_s(k)$ is the category of $S^1$-spectra (as opposed to $\mathbb{P}^1$-spectra). The right adjoint simply takes a sheaf of chain complexes with transfers in $DM^{eff}(k)$ to its underlying sheaf of spectra (i.e. view chain complexes as spectra, and forget transfers).

You can then upgrade this adjunction to an adjunction between $SH(k)$ (= $SH_s(k)$ with $\Sigma^\infty\mathbb{G}_m$ inverted) and $DM(k)$ (= $DM^{eff}(k)$ with $\mathbb{Z}(1)[1]$ inverted). This works because the left adjoint above is symmetric monoidal and sends $\Sigma^\infty\mathbb{G}_m$ to $\mathbb{Z}(1)[1]$. The motivic Hurewicz map is the unit of this adjunction.

To get a functor $DM^{eff}\to SH$ you would first map $DM^{eff}$ to $DM$ (this is an embedding if $k$ is perfect), and then use the right adjoint $DM\to SH$.

For detailed constructions with model categories see section 2.2 in Modules over motivic cohomology by Röndigs and Østvær.

$\endgroup$
2
  • $\begingroup$ Thanks a lot! I am not quite sure if I got how the right adjoint works. Is the structure of the spectra induced by the map $C\to\Sigma\Omega C\to\Sigma C[-1]$? $\endgroup$ Feb 6, 2013 at 23:32
  • $\begingroup$ No, it goes as follows. An unbounded chain complex is an infinite delooping of a connective chain complex. A connective chain complex is the same thing as a simplicial abelian group (Dold-Kan). So if you forget the abelian group structure, you get an infinite delooping of a simplicial set, i.e., a spectrum. This is called the stable Dold-Kan correspondence, see e.g. ncatlab.org/nlab/show/… $\endgroup$ Feb 7, 2013 at 3:58

Your Answer

By clicking “Post Your Answer”, you agree to our terms of service and acknowledge you have read our privacy policy.

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