Exercises:Saul - Algebraic Topology - 3/Exercise 3.2
Contents
[hide]Exercises
Exercise 3.2
Suppose that (X,J) is a non-empty path-connected topological space, equipped with a Δ-complex structure. Show, directly from the definitions (Hatcher, of course...) that HΔ0(X)≅Z
- We may assume without proof that the 1-skeleton is path connected.
Notes
- HΔn(X):=Ker(∂0)Im(∂1)
As ∂0 just sends everything to 0 we see Ker(∂0)=Δ0(X) - all the vertices. Thus, essentially, Ker(∂0)≅Z#vertices.
Okay now ∂1:Δ1(X)→Δ0(X), what is its image?
- First of all, for f∈Δ1(X) we see ∂1(X):=∂1(∑α∈I1nασα)=∑α∈I1nα∂1(σα) =∑α∈I1nα(Terminal(σα)−Initial(σα))
- where I1 is the set of 1-simplices involved in X, and nα∈Z with nα≠0 for only finitely many of the α∈I1
This shows us that (sort of anyway) the image is spanned by various Terminal(σα)−Initial(σα) (which are vertices)
Using X1 to denote the 1-skeleton (consistent notation be damned) then Caveat:and this is the informal part for any two vertexes of X, say v0 and v1, there is a path through the "edges" of X1, such that ∂1(that path)=v1−v0
- We can make this a bit better! If (pi)ki=1 is a representation of the path, where pi is an edge, such that the initial vertex of p1 is v0 and the final vertex of pk is v1 we can represent the path by the formal linear combination: ∑ki=1pi.
- Note the pi need not be unique, it could have several loops in it, that wont matter (as the boundaries of cycles are 0)
Now what we can sort of do is... well we want that sum to collapse to a few terms. What we can do is consider each σα which is an edge - plus the path from its endpoint to some fixed point of our choice. The boundaries then will have the same terminal point, subtracting various initials (and some/one (?) will have the same terminal and initial, giving us our "one less")
It would have to be shown this is in bijection with the edges.
Notes
References