1
$\begingroup$

Define $Re\lambda_{min}(A)$ to be the minimum of the real parts of the eigenvalues of a matrix $A$. Let $A,B\in \mathbb{R}^{n \times n}$ be two matrice such that $Re\lambda_{min}(A)>0$, $Re\lambda_{min}(B)>0$ and $Re\lambda_{min}(A-B)\geq 0$. Is $Re\lambda_{min}(A)\geq Re\lambda_{min}(B)$ right? And how to prove.

Any help will be appreciated!

Improve this question
$\endgroup$
5
  • 1
    $\begingroup$ Typo in the title; typo in your final inequality $\endgroup$
    – Yemon Choi
    Commented May 10, 2012 at 8:14
  • $\begingroup$ Can you do this for $2\times 2$ matrices? $\endgroup$
    – Yemon Choi
    Commented May 10, 2012 at 8:14
  • $\begingroup$ It seems wrong: take just A=diag(10+epsilon, 1) B=diag(10,2) $\endgroup$
    – Alexander Chervov
    Commented May 10, 2012 at 8:19
  • $\begingroup$ Alexander, A-B=diag(epsilon,-1) in your example so it doesn't work. $\endgroup$
    – Felix Goldberg
    Commented May 10, 2012 at 8:48
  • $\begingroup$ @Felix, yeh, you right, I misread as abs(Re(Lambda_min))... $\endgroup$
    – Alexander Chervov
    Commented May 10, 2012 at 9:16

1 Answer 1

Reset to default
2
$\begingroup$

Here is a $2 \times 2$ counterexample:

$A=\begin{bmatrix}10 & 19 \\\\ 8 & 16\end{bmatrix}$

$B=\begin{bmatrix}9 & 2 \\\\ 17 & 7\end{bmatrix}$

If you have tacit assumptions, share them and we'll see if the statement becomes true!

Improve this answer
$\endgroup$
2
  • $\begingroup$ (@Felix: For the matrix display: you have to use FOUR backslashes instead of 2...) $\endgroup$
    – Tom De Medts
    Commented May 10, 2012 at 9:07
  • $\begingroup$ @ Tom De Medts, thanks, this is great! $\endgroup$
    – Felix Goldberg
    Commented May 10, 2012 at 9:11

You must log in to answer this question.

Not the answer you're looking for? Browse other questions tagged .