2024-10-03

Why might be better than

Assume is an abelian category.

Q: If is a short exact sequence, does this induce a triangle ?

Recall that to put an object in into (and ), we just put it in degree . Let us consider the map

We have:

  • is only non-zero in degree .
  • is only non-zero in degree .

So is automatically the map. A bit strange, but is this a big problem?

What is the cone of ? It is a complex

So for to be a triangle, we need . Is it? Is there a map between the complexes below?

¢¢¢0XY0¢¢¢¢¢¢00Z0¢¢¢falways?

There is always a map down, but not necessarily back up. The existence of the backwards map is related to the existence of splittings of the short exact sequence

For example,

has no map back. But it turns out the canonical downwards map is always a quasi-isomorphism:

¢¢¢0XY0¢¢¢¢¢¢00Z0¢¢¢fquasi-isomorphism!always?

If we invert it in , then the answer to whether is yes.

Last time: Localising system of morphisms

Let be a category, and a “subset”, to be the things we can invert.

Construction of

  • Objects: .
  • Morphisms: more interesting, defined below.

Morphisms of

An element of is a diagram:

ZXYsf

with , thought of as “”, up to an equivalence relation: two of the above diagrams are said to be equivalent if there is a commutative diagram

ZXZ00YZ0sfs00s0f0

where . The purple maps in practice often also lie in , but are not forced to by the axioms (sometimes morphisms satisfy a -out-of- property, so when we have a commutative triangle and two of the maps are in then the third is as well).

Without the equivalence relation, the could potentially be very large, since there could be a very large number of possible .

Example: quasi-isomorphisms

If and , then we indeed have this -out-of- property. If we have a commutative diagram

ZXZ00sgs00

and , then since taking cohomology is a functor, we have . Now, we note that if is an isomorphism and is an isomorphism then is an isomorphism. Therefore and being quasi-isomorphisms implies that is a quasi-isomorphisms.

Note that if we force and to both be isomorphisms in our category, then we are forcing to be an isomorphism too.

Composition of morphisms

We have two morphisms

ABXYZst

with . By the axiom of the localising system, we can complete the middle maps into a square

CABXYZust

where . Now, the composite is just the composition of the blue maps above

CXZ:s±u

One should check that this is well-defined. Exercise #TODO.

Revisiting the example

There are two ways to describe :

  1. Quasi-isomorphisms, i.e., isomorphisms on .
  2. Morphisms whose cones are acyclic: a complex is acyclic if for all .

If we have a quasi-isomorphism and we take its cone

Hn(X)Hn(Y)Hn(M(f))Hn+1(X)¢¢¢

Having the blue column be is the same as having the green maps be isomorphisms. This gives us a way to talk about localisation in terms of objects instead of in terms of families of morphisms.

Definition (Null system)

Let be a triangulated category. A null system is such that

  1. .
  2. if and only if
  3. If is a distinguished triangle and then (-out-of-, noting that we can rotate distinguished triangles).

Example

Acyclic complexes in for abelian. (We need abelian to take cohomology.)

Going between null systems and localising systems

If is a null system, then we can define

Proposition

is a localising system of morphisms.

Notation

Sometimes people use the notation for . Alternative point of view: we are making some objects (the ones in ) zero instead of trying to invert some maps.

Proof

is a triangle.

2. Composition:

This follows from the octahedral axiom:

Y0Z0X0XZYÃ+1'+1g±ffg+1+1

Since then . The condition that is null implies that . This implies that .

Given , we need to complete the square

?ZXYtsf

so that also. We have the solid diagram

?ZXYX02NZ[1]¢s0sf

where is a triangle. Now, by (TR2), there exists a such that is also a triangle:

WZXYX0X02NW[1]Z[1]¢¢tsfu±ff

Since , then . By (TR4),

WZXYX0X02NW[1]Z[1]¢¢s0sfu±ff

there exist the red horizontal maps which commute with the rest of the diagram.

The dual version is similar.

We are required to prove: if then the following are equivalent:

  • There exists , such that .
  • There exists , such that .

Consider the diagram

XZ2NXY0Y0X[1]Z[1]¢idXft2S

where we can factorise through by assumption. This lets us fill in the map at the top (by (TR4)) and create a triangle (by (TR3))

X0X2NZX0[1]¢XY0Y0X[1]Z[1]¢s2SidXft2S

We have because . Last time, we checked that the composition of two consecutive maps in a triangle is .

X0X2NZX0[1]¢XY0Y0X[1]Z[1]¢s2SidXft2S0f±s

So the top composition through is , and therefore the bottom composition .

Definition (Derived category)

Let be an abelian category. The derived category is either:

  1. , where , or
  2. , where is the collection of acyclic objects.

These are the same thing. There are also bounded above/below versions: , , . One might also want to impose additional restrictions on what cohomology groups are allowed.

Theorem 1

Let be an abelian category with enough injectives (i.e., every object can be embedded into an injective one). If is a bounded below complex of injectives, then

There is of course a dual statement for projectives.

Earlier, we noted that might be very large, and so we tried to control this by modding out by an equivalence relation. Here, this is a way to see that the size is controlled in some sense via injectives/projectives in .

Theorem 2

Let be an abelian category with enough injectives (i.e., every object can be embedded into an injective one). Then

(equivalence of triangulated categories) where is the additive category of injectives.

There is an obvious way to define a functor . To check that the functor is essentially surjective, one constructs injective resolutions.

Additional remark

A bounded below complex of injectives which is acyclic is then in the homotopy category (you can split everything).