The Setting
Finite sums of right translations with rank-one fibre coefficients give operators on Hilbert spaces over a discrete group. An endpoint assignment allows these coefficients to depend on the row. Proposition 4.4 concerns the change in the resulting operator under left translation.
Let be a discrete group with identity , and a finite set. The fibre is the complex Euclidean space of dimension , with inner product as in (1). The group Hilbert space consists of square-summable fibre-valued functions, with the norm in (1); denotes its bounded complex-linear operators. (1)
For a family of normed abelian groups, its Hilbert sum consists of families with , and has squared norm equal to this sum.✦ When the summands are complex Hilbert spaces, a family of bounded complex-linear operators with common bound , where , defines the direct sum operator in (2). (2)✦
For a bijection , the coordinate permutation on is the complex-linear map specified in (3). The fibre-valued left regular representation is a monoid homomorphism, and denotes right translation by ; their actions are also given in (3). (3)
The stage associated with a sequence of nonnegative integers is the Hilbert space in (4). Write for its left regular representation. (4)✦
The translation commutant is the set of bounded operators on commuting with every left translation, as in (5).✦ (5)✦
Assignment Operators
Let be a finite label set, with families and . Labels remain distinct even when their group elements coincide. For a complex mask with , the weighted rank-one shift and the masked operator are defined in (6). Here the direct sum acts over the rows , and is the rank-one operator displayed there. (6) The rank-one factor has norm , which is also a common bound for the fibre maps .
A Boolean mask assigns the labelled edge from row to column to its row when true and to its column when false. The complex indicator of a Boolean mask on is the complex-valued function on with the values in (7). The constant assignment operator and the oriented assignment operator associated with are the masked operators on specified in (7). (7)
The row-one set and the column-zero set are the sets of labels assigned to those respective endpoints, given by (8). (8)
For any family in , with an arbitrary index set, and a finite subset , the synthesis operator forms linear combinations of the vectors with labels in , as in (9).✦ (9)✦ For a family in , a subfamily synthesis bound is a pair consisting of a nonnegative integer and a real number for which (10) holds, including the empty subfamily. (10)✦
For a monoid homomorphism into a unital ring and , conjugation is a map from to itself, and the coboundary is a function from to , with values specified in (11). The group inverse supplies the inverse of . (11) For the oriented assignment operator, write .
The Claim
Theorem 1. Let be a discrete group. On the stages associated with any dimension sequence, left translation satisfies (12). (12)✦ For arbitrary finite label and fibre sets and arbitrary families , the constant assignment operator satisfies (13). (13)✦ Let be a nonnegative integer and . Suppose has subfamily synthesis bound and every row-one set and column-zero set in (8) has cardinality at most . The oriented assignment coboundary satisfies (14). (14)✦ For any monoid homomorphism into a unital ring and , the coboundary satisfies (15) and (16). (15)✦ (16)✦
In the paper, the result reads: under the preceding hypotheses and endpoint-assignment bounds, is a unitary representation and commutes with every , while satisfies for the chosen frame bound , , and for all .
What Is Checked
The stage assertion is stated over arbitrary discrete groups and dimension sequences starting at zero. The masked operator assertions use finite label and fibre sets, with the synthesis and endpoint bounds required for (14); the identities (15) and (16) are stated in arbitrary unital rings.
The coordinate permutation isometry has the norm identity (17) for every bijection of . (17)✦ For the Boolean coefficients in (7), the modulus bound is (18). (18)✦