Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
144 tokens/sec
GPT-4o
7 tokens/sec
Gemini 2.5 Pro Pro
46 tokens/sec
o3 Pro
4 tokens/sec
GPT-4.1 Pro
38 tokens/sec
DeepSeek R1 via Azure Pro
28 tokens/sec
2000 character limit reached

Weak log majorization and determinantal inequalities (1611.05108v1)

Published 16 Nov 2016 in math.FA

Abstract: Denote by $\P_n$ the set of $n\times n$ positive definite matrices. Let $D = D_1\oplus \dots \oplus D_k$, where $D_1\in \P_{n_1}, \dots, D_k \in \P_{n_k}$ with $n_1+\cdots + n_k=n$. Partition $C\in \P_n$ according to $(n_1, \dots, n_k)$ so that $\Diag C = C_1\oplus \dots \oplus C_k$. We prove the following weak log majorization result: \begin{equation*} \lambda (C{-1}_1D_1\oplus \cdots \oplus C{-1}kD_k)\prec{w \,\log} \lambda(C{-1}D), \end{equation*} where $\lambda(A)$ denotes the vector of eigenvalues of $A\in \Cnn$. The inequality does not hold if one replaces the vectors of eigenvalues by the vectors of singular values, i.e., \begin{equation*} s(C{-1}_1D_1\oplus \cdots \oplus C{-1}kD_k)\prec{w \,\log} s(C{-1}D) \end{equation*} is not true. As an application, we provide a generalization of a determinantal inequality of Matic \cite[Theorem 1.1]{M}. In addition, we obtain a weak majorization result which is complementary to a determinantal inequality of Choi \cite[Theorem 2]{C} and give a weak log majorization open question.

Summary

We haven't generated a summary for this paper yet.