<p>We explore <InlineEquation ID="IEq4"> <EquationSource Format="TEX">\( C^* \)</EquationSource> </InlineEquation>-convexity as a framework for constructing operator norms on matrix algebras, generalizing classical convexity to non-commutative settings. We construct a one-parameter family of norms on <InlineEquation ID="IEq5"> <EquationSource Format="TEX">\({\mathbb {M}}_n\)</EquationSource> </InlineEquation> whose unit balls are <InlineEquation ID="IEq6"> <EquationSource Format="TEX">\(C^*\)</EquationSource> </InlineEquation>-convex and admit a characterization by <InlineEquation ID="IEq7"> <EquationSource Format="TEX">\(2\times 2\)</EquationSource> </InlineEquation> block matrix positivity. This family forms a log-convex interpolation path from the spectral norm (<InlineEquation ID="IEq8"> <EquationSource Format="TEX">\(\alpha = 0\)</EquationSource> </InlineEquation>) to the numerical radius (<InlineEquation ID="IEq9"> <EquationSource Format="TEX">\(\alpha = 1\)</EquationSource> </InlineEquation>), with dual <i>L</i>-norms connecting the trace norm to the dual numerical radius. We derive explicit dual norm formulas and demonstrate that these norms are computable via semidefinite programming, achieving exact linear matrix inequalities for dyadic <InlineEquation ID="IEq10"> <EquationSource Format="TEX">\(\alpha \)</EquationSource> </InlineEquation>. Furthermore, we prove complete contractivity of these norms under unital completely positive maps, enhancing their relevance to quantum channels.</p>

错误:搜索内容不能为空,请输入英文关键词
错误:关键词超出字数限制,请精简
高级检索

Interpolating \(C^*\)-convex norms: theory and computations

  • Mohsen Kian

摘要

We explore \( C^* \) -convexity as a framework for constructing operator norms on matrix algebras, generalizing classical convexity to non-commutative settings. We construct a one-parameter family of norms on \({\mathbb {M}}_n\) whose unit balls are \(C^*\) -convex and admit a characterization by \(2\times 2\) block matrix positivity. This family forms a log-convex interpolation path from the spectral norm ( \(\alpha = 0\) ) to the numerical radius ( \(\alpha = 1\) ), with dual L-norms connecting the trace norm to the dual numerical radius. We derive explicit dual norm formulas and demonstrate that these norms are computable via semidefinite programming, achieving exact linear matrix inequalities for dyadic \(\alpha \) . Furthermore, we prove complete contractivity of these norms under unital completely positive maps, enhancing their relevance to quantum channels.