User:Trefor

0708-1300/Navigation Panel   Add your name / see who's in! # Week of... Links Fall Semester 1 Sep 10 About, Tue, Thu 2 Sep 17 Tue, HW1, Thu 3 Sep 24 Tue, Photo, Thu 4 Oct 1 Questionnaire, Tue, HW2, Thu 5 Oct 8 Thanksgiving, Tue, Thu 6 Oct 15 Tue, HW3, Thu 7 Oct 22 Tue, Thu 8 Oct 29 Tue, HW4, Thu, Hilbert sphere 9 Nov 5 Tue,Thu, TE1 10 Nov 12 Tue, Thu 11 Nov 19 Tue, Thu, HW5 12 Nov 26 Tue, Thu 13 Dec 3 Tue, Thu, HW6 Spring Semester 14 Jan 7 Tue, Thu, HW7 15 Jan 14 Tue, Thu 16 Jan 21 Tue, Thu, HW8 17 Jan 28 Tue, Thu 18 Feb 4 Tue 19 Feb 11 TE2, Tue, HW9, Thu, Feb 17: last chance to drop class R Feb 18 Reading week 20 Feb 25 Tue, Thu, HW10 21 Mar 3 Tue, Thu 22 Mar 10 Tue, Thu, HW11 23 Mar 17 Tue, Thu 24 Mar 24 Tue, HW12, Thu 25 Mar 31 Referendum,Tue, Thu 26 Apr 7 Tue, Thu R Apr 14 Office hours R Apr 21 Office hours F Apr 28 Office hours, Final (Fri, May 2) Register of Good Deeds Errata to Bredon's Book

Announcements go here

NOTE: This page is used as a placeholder for incomplete typed class notes.

0708-1300/Navigation Panel   Add your name / see who's in! # Week of... Links Fall Semester 1 Sep 10 About, Tue, Thu 2 Sep 17 Tue, HW1, Thu 3 Sep 24 Tue, Photo, Thu 4 Oct 1 Questionnaire, Tue, HW2, Thu 5 Oct 8 Thanksgiving, Tue, Thu 6 Oct 15 Tue, HW3, Thu 7 Oct 22 Tue, Thu 8 Oct 29 Tue, HW4, Thu, Hilbert sphere 9 Nov 5 Tue,Thu, TE1 10 Nov 12 Tue, Thu 11 Nov 19 Tue, Thu, HW5 12 Nov 26 Tue, Thu 13 Dec 3 Tue, Thu, HW6 Spring Semester 14 Jan 7 Tue, Thu, HW7 15 Jan 14 Tue, Thu 16 Jan 21 Tue, Thu, HW8 17 Jan 28 Tue, Thu 18 Feb 4 Tue 19 Feb 11 TE2, Tue, HW9, Thu, Feb 17: last chance to drop class R Feb 18 Reading week 20 Feb 25 Tue, Thu, HW10 21 Mar 3 Tue, Thu 22 Mar 10 Tue, Thu, HW11 23 Mar 17 Tue, Thu 24 Mar 24 Tue, HW12, Thu 25 Mar 31 Referendum,Tue, Thu 26 Apr 7 Tue, Thu R Apr 14 Office hours R Apr 21 Office hours F Apr 28 Office hours, Final (Fri, May 2) Register of Good Deeds Errata to Bredon's Book

Announcements go here

A Homology Theory is a Monster

Page 183 of Bredon's book

Bredon's Plan of Attack: State all, apply all, prove all.

Our Route: Axiom by axiom - state, apply, prove. Thus everything we will do will be, or should be, labeled either "State" or "Prove" or "Apply".

Typed Notes

The notes below are by the students and for the students. Hopefully they are useful, but they come with no guarantee of any kind.

First Hour

Recall we had defined for a chain complex the associated homology groups: $H_{p}(C_{*}):=\ ker\partial _{p}/im\partial _{p+1}$

From this we get the pth homology for a topological space $H_{p}(X)$

We have previously shown that

1) $H_{p}(\cup X)=\oplus H_{p}(X_{i})$ for disjoint unions of spaces $X_{i}$

2) $H_{p}(pt)=\mathbb {Z} \delta _{p0}$

3) $H_{0}(connected)=\mathbb {Z}$

4) $H_{1}(connected)\cong \pi _{1}^{ab}(X)$ via the map

$\phi :[\gamma ]_{\pi _{1}^{ab}}\mapsto [\gamma ]_{H_{1}}$

$\psi :\sigma \in C_{1}\mapsto [\gamma _{\sigma (0)}\sigma {\bar {\gamma _{\sigma (1)}}}]$ where $\sigma _{x}$ is a path connecting $x_{0}$ to x.

We need to check the maps are in fact inverses of each other.

Lets consider $\psi \circ \phi$. We start with a closed path starting at $x_{0}$ (thought of as in the fundamental group). $\phi$ means we now think of it as a simplex in X with a point at $x_{0}$. $\Psi$ now takes this to the path that parks at $x_{0}$ for a third of the time, goes around the loop and then parks for the remaining third of the time. Clearly this is homotopic this composition is homotopic to the identity.

We now consider $\phi \circ \psi$. Start with just a path $\sigma$. Then $\psi$ makes a loop adding two paths from the $x_{0}$ to the start and finish of $\sigma$ forming a triangular like closed loop. We think of this loop as $\sigma '\in C_{1}$

Now, we start from c being $c=\sum a_{i}\sigma _{i}$ with $\partial c=0$. So get $\sum a_{i}(\partial \sigma _{1})=\sum a_{i}(\sigma _{i}(1)-\sigma _{i}(0))$

So $\Psi (c)=[\gamma _{\sigma _{i}(0)}\sigma _{i}{\bar {\gamma _{\sigma _{i}(1)}}}]_{\pi _{1}}$ which maps to, under $\phi$, $\sum a_{i}(\gamma _{\sigma _{i}(0)}+\sigma _{i}-\gamma _{\sigma _{i}(1)})=\sum a_{i}\sigma _{i}=c$ ( in the homology gamma's cancel as $\partial c=0$)

Axiomized Homology

We now will move to an approach where we prove that our defined homology satisfies a series of established homology axioms that will allow us to apply the machinery of general homology to our specific "singular" homology defined via simplexes.

Axiom 0) Homology if a function

Definition The "category of chain complexes" is a category whose objects are chain complexes (of abelian groups) and morphisms which is a homomorphism between each abelian group in one chain and the corresponding group in the other chain such that the resulting diagram commutes. I.e, $Mor((C_{p})_{p=0}^{\infty },(D_{p})_{p=0}^{\infty })=\{(f_{p}:C_{p}\rightarrow D_{p})_{p=0}^{\infty }\ |\ f_{p-1}\partial _{p}^{C}=\partial _{p}^{D}f_{p}\}$

Now, in our case, the chain complexes do in fact commute because $\partial$ is defined by pre-composition but f is defined by post-composition. Hence, associativity of composition yields commutativity.

Claim

Homology of chain complexes is a functor in the natural way. That is, if $f_{p}:C_{p}\rightarrow D_{p}$ for each p induces the functor $f_{*}:H_{p}(C_{*})\rightarrow H_{p}(D_{*})$

The proof is by "diagram chasing". Well, let $c\in C_{p}$, $\partial c=0$.

Let $f*[c]=[fc]$. Now $\partial fc=f\partial c=0$. Furthermore, suppose $c=\partial b$. Then, $f_{*}c=fc=\partial fb$ so therefore $fc=\partial \beta$ some $\beta$. This shows $f_{*}$ is well defined.

Thus, for $c\in H_{p}(C_{*})$ get $fc\in H_{p}(D_{*})$ via the well defined functor $f_{*}$.

Second Hour

1) Homotopy Axioms

If $f,g:X\rightarrow Y$ are homotopic then $f_{*}=g_{*}:H_{p}(X)\rightarrow H_{p}(Y)$

Applications: If X and Y are homotopy equivalent then $H_{*}(X)\cong H_{*}(Y)$

Proof:

let $f:X\rightarrow Y$, $g:Y\rightarrow X$ such that $f\circ g\sim id_{y}$ and $g\circ f\sim id_{x}$. Well $f_{*}\circ g_{*}=id_{H(Y)}$ and $g_{*}\circ f_{*}=id_{H(X)}$

Hence, $f_{*}$ and $g_{*}$ are invertible maps of each other. Q.E.D

Definition

Two morphisms $f,g:C_{*}\rightarrow D_{*}$ between chain complexes are homotopic if you can find maps $h_{p}:C_{p}\rightarrow D_{p+1}$ such that $f_{p}-g_{p}=\partial _{p+1}h_{p}=h_{p-1}\partial _{p}$

Claim 1

Given H a homotopy connecting f$,g:X\rightarrow$ Y we can construct a chain homotopy between $f_{*},g_{*}:C_{*}(X)\rightarrow C_{*}($Y)

Claim 2

If $f,g:C_{*}\rightarrow C_{*}$ are chain homotopic then they induce equal maps on homology.

Proof of 2

Assume $[c]\in H_{p}(C_{*})$, that is, $\partial c=0$

$[f_{*}c]-[g_{*}c]=[(f_{*}-g_{*})]=[(\partial h+h\partial )c]=0$ (as $\partial c=0$ and homology ignores exact forms)

Hence, at the level of homology they are the same.

Proof of 1

Consider a simplex in X. Now consider its image, a simplex, in Y under g and f respectively. Because of the homotopy we can construct a triangular based cylinder in Y with the image under f at the top and the image under y at the bottom.

Define $h\sigma$ = the above prism formed by $\sigma$ and the homotopy H.

$(f_{*}-g_{*})\sigma =h\partial \sigma =\partial h\sigma$

This, pictorially is correct but we need to be able to break up the prism, $\Delta _{p}\times I$ into a union of images of simplexes.

Suppose p=0, i.e. a point. Hence $\Delta _{0}\times I$ is a line, which is a simplex.

Suppose p=1 which yields a square. Adding a diagonal divides the square into two triangles, so is clearly a union of simplexes.

Suppose p=2. We get a prism which has a triangle for a base and a top. Raise each vertex on the bottom to the top in turn. This makes the prism a union of three simplexes.

In general for $\Delta _{p}\times I$ let $f_{i}=(l_{i},0)$ and $g_{i}=(l_{i},1)$ for vertexes $l_{i}$

Then, $h\sigma =\sum _{i=0}^{p}(-1)^{i}H\circ (\sigma \times I)\circ [f_{0}\cdots f_{i}g_{i}g_{i+1}\cdots g_{p}]$

which is in $C_{p+1}(Y)$

So have maps $Y\leftarrow _{H}X\times I\leftarrow \Delta _{p}\times I\leftarrow \Delta _{p+1}$

Claim:

$\partial h+h\partial =f-g$

Loosely, $\partial h$ cuts each $[f_{0}\cdots f_{i}g_{i}g_{i+1}\cdots g_{p}]$ between the f_i and g_i and then deletes an entry. h\partial however does these in reverse order. Hence all that we are left with is $[f_{0}\cdots f_{p}]-[g_{0}\cdots g_{p}]$