English

Weak log majorization and determinantal inequalities

Functional Analysis 2016-11-17 v1

Abstract

Denote by n\P_n the set of n×nn\times n positive definite matrices. Let D=D1DkD = D_1\oplus \dots \oplus D_k, where D1n1,,DknkD_1\in \P_{n_1}, \dots, D_k \in \P_{n_k} with n1++nk=nn_1+\cdots + n_k=n. Partition CnC\in \P_n according to (n1,,nk)(n_1, \dots, n_k) so that \DiagC=C1Ck\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 λ(A)\lambda(A) denotes the vector of eigenvalues of A\CnnA\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.

Keywords

Cite

@article{arxiv.1611.05108,
  title  = {Weak log majorization and determinantal inequalities},
  author = {Tin-Yau Tam and Pingping Zhang},
  journal= {arXiv preprint arXiv:1611.05108},
  year   = {2016}
}
R2 v1 2026-06-22T16:53:44.970Z