The Setting
In a disk and band assembly, a boundary phase prescribes the total of real slot phases along a boundary component. Slots paired across a band must carry opposite phases.
Let be a finite set of slots and a finite set of boundary labels. A boundary assignment is a function from the slot set to the boundary label set . The disk successor is a permutation of ; the band pairing is an involution of , so for every . The boundary permutation is .
The oriented dual adjacency on is the relation defined by (1): (1)✦ The reachability relation on is the relation in which means that a finite sequence of directed adjacency steps joins to , allowing a sequence of length zero. The dual adjacency relation on is connected when for every .
The Claim
Theorem 1. Suppose that is surjective, that for every , and that any two slots can be joined by a finite sequence of moves or . Then (2)✦
Let be any boundary assignment, with nonempty, and let be an involution whose dual adjacency is connected. For real boundary phases satisfying , there is a function such that (3)✦
In the paper, the result reads: for a connected assembly the dual graph on boundary cycles is connected, and every assignment of real boundary phases with admits slot phases with and .
What Is Checked
The statements (2) and (3) concern finite slot and boundary sets, a boundary assignment, and a band involution, with a disk successor and connected slot moves in (2), and connected dual adjacency and a nonempty boundary set in (3).