Chapter III. Topological Hochschild homology
III.3. Functoriality of the Tate diagonal
As explained in the last section, we need to equip the Tate diagonal ∆p with stronger functoriality, and we also need a version in many variables. We start by noting that, by TheoremI.3.1, the functor
Tp: Sp−!Sp,
X7−!(X⊗...⊗X)tCp,
acquires a canonical lax symmetric monoidal structure. We can now also make the natural transformation ∆p:idSp!Tp into a lax symmetric monoidal transformation.
Proposition III.3.1. There is a unique lax symmetric monoidal transformation
∆p: idSp−!Tp.
The underlying transformation of functors is given by the transformation from Defini-tion III.1.4.
Proof. This follows from [81, Corollary 6.9 (1)], which states that the identity is initial among exact lax symmetric monoidal functors from Sp to Sp.
Now, for the construction of the cyclotomic structure maps, we need to construct a natural transformation between the twoBCp-equivariant functors
N(FreeCp)×N(Fin)Sp⊗act−!Sp,
which are given by
I: (S,(Xs¯)s∈¯ S)7−!O
¯s∈S
X¯s
and
Tep: (S,(X¯s)s∈¯ S)7−! O
s∈S
Xs
tCp
,
respectively. If one trivializes a freeCp-set toS=S×Cp, the transformation is given by O
¯s∈S
X¯s−!O
¯s∈S
(X¯s⊗...⊗X¯s)tCp−! O
s∈S
X¯s tCp
where the first map is the tensor product of ∆p for all ¯s∈S, and the second map uses that−tCp is lax symmetric monoidal. One needs to see that this map does not depend on the chosen trivialization ofS.
In fact, to get this natural transformation I!Tep, we will do something stronger.
Namely, we will make both functors lax symmetric monoidal, and then show that there is a unique lax symmetric monoidal transformation. For this, we have to recall a few results about lax symmetric monoidal functors.
First, cf. Appendix A, we recall that, for any symmetric monoidal ∞-category C (more generally, for any ∞-operad O), one can form a new symmetric monoidal ∞-categoryCact⊗ whose underlying ∞-category is given by
Cact⊗ =C⊗×N(Fin∗)N(Fin),
where Fin is the category of finite (possibly empty) sets, and the functor Fin!Fin∗adds a disjoint base point. The fiber ofCact⊗ over a finite setI∈Fin is given byCI. Here, the symmetric monoidal structure onCact⊗ is given by a “disjoint union” type operation; it takes (Xi)i∈I∈CIand (Xj)j∈J∈CJto (Xk)k∈ItJ∈CItJ. There is a natural lax symmetric monoidal functorC!Cact⊗ whose underlying functor is the inclusion into the fiber ofCact⊗ over the 1-element set.
Proposition III.3.2. Let C and D be symmetric monoidal ∞-categories. Restric-tion along C ⊆Cact⊗ is an equivalence of ∞-categories
Fun⊗(Cact⊗ ,D)'Funlax(C,D).
Proof. This is a special case of [71, Proposition 2.2.4.9].
Note in particular that the identityC!Ccorresponds to a functor⊗:Cact⊗ !C, which is informally given by sending a list (X1, ..., Xn) of objects inCtoX1⊗...⊗Xn. Another way to construct it is by noting thatCact⊗ !N(Fin) is a cocartesian fibration, andN(Fin) has a final object. This implies that the colimit of the corresponding functorN(Fin)! Cat∞ is given by the fiber C=Ch1i⊗ over the final object h1i∈N(Fin), and there is a natural functor from Cact⊗ to the colimit C; cf. [69, Corollary 3.3.4.3]. Moreover, the functor⊗:Cact⊗ !C can also be characterised as the left adjoint to the inclusionC ⊆Cact⊗ ; see RemarkIII.3.4 below.
In the situation of PropositionIII.3.2, it will be useful to understand lax symmetric monoidal functors fromC⊗actas well. For this, we use the following statement.
Lemma III.3.3. Let C and D be symmetric monoidal ∞-categories. Then, the canonical inclusion
Fun⊗(Cact⊗ ,D)⊆Funlax(Cact⊗ ,D) admits a right adjoint R. The composition
Funlax(Cact⊗ ,D)−−−R!Fun⊗(C⊗act,D)−−−∼!Funlax(C,D) is given by restriction along the lax symmetric monoidal functor C!Cact⊗ .
Proof. We will use the concrete proof of [71, Proposition 2.2.4.9] in which it is shown that the composition
Fun⊗(Cact⊗ ,D)⊆Funlax(Cact⊗ ,D) i
∗
−−!Funlax(C,D)
is an equivalence of∞-categories. To do this, let us writeq: (Cact⊗ )⊗!NFin∗for the sym-metric monoidal ∞-category whose underlying ∞-category is Cact⊗ . Then, Lurie proves the following two facts:
(i) Every lax symmetric monoidal functorC!Dwhich is considered as an object of FunN(Fin∗)(C⊗,D⊗) admits a relative left Kan extension to a functor in
FunN(Fin∗)((Cact⊗ )⊗,D⊗).
(ii) A functor in FunN(Fin∗)((Cact⊗ )⊗,D⊗) is symmetric monoidal precisely if it is the relative left Kan extension of its restriction toC⊗⊆(Cact⊗ )⊗.
This finishes Lurie’s argument using [69, Proposition 4.3.2.15]. In particular, we see that the inclusion Fun⊗(Cact⊗ ,D)⊆Funlax(Cact⊗ ,D) is equivalent to the relative left Kan extension functor
i!: Funlax(C,D)−!Funlax(C⊗act,D).
This functor is left adjoint to the restriction functor
i∗: Funlax(Cact⊗ ,D)!Funlax(C,D)
as an argument similar to [69, Proposition 4.3.2.17] shows: the compositioni∗i!is equiv-alent to the identity giving a candidate for the unit of the adjunction. Then one uses [69, Lemma 4.3.2.12] to verify that the induced map on mapping spaces is an equivalence to get the adjunction property.
Remark III.3.4. For a symmetric monoidal ∞-category C the full, lax symmetric monoidal inclusionC ⊆Cact⊗ admits a symmetric monoidal left adjoint Las we will show now. From this, one can deduce that, in the situation of LemmaIII.3.3, the right adjoint
R: Funlax(Cact⊗ ,D)−!Fun⊗(Cact⊗ ,D)'Funlax(C,D) admits a further right adjoint given by precomposition withL.
Let us start by proving that the underlying functor admits a left adjoint. To this end, assume we are given an object ¯c∈Cact⊗ ⊆C⊗. The object lies over some finite pointed set (equivalent to) hni. There is a unique active morphism hni!h1i. Now choose a cocartesian liftf: ¯c!c inC⊗ covering this morphism inNFin∗. Then, the morphism f lies inCact⊗ and the object c lies inC ⊆Cact⊗ . Moreover, f is initial among morphisms in Cact⊗ from ¯cto an object inC ⊆Cact⊗ . This follows since every such morphism has to cover the active morphismhni!h1iand from the defining property of cocartesian lifts. As a result, we find that c is the reflection of ¯c into C ⊆Cact⊗ . Since this reflection exists for every ¯c∈C⊗, the inclusionC ⊆Cact⊗ admits a left adjointL. On a more informal level, the object ¯c is given by a listc1, ..., cn of objects ofC. Then,c=L(¯c) is given by the tensor productc1⊗...⊗cn.
Now, we show that the left adjoint L is a symmetric monoidal localization. To this end, we have to verify the assumptions of [71, Proposition 2.2.1.9] given in [71, Definition 2.2.1.6 and Example 2.2.1.7]. Thus, we have to show that, for every morphism f: ¯c!d¯in C⊗ such that Lf is an equivalence in C and every object ¯e, the morphism L(f⊕¯e) is an equivalence in C, where ⊕ is the tensor product in Cact⊗ . Unwinding the definitions, this amounts to the following: we have that ¯c is given by a list c1, ..., cn, d¯by a list d1, ..., dm and ¯e by a list e1, ..., er. Then, the induced morphismL(f) is, by assumption, an equivalencec1⊗...⊗cn!d1⊗...⊗dm. But then clearly also the morphism L(f⊗¯e):c1⊗...⊗cn⊗e1⊗...⊗er!d1⊗...⊗dm⊗e1⊗...⊗eris an equivalence inC.
We remark that the left adjointL∈Fun⊗(Cact⊗ ,C) corresponds, under the equivalence Fun⊗(Cact⊗ ,C)−∼!Funlax(C,C), to the identity functor.
Remark III.3.5. In fact, Proposition III.3.2 and Lemma III.3.3 hold true if C (or rather C⊗) is replaced by any ∞-operad O⊗. Let us briefly record the statements, as we will need them later. As before, D is a symmetric monoidal ∞-category. Let O⊗ be an ∞-operad with symmetric monoidal envelope Oact⊗ =O⊗×N(Fin∗)N(Fin). There is a natural map of∞-operads O⊗!(O⊗act)⊗. Restriction along this functor defines an equivalence
Fun⊗(O⊗act,D)'AlgO(D),
where the right-hand side denotes the ∞-category of O-algebras in D; equivalently, of
∞-operad mapsO⊗!D⊗. Moreover, the full inclusion Fun⊗(Oact⊗ ,D)−!Funlax(Oact⊗ ,D)
admits a right adjoint given by the composition Funlax(Oact⊗ ,D)!AlgO(D)'Fun⊗(Oact⊗ ,D), where the first functor is restriction alongO⊗!(O⊗act)⊗.
Recall that we want to construct a natural transformation between twoBCp-equivariant functors
N(FreeCp)×N(Fin)Sp⊗act−!Sp, which are given by
I: (S,(Xs¯)¯s∈S)7−!O
s∈¯ S
Xs¯
and
Tep: (S,(Xs¯)s∈¯ S)7−! O
s∈S
Xs
tCp
, respectively. More precisely, the first functor
I:N(FreeCp)×N(Fin)Sp⊗act−!Sp
is the symmetric monoidal functor given by the composition of the projection to Sp⊗act and⊗: Sp⊗act!Sp.
For the second functor, we first have to construct a symmetric monoidal functor N(FreeCp)×N(Fin)Sp⊗act−!(Sp⊗act)BCp,
(S,(X¯s)¯s∈S)7−!(S,(X¯s)s∈S).
Proposition III.3.6. For any symmetric monoidal ∞-category C and any integer p>1,there is a natural symmetric monoidal functor
N(FreeCp)×N(Fin)Cact⊗ −!(Cact⊗ )BCp, (S,(Xs¯)s∈¯ S)7−!(S,(Xs¯)s∈S).
Proof. We observe that, as in the proof of Lemma III.3.7below, Fun⊗(N(FreeCp)×N(Fin)Cact⊗ ,D) = Fun(N(TorCp),Funlax(C,D))
for any symmetric monoidal∞-categoryD(here applied toD=(Cact⊗ )BCp), where TorCp is the category of Cp-torsors. This can be constructed as the composite of the lax symmetric monoidal embeddingC!Cact⊗ and a functor
N(TorCp)−!Fun⊗(E,EBCp) = Fun(BCp,Fun⊗(E,E))
which exists for any symmetric monoidal∞-category E (here, applied to E=Cact⊗ ). For this, note that Fun⊗(E,E) is itself symmetric monoidal (using the pointwise tensor product), and so the identity lifts to a unique symmetric monoidal functor from the symmetric monoidal envelope N(Fin)' of the trivial category. Restricting the functor N(Fin)'!Fun⊗(E,E) toCp-torsors gives the desired symmetric monoidal functor
N(TorCp)−!Fun(BCp,Fun⊗(E,E)).
Composing the resulting symmetric monoidal functor N(FreeCp)×N(Fin)Sp⊗act−!(Sp⊗act)BCp
with the lax symmetric monoidal functors⊗: (Sp⊗act)BCp!SpBCp and−tCp: SpBCp!Sp, we get the desired lax symmetric monoidal functor
Tep:N(FreeCp)×N(Fin)Sp⊗act−!Sp.
In fact, the lax symmetric monoidal functorsIandTepareBCp-equivariant for the natural action on the source (acting on the setS), and the trivial action on the target. This is clear for I, and forTep, the only critical step is the functor −tCp: SpBCp!Sp, where it follows from the uniqueness results in TheoremI.4.1.
Now, consider the ∞-category of all lax symmetric monoidal functors Funlax(N(FreeCp)×N(Fin)Sp⊗act,Sp).
We call a functorF:N(FreeCp)×N(Fin)Sp⊗act!Sppartially exact if, for every Cp-torsor S, the induced functorF(S,−): Sp!Sp, obtained by restriction to
{S}×{∗}Sp⊆N(FreeCp)×N(Fin)Sp⊗act,
is exact. This leads to the following lemma, which will also be critical to comparing our new construction with the old construction of THH.
LemmaIII.3.7. The functor Iis initial among all lax symmetric monoidal functors N(FreeCp)×N(Fin)Sp⊗act−!Sp
which are partially exact.
Proof. By Lemma III.3.3, or rather the ∞-operad version of Remark III.3.5, it is enough to prove the similar assertion in the ∞-category of symmetric monoidal and partially exact functors. Now, we claim that restriction along
N(TorCp)×Sp⊆N(FreeCp)×N(Fin)Sp⊗act induces an equivalence of∞-categories
Fun⊗(N(FreeCp)×N(Fin)Sp⊗act,Sp)'Fun(N(TorCp),Funlax(Sp,Sp)),
where TorCp is the category of Cp-torsors. As partially exact functors correspond to Fun(N(TorCp),FunExlax(Sp,Sp)) on the right, the result will then follow from [81, Corollary 6.9 (1)].
By [71, Theorem 2.4.3.18], the ∞-category Fun(N(TorCp),Funlax(Sp,Sp)) is equiv-alent to the∞-category of∞-operad maps fromN(TorCp)t×N(Fin∗)Sp⊗ to Sp⊗. Here, N(TorCp)tis the cocartesian∞-operad associated withN(TorCp); cf. [71,§2.4.3]. Now, as in Proposition III.3.2, the ∞-category of operad maps from any ∞-operad O⊗ to Sp⊗ is equivalent to the∞-category of symmetric monoidal functors from the symmet-ric monoidal envelope Oact⊗ to Sp; cf. [71, Proposition 2.2.4.9]. But the envelope of N(TorCp)t×N(Fin∗)Sp⊗ is
(N(TorCp)t×N(Fin∗)Sp⊗)×N(Fin∗)N(Fin)'N(FreeCp)×N(Fin)Sp⊗act, using the equivalence
N(TorCp)t×N(Fin∗)N(Fin)'N(FreeCp).
Unraveling, we have proved the desired assertion.
The following corollary is immediate, and finishes our construction of THH as a cyclotomic spectrum.
Corollary III.3.8. The BCp-equivariant lax symmetric monoidal functor Tep:N(FreeCp)×N(Fin)Sp⊗act−!Sp,
(S,(X¯s)s∈¯ S)7−! O
s∈S
Xs¯
tCp
receives an essentially unique BCp-equivariant lax symmetric monoidal transformation from
I:N(FreeCp)×N(Fin)Sp⊗act−!Sp (S,(X¯s)¯s∈S)7−!O
¯s∈S
Xs¯.