## Homology Primer 3: Introductory Examples!

### January 4, 2011

In this post, we’re going to do something that I thought helped me through homology, but that others no doubt think is a huge waste of time: we’re going to explicitly compute the homology groups of trivial or nearly-trivial things explicitly, without appealing to any theorems regarding homeomorphisms or the like.

Recall the things that we’ve done so far. The steps to find the homology groups in this post (and, more generally, in life) will be as follows:

- Find the chain groups and their generators.
- Compute explicitly the image and kernel of the boundary maps.
- Find a nice way to express the kernel and image of these boundary maps by potentially using different, but equivalent, generators (we’ll get to this step soon; it’ll make more sense then).
- Find the quotient , which is equal to the -th cellular homology group.
- Reflect on this solution: does it make sense? Is it nice? Do we love it?

So without further delay, let’s dig right in.

## The 2-dimensional Disk, .

We can make this disk a number of ways, but let’s do it in the following way.

**Define by the cell structure which has one 0-cell, one 1-cell, and one 2-cell with the attaching maps defined as below.**

We note that the 0-cell is called , the 1-cell is called and it’s directed as above, and the 2-cell is called . Okay. Now, let’s detail the chain groups.

Generated by .

Generated by .

Generated by . If these things are mysterious to you, you may want to go back to the previous post and see what these chain groups actually are. Also note that for every , since we have no cells in that dimension.

Now, let’s consider the boundary maps. Because these maps are linear transformations, we only need to worry about where they take the generator of our set. So, for example, we have

takes our generator of , which is just , into what? What is the boundary of this set? Well, the boundary is just , since this is what we’re gluing the 2-cell to. Thus, which implies that

where the right hand side is generated by . Note that the kernel is trivial for a variety of reasons: the first isomorphism theorem, the fact that only 0 maps to 0, and so forth.

Similarly, that , so we need only consider . But what is this? On one side, we attach to , and then it wraps around and goes back to . Thus, we have . This means that

Where the latter case is generated by and is found either by the first isomorphism theorem, or by noting that every element of the chain group goes to .

Last, what is ? It’s kind of silly. It sends everything to 0. Thus, we have

Where the latter is generated by .

Okay. Now, we’ve done the hard part of this. Now we just modulo things. First, let’s examine

Note that the image and kernel of for any greater than your largest cell will be trivial. Thus, this reduces to

Which we can replace by noting this kernel is just 0, from above. Thus,

Okay, good. Now, examine

We know that both the kernel and the image are and generated by . Thus, this quotient is trivial (we’re modding out two groups generated by the exact same elements), and so

Kind of boring so far. Okay, let’s do the last one. Examine

This reduces to

with the top generated by . This means that

Nice! This is pretty nontrivial!

**Let’s reflect on what all this means. **Since we have is trivial, this means there are no “two dimensional holes.” We’d expect this for the disk, where there are no holes in general. Since is trivial, we note there are no “one dimensional holes” (like the ones in ), and this makes sense as well. The last value is kind of weird, but if we think about what “zero dimensional holes” should mean, it translates to the idea that our figure is connected. Thus, the group tells us how many connected components our complex has; it will be one direct sum copy of for each connected component.

## The Circle, .

This one is a bit easier to represent the cell structure for. We’re just going to use one 0-cell and one 1-cell in the following way:

So our 1-cell is connected on both ends to our 0-cell. Now, more briefly, let’s state what we know about this. If we don’t mention a chain group or a homology group, it’s because it’s trivial.

Generated by .

Generated by .

And so we have

generated by ,

generated by .

Which gives us the homology groups

Which is a little bit different than what we had before! Notice that since is not trivial (and is generated by , we have that there is a one dimensional hole, and, furthermore, is the element that surrounds it. This makes sense, right? There is a big hole in the middle of this circle, and the element which bounds it is exactly the 1-cell . The group tells us that is connected, which is the case.

Parenthetically, showing is connected is a good exercise to give to beginner topology students. Kind of cute.

## with a Different Cell Structure.

This time, just to show you that equivalent “looking” cell structures (we’ll talk more about what this means later, but for now homeomorphic will suffice) have the same homology groups, let’s make the circle a different way.

This time, we’ve made it with two 0-cells and two 1-cells. Let’s compute as in the last example, and, also as in the last example, if we don’t mention a chain group or a homology group, it’s because it’s trivial.

Generated by .

Generated by .

Remember that this last equality (the boundary of a 0-cell) is null by definition. Now, we have

since , we have that this image is just the integers, but it’s generated by the value . That’s kind of strange, but we’ll go with it. Now think about this: when is the boundary of some 1-chain going to be 0? If we have

Implying that . Thus, we have the set generated by is the kernel; all scalar multiples of this chain will give a zero boundary!

generated by ,

generated by .

But now it’s a little trickier to do the homology groups because the things which generate our sets are not so nice anymore.

Notice that, before, this was generated by our only edge. Now it’s generated by which makes one complete revolution around the circle, disregarding the “second vertex” in this example.

Now, this is not so easy to see. An inexperienced algebraist might see this and say, oh, of course this is just , but we cannot conclude this. Specifically, we need to look at the generators. On the top, our generators are and for where each vertex generates each of the direct ${\mathbb Z}$summands. But what is the bottom? It’s generated by . Well, this is a bit of a pickle. The generators don’t really match up nicely.

Well, let’s do something we’re going to be doing a lot. Let’s try to change the generators on the top to match the generators on the bottom. We can do this easily if we consider:

where these braces mean “set generated by.” Why is this true? Given any element of the first one, we can make it using the second one; this is kind of a new way to adapt that linear algebra “change of basis” trick. Neat. Okay, now, note that we can make our “numerator” of

be generated by and since the bottom is generated by , it simply eliminates one of the summands in the top. This allows us to reduce the calculation to just

.

Note that the argument used here was not an easy one. We’re doing a lot in these last few steps, so please do this example out and see if you follow what I mean. It’s a bit difficult to get used to changing the basis of our direct sum to make the quotient nice, and I may do an entirely separate post on this because we use it quite a bit. Nonetheless, we can note here that we obtain the exact same calculations as we did in the previous section with .

## Let’s move it up with .

Surprisingly, is really no more difficult than ; in fact, the calculations are almost exactly the same. Let’s do the “easy” version of first by noting that it can be made with a 2-cell attached to a 0-cell.

Here we are letting our 0-cell be and our 2-cell being . As usual, let’s write our chain groups down.

generated by .

since there’s no 1-cells.

generated by .

Now let’s do our boundary maps!

as there are no 1-cells for which is a boundary. Recall that this boundary map needs to map into the 1-cell chain group, and so it cannot possibly be anything but 0.

trivially, as there are no 1-cells, and

by definition. Now, let’s check the images and kernels.

, since there are no 3-cells. (We’ll need this for the calculation of .)

as above.

generated by by the first isomorphism theorem.

,

, by first isomorphism theorem,

,

generated by as usual.

Now, let’s calculate homology groups. It’s a bit easier this time around.

and every other homology group is trivial. We’d expect something like this, since it states that the sphere is connected (this is what is telling us) and that there is a single two-dimensional hole, namely the inside of the sphere (this is what is telling us).

Using this intuition regarding the homology groups telling us how many -dimensional holes are in a complex, what do you expect the homology groups to be for two spheres which have one point in common as below?

Hint, we can prove that it is the same as the sphere except in where there is an additional copy of (why? what is it generated by?) and so we have for every and , . Calculate this for yourself explicitly.

Nice, thanks for writing this up! Little remark: when you say “Now thing about this: when is the boundary of some 1-chain going to be 0? If we have (…) Implying that a=b”, that last bit should be ‘implying that x=y’.

Thank you! Two typos in a single sentence? Whew, that’s a bit embarrassing. Fixed!

In step 4 at the beginning of the article I believe you meant to put the i+1 in your denominator rather than in the numerator?

Nice article. I learned a lot as I was starting to do such computations myself and wanted some way to check my answers. I learned more than I thought there was to learn. Thank you so much.

Thank you, that was indeed a typo!