- Published on
Geometric Topology 11
- Authors
- Name
- Malachy Reynolds
- @MalachyReynolds
Geometric Topology 11
Subdividing Surfaces
Given a surface (possibly with boundary), we cut it into smallish 'triangles' (possibly with curved sides) with matching directed edges, which can be labelled (, , etc.) so the same label only occurs on two adjacent triangles. Such a triangulation can always be chosen with the following properties:
- Each edge belongs to at most two triangles
- The set ('star') of triangles sharing a vertex forms a polygon homeomorphic to a closed disk (this would also hold for a point on the boundary if there were one)
- Two triangles are either disjoint or meet in one common edge or a single vertex.
Properties 1 and 2 guarantee the locally Euclidean property. Each edge must belong to exactly two triangles assuming (as currently) that there is no boundary.
Triangulating the Projective Plane
If we start with the rectangle or square model, we can divide it into triangles, but many more are needed to prevent the triangles from having two isolated vertices in common. From experimentation we can see that triangles suffice, but the minimum for is known to be . Here the boundary is encoded by the word , equivalent to or even . The right-handed set of axes can be propagated from one triangle to another, but when it passes across the boundary of the square it becomes left-handed. So there is no consistent sense of clockwise/anti-clockwise rotation, and the surface is said to be non-orientable. This is like having a one-sided surface in , but the concept does not require one to visualise in space.
Polygonal Surfaces
Once a surface is triangulated, the triangular pieces can be separated and then partially re-assembled in the plane, adding one triangle at a time by pairing edges. When this process is complete, we can avoid isolated vertices because rule (2) implies that a punctured neighbourhood of is connected, so we can always find triangles filling in above and/or below , with their edges identified.
The order of matchings can result in different configurations but, assuming is connected we can always suppose that the final result is a single (filled) polygon. Its edges will then be labelled, like the squares previously.
In practice, one can relax the rules of triangulation, and divide the surface into a finite union of polygons whose boundary edges are matched in pairs. Each polygon has a boundary code consisting of a word (such as ). The symbol indicates that and have an opposite sense of rotation around the polygon, though the inverse is omitted if the symbol accompanies an arrow.
A Hexagonal Model of a Torus
This -sided polygon is triangulated with edges labelled in accordance with the rows and columns (read upwards) of the matrix above. The boundary code:
determines a surface which we shall explain is a topological quotient of .
Exercises:
- No occurrence of means that has a consistent sense of clockwise/anticlockwise rotation, so is orientable.
- Move triangles so as to transform the hexagon into an -sided polygon with boundary code , which is equivalent to that of a torus.
A Dehn Twist
We now know that the quotient of the hexagon with boundary code is homeomorphic to the torus. Consequently there must exist a continuous surjective mapping:
where is a torus of revolution. The map can be understood by cutting teh torus along a circle, then twisting it by 180 degrees before sewing it back together. This technique was used by Max Dehn around 1910 to generate the so-called mapping class group of a surface.
Surfaces as Quotients
Given a connected surface without boundary, recall that we can make a model of it as a polygon , with boundary consisting of sides. A boundary code consists of a word with letters occurring in pairs. The edges of each pair need to be 'sewn' or 'glued' together so as to eliminate the boundary of and recover .
More formally, the code defines an equivalence relation on whose classes have size or more. An interior point of is only equivalent to itself. An interior point of an edge is equivalent to exactly one other point on the other edge labelled or . A vertex will be equivalent to at least one other point, unless it occurs in the middle of or , which (if a -gon on its own) represents the sphere .
can be defined as the set of equivalence classes, and there is a surjective mapping called the projection, . The image is not merely a set, but a topological space: a subset of is declared open if and only if is open in (and so of the form where is an open subset of ). This makes continuous.
Example: Let so that . Then an open subset of containing must contain a small semicircular region around both and .
Normal Form
Our task will be to understand when two different boundary codes (words) for give rise to homeomorphic surfaces. For this purpose, we shall define a surface combinatorially, purely in terms of a word an the operations on it that preserve topological type. To interpret these operations, we shall rely on visual intuition to understand as the quotient space .
Main Theorem (v2): Any connected surface without boundary arises from a polygon with an even number of edges, identified in pairs, and is uniquely specified by exactly one of the following words:
- , or with ,
- with .
Don't forget that polygon means "filled polygon": an open interior together with boundary edges and vertices.
The two cases coincide with the previous discussed notions. In particular signals the presence of an attached torus/handle, and indicates the presence of a crosscap.
Sewing the Projective Plane
Consider the square model of the projective plane with boundary code . If we replace one of the 's with we obtain the code that represents a surface with boundary. It is clear that is the code for describing a Mobius band in an abstract way. The boundary consists of which (in the view of matching vertices) is homeomorphic to a circle.
The simplest way of visualising in is to regard the square as a piece of paper, and attach the two edges labelled by twisting the paper by 180 degrees. The boundary is then an unknot (whilst had the twist been 540 degrees it would have been a trefoil). Forgetting the band, we can flatten and deform the unknot into the boundary of a closed disk , itself represented by a -gon with code . In notation that will be developed in the next sections, we can write:
which all goes to show that is obtained by uniting to . One can try to visualise an immersion of in by sewing the disk onto the twisted band, though in practice this requires some intersection of the disk with the band (so a self-intersection of ).
An Abstract Klein Bottle
We previously saw that the cylinder model of leads to a square with word , but this is not in normal form, so is not recognisable to the theorem. We can convert the word into normal form with a "cut and paste" operation, namely we remove the triangle below the diagonal and re-position it so as to match up the two edges.
First we split the diagram into triangles and . These can be combined by "flipping" the second over to match the edges. In symbols:
where indicates that the associated surfaces are homeomorphic. The new word is in the notation of the theorem, confirming that is a sphere with two crosscaps.