Skip to main content

All Questions

Filter by
Sorted by
Tagged with
13 votes
2 answers
1k views

A log inequality for positive definite trace-one matrices

Let $\{v_i\}_{i=1}^N$ be a set of $n$-dimensional real vectors and let $X=X^\top\in\mathbb{R}^{n\times n}$ be a positive definite trace-one matrix. I would like to prove (or disprove) the following ...
Ludwig's user avatar
  • 2,712
8 votes
1 answer
904 views

A generalized log inequality for positive definite trace-one matrices

Let $\{V_i\}_{i=1}^N$ be a set of $n\times m$, $n\geq m$, real matrices of full column rank and let $X=X^\top\in\mathbb{R}^{n\times n}$ be a positive definite trace-one matrix. Moreover, let $A^{1/2}=(...
Ludwig's user avatar
  • 2,712
5 votes
1 answer
241 views

Trace inequality under consideration of definiteness

Let $G \in \mathbb{R}^{3 \times 3}$ a symmetric, but indefinite matrix and $U \in \mathbb{R}^{3\times 3}$ a symmetric and positive definite matrix. I would like to prove the inequality $$ \text{Tr} \...
TARS's user avatar
  • 51
2 votes
0 answers
106 views

Connections between eigenvalues of $B$ and $A+iB$

Consider two symmetric and real matrices $A,B\in\mathbb{R}^n$ and definie $A+iB$. Note that $A+iB$ is not hermitian in this case. There are many results based on Brendixson and Courant-Fischer, saying,...
Stephan's user avatar
  • 21
1 vote
0 answers
111 views

Matrix eigenvalues inequality (2)

Suppose that $A$ is a $n\times n$ positive matrix, whose eigenvalues are $a_1\ge a_2\ldots \ge a_n>0;$ $B$ is a $m \times m$ positive matrix, whose eigenvalues are $b_1\ge b_2\ldots \ge b_m>0;$ ...
Xiaopai Song's user avatar
0 votes
0 answers
57 views

Class of covariance matrices invariant under permutations

I am reading a paper on covariance matrix estimation, and in this paper is introduced a class of covariance matrices: \begin{equation} U(q, c_0(p),M)=\{\Sigma: \sigma_{ii}\leq M,\quad \max_j\sum_{j=1}^...
spenziak's user avatar