math.wiki
Topology › First algebraic topology › Classification of surfaces
Sign in

Classification of surfaces

Glue the edges of a polygon together in pairs and a closed surface comes out. How many different closed surfaces are there, and how can you tell which one a gluing pattern makes?

Where you are 5 in First algebraic topology

Why this exists

Quotient spaces, or gluing glued a square into a torus, a Klein bottle and a projective plane. Every compact connected surface arises from such a gluing, so the real question is which gluing patterns give the same surface. The answer is a complete list: the sphere, the sphere with g handles, and the sphere with k cross-caps, told apart by orientability and by the v - e + f of Planar graphs and Euler's formula.

Definition

Surfaces. A surface is a Hausdorff space (Hausdorff spaces and separation) in which every point has an open neighborhood homeomorphic to an open disk of \mathbb{R}^2. A closed surface is a compact (Compactness and open covers), connected (Connectedness) surface. A surface is non-orientable if some subspace is homeomorphic to the Möbius band (Exercise 9 of Quotient spaces, or gluing), and orientable otherwise.

Words. A word is a cyclic list of 2n \ge 2 letters with exponents \pm 1 in which every letter occurs exactly twice, such as a b a^{-1} b^{-1}. A letter is twisted if its two copies have the same exponent. Label the edges of a convex 2n-gon P by w counterclockwise (for n = 1, P is D^2 with its two half circles as edges): x marks an arrow pointing counterclockwise, x^{-1} one pointing clockwise. The space X_w is the quotient of P gluing the two edges of each letter by a homeomorphism matching arrows, tail to tail and head to head.

Complexes. A complex is a finite set of polygons whose edge words together use every letter exactly twice, glued the same way. Its corners fall into vertex classes. With v classes, e letters and f polygons, its Euler characteristic is \chi = v - e + f; for one word of length 2n, \chi(w) = v - n + 1. A complex is orientable if some polygons can be flipped (read clockwise, which inverts the word) so that every letter occurs once with each exponent. One polygon is orientable exactly when no letter is twisted, as flipping inverts every exponent.

Standard surfaces. T^2 = X_{a b a^{-1} b^{-1}} (Example 4 of Quotient spaces, or gluing), and \mathbb{RP}^2 = X_{a a}, the disk with opposite boundary points glued. The connected sum M \mathbin{\#} N of closed surfaces removes the interior of a closed disk from each and glues the boundary circles; here it is built from polygon models as in the proof of Theorem 5. That other disks and gluing maps give a homeomorphic surface is beyond this lesson. Let \Sigma_1 = T^2, \Sigma_g = T^2 \mathbin{\#} \Sigma_{g-1}, N_1 = \mathbb{RP}^2, N_k = \mathbb{RP}^2 \mathbin{\#} N_{k-1}. The normal forms are a a^{-1},

\begin{aligned} h_g &= a_1 b_1 a_1^{-1} b_1^{-1} \cdots a_g b_g a_g^{-1} b_g^{-1} \ (g \ge 1), \\ t_k &= a_1 a_1 a_2 a_2 \cdots a_k a_k \ (k \ge 1). \end{aligned}

Intuition

a
a
a
a
a
b
a
b
a_1
b_1
a_1
b_1
a_2
b_2
a_2
b_2
S^2
\mathbb{RP}^2
T^2
\Sigma_2
Figure 1The normal forms a a^{-1}, a a, a b a^{-1} b^{-1} and h_2. Edges with the same letter are glued with their arrows matching.

A block a b a^{-1} b^{-1} is a handle and a block a a is a cross-cap. The basic move is cut and paste: slice a polygon along a diagonal and tape the pieces back together along another pair of edges. The space is unchanged, and so is v - e + f, since the cut adds one edge and one polygon. Such moves herd each twisted letter next to its twin (Figure 2) and each linked pair of untwisted letters into a handle. What is left is a normal form, and \chi with orientability says which.

a
a
U
V
c
c
c
U
V^{-1}
Figure 2Theorem 3(a). Cut along c, flip one piece, and glue the two copies of a: the twisted pair becomes the adjacent pair c c.

Results

Theorem 1 (polygon surfaces). For every word w, X_w is a closed surface.

Theorem 2 (moves). Each change below keeps the space up to homeomorphism and keeps \chi and orientability. (a) Changing the polygons’ shapes or the gluing homeomorphisms; reading a word from another corner or clockwise; renaming a letter or reversing both its arrows. (b) Cancellation: U x x^{-1} becomes U, if U has at least two letters. (c) Cut and paste: the polygon U W, where U and W have at least two letters, is the complex of U c^{-1} and W c; conversely, two polygons x U and x^{-1} W form the polygon U W.

Theorem 3 (rearrangements). For words U, V, X, Y, Z, R (possibly empty) and new letters c, d:

\begin{aligned} &\text{(a) } X_{a U a V} \approx X_{c c U V^{-1}}, \\ &\text{(b) } X_{a X b Y a^{-1} Z b^{-1} V} \approx X_{c d c^{-1} d^{-1} Z Y X V}, \\ &\text{(c) } X_{a a b c b^{-1} c^{-1} R} \approx X_{a a b b c c R}. \end{aligned}

Theorem 4 (normal form). Moves turn every word w into a normal form: a a^{-1} if w is untwisted with \chi(w) = 2, h_g with \displaystyle g = \frac{2 - \chi(w)}{2} if w is untwisted otherwise, t_k with k = 2 - \chi(w) if w has a twisted letter. So \chi(w) \le 2, and \chi(w) is even when w is untwisted.

Theorem 5 (connected sums). If M \approx X_{w_1} and N \approx X_{w_2}, then M \mathbin{\#} N \approx X_w with w = c^{-1} w_1 c\, d^{-1} w_2 d, where \chi(w) = \chi(w_1) + \chi(w_2) - 2 and w is twisted exactly when w_1 or w_2 is. Hence \Sigma_g \approx X_{h_g}, N_k \approx X_{t_k} and M \mathbin{\#} S^2 \approx M.

Theorem 6 (twisted words). If w has a twisted letter, X_w is non-orientable.

Theorem 7 (one polygon). Every closed surface is homeomorphic to some X_w.

Theorem 8 (classification). Every closed surface is homeomorphic to exactly one of S^2, \Sigma_g (g \ge 1), N_k (k \ge 1). Orientability and \chi(S) := \chi(w) for any S \approx X_w are topological invariants, with values 2, 2 - 2g (orientable) and 2 - k (non-orientable).

Why it is true

Theorem 2. Proof. (a) A homeomorphism between the boundaries of two convex polygons carrying edges to edges and one gluing to the other extends radially from interior points, as each ray meets a convex boundary once. It carries one relation to the other, so it induces a homeomorphism of the quotients (Exercise 15 of Quotient spaces, or gluing, applied both ways). The other changes leave the gluing itself unchanged. (b) Both copies of x point to the corner m between them, which is a class of its own. Take P to be a triangle with apex m, the copies of x its two sides and U subdividing the base, parametrized by s \in [0, 1]. Send the point (1 - \tau) m + \tau \cdot (\text{base point } s) to \tau \, (\cos 2\pi s, \sin 2\pi s) \in D^2. This continuous surjection from a closed bounded set has as fibers exactly the pairs glued along x, so by Theorems 6, 4(a) and 5 of Quotient spaces, or gluing it identifies P with x glued with D^2, U running once around \partial D^2; gluing the rest afterwards (Theorem 4(b) there) gives X_U. Both v and e drop by one. (c) The diagonal c from the start of U to the start of W splits the polygon into convex polygons U c^{-1} and W c, and the polygon is their disjoint union with c glued (a closed surjection, Theorem 6 there). Gluing is the reverse. Cutting adds one letter and one polygon. The pieces carry c with opposite exponents, so they flip to an orientable complex exactly when, unflipped, every letter has both exponents: when U W is orientable. \square

Theorem 1. Proof. By Theorem 2(a), take P regular with side 1 and each gluing an isometry (for n = 1, reflection or rotation of the circle), and let q : P \to X_w be the quotient map. X_w is a continuous image of P, so compact and connected. Each fiber F is finite. Take \displaystyle 0 < r < \frac{1}{2} less than the distance from each point of F to each edge not containing it, and let U_r(F) be the union of the open balls of radius r in P about the points of F. Such a ball meets the edges only within r of its center, and the gluing isometries carry that part onto the part within r of the partner point, which lies in F; so U_r(F) is open and saturated. Distinct fibers are a positive distance apart, and a smaller r gives disjoint neighborhoods: X_w is Hausdorff. Finally q(U_r(F)) is a ball, two half disks glued along diameters, or, at a vertex, the sectors at the corners in F, each glued along its two radii to radii of others. Following the gluings from sector to sector runs through all of F, which is one class, and closes up, so the sectors form one cycle: a disk, after rescaling each angle to \displaystyle \frac{2\pi}{m}. By Exercise 16 of Quotient spaces, or gluing this is the topology near q(F). \square

Theorem 3. Proof. (a) Cut a U a V along c from the end of the first a to the end of the second, giving U a c^{-1} and V a c. Flip the second to c^{-1} a^{-1} V^{-1} and glue along a: c^{-1} U V^{-1} c^{-1}, which is c c U V^{-1} after rotating and renaming c^{-1} as c. (If U is empty, read a a V clockwise and rename a^{-1} as c; if V is empty, rotate a U a and rename.) (b) Cut along c into a X b Y a^{-1} c^{-1} and Z b^{-1} V c and glue along b: Y a^{-1} c^{-1} a X V c Z. Cut along d into c^{-1} a X V d^{-1} and c Z Y a^{-1} d and glue along a: X V d^{-1} c^{-1} d c Z Y. Read it from d^{-1} and rename d^{-1}, c^{-1} as c, d. (c) The word is a a U V^{-1} with U = b c and V = R^{-1} c b, so (a) read backward gives x b c x R^{-1} c b. Now b is twisted, b (c x R^{-1} c) b (x), and (a) gives y y c x R^{-1} c x^{-1}; then c gives z z x R^{-1} y^{-1} y^{-1} x; then x, read as x (z z) x (R^{-1} y^{-1} y^{-1}), gives u u z z y y R. Rename. \square

Theorem 4. Proof. Cancel pairs x x^{-1} while the length is at least 4. Suppose there are two or more vertex classes. The corners lie on one cycle, so some edge joins classes Q \ne P; rename it a, running from a Q-corner to a P-corner, and let b follow it. Then b \ne a^{-1}, as nothing cancels, and b \ne a, which would glue the two tails, so P = Q. Cut off the triangle a b c^{-1} and glue it to the other copy of b. The P-corner between a and b merges with the corner at the tail of the other b, so P loses a corner. Repeat, cancelling as needed. When P has a single corner, the edge x entering it and the edge leaving it must both carry its two copies, so they read x x^{-1}; cancel, and the class P is gone. Each cancellation shortens the word, so this ends with a a^{-1} or one vertex class.

With one class, Theorem 3(a) moves each twisted letter into an adjacent block, keeping blocks already made (a block x x inside V becomes x^{-1} x^{-1}). If an untwisted letter remains outside blocks, write w = a U a^{-1} V. If every letter in U had both copies in U, the corners from the head of a through U would be glued only among themselves, giving two classes. So some b has one copy in U, and it is untwisted. Theorem 3(b) makes the block c d c^{-1} d^{-1}. A handle beside a twisted block becomes three twisted blocks by Theorem 3(c). Moves keep \chi and the length, hence one class.

The end is a a^{-1} (v = 2, \chi = 2), h_g or t_k. In h_g the a_j glue corner 4j - 4 to 4j - 1 and 4j - 3 to 4j - 2, and the b_j glue 4j - 3 to 4j and 4j - 2 to 4j - 1; in t_k the a_j glue 2j - 2, 2j - 1, 2j. Either way v = 1, so \chi(h_g) = 2 - 2g and \chi(t_k) = 2 - k. Moves keep \chi and twistedness, which fix the end. \square

Theorem 5. Proof. Let D \subseteq P and D' \subseteq Q be small closed round disks inside the polygons of w_1 and w_2; each maps homeomorphically onto a disk in M or N. In P \setminus \operatorname{int} D draw the segment c from the corner where w_1 starts to a point z \in \partial D. Cut along c, it is homeomorphic to a convex polygon with word c^{-1} w_1 c h, h the circle \partial D; likewise d^{-1} w_2 d h^{-1}. Gluing the circles as in Theorem 2(c) gives X_w. The corners of w_1 and of w_2 keep their classes, as both copies of c start at the same corner of P, and the two corners at z form one class. So v = v_1 + v_2 + 1, e = n_1 + n_2 + 2 and \chi(w) = \chi(w_1) + \chi(w_2) - 2, and c, d are untwisted. Now \Sigma_g has an untwisted word with \chi = 0 + (2 - 2(g - 1)) - 2 = 2 - 2g, and Theorem 4 gives h_g, by induction on g. Likewise N_k gives t_k, and M \mathbin{\#} S^2 the normal form of M. \square

Theorem 6. Proof. By Theorems 4 and 5, X_w \approx N_k = \mathbb{RP}^2 \mathbin{\#} N_{k-1}, or \mathbb{RP}^2. In \mathbb{RP}^2, the strip \displaystyle \{(x, y) \in D^2 : |y| \le \frac{1}{2}\} is the image of \displaystyle (s, y) \mapsto (s \sqrt{1 - y^2}, y) on \displaystyle [-1, 1] \times [-\frac{1}{2}, \frac{1}{2}], and its ends are glued by (1, y) \sim (-1, -y): a Möbius band. Remove the disk for the connected sum from \displaystyle \{y > \frac{1}{2}\}. \square

Theorem 7. Proof. Radó (1925) proved that every closed surface is homeomorphic to a complex of triangles in which the triangles at each vertex form one cycle; that proof is beyond this lesson (Thomassen’s proof is Appendix E of Gallier and Xu). If a family of triangles shared no glued edge with the rest, it would share no vertex either, by the cycles, and the surface would be the union of two disjoint nonempty closed images. So the triangles can be ordered with each glued along an edge to an earlier one, and Theorem 2(c) glues them one at a time into one polygon. \square

Theorem 8. Proof. Theorems 7, 4 and 5 give one of the list. That \chi and orientability are invariants, so the list has no repeats, needs homology (Hatcher, chapter 2; Gallier and Xu, chapter 5) and is beyond this lesson. \square

Worked examples

Example 1

Reading a hexagon

Identify X_w for w = a b c a^{-1} c^{-1} b^{-1}.

Solution

Number the corners p_0, \ldots, p_5, with edge i from p_i to p_{i+1}. The two copies of a run p_0 \to p_1 and p_4 \to p_3, so p_0 \sim p_4 and p_1 \sim p_3. The copy b^{-1} runs p_0 \to p_5, so b gives p_1 \sim p_0 and p_2 \sim p_5; the copy c^{-1} runs p_5 \to p_4, so c gives p_2 \sim p_5 and p_3 \sim p_4. The classes are \{p_0, p_1, p_3, p_4\} and \{p_2, p_5\} (Figure 3), so \chi(w) = 2 - 3 + 1 = 0. No letter is twisted, so by Theorems 4 and 5, X_w \approx T^2.

a
b
c
a
c
b
p_0
p_1
p_2
p_3
p_4
p_5
Figure 3Example 1. The four solid corners form one vertex class and the two open corners the other.
Example 2

The sphere as a folded disk

Prove that X_{a a^{-1}} \approx S^2.

Solution

Proof. Here (x, \rho) \sim (x, -\rho) on \partial D^2, where \displaystyle \rho = \sqrt{1 - x^2}. Let

g(x, y) = \left(x,\ \rho \cos \tfrac{\pi y}{\rho},\ \rho \sin \tfrac{\pi y}{\rho}\right), \quad |x| < 1,

and g(\pm 1, 0) = (\pm 1, 0, 0). Then x^2 + \rho^2 = 1, so g maps into S^2, and \lVert g(x, y) - (x, 0, 0) \rVert = \rho \to 0 as |x| \to 1, so g is continuous. For fixed |x| < 1, \displaystyle y \mapsto \frac{\pi y}{\rho} maps [-\rho, \rho] onto [-\pi, \pi], covering the circle of radius \rho in the plane at height x and repeating only at \pm \pi, where g(x, \pm \rho) = (x, -\rho, 0). So g is onto, with fibers \{(x, \rho), (x, -\rho)\} and single points. As D^2 is closed and bounded, Theorems 6, 4(a) and 5 of Quotient spaces, or gluing give X_{a a^{-1}} \approx S^2. \square

Example 3

The Klein bottle

Show that the Klein bottle K of Quotient spaces, or gluing, Example 5, has the word a b a^{-1} b, and find its normal form.

Solution

Read [0, 1]^2 counterclockwise from (0, 0). The bottom is a. The right side, up, is b. The top, read leftward, is glued to the bottom with the same x, so it is a^{-1}. The left side, read down, has (0, 1 - t) \sim (1, t), so it runs along b in step: b. Thus K = X_{a b a^{-1} b}, and b is twisted. Rotate to b\, a^{-1}\, b\, a, which is b U b V with U = a^{-1}, V = a. Theorem 3(a) gives c c a^{-1} a^{-1}, and renaming a^{-1} as d gives c c d d = t_2. So K \approx N_2 = \mathbb{RP}^2 \mathbin{\#} \mathbb{RP}^2, with \chi = 0.

Example 4

A papercraft kit

Isabel designs papercraft kits: paper polygons whose edges carry letters and arrows, taped in pairs with the arrows matching. Samir’s kit has two pentagons, A = a b c a^{-1} d and B = d^{-1} b^{-1} e c^{-1} e. Which closed surface does it describe?

Solution

Rotate A to d\, (a b c a^{-1}); B is d^{-1} (b^{-1} e c^{-1} e). By Theorem 2(c), taping along d gives one octagon,

w = a b c a^{-1} b^{-1} e c^{-1} e.

With corners p_0, \ldots, p_7: a glues p_0 \sim p_4, p_1 \sim p_3; b glues p_1 \sim p_5, p_2 \sim p_4; c glues p_2 \sim p_7, p_3 \sim p_6; e glues p_5 \sim p_7, p_6 \sim p_0. The chain p_0, p_4, p_2, p_7, p_5, p_1, p_3, p_6 is one class, so \chi(w) = 1 - 4 + 1 = -2, which matches v - e + f = 1 - 5 + 2 for the kit. The letter e is twisted, so the kit is N_4, four projective planes. Samir cannot finish it in paper: Isabel’s pattern is non-orientable, and (by a theorem beyond this lesson) no closed non-orientable surface sits in \mathbb{R}^3.

Example 5

A handle among cross-caps

Identify T^2 \mathbin{\#} K, and more generally \Sigma_g \mathbin{\#} N_k.

Solution

By Theorem 5, \Sigma_g \mathbin{\#} N_k has a word with a twisted letter and

\chi = (2 - 2g) + (2 - k) - 2 = 2 - (2g + k).

Theorem 4 gives t_{2g + k}, so \Sigma_g \mathbin{\#} N_k \approx N_{2g + k}. In particular T^2 \mathbin{\#} K \approx N_4, the surface of Example 4. Once a cross-cap is present, each handle is worth two cross-caps.

Example 6

Only spheres sum to a sphere

Prove that if M \mathbin{\#} N \approx S^2, then M \approx N \approx S^2.

Solution

Proof. By Theorem 7, M and N have words, so by Theorem 5 and the invariance in Theorem 8, \chi(M) + \chi(N) - 2 = 2. Each is at most 2 (Theorem 4), so \chi(M) = \chi(N) = 2. If M had a twisted word, so would M \mathbin{\#} N, which would be non-orientable by Theorem 6, unlike S^2. So M and N are orientable with \chi = 2, and Theorem 8 gives M \approx N \approx S^2. \square

Boundaries

  • Compactness. The plane, the open disk and \Sigma_g with a point removed are surfaces outside the list; noncompact surfaces have a far larger classification.
  • Boundary. The Möbius band and the closed disk are not surfaces in this sense. Surfaces with boundary are classified by adding the number of boundary circles.
  • Dimension. Nothing like Theorem 8 holds for closed 4-manifolds: Markov proved that deciding whether two triangulated 4-manifolds are homeomorphic is undecidable.
  • Cancellation fails. T^2 \not\approx K, yet T^2 \mathbin{\#} \mathbb{RP}^2 \approx K \mathbin{\#} \mathbb{RP}^2 \approx N_3 (Example 5, Theorem 5).

Where this goes next

The fundamental group (The fundamental group) tells the list apart as well: by van Kampen’s theorem, for a word with one vertex class, \pi_1(X_w) has one generator per letter and the single relation that w is trivial (Hatcher, section 1.2). Homology turns \chi and orientability into invariants, finishing Theorem 8.

Exercises

Reading a word

  1. Identify X_w for w = a b a b^{-1}.
  2. Identify X_w for w = a b c a b c.
  3. Identify X_w for w = a b c d a^{-1} b^{-1} c^{-1} d^{-1}.
  4. Identify X_w for w = a b c d e a^{-1} b^{-1} c^{-1} d^{-1} e^{-1}.
  5. Identify X_w for w = a b c b^{-1} a^{-1} f c f^{-1}.
  6. Identify X_w for w = a b c a b^{-1} c^{-1}.

Moves

  1. Use Theorems 3(a) and 2(b) to turn a b a b, the square model of \mathbb{RP}^2 in Quotient spaces, or gluing, into c c.
  2. Use Theorems 3(b) and 2(b) to turn a b a^{-1} e b^{-1} e^{-1} into a normal form.
  3. Isabel’s next kit has three squares, a b c d, a^{-1} e c^{-1} f and b^{-1} f^{-1} d e. Show directly that it is not orientable, tape it into one polygon, and identify the surface.

Sums and the list

  1. Identify (a) \mathbb{RP}^2 \mathbin{\#} K \mathbin{\#} T^2; (b) T^2 \mathbin{\#} T^2 \mathbin{\#} T^2.
  2. Find every closed surface S with S \mathbin{\#} \mathbb{RP}^2 \approx N_4.
  3. List every closed surface with \chi \ge -1.
  4. A closed surface has a triangulation in which every vertex lies on exactly 6 triangles. Which surfaces can it be?
  5. Show that a triangulation of a closed surface S with v vertices has e = 3(v - \chi(S)) edges and f = 2(v - \chi(S)) triangles, and find e and f for a triangulation of \mathbb{RP}^2 with 6 vertices.

Proofs

  1. Prove that every closed surface S has \chi(S) \le 2, with equality only for S^2, and that \chi(S) is even when S is orientable.
  2. Prove that a word of length 2n with n odd and a single vertex class has a twisted letter.
  3. Prove that S \mathbin{\#} T^2 \approx S \mathbin{\#} K if and only if the closed surface S is non-orientable.
  4. Prove that a word of length 2n has at most n + 1 vertex classes, with equality only when X_w \approx S^2.
Answers
  1. The four corners form one class: \chi = 1 - 2 + 1 = 0. The letter a is twisted, so X_w \approx N_2 = K.
  2. Classes \{p_0, p_3\}, \{p_1, p_4\}, \{p_2, p_5\}: \chi = 3 - 3 + 1 = 1, twisted, so \mathbb{RP}^2.
  3. One class, \chi = 1 - 4 + 1 = -2, untwisted: \Sigma_2.
  4. Two classes, the even and the odd corners: \chi = 2 - 5 + 1 = -2, untwisted: \Sigma_2.
  5. Three classes, \{p_0, p_5\}, \{p_1, p_4\}, \{p_2, p_3, p_6, p_7\}: \chi = 3 - 4 + 1 = 0, and c is twisted: K.
  6. One class, \chi = 1 - 3 + 1 = -1, twisted: N_3.
  7. a b a b = a U a V with U = V = b; Theorem 3(a) gives c c b b^{-1}, and cancelling b b^{-1} (two letters remain) gives c c.
  8. It is a X b Y a^{-1} Z b^{-1} V with X, Y empty, Z = e, V = e^{-1}. Theorem 3(b) gives c d c^{-1} d^{-1} e e^{-1}; cancelling leaves h_1, the torus.
  9. Letters a, c have opposite exponents in the first two squares, so those are flipped alike; b needs the first and third flipped alike, d needs them flipped differently. Taping along a gives b c d e c^{-1} f; taping on the third along b gives c d e c^{-1} f f^{-1} d e; cancelling gives c d e c^{-1} d e, with classes \{p_0, p_1, p_3, p_4\}, \{p_2, p_5\}: \chi = 2 - 3 + 1 = 0, twisted: K. Check: 3 - 6 + 3 = 0.
  10. (a) \chi = 1 + 0 + 0 - 4 = -3, twisted: N_5. (b) \Sigma_3, with \chi = -4.
  11. \chi(S) = -2 - 1 + 2 = -1, odd, so S is non-orientable (Exercise 15): S \approx N_3.
  12. S^2 (2), \mathbb{RP}^2 (1), T^2 and K (0), N_3 (-1).
  13. Counting corners, 3f = 6v; each edge is on two triangles, 3f = 2e. So \chi = v - 3v + 2v = 0: T^2 or K.
  14. 3f = 2e and v - e + f = \chi give \displaystyle v - \frac{e}{3} = \chi. For \mathbb{RP}^2: e = 3(6 - 1) = 15, f = 10.
  15. S \approx X_w (Theorem 7), and \chi(S) = \chi(w) \le 2 by Theorem 4, with 2 only for a a^{-1}, the sphere. If S is orientable, w is untwisted by Theorem 6, so \chi(w) is even by Theorem 4. \square
  16. \chi(w) = 1 - n + 1 = 2 - n is odd, while untwisted words have even \chi (Theorem 4). \square
  17. If S is non-orientable, its word is twisted, since untwisted words give S^2 or \Sigma_g, which are orientable (Theorem 8). So both sums have twisted words with \chi = \chi(S) - 2 (Theorem 5), and the same normal form (Theorem 4). If S is orientable, S \mathbin{\#} T^2 has an untwisted word and is some \Sigma_g, while S \mathbin{\#} K is non-orientable (Theorem 6); by Theorem 8 they differ. \square
  18. \chi(w) = v - n + 1 \le 2 by Theorem 4, so v \le n + 1. Equality means \chi(w) = 2, which only a a^{-1} has among normal forms; then X_w \approx S^2. \square
math.wiki · updated 2026-11-18 · CC-BY-SA-4.0