Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
156 tokens/sec
GPT-4o
7 tokens/sec
Gemini 2.5 Pro Pro
45 tokens/sec
o3 Pro
4 tokens/sec
GPT-4.1 Pro
38 tokens/sec
DeepSeek R1 via Azure Pro
28 tokens/sec
2000 character limit reached

Noncommutative motives, numerical equivalence, and semi-simplicity (1105.2950v1)

Published 15 May 2011 in math.AG, math.AT, and math.KT

Abstract: In this article we further the study of the relationship between pure motives and noncommutative motives. Making use of Hochschild homology, we introduce the category NNum(k)_F of noncommutative numerical motives (over a base ring k and with coefficients in a field F). We prove that NNum(k)_F is abelian semi-simple and that Grothendieck's category Num(k)_Q of numerical motives embeds in NNum(k)_Q after being factored out by the action of the Tate object. As an application we obtain an alternative proof of Jannsen's semi-simplicity result, which uses the noncommutative world instead of a Weil cohomology.

Summary

We haven't generated a summary for this paper yet.