Math 215 Spring 2003HW #3 Solutions

1.7, # 5: Determine if the columns of the following matrix form a linearly independent set: 0 8 5 3 7 4 1 5 4 1 3 2 If we label the columns of this matrix as a1 , a2 , and a3 , we are seeking a nontrivial solution (c1 , c2 , c3 ) = (0, 0, 0) of the equation c1 a1 + c2 a2 + c3 a3 = 0 As a linear system, this is:

0 0 8 5 c 1 3 7 4 c2 = 0 0 1 5 4 c3 0 1 3 2

We consider the augmented matrix: 0 8 5 3 7 4 1 5 4 1 3 2

0 0 0 0

From Mathematica we nd the reduced form of this augmented matrix to be: 1 0 0 0 0 1 0 0 0 0 1 0 0 0 0 0 This has pivots in the rst three columns, i.e., those corresponding to the coefcient matrix, which means that the system has only one solution (c1 , c2 , c3 ) = (0, 0, 0). Thus, the columns of this matrix are linearly independent. 1.7 # 10: Given v1 = (1, 5, 3), v2 = (2, 10, 6), and v3 = (2, 9, h), (a) for which values of h is v3 in Span{v1 , v2 }, and (b) for which values of h is {v1 , v2 , v3 } linearly dependent?

(a) We are seeking a solution (c1 , c2 ) to the equation v3 = c1 v1 + c2 v2 . As a linear system, we write this as: 2 1 2 5 10 c1 = 9 . c2 3 6 h We consider the augmented matrix: 1 2 2 5 10 9 . 3 6 h Replacing Row 2 by Row 2 plus 5 times Row 1: 1 2 2 0 0 1 . 3 6 h Replacing Row 3 by Row 3 plus 3 1 0 0 times Row 1: 2 2 0 1 . 0 h+6

If h = 6, this is already in echelon form, and we see that it is an inconsistent system, due to the pivot 1 in the last column. If h = 6, we do one more step for row reduction, by replacing Row 3 by Row 3 plus (h + 6) times Row 2: 1 2 2 0 0 1 . 0 0 0 Here again, we see that the system is inconsistent due to the pivot in the last column. Thus, v3 is not in Span{v1 , v2 }, no matter what h is: (b) We are seeking a nontrivial solution (c1 , c2 , c3 ) to c 1 v1 + c 2 v2 + c 3 v3 = 0 As a linear system, this is: 0 1 2 2 c1 5 10 9 c2 = 0 0 3 6 h c3 0

We consider the augmented matrix: 1 2 2 0 5 10 9 0 3 6 h 0 From Mathematica, the row-reduced form of this augmented matrix is: 1 2 0 0 0 0 1 0 0 0 0 0 This is a consistent system since there is no pivot in the last column, and, further, there is a free variable (x2 ), which means there is more than one solution, i.e., a nontrivial solution apart from (c1 , c2 , c3 ) = (0, 0, 0). Thus, these vectors are linearly dependent whatever h is. 1.7, # 23: Describe the possible echelon forms of a 3 3 matrix A with linearly independent columns. By denition, since the columns are linearly independent, there must be a unique solution (c1 , c2 , c3 ) = (0, 0, 0) to c1 a1 + c2 a2 + c3 a3 = 0, where aj are the columns of A. Thus, the reduced form of A must have a pivot in every column (since otherwise there would be a free variable in the row-reduced form of the augmented matrix A 0 ). Since the pivots must go southeast, they must run along the diagonal of the matrix, and then due to the constraints of echelon form (zeroes below pivots), we can say for sure that the echelon form is P 0 P , 0 0 P where P is an non-zero number (the pivot) and is any number. 1.7, # 24: Describe the possible forms of the reduced form of a 2 2 matrix A with linearly dependent columns. By denition, since the columns are linearly dependent, there must be a solution (c1 , c2 ) other than (0, 0) to c1 a1 + c2 a2 = 0, where aj are the columns of A. Thus, the reduced form of A can not have two pivots (since if it did, following the argument in # 23, we would get just the

trivial solution to the above equation). There are two cases: A has zero pivots or A has one pivot. In the former case, there is only one possible form for the echelon form of A: 0 0 0 0 In the latter case, the pivot can be either in the (1, 1) or (1, 2) positions, giving the echelon forms: P 0 P or , 0 0 0 0 where P again represents a non-zero number (the pivot) and represents any real number. 1.7, # 26: Describe the possible forms of the reduced form of a 4 3 matrix A = a1 a2 a3 such that {a1 , a2 } is linearly independent and a3 is not in Span{a1 , a2 }. These conditions are exactly the same as saying that {a1 , a2 , a3 } is linearly independent. By denition, since the columns are linearly independent, there must be a unique solution (c1 , c2 , c3 ) = (0, 0, 0) to c1 a1 + c2 a2 + c3 a3 = 0. Thus, the echelon form of A must have a pivot in every column (since otherwise there would be a free variable in the row-reduced form of the augmented matrix A 0 ). Since the pivots must go southeast, they must run diagonally down from the (1, 1) entry of the matrix, and then due to the constraints of echelon form, we can say for sure that the echelon form is P 0 P 0 0 P 0 0 0 where P represents a non-zero number (the pivot) and represents any real number. 1.7, # 41: Use as many columns from the following matrix A to form a matrix B with the property that Bx = 0 has only the trivial solution: 8 3 0 7 2 9 4 5 11 7 A= 6 2 2 4 4 5 1 7 0 10

The condition that Bx = 0 has only the trivial solution is exactly the same as saying that the columns of B need to be linearly independent. To see how to do this, lets rst see in what ways the columns of A are linearly dependent, i.e., we will seek the solutions (c1 , c2 , c3 , c4 , c5 ) to c1 a1 + c2 a2 + c3 a3 + c4 a4 + c5 a5 = 0, where aj are the columns of A. We write the augmented matrix of this system: 8 3 0 7 2 0 9 4 5 11 7 0 6 2 2 4 4 0 5 1 7 0 10 0 In Mathematica, we nd that the 1 0 0 0 reduced form of this augmented matrix is: 0 3 1 0 0 1 8 5 0 0 0 0 0 1 0 0 0 0 0 0

Currently, we have two free variables in the solution of this system (e.g., c3 and c4 ), so there are lots of nontrivial solutions to c1 a1 + c2 a2 + c3 a3 + c4 a4 + c5 a5 = 0, Which columns could we eliminate so that this would only have the trivial solution of all cs equal to zero? Well, since there are two free variables, we will need to remove two columns, to get down to a unique solution. For example, we could remove columns three and four. Thus, 8 3 2 9 4 7 B= 6 2 4 5 1 10 To verify, lets show that c 1 b1 + c 2 b2 + c 3 b3 = 0 has only the trivial solution c1 = c2 for this system: 8 9 6 5 = c3 = 0. We write the augmented matrix 3 2 4 7 2 4 1 10 0 0 0 0

From Mathematica, the reduced form for 1 0 0 0 1 0 0 0 1 0 0 0

this augmented matrix is: 0 0 0 0

Sure enough, this indicates a unique solution c1 = c2 = c3 = 0, since there are pivots in all columns but the last. 1.8, # 8: How many rows and columns must a matrix A have in order to dene a mapping from R4 into R5 by the rule T (x) = Ax? Well, since x lives in R4 , we need A to have 4 columns, so that the matrix-vector product Ax is dened. Furthermore, the result of Ax will have as many rows as A has, so we need A to have 5 rows in order that T (x) has 5 rows and thereby lives in R5 . So, A must have 5 rows and 4 columns. 1.8. # 11: Let b = (1, 1, 0) and let 1 4 7 5 A = 0 1 4 3 . 2 6 6 4 Is b in the range of the linear transformation x Ax We need to nd out if there is a solution x to the equation Ax = b. The augmented matrix for this linear system is: 1 4 7 5 1 0 1 4 3 1 . 2 6 6 4 0 From Mathematica, the reduced form for this augmented matrix is: 1 0 9 7 3 0 1 4 3 1 . 0 0 0 0 0 Since there is no pivot in the last column, the linear system is consistent, and therefore, yes, b is in the range of the linear transformation. 1.8, # 19: Let e1 = (1, 0) e2 = (0, 1), y1 = (2, 5), y2 = (1, 6), and let T : R2 R2 be a linear transformation that maps e1 to y1 and e2 to y2 . Find the images of (5, 3) and (x1 , x2 ).

Since (5, 3) = 5e1 3e2 , we have that: T 5 3 = T (5e1 3e2 ) .

Now, since T is a linear transformation, we can rewrite the right-hand side (using equation (4) from p. 77): T 5 3 = 5T (e1 ) 3T (e2 ),

which, given the information in the problem, means that: T 5 3 = 5y1 3y2 = 5 2 1 10 3 13 3 = + = . 5 6 25 18 7

Similarly, since (x1 , x2 ) = x1 e1 + x2 e2 , we have that: T x1 x2 = T (x1 e1 + x2 e2 ) .

Now, since T is a linear transformation, we can rewrite the right-hand side (using equation (4) from p. 77): T x1 x2 = x1 T (e1 ) + x2 T (e2 ),

which, given the information in the problem, means that: T x1 x2 = x 1 y1 + x 2 y2 = x 1 2 1 2x1 x2 + x2 = . 5 6 5x1 + 6x2

1.8, # 24: Suppose vectors v1 , . . . vp span Rn , and let T : Rn Rn be a linear transformation. Suppose T (vi ) = 0 for i = 1, . . . , p. Show that T is the zero transformation. Consider any vector x in Rn . Since v1 , . . . vp span Rn , we know, by denition of span, that there exist real numbers c1 , . . . cp so that x = c 1 v1 + c 2 v2 + + c p vp . Thus, T (x) = T (c1 v1 + c2 v2 + + cp vp ). Now, using the linearity of T (specically, property (5) on p. 77), this means that: T (x) = c1 T (v1 ) + c2 T (v2 ) + + cp T (vp ).

But, we know that T (vi ) = 0, so we have that: T (x) = c1 0 + c2 0 + + cp 0 = 0 + 0 + + 0 = 0. 1.8, # 25: Given v = 0 and p in Rn , the line through p in the direction of v has the parametric equation x = p + tv . Show that a linear transformation T : Rn Rn maps this line onto another line or onto a single point. The original line is equal to the set of all points x = p + tv as t ranges over all real numbers. Now apply T to this set to nd its image. By linearity of T : T (p + tv ) = T (p) + T (tv ) = T (p) + tT (v ). Now, T (p) is some vector in Rn , call it p , and T (v ) is some vector in Rn , call it v . So, the image of the line is the set of all p + tv as t ranges over all real numbers. If v is nonzero, this is the parametric equation of a line. If v equals the zero vector, this is just the point p (a degenerate line). 1.8, # 29ab: Dene f : R R by f (x) = mx + b. Show that f is a linear transformation when b = 0. Find a property of a linear transformation that is violated when b = 0. If b = 0, then we can show that: f (x + y ) = m(x + y ) = mx + my = f (x) + f (y ), and f (cx) = m(cx) = c(mx) = cf (x) By denition, this says that f is linear. On the other hand, if b = 0, then f (2x) = m(2x) + b = 2mx + b, whereas 2f (x) = 2(mx + b) = 2mx + 2b, which are dierent, since b = 2b. 1.8, # 32: Show that the transformation T dened by T (x1 , x2 ) = (4x1 2x2 , 3|x2 |) is not linear. Let (x1 , x2 ) = (1, 2) and (y1 , y2 ) = (1, 2).

Then, T x1 y + 1 x2 y2 =T 1 1 + 2 2 =T 2 0 = 4(2) 2(0) 8 = . 3|0| 0

whereas T x1 x2 +T y1 y2 = T = Thus, T y x1 + 1 y2 x2 == T x1 x2 +T y1 y2 , 1 2 +T 1 2

4(1) 2(2) 4(1) 2(2) 0 8 8 + = + = . 3|2| 3| 2| 6 6 12

for this choice of x1 , x2 , y1 , and y2 , which means that T is not linear. 1.8, # 34: Let T : Rn Rm be a linear transformation. Show that if T maps two linearly independent vectors onto a linearly dependent set, then the equation T (x) = 0 has a nontrivial solution. We are given that u and v in Rn are linearly independent, which means that the only solution to the equation cu + dv = 0 is c = d = 0. Further, we are given that T (u) and T (v ) in Rm are linearly dependent, which means that there is some solution a, b (not both zero) to the equation aT (u) + bT (v ) = 0. Note however, that since T is linear aT (u) = T (au), and bT (v ) = T (bv ). Thus, we have that T (au + bv ) = 0. But, look! We now have a vector w for which T (w) = 0 (namely, w = au + bv . Is w the zero vector? No way, man. w is au + bv , and we saw above that the only way for au + bv would be for a = b = 0, and we know that a and b are not both zero. Thus, w is our nontrivial solution.

Project # 2: Rental Car Returns The U-Rent-It rental car company has three oces in Philadelphia: South Philly, West Philly, and North Philly. Customers can return cars to any oce without penalty. An internal study has determined that customers renting from West return cars to West 80% of the time, to South 15% of the time, and to North 5% of the time. Customers renting from South return cars to South 85% of the time, to West 12% of the time, and to North 3% of the time. Customers renting from North return cars to North 90% of the time, to West 8% of the time, and to South 2% of the time. U-Rent-It owns 6000 cars, and, for simplicity, assume that all cars are rented every morning, and returned every evening. (Also allow for non-integer numbers of cars in your computations, even though that is not realistic) (a) Construct a matrix-vector product that determines the number of cars (Wnew , Snew , Nnew ) that will be at the oces tomorrow, given that there are (W, S, N ) cars at the oces today: W Wnew Snew = A S . N Nnew At the end of a given day, West will receive 80% of the cars rented from West, 12% of the cars rented from South, and 8% of the cars rented from North. So, Wnew = 0.8W + 0.12S + 0.08N. Similarly, at the end of a given day, South will receive 15% of the cars rented from West, 85% of the cars rented from South, and 2% of the cars rented from North. So, Snew = 0.15W + 0.85S + 0.02N. Similarly, at the end of a given day, North will receive 5% of the cars rented from West, 3% of the cars rented from South, and 90% of the cars rented from North. So, Nnew = 0.05W + 0.03S + 0.90N. Thus, Wnew 0.8 0.12 0.08 W Snew = 0.15 0.85 0.02 S . Nnew 0.05 0.03 0.90 N

Prove algebraically (using your matrix A) that if W + S + N = 6000, then Wnew + Snew + Nnew = 6000. It certainly seems like the number of cars should be preserved. Lets check: Wnew + Snew + Nnew = (0.8W + 0.12S + 0.08N ) + (0.15W + 0.85S + 0.02N ) + (0.05W + 0.03S + 0.90N ) = W + S + N = 6000. (b) Assume that on the morning of January 1, there are 1000 cars at West, 2000 cars at South, and 3000 cars at North. Simulate 31 days of rentals and returns, and plot the number of cars at each oce over time. What do you observe? How many cars are at each oce on the evening of Jan. 31? We simulated this matrix-vector product 31 times, and output the number of cars in West (red), South (green), and North (blue) at the end of each of the 31 days:

The number of cars appears to level o near the end of the month to a fairly constant level. On the evening of Jan. 31, there are 2035 cars at West, 2253 cars at South, and 1712 cars at North. (c) Repeat part (b) assuming that we start with 4000 cars at West, 1500 cars at South, and 500 cars at North.

We repeated the simulation with the new initial conditions, and the results are shown below:

Once again, the number of cars appears to level o near the end of the month to a fairly constant level, and, in fact, to a level very similar for each oce as the previous example. On the evening of Jan. 31, there are 2040 cars at West, 2273 cars at South, and 1687 cars at North. (d) In order for the distribution of cars to reach an steady equilibrium, we would need the number of cars returned to each oce in the evening to equal the number rented that morning. Write this condition as a linear system and solve it. Compare the results to what you found in parts (b) and (c). At equilibrium, we would need Wnew = W , Snew = S , and Nnew = N . Given the equations above that dene Wnew , Snew , and Nnew , this means that: W = 0.8W + 0.12S + 0.08N S = 0.15W + 0.85S + 0.02N N = 0.05W + 0.03S + 0.90N, or, 0 = 0.2W + 0.12S + 0.08N 0 = 0.15W 0.15S + 0.02N 0 = 0.05W + 0.03S 0.10N.

We can write this as a matrix-vector system: 0 W 0.2 0.12 0.08 0.15 0.15 0.02 S = 0 . 0 0.05 0.03 0.10 N The augmented matrix for this system is: 0.2 0.12 0.08 0 0.15 0.15 0.02 0 . 0.05 0.03 0.10 0 We use Mathematica to row-reduce this matrix (Note: I wrote the entries as fractions so that Mathematica could do the computation in exact arithmetic. If you enter them as decimals, it may not detect that there should be a row of exact zeroes at the bottom.) The reduced form reported by Mathematica is: 1 0 6/5 0 0 1 4/3 0 0 0 0 0 Thus, N is a free variable, and S 4N/3 = 0, or S = 4N/3, while W 6N/5 = 0, or W = 6N/5. Now, we know that W + S + N = 6000, so 6 4 N + N + N = 6000, 5 3 or or N= Then and, 108000 6 = 2038. W = N= 5 53 These results match the results of our two simulations quite well (and presumably would match even better if we ran the simulations for more than 31 days). 53 N = 6000, 15 90000 = 1698. 53

360000 4 S= N= = 2264, 3 159