Take the 2-minute tour ×
Mathematics Stack Exchange is a question and answer site for people studying math at any level and professionals in related fields. It's 100% free, no registration required.

let $$A=\begin{bmatrix} a_{1}&a_{2}&a_{3}\\ a_{4}&a_{5}&a_{6}\\ a_{7}&a_{8}&a_{9} \end{bmatrix}$$ where $a_{i}>0$,

show that the matrix $A$ At least one positive eigenvalue。

I think this problem is very interesting,and I can't prove it,Thank you

It is said this problem can prove by Brouwer Fixed Point Theorem: http://www.math.hmc.edu/funfacts/ffiles/20002.7.shtml and it's very nice, who can see it? Thank you.

and I think this problem can use linear-algebra methods can solve it.Thank you

share|improve this question
1  
See Calvin's answer in a related thread. –  user1551 Sep 5 '13 at 15:33
    
Thank you every much –  math110 Sep 5 '13 at 15:36
add comment

3 Answers

Everything you need is here: http://en.wikipedia.org/wiki/Perron%E2%80%93Frobenius_theorem

In a nutshell, the Perron-Frobenius theorem states that such a positive eigenvalue exists, and more specifically that there is only one eigenvalue with maximal modulus, which is real>0.

share|improve this answer
    
Thank you, But I can't find your link solution with my problem.and I hope see this problem have nice and simple methods. –  math110 Sep 5 '13 at 14:27
    
You just need item 1 here : en.wikipedia.org/wiki/… –  Denis Sep 5 '13 at 15:04
    
You can read this for a proof that the spectral radius $\rho(A)$ is an eigenvalue of $A$: matrixanalysis.com/Chapter8.pdf –  Denis Sep 5 '13 at 15:07
    
Thank you very much +1. –  math110 Sep 5 '13 at 15:40
add comment

Let's take $S=\{x\in \Bbb R^3: \forall i\,x_i>0,\,\|x\|=1 \}$. Then the image of $S$ under transformation $A$ is still in $\Bbb R_+^3$. We take a projection $P:x\to \frac{x}{\|x\|}$, thus we obtain the application $P\circ A:S\to S$. This application has a fixed point by Brouwer's theorem, which gives you the eigenvector, obviously corresponding to a positive eigenvalue.

share|improve this answer
add comment

The trace of the matrix Tr$({\bf A})$ is the sum of the eigenvalues, and also the sum of the diagonals under any transformation. Since the sum of the diagonals is greater than zero, at least one eigenvalue must be greater than zero.

share|improve this answer
    
if eigenvalues is complex? This is not true –  math110 Sep 5 '13 at 14:42
    
You said the matrix elements were greater than zero. How am I to interpret this is they are complex? What does "positive" even mean if they are complex? –  santa claus Sep 5 '13 at 14:43
    
I said exsit at least one positive eigenvalue –  math110 Sep 5 '13 at 14:45
    
I quote "If $a_i >0$" (the matrix elements are greater than zero) "show that the matrix $A$ has at least one positive eigenvalue." This is a proof. If the numbers are complex, then you must specify what you mean by $a_i>0$. Are both the real and imaginary parts greater than zero? Just the real part? –  santa claus Sep 5 '13 at 14:46
1  
... I think you don't understand my question,,I mean this eigenvalue maybe have complex..for example: three eigenvalue is$$1+2i,1-2i,-1$$ –  math110 Sep 5 '13 at 14:52
show 1 more comment

Your Answer

 
discard

By posting your answer, you agree to the privacy policy and terms of service.

Not the answer you're looking for? Browse other questions tagged or ask your own question.