Topological cyclic homology
Abstract
These are notes taken live while watching the YouTube lectures about topological cyclic homology by Thomas Nikolaus and Achim Krause. Note that we use homological grading throughout because the lecturers are homotopy theorists.
Lectures on YouTube by Achim Krause and Thomas Nikolaus
Notes by Patrick Lei
WHAT’S A PUBLISHER?
Motivation: trace methods
One motivation to study topological cyclic homology is its relation to crystalline cohomology and syntomic cohomology in arithmetic geometry. However, this is very involved, so we will not discuss it in depth. We will instead discuss the original motivation, which are trace methods in algebraic K-theory.
Let be a ring. There is an invariant, called algebraic K-theory, which produces groups for all . These are very important, but are almost impossible to compute or to understand structurally. For example, even is not very well-understood. They are known in all odd degrees, conjectured to vanish in degrees divisible by (this is equivalent to the Kummer-Vandiver conjecture in number theory).
If you are a topologist, then one motivation is to study whether a retract of a finite CW complex is itself a finite CW complex. The obstruction to this lies in
Another motivation is that by work of Whitehead and others (the -cobordism theorem), the obstruction for a cobordism to be trivial lies in an algebraic K-theory group. There is now a higher version of this theorem which relates diffeomorphism groups to algebraic K-theory. A third motivation comes from the Baum-Connes conjecture, which has other applications in geometric topology.
For other applications, the group was first invented by Grothendieck to give a statement of the Grothendieck-Riemann-Roch theorem, and algebraic K-theory is also related to special values of -functions.
Definition.
For a ring , the group is the Grothendieck group of isomorphism classes of finitely generated projective -modules under the operation of direct sum.
Higher -groups are defined as homotopy groups of the space obtained by group completing the category of finitely-generated projective -modules. This can be made precise using higher algebra and actually produces a spectrum, and then we can take its homotopy groups. We can see why this is so complicated.
Example.
It is easy to see that , but of course the higher -groups are very complicated. Quillen computed them for finite fields, but if we leave this case this becomes extremely difficult.
Approximation of algebraic K-theory
We will attempt to approximate algebraic K-theory using more algebraic invariants. There is a Dennis trace map to Hochschild homology. There are refinements of this which fit into a diagram
Slogan.
The cyclotomic trace is often close to an isomorphism.
There are also relative K-groups for any ideal , which is simply the homotopy fiber of . There are also relative groups, which are defined in the same way. We can also define groups with coefficients like and .
Theorem (Dundas-Goodwillie-McCarthy, Clausen-Matthew-Morrow).
- 1.
If is a nilpotent ideal, then
is an isomorphism.
- 2.
If is commutative and -complete, the same conclusion holds with -adic coefficients. In other words, we have
- 3.
If is -complete, then
Why the trace map is a trace
Let be a field, be a -algebra, and be a finitely generated projective right -module. Then we have
We would attempt to go to by an evaluation map
but this doesn’t actually land in . Instead, we see that
The best we can do is to consider the quotient
as an abelian group, so in conclusion we have
Note that an --bimodule is equivalently an -module. Then, we in fact have
Deriving this expression, we will see later that
The Dennis trace will refine this trace in the sense that on , it will send a projective module to the trace of the identity endomorphism.
1 -categories and higher algebra
In this chapter, we give a user’s guide to -categories and the homotopy-enriched algebra of spectra following the higher algebra playlist.
1.1 -categories
Infinity-categories are a simultaneous generalization of both ordinary categories and of the homotopy theory of spaces which form a natural home for derived phenomena. We will not aim to cover the entire theory but instead to give an idea of how to work with and think about -categories.
Convention 1.1.0.1.
We will resolve size issues by assuming the existence of a Grothendieck universe . Elements of will be called small sets. We will take categories to have large object sets and large morphism sets. Therefore, for us we will take to mean the category of small sets.
1.1.1 -categories
Definition 1.1.1.1.
An -category is is a (large) simplicial set with the property that any diagram
admits a filling for all . Here, is the -th horn given by taking the boundary of and removing the facet opposite to the -th vertex.
A functor is a map of simplicial sets.
It is not clear why this definition should be related to categories at all, but we will construct an example of an -category from an ordinary category.
Example 1.1.1.2.
Let be an ordinary category. Define the nerve of to be the simplicial set given by
where is the poset given by .
Exercise 1.1.1.3.
- 1.
Show that is an -category;
- 2.
Show that functors are in bijection with functors .
Now let be an -category. We will call the set of objects and the set of morphisms. Note that it is not clear what the composition of two morphisms should be. For any , we will view as a morphism
Definition 1.1.1.4.
Two morphisms are equivalent if there exists a -simplex of the form
In this case, we write .
This notion is extremely boring for the nerve of a -category. It is more interesting in the next example.
Example 1.1.1.5.
Let be a Kan complex. This means that all horns can be filled in, so in particular is an -category. For example, if is a topological space, then the singular simplicial set is a Kan complex. Here, objects are points of , morphisms are paths in , and equivalence is simply homotopy of paths relative to the endpoints. If we pass to equivalence classes, we obtain the fundamental groupoid of , so we can think of as being an -categorical version of the fundamental groupoid. Note here that composition of paths is only associative up to homotopy.
Definition 1.1.1.6.
Let and be morphisms. A composition of and is a -simplex of the form
In this case, we will write .
Exercise 1.1.1.7.
Check that two different choices of compositions, and , are equivalent.
The non-existence of uniqueness may seem like a defect, but if we consider coproducts in ordinary categories, being unique up to unique isomorphism is enough because it allows us to not have to think about a coproduct functor being associative (or maybe only in a weak sense).
Definition 1.1.1.8.
Let be a morphism. It is an equivalence if there exists a morphism such that and .
Recall that the functors between ordinary categories form a category. We will upgrade this to -categories.
Definition 1.1.1.9.
Let and be simplicial sets. Then we define the simplicial set by the formula
Proposition 1.1.1.10.
Let be an arbitrary simplicial set and be an -category. Then is an -category.
Note that a morphism is a functor which restricts to and on the boundaries. We will call these natural transformations. A natural transformation is an equivalence in if and only if it is objectwise an equivalence in .
Definition 1.1.1.11.
A functor is an equivalence if there exists a functor and natural equivalences and . In this case, we will write .
We would now like to discuss something that is like the fact that equivalences of ordinary categories are fully faithful and essentially surjective. Unfortunately, we don’t really have the machinery to do this yet.
Definition 1.1.1.12.
Let be two objects in an -category. We define the mapping space to be the simplicial set (in fact a Kan complex) which is the pullback in the diagram
Note that the -simplices in this mapping space are simply morphisms and that -simplices are equivalences. Thus is the set of equivalence classes of morphisms .
Exercise 1.1.1.13.
- 1.
Check that in for a -category , mapping spaces are discrete and agree with morphism sets, and that the composition map recovers ordinary composition.
- 2.
Check that in , the mapping space
is homotopy equivalent to the space of paths from to in and that the composition map comes from path composition.
Definition 1.1.1.14.
A functor between -categories is fully faithful if for any pair of objects , the map
is a homotopy equivalence.
Definition 1.1.1.15.
A functor between -categories is essentially surjective if for all , there exists some and an equivalence .
Proposition 1.1.1.16.
A functor between -categories is an equivalence if and only if is fully faithful and essentially surjective.
Recall the notion of a full subcategory. We will define an -categorical version of this.
Definition 1.1.1.17.
Let . We define the full subcategory to consist of all simplices with vertices in .
Note that if we first saturate under equivalence of objects to form , we obtain an equivalence
We will now discuss a way to upgrade compositions to mapping spaces. Consider the pullback
which is a triple mapping space.
Lemma 1.1.1.18.
The triple mapping space is a Kan complex and fits in a diagram
induced by the horn-filling
A choice of a homotopy inverse gives us a composition map
This seems to depend on the choice of , but it is unique up to unique homotopy. In fact, the space of all possible homotopy inverses is contractible.
Similarly, we can define , which parameterizes the associativity of composition. We can compare this to Segal categories, where data like this is an axiom and gives us categories weakly enriched in spaces. In our approach, we get this for free.
Until now, we have seen two kinds of -categories: (nerves of) ordinary categories and Kan complexes (where all morphisms are invertible, sometimes called -groupoids). We will now discuss another example, the -category of spaces, which is the prototypical example of an -category.
Recall that the category of Kan complexes is enriched in simplicial sets. This enrichment actually lands in Kan complexes, so we would like to form an -category.
Construction 1.1.1.19.
For a finite, nonempty, totally ordered set , define a simplicially enriched category
where objects are elements of and for any , the mapping simplicial set is given by
Here, composition is induced by union of subsets of .
Definition 1.1.1.20.
Define a simplicial set by the formula
The simplicies look like the follows:
- •
-simplices are Kan complexes;
- •
-simplices are simply morphisms of Kan complexes;
- •
-simplices correspond to diagrams
Theorem 1.1.1.21.
This simplicial set is an -category, and for all , there is a homotopy equivalence
Definition 1.1.1.22.
For an arbitrary simplicially enriched category , we can define the homotopy-coherent nerve by the formula
Proposition 1.1.1.23.
If is enriched in complexes, then is an -category and we have equivalences
1.1.2 Limits
We will again neglect to develop the full theory in favor of giving an idea of how to work with limits.
Notation 1.1.2.1.
From now on, we will denote the -category of functors from a simplicial set to an -category by .
In this subsection, we will let be a small simplicial set, be an -category, and be a functor.
Definition 1.1.2.2.
A cone over is a pair consisting of an object , together with a natural transformation
where
is the constant functor on .
Construction 1.1.2.3.
Let be a cone over and . We will construct a map
as the composite
This is well-defined up to a contractible choice.
Definition 1.1.2.4.
A cone over is a limit cone (or just limit) in if for all , the map
is a homotopy equivalence. We will denote this by
Exercise 1.1.2.5.
If is a functor of ordinary categories, check that limits of correspond exactly to ordinary limits of .
Example 1.1.2.6.
Let . Then . Therefore, every is a cone, and it is a limit if
for all . In other words, must be a terminal object and we will denote it by or .
Example 1.1.2.7.
If is a discrete set, then
Therefore, a functor is simply a sequence , and a cone is an object with maps . This is a limit cone if for all objects , we have an equivalence
For example, in , the products are given by products of Kan complexes.
Lemma 1.1.2.8.
Any two limits of are canonically equivalent.
Proof.
The space of maps is simply
We define a map by simply pulling back . By construction, we have . Doing this in the other direction, we have such that . We see that
which implies that . Applying this argument to yields the desired result. □
Remark 1.1.2.9.
We can strengthen the previous lemma to the statement that the -category of limit cones over is either empty or trivial.
Remark 1.1.2.10.
We have allowed to be an arbitrary simplicial set, which may lack the lifting properties in the definition of an -category. However, we can form a larger simplicial set by gluing in fillers for horns which do not have fillers, and then we actually have an equivalence
which is even a Kan fibration.
We will now turn to some examples which have some coherence issues. The first are fiber products. Here, let
Then a functor is simply a diagram
in .
Lemma 1.1.2.11.
A natural transformation for some object is, up to equivalence, given by the data of maps and together with an equivalence
in .
Proof.
Because is a pushout, the functor category
is a fiber product. Therefore a functor is given by diagrams
| and |
Gluing the two edges involving together, we are done. □
To actually work with limits, we need results about the functoriality and compatibility of mapping spaces.
Lemma 1.1.2.12 (Workhorse lemma).
Let be a -enriched category, be a functor, be a Kan complex, and be an object. Then the internal hom
Furthermore, if , then this space is also equivalent to
Proposition 1.1.2.13.
A cone over in is a limit if and only if for all , the map
is an isomorphism.
Proof.
We have an equivalence
for all using the workhorse lemma. □
If we have a square
in , it is a pullback if maps are up to homotopy the same as maps and together with a homotopy between and .
Exercise 1.1.2.14.
Check that a pullback of a diagram
in can be computed as the ordinary limit of the diagram
of simplicial sets.
Proposition 1.1.2.15.
For any functor , the space
is the limit of . In particular, has all (small) limits.
Proof.
We need to check that
This is true by using the exponential law to put on the RHS. To construct the cone, we simply put the identity map on the LHS. □
Example 1.1.2.16.
Let be any simplicial set and let be the constant functor on a space . Then
This tells us a lot more than a -categorical limit. For example, it sees all of the higher homotopy groups of by inputting spheres.
Example 1.1.2.17.
Let . This is an -category. We will consider the simplicial set
Therefore, functors are simply sequences
Then the limit of this diagram in is simply the mapping telescope.
We will now consider an arbitrary -enriched category , a functor , and an object . We will consider the internal Hom functor
which induces a mapping space
Theorem 1.1.2.18.
A cone over is a limit cone if and only if the induced cone
is a limit cone in for all . In fact, there is an equivalence
Remark 1.1.2.19.
We could try to take this as a definition, but it has two disadvantages:
- 1.
We would have to define limits in spaces;
- 2.
We would have issues with the functoriality of mapping spaces.
Proof.
Being a limit cone in is the same thing as an equivalence
This is now equivalent to having an equivalence
for any space . But now this is equivalent to checking that
which is the condition about the induced cones. □
Remark 1.1.2.20.
In our definition, a cone over is a functor
There is in fact a “smaller” model for this quotient called . Then is the pullback
This model is the one that is used by Lurie and Joyal.
1.1.3 Colimits
Colimits are formally dual to limits. If is an -category, there is an opposite -category defined by
Then we can define the colimit as the limit of the functor
Explicitly, we first define a cone under to be an object together with a natural transformation . This is a colimit cone if for any , the map
is an equivalence.
Proposition 1.1.3.1.
Extending an object to a colimit cone over a fixed is equivalent to providing a natural isomorphism
where naturality is in .
Example 1.1.3.2.
If , then a colimit over is an initial object, which will be denoted by . It is given by the property that
In , this is actually given by the empty set.
Example 1.1.3.3.
If is discrete, then a functor is , and the colimit is called a coproduct and denoted by
It is characterized by the property that
In , it is given by the disjoint union.
Example 1.1.3.4.
Suppose that
Then a functor is simply a diagram
The colimit, called a pushout and denoted , is characterized by the universal property that for all , we have
where we are taking the homotopy fiber product in .
We will now consider pushouts in the category of spaces. Given a diagram
of spaces, we form the simplicial set
which is usually called the double mapping cylinder. It corresponds to the diagram
Then we will replace this by a Kan complex , and the resulting diagram
is a pushout.
Exercise 1.1.3.5.
Check that this is actually true.
We have seen that the category of spaces has all coproducts and pushouts, and we now want to show that it has all (small) colimits. One way is to write this is to consider
which is a formula for the colimit. Instead, we will show that any -category with all coproducts and pushouts has all colimits.
Example 1.1.3.6.
A coequalizer is a colimit over
a coequalizer is simply a universal which fits into a diagram
and is in fact the pushout
Exercise 1.1.3.7.
Prove this.
Example 1.1.3.8.
A pushout
is actually a coequalizer
We will now discuss sequential colimits. Here, we consider
Functors and colimits are simply sequences
This is actually a coequalizer
Definition 1.1.3.9.
A simplicial set is called finite if it has only finitely many non-degenerate simplices. Colimits over finite simplicial sets will be called finite colimits.
Theorem 1.1.3.10.
For an -category , the following are equivalent:
- 1.
admits an initial object and all pushouts;
- 2.
admits all finite coproducts and all coequalizers;
- 3.
admits all finite colimits.
Proof, but not really.
First, we note that coproducts are pushouts
In the other direction, the initial object is the empty coproduct.
Now, we need to write arbitrary finite colimits using the basic colimits (coproducts, coequalizers, and pushouts). If is a finite simplicial set, we write
and consider the attaching construction of , which is
For any , we have an equivalence
Here, we use the fact that
This allows us to prove the existence of finite coproducts by inducting on the dimension of , where the base case is simply the case of coproducts. □
Exercise 1.1.3.11.
Let be a poset with a terminal object. Show that colimits over are simply given by evaluating at the terminal object.
We know already that the category of spaces has all finite colimits since we already wrote down finite coproducts and pushouts. However, we want all colimits.
Theorem 1.1.3.12.
Suppose admits all coproducts. Then the following are equivalent:
- 1.
admits all colimits;
- 2.
admits all pushouts;
- 3.
admits all coequalizers;
- 4.
admits all geometric realizations, or in other words colimits indexed over .
Proof.
We already know that pushouts and coequalizers are equivalent. We now need to write arbitrary colimits using pushouts and coequalizers. We now write
Then we write
and sequential colimits are simply coequalizers.
We now want to construct pushouts from . Here, we realize the pushout
as a colimit of the simplicial diagram
This proves the result. □
Corollary 1.1.3.13.
The -category of spaces has all colimits.
We will discuss limits and colimits freely in some other -categories.
Definition 1.1.3.14.
The -category of pointed spaces is the homotopy-coherent nerve
where is the simplicially enriched category of pointed Kan complexes.
Definition 1.1.3.15.
The -category of -categories is given by the homotopy-coherent nerve
where is the simplicially enriched category where objects are -categories and morphisms
are given by the maximal Kan complexes.
Theorem 1.1.3.16.
The -categories and have all limits and colimits.
1.1.4 Derived catgories
We will construct an -categorical refinement of the derived category of an abelian category , which encode groups in the mapping spaces. We will first describe an -category where equivalence classes of morphisms are chain homotopy classes, and then we will use Dwyer-Kan localizations to localize at quasi-isomorphisms. The resulting category, , will be characterized by the following:
- •
Objects will be (unbounded) chain complexes in ;
- •
Equivalence classes of morphisms will be given by the usual derived .
Definition 1.1.4.1.
For an abelian category , denote the -category of chain complexes by . It is enriched over and is therefore a dg category.
Construction 1.1.4.2 (Dold-Kan).
There is a lax monoidal functor
Then we form the composite
Each functor in this composition is lax monoidal, so we can turn every dg category into a simplicially enriched category by applying .
The functor has two nice properties. First, it produces Kan complexes, not just simplicial sets. The homotopy groups are given by the non-negative homology groups of the complex, or in other words
for all .
Definition 1.1.4.3.
For a dg category , define the dg-nerve of to be
where , where is obtained from by applying to all complexes.
Note that this produces an -category.
Definition 1.1.4.4.
For an abelian category , define
This actually has some very nice properties with respect to limits and colimits regardless of the abelian category .
Proposition 1.1.4.5.
The -category has all finite limits and colimits.
Proof.
First, note that is the initial and terminal object. In particular, we see that
and that
for any .
Next, let . The coproduct will be . Here, we need to check that
Similarly, is also the product.
Pushouts are trickier. Let and be morphisms. Then we will construct the mapping cone by setting the -th element of the complex to be
with the differential
This gives us a pushout square
We will omit checking that this is actually a pushout. There is a similar description for fiber products. □
Note that is not the actual derived category of . For example, there is a morphism
but not a morphism in the other direction. We want to localize at such quasi-isomorphisms, and the localization we will take is called Dwyer-Kan localization.
Definition 1.1.4.6.
Let be an -category and be any subset of morphisms. A functor
is a Dwyer-Kan localization at if
- •
takes to equivalences in ;
- •
For any , the functor
is fully faithful with essential the full subcategory
on those functors which take to equivalences. We will denote such a by .
Example 1.1.4.7.
Let and let consist of the nontrivial morphism . Then
because if we invert the morphism, the two objects become equivalent. We will check the universal property now. Clearly, the functor takes the unique element of to an equivalence. We now need to check that
is an equivalence. To prove that it is essentially surjective, we need to check that isomorphisms are equivalent to , which is left as an exercise. To prove that it is fully faithful, we need to check that
is a fiber product of the diagram
This proof will also be omitted.
Exercise 1.1.4.8.
Show that every object
is equivalent to .
Having defined Dwyer-Kan localizations, we still need to see that they actually exist.
Proposition 1.1.4.9.
For any -category and any set of morphisms , the Dwyer-Kan localization exists and the functor
is essentially surjective.
Proof.
We can begin by trying the pushout
in . If we apply to this square to obtain the square
We need to prove that this is a fiber product in . Note that these functor categories (which are not Kan complexes) differ from mapping spaces in , which are.
Before we do this, note that note that the essential image of
are those functors which send to equivalences. By general properties of base change, the essential image of
consists of exactly those functors which take to equivalences.
To prove the claim about fiber products of functor categories, we will show that for any pushout
the diagram
is a fiber product. Applying , we first note that
This is because they are both the maximal Kan complex inside of
Therefore, we obtain the diagram
which is a fiber product. □
Therefore, we see that is really an -category, but we will not discuss this in detail here. We are now ready to define the derived category, however.
Definition 1.1.4.10.
Let be the set of quasi-isomorphisms, namely morphisms which induce isomorphisms on homology. Now define the derived category by the formula
This is unfortunately extremely non-explicit. For example, it does not tell us how to work with mapping spaces in .
1.1.5 Slices and filtered colimits
Our goal is now to give a description of mapping spaces in as colimits of mapping spaces in . In many cases, they will even agree with mapping spaces in . In general, the problem of describing mapping spaces in Dwyer-Kan localizations is very hard.
Definition 1.1.5.1.
Let be an -category and be an object. We will define the slice category over by the fiber product
and the slice category under by the fiber product
Note that objects of are morphisms and objects of are morphisms .
Definition 1.1.5.2.
For any chain complex , define the subcategory
to be the full subcategory on all which are quasi-isomorphisms. Dually, we can define
Proposition 1.1.5.3.
We have the following description for mapping spaces in :
Warning 1.1.5.4.
The mapping spaces as we have defined them are not functors . In this case, we can get around this by noting that both and are homotopy-coherent nerves of ordinary categories, but in general we will need the technique of straightening, which is beyond the scope of these notes.
Because quasi-isomorphisms become equivalences in , we have a morphism
Every morphism in induces an equivalence on mapping spaces in , so the target of this morphism becomes
Exercise 1.1.5.5.
Check that the colimit of a constant functor is given by its value. Hint: first give a description of colimits of constant diagrams .
Definition 1.1.5.6.
A complex is -projective if the mapping space functor sends quasi-isomorphisms to homotopy equivalences. Similarly, a complex is -injective if sends quasi-isomorphisms to homotopy equivalences.
Corollary 1.1.5.7.
If is -projective or is -injective, then
Remark 1.1.5.8.
There is a fundamental lemma in homological algebra, which states that bounded below and levelwise projective chain complexes are -projective. Similarly, bounded above and levelwise injective complexes are -injective.
Given some and a quasi-isomorphism with -projective, then
This is the usual way that groups are computed if has enough projectives. Dually, we can compute mapping spaces by taking a -injective replacement of .
Our next goal is to understand limits and colimits in . Limits are easy to understand if there are enough -projective objects and colimits are easy to understand if there are enough -injective objects. In general, we will not need this, but at the cost of introducing filtered colimits.
Definition 1.1.5.9.
An -category is filtered if for any finite simplicial set , every map extends over the simplicial set
This is a simplicial set obtained by taking a cone from out to the right. Dually, we say that is cofiltered if is filtered.
Exercise 1.1.5.10.
A -category is filtered if and only if for every , there exists an object and morphisms and and if for every pair of morphisms there exists a morphism such that the two composites are equal. Show that is filtered if and only if is filtered in the -categorical sense.
We will call colimits indexed over filtered diagrams filtered colimits. Dually, we can also speak of cofiltered limits. Also, being filtered is a weaker property than having colimits.
Lemma 1.1.5.11.
If is a filtered -category and is a finite simplicial set, then the diagram
commutes.
This result only holds for the -category of spaces and is nontrivial even though we only need to check it for being a fiber product square.
Exercise 1.1.5.12.
Prove that filtered colimits commute with finite products in the -category .
Lemma 1.1.5.13.
If comes from a finite simplicial set, then the functor
commutes with filtered colimits.
The analogous result for finite sets follows by the previous exercise.
Exercise 1.1.5.14.
Prove the lemma using the fact that filtered colimits commute with finite limits.
Corollary 1.1.5.15.
The functor
commutes with filtered colimits.
Proof.
This follows from the fact that the functor
commutes with all colimits. □
Exercise 1.1.5.16.
Prove that
commutes with all colimits.
We will now apply this to the discussion of mapping spaces in .
Lemma 1.1.5.17.
The categories and are both filtered.
Proof.
We will instead note that they have all colimits. More precisely, we have that
is closed under colimits. We will not give the proof of this in full, but first we consider the cofiber functor
which sends a morphism to its cofiber, which is the pushout of the diagram
Because it is itself a colimit, it commutes with colimits. Now, a morphism is a quasi-isomorphism if and only if its cofiber is acyclic (in other words, quasi-isomorphic to ), so we only need to check that acyclic objects in are closed under colimits, which is true by definition. A dual argument gives the result in the over category. □
Proposition 1.1.5.18.
The derived category has all finite limits and colimits and they are preserved by the functor .
Proof.
First, we need to check that is still initial and terminal in . Note that is -injective and -projective, so because mapping spaces can be computed in , it is still initial and terminal.
Now consider a pushout
in . Therefore, the square
is a fiber product in spaces. Then the diagram
is a filtered colimit of diagrams of mapping spaces in for . Because filtered colimits commute with finite limits in spaces, it is a fiber product. Dually, we see that fiber products are preserved.
Now we need to check that finite limits and colimits actually exist. Consider a diagram
in . Because commutes with colimits, we see that
is a filtered colimit of sets. Therefore, there exists a quasi-isomorphism such that the morphism comes from . Therefore, we have a morphism
where the bottom row comes from . Therefore, we can simply take the colimit of the bottom row. The same trick gives us fiber products. □
Warning 1.1.5.19.
The Dwyer-Kan localization producing is extremely nice. In general, this is not the case. We will see this in the following statements
Proposition 1.1.5.20.
The Dwyer-Kan localization of simplicial sets at weak equivalences
yields the -category of spaces. Note that we have produced highly nontrivial mapping spaces by localizing a category with only discrete mapping spaces and that limits are usually not preserved by this procedure.
Proposition 1.1.5.21.
Inverting all quasi-isomorphisms from the -category of chain complexes yields the derived category of , or in other words,
This is very hard to deal with, so the presentation we gave is better. Similarly, if we let be the set of chain homotopy equivalences, we obtain
Therefore, we have in some sense performed a two-step localization.
1.1.6 Derived functors
We will discuss derived functors even when there are not enough injectives or projectives. Also, we will see how these are related to adjunctions and Kan extensions.
Assume that is an additive functor, which means that and
This induces a functor
given by levelwise applying . More precisely, it is given by
and is an enriched functor with respect to the dg structure on . Therefore, we may apply the dg nerve construction to obtain a functor
which commutes with finite limits and colimits. Our goal now is to induce a functor
One thing we might ask is that the square
is commutative in . Unfortunately, this is too much to ask for in general.
Exercise 1.1.6.1.
Prove that the following are equivalent:
- 1.
There exists a functor making the square commutative;
- 2.
The functor preserves quasi-isomorphisms;
- 3.
The functor is exact.
Of course, most functors we would like to derive are not exact, so we need to do something different in general. We could then try to ask for a weaker version of a commutative square, namely that there is a natural transformation
Unfortunately, even the zero functor works for , so maybe we want some universality property.
Definition 1.1.6.2.
The left derived functor of is a functor
together with a natural transformation
such that for any other functor
the map
is an equivalence.
Warning 1.1.6.3.
The functor might not always exist.
Proposition 1.1.6.4.
If exists, it preserves finite limits and colimits.
Definition 1.1.6.5.
Given a pair and a functor , the left derived functor is given by a diagram
such that the induced map
is an equivalence for all . We say that LF is the absolute left derived functor if for any , the induced triangle
exhibits as the left derived functor of .
Of course, absolute left derived functors are even more rare than left derived functors.
Remark 1.1.6.6.
We have used the fact that
For a given , we have and
for , which is an example of coreflection (or a right Kan extension).
The main result of this section is the following.
Theorem 1.1.6.7.
For any functor , we have
provided that this limit exists for each . This limit is taken over the slice category .
Example 1.1.6.8.
For , we obtain, we have
because is initial in the slice category.
Example 1.1.6.9.
Assume that there is a -projective object
This is in fact initial in because for any other object , the square
is a fiber product. Because is quasi-isomorphic to , the right vertical arrow is an equivalence, so the mapping space we want is contractible. Therefore, we have
Remark 1.1.6.10.
If for every there exists such a -projective resolution , then
for any functor . This implies that is actually an absolute left derived functor, or in other words that every left derived functor is absolute.
Remark 1.1.6.11.
Often, people define derived functors by taking projective resolutions, but this of course runs into problems with functoriality of projective resolutions. In addition, our approach generalizes better to the nonadditive setting.
Example 1.1.6.12.
Assume that is additive, is small, and has all infinite products and they are exact (Grothendieck’s AB4*). Then has all limits and the derived functor
exists and preserves all finite limits and colimits.
Exercise 1.1.6.13.
Prove that the large category has all small limits if satisfies AB3* and AB4*, namely that has all small products and they are exact. Use as a black box the fact that if a large -category has all small colimits, then -indexed colimits in the category of large spaces commute with all small products, not just finite ones.
We have discussed left derived functors until now, but of course there is a dual notion of right derived functors. These are given by diagrams
with the appropriate universality property. The dual of our formula for reads as
where the colimit is taken over .
Example 1.1.6.14.
We have functors
Then the formulae for mapping spaces show that
This is usually written as
Unfortunately, we cannot derive in both variables at the same time, but we will be able to do this when we introduce nonabelian derived functors.
Sketch of proof of Theorem 1.1.6.7.
The first step is to prove that defining
defines a functor .
The next step is to prove that it preserves weak equivalences. This seems obvious because we are taking a limit over weak equivalences, which requires that the pullback functor between slice categories along a weak equivalence has an adjoint.
As a consequence, there is a natural transformation
If already preserves quasi-isomorphisms, then is an equivalence.The last step is to show that
is an inverse for . □
We will now discuss adjunctions and cofinality.
Definition 1.1.6.15.
Let and be -categories with functors
A natural transformation is a counit of an adjunction if for a given pair of objects and , the induced map
is a homotopy equivalence. Dually, a natural transformation is a unit of an adjunction if the induced mao
is an equivalence. In either case we say that is left adjoint to and write it as .
Note that we have given two ways for to be left adjoint to , but we will see that they are actually equivalent.
Definition 1.1.6.16.
Given functors as before and any natural transformations and , the zig-zag identities hold if the composites
are equivalent to and , respectively.
Proposition 1.1.6.17.
If natural transformations and satisfy the zig-zag identities, then they are unit and counit of an adjunction. Conversely, given a unit of an adjunction , there is a unique counit such that the zig-zag identites hold.
Proof.
If and satisfy the zig-zag identities, then
are inverse to each other. We omit the proof of the existence of a counit given a unit. □
Exercise 1.1.6.18.
Show that if is an equivalence, it is left and right adjoint to its inverse.
We now present some important facts about adjoint functors.
- 1.
Given a functor , then the right adjoint is unique if it exists;
- 2.
The composite of left adjoints is again a left adjoint with the right adjoint given by the composite of right adjoints. A more coherent statement is that we have an equivalence
where is the -category with -categories as objects and left adjoint functors as morphisms and is defined similarly.
Now let be a small -category. Consider the functor
given by pulling back along . Assume that has a left adjoint . Then for any functor , the unit gives a map such that the induced map
is an equivalence. In other words, we have
Proposition 1.1.6.19.
- •
If has all -shaped colimits, then admits a left adjoint.
- •
Assume that has for any an object with a map such that for all , the map
is an equivalence. Then admits a right adjoint given pointwise by .
Exercise 1.1.6.20.
Prove the following statements.
- •
Consider the functor . This has a left adjoint given by the discrete topology.
- •
Given a functor forgetful functor on a slice category, it is a left adjoint if has products.
Adjoint functors behave well with respect to limits and colimits as in the -categorical setting.
Proposition 1.1.6.21.
Left adjoints preserve colimits and right adjoint preserve limits.
Proof.
The proof is left as an exercise. □
Definition 1.1.6.22.
Given a functor and any functor , a triangle
exhibits as the right Kan extension of along if it is terminal among all such diagrams as in the definition of a left derived functor. In other words, the induced map
is an equivalence.
Corollary 1.1.6.23.
If the right Kan extension exists for every , then the restriction functor
admits a right adjoint .
Therefore, we see that derived functors are right Kan extensions.
1.1.7 Nonabelian derived functors
In this section, we will discuss nonabelian derived functors and animation in order to derive non-additive functors. This will be technical, but it will be useful to understand these notions.
First, we will recast derived functors of additive functors . Assume that has enough -projectives. For example, this is true where is the category of modules over a ring. First, the functor
is an equivalence and is left adjoint to the projection . Using this equivalence, the left derived functor of any functor is simply the restriction along . In particular, if the target is an abelian category , the derived functor
preserves connective objects, or in other words
Our goal is now to answer the following questions.
- •
How can we universally characterize ?
- •
What if is not additive?
Exercise 1.1.7.1.
Given a pointed functor between abelian categories, prove that if there exists a functor given on chain complexes representing objects by applying levelwise, must already be additive.
Before we proceed, we need to discuss the Yoneda lemma in -categories. Unfortunately, this will require discussing size issues. We will fix three Grothendieck universes
which is equivalent to fixing three strongly inaccessible cardinals. This becomes three nested models of ZFC where the set of all small sets is a large set and the set of very large sets is a very large set.
We may discuss categories and -categories in all of these universes:
- •
Small categories have small object and morphism sets;
- •
Large categories have large object and morphism sets;
- •
Very large categories have very large object and morphism sets.
For example, the -category of small spaces is a large -category and the -category of large spaces is a very large -category. For example, if is a large category, then . Another example of this is that if we let be the large -category of small -categories, we can also define to be the very large -category of large -categories. This approach avoids issues involving proper classes, but requires jumping between universes.
Some of our previous constructions can now be discussed more precisely. Here, if , then the Dwyer-Kan localization is still large, or in other words,
Another example is that the formula
really lands in the -category of large spaces.
Definition 1.1.7.2.
A large -category is locally small if for any pair of objects, the mapping space
is equivalent to an object to , i.e. is essentially small. Equivalently, the functor
factors through .
Construction 1.1.7.3.
For any large -category , we have a functor
which is given on objects by
called the Yoneda embedding. If is locally small, this factors as
Theorem 1.1.7.4 (Yoneda Lemma).
- 1.
The functor is fully faithful.
- 2.
For any and any , there is a natural equivalence
- 3.
Every object is a (large) colimit of objects of the form for .
Proof.
The proof should be the same as with ordinary categories, but machinery (straightening and unstraightening) is required to handle coherence issues. We will omit this. Of course, the second part implies the first by the equation
For the last item, we consider the pullback
The category is actually large, not very large. We now claim that
Exercise 1.1.7.5.
For any , prove that
Because of our keeping track of size constraints, note that if is small, then every
is a small colimit of representables.
Now let be a functor where is small and is possibly large.
Proposition 1.1.7.6.
Assume that admits all small colimits. Then
- 1.
There exists an essentially unique colimit-preserving functor
extending . In other words, there is a left Kan extension of .
- 2.
If is locally small, then this is left adjoint to the restricted Yoneda embedding
Corollary 1.1.7.7.
There is an equivalence
In other words, is the universal -category obtained from obtained from be freely adjoining colimits.
This is really just a restatement of the proposition.
Construction 1.1.7.8.
Let be any class1 of small colimit shapes, for example all colimits, all finite colimits, all filtered colimits, or all geometric realizations. We form the category
as the smallest full subcategory which contains representables and which is closed under -indexed colimits.
Proposition 1.1.7.9.
For any large -category which admits -indexed colimits, restriction along is an equivalence
whose inverse is given by left Kan extension.
Example 1.1.7.10.
If is any -category, we can define the Ind-category
We claim the following:
- 1.
Objects in are given by functors , where is filtered. These objects are denoted
- 2.
For any pair , we have
In particular, if is a -category, so is .
We are finally now able to return to nonabelian derived functors.
Proposition 1.1.7.11 (Dold-Kan, Quillen, …).
Assume that has enough compact projective objects (compact means that preserves filtered colimits). Then we have an equivalence
Corollary 1.1.7.12.
A functor
which preserves geometric realizations and filtered colimits is uniquely determined by its restriction to .
This is precisely a nonabelian derived functor, which is given by taking the Kan extension in the diagram
In other words, for any object in , we resolve it by simplicial diagrams of compact projectives and then evaluate the functor termwise.
We conclude by giving the categorical incarnation of nonabelian derived functors.
Definition 1.1.7.13.
Let be a category which admits small colimits and is generated under small colimits by . Here, an object is projective if commutes with geometric realizations (if is a -category, we replace geometric realizations with split coequalizers). Then the animation is defined as
Example 1.1.7.14.
If , we obtain
1.2 Higher algebra
One of the most important objects in homotopy theory is the -category of spectra. Studying spectra will give us a homotopy-enriched version of algebra.
1.2.1 Spectra
Let be the -category of pointed spaces. There are functors
where is given by the pushout
and is given by the fiber product
Exercise 1.2.1.1.
Prove that .
Definition 1.2.1.2.
A spectrum is a sequence of (pointed) spaces for together with homotopy equivalences
Definition 1.2.1.3.
The -category of spectra is the infinite fiber product
where is the full subcategory on equivalences, the rightward morphisms take an arrow to its target, and the leftward morphisms take an arrow to the loop space of its source.
Note that objects in are exactly given by lists of
Maps in are lists of maps
together with homotopies
Remark 1.2.1.4.
We can write as a colimit
Using this, mapping spaces can be described as
Example 1.2.1.5.
If is an abelian group, there is a spectrum given by
By definition, we have equivalences
Example 1.2.1.6.
Let be a pointed space. Then there is a spectrum given by
Here, we are using the fact that the loop space is a fiber product, so forming it commutes with filtered colimits. In particular, if , we define .
Lemma 1.2.1.7.
If is a space, then
for any spectrum .
Proof sketch.
Consider a map
By the adjunction, it is adjoint to a morphism
Applying , we obtain a morphism
This yields a map
Going in the other direction is given by restricting to and restricting to the first term in the colimit. □
Definition 1.2.1.8.
Define the functor by
Using this definition, the previous lemma becomes the statement that and are adjoint.
Example 1.2.1.9.
For a finite , we have
For example, if , we see that
are the stable homotopy groups.
We will now see that is well-behaved.
Lemma 1.2.1.10.
The -category has all limits, filtered colimits, and a zero object.
Proof.
The zero object is given by . Limits and colimits both commute with , so we can take them pointwise and still get a spectrum. By the formula for mapping spaces, they satisfy the universal properties. □
Lemma 1.2.1.11.
The functor is an equivalence.
Proof.
Applying to a spectrum is given by
This is just a shift, and its inverse is given by shifting down. □
Proposition 1.2.1.12.
The -category has all colimits and pushout squares are the same as pullback squares (and vice versa).
Very rough proof sketch.
The proof is surprisingly elementary but quite tricky. The key idea is that -category with all finite limits, a zero object, and where is an equivalence has pushouts. These pushouts are determined by the fact that pushout squares are the same as pullback squares. □
We will call -categories with zero objects and all finite limits and colimits where pushout and pullback squares are the same stable. Another example of a stable -category is the derived category .
Remark 1.2.1.13.
The suspension functor is inverse to . Therefore, it is simply the left shift functor. Also note that is equivalent to .
Example 1.2.1.14.
Note that
Similarly, we have
Therefore, we can obtain both cohomology and stable homotopy groups. Because is stable, we get long exact sequences in both cohomology and in stable homotopy.
Unfortunately, not every spectrum is a suspension spectrum. However, this is close to being true.
Lemma 1.2.1.15.
For all , we have
Proof.
We will prove that they have the same mapping spaces. In particular, we compute
□
Our goal is now to make sense of homology, To do this correctly requires us to talk about symmetric monoidal structures, but we can give a different construction.
Construction 1.2.1.16.
We will define a functor given by
This functor is characterized by preserving colimits and taking . In particular, we have
We want to view spectra as modules over and the homology functor as a base change to . We will now attempt to make this precise.
Definition 1.2.1.17.
Define the category of finite spectra to be the full subcategory of all spectra of the form for a finite space.
Exercise 1.2.1.18.
Prove that is closed under finite colimits.
Proposition 1.2.1.19.
We have .
Proof.
There are a natural functor . The objects in are compact objects in . This is because
Therefore, the functor is fully faithful. To prove that it is essentially surjective, we write a spectrum as
and then write as a filtered colimit of finite spaces. □
Note that in the derived category , the subcategory of perfect complexes consists exactly of the compact objects. This is analogous to the fact that every finite spectrum is a finite limit of shifts of . In addition, we actually have
so we will think of as the derived category if such a thing existed (this requires a way to think about as a ring). However, a point of non-analogy is that the mapping space
is not discrete (and in fact it contains all stable homotopy groups of spheres, so is extremely complicated).
We will now make abelian groups a full subcategory of spectra.
Definition 1.2.1.20.
A spectrum is -connective if
for all . Dually, is -coconnective if for all . We will denote the full subcategories as and .
Proposition 1.2.1.21.
The inclusion
has a left adjoint .
Proof.
Denote . We will build as follows:
- •
Choose generators of and consider the corresponding map
- •
Considering the cofiber of this morphism, we obtain a pushout
- •
Let .
This satisfies the property that and that for all . This uses the fact that is connective. Another property is that every map
factors through all of these pushouts because has no homotopy groups for and therefore through . □
Definition 1.2.1.22.
Let denote the fiber of the morphism .
Lemma 1.2.1.23.
If and , then
In addition, there is an equivalence
Proof.
Any map factors through . But now is weakly contractible, so it must be .
For the latter statement, note that gives a functor. In addition, note that mapping spaces are discrete because
for . If is free, choose a map
which is an isomorphism on and therefore an equivalence on . This gives us an isomorphism
If is not free, we choose a map
which is surjective on . The fiber has free , so we use the exact sequence for to conclude. □
We will now discuss the Postnikov tower. For ever , we have a tower
such that is actually the limit of this sequence. Unfortunately, to actually reconstruct from its truncations requires a lot of gluing data.
1.2.2 Symmetric monoidal -categories
Our goal is to explain why and have canonical symmetric monoidal structures.
Recall that an ordinary symmetric monoidal category consists of a category with a tensor product
a unit object , and natural isomorphisms
satisfying a number of coherence conditions. One of them is the pentagon identity, which says that the diagram
commutes.
In this setting, a lax symmetric monoidal functor between symmetric monoidal categories and is a functor
together with natural morphisms
for all and a natural morphism
These must be compatible with the associativity, unit, and symmetry isomorphisms. Such a lax symmetric monoidal functor is strong symmetric monoidal if the above natural morphisms are isomorphisms.
Also recall that a symmetric monoidal category is closed if for all , the functor admits a right adjoint and in particular preserves colimits. Our goal is to generalize the following result to -categories.
Proposition 1.2.2.1.
Let be a commutative ring. Then the category of -modules admits an essentially unique symmetric closed symmetric monoidal structure with unit .
Proof sketch.
Existence is clear, so we will consider uniqueness. Note that because is the tensor unit, we must have
Because the tensor product is assumed to preserve colimits, we obtain
For an arbitrary -module , we write as the cokernel
of a morphism of free -modules. This implies that is the cokernel of
This must be equal to . □
Exercise 1.2.2.2.
Give an actual proof of the proposition.
For any morphism of commutative rings, we obtain a functor
which is symmetric monoidal.
In the land of -categories, we will state the following theorem, which gives some examples of symmetric monoidal -categories and symmetric monoidal functors.
Theorem 1.2.2.3.
- 1.
The -categories and admit essentially unique closed symmetric monoidal structures with units and , respectively. We will denote the tensor products by and , respectively.
- 2.
The functors , , and have canonical strong symmetric monoidal structures.
This will require us to define symmetric monoidal -categories such that is an example for any symmetric monoidal category and to define lax and strong symmetric monoidal functors.
The very rough idea of the proof of the theorem for is as follows. If , then we must have . Secondly, tensoring with the suspension spectrum of a space gives
We then obtain because is an equivalence and is clearly symmetric monoidal. Finally, we use the fact that every spectrum is a colimit of its constituent parts . This determines the tensor product up to equivalence.
Let be the category of finite pointed sets with as a basepoint. For every there is a map
Definition 1.2.2.4 (First definition, Segal).
A symmetric monoidal -category is a functor
such that the induced maps
are equivalences for all
The underlying category of such an object is . The tensor product is simply the map
where is given by and . The tensor unit is given by the map
which is equivalent to an object in . The idea is that all of the higher values of the functor encode all coherences like associativity, and symmetry.
Exercise 1.2.2.5.
For an ordinary symmetric monoidal -category , construct a functor
which takes a pointed set to .
Definition 1.2.2.6.
A strong symmetric monoidal functor is a natural transformation .
In particular, we could define a full subcategory
The reader could take this as a definition of the -category of symmetric monoidal -categories, but it has some shortcomings. The main shortcoming is that we don’t really have a way to discuss lax symmetric monoidal functors.
Definition 1.2.2.7 (Lurie).
A symmetric monoidal -category is a functor
satisfying the following conditions:
- 1.
It is a cocartesian fibration.2 In particular, we can consider the fibers
and compute them as ordinary fiber products of simplicial sets. In addition, for any morphism in , we obtain a pushforward
- 2.
The induced maps
are equivalences for all
We will call and the tensor product is given by
Theorem 1.2.2.8 (Lurie).
The two definitions agree in that for a symmetric monoidal -category , we get an induced functor given by and vice versa.
We will discuss how to get a fibration from a copresheaf of -categories, but only do it for an ordinary symmetric monoidal category . We define as follows:
- •
Objects are given by lists in for ;
- •
Morphisms from to are given by the data of
- –
A map in ;
- –
For each , a map
- –
- •
Composition is defined in the obvious way;
- •
The forgetful functor takes to .
Taking the nerve of this gives a symmetric monoidal -category.
We will now start defining lax symmetric monoidal functors. We will call a morphism
inert if the induced map
is a bijection.
Definition 1.2.2.9.
A lax symmetric monoidal functor between symmetric monoidal -categories and is a functor
such that sends cocartesian lifts of inert morphisms to cocartesian lifts.
Exercise 1.2.2.10.
Prove that for -categories, a lax symmetric monoidal functor induces a functor .
1.2.3 -algebras
-algebras interpolate between associative (-) algebras and commutative (-) algebras. In this section, will be a symmetric monoidal -category.
Definition 1.2.3.1.
An associative algebra in is a symmetric monoidal functor
where objects of are finite sets, morphisms are morphisms of finite sets with a chosen linear order on preimages of points, composition is given by the lexicographic order, and the tensor product is given by disjoint union. We will denote the -category of associative algebras in by
Definition 1.2.3.2.
A commutative algebra in is a symmetric monoidal functor
where is just the category of finite sets. We will denote the -category of commutative algebras in by
Warning 1.2.3.3.
In a -category , we have an inclusion
This is completely false in -categories, even if there is a functor.
We will now interpolate between commutative and associative algebras.
Definition 1.2.3.4.
Let . We define a symmetric monoidal -category as the homotopy-coherent nerve of the topologically enriched category given by the following:
- •
Objects are disjoint unions of (poly)disks ;
- •
Morphisms from to are given by rectilinear embeddings. These are simply embeddings of topological spaces which on each disk is given by an affine linear map with matrix of the form
An example would look something like Figure 1.1.
Figure 1.1: Morphism in . - •
Composition is simply composition of embeddings.
This category is clearly topologically enriched and has a symmetric monoidal structure given by disjoint union.
Definition 1.2.3.5.
An -algebra in a symmetric monoidal -category is a symmetric monoidal functor
We will denote the -category of -algebras in by
Note that all mapping spaces in are determined by
This has a map
given by evaluation at the center of each disk. Here, is the configuration space and is simply the locus where no two points agree.
Exercise 1.2.3.6.
Prove that the evaluation map we just defined is a homotopy equivalence.
As an example, it is clear that
The next example is
Now suppose we have an -algebra with underlying algebra . We also have a morphism
and other morphisms. Restricting to the -cell, this is a multiplication morphism.
To try to understand -algebras, we may try to begin with .
Proposition 1.2.3.7.
There is an equivalence
of symmetric monoidal -categories which sends a finite set to disjoint union .
Proof.
First, we show that all mapping spaces in are discrete. Up to homotopy, a map is simply an ordering of the indexing set of connected components of the source. This is precisely the set of maps in . This functor sends disjoint unions to disjoint unions, and finally a symmetric monoidal functor between symmetric monoidal -categories is an equivalence in the -category of symmetric monoidal -categories if and only if the underlying functor is an equivalence. □
Corollary 1.2.3.8.
We have an equivalence
Exercise 1.2.3.9.
Figure out what -algebras are in an arbitrary symmetric monoidal -category. Next, figure out what -algebras in the -category of -categories are (you should get braided monoidal categories).
There are functors
given by taking the Cartesian product with . These are symmetric monoidal functors, so we have induced functors
Definition 1.2.3.10.
The -category of -a;gebras is the inverse limit of the diagram
in .
Theorem 1.2.3.11.
We have an equivalence
Sketch of proof.
First, note that
Proving that this colimit is equivalent to is left as an exercise. □
We will now state a very important result. The proof is very hard, but the statement should be understandable. Let be a closed symmetric monoidal category or at least have the property that commutes with filtered colimits and geometric realizations. We will also assume that has all limits and colimits.
Theorem 1.2.3.12 (Lurie).
- 1.
The -category admits all limits and colimits for any . The forgetful functor
preserves filtered colimits, geometric realizations, and all limits. Moreover, it detects equivalences.
- 2.
When , the coproduct and tensor product coincide.
- 3.
The -category admits a symmetric monoidal structure such that is symmetric monoidal.
Exercise 1.2.3.13.
Do the -categorical analogue of the theorem in the category of abelian groups.
We will now discuss -algebras in the -category of spaces equipped with symmetric monoidal structure given by the Cartesian product. Then is the category of “monoids” in . For any such space , the set of connected components is a monoid.
Definition 1.2.3.14.
We say is grouplike if is a group. This is equivalent to saying that the shear map
is a homotopy equivalence. In addition, we say an -algebra is grouplike if the underlying -algebra is grouplike.
For every pointed space , the iterated loop space
is canonically an -algebra in .
Exercise 1.2.3.15.
Make this -algebra structure precise by giving a functor of topologically enriched categories.
Theorem 1.2.3.16 (Boardman-Vogt).
The functor
is fully faithful with essential image the grouplike -algebras for any .
Corollary 1.2.3.17.
For any -algebra in and any connected pointed space , we have that
Proof.
We can consider the subspace consisting of the unit component . Then
Similarly, we have
Therefore, we may assume that is grouplike. But this means that for some pointed -connected space . This implies that
Sketch of proof of Theorem 1.2.3.16.
We begin with the case of . Here, we have the functor
We will construct an inverse using the bar construction, which is given by
The result we need is that
The general step is now to induct on
This is actually the same as
Theorem 1.2.3.18 (Dunn additivity).
For any symmetric monoidal
for all
Note that the
Corollary 1.2.3.19.
Suppose that
given by
is well-defined.
Proof.
Note that it is simply given by
1.2.4 p -adic completion
We will generalize the process of going from
Recall that an abelian group
Definition 1.2.4.1.
For a spectrum
As we would expect, if
defined as the cofiber of
Definition 1.2.4.2.
For a spectrum
Note that there is a canonical map
Remark 1.2.4.3.
All of these constructions are well-defined up to contractible choice.
Definition 1.2.4.4.
A spectrum
Theorem 1.2.4.5.
- 1.
For every spectrum
, the spectrumX isX p ∧ -complete.p - 2.
The functor
is left adjoint to the inclusion( − ) p ∧ : 𝖲𝗉 → 𝖲𝗉 p ∧ .𝖲𝗉 p ∧ ↪ 𝖲𝗉 - 3.
The
-category∞ has all limits and colimits.𝖲𝗉 p ∧
Sketch of proof.
We will first prove that
This implies that
First, note that the functor
If
by applying
We know already that limits and finite colimits exist. For an arbitrary colimit of a functor
Exercise 1.2.4.6.
Prove that a spectrum
Moreover, prove that
Definition 1.2.4.7.
A map
is an equivalence.
Note that if
Proposition 1.2.4.8.
- 1.
A map
is af : X → Y -adic equivalence if and only if the mapp f / p : X / p → Y / p is an equivalence.
- 2.
A map
between connectivef : X → Y is aX , Y -adic equivalence if and only if the induced mapp X ⊗ 𝕊 H 𝔽 p → Y ⊗ 𝕊 H 𝔽 p is an equivalence (in other words, we can check equivalence on homology).
Proof.
The proof is left as an exercise to the reader. □
Now we know that
Proposition 1.2.4.9.
Let
For example, we see that
Definition 1.2.4.10.
An abelian group
Remark 1.2.4.11.
There is also a notion of
Theorem 1.2.4.12.
- 1.
A spectrum
isX -complete if and only ifp is derivedπ n ( X ) -complete for allp .n - 2.
Assume that
has bounded order ofπ n ( X ) -torsion for eachp ∞ . Thenn π ∗ ( X p ∧ ) = π ∗ ( X ) p ∧ .
Example 1.2.4.13.
The most important example of a
Another example is simply
There are some nice monoidal properties associated to
- •
The category
of𝖲𝗉 p ∧ -complete spectra admits a closed symmetric monoidal structure given byp X ⊗ ^ p Y ≔ ( X ⊗ 𝕊 Y ) p ∧ . In particular, the
-completion functor is strong symmetric monoidal.p - •
If
is anR -algebra, then so is𝔼 n andR p ∧ is anR → R p ∧ -map exhibiting𝔼 n as the initialR p ∧ -completep -algebra under𝔼 n .R
It is much easier to deal with
Question 1.2.4.14.
Can we recover any spectrum
The answer to this question must be no by the example of
Definition 1.2.4.15.
A spectrum
This is actually even better-behaved than
Theorem 1.2.4.16.
- 1.
A spectrum is rational if and only if it admits the structure of an
-module.H ℚ - 2.
For any spectrum
, the spectrumX is rational andX ⊗ 𝕊 H ℚ ≕ X ℚ .π ∗ ( X ℚ ) = π ∗ ( X ) ℚ - 3.
The functor
is left adjoint to the inclusion− ⊗ 𝕊 H ℚ : 𝖲𝗉 → 𝖲𝗉 ℚ .𝖲𝗉 ℚ ⊆ 𝖲𝗉 - 4.
The category
is closed under limits and colimits.𝖲𝗉 ℚ ⊆ 𝖲𝗉 - 5.
We have an equivalence
𝖲𝗉 ℚ ≅ 𝖬𝗈𝖽 H ℚ ≃ 𝒟 ( ℚ ) . - 6.
The category
is symmetric monoidal with tensor product𝖲𝗉 ℚ X ⊗ 𝕊 Y = X ⊗ H ℚ Y and unit
.H ℚ
Exercise 1.2.4.17.
Prove this theorem using the fact that
We can now refine our question.
Question 1.2.4.18.
Can we recover any spectrum
Our slogan will be that the answer to this question is yes if we also include the data of a certain “gluing map.” This uses something known as the Hasse square.
For every spectrum we have maps
In addition, rationalizing the
By naturality properties of rationalization, we obtain a commutative square
This is called the Hasse square or the fracture square.
Theorem 1.2.4.19.
For any spectrum
This theorem is proved by noting that
The theorem can be refined to the categorical level. In particular, we have a pullback diagram
of
Unfortunately, this morphism is not symmetric monoidal, but it at least behaves well with respect to
of
1.2.5 Tate construction
Let
denote the category of objects in
Construction 1.2.5.1.
We will consider
Definition 1.2.5.2 (Klein).
We define a spectrum
with its remaining
The name dualizing spectrum needs a justification, which will be given in the remainder of this section. Before we do this, we give some examples.
Example 1.2.5.3.
Assume
Computing the homotopy fixed points, we obtain
More precisely, the map
is an equivalence.
To see this, consider the homotopy fixed point spectral sequence
It is a classical result that
Therefore the spectral sequence degenerates and yields the result. This implies that
Now suppose that
Theorem 1.2.5.4.
If
where
For example, let
Now assume that
Theorem 1.2.5.5 (Atiyah duality).
The dualizing spectrum is given by
where we extend the construction
it sends
Remark 1.2.5.6.
For any space
For example, we can define this functor on connected components because
In particular, we assign
Construction 1.2.5.7.
Let
defined such that the functor
preserves colimits and the composite
is given by the functor
Definition 1.2.5.8.
Let
as the composite
Exercise 1.2.5.9.
Prove that
This is quite an abstract construction, so we will try to get our hands on it with some examples.
Example 1.2.5.10.
If
For example, if
and is induced from the classical norm map
from coinvariants to invariants.
This follows from the fact that for a general
is the sum over all
Exercise 1.2.5.11.
Prove that if
agrees with the map
Example 1.2.5.12.
When
Theorem 1.2.5.13.
The norm map
- 1.
is a finite CW complex;B G - 2.
is induced, which means thatX whereX ≃ Σ + ∞ G ⊗ Y acts only onG .Σ + ∞ G
Sketch of proof.
In the first case, all limits in the interchange maps are finite. Because all functors in the composite are exact, we are done.
In the second case, the limits and colimits are still close enough to being finite, so we are done. □
Example 1.2.5.14.
Let
The target has homotopy groups given by
The source is explicitly given by
where
given by homology with coefficients in the orientation cover. On homotopy groups, this map
is simply Poincaré duality (at least if
If we replace
This can be thought of as being analogous to Serre or Verdier duality in algebraic geometry. If
Theorem 1.2.5.15 (Klein).
The natural transformation (called the assembly map)
exhibits the functor
Note that this uniquely determines the spectrum
Definition 1.2.5.16.
For an object
Example 1.2.5.17.
If
of
Exercise 1.2.5.18.
Work out what Tate cohomology is in terms of usual homology and cohomology.
Example 1.2.5.19.
Suppose that
admits a (unique) lax symmetric monoidal structure such that the natural transformation
admits a refinement to a symmetric monoidal transformation.
Corollary 1.2.5.20.
If
1.2.6 Tate diagonal
The Tate diagonal is a surprising feature of the world of spectra. Before we discuss it, we will motivate it by discussing abelian groups.
Let
this is not a homomorphism. For example, note that
Recall now that if
Note here that the error term of the map
This homomorphism in fact exhibits
Exercise 1.2.6.1.
- 1.
Prove that
induces a homomorphismx ↦ x ⊗ p A → ( A ⊗ p ) C p / N ( ( A ⊗ p ) C p ) . - 2.
Prove that this homomorphism factors through an isomorphism
A / p → ∼ ( A ⊗ p ) C p / N ( ( A ⊗ p ) C p ) .
We will now discuss the analogous construction for spectra.
Theorem 1.2.6.2.
There is a unique lax symmetric monoidal natural transformation
In the rest of this section, we will attempt to see where this comes from and understand some of its properties.
Lemma 1.2.6.3.
The Singer construction
is an exact functor.
This result is particularly surprising because the
Proof.
First, suppose
On all of the non-pure terms, the action of
In general, consider a cofiber sequence
where
There is a monoidal structure on filtered objects called the Day convolution structure which produces this diagram from our filtered object. The associated graded terms are given by
Applying Tate fixed points, the associated graded terms are now of the form
This implies that we have a cofiber sequence
Remark 1.2.6.4.
The Singer construction commutes with suspension as
We can write
but the action of
Lemma 1.2.6.5 (Stable Yoneda Lemma).
Let
Proof sketch.
We will reduce this to the
which by the ordinary Yoneda lemma yields a sequence of points in
In other words, we have an equivalence of spaces
Natural transformations
Note that there are other maps
Lemma 1.2.6.6.
The functor
We are now ready to discuss some properties of the Tate diagonal. In particular, we will not prove anything.
Theorem 1.2.6.7.
For a bounded below
exhibits
In particular, we see that
The Tate construction also allows us to define a version of Frobenius on
Definition 1.2.6.8.
For an
using the fact that multiplication
We should think about this as an analogue of the morphism
for an ordinary commutative ring
Exercise 1.2.6.9.
Prove that it is necessary that
Applying the Tate-valued Frobenius to
for some space
2 (Topological) cyclic homology
2.1 Classical Hochschild and cyclic homology
In this section, we discuss Hochschild homology, (negative, periodic) cyclic homology, the HKR theorem, and related topics.
2.1.1 Hochschild homology
Let
Definition 2.1.1.1.
The Hochschild homology of
where the differential is given by
Remark 2.1.1.2.
This seems related to what happens when you multiply elements placed on an
Example 2.1.1.3.
For now, set
where the differentials are alternating sums of
and therefore the Hochschild homology is
Example 2.1.1.4.
Because the last differential is given by
In particular, if
In this case, we have
We will now recall the definition of the module of Kähler differentials.
Definition 2.1.1.5.
The module of Kähler differentials of a commutative ring
- 1.
For all
, we havex , y ∈ R ;d ( x + y ) = d x + d y - 2.
For all
, we havex , y ∈ R ;d ( x y ) = x d y + y d x - 3.
For all
, we havex ∈ k .d x = 0
Therefore, we see that
There is at most one map
Exercise 2.1.1.6.
Check that this is an isomorphism.
We will now prove some more properties of Hochschild homology.
Lemma 2.1.1.7.
If
Proof.
The Hochschild complex
where the face maps are the components of the differential
On the de Rham side, there is also a multiplicative structure.
Definition 2.1.1.8.
The de Rham complex is the exterior algebra
By extending from degree
Theorem 2.1.1.9 (Hochschild-Kostant-Rosenberg).
If
is an isomorphism.
We will discuss the cotangnet complex later, but for now we may think that
Remark 2.1.1.10.
The differential on
Exercise 2.1.1.11.
Find an explicit description of
We will now extend to the case when
If
This is well-defined up to quasi-isomorphism.
Proposition 2.1.1.12.
For a dg-algebra
Remark 2.1.1.13.
This is usually called Shukla homology, but we will not make this distinction here.
Proof.
Replacing
The differentials are given by multiplying adjacent terms, but without the
Lemma 2.1.1.14.
If
Proof.
We replace
Lemma 2.1.1.15.
If
Remark 2.1.1.16.
If
Proof.
Because
is a bisimplicial dg-algebra. Taking the total complex in all three directions, the result is quasi-isomorphic to the diagonal, which is precisely
We are now ready to prove the HKR theorem for polynomial rings. As we will see later, we will reduce the general case to this one.
Proof of Theorem 2.1.1.9 for polynomial rings.
In the case of
Then we only need to check that
We have the resolution
of
For
so because both sides of the HKR theorem commute with tensor products, we obtain the desired result.
Finally, if
We will now turn to an extremely non-smooth example.
Proposition 2.1.1.17.
We have
where the
Proof.
We will compute the derived tensor product
We will resolve
The tensor product is then given by
We will resolve
and the desired result follows by taking the tensor product. □
2.1.2 The Connes operator
We will describe an operator on
is induced from the universial derivation
Definition 2.1.2.1.
Let
by the formula
where we define
This formula is related to the cyclic objects introduced by Connes, and there is a way to think about it systematically in the topological setting, which we will discuss later.
Exercise 2.1.2.2.
Check that
- 1.
;B 2 = 0 - 2.
.d B + B d = 0
The operator
Note that if
We then see that
satisfying
Warning 2.1.2.3.
One might object that we only defined the Connes operator only for algebras concentrated in degree
We need the following fact.
Lemma 2.1.2.4.
If
Warning 2.1.2.5.
The Connes operator is not true on the complex
Proposition 2.1.2.6.
The map
sends the de Rham differential
commutes.
Proof.
The map
and in degree
Therefore, it is enough to check that the diagram
commutes. Note that for any
This corresponds to the element
We conclude by using the fact that the de Rham differential is uniquely determined by being a derivation and its effect on
Remark 2.1.2.7.
Sometimes in the rest of these notes, we will denote the Connes operator by
Example 2.1.2.8.
For
Question 2.1.2.9.
Does this mean that it acts trivially (maybe up to homotopy or quasi-isomorphism) on
The answer to this question is in fact no, and we will see this by taking a (derived) reduction mod
Letting
This implies that
Proposition 2.1.2.10.
Writing the divided power
Note that this implies that
Proof.
The map
Now recall that we computed
by replacing
Writing out the full double complex, we obtain
The class
After reducing mod
2.1.3 Periodic and cyclic homology
In the anology between Hochschild homology and the de Rham complex, we will now discuss cyclic homology, which will be analogous to algebraic de Rham cohomology.
We will work with derived functors in the category
Definition 2.1.3.1.
Let
- 1.
The cyclic homology of
isR 𝖧𝖢 ∗ ( R / k ) ≔ H ∗ ( k ⊗ A 𝕃 𝖧𝖧 ( R / k ) ) = Tor ∗ A ( k , 𝖧𝖧 ( R / k ) ) . This will not play any role in these notes.
- 2.
The negative cyclic homology of
isR 𝖧𝖢 ∗ − ( R / k ) ≔ RHom A ( k , 𝖧𝖧 ( R / k ) ) = Ext A − ∗ ( k , 𝖧𝖧 ( R / k ) ) . This is more important than cyclic homology, and topological cyclic homology will be an analog of this rather than of cyclic homology. Also, note that
is a module over𝖧𝖢 ∗ − ( R / k ) , whereExt A ∗ ( k , k ) = k [ t ] .| t | = − 2 - 3.
The periodic cyclic homology (or periodic homology) of
isR 𝖧𝖯 ∗ ( R / k ) = 𝖧𝖢 ∗ − ( R / k ) [ t − 1 ] .
Exercise 2.1.3.2.
Show that
Note that the definition we gave is not the standard one in the literature, which involves double complexes. We may wonder if these definitions are equivalent.
Proposition 2.1.3.3.
For any
where
for
Proof.
We will resolve
where we declare that
Note that
This implies that
Here, we use the fact that
Remark 2.1.3.4.
This argument works more generally to obtain
Remark 2.1.3.5.
and coproduct
This implies that
as a lax symmetric monoidal functor. Moreover, if
Warning 2.1.3.6.
Even if
Instead of doing all of that, we will use the hack that
Our goal now is to enhance the HKR theorem (Theorem 2.1.1.9). For this, we will need de Rham cohomology.
Definition 2.1.3.7.
Let
Remark 2.1.3.8.
Since we are working with commutative rings (equivalently, affine schemes), every term in the de Rham complex is acyclic by vanishing of higher cohomology on affines, so we are just taking global sections. However, this invariant is more interesting for schemes
Theorem 2.1.3.9.
Assume that
where
Exercise 2.1.3.10.
Describe the map
Remark 2.1.3.11.
Because this is again relatively boring for rings, the interesting statement is that for a scheme
Remark 2.1.3.12.
We can drop the flatness assumption on
Remark 2.1.3.13.
The statement of Theorem 2.1.3.9 is false if
Proof.
We will give a classical proof. It is possible to give a fancier proof using nonabelian derived functors.
Consider a chain-level map
given by
Lemma 2.1.3.14.
This
Proof of Lemma.
We compute
Compatibility with
We conclude with the following exercise.
Exercise 2.1.3.15.
Check that
Using the lemma, we see that
is the identity, so the statement follows from Theorem 2.1.1.9. □
We are now ready to prove Theorem 2.1.3.9.
Proof of Theorem 2.1.3.9.
We simply compute
Applying the same strategy to negative cyclic homology, we obtain
We still want to deal with arbitary
Construction 2.1.3.16.
We have the Postnikov filtration
of
This leads to a multiplicative, conditionally convergent spectral sequence
The
If
We will now return to the example of
Definition 2.1.3.17.
Let
Proposition 2.1.3.18.
For
In addition, we have
where
Remark 2.1.3.19.
Note that we have
which is obtained by adjoining divided powers of
where we should think of
What we have seen is that the negative cyclic and periodic cyclic homology of
Proof.
Recall that
The
Because everything is in even degree, the spectral sequence collapses at the
There is an additive extension problem and a multiplicative extension problem. We will obtain a copy of
The connective cover of
If we can find
Because the filtration on
Now we will recall the computation of
In
we calculate
and therefore
Remark 2.1.3.20.
One can also deduce this entire computation using the fact that
Remark 2.1.3.21.
We have not talked at all about cyclic homology, but there is a long exact sequence
which computes
2.1.4 The HKR theorem
We will now discuss the cotangent complex using nonabelian derived functors and prove the HKR theorem.
Let
preserves filtered colimits and reflexive coequalizers, which are diagrams of the form
Note that this notion doesn’t really make sense for
detect isomorphisms.
We can now pass from
where
- •
The category
of compact projective objects is a full subcategory of𝒞 𝖼𝗉 , and so is the ind-category𝖠𝗇𝗂 ( 𝒞 ) .𝖨𝗇𝖽 ( 𝒞 𝖼𝗉 ) - •
A general object of
can be represented as the geometric realization of a simplicial diagram with entries in𝒞 .𝖨𝗇𝖽 ( 𝒞 𝖼𝗉 ) - •
If
is compact projective object ofX and𝒞 are any ind-compact projective objects, then the mapping spaceY j 𝖬𝖺𝗉 𝖠𝗇𝗂 ( 𝒞 ) ( X , colim j ∈ Δ op Y j ) = colim j ∈ Δ op 𝖬𝖺𝗉 𝖠𝗇𝗂 ( 𝒞 ) ( X , Y j ) is a simplicial set, so taking the geometric realization gives us a space.
Example 2.1.4.1.
If
Example 2.1.4.2.
The non-negative derived category
this will extend to a functor preserving filtered colimits and geometric realizations denoted by
Example 2.1.4.3.
For any commutative ring
taking a module to its
We cannot compute by resolving chain complexes, so instead we will represent an object by a simplicial diagram of projective modules and then applying
For example, consider
Applying the Dold-Kan correspondence, we obtain a simplicial object
Exercise 2.1.4.4.
- 1.
Find a levelwise projective simplicial abelian group whose complex is quasi-isomorphic to
.ℤ / n [ 0 ] - 2.
Compute
. Hint: computeL Λ ℤ 2 ( ℤ / n ) forH i by hand and then find a different reason for the vanishing for higheri ≤ 2 .i
If we apply
which is simply given by
which is equivalent to
One advantage of this animation language is that we can discuss animation for categories which have no linear structure. For example, we have
Clearly we see that the ind-compact projective objects
are simply all polynomial rings. Therefore, we will represent objects by simplicial diagrams of polynomial rings. For example, we have
extracts the underlying simplicial set (in fact a simplicial abelian group). This give some version of non-negative complexes with ring structure.
Warning 2.1.4.5.
This does not agree with commutative ring objects in
The universal property is that
This allows us to define nonabelian derived functors by defining functors on polynomial rings which preserve filtered colimits.
Example 2.1.4.6.
The functor
If we apply it to an ordinary commutative ring, this agrees with our previous definiion of Hochschild homology. In fact, it agrees for all animated rings by considering the associated dg-algebra.
Remark 2.1.4.7.
There is a way to define Hochschild homology in
Question 2.1.4.8.
Is there a way to extend the HKR theorem to general rings using non-abelian derived functors?
Construction 2.1.4.9.
For any
which has the following properties:
- •
The map is an isomorphism on
forH i ;i ≥ n - •
For all
, we havei < n .H i ( τ ≥ n C ) = 0
One explicit construction of this is to replace everything in degree
Exercise 2.1.4.10.
Construct the functor
We in fact have a map
For polynomial rings
Therefore, we can try to compute Hochschild homology using the machinery of nonabelian derived functors by levelwise using the HKR theorem for this “filtration.”
Definition 2.1.4.11.
We define
as the geometric realization preserving extension of
We see that there is a cofiber sequence
for any animated ring
Lemma 2.1.4.12.
The nonabelian derived functor
Proof.
The lemma clearly holds for polynomial rings, and the extension to everything else follows from the fact that
Lemma 2.1.4.13.
If a functor
Proof.
We resolve
and note that
Therefore,
so taking
□
Exercise 2.1.4.14.
Show that the following functors commute with reflexive coequalizers:
- 1.
The functor
given by𝖼𝖱𝗂𝗇𝗀 → 𝖲𝖾𝗍 ;R ↦ R × n - 2.
The functor
given by𝖼𝖱𝗂𝗇𝗀 → 𝖠𝖻 ;R ↦ ℤ [ R × n ] - 3.
The functor
. Hint: think about the generators and relations presentation forΩ − / ℤ i : 𝖼𝖱𝗂𝗇𝗀 → 𝖠𝖻 .Ω R / ℤ 1
We are now ready to give an enhanced version of Theorem 2.1.1.9.
Theorem 2.1.4.15.
If
Proof.
Using the long exact sequence in homology associated to
This implies that
is an isomorphism and that for all
is an isomorphism. Descending to
We will omit checking that this is compatible with multiplication, and that in fact it is the map we had before. □
To better understand this, we need to better understand
which is given by
for
Exercise 2.1.4.16.
Check that
Applying nonabelian derived functors, we obtain
Proposition 2.1.4.17.
If
Proof.
If
In the general case, we use Lazard’s theorem, which states that every flat
We are now able to state the correct form of Theorem 2.1.1.9.
Theorem 2.1.4.18 (Hochschild-Kostant-Rosenberg, ultimate version).
If
Remark 2.1.4.19.
For simplicity, we worked over
2.1.5 Hochschild homology of schemes
Let
- 1.
Extending from the affine case (by a right Kan extension);
- 2.
Generalize the functor
to𝖧𝖧 ( − / k ) -linear dg categories (or stablek -categories) and then define define∞ 𝖧𝖧 ( X / k ) = 𝖧𝖧 ( 𝖯𝖾𝗋𝖿 ( X ) / k ) . This is essentially an approach in the spirit of non-commutative geometry and is actually better in many cases (for example, we see that Hochschild homology is really an invariant of a stable
-category), but we will take the first approach in these notes since it is closer to the case of rings.∞
Definition 2.1.5.1.
For a scheme
Note that if
because
Remark 2.1.5.2.
We can also define Hochschild homology for stacks. For simplicity, we will not do this.
We will now discuss an example of a non-affine scheme. Let
whose intersection is given by
We will hope for some kind of descent of Mayer-Vietoric sequence.
Theorem 2.1.5.3.
For any pair of open subsets
is a pullback in
Remark 2.1.5.4.
Later, we will see that
Corollary 2.1.5.5.
There is a long exact sequence
Lemma 2.1.5.6.
For any commutative ring
Exercise 2.1.5.7.
Prove this.
In the example of
This becomes the long exact sequence
Therefore, it is easy to compute
Proof of Theorem 2.1.5.3.
We always have the square
For any open set
Therefore, without loss of generality that
where
Therefore, it suffices to prove that
which is a standard fact. This is true because
which is true because
Our goal now is to prove an analog of Theorem 2.1.4.15 and Theorem 2.1.4.18 for schemes. We begin by defining a filtration on
Remark 2.1.5.8.
Note that this cannot be done using the non-commutative approach.
Proposition 2.1.5.9.
This defines a complete filtration on
Moreover, the associated graded is given by
which is usually called the derived Hodge cohomology of
Note that if
Proof.
Completeness follows from the fact that it is true for affines and that inverse limits commute with inverse limits. The assertion about (derived) Hodge cohomology follows again from the fact that cofibers commute with limits. □
Using the proposition, we obtain a spectral sequence
Corollary 2.1.5.10.
If
Proof.
This is clearly true if
Remark 2.1.5.11.
This isomorphism is in fact compatible with the
2.2 Topological Hochschild and cyclic homology
2.2.1 Hochschild homology in ∞ -categories
Hochschild homology can be constructed in an arbitrary symmetric monoidal
Recall that
In
given by the left copy of
Of course, the underlying object is simply the image of
Exercise 2.2.1.1.
Prove that the category of symmetric monoidal functors
Recall that Hochschild homology was defined by writing a simplicial diagram. However, this is very hard to do by hand in an
Definition 2.2.1.2.
For a finite, nonempty totally ordered set
We form the closely related set of cyclic cuts
Exercise 2.2.1.3.
Check that the functor
The functor
consists of all cuts on
Definition 2.2.1.4.
For an algebra
Lemma 2.2.1.5.
For an ordinary ring (or dg algebra), we obtain an algebra
between the Hochschild complex of
Proof.
The functor
Exercise 2.2.1.6.
For an ordinary ring
agrees with the cyclic bar complex of
Definition 2.2.1.7.
For a ring spectrum
Recall that ordinary rings
Example 2.2.1.8.
Because
This example suggests that we can view
Definition 2.2.1.9.
Define the
- •
Objects are finite sets with elements labelled (“colored”) by
;{ a , m } - •
Morphisms are maps
together with a total ordering on preimages subject to the conditions thatS → T - –
Preimages of
-colored elements are completelya -colored;a - –
Preimages of
-colored contain precisely onem -colored element and this element is the maximum.m
- –
We can define an analogous category
Definition 2.2.1.10.
A left module in a symmetric monoidal
Note that if we only considered
Definition 2.2.1.11.
Define a category
- •
Objects are finite sets with colors given by
;{ r , a , ℓ } - •
Morphisms are maps
of finite sets with a total ordering on preimages such thatf : S → T - –
Preimages of
-colored elements are entirelya -colored;a - –
Preimages of
-colored elements have precisely oner -colored element at the minimum and the rest arer -colored;a - –
Preimages of
-colored elements have precisely oneℓ -colored element at the maximum and the rest areℓ -colored.a
- –
Because the
Definition 2.2.1.12.
Define the tensor product
Here, the cut functor colors
There are variants of this theory, including bimodules. In this case, we relax the restriction on preimages of
which is Hochschild homology of
We can also discuss commutative algebras. Recall that
Lemma 2.2.1.13.
For a commutative algebra
We will now study
coming from the Dold-Kan correspondence. It has the property that
This functor is lax symmetric monoidal and preserves colimits, so we obtain a canonical map
On homotopy groups, we obtain a morphism
The functor
which is symmetric monoidal. Therefore, we see that
Example 2.2.1.14.
If
This implies that
so we obtain
Proposition 2.2.1.15.
For an ordinary ring
is an isomorphism for
Proof.
The fiber of the map
is the geometric realization of a simplicial diagram of the form
The last term is
If we consider the ordinary ring
with generator
Theorem 2.2.1.16 (Bökstedt).
There is an isomorphism
In particular, we have no divided power structure. In addition, the map
is zero in degree
2.2.2 Bökstedt periodicity
We will now study the spectrum
Theorem 2.2.2.1 (Bökstedt).
As an
Note that
by a chain of adjunctions.
We should first prove that the two versions of Bökstedt’s theorem are equivalent. If we consider the element
This map is an equivalence if and only if it is an equivalence on homotopy groups. Finally, note that the homotopy groups of the source are simply
where
Using the Serre spectral sequence, this is
Exercise 2.2.2.2.
Prove that
Lemma 2.2.2.3.
We have an equivalence
Sketch of proof.
Write
Therefore, we have
This construction identifies the rightmost and leftmost copies of
We would like to apply this description to
This is quite difficult (because the homotopy groups of spheres are extremely difficult), but it does have an interpretation as the homology groups of the Eilenberg-Maclane spectrum
Theorem 2.2.2.4 (Milnor).
As an algebra, we have
This is a very large description of the homotopy groups. Fortunately, there is a direct description of the spectrum
Lemma 2.2.2.5.
As an
Proof of Theorem 2.2.1.16.
Write
The three terms in the tensor products come from the spaces
Because we formed the bar construction with an
Remark 2.2.2.6.
The description of
is an equivalence. We simply apply this to the map
which is given by specifying an element of
Exercise 2.2.2.7.
- 1.
Let
be a connectedA -algebra. Prove that a mapH 𝔽 p of connectiveN → M -modules is an equivalence ifA H 𝔽 p ⊗ A N → H 𝔽 p ⊗ A M is.
- 2.
Let
be a map of connectedA → B -algebras with an equivalenceH 𝔽 p H 𝔽 p ⊗ A H 𝔽 p → H 𝔽 p ⊗ B H 𝔽 p . Prove that
and thatH 𝔽 p ⊗ A B ≃ H 𝔽 p is an equivalence.A → B
If
for any
In addition, we have
whenever
These should be viewed as coming from the homology of configuration spaces. On
Theorem 2.2.2.8 (Dyer-Lashof, Araki-Kudo).
We have
Note that this is very similar to Milnor’s result. All of the elements given by Dyer-Lashof have the same degrees as Milnor’s elements, so we might try to compare them.
Theorem 2.2.2.9 (Steinberger).
On
and
Now it remains to try to construct a map realizing our desired isomorphism on homotopy groups.
Proof of Lemma 2.2.2.5.
We have a map
The target is simply
of
Exercise 2.2.2.10.
Prove that
2.2.3 Properties of 𝖳𝖧𝖧
We will now consider formal properties of topological Hochschild homology. These include base change results, universality, and more.
Proposition 2.2.3.1.
The functor
More generally, the functor
is symmetric monoidal.
Proof.
Consider the forgetful functor
Corollary 2.2.3.2.
If
Proof.
Recall that
Applying
In particular, if
Proposition 2.2.3.3.
For
where we are considering the constant diagram on
Exercise 2.2.3.4.
Prove this.
Warning 2.2.3.5.
This colimit is different from the colimit in the category of all spectra, which is given by
We will now prove a base change formula for
Proposition 2.2.3.6.
For any lax symmetric monoidal functor
If
Proof.
We need to compare the cyclic bar constructions
and
The latter receives a map from
and this receives a map from the first colimit. The second part follows from the additional assumptions on
Example 2.2.3.7.
Consider the Eilenberg-Maclane functor
for any
Example 2.2.3.8.
If
This is symmetric monoidal and preserves all colimits, so we have
We will now prove a more general version of Bökstedt periodicity. First, recall that an
By definition, we have a map
inducing a map
On homotopy groups, this gives us a map
Theorem 2.2.3.9 (Bökstedt periodicity for perfect rings).
For any perfect
is an isomorphism of commutative rings. Equivalently,
Proof.
For every perfect ring
This should be thought of as a lift of
Therefore, it suffices to prove that
for all
We will conclude with one more base change formula for
along the projection
Remark 2.2.3.10.
This retract
Theorem 2.2.3.11.
If
Sketch of proof.
We can rewrite
2.2.4 The circle action on 𝖳𝖧𝖧
We will now consider the origin of the Connes operator on Hochschild homology from an actual action of
Recall that a group action on an object of a
where
Definition 2.2.4.1.
A group action of a group
Note that
Example 2.2.4.2.
Note that
Definition 2.2.4.3.
For any grouplike
Definition 2.2.4.4.
Define the homotopy orbits of an object
Similarly, define the homotopy fixed-points by the limit
In the category of spaces, if
Exercise 2.2.4.5.
Prove this.
The homotopy orbits should be thought of as a derived version of a quotient construction. For example, if the action of
Proposition 2.2.4.6.
Objects in
Sketch of proof.
We use the fact that
We now need to compare
These maps are isomorphisms on homology in degrees
Remark 2.2.4.7.
This equivalence is not compatible with monoidal structures on both sides. It does not give the correct answer
Theorem 2.2.4.8.
On
which agrees with the
Definition 2.2.4.9.
The paracyclic category
There is an
acting trivially on objects and by the map
given by translation.
Definition 2.2.4.10.
The cyclic category
Lemma 2.2.4.11.
We have
This follows from the fact that the
Lemma 2.2.4.12.
We have an equivalence
Proof.
We compute mapping spaces. We need to prove that
If we recall that mapping spaces were the maximal Kan complexes in functor categories, we can apply exponential laws. Therefore, it suffices to show that
which is just the definition of the colimit. □
Definition 2.2.4.13.
A cyclic object in
It is natural to wonder what the geometric realization of a cyclic object is.
Lemma 2.2.4.14.
The diagram
commutes. More precisely, the functor
Lemma 2.2.4.15.
For a cyclic object
admits an
Proof.
Recall that
Taking the colimit, we obtain a functor
Exercise 2.2.4.16.
For an
Proof of Theorem 2.2.4.8.
We now show that the cyclic bar complex is a cyclic object. Let
be the functor which sends a totally-ordered set
such that each
Restricting to
Exercise 2.2.4.17.
Prove that
2.2.5 𝖳𝖧𝖧 of the integers
In this slight digression, we will compute the topological Hochschild homology of the integers.
Theorem 2.2.5.1 (Bökstedt).
We have an isomorphism
In fact,
where
Note that we can compute the differentials as
Remark 2.2.5.2.
In fact, as an
As a consequence of this, we see that
is isomorphic on homotopy groups to the homology groups of the dg-algebra given by
Exercise 2.2.5.3.
Compute the homology of the dg-algebra
Definition 2.2.5.4.
For a ring spectrum
By definition, we can use the Hasse square
to recover
Lemma 2.2.5.5.
We have an equivalence
Moreover, we have
Proof.
First, we note that
The second statement follows for a similar reason. We calculate
As an example, we see that
Theorem 2.2.5.6.
We have
This is the homology of the the dg-algebra
Proof of Theorem 2.2.5.1 assuming Theorem 2.2.5.6.
Using Theorem 2.2.5.6, we get that
It is easy to see now that
whenever
Definition 2.2.5.7.
We define an
To give a discrete commutative ring
Warning 2.2.5.8.
If we consider a commutative ring spectrum
Theorem 2.2.5.9 (Relative Bökstedt periodicity).
We have
This has appeared in the work of Lurie, Bhatt-Morrow-Scholze, Antieau-Mathew-Nikolaus, and Krause-Nikolaus.
Proof.
We first note that
Now we study the long exact sequence
and deduce that the homotopy groups
which is an isomorphism after mod-
Exercise 2.2.5.10.
Prove that
Recall that by the base change formula, we have
We can now consider the HKR filtration on
Proposition 2.2.5.11.
There is a convergent, multiplicative spectral sequence
Note that by definition, we have an equivalence
In addition, there is a similar spectral sequence in the
Proof of Theorem 2.2.5.6.
The spectral sequence takes the form
Using homological Serre grading, the only differentials are
By the Leibniz rule, it is determined by
We see that
so
2.2.6 Negative topological cyclic homology
Definition 2.2.6.1.
We define negative topological cyclic homology as homotopy fixed points with respect to the
Recall that an
Lemma 2.2.6.2.
If
whoch is exact in both arguments.
In particular, objects in stable
Sketch of proof.
In
and therefore we have
which defines a spectrum. □
The proof of the following lemma is left as an exercise to the reader.
Lemma 2.2.6.3.
If
- 1.
The functor category
is stable;𝖥𝗎𝗇 ( I , 𝖲𝗉 ) - 2.
For any such functor, we have
lim I F ≃ 𝗆𝖺𝗉 𝖥𝗎𝗇 ( I , 𝖲𝗉 ) ( 𝕊 , F ) .
We will now compare
Proposition 2.2.6.4.
We have
Proof.
We will identify
Unfortunately, the formality result we used does not behave well with respect to monoidal structures.
Lemma 2.2.6.5.
The functor
If we want to do calculations, it would be helpful to understand how to compute with homotopy fixed points.
Lemma 2.2.6.6.
Let
with
Proof.
The full subcategory of spectra on all Eilenberg-Maclane spectra (in degree
where we put the discrete topology on
This has homotopy groups given by
Exercise 2.2.6.7.
For a spectrum
For a general spectrum, we can decompose it into its Postnikov tower. Unfortunately, we lose track of extension problems, but there is at least a spectral sequence.
Theorem 2.2.6.8 (Homotopy fixed points spectral sequence).
There is a multiplicative, conditionally convergent spectral sequence
Using negative Serre grading, this spectral sequence lives completely in the second quadrant and looks like the below.
Sketch of proof.
We consider the Whitehead tower
Applying homotopy fixed points, we obtain a sequence
which is not the same as taking the Whitehead tower of the homotopy fixed points. The homotopy cofibers are simply Eilenberg-Maclane spectra, so after taking homotopy fixed points they become of the form
An
splits, so we have a decomposition
Restricting the action to the second summand, we obtain a map
or in other words a map
Lemma 2.2.6.9.
In the homotopy fixed points spectral sequence, the differential
for any
Our goal is now to calculate
and therefore the spectral sequence degenerates at the
Now choose lifts
In order to compute
which is an isomorphism on
The spectral sequence for
Theorem 2.2.6.10.
This map is an isomorphism.
Corollary 2.2.6.11.
We have
and is generated by
2.2.7 Topological periodic homology
We will now define a topological version of periodic homology. As a warning, this is not defined by inverting something and may not even be periodic.
Definition 2.2.7.1.
Define the topological periodic homology of a ring spectrum
Because taking Tate fixed points is lax symmetric monoidal in a way that is compatible with taking homotopy fixed points, we see that
Proposition 2.2.7.2.
For a spectrum
Proof sketch.
Consider the Whitehead filtration
If we want to use this to calculate anything, we need to understand Tate fixed points of Eilenberg-Maclane spectra with respect to
For the spectrum
Because the first term has only nonnegative homotopy groups and the second has only nonpositive homotopy groups, we can read off the homotopy groups of the Tate fixed points. In particular, we obtain
Lemma 2.2.7.3.
We have the ring structure
Proof.
Consider the Tate spectral sequence for
The spectral sequence takes the form
and so the only way for the spectral sequence to yield zero is for all maps
Fix generators
where the sign depends on our previous choices. This implies that
Therefore, up to a sign, we have
Exercise 2.2.7.4.
Using a similar approach to the one given here, compute
Remark 2.2.7.5.
If we run the same argument with
When
Proposition 2.2.7.6.
If
In a weaker form, on homotopy groups we have
Sketch of proof.
We have an expression
as
This clearly works when
Exercise 2.2.7.7.
Prove that
as
Given that we are calling
Proposition 2.2.7.8.
We have
Proof.
Because
We will now return to topological periodic homology.
Proposition 2.2.7.9.
The Tate spectral sequence for Tate fixed points of
Applying this to topological Hochschild homology gives us a spectral sequence
We are now ready to apply it to compute
Theorem 2.2.7.10.
We have
Proof.
Note that the Tate spectral sequence is simply a periodized of the homotopy fixed points spectral sequence, at least on the
and therefore we have just periodized all of the extension problems. Using the map from
We will also choose a lift
so it must be a unit. But then
Warning 2.2.7.11.
If the Tate spectral sequence has differentials, then topological periodic homology may not be periodic. There are even examples with infinitely many differentials where
2.2.8 The cyclotomic structure
There is an additional structure on topological Hochschild homology which does now exist on ordinary Hochschild homology. This is a map
Construction 2.2.8.1.
Assume we have a fiber sequence
of pointed connected spaces. Because these are bar constructions of group objects, we write it as
Then there is a functor
which sends
Exercise 2.2.8.2.
For a normal subgroup
As a consequence, for any
With some additional work, this implies that the functors
induce functors
In particular, this means that for any normal subgroup
Example 2.2.8.3.
Let
Definition 2.2.8.4.
A cyclotomic structure on a spectrum
which are
The main fact about cyclotomic spectra that we will discuss is the following.
Theorem 2.2.8.5.
For every ring spectrum
Remark 2.2.8.6.
The cyclotomic structure on
on spectra. It does not exist for
Therefore,
We will now construct the cyclotomic structure. We will first give a construction in the case of an
for any group
Proposition 2.2.8.7.
This functor has a left adjoint given by
with the
Proof.
Note that
Example 2.2.8.8.
Suppose that
is the “free” object.
Example 2.2.8.9.
If
Example 2.2.8.10.
This is the important example for the construction we want to perform. Let
Proposition 2.2.8.11.
For
exhibits
Proof.
By our general formula, the free object is given by
As discussed previously, this colimit is
Construction 2.2.8.12.
For every
Taking Tate fixed points, we obtain a map
Also recall that the Tate diagonal is a map
of
Exercise 2.2.8.13.
Check that the map
Using the universal property of
Proposition 2.2.8.14.
There is a unique
of
We will now move on to the case when
where
where
and the cyclotomic structure on
Exercise 2.2.8.15.
For an ordinary ring
As a result, we obtain a map
2.2.9 The definition of 𝖳𝖢
We are finally ready to define topological cyclic homology. In fact, we will give two equivalent definitions, one of which is useful for theoretical purposes and one of which is useful for calcuations.
Definition 2.2.9.1.
The
In particular, a map
- 1.
A
-equivariant map𝕋 ;f : X → Y - 2.
A
-equivariant homotopy filling the square𝕋 for every prime
.p
In the
In fact, more is true. We will leave the following proposition as an exercise.
Proposition 2.2.9.2.
The
Moreover,
In this monoidal structure, a commutative algebra in
- 1.
A commutative ring spectrum
withX ∈ 𝖢𝖠𝗅𝗀 ( 𝖲𝗉 ) B 𝕋 -action;𝕋 - 2.
A
-equivariant map of commutative algebras𝕋 φ p : X → X t C p for all primes
.p
In particular, if
Now recall that negative topological cyclic homology was defined by
We will now give a similar description for
Example 2.2.9.3.
The sphere spectrum
- •
The underlying spectrum with
-action is𝕋 with the trivial action;𝕊 - •
For any prime
, the mapp φ p : 𝕊 → 𝕊 t C p is the unit
𝕊 → 𝕊 h C p → 𝕊 t C p .
Exercise 2.2.9.4.
Lift the diagram
to a diagram of
Definition 2.2.9.5.
For a ring spectrum
If
More generally, for any cyclotomic spectrum
This means that
We will now explicitly evaluate this formula. We compute
where
Theorem 2.2.9.6.
Assume that
exhibits the right hand side as the
As a result, if
We can assemble all of the
Corollary 2.2.9.7.
If
In particular, we have
if
We will briefly discuss the non-affine situation. If
Therefore, we have
and
Finally, we define
Remark 2.2.9.8.
One can show that for an
Proof of Theorem 2.2.9.6.
Note that both
We now need to prove that
We need to compare the homotopy groups
with the homotopy groups
Recall that when
In addition, we have
We will now use the homotopy fixed points spectral sequence to compute
The spectral sequence for
It is given by
We see that
There is a map of spectral sequences from the homotopy fixed points spectral sequence to the Tate spectral sequence, so we can import differentials. Therefore, we see that
2.2.10 𝖳𝖢 of 𝔽 p
Continuing our running example, we will now compute
for generators
is equal to its profinite completion. Then the canonical map
is given by
Lemma 2.2.10.1.
There exists a unit
Remark 2.2.10.2.
A more careful argument shows in fact that
Proof.
We have the commutative diagram
We will now chase the element
Chasing
and therefore that
Our goal now is to prove that
This is the sequence
Up to a unit, all of the maps in degree not equal to zero are of the form
Exercise 2.2.10.3.
Prove that the map
Theorem 2.2.10.4.
We have
Remark 2.2.10.5.
As a ring, we must have
Remark 2.2.10.6.
Quillen proved that the
In particular,
We will now turn to the consequences of the computation of
Corollary 2.2.10.7.
- •
There is an
-map𝔼 ∞ ;H ℤ → 𝖳𝖢 ( 𝔽 p ) - •
For any
-algebra𝔽 p ,A is an𝖳𝖢 ( A ) -module spectrum.H ℤ
Proof.
The first claim follows from the fact that the connective cover is a map
The following proposition is left as an exercise.
Proposition 2.2.10.8.
We have an adjunction
where
Corollary 2.2.10.9.
We have a map of
In the relative case, we have that for any
Warning 2.2.10.10.
The map
is different from the obvious map
as maps of spectra. In fact, the second map cannot be made into a map of cyclotomic spectra.
To see this, we will show that postcomposing the two maps with
are different, or in other worse that
For the map
Therefore,
For the map
Therefore, the map
Theorem 2.2.10.11.
The maps
Corollary 2.2.10.12.
We have
We will restate the theorem about being an
Definition 2.2.10.13.
We define the
The following characterization of
Proposition 2.2.10.14.
We have an equivalence
Corollary 2.2.10.15.
For an
Warning 2.2.10.16.
(Ordinary) Hochschild homology (of an ordinary ring) cannot be made into a cyclotomic chain complex.
2.2.11 𝖳𝖢 of perfect rings
Our goal is now to generalize the computation of
Recall that there is a commutative ring
Theorem 2.2.11.1.
Let
is a bijection.
Proof.
If
as an animated ring. Therefore, as in the first step we can reduce to
The following corollary is left as an exercise.
Corollary 2.2.11.2.
We have an equivalence of categories
Corollary 2.2.11.3.
There is a ring isomorphism
called the Witt vector Frobenius such that
is the Frobenius.
Proposition 2.2.11.4.
For a perfect
Remark 2.2.11.5.
Note that
Proof.
Consider the homotopy fixed points spectral sequence for
where all dots are given by
However,
The rest follows because the spectral sequences are functorial. Periodizing the spectral sequences, we obtain the result for
We will now need to understand the maps
We know that
Remark 2.2.11.6.
For any connective ring spectrum, the map
Proposition 2.2.11.7.
The map
Proof.
Consider the diagram
On
Our goal is to understand the composite of the bottom row of arrows. We know that the composite
is the
Exercise 2.2.11.8.
Prove that for a commutative ring
Now we calculate
The map
- •
In degree
for2 n , it is the mapn ≥ 0 W ( k ) ⋅ x n → W ( k ) ⋅ t − n α x n ↦ ( α p n − F ( α ) ) t − n ; - •
In degree
, it is the map− 2 n W ( k ) ⋅ t n → W ( k ) ⋅ t n α t n ↦ ( α − F ( α ) p n ) t n . - •
In degree
, it is simply0 .id − F
Note that these maps are isomorphisms whenever
Theorem 2.2.11.9.
For a perfect
This formula can be evaluated in various examples using several facts:
- •
There is an isomorphism
.W ( k ) F ≅ W ( k φ ) Corollary 2.2.11.10.
If
is a field, thenk .𝖳𝖢 0 ( k ) = ℤ p Proof.
Clearly we have
. □k φ = 𝔽 p - •
We have
for a profinite spacek φ = C 0 ( X , 𝔽 p ) . This is a version of Stone duality. In fact,X is the underlying topological space ofX . Equivalently, it is the space of connected components ofSpec k φ .Spec k - •
We have
W ( k φ ) = W ( C 0 ( X , 𝔽 p ) ) = C 0 ( X , ℤ p ) ≅ C 0 ( Spec k φ , ℤ p ) ≅ C 0 ( Spec k , ℤ p ) . Exercise 2.2.11.11.
Prove the third fact from the second.
Corollary 2.2.11.12.
For a perfect
-algebra, we obtain𝔽 p 𝖳𝖢 0 ( k ) = C 0 ( Spec k , ℤ p ) = C 0 ( Spec k φ , ℤ p ) . - •
The degree
part− 1 is𝖳𝖢 − 1 ( k ) = W ( k ) F -torsion free and its mod-p reduction isp . Thusk φ is𝖳𝖢 − 1 ( k ) -completely free of rank the dimension ofp , or in other wordsk φ 𝖳𝖢 − 1 ( k ) = ( ⨁ S ℤ p ) p ∧ where
.k φ = ⨁ S 𝔽 p Corollary 2.2.11.13.
If
, for example ifk φ = 0 is an algebraically closed field, thenk .𝖳𝖢 − 1 ( k ) = 0 As an example, we see that
𝖳𝖢 ∗ ( 𝔽 ¯ p ) = H ℤ p . - •
Suppose that
is a finite product of copies ofk φ = 𝔽 p × ⋯ × 𝔽 p . Then𝔽 p is ak φ -module and can be described ask φ k φ = V 1 × ⋯ × V i for some
-vector spaces𝔽 p . This implies thatV 1 , … , V i W ( k ) F = V ~ 1 × ⋯ × V ~ i as a
-module, whereW ( k ) F = ℤ p × ⋯ × ℤ p is aV ~ k -complete,p -torsion free lift ofp toV i .ℤ p
2.2.12 Frobenius lifts and group rings
We will now study cyclotomic spectra with Frobenius lifts, i.e. spectra where the Frobenius factors through homotopy fixed points. Some examples are
Definition 2.2.12.1.
A
of the Frobenius.
Example 2.2.12.2.
By definition, the cyclotomic spectrum
This can be viewed as the map
If
In particular, the map
We may now try to use this formula to study
Theorem 2.2.12.3.
In our setting, where
Proof sketch.
Recall that
so the square on the left is a pullback. The proof that the bottom square is a pullback is omitted. □
Corollary 2.2.12.4.
We have the formula
Exercise 2.2.12.5.
Prove this.
The spectrum
We will now turn to the case of spherical group rings. Let
In order to understand
Lemma 2.2.12.6.
We have the formula
where
Proof.
Because
We now compare
This implies that
where the boundary maps are projections. This is contractible. Now we have
Exercise 2.2.12.7.
Prove that for a space
has contractible realization.
Proposition 2.2.12.8.
- 1.
The
-action on𝕋 comes from the𝖳𝖧𝖧 ( 𝕊 [ G ] ) = Σ + ∞ L B G -action on𝕋 given by rotating loops.L B G - 2.
The Frobenius morphism
admits a liftΣ + ∞ L B G → Σ + ∞ L B G t C p coming from theΣ + ∞ L B G → Σ + ∞ L B G h C p -invariant mapC p defined by precomposition with the degreeL B G → L B G endomorphism ofp .S 1
The proof of this uses the fact that the Tate diagonal
Proposition 2.2.12.9.
For an
fits into a square
which is a pullback after
Proof.
It suffices to
is an equivalence on
To prove this, we will consider fiber sequences in spaces. More precisely, consider the sequence
of fiber sequences. In the colimit, we obtain the fiber sequence1
Now the homology
This map is not necessarily zero, but it is degreewise nilpotent. □
Exercise 2.2.12.10.
Let
is degreewise nilpotent.
Using all of our results, we have proved the following.
Corollary 2.2.12.11.
For an
In particular, we have the formula
A Simplicial rings and cotangent complexes
A.1 Simplicial rings and divided power structures
Definition A.1.0.1.
The category
More precisely, this is a diagram
satisfying the usual conditions for face and degeneracy maps.
Theorem A.1.0.2 (Eilenberg-Zilber).
The functor
sending a simplicial abelian group to the associated chain complex is lax symmetric monoidal with respect to the pointwise tensor product on simplicial abelian groups and the usual tensor product on chain complexes.
This implies that every simplicial commutative ring produces a commutative dg algebra. We will now make this product structure explicit.
Definition A.1.0.3.
An
satisfying the following conditions:
- •
Both
andμ are surjective and order preserving;ν - •
The maps
andμ jump at disjoint positions. For example, consider the case whenν , as in Figure A.1.m = n − 2 Figure A.1: A shuffle. Red lines denote where( 2 , 2 ) jumps and blue lines denote whereμ jumps.ν We can see that an
-shuffle is simply a way to shuffle( m , n ) red andm blue cards together. There is a unique permutation which takes the configuration having all red cards on top to our given shuffle.n
Proposition A.1.0.4.
Let
where
Proof.
We will not go through all of the combinatorics explicitly.
- •
To prove associativity, we can express both
and( x y ) z as a sumx ( y z ) ∑ ( λ , μ , ν ) sign ( λ , μ , ν ) s λ ( x ) s μ ( y ) s ν ( z ) . - •
To check commutativity, the fact that
was a simplicial commutative ring means we can exchange the roles ofR andμ up toν sign ( μ , ν ) sign ( ν , μ ) = ( − 1 ) m n , which is exactly what we desire.
- •
A variant of this argument also gives strictness. When we compute
, the summands corresponding tox 2 and( μ , ν ) appear with opposite signs, so we see that( ν , μ ) .x 2 = 0 - •
The differential is given by the alternating sum of the face maps. Applying this to
will decompose the result intox ⋅ y -shuffles and( m − 1 , n ) -shuffles, which yields the desired result. □( m , n − 1 )
We will now discuss divided power structures. In fact, every simplicial commutative ring will give us one of these.
Proposition A.1.0.5.
Let
- •
We have
for allγ 1 ( x ) = x ;x ∈ R - •
We also have
γ k ( x ) γ ℓ ( x ) = ( k + ℓ ℓ ) γ k + ℓ ( x ) for all
. This means that we should think thatk , ℓ ;x k = k ! γ k ( x ) - •
For all
, we havex , y ∈ R n γ k ( x + y ) = ∑ i + k = k γ i ( x ) γ j ( y ) ; - •
Similarly, we have
γ k ( x y ) = x k γ k ( y ) ; - •
We have the identity
γ k ( γ ℓ ( x ) ) = ( k ℓ ) ! k ! ( ℓ ! ) k γ k ℓ ( x ) .
Proof.
If
We can permute the factors
We will omit checking that the properties are satisfied. □
We now need to make sure that this divided power structure behaves well with respect to the chain differential.
Proposition A.1.0.6.
Let
- •
If
is even, thenx ;d γ k ( x ) = γ k − 1 ( x ) ⋅ d x - •
The maps
preserve boundaries;γ k - •
The
give a well-defined divided power structure onγ k .H ∗ ( R )
Proof.
Suppose that
Here, for maps
A.2 Cotangent complexes and obstruction theory
A.2.1 Definition of the cotangent complex
Recall that we defined
as the nonabelian derived functor of
Lemma A.2.1.1.
The following constructions agree:
- 1.
The functor
L Ω − / k 1 : 𝖠𝗇𝗂 ( k − 𝖺𝗅𝗀 ) → 𝒟 ( ℤ ) ≥ 0 evaluated on
;R - 2.
The functor
L ( A ↦ R ⊗ A Ω A / k 1 ) : 𝖠𝗇𝗂 ( k − 𝖺𝗅𝗀 / R ) → 𝒟 ( R ) ≥ 0 evaluated on
.R
Proof.
If we begin with the second construction, we obtain
with
The second functor has better categorical properties than the first. Namely, it commutes with coproducts. By definition, this implies that it preserves all colimits.
Example A.2.1.2.
If
is a pushout in
where the top arrow is the Jacobian matrix of
Definition A.2.1.3.
We will call
A.2.2 Applications to obstruction theory of rings
Let
- •
If
, we havem 1 , m 2 ∈ M ;m 1 m 2 = 0 - •
Elements of
multiply as usual;s - •
If
ands ∈ S , thenm ∈ M is given by the usual action ofs m ons .M
We would like to understand when there is a lift in the diagram
These lifts correspond to
Proposition A.2.2.1.
There exists a functor
which sends a projective module
We would now like to apply this to study ordinary rings. Given a surjective
which does not even split as a morphism of abelian groups. Note that the condition that
It turns out that
There is a tautological morphism
of
of animated
Proposition A.2.2.2.
in the category of animated
We see that (not necessarily split) square-zero extensions
Maps
which are simply lifts
If we unwrap everything, we see that a lift exists if and only if the map
is nullhomotopic. Furthermore, lifts are in correspondence to choices of nullhomotopies. These form a torsor over
- •
The possible square-zero extensions
are classified byR ~ π 0 𝖬𝖺𝗉 𝒟 ( R ) ( L R / k , I [ 1 ] ) ; - •
For a given
andR ~ , there is an obstruction living inS → R π 0 𝖬𝖺𝗉 𝒟 ( S ) ( L S / k , I [ 1 ] ) . - •
If lifts do exist, they are parameterized by
π 1 𝖬𝖺𝗉 𝒟 ( S ) ( L S / k , I [ 1 ] ) ≃ π 0 𝖬𝖺𝗉 𝒟 ( S ) ( L S / k , I ) .
Exercise A.2.2.3.
Let
- 1.
For every square-zero extension
and everyR ~ → R , there is a lift (this is usually called being formally smooth).S → R - 2.
We have
andH 1 ( L S / k ) = 0 is a projectiveH 0 ( L S / k ) -module.S
We are now ready to apply this machinery.
Theorem A.2.2.4.
If
In particular, we have
so we have a tower
whose lift
is the unique flat,
This theorem tells us that there is a way to escape from the positive characteristic to the mixed characteristic setting under the assumption that
We will characterize
with
These extensions are classified by
They also need to be compatible with the element of
classifying
Lemma A.2.2.5.
Isomorphism classes of such
Lemma A.2.2.6.
If
Proof.
For any perfect
Putting together the two lemmas, we see that there is a unique isomorphism class of possible
Definition A.2.2.7.
The
Remark A.2.2.8.
Usually the Witt vectors are given by an explicit construction and exist for any
Example A.2.2.9.
Consider the finite field
One way to construct this is to consider
for some lift