Count incidences of triangular faces with edges. Every triangle contributes three and every edge of a closed surface occurs in two triangles, hence . Substituting into the Euler characteristic gives
The simplicial intersection conditions prohibit loops and multiple edges between the same pair of vertices, so the one-skeleton is a simple graph andUsing the preceding identity gives . A closed surface has and a simplicial triangulation has . The smaller root is at most three, so this inequality forces to lie above the larger root:For completeness, fewer than four vertices could give at most one triangle under the intersection rules, which cannot form a closed surface.
Here the surface is the real projective plane, with Euler characteristic one. The bound gives . The following ten triangles on vertices attain it:Take these as the maximal simplices of an abstract simplicial complex, identifying edges with the same vertex labels. Every one of the 15 pairs of vertices occurs as an edge in exactly two triangles. The links of the six vertices are single five-cycles; listed cyclically they areThus every point has a disk neighborhood, and the realization is a connected closed surface. Its Euler characteristic is , so the classification of compact surfaces identifies it with the real projective plane. This is an explicit triangulation, proving .
Articles by others on the same topic
There are currently no matching articles.