Simplicial Structures in Topology
Simplicial Structures in Topology
Simplicial Structures in Topology
Create successful ePaper yourself
Turn your PDF publications into a flip-book with our unique Google optimized e-Paper software.
188 V Triangulable Manifolds<br />
a tree. When χ(KT )=1, V is then homeomorphic to the disk D 2 and S is obta<strong>in</strong>ed<br />
by glu<strong>in</strong>g two disks on the boundaries; it follows that S ∼ = S 2 . Instead, if χ(KT ) < 1,<br />
then the homology H1(KT ) is non-trivial and so there is at least one non-trivial<br />
simple cycle, denoted by γ, <strong>in</strong> the graph KT . Let us consider the simplicial complex<br />
Kγ obta<strong>in</strong>ed by cutt<strong>in</strong>g K along γ (<strong>in</strong> other words, we duplicate all vertices and edges<br />
of γ). The result<strong>in</strong>g triangulated surface Sγ = |Kγ| is still connected: <strong>in</strong>deed, the tree<br />
T and the cycle γ are disjo<strong>in</strong>t, but T has a vertex <strong>in</strong> the <strong>in</strong>terior of each triangle of<br />
K, and therefore also of Kγ. It is a surface with boundary: if γ has a neighbourhood<br />
homeomorphic to a Möbius band, then its boundary has one component; on the<br />
other hand, if the neighbourhood of γ is a cyl<strong>in</strong>der, there are two components. Let<br />
us consider the cones on the components of the boundary of Kγ and attach them to<br />
the holes that we have created: we end up with a new triangulated surface S ′ ∼ = |K ′ |.<br />
The tree T is easily extended to a tree T ′ ⊂ K ′ by add<strong>in</strong>g a vertex to the barycentre of<br />
every triangle of the attached cones and an edge cross<strong>in</strong>g the edge of the boundary<br />
of the attachment, as <strong>in</strong> Fig. V.17.Letl be the number of edges of the component of<br />
Fig. V.17 Extension of T to<br />
the cone on the boundary<br />
component<br />
such a boundary. As it is easily <strong>in</strong>ferred from Fig. V.17, by attach<strong>in</strong>g a triangulated<br />
disk (cone on the component of γ), l sides are removed from the graph KT , whereas<br />
one vertex (the centre of the cone) and l edges through such a vertex are added.<br />
The Euler–Po<strong>in</strong>caré characteristic of the correspond<strong>in</strong>g graph K ′ T ′, obta<strong>in</strong>ed <strong>in</strong> this<br />
manner, is<br />
χ(K ′ T ′)=<br />
�<br />
χ(KT )+1 if Kγ has one boundary component<br />
χ(KT )+2 if Kγ has two boundary components.<br />
We note that the process of cutt<strong>in</strong>g along γ may be reversed: |K| is obta<strong>in</strong>ed by<br />
attach<strong>in</strong>g a handle (<strong>in</strong> the case of two components) to |K ′ | or a projective plane (<strong>in</strong><br />
the case of a s<strong>in</strong>gle component). By repeat<strong>in</strong>g this procedure, we must end up with<br />
noth<strong>in</strong>g other than a sphere. 4<br />
We have therefore proved that every surface is the connected sum of a sphere,<br />
a certa<strong>in</strong> number nT of tori, a certa<strong>in</strong> number nK of Kle<strong>in</strong> bottles, and a certa<strong>in</strong><br />
number nP of projective planes. However, s<strong>in</strong>ce the Kle<strong>in</strong> bottle is homeomorphic<br />
4 For a proof based on identify<strong>in</strong>g polygons, see William Massey [25, Theorem 1.5.1].