Subscribe to the gold package and get unlimited access to Shamra Academy
Register a new userAnother determinantal inequality involving partial traces
466
0
0.0
(
0
)
Ask ChatGPT about the research
No Arabic abstract
Let $A$ be a positive semidefinite $mtimes m$ block matrix with each block $n$-square, then the following determinantal inequality for partial traces holds [ (mathrm{tr} A)^{mn} - det(mathrm{tr}_2 A)^n ge bigl| det A - det(mathrm{tr}_1 A)^m bigr|, ] where $mathrm{tr}_1$ and $mathrm{tr}_2$ stand for the first and second partial trace, respectively. This result improves a recent result of Lin [14].
rate research
Read More
Let $A$ be an $mtimes m$ positive semidefinite block matrix with each block being $n$-square. We write $mathrm{tr}_1$ and $mathrm{tr}_2$ for the first and second partial trace, respectively. In this note, we prove the following inequality [ (mathrm{tr} A)I_{mn} - (mathrm{tr}_2 A) otimes I_n ge pm bigl( I_motimes (mathrm{tr}_1 A) -Abigr). ] This inequality is not only a generalization of Andos result [1], but it also could be regarded as a complement of a recent result of Choi [8]. Additionally, some new partial traces inequalities for positive semidefinite block matrices are also included.
We revisit and comment on the Harnack type determinantal inequality for contractive matrices obtained by Tung in the nineteen sixtieth and give an extension of the inequality involving multiple positive semidefinite matrices.
Consider a set represented by an inequality. An interesting phenomenon which occurs in various settings in mathematics is that the interior of this set is the subset where strict inequality holds, the boundary is the subset where equality holds, and the closure of the set is the closure of its interior. This paper discusses this phenomenon assuming the set is a Voronoi cell induced by given sites (subsets), a geometric object which appears in many fields of science and technology and has diverse applications. Simple counterexamples show that the discussed phenomenon does not hold in general, but it is established in a wide class of cases. More precisely, the setting is a (possibly infinite dimensional) uniformly convex normed space with arbitrary positively separated sites. An important ingredient in the proof is a strong version of the triangle inequality due to Clarkson (1936), an interesting inequality which has been almost totally forgotten.
Olkin [3] obtained a neat upper bound for the determinant of a correlation matrix. In this note, we present an extension and improvement of his result.
Let $T=begin{bmatrix} X &Y 0 & Zend{bmatrix}$ be an $n$-square matrix, where $X, Z$ are $r$-square and $(n-r)$-square, respectively. Among other determinantal inequalities, it is proved $det(I_n+T^*T)ge det(I_r+X^*X)cdot det(I_{n-r}+Z^*Z)$ with equality holds if and only if $Y=0$.
Log in to be able to interact and post comments
comments
Fetching comments
Sign in to be able to follow your search criteria
