Norm optimal factorizations of scalar and block matrices

Abstract

For an m × n complex matrix X of rank r with Schur multiplier SX we show that there exist an r × m complex matrix L and an r× n complex matrix R such that X = L*R and \|SX\|\, =\, \|diag (L*L) \|12 \| diag (R*R) \| 12, and the norm condition is optimal. Let the completely bounded norm of the bilinear form BX induced by X on (Cm, \|.\|∞) × (Cn, \|.\|∞) be denoted \|BX\|cb, then X has a factorization X = (η)* C () with η in Cm, in Cn such that the outer factors are diagonal operators with \|\|2 = \|η\|2=1 and C has operator norm equal to \|BX\|cb, and the norm condition is optimal. A generalization to operator valued Schur block multipliers is presented too.

0

Turn this paper into a full lesson

ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.

Discussion (0)

Sign in to join the discussion.

Loading comments…