0708-1300/Homework Assignment 10

From Drorbn
Jump to navigationJump to search
Announcements go here


Read, reread and rereread your notes to this point, and make sure that you really, really really, really really really understand everything in them. Do the same every week!

Also, read section 1 through 6 (to page 183) of chapter IV of Bredon's book three times:

  • First time as if you were reading a novel - quickly and without too much attention to detail, just to learn what the main keywords and concepts and goals are.
  • Second time like you were studying for an exam on the subject - slowly and not skipping anything, verifying every little detail.
  • And then a third time, again at a quicker pace, to remind yourself of the bigger picture all those little details are there to paint.


Solve the following problems from Bredon's book, but submit only the solutions of the problems marked with an "S" - problems 1, 2, S3 on pages 176-177, problems S2, 3 on page 182, and problem S5 on page 190. Also, solve and submit the following question:

Problem 6. "Homotopies between maps" define an "ideal" within the category of topological spaces and continuous maps between them: the homotopy relation is an equivalence relation, and if , then and whenever these compositions make sense. Show that the same is true for the notion "homotopy of chain maps between chain complexes", within the category of chain complexes and chain maps between them.

Due Date

This assignment is due in class on Thursday March 13, 2008.

Just for Fun

A maximal tree in the 9x9 integer lattice.
  1. A maximal tree is chosen within the edges of the integer lattice. Show that there are two neigboring points on the lattice whose distance from each other, measured only along the tree, is at least .
  2. In class we have shown that , that is, , is a union of 's in a nice and natural way. Can you show that is a union of 's in a nice and natural way, for general and ?
  3. Can you show that the -cube is a union of 's in a nice and natural way?

Here is a idea for problem 1 but don't look at it until you have think on it for a while.