Skip to main content
deleted 39 characters in body
Source Link
Denis Serre
  • 52.3k
  • 10
  • 146
  • 300

Assume 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 $p \times p$ positive matrix, whose eigenvalues are $b_1\ge b_2\ldots \ge b_p>0.$ For $n\times p$ full rank matrix $X$ with $n\ge p,$

Question: How to prove $$|X'AX+B|\ge c(X)\prod_{i=1}^p(a_{n-p+i}+b_{i}),$$

How to prove $$\det(X'AX+B)\ge c(X)\prod_{i=1}^p(a_{n-p+i}+b_{i}),$$

where $|\cdot|$ stands for determinant, $c(X)$ is a postive constant, that depends only denpends on $X.$$X$.

Assume 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 $p \times p$ positive matrix, whose eigenvalues are $b_1\ge b_2\ldots \ge b_p>0.$ For $n\times p$ full rank matrix $X$ with $n\ge p,$

Question: How to prove $$|X'AX+B|\ge c(X)\prod_{i=1}^p(a_{n-p+i}+b_{i}),$$

where $|\cdot|$ stands for determinant, $c(X)$ is a postive constant, only denpends on $X.$

Assume 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 $p \times p$ positive matrix, whose eigenvalues are $b_1\ge b_2\ldots \ge b_p>0.$ For $n\times p$ full rank matrix $X$ with $n\ge p,$

How to prove $$\det(X'AX+B)\ge c(X)\prod_{i=1}^p(a_{n-p+i}+b_{i}),$$

where $c(X)$ is a postive constant that depends only on $X$.

edited title
Link

One matrix Matrix eigenvalues inequality (1)

deleted 98 characters in body
Source Link

Assume 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 $p \times p$ positive matrix, whose eigenvalues are $b_1\ge b_2\ldots \ge b_p>0.$ For $n\times p$ full rank matrix $X$ with $n\ge p,$

Question: Is there a similar inequality, such that $$|X'AX+B|\ge c(X)\prod_{i=1}^p(a_i+b_{p-i+1}),$$ or $$|X'AX+B|\ge c(X)\prod_{i=1}^p(a_{p-i+1}+b_i)$$How to prove or something else.$$|X'AX+B|\ge c(X)\prod_{i=1}^p(a_{n-p+i}+b_{i}),$$

where $|\cdot|$ stands for determinant, $c(X)$ is a postive constant, only denpends on $X.$

Assume 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 $p \times p$ positive matrix, whose eigenvalues are $b_1\ge b_2\ldots \ge b_p>0.$ For $n\times p$ full rank matrix $X$ with $n\ge p,$

Question: Is there a similar inequality, such that $$|X'AX+B|\ge c(X)\prod_{i=1}^p(a_i+b_{p-i+1}),$$ or $$|X'AX+B|\ge c(X)\prod_{i=1}^p(a_{p-i+1}+b_i)$$ or something else.

where $|\cdot|$ stands for determinant, $c(X)$ is a postive constant, only denpends on $X.$

Assume 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 $p \times p$ positive matrix, whose eigenvalues are $b_1\ge b_2\ldots \ge b_p>0.$ For $n\times p$ full rank matrix $X$ with $n\ge p,$

Question: How to prove $$|X'AX+B|\ge c(X)\prod_{i=1}^p(a_{n-p+i}+b_{i}),$$

where $|\cdot|$ stands for determinant, $c(X)$ is a postive constant, only denpends on $X.$

added 10 characters in body
Source Link
Loading
added 34 characters in body
Source Link
Loading
deleted 1 character in body
Source Link
Loading
added 10 characters in body
Source Link
Loading
added 6 characters in body
Source Link
Loading
deleted 1 character in body
Source Link
Loading
added 1 character in body
Source Link
Loading
Source Link
Loading