2000 character limit reached
Symmetric Norm Inequalities And Positive Semi-Definite Block-Matrices
Published 15 Aug 2015 in math.FA and math.OA | (1508.03754v3)
Abstract: For positive semi-definite block-matrix $M,$ we say that $M$ is P.S.D. and we write $M=\begin{pmatrix} A & X\ {X*} & B\end{pmatrix} \in {\mathbb{M}}_{n+m}+$, with $A\in {\mathbb{M}}_n+$, $B \in {\mathbb{M}}_m+.$ The focus is on studying the consequences of a decomposition lemma due to C.~Bourrin and the main result is extending the class of P.S.D. matrices $M$ written by blocks of same size that satisfies the inequality: $|M|\le |A+B|$ for all symmetric norms.
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.