Lecture Simplicialcomplexes3
Lecture Simplicialcomplexes3
1
ented in opposite directions in each simplex. For example, Euler Characteristic. Given a planar embedded
the following triangles are consistently oriented: graph G with v vertices and e edges, let f be the
number of pieces the plane is cut into when we remove
(cut-along) G. The Euler characteristic of the graph is
then: χ(G) = v − e + f . We noticed that χ(G) = 2
always. This is actually a specific example of the Euler
characteristic of the sphere. A graph is planar if and only
if it can be embedded on the surface of a sphere. No
matter how you embed it on the sphere (or on the plane),
the number of faces the embedding creates will always be
the same.
We say that an n-dimensional simplicial complex is ori- Now consider a simplicial complex K. Let Ki be the
entable if all pairs of adjacent n-simplices are consistent. set of i-simplices in K. Then, the Euler characteristic of
This definition goes hand-in-hand with algorithm to test K is defined as:
if a simplex is orientable or not. Letting K be a k- ∞
X
dimensional simplicial complex (of a manifold) with k +1 χ(K) := (−1)i |Ki |.
n-simplices. The algorithm to decide if K is orientable is i=0
as follows: If we use colloquial language, we see that the Euler char-
acteristic is equal to the number of vertices minus the num-
1. Choose a simplex σ ∈ K. ber of edges plus the number of faces minus the number
2. Let τ1 , . . . , τk be the DFS ordering of the n-faces of tetrahedra plus the number of 4-simplices, etc.
from σ.
The Euler characteristic is a topological invariant. This
3. Choose an arbitrary orientation for σ. means, if we have the same underlying space, the Euler
4. S = {σ}. characteristic will always be the same, no matter how we
triangulate it.
5. For each i = 1 . . . k: If τi has a unique consistent
orientation given the orientations of all simplices in
S, orient τi and set S = S ∪ {τi }. Else, return false. Manifold Classification.
6. For each edge: If the the incident triangles are not
consistently oriented, return false. C LASSIFICATION T HEOREM. Given an orientable
7. return true (as we have constructed a consistent ori- compact manifold, the Euler characteristic is sufficient to
entation). uniquely determine the topological type of the manifold:
the sphere S2 , the torus T2 , the double torus T2 #T2 , the
[Exercise: This is done essentially with two sweeps: doing connected sum of three tori T2 #T2 #T2 , etc.
the DFS and then going through the edges. In fact, we can
actually do this in one sweep. Do you see how?] The connected sum A#B is obtained by removing an
open disc from both A and B, then gluing them together
We consider the (orientable) cylinder and the (non- along the boundaries of the removed discs. This operation
orientable) Möbius strip. Below, we triangulate the fun- is one type of surgery in topology.
damental polygons for each, and attempt to choose an ori-
entation for each triangle, starting with the starred triangle.
2
Handle-body Decomposition. Note: the handle-body
decomposition was not explicitly discussed in class, but
it might be helpful to understand for Question 4 of the
homework.
The torus T2 can be obtained by starting with a sphere,
removing two holes, and connecting the holes using a
cylinder. This cylinder we call a handle. We can repeat
this process to add n handles, we obtain the connected
sum of n tori.