06.09.2021 Views

Linear Algebra, Theory And Applications, 2012a

Linear Algebra, Theory And Applications, 2012a

Linear Algebra, Theory And Applications, 2012a

SHOW MORE
SHOW LESS

Create successful ePaper yourself

Turn your PDF publications into a flip-book with our unique Google optimized e-Paper software.

404 POSITIVE MATRICES<br />

Proof: Let λ ∈ S. Then there exists x >> 0 such that Ax >λx. Consider y ≡ x/ ||x|| 1<br />

.<br />

Then ||y|| 1<br />

= 1 and Ay >λy. Therefore, λ ∈ S 1 and so S ⊆ S 1 . Therefore, sup (S) ≤<br />

sup (S 1 ) .<br />

Now let λ ∈ S 1 . Then there exists x ≥ 0 such that ||x|| 1<br />

=1sox > 0 and Ax >λx.<br />

Letting y ≡ Ax, it follows from Lemma A.0.2 that Ay >> λy and y >> 0. Thus λ ∈ S<br />

and so S 1 ⊆ S which shows that sup (S 1 ) ≤ sup (S) . <br />

This lemma is significant because the set, {x ≥ 0 such that ||x|| 1<br />

=1}≡K is a compact<br />

set in R n . Define<br />

λ 0 ≡ sup (S) =sup(S 1 ) . (1.1)<br />

The following theorem is due to Perron.<br />

Theorem A.0.4 Let A>>0 be an n × n matrix and let λ 0 be given in (1.1). Then<br />

1. λ 0 > 0 and there exists x 0 >> 0 such that Ax 0 = λ 0 x 0 so λ 0 is an eigenvalue for A.<br />

2. If Ax = μx where x ≠ 0, and μ ≠ λ 0 . Then |μ| 0, consider the vector, e ≡ (1, ··· , 1) T .Then<br />

(Ae) i<br />

= ∑ j<br />

A ij > 0<br />

and so λ 0 is at least as large as<br />

min<br />

i<br />

∑<br />

A ij .<br />

j<br />

Let {λ k } be an increasing sequence of numbers from S 1 converging to λ 0 . Letting x k be<br />

the vector from K which occurs in the definition of S 1 , these vectors are in a compact set.<br />

Therefore, there exists a subsequence, still denoted by x k such that x k → x 0 ∈ K and<br />

λ k → λ 0 . Then passing to the limit,<br />

Ax 0 ≥ λ 0 x 0 , x 0 > 0.<br />

If Ax 0 >λ 0 x 0 , then letting y ≡ Ax 0 , it follows from Lemma A.0.2 that Ay >> λ 0 y and<br />

y >> 0. But this contradicts the definition of λ 0 as the supremum of the elements of S<br />

because since Ay >> λ 0 y, it follows Ay >> (λ 0 + ε) y for ε a small positive number.<br />

Therefore, Ax 0 = λ 0 x 0 . It remains to verify that x 0 >> 0. But this follows immediately<br />

from<br />

0 < ∑ A ij x 0j =(Ax 0 ) i<br />

= λ 0 x 0i .<br />

j<br />

This proves 1.<br />

Next suppose Ax = μx and x ≠ 0 and μ ≠ λ 0 . Then |Ax| = |μ||x| . But this implies<br />

A |x| ≥|μ||x| . (See the above abominable definition of |x|.)<br />

Case 1: |x| ̸= x and |x| ≠ −x.<br />

In this case, A |x| > |Ax| = |μ||x| and letting y = A |x| , it follows y >> 0 and<br />

Ay >> |μ| y which shows Ay >> (|μ| + ε) y for sufficiently small positive ε and verifies<br />

|μ|

Hooray! Your file is uploaded and ready to be published.

Saved successfully!

Ooh no, something went wrong!