The Setting
Let be a group and , with coefficient inclusion .✦ For , write for its normal closure. A coefficient relation is an element sent to the identity by the canonical coefficient map in (1): (1) The generator of the infinite cyclic group corresponds to .
Relator data consist of a position set , a permutation of , coefficients and integer exponents . When is finite and nonempty and has one cycle, put , choose an enumeration following without repetitions, and put and . The associated cyclic word is (2); identity coefficients are allowed. (2) The exponent sum is the homomorphism that kills and sends to . The word is unimodular when .
Ribbon Diagrams
For permutations of a finite dart set , the permutation cycles of a permutation are the equivalence classes for lying in the same cycle; write for their number. The ribbon components of are the classes of the least equivalence relation on containing the same-cycle relations of and ; write for their number. The ribbon graph is planar when (3) holds, where the boundary permutation applies first: (3) A closed permutation walk for , with , is a list in which consecutive darts satisfy .✦
Let be a disk set with integer orientations . The oriented vertex successor and signed vertex coefficient are defined by (4): (4) For a sign function , a relator disk atlas in is a family of disjoint relator disks with an injection and polarities satisfying (5): (5)
For coefficient labels , the corner coefficient is defined by (6): (6)✦ A finite planar relator ribbon consists of finite sets , permutations satisfying (3), signs , labels , and a relator disk atlas, subject to (7). The outside walk of a finite planar relator ribbon is a closed permutation walk for with distinct darts , and for every entry of . Write , also denoting its set of entries. (7) For signs and coefficients , the dart letter and dart word evaluation are the ordered products in (8): (8) The outside boundary word and the set of words having a finite planar realization are defined in (9): (9)
The Claim
Theorem 1. Suppose is finite and nonempty, has one cycle, and each is or . For the cyclic word in (2), (10)✦ For arbitrary relator data, let have finite planar realizations for those data, and let . Then (11)✦ (12)✦ (13)✦
Suppose is finite and nonempty, has one cycle, each is or , and . Let . For a finite planar relator ribbon with , (14)✦ For a coefficient word having a finite planar realization, (15)✦ For the cyclic word in (2), if , then (16)✦
In the paper, the result reads: a finite conjugate product gives a planar disk-and-band relation, and removing innermost components with trivial inner boundary words makes their exterior words trivial by Theorem 4.1, with repetition leaving .
What Is Checked
The realization statements (10), (11), (12) and (13) concern finite dart and disk sets with the prescribed relator data, and the coefficient statements (14), (15) and (16) impose the single-cycle and unimodularity conditions on nonempty finite position sets with signs in .