The Setting
Let be a discrete group, let and be finite sets, and choose vectors and elements for . An endpoint assignment chooses, for each and , the row or the column of the labelled edge from to . These choices divide a finite sum of rank-one shifts into a masked operator and its complement. The labels in remain distinct when their group elements coincide.
The fibre is the complex Euclidean space of dimension , with inner product (1). (1) The Hilbert sum of a family of complex Hilbert spaces consists of the square-summable coordinate families, with norm given by (2); write . (2)
For , the coordinate inclusion is the complex-linear map that places a vector at and zero elsewhere✦, and the coordinate evaluation is the complex-linear map that sends to .✦ For a bounded complex-linear operator and , its operator row at and operator column at are the compositions in (3). (3)
Synthesis and Masked Operators
The bounded complex-linear synthesis operator associated to forms the linear combination in (4). (4)✦ For the family , a subfamily synthesis bound is a pair such that every subfamily with at most labels, including the empty subfamily, satisfies (5). (5)✦
For a bijection , the coordinate permutation is the complex-linear map in (6).✦ Right translation for is the coordinate permutation induced by right multiplication by . (6)✦
For bounded operators with a common bound , where , the direct sum on is the bounded complex-linear operator in (7). (7)✦
Let satisfy . The rank-one operator and its weighted rank-one shift are defined by (8). (8)✦ The masked operator is the finite sum in (9)✦; the unmasked operator has constant coefficient one.✦ (9)
A Boolean endpoint assignment is a map that assigns each labelled edge to its row when its value is and to its column when its value is . For a Boolean endpoint assignment , the Boolean indicator and the oriented assignment operator are the function and bounded complex-linear operator given by (10). (10) The row-one set and column-zero set are the sets of labels assigned to the indicated endpoints, as in (11). (11)
The Claim
Theorem 1. Let and . Suppose has the subfamily synthesis bound (5) with .
Suppose every row-one set has cardinality at most . Then the row bound (12) holds for every . (12)✦ Suppose instead that every column-zero set has cardinality at most . Then the complementary column bound (13) holds for every . (13)✦ For the chosen frame bound , the upper bound in each estimate is .
In the paper, the result reads: under the preceding hypotheses and endpoint-assignment bounds, with , one has for every and for every .
What Is Checked
The row and complementary column estimates are stated over arbitrary discrete groups, finite label and fibre sets, the subfamily synthesis bound at , and the respective endpoint cardinality bounds.
The coordinate permutation of (6) satisfies (14). (14)✦ The Boolean indicator used in (10) satisfies the coefficient bound (15). (15)✦