Eigenvalues of element-wise ordered matrices
Clash Royale CLAN TAG#URR8PPP
up vote
1
down vote
favorite
Let $A = (a_ij)$ and $B = (b_ij)$ be two positive-definite matrices such that
$$a_ij geq b_ij text for all $i,j$ and for all $i$, a_ii > b_ii,.$$
That is, $A geq B$ elementwise and the diagonals of $A$ are greater than the diagonals of $B$. In that case, can we say that $lambda_A,i > lambda_B,i$ for $i = 1, dots, p$?
Intuitively, I think this should be true, but I am not able to show it mainly because I don't know if $A-B$ is positive definite.
matrices inequality eigenvalues-eigenvectors positive-definite
add a comment |Â
up vote
1
down vote
favorite
Let $A = (a_ij)$ and $B = (b_ij)$ be two positive-definite matrices such that
$$a_ij geq b_ij text for all $i,j$ and for all $i$, a_ii > b_ii,.$$
That is, $A geq B$ elementwise and the diagonals of $A$ are greater than the diagonals of $B$. In that case, can we say that $lambda_A,i > lambda_B,i$ for $i = 1, dots, p$?
Intuitively, I think this should be true, but I am not able to show it mainly because I don't know if $A-B$ is positive definite.
matrices inequality eigenvalues-eigenvectors positive-definite
1
Check [1, 2 ; 2, 1]...
– user251257
Jul 16 at 19:01
add a comment |Â
up vote
1
down vote
favorite
up vote
1
down vote
favorite
Let $A = (a_ij)$ and $B = (b_ij)$ be two positive-definite matrices such that
$$a_ij geq b_ij text for all $i,j$ and for all $i$, a_ii > b_ii,.$$
That is, $A geq B$ elementwise and the diagonals of $A$ are greater than the diagonals of $B$. In that case, can we say that $lambda_A,i > lambda_B,i$ for $i = 1, dots, p$?
Intuitively, I think this should be true, but I am not able to show it mainly because I don't know if $A-B$ is positive definite.
matrices inequality eigenvalues-eigenvectors positive-definite
Let $A = (a_ij)$ and $B = (b_ij)$ be two positive-definite matrices such that
$$a_ij geq b_ij text for all $i,j$ and for all $i$, a_ii > b_ii,.$$
That is, $A geq B$ elementwise and the diagonals of $A$ are greater than the diagonals of $B$. In that case, can we say that $lambda_A,i > lambda_B,i$ for $i = 1, dots, p$?
Intuitively, I think this should be true, but I am not able to show it mainly because I don't know if $A-B$ is positive definite.
matrices inequality eigenvalues-eigenvectors positive-definite
asked Jul 16 at 18:55
Greenparker
203112
203112
1
Check [1, 2 ; 2, 1]...
– user251257
Jul 16 at 19:01
add a comment |Â
1
Check [1, 2 ; 2, 1]...
– user251257
Jul 16 at 19:01
1
1
Check [1, 2 ; 2, 1]...
– user251257
Jul 16 at 19:01
Check [1, 2 ; 2, 1]...
– user251257
Jul 16 at 19:01
add a comment |Â
1 Answer
1
active
oldest
votes
up vote
3
down vote
accepted
Counter-example:
$$
A=beginpmatrix5 & 0\
0 & 5
endpmatrixqquad B=beginpmatrixphantom+4 & -3\
-3 & phantom+4
endpmatrix
$$
Addendum: In case you are interested, it is worthwhile to point out that this disproves the claim in a slightly stronger setting since $A$ and $B$ are Stieltjes matrices (a subset of the SPD matrices).
add a comment |Â
1 Answer
1
active
oldest
votes
1 Answer
1
active
oldest
votes
active
oldest
votes
active
oldest
votes
up vote
3
down vote
accepted
Counter-example:
$$
A=beginpmatrix5 & 0\
0 & 5
endpmatrixqquad B=beginpmatrixphantom+4 & -3\
-3 & phantom+4
endpmatrix
$$
Addendum: In case you are interested, it is worthwhile to point out that this disproves the claim in a slightly stronger setting since $A$ and $B$ are Stieltjes matrices (a subset of the SPD matrices).
add a comment |Â
up vote
3
down vote
accepted
Counter-example:
$$
A=beginpmatrix5 & 0\
0 & 5
endpmatrixqquad B=beginpmatrixphantom+4 & -3\
-3 & phantom+4
endpmatrix
$$
Addendum: In case you are interested, it is worthwhile to point out that this disproves the claim in a slightly stronger setting since $A$ and $B$ are Stieltjes matrices (a subset of the SPD matrices).
add a comment |Â
up vote
3
down vote
accepted
up vote
3
down vote
accepted
Counter-example:
$$
A=beginpmatrix5 & 0\
0 & 5
endpmatrixqquad B=beginpmatrixphantom+4 & -3\
-3 & phantom+4
endpmatrix
$$
Addendum: In case you are interested, it is worthwhile to point out that this disproves the claim in a slightly stronger setting since $A$ and $B$ are Stieltjes matrices (a subset of the SPD matrices).
Counter-example:
$$
A=beginpmatrix5 & 0\
0 & 5
endpmatrixqquad B=beginpmatrixphantom+4 & -3\
-3 & phantom+4
endpmatrix
$$
Addendum: In case you are interested, it is worthwhile to point out that this disproves the claim in a slightly stronger setting since $A$ and $B$ are Stieltjes matrices (a subset of the SPD matrices).
edited Jul 16 at 19:17
answered Jul 16 at 19:05
parsiad
16k32253
16k32253
add a comment |Â
add a comment |Â
Sign up or log in
StackExchange.ready(function ()
StackExchange.helpers.onClickDraftSave('#login-link');
);
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
StackExchange.ready(
function ()
StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fmath.stackexchange.com%2fquestions%2f2853728%2feigenvalues-of-element-wise-ordered-matrices%23new-answer', 'question_page');
);
Post as a guest
Sign up or log in
StackExchange.ready(function ()
StackExchange.helpers.onClickDraftSave('#login-link');
);
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Sign up or log in
StackExchange.ready(function ()
StackExchange.helpers.onClickDraftSave('#login-link');
);
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Sign up or log in
StackExchange.ready(function ()
StackExchange.helpers.onClickDraftSave('#login-link');
);
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
1
Check [1, 2 ; 2, 1]...
– user251257
Jul 16 at 19:01