Thanks to all who responded to the bleg yesterday. I’m still haven’t completely decided on the topic owing to lack of time (I actually wrote this post last weekend), but the suggestions are interesting. My current plan is, following Omar’s comment, to look at *Proofs from the Book *tomorrow and pick something combinatorial or discrete-ish, like the marriage problem or Arrow’s theorem. I think this will be in the appropriate spirit and will make for a good one-hour talk.

**4. and depth **

One of the first really nontrivial facts we need to prove is that the lengths of maximal -sequences are all the same. This is a highly useful fact, and we shall constantly use it in arguments (we already have, actually). More precisely, let be an ideal, and a finitely generated module. Assume is noetherian.

Theorem 12Suppose is a f.g. -module and . All maximal -sequences in have the same length. This length is the smallest value of such that .

I don’t really have time to define the functors in any detail here beyond the fact that they are the derived functors of . So for instance, if is projective, and if is injective. These functors can be defined in any abelian category, and measure the “extensions” in a certain technical sense (irrelevant for the present discussion).

So the goal is to prove this theorem. In the first case, let us suppose , that is there is a nontrivial . The image of this must be annihilated by . Thus no element in can act as a zerodivisor on . So when , there are no -sequences (except the “empty” one of length zero).

Conversely, if all -sequences are of length zero, then no element of can act as a nonzerodivisor on . It follows that each is contained in an associated prime of , and hence by the prime avoidance lemma, that itself is contained in an associated prime of . This prime avoidance argument will crop up quite frequently.