Reading Orientation from a Boundary Word
A polygon boundary word records which sides are identified and the direction in which each side is traversed around the polygon. That directional information can detect whether orientations on the polygon fit together after gluing. The essential check is local: across each identified pair of edges, do the two boundary directions agree in the way an oriented surface requires?
We consider a polygonal model with one polygonal face, in which every edge is paired with exactly one other edge and the quotient is a surface. Assume the boundary word uses each edge label exactly twice. As in the standard word notation, an occurrence \(a\) is positive and an occurrence \(a^{-1}\) is negative. These signs record whether the polygon boundary traverses that side in the chosen positive direction for label \(a\), or in the reverse direction.
For a polygonal face, its boundary direction is the one that runs with the interior of the polygon on the left. If the orientation of the face is reversed, every boundary direction reverses too. When two sides are glued, their boundary directions must be opposite in order for orientations on the two sides to fit together. This condition is the basis of the test.
The Sign Criterion
Proof. Fix a label \(a\), and let its two occurrences have signs \(s_1,s_2\in\{+1,-1\}\). Give the polygon either of its two possible orientations, and encode that choice by \(\varepsilon\in\{+1,-1\}\), where changing the polygon orientation changes \(\varepsilon\) to \(-\varepsilon\). The two induced boundary directions, measured against the chosen positive direction for \(a\), are \(\varepsilon s_1\) and \(\varepsilon s_2\). For orientations to fit across the glued edge, these directions must be opposite. Thus the required equation is \(\varepsilon s_1=-\varepsilon s_2\). Since \(\varepsilon\ne0\), this equation holds exactly when \(s_1=-s_2\).
The same choice \(\varepsilon\) applies to every edge occurrence because there is only one polygonal face. Therefore a consistent orientation exists precisely when every paired label has opposite signs. This edge condition is sufficient as well as necessary: it makes the orientations agree across the interior of each glued edge, and at a vertex the sectors around it inherit the same orientation successively across their paired edges. Since the quotient is assumed to be a surface, a neighborhood of each vertex is a disk, so these compatible sector orientations give a local orientation there too. Hence the choices define an orientation on the whole surface exactly under the stated sign condition. \(\square\)
The criterion concerns each pair separately. Reversing the orientation of the whole polygon changes all signs at once, so it cannot turn a same-sign pair into an opposite-sign pair. Likewise, renaming a label by replacing \(a\) with \(a^{-1}\) flips both signs of that pair and does not change whether they are opposite.
For each label, locate its two occurrences in the word.
Write \(+1\) for a positive occurrence and \(-1\) for a negative occurrence.
Opposite signs for every label mean the orientation check passes; one same-sign pair is enough for it to fail.
Worked Polygon Words
Worked Example: The Torus Word
Consider the paired-square boundary word \(aba^{-1}b^{-1}\). We test the two edge pairs separately.
Label \(a\). The first occurrence is \(a\), with sign \(+1\). The other is \(a^{-1}\), with sign \(-1\). Their product is \((+1)(-1)=-1\), so the signs are opposite.
Label \(b\). The occurrence \(b\) has sign \(+1\), and \(b^{-1}\) has sign \(-1\). Their product is \((+1)(-1)=-1\), so these signs are opposite too.
Both paired labels pass the criterion, so the surface is orientable. Check: choose the displayed orientation of the square, \(\varepsilon=+1\). The boundary directions for \(a\) are \(+1\) and \(-1\), and those for \(b\) are \(+1\) and \(-1\); each pair is opposite across its glued edge.
Worked Example: The Projective-Plane Word
Consider the one-label word \(aa\). The two occurrences of \(a\) are both positive, so their signs are \(+1,+1\). The criterion requires the second sign to equal the negative of the first, namely \(-1\), but it is \(+1\). Thus the pair fails the test.
Changing the polygon orientation does not fix the failure. With \(\varepsilon=+1\), the two induced directions are \(+1,+1\). With \(\varepsilon=-1\), they are \(-1,-1\). In neither case are they opposite. The resulting surface is nonorientable. Check: the equation for consistency would be \(\varepsilon(+1)=-\varepsilon(+1)\), or \(\varepsilon=-\varepsilon\), which has no solution in \(\{+1,-1\}\).
Worked Example: The Klein-Bottle Word
Consider the word \(aba^{-1}b\). There are two pairs to inspect; passing one pair does not settle the test.
Label \(a\). Its signs are \(+1\) for \(a\) and \(-1\) for \(a^{-1}\). Their product is \((+1)(-1)=-1\), so this pair passes.
Label \(b\). Both occurrences are \(b\), so its signs are \(+1,+1\). Their product is \((+1)(+1)=+1\), so this pair fails. Since at least one pair fails, the surface is nonorientable. Check: with either \(\varepsilon=+1\) or \(\varepsilon=-1\), the two directions for the \(b\)-edges remain equal, not opposite.
Why the Pair-by-Pair Check Matters
A boundary word is a compact record of many edge identifications, but orientability is not decided by whether the word contains both positive and negative symbols somewhere. Each label represents a specific glued pair, and the two occurrences of that same label must have opposite signs. The torus word passes because both pairs do; the Klein-bottle word fails because its \(b\)-pair does not.
Common mistake. For \(aba^{-1}b\), one might notice that \(a\) and \(a^{-1}\) occur and conclude that the word has the opposite directions needed for orientability. This checks only the \(a\)-pair. The \(b\)-pair is \(b,b\), with signs \(+1,+1\), so the condition fails. The correction is to make a separate two-sign comparison for every label before drawing a conclusion.
This is a test for the stated polygonal surface models: the edges are paired, each label occurs exactly twice, and the quotient is a surface. The assumption that the quotient is a surface matters because the orientation argument uses disk neighborhoods at vertices. The test does not identify a surface type from its word; it answers the narrower question of whether the edge identifications allow a consistent orientation.
Check Your Understanding
For each word, list the two signs for every label before deciding whether the orientation criterion passes.
- Apply the criterion to \(xyx^{-1}y^{-1}\). Which pair comparisons determine the result?
- Apply the criterion to \(cdefc^{-1}d^{-1}e^{-1}f^{-1}\).
- For the word \(pqp^{-1}q\), identify the pair that fails and explain why the other pair cannot repair it.
- Explain why reversing the orientation of the polygon cannot change whether a pair of occurrences has opposite signs.
- Write the consistency equation for a pair whose two occurrences are both negative, and decide whether it has a solution for \(\varepsilon\in\{+1,-1\}\).