Papers
Topics
Authors
Recent
Search
2000 character limit reached

Rigidity of the category of localizing motives

Published 19 Oct 2025 in math.KT, math.AG, math.AT, math.CT, and math.NT | (2510.17010v1)

Abstract: In this paper we study the category of localizing motives $\operatorname{Mot}{\operatorname{loc}}$ -- the target of the universal finitary localizing invariant of idempotent-complete stable categories as defined by Blumberg-Gepner-Tabuada. We prove that this (presentable stable) category is rigid symmetric monoidal in the sense of Gaitsgory and Rozenblyum. In particular, it is dualizable. More precisely, we prove a more general version of this result for the category $\operatorname{Mot}{\operatorname{loc}}_{\mathcal{E}}$ -- the target of the universal finitary localizing invariant of dualizable modules over a rigid symmetric monoidal category $\mathcal{E}.$ We obtain general results on morphisms and internal $\operatorname{Hom}$ in the categories $\operatorname{Mot}{\operatorname{loc}}_{\mathcal{E}}$ of localizing motives. As an application we compute the morphisms in multiple non-trivial examples. In particular, we prove the corepresentability statements for $\operatorname{TR}$ (topological restriction) and $\operatorname{TC}$ (topological cyclic homology) when restricted to connective $\mathbb{E}1$-rings. As a corollary, for a connective $\mathbb{E}{\infty}$-ring $R$ we obtain a $\operatorname{TR}(R)$-module structure on the nil $K$-theory spectrum $NK(R).$ We also apply the rigidity theorem to define refined versions of negative cyclic homology and periodic cyclic homology. This was announced previously in \cite{E24b}, and certain very interesting examples were computed by Meyer and Wagner in \cite{MW24}. Here we do several computations in characteristic $0,$ in particular showing that in seemingly innocuous situations the answer can be given by an interesting algebra of overconvergent functions.

Authors (1)

Summary

No one has generated a summary of this paper yet.

Paper to Video (Beta)

No one has generated a video about this paper yet.

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We found no open problems mentioned in this paper.

Continue Learning

We haven't generated follow-up questions for this paper yet.

Collections

Sign up for free to add this paper to one or more collections.

Tweets

Sign up for free to view the 1 tweet with 0 likes about this paper.