The Setting
Let be a discrete group with identity , and let be a finite set of cardinality . The question is how an operator row and an operator column constrain approximation by operators commuting with left translation.
The fibre is the Euclidean space with its standard orthonormal basis .✦ The Hilbert space in (1) consists of square-summable functions from to : (1)✦ Write for the algebra of bounded complex-linear operators on .✦
For a bijection , the coordinate permutation is the complex-linear map defined by (2): (2)✦ The fibre translation representation is the monoid homomorphism given by (3): (3)✦ The translation commutant is the set of bounded operators on commuting with each translation, as in (4): (4)✦
Rows, Columns, and Energy
For , coordinate evaluation and coordinate inclusion are the bounded complex-linear maps in (5): (5) For , its row and column are the bounded maps in (6); its block is their coordinate matrix entry: (6) The norms of rows and columns are operator norms between these Hilbert spaces.
The coefficient matrix of has entries .✦ Its Euclidean norm is the unnormalized Hilbert-Schmidt norm used in (7): (7) The kernel energy of a bounded operator is the sum of the squared Hilbert-Schmidt norms in its identity row, defined by (8): (8)✦
The distance from to the translation commutant is the operator norm infimum in (9): (9)
The Claim
Theorem 1. Every bounded operator has the row summability property (10): (10)✦ Let and , and suppose that a real number satisfies the row and column bounds (11): (11) For every , the energy estimate is (12): (12)✦ When is nonempty, the pointwise bound (13) holds for each such , and the commutant distance satisfies (14): (13)✦ (14)✦
In the paper, the result reads: for countable and a positive integer , let with and , write and , and suppose that , and ; then is finite and every satisfies , with .
What Is Checked
The statements concern bounded complex-linear operators on for an arbitrary discrete group and finite fibre , with translation commutation and the row and column hypotheses specified above; the two distance bounds require to be nonempty.
Coordinate permutations are complex-linear isometries, with the norm identity (15) for every bijection and : (15)