Norm optimal factorizations of scalar and block matrices

preprint2023arXivOpen access

Abstract

For an m×nm \times n complex matrix XX of rank rr with Schur multiplier SXS_X we show that there exist an r×m r \times m complex matrix LL and an r×n r\times n complex matrix RR such that X=L∗RX = L^*R and ∥SX∥ = ∥diag(L∗L)∥12∥diag(R∗R)∥12,\|S_X\|\, =\, \|\mathrm{diag} (L^*L) \|^{\frac{1}{2}} \| \mathrm{diag} (R^*R) \| ^{\frac{1}{2}}, and the norm condition is optimal. Let the completely bounded norm of the bilinear form BXB_X induced by XX on (Cm,∥.∥∞)×(Cn,∥.∥∞)(\mathbb{C}^m, \|.\|_\infty) \times (\mathbb{C}^n, \|.\|_\infty) be denoted ∥BX∥cb,\|B_X\|_{cb}, then XX has a factorization X=Δ(η)∗CΔ(ξ) X = Δ(η)^* C Δ(ξ) with ηη in Cm,\mathbb{C}^m, ξξ in Cn\mathbb{C}^n such that the outer factors are diagonal operators with ∥ξ∥2=∥η∥2=1\|ξ\|_2 = \|η\|_2=1 and CC has operator norm equal to ∥BX∥cb,\|B_X\|_{cb}, and the norm condition is optimal. A generalization to operator valued Schur block multipliers is presented too.

Explore this paper’s authors, topics and related work.

Building this map preview

BZPEER is loading the nearby papers, people, topics and institutions for this page.

Reviews 0

Write a reviewWrite

No reviews yet.

Discussion 0

Add a commentWrite

No comments yet.