Homology of a triangle

Homology of a triangle

Consider the 1D simplicial complex consisting of a triangle:

The chain complex is:

The group is generated by the 1-simplices:

The group is generated by the 0-simplices:

The boundary operator:

The kernel of is freely generated by . The image of is isomorphic to via the map determined by .

So we have and . Higher homology groups vanish.

Homology counts holes by dimension

Homology counts holes by dimension

Consider the space , the wedge sum of three copies of and one copy of obtained by gluing all spaces at a single point:

The homology of this space is:

Homology independent loops in a graph

Homology independent loops in a graph

The “nullity” of a connected graph is the number of independent cycles in the graph. If for a graph considered as a simplicial complex, then is the nullity.

So for the following graph: