I knew my posting would be sparser this quarter, but this was a pretty large gap. I sort of lost motivation for posting, since my class moved on from spectral sequences to group cohomology, so I wasn’t constantly reminded about things to post about. Now the class is coming back around to spectral sequences in order to compute the group cohomology, so I’m sort of in the mood again.

We’ve mostly been looking at how to get a spectral sequence out of a filtered complex, and last time I promised I’d talk about convergence. Since my posting is so sparse, and I only wanted to give an idea about it rather than a proof of all the details of the convergence, I’m going to keep it brief in order to post about something more important.

The theorem is that if we have a filtration of a complex and the following three conditions are satisfied

1. when

2. when

3.

then if , then . Where we define where .

Basically what this says is that under some “mild" conditions that were naturally satisfied in our examples, the spectral sequence converges. And not only does it converge, but it converges to an associated graded object of the homology of the original complex.

The fact that it converges you can work out without much trouble if you've followed the previous posts. It basically amounts to noticing the first two conditions force all non-zero terms to be in the “first quadrant" when . Since the differential maps get longer and longer as increases, paying attention to some specific , the differential pointing to this term will have to come from the fourth quadrant, and eventually the differential will point to the second quadrant. But we said that these two quadrants were filled with 0 groups. Thus our sequence we are taking homology of is for all after some point. So they stabilize. Figuring out exactly what these things are that they stabilize to is far more tedious and I won't do it.

The next topic that should be addressed is how to get a spectral sequence out of a double complex. This is actually much more useful it turns out, since there are two ways to do it that will both converge to the same thing which will give us lots of information.

First, let's recall that a double complex is just sets of complexes where the index the rows and the index the columns. So for a fixed , we get a chain complex with differential, say for horizontal. Likewise we get them going down in columns for any fixed with differential for vertical. The differentials are compatible in the sense that . These also have to fit together into what we call the total complex where the differential is .

Now if we consider just the single complex , and put a filtration on it, we'll have a spectral sequence as before. One natural filtration is at the th filtered part to chop everything from the -th column to the right off and replace it with . Notationally, this is .

The other natural one is to chop everything from the -th row and up off and replace it with . We'll notate this with a prime on the left . Both of these certainly satisfy since from to everything stays exactly the same except the column of gets stuck on. We also satisfy . We do need to assume that when or to get all the convergence conditions above, but this isn't too bad since most naturally arising double complexes (that we'll look at) are zero before some point and we can just shift indices.

The spectral sequence we get has . Note that for the first spectral sequence the term is computed by first taking vertical homology, and then horizontal homology: and for the other filtration it is .

As usual, the formal aspect of this might seem overwhelming and confusing right now, so I'll hold off on working out what the maps actually are and let this absorb a little. It should become more clear what is going on when we do some examples.

February 17, 2010 at 7:42 pm

Hello hilbertthm90,

Have you tried Luca’s Latex2WP to convert file.tex to HTML?

http://lucatrevisan.wordpress.com/latex-to-wordpress/

February 17, 2010 at 7:46 pm

Actually, that’s what I used to post this. I’ve always had weird things happen with inequalities in the past as well.