The Setting
A boundary diagram on labels records how a block with a left and a right boundary is crossed: which edges run through it from one boundary to the other, and which come back out on the side they entered. Diagrams of adjacent blocks multiply, and a path of the product may bounce between the two blocks any number of times before it leaves.
Following the crossings of a diagram in one direction, with returns at the boundaries in between, some labels lie on loops, and these fall into the recurrent classes of . When is idempotent and a diagram of its corner replaces it, a class may lose all its loops; it is then missing from . The question is how such losses combine under the product: whether can lose a class that both and keep, and whether a power of can lose a class that keeps.
Diagrams and Their Product
A boundary diagram on labels is a quadruple of relations on two copies and of an -element label set, (1)✦ the forward relation , whose edges enter on the left and exit on the right, the backward relation , whose edges enter on the right and exit on the left, and the left and right relations and , whose edges enter and exit on the left and on the right respectively. The set of boundary diagrams on labels is .
Relations compose in path order: when and for some . The reflexive transitive closure of a relation on a set is the relation on , where is the identity relation on and .✦
The product of two boundary diagrams and on labels is the boundary diagram of glued to the left of , with the four relations (2)✦ Powers of a diagram are taken under this product.
A boundary diagram on labels is idempotent when . A boundary diagram on labels is nested in a boundary diagram on labels, written , when and . The corner of a boundary diagram on labels is the set of diagrams nested in .✦
Recurrent and Missing Classes
A sign is or . The through relation of a boundary diagram at a sign is the relation on of its crossings in the direction of : and .✦ The loop closure of a boundary diagram at is the relation on that closes up the alternating returns at a boundary: and .✦
For boundary diagrams and on labels, the recurrence relation of at and the surviving relation of relative to at are the relations on obtained by placing the loop closure of on both sides of the through relation of and of : (3)
The set of signed recurrent classes of a boundary diagram consists of the pairs of a sign and a set of labels such that, for some label with , (4)✦
For boundary diagrams and , the set of classes missing from consists of the signed recurrent classes of none of whose labels has a loop in the surviving relation of relative to : (5)✦
The Claim
Theorem 1. Let be a boundary diagram on labels. Then (6)✦ If moreover is idempotent, then for all diagrams and in the corner of (7)✦ and for every diagram in the corner of and every natural number (8)✦
In the paper, the result reads: for an idempotent and , and , and in particular for every , with the corner of .
What Is Checked
The claim is stated over boundary diagrams on labels and their product, the corner of a diagram, and the sets of missing recurrent classes, built from the through relations, the loop closures, and the recurrence and surviving relations at each sign.