Geometric Perron-Frobenius theory in finite dimensions Hans - - PowerPoint PPT Presentation

geometric perron frobenius theory in finite dimensions
SMART_READER_LITE
LIVE PREVIEW

Geometric Perron-Frobenius theory in finite dimensions Hans - - PowerPoint PPT Presentation

Geometric Perron-Frobenius theory in finite dimensions Hans Schneider Chemnitz October 2010 geompfchmn 2010.09.08, 11:05 September 8, 2010 Hans Schneider Geometric Perrron-Frobenius 1 / 14 cones Definition K a cone in R n K + K K 1


slide-1
SLIDE 1

Geometric Perron-Frobenius theory in finite dimensions

Hans Schneider Chemnitz October 2010

geompfchmn 2010.09.08, 11:05 September 8, 2010 Hans Schneider Geometric Perrron-Frobenius 1 / 14

slide-2
SLIDE 2

cones Definition K a cone in Rn

1

K +K ⊆ K (x,y ∈ K = ⇒ x +y ∈ K)

2

R+K ⊆ K (α ≥ 0,x ∈ K = ⇒ αx ∈ K

3

K pointed K ∩K = {0} (x,−x ∈K= ⇒ x = 0)

Hans Schneider Geometric Perrron-Frobenius 2 / 14

slide-3
SLIDE 3

cones Definition K a cone in Rn

1

K +K ⊆ K (x,y ∈ K = ⇒ x +y ∈ K)

2

R+K ⊆ K (α ≥ 0,x ∈ K = ⇒ αx ∈ K

3

K pointed K ∩K = {0} (x,−x ∈K= ⇒ x = 0) We assume K closed (in Euclidean topology of Rn)

Hans Schneider Geometric Perrron-Frobenius 2 / 14

slide-4
SLIDE 4

proper cones Definition cone K proper: span(K) = K −K = Rn (∀z ∈ Rn ∃x,y ∈ K, z = x −y)

Hans Schneider Geometric Perrron-Frobenius 3 / 14

slide-5
SLIDE 5

proper cones Definition cone K proper: span(K) = K −K = Rn (∀z ∈ Rn ∃x,y ∈ K, z = x −y) proper cone p.o’s Rn y ≥ x : y −x ∈ K

Hans Schneider Geometric Perrron-Frobenius 3 / 14

slide-6
SLIDE 6

proper cones Definition cone K proper: span(K) = K −K = Rn (∀z ∈ Rn ∃x,y ∈ K, z = x −y) proper cone p.o’s Rn y ≥ x : y −x ∈ K x ≥ 0 ⇐ ⇒ x ∈ K x > 0 ⇐ ⇒ x ∈ int K

Hans Schneider Geometric Perrron-Frobenius 3 / 14

slide-7
SLIDE 7

faces Definition F a face of cone K −−F K: F is a subcone of K and x ∈ F,0 ≤ y ≤ x = ⇒ y ∈ F

Hans Schneider Geometric Perrron-Frobenius 4 / 14

slide-8
SLIDE 8

faces Definition F a face of cone K −−F K: F is a subcone of K and x ∈ F,0 ≤ y ≤ x = ⇒ y ∈ F F a proper face of K: F = 0, F = K

Hans Schneider Geometric Perrron-Frobenius 4 / 14

slide-9
SLIDE 9

three examples Rn

+

Faces: (+,0,+0,...,0,+)

Hans Schneider Geometric Perrron-Frobenius 5 / 14

slide-10
SLIDE 10

three examples Rn

+

Faces: (+,0,+0,...,0,+) (x2

1 +x2 2 +···+x2 n−1)(1/2) ≤ xn

Proper faces: (x2

1 +x2 2 +···x2 n−1) ≤ xn

Extremals

Hans Schneider Geometric Perrron-Frobenius 5 / 14

slide-11
SLIDE 11

three examples Rn

+

Faces: (+,0,+0,...,0,+) (x2

1 +x2 2 +···+x2 n−1)(1/2) ≤ xn

Proper faces: (x2

1 +x2 2 +···x2 n−1) ≤ xn

Extremals (Real) Space: Hermitian n ×n matrices Cone: Positive semi-definite matrices Faces: Matrices simult similar to 0k ⊕X

Hans Schneider Geometric Perrron-Frobenius 5 / 14

slide-12
SLIDE 12

nonnegative operators K a proper cone in Rn A ≥ 0 : AK ⊆ K A > 0 : AK ⊆ int (K)

Hans Schneider Geometric Perrron-Frobenius 6 / 14

slide-13
SLIDE 13

nonnegative operators K a proper cone in Rn A ≥ 0 : AK ⊆ K A > 0 : AK ⊆ int (K) F an invariant face: AF ⊆ F

Hans Schneider Geometric Perrron-Frobenius 6 / 14

slide-14
SLIDE 14

nonnegative operators K a proper cone in Rn A ≥ 0 : AK ⊆ K A > 0 : AK ⊆ int (K) F an invariant face: AF ⊆ F A ≥ 0 irreducible: A leaves no proper face of K invariant: ⇐ ⇒ (I +A)n−1 > 0

Hans Schneider Geometric Perrron-Frobenius 6 / 14

slide-15
SLIDE 15

Aim of talk The aim is to relate the structure of invariant faces of the cone to the spectral properties of an operator nonnegative w.r.t. the cone.

Hans Schneider Geometric Perrron-Frobenius 7 / 14

slide-16
SLIDE 16

Aim of talk The aim is to relate the structure of invariant faces of the cone to the spectral properties of an operator nonnegative w.r.t. the cone. As we related the graph theoretic and spectral properties

  • f a nonnegative matrix both in classical nonneg alg and

max alg.

Hans Schneider Geometric Perrron-Frobenius 7 / 14

slide-17
SLIDE 17

fin dim Krein-Rutman 1940’s Theorem A ≥ 0 irreducible spec rad ρ(A) ∈ spec(A) ρ(A) simple eigenvalue ∃!x > 0, Ax = ρx y 0,Ay = λy = ⇒ λ = ρ, y = x

Hans Schneider Geometric Perrron-Frobenius 8 / 14

slide-18
SLIDE 18

fin dim Krein-Rutman 1940’s Theorem A ≥ 0 irreducible spec rad ρ(A) ∈ spec(A) ρ(A) simple eigenvalue ∃!x > 0, Ax = ρx y 0,Ay = λy = ⇒ λ = ρ, y = x And for reducible matrices?

Hans Schneider Geometric Perrron-Frobenius 8 / 14

slide-19
SLIDE 19

RECALL combinatorial theory ρi := ρ(Aii) i is a distinguished vertex: i

← j = ⇒ ρi > ρj Theorem Let A be a nonnegative matrix in FNF. Then the nonnegative eigenvectors of A correspond to the distinguish vertices of A: for for each distinguished vertex i of ∆(A) there is nonnegative eigenvector xi with Axi = ρixi such that xi

j > 0

if i

← j xi

j = 0

  • therwise

These are linearly independent, and all others are nonneg lin combs.

Hans Schneider Geometric Perrron-Frobenius 9 / 14

slide-20
SLIDE 20

distinguished faces F K : F an invariant face of K ρF = ρ(A|F) F K distinguished: F,G invariant, G ⊳F = ⇒ ρG < ρF Theorem K a proper cone in Rn. Each distinguished face contains an eigenvector of ρF in its relative interior. For any particular eigenvalue, the eigenvectors so

  • btained are the extremals of the cone of nonnegative

eigenvectors.

Hans Schneider Geometric Perrron-Frobenius 10 / 14

slide-21
SLIDE 21

chains of semi-dist inv faces F K is semi-distinguished : G F, G invariant = ⇒ ρG ≤ ρF

Hans Schneider Geometric Perrron-Frobenius 11 / 14

slide-22
SLIDE 22

chains of semi-dist inv faces F K is semi-distinguished : G F, G invariant = ⇒ ρG ≤ ρF A ∈ Rn×n

+

in FNF indλ(A) : = max size of J–block for λ = min{k : N = N (λI −A)k+1 = N (λI −A)k}

Hans Schneider Geometric Perrron-Frobenius 11 / 14

slide-23
SLIDE 23

chains of semi-dist inv faces F K is semi-distinguished : G F, G invariant = ⇒ ρG ≤ ρF A ∈ Rn×n

+

in FNF indλ(A) : = max size of J–block for λ = min{k : N = N (λI −A)k+1 = N (λI −A)k} Invariant Fλ-face: ρF = λ K F1 ⊲F2 ⊲···⊲F : proper chain of inv semi-dist λ faces

  • rdλ = max length of such a chain of faces

Hans Schneider Geometric Perrron-Frobenius 11 / 14

slide-24
SLIDE 24

generalization of Rothblum’s theorem Tam-S (2001) Theorem indλ ≤ ordλ If K is polyhedral (fin gen), indρ = ordρ

Hans Schneider Geometric Perrron-Frobenius 12 / 14

slide-25
SLIDE 25

generalization of Rothblum’s theorem Tam-S (2001) Theorem indλ ≤ ordλ If K is polyhedral (fin gen), indρ = ordρ If K = Rn

+ this is a generalization by Hershkowitz-S of

Rothblum’s theorem (case λ = ρ)

Hans Schneider Geometric Perrron-Frobenius 12 / 14

slide-26
SLIDE 26

Tam-S, Matrices leaving a cone invariant , Art. 26, Handbook of Linear Algebra (ed. L. Hogben) 2007

Hans Schneider Geometric Perrron-Frobenius 13 / 14

slide-27
SLIDE 27

Tam-S, Matrices leaving a cone invariant , Art. 26, Handbook of Linear Algebra (ed. L. Hogben) 2007 THANK YOU And please allow me one more slide!

Hans Schneider Geometric Perrron-Frobenius 13 / 14

slide-28
SLIDE 28

Hans Schneider Geometric Perrron-Frobenius 14 / 14