These notes are set so that you get to prove the main results
by solving smaller problems that when put together give the big result.
The answers to the problems are in the videos.
You will get the most out of these notes if you do (or try) the problems
before looking at the videos.
He we use the Gauss-Bennett Theorem to for a simply connected
region to generalize Euler's formula which we proved
for the sphere to more general surfaces. Recall that we have
have stated so far is that if is a simply connected
region on an surface, , with boundary and with some
corners as shown in the figure here then we have
the basic Gauss-Bonnet Theorem
Here
We will also what to use the interior angle of
the -th corner. Then we have
In the case where the surface is the usual plane
(so that )
and is a triangle with straight sides, this just says that
the sum of the interior angles is . If is a
convex region in with no corners, then
this reflecting that
is the total angle that the
sweeps through while moving around the boundary of
.
We now want to take a surface with no boundary
and ``triangulate'' as in the pictures here.
The reason for the quotes on triangulate is that the
domains in the decomposition do not have to be triangles,
what is important is that they are simply connected.
So in the picture on the left, it is a strict triangulation in the sense
that all the faces in the decomposition are triangles, in the torus
to the right all the faces are rectangles. And the faces do not all have
to have the same number of sides. So it is ok of there are
triangles, rectangles, pentagons, etc. all in
the same ``triangulation''.
Let be a compact oriented surface and let fix
a triangulation of . Let
and
a triangulation of . Let
Anther numerical quantity related to the triangulation is
the degree of a vertex. This is the number of edges
that are on it. It also tells us how many faces come together at
a vertex.
Proposition 1 . Let be a vertex. Then the number
of faces that are have is as a vertex is .
That is
Problem 1. Prove this.
Solution:
Proposition 2. If is the degree of the vertex
then
That is the sum of the degrees of the vertices is twice the number of
edges.
Problem 2:
Prove this.
Solution:
For each face (so is a simply connected domain
on the surface let
and for each let
Then by the Basic Gauss-Bonnet Formula for any we have
The idea now is to sum this over all . As
the faces cover the surface we have
Lemma 1. Problem 3. Prove this.
Solution:
Lemma 2 Problem 4. Prove this.
Solution:
Recalling a formula above we have for all
that by the Basic Gauss Bonnet Theorem the formula
holds.
Gauss-Bonnet Theorem.
For a triangulated oriented surface Problem 5. Prove this by summing the basic Gauss-Bonnet
formula over the collection of faces .
Solution:
Let us look a what
tells us. First it tells us that for all triangulations of
always has the same value (). So on a sphere for
any triangulation . Likewise on a torus for any triangulation we
have . To prove this you just need to find one triangulation where
holds (I leave this to you) and then the Gauss-Bonnet Theorem tell
us it will be the same for all triangulations. And one a -holed torus
holds for all triangulations.
The formula information when read in the other direction. Fix a triangulation.
Then for all metric, or if you like all embeddings of into
the integral . Therefore if is a
sphere, we always have . For a torus it is
always the case that .