Related papers: A matrix subadditivity inequality for symmetric no…

Several subadditivity results and conjectures are given for matrices (or operators), block-matrices, concave functions and norms.

Some subadditivity results involving symmetric (unitarily invariant) norms are obtained. For instance, if $g(t)=\sum_{k=0}^m a_kt^k$ is a polynomial of degree $m$ with non-negative coefficients, then, for all positive operators $A,\,B$ and…

Let f be a non-negative concave function on the positive half-line. Let A and B be two positive matrices. Then, for all symmetric norms, || f(A+B) || is less than || f(A)+f(B) ||. When f is operator concave, this was proved by Ando and…

Some rearrangement inequalities for symmetric norms on matrices are given as well as related results for operator convex functions.

This short but self-contained survey presents a number of elegant matrix/operator inequalities for general convex or concave functions, obtained with a unitary orbit technique. Jensen, sub or super-additivity type inequalities are…

We review some convexity inequalities for Hermitian matrices an add one more to the list.

Subaddivity type matrix inequalities for concave funcions and symetric norms are given.

Sub-additive and super-additive inequalities for concave and convex functions have been generalized to the case of matrices by several authors over a period of time. These lead to some interesting inequalities for matrices, which in some…

The main purpose of this paper is to englobe some new and known types of Hermitian block-matrices $M=\begin{pmatrix} A \& X\\ {X^*} \& B\end{pmatrix}$ satisfying or not the inequality $\|M\|\le \|A+B\|$ for all symmetric norms

Let H be a positive semidefinite matrix partitioned into Hermitian blocks. Then, up to a direct sum operation, H is the average of matrices isometrically congruent to its partial trace. A few corollaries are given, related to important…

Several matrix/operator inequalies are given. Most of them are unexpected extensions of the Araki Log-majorization theorem, obtained thanks to a new log-majorization for positive linear maps and normal operators (Theorem 2.9). The main idea…

Matrix versions of some basic convexity inequalities are given. Further results on the same topic are proved in the recent papers on arxiv: 1. Hermitian operators and convex functions, 2. A concavity inequality for symmetric norms, 3.…

In this article, we present a new subadditivity behavior of convex and concave functions, when applied to Hilbert space operators. For example, under suitable assumptions on the spectrum of the positive operators $A$ and $B$, we prove that…

We present several matrix and operator inequalities of Hermite-Hadamard type. We first establish a majorization version for monotone convex functions on matrices. We then utilize the Mond-Pecaric method to get an operator version for convex…

For a positive semidefinite matrix $H= \begin{bmatrix} A&X\\ X^{*}&B \end{bmatrix} $, we consider the norm inequality $ ||H||\leq ||A+B|| $. We show that this inequality holds under certain conditions. Some related topics are also…

Jensen inequalities for positive linear maps of Choi and Hansen-Pedersen type are established for a large class of operator/matrix means. These results are also extensions of the Minkowski determinantal inequality. To this end we develop…

Some inequalities for positive linear maps on matrix algebras are given, especially asymmetric extensions of Kadison's inequality and several operator versions of Chebyshev's inequality. We also discuss well-known results around the matrix…

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…

The main goal of this paper is to discuss the recent advancements of operator means for accretive matrices in a more general setting. In particular, we present the general form governing the well established definition of geometric mean,…

Matrix concentration inequalities provide a direct way to bound the typical spectral norm of a random matrix. The methods for establishing these results often parallel classical arguments, such as the Laplace transform method. This work…