Weak log majorization and determinantal inequalities
Tin-Yau Tam, Pingping Zhang

TL;DR
This paper establishes a weak log majorization inequality for eigenvalues of certain block matrices derived from positive definite matrices, generalizes a known determinantal inequality, and explores related inequalities and open questions.
Contribution
It introduces a new weak log majorization result for eigenvalues of block matrices, extending previous determinantal inequalities and highlighting differences with singular value inequalities.
Findings
Proves a weak log majorization inequality for eigenvalues of block matrices.
Shows that the eigenvalue inequality does not hold for singular values.
Provides a generalization of Matic's determinantal inequality and discusses related open questions.
Abstract
Denote by the set of positive definite matrices. Let , where with . Partition according to so that . 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 denotes the vector of eigenvalues of . 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…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsMathematical Inequalities and Applications · Point processes and geometric inequalities · Graph theory and applications
