2000 character limit reached
Decompositions of Schur block products
Published 8 Nov 2018 in math.OA, math-ph, math.FA, math.MP, math.QA, and math.RT | (1811.03668v3)
Abstract: Given two m x n matrices A = (a_{ij}) and B=(b_{ij}) with entries in B(H), the Schur block product is the m x n matrix A \square B := (a_{ij}b_{ij}). There exists an m x n contraction matrix S = (s_{ij}), such that A \square B = diag(AA*)1/2 S diag(B*B)1/2. This decomposition is also valid for the block Schur tensor product. It is shown, via the theory of random matrices, that the set of contractions S, which may appear in such a decomposition, is a very thin subset of the unit ball of M_n(B(H)).
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.