Papers
Topics
Authors
Recent
2000 character limit reached

On topological cyclic homology

Published 6 Jul 2017 in math.AT and math.KT | (1707.01799v2)

Abstract: Topological cyclic homology is a refinement of Connes--Tsygan's cyclic homology which was introduced by B\"okstedt--Hsiang--Madsen in 1993 as an approximation to algebraic $K$-theory. There is a trace map from algebraic $K$-theory to topological cyclic homology, and a theorem of Dundas--Goodwillie--McCarthy asserts that this induces an equivalence of relative theories for nilpotent immersions, which gives a way for computing $K$-theory in various situations. The construction of topological cyclic homology is based on genuine equivariant homotopy theory, the use of explicit point-set models, and the elaborate notion of a cyclotomic spectrum. The goal of this paper is to revisit this theory using only homotopy-invariant notions. In particular, we give a new construction of topological cyclic homology. This is based on a new definition of the $\infty$-category of cyclotomic spectra: We define a cyclotomic spectrum to be a spectrum $X$ with $S1$-action (in the most naive sense) together with $S1$-equivariant maps $\varphi_p: X\to X{tC_p}$ for all primes $p$. Here $X{tC_p}=\mathrm{cofib}(\mathrm{Nm}: X_{hC_p}\to X{hC_p})$ is the Tate construction. On bounded below spectra, we prove that this agrees with previous definitions. As a consequence, we obtain a new and simple formula for topological cyclic homology. In order to construct the maps $\varphi_p: X\to X{tC_p}$ in the example of topological Hochschild homology we introduce and study Tate diagonals for spectra and Frobenius homomorphisms of commutative ring spectra. In particular we prove a version of the Segal conjecture for the Tate diagonals and relate these Frobenius homomorphisms to power operations.

Summary

Paper to Video (Beta)

Whiteboard

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

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

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

Authors (2)

Collections

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