In Homology and Cohomology, we showed how to study the topology of spaces using homology and cohomology groups, which are obtained via the construction of chain complexes out of abelian groups of subspaces of the topological space. However, we have not elaborated how this is achieved. In this post we introduce the notion of a simplex, which gives us a method of “triangulating” the space so that we can have construct the chains that make up our chain complex.

An n-simplex can be thought of as the n-dimensional analogue of a triangle. More technically, it is the smallest convex set in some Euclidean space \mathbb{R}^{m} containing n+1 points v_{0},...,v_{n}, called its vertices, such that the “difference vectors” defined by v_{1}-v_{0},...,v_{n}-v_{0} are linearly independent. We will use the notation [v_{0},...,v_{n}] to denote a simplex. We will keep track of the ordering of the vertices of the simplex, and we will always make use of the convention that the subscripts indexing the vertices are to be written in increasing order.

To make things more concrete, we discuss one of the most basic examples of an n-simplex, the standard n-simplex. It is defined to be the subset of n+1-dimensional Euclidean space \mathbb{R}^{n+1} given by

\displaystyle \Delta^{n}=\{(t_{0},...,t_{n})\in\mathbb{R}^{n+1}|\sum_{i=0}^{n}t_{i}=1\text{ and }t_{i}\geq 0\text{ for all }i\}

The standard 0-simplex is a point (actually the point x=1 on the real line \mathbb{R}), the standard 1-simplex is a line segment connecting the points (1,0) and (0,1) in the xy plane, the standard 2-simplex is a triangle (including its interior) whose vertices are located at (1,0,0), (0,1,0), and (0,0,1) in 3-dimensional Euclidean space, and the standard 3-simplex is a tetrahedron (again including its interior) whose vertices are located at (1,0,0,0), (0,1,0,0), (0,0,1,0), and (0,0,0,1)  in 4-dimensional Euclidean space. The standard higher-dimensional simplices have analogous descriptions. Here is an image depicting the standard 2-simplex, courtesy of user Tosha of Wikipedia:


Consider now a 2-simplex [v_{0},v_{1},v_{2}]. This is of course a triangle. To this 2-simplex there are three related 1-simplices, namely [v_{0},v_{1}][v_{1},v_{2}], and [v_{0},v_{2}]. They can be thought of as the “edges” of the 2-simplex [v_{0},v_{1},v_{2}], and together they form the boundary of the 2-simplex, written \partial [v_{0},v_{1},v_{2}].

We want to use the concept of simplices in order to construct chains, which in turn form chain complexes, so that we can make use of the techniques of homology and cohomology. Crucial to the notion of chains is the abelian group structure, so that we can “add” and “subtract” n-chains, for a given n, to form new n-chains. This abelian group structure will also help us in making the idea of a boundary of a simplex more concrete, and at the same time provide us with an explicit expression for the boundary operator (also known as the boundary map, or boundary function) also crucial to the idea of a chain complex and its homology. This boundary operator (written \partial) is given by

\displaystyle \partial [v_{0},...,v_{n}]=\sum_{i}^{n}(-1)^{i}[v_{0},...,\hat{v_{i}},...,v_{n}]

where \hat{v_{i}} means that the vertex v_{i} is to be omitted. Therefore, for the 2-simplex [v_{0},v_{1},v_{2}], our boundary \partial[v_{0},v_{1},v_{2}] is given by

\displaystyle \partial [v_{0},v_{1},v_{2}]=[v_{0},v_{1}]-[v_{0},v_{2}]+[v_{1},v_{2}].

Simplices, with the boundary operators, can therefore be used to form chain complexes. The chains in this chain complex consist of “linear combinations” of simplices. We can then apply the notions of cycles and boundaries, and the principle that a space that is the boundary of another space has itself no boundary (but not all spaces that have no boundaries are the boundaries of other spaces – this is what the homology groups express), to study topology.

Of course, not all spaces look like simplices. But for many spaces, we can always map simplices to them via a homoeomorphism. Intuitively, this corresponds to “triangulating” the space. For example, we may map the boundary of a tetrahedron (made up of four triangles – 2-simplices – with certain edges and vertices in common) homeomorphically onto the sphere. What this means is that we can essentially then take the techniques that we have developed for the tetrahedron and apply them to the sphere.

Similarly, we can take a square with a diagonal (made up of two 2-simplices, again with certain edges and vertices in common), identify opposite edges of the boundary, and map it homeomorphically to the torus. This allows us to calculate the homology groups of the torus.

The use of simplices to construct chain complexes for taking the homology groups of a topological space is called simplicial homology. A generalization that involves maps that may not be homeomorphic is called singular homology. There are also other ways to construct chain complexes, for instance, we also have cellular cohomology, which instead makes use of of “cells” instead of simplices. Just as simplices are generalizations of triangles and tetrahedrons, cells are generalizations of discs and balls. A space made up of simplices is called a simplicial complex, while a space made up of cells is called a CW-complex.

Aside from algebraic topology in the usual sense, the notion of simplices are also useful in higher category theory. We recall from Category Theory that a category is made up of objects and morphisms, sometimes also called arrows, between these objects. In higher category theory, we also consider “morphisms between morphisms”, “morphisms between morphisms between morphisms”, and so on. This is reminiscent of simplices, in which we have vertices, edges, faces, and higher-dimensional analogues. Hence, the idea of simplices can be abstracted so that they can be used for the constructions of higher category theory. This leads to the theory of simplicial categories.


Simplex on Wikipedia

Simplicial Complex on Wikipedia

Simplicial Homology on Wikipedia

Singular Homology on Wikipedia

Higher Category Theory on Wikipedia

Image by User Tomruen of Wikipedia (Image Created by Robert Webb’s Stella Software)

Image by User Tosha of Wikipedia

Algebraic Topology by Allen Hatcher

A Concise Course in Algebraic Topology by J. P. May


Leave a Reply

Fill in your details below or click an icon to log in: Logo

You are commenting using your account. Log Out / Change )

Twitter picture

You are commenting using your Twitter account. Log Out / Change )

Facebook photo

You are commenting using your Facebook account. Log Out / Change )

Google+ photo

You are commenting using your Google+ account. Log Out / Change )

Connecting to %s