zbMATH — the first resource for mathematics

Cycle modules and mixed motives. (Modules de cycles et motifs mixtes.) (French. Abridged English version) Zbl 1042.19001
Summary: For a perfect field \(k\), we give a relation between the category of homotopy invariant sheaves with transfers defined by Voevodsky and the category of cycle modules defined by Rost. More precisely, the category of cycle modules over \(k\) is equivalent to the category obtained from the homotopy invariant sheaves with transfers by formally inverting the sheaf represented by \(\mathbb{G}_m\) with its canonical structure of a presheaf with transfers. This gives a canonical monoidal structure on the category of cycle modules over \(k\), and shows that it is abelian.

19E15 Algebraic cycles and motivic cohomology (\(K\)-theoretic aspects)
14C25 Algebraic cycles
19D45 Higher symbols, Milnor \(K\)-theory
Full Text: DOI
[1] F. Déglise, Modules homotopiques avec transferts et motifs génériques, Thèse de l’Université Paris VII, 2002
[2] Friedlander, E.M.; Suslin, A.; Voevodsky, V., Cycles, transfers and motivic homology theories, Ann. of math. stud., 143, (2000), Princeton University Press Princeton, NJ
[3] Kato, K., Milnor K-theory and the chowgroup of zero cycles, (), 241-253
[4] Nisnevich, Y., The completely decomposed topology on schemes and the associated descent spectral sequence in algebraic K-theory, (), 241-342
[5] Rost, M., Chow groups with coefficients, Doc. math. J., 1, 319-393, (1996) · Zbl 0864.14002
[6] M. Spitzweck, Operads, algebras and modules in model categories and motives, Ph.D. thesis, Bonn, 2001 · Zbl 1103.18300
[7] V. Voevodsky, Cancellation theorem, Preprint, 2002
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. It attempts to reflect the references listed in the original paper as accurately as possible without claiming the completeness or perfect precision of the matching.