393

whenever m is large enough. It follows

limm→∞

∣∣∣∣∣∣∣∣( Aλ0)m

− P

∣∣∣∣∣∣∣∣ = 0

as claimed.What about the case when A > 0 but maybe it is not the case that A >> 0? As before,

K ≡ {x ≥ 0 such that ||x||1 = 1} .

Now defineS1 ≡ {λ : Ax ≥ λx for some x ∈ K}

andλ0 ≡ sup (S1) (2.7)

Theorem B.0.7 Let A > 0 and let λ0 be defined in 2.7. Then there exists x0 > 0 suchthat Ax0 = λ0x0.

Proof: Let E consist of the matrix which has a one in every entry. Then from TheoremB.0.4 it follows there exists xδ >> 0 , ||xδ||1 = 1, such that (A+ δE)xδ = λ0δxδ where

λ0δ ≡ sup {λ : (A+ δE)x ≥ λx for some x ∈ K} .

Now if α < δ{λ : (A+ αE)x ≥ λx for some x ∈ K} ⊆

{λ : (A+ δE)x ≥ λx for some x ∈ K}

and so λ0δ ≥ λ0α because λ0δ is the sup of the second set and λ0α is the sup of the first. Itfollows the limit, λ1 ≡ limδ→0+ λ0δ exists. Taking a subsequence and using the compactnessof K, there exists a subsequence, still denoted by δ such that as δ → 0, xδ → x ∈ K.Therefore,

Ax = λ1x

and so, in particular, Ax ≥ λ1x and so λ1 ≤ λ0. But also, if λ ≤ λ0,

λx ≤ Ax < (A+ δE)x

showing that λ0δ ≥ λ for all such λ. But then λ0δ ≥ λ0 also. Hence λ1 ≥ λ0, showing thesetwo numbers are the same. Hence Ax = λ0x. ■

If Am >> 0 for some m and A > 0, it follows that the dimension of the eigenspace forλ0 is one and that the absolute value of every other eigenvalue of A is less than λ0. If it isonly assumed that A > 0, not necessarily >> 0, this is no longer true. However, there issomething which is very interesting which can be said. First here is an interesting lemma.

Lemma B.0.8 Let M be a matrix of the form

M =

(A 0

B C

)or

M =

(A B

0 C

)where A is an r × r matrix and C is an (n− r) × (n− r) matrix. Then det (M) =det (A) det (B) and σ (M) = σ (A) ∪ σ (C) .

393whenever m is large enough. It followsA mli — —P||=0aim.) -? |as claimed.What about the case when A > 0 but maybe it is not the case that A >> 0? As before,Kk = {x >0 such that ||x||, = 1}.Now defineSy = {A: Ax > Ax for some x € K}andAo = sup ($1) (2.7)Theorem B.0.7 Let A > 0 and let Ao be defined in 2.7. Then there exists xy > O suchthat Axo = AoXo-Proof: Let E£ consist of the matrix which has a one in every entry. Then from TheoremB.0.4 it follows there exists xs >> 0, ||x5||, = 1, such that (A+ dE) x5 = Aosxs whereAos = sup {A : (A+ 6EF)x > Xx for some x € K}.Now ifa<6{A : (A+ aE)x > Ax for some x € K} C{\: (A+ 6E)x > Xx for some x € K}and so 95 > Ava because os is the sup of the second set and Apg is the sup of the first. Itfollows the limit, A7 = lims_,o4 Aos exists. Taking a subsequence and using the compactnessof K, there exists a subsequence, still denoted by 6 such that as 6 — 0, x5 ~ x € K.Therefore,Ax = \1xand so, in particular, Ax > A;x and so Ay < Ap. But also, if A < Ao,Ax < Ax < (A+ 6E)xshowing that Ags > A for all such A. But then Ags > Ao also. Hence A; > Ap, showing thesetwo numbers are the same. Hence Ax = \ox.If A” >> 0 for some m and A > 0, it follows that the dimension of the eigenspace forXo is one and that the absolute value of every other eigenvalue of A is less than Xo. If it isonly assumed that A > 0, not necessarily >> 0, this is no longer true. However, there issomething which is very interesting which can be said. First here is an interesting lemma.Lemma B.0.8 Let M be a matrix of the form(ae)(08)where A is an r x r matrix and C is an (n—1r) xX (n—1r) matriz. Then det(M) =det (A) det (B) and o (M) =a (A)Ua(C).or