Past exam of the topology course of the University of Oxford / 2015 / 3 / b

A polygon with a complete set of side-identifications consists of a closed polygonal disk, a pairing of all its boundary sides, and a specified endpoint-matching homeomorphism for each paired pair. Form the quotient by these side maps, leaving interior points distinct. A convenient encoding labels paired sides by the same letter and gives them arrows; traversal in the arrow direction contributes $a$, and traversal against it contributes $a^{-1}$ to the boundary word. Every letter occurs exactly twice.

The orientations determine whether matched endpoints are identified in the same or reverse boundary-traversal order. This endpoint data is essential: pairing the same geometric sides with different directions can produce nonhomeomorphic surfaces. Subdividing the disk and the paired sides gives a triangulation of the resulting surface.

The classification theorem for surfaces states that every connected closed combinatorial surface is homeomorphic to exactly one of:

The orientable family has Euler characteristic $2-2g$; the nonorientable family has Euler characteristic $2-h$. Orientability together with Euler characteristic distinguishes the entries.

Boundary words giving the required polygonal schemas areA two-sided polygon here means a disk with its boundary split into two arcs; subdivision produces an ordinary polygon with more sides without changing the quotient. Alternatively the square word $a{a}^{-1}b{b}^{-1}$ represents the sphere. Each four-letter block in the orientable word adds a torus handle; each repeated-letter block in the nonorientable word adds a projective-plane summand.

There are exactly four homeomorphism types: the two-sphere, real projective plane, torus, and Klein bottle.

For completeness, enumerate all pairings. Four sides have three pairings; each pair can be matched in either direction, giving twelve signed pairings before symmetries. Up to cyclic relabelling, the repeated labels are either adjacent, of form $a{a}^{s}b{b}^t$, or alternating, of form $ab{a}^s{b}^t$, where $s,t\in \{1,-1\}$. The second adjacent pattern $abba$ rotates to the first. Endpoint identification gives the following table:Here the quotient always has two edge classes and one face, so its Euler characteristic is $V-2+1=V-1$. To reproduce the vertex count, label consecutive square vertices $0,1,2,3$. For paired sides $i,j$, a same-direction pairing identifies $i$ with $j$ and $i+1$ with $j+1$; a reversed-direction pairing identifies $i$ with $j+1$ and $i+1$ with $j$, with indices modulo four. Taking the generated equivalence classes gives exactly the displayed values of $V$.

The quotient is orientable precisely when each label is traversed once positively and once negatively around the boundary: then the face orientation extends across every paired edge. A same-direction pair obstructs such an orientation. Thus the two $\chi =0$ possibilities are distinguished as the orientable torus and nonorientable Klein bottle; the other rows are fixed by Euler characteristic and the classification theorem for surfaces.

Explicit square representatives areAll edge interior points have disk neighbourhoods by joining two half-disks, and each identified vertex has a cyclic sequence of corner sectors, again a disk neighbourhood. There are no leftover boundary edges. The enumeration therefore describes closed surfaces, and the twelve signed pairings leave no additional cases.