| Mathematical Preliminaries
The Frobenius/Perron
theorem [Takayama, 1984, p367-376]
Let A be a nonnegative
irreducible nxn-matrix. Then
-
A has an eigenvalue λ*>0
such that
-
An eigenvector x*>>0
can be associated with λ*.
-
The eigenvector x*
is unique up to a scalar multiple; that is, if y* is an eigenvector
associated with λ*, then y*=θx* for
some scalar θ<>0.
-
If Ax=λx for some λ>=0
and x>0, then λ=λ*.
-
If ω is any eigenvalue
of A, then |ω|<=λ*.
-
The eigenvalue λ*
increases when any element of A increases; that is, if A1>A2>=0
with A1 irreducible, then λ*(A1)>λ*(A2),
where λ*(A1) and λ*(A2) respectively,
denote the λ* associated with A1 and A2.
-
The eigenvalue λ*
is a simple root and is called the dominant eigenvalue.
When reducibility is allowed
the statements become weaker.
Let A be a nonnegative
nxn-matrix. Then
-
The matrix A has an eigenvalue
λ*>=0 such that
-
An eigenvector x*>0
can be associated with λ*.
-
If Ax>=μx for some real
number μ and x>0, then λ*>=μ.
-
If ω is any eigenvalue
of A, then λ*
>=|ω|.
-
If A1>=A2>=0,
then λ*(A1)>=λ*(A2).
Note that if A is reducible,
then
-
The root λ*
can be zero.
-
Some, but not all, elements
of x* can be zero.
-
Both x* and
y*, with y*<>θx* and θ element of
R can be eigenvectors associated with λ*.
-
The root λ*
is not necessarily a simple root.
An inverse theorem
[Takayama, 1984, p392]
Let A be an irreducible
nxn-matrix. Let B be defined as ρI-A, with ρ element of R. Let λ*
be the dominant eigenvalue of A, and I the identity matrix. Then the matrix
B is nonsingular and
B-1>>if
and only if ρ>λ*.
The subinvariance
theorem [Seneta, 1981, p20-21]
Suppose T is a nonnegative
irreducible matrix, s a positive number, and x>0 is a vector which satisfies
Tx<=sx. This implies:
-
x>>0
-
s>=λ*, with
λ* the dominant eigenvalue of T.
-
s=λ* if and
only if Tx=λ*x.
Proof: Suppose at least
one element say the ith, of x is zero. Then since Tk x<=sk
x
it follows that

Now, since T is irreducible,
for this i and any j, there exists a k such that Tij(k)>0;
and since x>0 for some j, it follows that xi>0, which is a contradiction.
Thus x>>0. Now, premultiplying the relation Ty<=sy by q', a positive
left eigenvector of T corresponding to λ*, we get
sq'y>= q'Tx=λ*q'y
<=> s>= λ*
Now suppose Tx<=λ*x
with strict inequality in at least one place; then the preceding argument,
on account of the strict positivity of Tx and λ*x, yields λ*<λ*,
which is impossible. The implication s=λ* follows from Tx=λ*x
similarly.
An eigenvectortheorem
(special case) [Dietzenbacher, 1991, p216]
Let A be reducible,
and partitioned as follows

with A1
and A2 square, nonnegative and irreducible. Suppose B>0. Suppose
furthermore that v'=(v1,v2)' is the left dominant
eigenvector of A, and w=(w1,w2)' is the right dominant
eigenvector of A.
| if
λ1=λ* and λ2<λ* |
then
v1>>0, v2=0, w1>>0 and w2>>0. |
| if
λ1<λ* and λ2=λ* |
then
v1>>0, v2>>0, w1=0 and w2>>0. |
| if
λ1=λ* and λ2=λ* |
then
v1>>0, v2=0, w1=0 and w2>>0. |
with the eigenvectors
all unique up to a scalar multiple
MAIN |