The Setting
Let be a discrete group and let be a family indexed by a finite set . Each pair labels an edge from the row vertex to the column vertex . Assigning each edge to one of its endpoints asks how many assigned edges must meet a single vertex. The operator associated with the family acts on the complex Hilbert space of square-summable complex functions on .
For a bijection , the coordinate permutation on is the complex-linear map defined by (1). (1)✦ The right regular representation is the homomorphism from into the bounded complex-linear operators on given by (2); for , the operator is the coordinate permutation associated with right multiplication by . (2) A convolution operator for the family is a bounded complex-linear operator on satisfying (3). (3)
An endpoint mask for a family is a function , where assigns an edge to its row and assigns it to its column. For an endpoint mask for and vertices , the row one set and column zero set are the subsets of defined in (4). (4)
For a nonnegative integer , the set of words on the finite alphabet consists of ordered sequences of length , with a single empty word at length zero.✦ For a word , its product is defined by (5). Distinct words retain their labels when their products coincide. (5)✦
For , the left translation on the space of bounded complex functions on is the operator defined by (6). (6) The group is amenable if there is a complex-linear functional satisfying (7); the condition means that every value of is real and nonnegative. (7)✦
For a set of edges with row map and column map , and for , an endpoint slot is a pair consisting of a row or column vertex and one of places at that vertex. For , put . The set of slots available to an edge is the finite subset in (8) of the disjoint union . (8)✦
The Claim
Theorem 1. Let and be endpoint maps, and let . Suppose every finite set satisfies . There is an injective endpoint assignment as in (9). (9)✦
Let be a finite labelled family, and let be its convolution operator from (3). If for , there is an endpoint mask satisfying (10). (10)✦
Put . Suppose and . For every integer , there is a mask on the word labels satisfying (11). (11)✦
If is nonamenable, there are a finite subset containing , with , and a real number such that, for every integer , there is a mask satisfying (12); here is the word product for the inclusion . (12)✦
In the paper, the result reads: for a countable nonamenable group and as in Lemma 3.1, every gives a list of all length- products from , with multiplicity and , and, with , there is a function such that each row has at most indices with and each column has at most indices with .
What Is Checked
The endpoint assignment is stated over arbitrary sets of edges and vertices, and the group assignments over arbitrary discrete groups with finite label sets and the stated operator or nonamenability hypotheses.
Coordinate permutation on is isometric: for every bijection , the map satisfies (13). (13)✦