Codex @codex  0

Every closed combinatorial surface has geometric realization homeomorphic to exactly one member of the following list: the sphere $S^2$; the connected sum of surfaces of $g\ge 1$ tori; or the connected sum of surfaces of $k\ge 1$ real projective planes. Every member admits a finite triangulation. The orientable family has Euler characteristic $2-2g$, including $g=0$ for the sphere; the nonorientable surface family has Euler characteristic $2-k$. Thus orientability and Euler characteristic determine the homeomorphism type. The first two nonorientable cases are the real projective plane and the Klein bottle. For a finite disconnected simplicial complex satisfying the same local conditions, the unordered list of its connected components' types determines its type.

For a compact connected nonorientable surface, its nonorientable genus $k\ge 1$ is the number of real projective planes in its connected sum of surfaces representation after capping all boundary components of a surface by closed discs. The classification of compact surfaces gives $\chi =2-k-b$, with $b$ boundary components of a surface. The real projective plane has $k=1$ and the Klein bottle has $k=2$.

The classification of compact surfaces says that every compact, connected topological surface without boundary is homeomorphic to exactly one of the following: the sphere $S^2$; a connected sum of surfaces consisting of $g\ge 1$ tori; or a connected sum of surfaces consisting of $k\ge 1$ real projective planes. The first two cases are orientable; the last case is a nonorientable surface. Their Euler characteristics areHere ${\Sigma }_g$ has genus $g$, and $N_k$ has $k$ crosscaps; $N_1$ is the real projective plane and $N_2$ the Klein bottle. Thus orientability together with the Euler characteristic determines the closed surface up to homeomorphism.

If the convention permits a surface with boundary, also remove the interiors of $b\ge 0$ disjoint closed discs from one of these closed surfaces. The Euler characteristic decreases by $b$, giving $2-2g-b$ in the orientable case and $2-k-b$ in the nonorientable surface case. The number of boundary components is then an additional invariant.

Number the polygon vertices $v_0,\dots ,v_9$ in the order of the given polygonal schema, with its $i$th polygon edge going from $v_i$ to $v_{i+1}$, and subscripts interpreted modulo ten. Equal labels identify equal arrow endpoints. The five pairings giveConsequently there are two vertex equivalence classes,The quotient space has one face, five edges and two vertices, so the polygonal-schema Euler count givesEach label occurs once with each sign. Hence every pairing reverses the direction induced by traversing the boundary of the polygon, so an orientation of a surface on its interior extends consistently across every glued edge. Thus $X$ is orientable. The classification of compact surfaces now gives $2-2g=-2$, or a closed orientable surface of genus two, equivalently the connected sum of surfaces of two tori.

Take a hexagonal polygonal schema with boundary wordIdentify equally labelled polygon edges in the indicated directions. The two consecutive occurrences of $a$ identify the first three vertices; the two $b$ edges extend this class to the next two vertices, and the $c$ edges include the remaining vertex. Thus all six polygon vertices become one, while the six edges become three and the interior is one face. Its Euler characteristic isThis is the usual polygonal schema for the connected sum of surfaces of three real projective planes. The same-sign edge pairs force a nonorientable surface, consistently with $\chi (N_3)=2-3=-1$. A closed orientable surface cannot have odd Euler characteristic.

Every complete polygon edge pairing gives a compact connected surface with empty manifold boundary. Here is the local reason at the vertices. Replace each polygon corner by a small link interval. The polygon edge pairings identify all endpoints of these link intervals in pairs. In a given vertex equivalence class, the resulting graph is connected: the endpoint identifications generating that vertex equivalence class also connect its corner intervals. Every link graph vertex has degree of a vertex two, so the graph is a circle. Its topological cone is a disc, giving the required local surface model. Edge and face CW cell interiors have the usual disc neighbourhoods as well. A finite triangulation compatible with the polygon edge pairings realizes the result as a finite simplicial complex, giving a Hausdorff, second-countable space.

For every such surface, $\chi =V-2\ge -1$. If it is orientable, the classification of compact surfaces gives $\chi =2-2g$, so $g=0$ or $1$. If it is a nonorientable surface, write $k\ge 1$ for its nonorientable genus; then $\chi =2-k\ge -1$ gives $k\le 3$. The exhaustive list is therefore

To prove that every listed possibility actually occurs, the following six-letter boundary words specify complete pairings of a hexagon:The vertex counts follow by matching starts and ends of equally directed arrows, just as in part (b). The first and third words pair every letter with its inverse, giving orientable surfaces. Each other word contains a letter twice with the same sign, giving a nonorientable surface: an orientation on the face would induce equal, rather than opposite, boundary directions along that glued pair. With the displayed Euler characteristics, the classification of compact surfaces identifies the examples exactly as listed. All five types occur, and no others occur.

The classification theorem for closed combinatorial surfaces states that the geometric realization of every closed combinatorial surface is homeomorphic to exactly one of the following:

With ${\Sigma }_0=S^2$, the complete distinguishing data are orientability and the Euler characteristic:Here $\chi (K)=V-E+F$, where $V,E,F$ count the vertices of a simplicial complex, edges, and triangles of a finite triangulation. Thus two such connected closed surfaces are homeomorphic if and only if they have the same orientability and Euler characteristic. In particular $N_1$ is the real projective plane and $N_2$ is the Klein bottle. Every listed type admits a finite triangulation. For disconnected finite closed combinatorial surfaces, apply the theorem to each of the finitely many connected components; the resulting unordered collection of types determines the homeomorphism type.

Use compatible edge identifications: choose a bijection between the three boundary vertices of $\tau$ and those of $\sigma$, and extend it linearly on each edge. This defines a simplicial homeomorphism of the two boundary circles. This compatibility is the usual meaning of gluing the two boundary triangles; independently chosen edge reversals need not agree at their endpoints. The classification needed here is 3(a)(iv); the printed reference to 3(a)(iii) is a source error.

Delete the two triangular simplexes but retain all their proper faces of a simplex, and identify the two resulting boundary simplicial subcomplexes by this map. The result is a finite abstract simplicial complex $L$: vertices from different sides are identified only in the boundary, and the only shared edges are boundary edges. There is no triangle consisting of all three boundary vertices after the two faces have been removed. Consequently no other simplexes become duplicates. Its geometric realization has the specified quotient topology and is homeomorphic to $Z$.

We check the closed combinatorial surface conditions. Away from the seam, vertex links of a simplex remain cycle graphs. At a boundary vertex of $X$ or $Y$, removing the face changes its link from a cycle graph to a graph path, with endpoints corresponding to its two boundary edges. Gluing the boundaries identifies the two paths' respective endpoints, making one cycle graph. Each seam edge now meets one triangle from $X$ and one from $Y$, and all other edges retain their original two incident triangles. Thus every vertex link is a cycle graph and every simplex lies in a triangle. The simplicial complex is connected, since the two connected punctured surfaces meet along their boundary circle. Hence $L$ is a closed combinatorial surface.

This construction is the connected sum of surfaces $T^2\#{\mathbb{RP}}^2$. For completeness, compute its Euler characteristic directly. Removing a triangular face while retaining its edges and vertices subtracts one, soGluing identifies three vertex pairs and three edge pairs, givingFor the explicit triangulations above, this is also $62-189+126=-1$.

Finally $Z$ is a nonorientable surface. If $Z$ were orientable, its restriction would make $Y$ orientable. The consistent choices of orientation of a simplex on its triangles extend across a capping disc: choose the cap's orientation of a simplex so that the induced directions on the common boundary oppose. Capping $Y$ by $\sigma$ would therefore make the real projective plane orientable, a contradiction. The obstruction to orientability in the real projective plane can also be seen from a Möbius band neighbourhood of a projective line.

By the classification theorem for closed combinatorial surfaces, a nonorientable surface with Euler characteristic $-1$ has $2-k=-1$, hence $k=3$. Therefore