Matrix Example Continued.
Playing around with the calculator on the previous page (and at the bottom of this page) should have convinced yourself of the following:
  • whatever 3 values of nx(0) you may have started with, if you go far enough into the future (t large) you'll end up approximately with
    n1(t) -> 2a,
    n2(t) -> a,
    n3(t) -> a,
    for some limiting constant a;
  • if at the start n1(0) = 2n2(0) = 2n3(0) (for example, the suggested values, 200, 100 and 100), then the populations nx(t) will remain constant for all t > 0;
  • as t gets large, the matrices Lt seem to converge to the matrix
    1/22/31/3
    1/41/31/6
    1/41/31/6
In fact, let's denote this limiting matrix by L% (which is supposed to look like L to the power infinity, because that's what it actually is). Since

infinity + 1 = infinity

(bear with me here; if you can handle the idea of infinity being a number, then this is simpler than the more rigorous mathematical treatment), we expect

L% = LL% = L%L.

And in fact, multiplying L% from the left or right by L yields L% back again.

Continuing on in this vein, recall that

n(t) = Lt n(0),

where n(t) is the column matrix of 3 populations nx(t). Therefore, let

n(%) = L% n(0),

which is the column of populations after an infinite number of generations (which won't happen until the year 2089).

Performing the matrix multiplication we get

n1(%) = 2n2(%) = 2n3(%) = (n1(0)/2 + 2n2(0)/3 + n3(0)/3).

(So n1(%) + 2n2(%) + n3(%) = (n1(0) + 4n2(0)/3 + 2n3(0)/3).) This explains what we should have observed playing with the calculator re the ratios of the 1, 2 and 3 year old populations for large t. Note that

L n(%) = LL% n(0) = L%+1 n(0) = L% n(0) = n(%),.................(eigenvector equation),

and that explains why if n1(t) = 2n2(t) = 2n3(t), then n(t+1) = L n(t) = n(t).

The general form of a matrix eigenvalue equation is

A v = µ v

where A is an nxn matrix, v an nx1 matrix (vector), and µ a number. v is called the eigenvector, and µ its eigenvalue. Note that if v is an eigenvector of some matrix A, then so is cv for any constant c; so eigenvectors determine eigen-"directions".

In the L-eigenvector equation written above, n(%) is the eigenvector, and µ = 1 is the corresponding eigenvalue. (There are two other eigenvalues for L, but they are complex numbers with nonzero imaginary components, and they won't be of interest to us.)

The eigenvalue µ = 1 is quite special, and it is repsonsible for the fact that the nine components of L% are finite real numbers, and for the fact that whatever populations nx(0) we may start with, after a large number of generations we will settle near the stable values of nx(%), which are finite.

On the next page we'll construct a new set of fx (but leave the Px the same), resulting in an eigenvalue bigger than 1, and consequently exponential growth.

Lt+1
1
2
3
t=0 populations
INPUTS
t = Generations.
1 ..n1(0) ..n1(t)
2 ..n2(0) ..n2(t)
3 ..n3(0) ..n3(t)
Lt+2
1
2
3
t+1 = Generations.
1 ..n1(t+1)
2 ..n2(t+1)
3 ..n3(t+1)
Home. ..... Population Page 16. ..... Population Page 18.
Navigation Helper
Brandeis University Life Sciences   Life Sciences Search   Life Sciences Courses
Brandeis University Home Page   Genome Multimedia Site   MathBiology Multimedia Site
Feedback and Suggestions for Multimedia Sites.