On the sum of superoptimal singular values

Mathematics – Functional Analysis

Scientific paper

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

24 pages

Scientific paper

We discuss the following extremal problem and its relevance to the sum of the so-called superoptimal singular values of a matrix function: Given an $m\times n$ matrix function $\Phi$ on the unit circle $\mathbb{T}$, when is there a matrix function $\Psi_{*}$ in the set $A_{k}^{n,m}$ such that \int_{\mathbb{T}}{\rm trace}(\Phi(\zeta)\Psi_{*}(\zeta))dm(\zeta)=\sup_{\Psi\in A_{k}^{n,m}}|\int_{\mathbb{T}}{\rm trace}(\Phi(\zeta)\Psi(\zeta))dm(\zeta)|? The set $A_{k}^{n,m}$ is defined by A_{k}^{n,m}={\Psi\in H_{0}^{1}: \|\Psi\|_{L^{1}}\leq 1, {\rm rank}\Psi(\zeta)\leq k{a.e.}\zeta\in T}. We introduce Hankel-type operators on spaces of matrix functions and prove that this problem has a solution if and only if the corresponding Hankel-type operator has a maximizing vector. We also characterize the smallest number $k$ for which \int_{\mathbb{T}}{\rm trace}(\Phi(\zeta)\Psi(\zeta))dm(\zeta) equals the sum of all the superoptimal singular values of an admissible matrix function $\Phi$ for some $\Psi\in A_{k}^{n,m}$. Moreover, we provide a representation of any such function $\Psi$ when $\Phi$ is an admissible very badly approximable unitary-valued $n\times n$ matrix function.

No associations

LandOfFree

Say what you really think

Search LandOfFree.com for scientists and scientific papers. Rate them and share your experience with other people.

Rating

On the sum of superoptimal singular values does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with On the sum of superoptimal singular values, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and On the sum of superoptimal singular values will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFWR-SCP-O-265013

  Search
All data on this website is collected from public sources. Our data reflects the most accurate information available at the time of publication.