Computing Homology

Resource | v1 | created by janarez |
Type Web
Created 2013-04-10
Identifier unavailable


In our last post in this series on topology, we defined the homology group. Specifically, we built up a topological space as a simplicial complex (a mess of triangles glued together), we defined an algebraic way to represent collections of simplices called chains as vectors in a vector space, we defined the boundary homomorphism as a linear map on chains, and finally defined the homology groups as the quotient vector spaces. In this post we will be quite a bit more explicit. Because the chain groups are vector spaces and the boundary mappings are linear maps, they can be represented as matrices whose dimensions depend on our simplicial complex structure. Better yet, if we have explicit representations of our chains by way of a basis, then we can use row-reduction techniques to write the matrix in a standard form.


Currently, no topics are attached.

created by Jeremy Kun

My name is Jeremy Kun. I’m currently an engineer at Google. I earned a PhD in mathematics from the Un...

follows Homology Theory — A Primer

This series on topology has been long and hard, but we’re are quickly approaching the topics where we...

Edit resource New resource

10.0 /10
useless alright awesome
from 1 review
Write comment Rate resource Tip: Rating is anonymous unless you also write a comment.
Resource level 4.0 /10
beginner intermediate advanced
Resource clarity 9.0 /10
hardly clear sometimes unclear perfectly clear
Reviewer's background 5.0 /10
none basics intermediate advanced expert
Comments 1
1 0

10 rating 4 level 9 clarity 5 user's background

Last part of the homology series. Contains code and is the easiest to comprehend. Does not make sense to read without the previous post.