2024-10-10
Last time
We showed that
This allows us to define derived functors. For example, if
Similarly, if
The procedure
For
and we can replace
Applying
Finally, the cohomology
So the derived functor packages together all the information of the “old” derived functors
we had previously into some “total” derived functor, which also has a little bit more information about the maps in the complex.
Similarly with
Proposition
Proof
Let
be a triangle in
a complex of injectives. Now applying
We compute this termwise (since these are all complexes of injectives).
Claim:
Therefore we have a triangle
The analogue of: an exact functor induces a long exact sequence in cohomology.
Remark about the definition
To compute
Reference: Weibel 10.5.9
In general,
Truncations
If
is a complex, then the truncation is
Correspondingly there is also the other truncation
There are canonical maps:
, and , and
Looking at these more closely, we have a short exact sequence of chain complexes
The bottom row
Using truncations, we can “build up” objects from iterations of complexes concentrated in degree
“
is an extension of the ”
Building
and eventually
Compare this with Jordan-Hölder series: if
such that
Example
If
if
So rather than defining
Compositions
Consider
Assume that we have enough injectives and
Let
- We compute
termwise. - Alternatively, we compute
:If we can apply and have it be computing , then .
A sufficient condition for this is if
Derived adjunctions
Let
Because
Because
is exact, we don’t need to derive . Moreover, everything is acyclic for and we can apply termwise.
Claim
Proof
Suppose that
To see
We can certainly convert the top vertical maps to the bottom vertical maps by the adjunction. The question is whether we get chain complexes back. One can check this: this is due to the adjunction being functorial.
One uses the diagonal maps from adjunction to check this. One can also check that homotopy is preserved as well.