How Does a Non-Negative Matrix Ensure a Positive Eigenvector?

  • Thread starter Thread starter BrainHurts
  • Start date Start date
  • Tags Tags
    Matrices
Join the discussion
Ask a follow-up here, or get your own question answered by working scientists, mathematicians and engineers — people, not an autocomplete.
Real named experts · corrections over time · the nuance an AI answer skips
3 replies · 1K views
BrainHurts
Messages
100
Reaction score
0

Homework Statement


If A≥0 and Ak>0 for some k≥1, show that A has a positive eigenvector.



Homework Equations





The Attempt at a Solution


A is nxn

Well from a previous problem we know that the spectral radius ρ(A)>0

We also know that if A≥0, then ρ(A) is an eigenvalue of A and there is a non negative vector x, x=/=0 such that Ax=ρ(A)x

Kinda stuck
 
Physics news on Phys.org
non negative vector means all the entries in that vector is greater than zero,

if the vector is positive all entries in that vector is positive

i.e. if x≥0 all components of x are greater than or equal to zero

similarly if a matrix A≥0

all [aij]≥0

positive just means everything is greater than 0
 
Last edited:
BrainHurts said:

Homework Statement


If A≥0 and Ak>0 for some k≥1, show that A has a positive eigenvector.



Homework Equations





The Attempt at a Solution


A is nxn

Well from a previous problem we know that the spectral radius ρ(A)>0

We also know that if A≥0, then ρ(A) is an eigenvalue of A and there is a non negative vector x, x=/=0 such that Ax=ρ(A)x

Kinda stuck

Google Perron-Frobenius theorem.