In this section we discuss applications that depend on an ability to compute the matrix Ak for large values of k, given the n×n matrix A. If A is diagonalizable, then Ak can be found directly by a method that avoids the labor of calculating the powers A2,A3,A4,… by successive matrix multiplications.
Recall from Section 6.2 that, if the n×n matrix A has n linearly independent eigenvectors v1,v2,…,vn associated with the eigenvalues λ1,λ2,…,λn (not necessarily distinct), then
where
Note that (1) yields
because P−1P=I. More generally, for each positive integer k,
But the kth power Dk of the diagonal matrix D is easily computed:
Consequently the formula in (2) gives a quick and effective way to calculate any desired power of the diagonalizable matrix A, once its eigenvalues and associated eigenvectors—and hence the matrices P and D—have been found.
Find A5 if
In Example 7 of Section 6.1, we found that the 3×3 matrix A has the eigenvalue λ1=3 with associated eigenvector v1=[111]T, and the repeated eigenvalue λ2=2 with associated eigenvectors v2=[110]T and v3=[−102]T. Therefore, A=PDP−1 with
We first calculate
Then the formula in (3) yields
We want to apply this method of computing Ak to the analysis of a certain type of physical system that can be described by means of the following kind of mathematical model. Suppose that the sequence
of n-vectors is defined by its initial vector x0 and an n×n transition matrix A in the following manner:
We envision a physical system—such as a population with n specified subpopulations—that evolve through a sequence of successive states described by the vectors in (4). Then our goal is to calculate the kth state vector xk. But using (5) repeatedly, we find that
and in general that
Thus our task amounts to calculating the kth power Ak of the transition matrix A.
Urban/suburban population Consider a metropolitan area with a constant total population of 1 million individuals. This area consists of a city and its suburbs, and we want to analyze the changing urban and suburban populations. Let Ck denote the city population and Sk the suburban population after k years. Suppose that each year 15% of the people in the city move to the suburbs, whereas 10% of the people in the suburbs move to the city. Then it follows that
for each k≥0. (For instance, next year’s city population Ck+1 will equal 85% of this year’s city population Ck plus 10% of this year’s suburban population Sk.) Thus the metropolitan area’s population vector xk=[CkSk]T satisfies
(for each k≥0) with transition matrix
The characteristic equation of the transition matrix A is
Thus the eigenvalues of A are λ1=1 and λ2=0.75. For λ1=1, the system (A−λI)v=0 is
so an associated eigenvector is v1=[23]T. For λ2=0.75, the system (A−λI)v=0 is
so an associated eigenvector is v2=[−11]T. It follows that A=PDP−1, where
Now suppose that our goal is to determine the long-term distribution of population between the city and its suburbs. Note first that (34)k is “negligible” when k is sufficiently large; for instance, (34)40≈0.00001. It follows that if k≥40, then the formula Ak=PDkP−1 yields
Hence it follows that, if k is sufficiently large, then
because C0+S0=1 (million), the constant total population of the metropolitan area. Thus, our analysis shows that, irrespective of the initial distribution of population between the city and its suburbs, the long-term distribution consists of 40% in the city and 60% in the suburbs.
The result in Example 2—that the long-term situation is independent of the initial situation—is characteristic of a general class of common problems. Note that the transition matrix A in (8) has the property that the sum of the elements in each column is 1. An n×n matrix with nonnegative entries having this property is called a stochastic matrix. It can be proved that, if A is a stochastic matrix having only positive entries, then λ1=1 is one eigenvalue of A and |λi|<1 for the others. (See Problems 39 and 40.) Moreover, as k→∞, the matrix Ak approaches the constant matrix
each of whose identical columns is the eigenvector of A associated with λ1=1 that has the sum of its elements equal to 1. The 2×2 stochastic matrix A of Example 1 illustrates this general result, with λ1=1, λ2=34, and v1=(25,35).
Next, we consider a predator-prey population consisting of the foxes and rabbits living in a certain forest. Initially, there are F0 foxes and R0 rabbits; after k months, there are Fk foxes and Rk rabbits. We assume that the transition from each month to the next is described by the equations
where the constant r>0 is the “capture rate” representing the average number of rabbits consumed monthly by each fox. Thus
where
The term 0.4Fk in the first equation in (10) indicates that, without rabbits to eat, only 40% of the foxes would survive each month, while the term 0.3Rk represents the growth in the fox population due to the available food supply of rabbits. The term 1.2Rk in the second equation indicates that, in the absence of any foxes, the rabbit population would increase by 20% each month. We want to investigate the long-term behavior of the fox and rabbit populations for different values of the capture rate r of rabbits by foxes.
The characteristic equation of the transition matrix A in (12) is
The quadratic formula then yields the equation
which gives the eigenvalues of A in terms of the capture rate r. Examples 3, 4, and 5 illustrate three possibilities (for different values of r) for what may happen to the fox and rabbit populations as k increases:
Fk and Rk may approach constant nonzero values. This is the case of stable limiting populations that coexist in equilibrium with one another.
Fk and Rk may both approach zero. This is the case of mutual extinction of the two species.
Fk and Rk may both increase without bound. This is the case of a population explosion.
Stable limiting population If r=0.4, then Eq. (13) gives the eigenvalues λ1=1 and λ2=0.6. For λ1=1, the system (A−λI)v=0 is
so an associated eigenvector is v1=[12]T. For λ2=0.6, the system (A−λI)v=0 is
so an associated eigenvector is v2=[32]T. It follows that A=PDP−1, where
We are now ready to calculate Ak. If k is sufficiently large that (0.6)k≈0—for instance, (0.6)25≈0.000003—then the formula Ak=PDkP−1 yields
Hence it follows that if k is sufficiently large, then
—that is,
Assuming that the initial populations are such that α>0 (that is, 3R0>2F0), (14) implies that, as k increases, the fox and rabbit populations approach a stable situation in which there are twice as many rabbits as foxes. For instance, if F0=R0=100, then when k is sufficiently large, there will be 25 foxes and 50 rabbits.
Mutual extinction If r=0.5, then Eq. (13) gives the eigenvalues λ1=0.9 and λ2=0.7. For λ1=0.9, the system (A−λI)v=0 is
so an associated eigenvector is v1=[35]T. For λ2=0.7, the system (A−λI)v=0 is
so an associated eigenvector is v2=[11]T. It follows that A=PDP−1, with
Now both (0.9)k and (0.7)k approach 0 as k increases without bound (k→+∞). Hence if k is sufficiently large, then the formula Ak=PDkP−1 yields
so
Thus Fk and Rk both approach zero as k→+∞, so both the foxes and the rabbits die out—mutual extinction occurs.
Population explosion If r=0.325, then Eq. (13) gives the eigenvalues λ1=1.05 and λ2=0.55. For λ1=1.05, the system (A−λI)v=0 is
Each equation is a multiple of −13x+6y=0, so an associated eigenvector is v1=[613]T. For λ2=0.55, the system (A−λI)v=0 is
so an associated eigenvector is v2=[21]T. It follows that A=PDP−1 with
Note that (0.55)k approaches zero but that (1.05)k increases without bound as k→+∞. It follows that if k is sufficiently large, then the formula Ak=PDkP−1 yields
and therefore
Hence, if k is sufficiently large, then
and so
If γ>0 (that is, if 2R0>F0), then the factor (1.05)k in (17) implies that the fox and rabbit populations both increase at a rate of 5% per month, and thus each increases without bound as k→+∞. Moreover, when k is sufficiently large, the two populations maintain a constant ratio of 6 foxes for every 13 rabbits. It is also of interest to note that the monthly “population multiplier” is the larger eigenvalue λ1=1.05 and that the limiting ratio of populations is determined by the associated eigenvector v1=[613]T.
In summary, let us compare the results in Examples 3, 4, and 5. The critical capture rate r=0.4 of Example 3 represents a monthly consumption of 0.4 rabbits per fox, resulting in stable limiting populations of both species. But if the foxes are greedier and consume more than 0.4 rabbits per fox monthly, then the result is extinction of both species (as in Example 4). If the rabbits become more skilled at evading foxes, so that less than 0.4 rabbits per fox are consumed each month, then both populations grow without bound, as in Example 5.
One of the more notable and important theorems in advanced linear algebra says that every matrix satisfies its own characteristic equation (as proved for the 2×2 case in Problem 29 of Section 3.4).
In Example 7 of Section 6.1, we found that the matrix
has the characteristic polynomial
so
by the Cayley-Hamilton theorem. Because
it follows from (19) that
Multiplication by A now gives
Thus we can use the Cayley-Hamilton theorem to express (positive integral) powers of the 3×3 matrix A in terms of A and A2. We also can use the Cayley-Hamilton theorem to find the inverse matrix A−1. If we multiply Eq. (19) by A−1, we can solve the resulting equation −A2+7A−16I+12A−1=0:
In Problems 1 through 10, a matrix A is given. Use the method of Example 1 to compute A5.
[3−210]
[5−63−4]
[6−64−4]
[4−32−1]
[5−43−2]
[6−102−3]
[130020002]
[1−210100−22]
[1−31020002]
[4−312−11002]
Find A10 for each matrix A given in Problems 11 through 14.
[10065221−15−6]
[11−6−220−11−4001]
[1−112−214−41]
[5−5−32−2−14−4−3]
15–24. Use the Cayley-Hamilton theorem (as in Example 6 ) to find A−1, A3, and A4 for each matrix A given in Problems 5-14 (respectively).
In Problems 25 through 30, a city-suburban population transition matrix A (as in Example 2) is given. Find the resulting long-term distribution of a constant total population between the city and its suburbs.
A=[0.90.10.10.9]
A=[0.850.050.150.95]
A=[0.750.150.250.85]
A=[0.80.10.20.9]
A=[0.90.050.10.95]
A=[0.80.150.20.85]
Problems 31 through 33 deal with a fox-rabbit population as in Examples 3 through 5, except with the transition matrix
in place of the one used in the text.
If r=0.16, show that in the long term the populations of foxes and rabbits are stable, with 5 foxes for each 4 rabbits.
If r=0.175, show that in the long term the populations of foxes and rabbits both die out.
If r=0.135, show that in the long term the fox and rabbit populations both increase at the rate of 5% per month, maintaining a constant ratio of 10 foxes for each 9 rabbits.
Suppose that the 2×2 matrix A has eigenvalues λ1=1 and λ2=−1 with eigenvectors v1=(3,4) and v2=(5,7), respectively. Find the matrix A and the powers A99 and A100.
Suppose that |λ|=1 for each eigenvalue λ of the diagonalizable matrix A. Show that An=I for every even positive integer n.
Suppose that
Show that A2n=I and that A2n+1=A for every positive integer n.
Suppose that
Show that A4n=I, A4n+1=A, A4n+2=−I, and A4n+3=−A for every positive integer n.
The matrix
is not diagonalizable. (Why not?) Write A=I+B. Show that B2=0 and thence that An=[1n01].
Consider the stochastic matrix
where 0<p<1 and 0<q<1. Show that the eigenvalues of A are λ1=1 and λ2=p+q−1, so that |λ2|<1.
Suppose that A is an n×n stochastic matrix-the sum of the elements of each column vector is 1. If v=(1,1,…,1), show that ATv=v. Why does it follow that λ=1 is an eigenvalue of A?
In his Liber abaci (Book of Calculation) published in 1202, Leonardo Fibonacci* asked the following question: How many pairs of rabbits are produced from a single original pair in one year, if every month each pair begets a new pair, which is similarly productive beginning in the second succeeding month? The answer is provided by the Fibonacci sequence
in which each term is the sum of its two immediate predecessors. That is, the sequence is defined recursively as follows:
Then sn is the number of rabbit pairs present after n months. Note that if
then
where x0=(1,1).
Show that A has eigenvalues λ1=12(1+√5) and λ2=12(1−√5) with associated eigenvectors v1=(1+√5,2) and v2=(1−√5,2), respectively.
Compute
to derive the amazing formula
Thus after 1 year the number of rabbit pairs is
Show that there are 75,025 rabbit pairs after 2 years and over 2.5 trillion rabbit pairs after 5 years.
18.221.234.114