The Setting
The boundary components of disks joined by bands carry products in a coefficient group . The disk coefficients and the directions in which bands meet the disks determine these products.
Let and be finite sets, write and , and take a permutation of , coefficients , and signs with . When is a single cycle, number in its cyclic order. Let generate an infinite cyclic group; the associated unimodular word is (1), and identity coefficients are allowed. (1)
Let and be the positive and negative copies of , with and denoting the copies of ; the signed slot set in (2) has one slot for each on each signed disk. (2) The disk successor is the permutation advancing around each signed disk, and the traversal sign records its direction at a slot, as in (3). (3) The incidence coefficient is the inverse geometric corner label defined by (4). (4)✦ A band pairing of is an involution reversing traversal signs: and .
For a permutation of a finite set , labels , a nonnegative integer , and a slot , the circuit weight is the product of the first labels encountered from , with the last encountered label on the left, defined by (5). (5)✦ Let index boundary circuits, with positive lengths , and let be a bijection; write . Such a bijection is a boundary enumeration when . The boundary product is the circuit weight in (6). (6)
Ribbon Components and Corners
For a permutation of a finite slot set , its cycle set is the set of equivalence classes under lying in the same -cycle✦, and its cycle count is .✦ The class count of an equivalence relation on is .✦ For permutations of , ribbon components are the equivalence classes generated by the cycles of and ; let be their number.✦ A pair of permutations of a finite slot set is connected when any two slots belong to the same ribbon component, and planar when the cycle counts satisfy (7). (7) For permutations of a finite slot set and a function , the corner coefficient is the function defined by (8). (8)✦
For the relator corner statement, take a finite vertex set , orientations , and a bijection . The oriented vertex successor is the permutation of given in (9), and the signed vertex coefficient is the function given there. (9) The disk successor on is the permutation satisfying , and the traversal sign is the function satisfying ; a band pairing on is an involution satisfying .
The Claim
Theorem 1. For the signed slots , suppose the disk and band moves connect any two slots, and take a boundary enumeration indexed by . Assume the Euler identity (10). (10) If and for every , then (11)✦
For the corner statement on , suppose and are nonempty, has a single cycle, and the ribbon data are connected and planar. Let and . If for every , then (12)✦
For the relator corner statement on , suppose is nonempty, has a single cycle, and the ribbon data are connected and planar. Let and . If whenever , then (13)✦
In the paper, the result reads: let be a connected surface of genus zero constructed from a nonempty finite collection of word disks for and bands using every slot exactly once and joining opposite traversal signs; if every boundary word except possibly one is trivial in , then the remaining boundary word is trivial as well.
What Is Checked
The boundary assertion (11) is stated over finite signed slots with a complete enumeration of boundary cycles, while the corner assertions (12) and (13) are stated over connected ribbon data with planarity in the sense of (7).