Solutions to Exercises from D. & S.

Lay
book “Linear algebra and its applications”
Chapter 1
Subsection 1.1
Ex. 1. (-8,3)

Ex. 2. (12,-7)

Ex. 3. (4/7,9/7)

Ex. 4. (9/4,1/4)

Ex. 5. R2-> R2+3R3 and R1-> R1-5R3

Ex. 6. R4-> R4-3R3 and R4-> R4/(-5)

Ex. 7. Inconsistent, no operation needed, no solution (solution set is empty).

Ex. 8. {(0,0,0)}

Ex. 9. {(4,8,5,2)}

Ex. 10. {(-3,-5,6,-3)}

Ex. 11. Inconsistent, solution set is the empty set.

Ex. 12. Inconsistent, solution set is the empty set.

Ex. 13. {(5,3,-1)}

Ex. 14. {(2,-1,1)}

Ex. 15. Consistent, it does have solution.

Ex. 16. Consistent, it does have solution.

Ex. 17. Yes, exactly one point in common.

Ex. 18. Inconsistent, no point in common.

Ex. 19. There is solution exactly when h is different from 2.

Ex. 20. Consistent for every value of h.

Ex. 21. Consistent for every value of h.

Ex. 22. Consistent if and only if h = -5/3.

Ex. 23. aT bF cF dT

Ex. 24. aT bF cF dT

Ex. 25. Consistent if and only if k+2g+h=0.

Ex. 26. A possible choice is the matrix (1 0 0 -2; 0 1 0 1; 0 0 1 0). Any combination of those rows
will give another matrix with the same solution set, for instance (1 0 0 -2; 0 1 1 1; 0 0 1 0) and

(1 0 1 -2; 0 1 0 1; 0 0 1 0).

Ex. 27. d not equal to 3c.

Ex. 28. ad not equal to bc.

Ex. 29. Interchange rows 1 and 2. That is also the inverse operation.

Ex. 30. Divide row 2 by -2. Its inverse is to multiply row 2 by -2.

Ex. 31. R3 -> R3-4R1. R3 -> R3+4R1.

Ex. 32. R3 -> R3+3R2. R3 -> R3-3R2.

Ex. 33. – T1 + 4 T2 -T3 =60; - T2 + 4 T3 – T4 = 70; - T1 – T3 + 4T4 = 40.

Ex. 34. (20, 27.5, 30, 22.5)

Subsection 1.2
Ex. 1. a and b Reduced echelon form, d echelon but not reduced, c not echelon.

Ex. 2. a Reduced echelon form, b and d echelon but not reduced, c not echelon.

Ex. 3. Pivot columns are columns 1 and 2.

Ex. 4. Pivot columns are columns 1, 2 and 4.

Ex. 5. Possible echelon forms are those matrices (a b; c d) where

- a= c = d = 0, b is a pivot unless it is 0
- c=d=0, a is a pivot
- a and d are pivots, c=0

Ex. 6. Possible echelon forms are those matrices (a b; c d; e f) where e = f = 0, and a, b, c, d are
as in exercise 5.

Ex. 7. {(-5-3x2, x2, 3): x2 is real}

Ex. 8. {(-9, 4, x3): x3 is real}

Ex. 9. {(4+5x3, 5+6x3, x3): x3 is real}

Ex. 10. {(-4+2x2, x2, -7): x2 is real}

Ex. 11. {((4/3)x2-(2/3)x3, x2, x3): x2, x3 are real}

Ex. 12. {(5+7x2-6x4, x2, -3+2x4, x4): x2, x4 are real}

Ex. 13. {(5+3x5, 1+4x5, x3, 4-9x5, x5): x3, x5 are real}

Ex. 14. {(-9-7x3, 2+6x3+3x4, x3, x4, 0): x3, x4 are real}
Ex. 15. A) Consistent and unique. B) Inconsistent.

Ex. 16. A) Consistent and unique. B) Consistent with many solutions.

Ex. 17. Solution exists if and only if h=7/2.

Ex. 18. Solution exists if and only if h not equal to -15.

Ex. 19. A) If h=2 and k not 8, inconsistent. B) If h not 2, consistent and unique solution. C) If h=2
and k = 8, consistent with many solutions.

Ex. 20. A) If h=9 and k not 6, inconsistent. B) If h not 9, consistent and unique solution. C) If h=9
and k = 6, consistent with many solutions.

Ex. 21. FFTTF

Ex. 22. FFTFT

Ex. 23. Consistent: with 3 pivots it can’t contain a row of the form (0,…,0, b).

Ex. 24. Inconsistent: there must be a pivot in the last column (notice previous exercise was
NOT augmented matrix).

Ex. 25. Consistent: Non-augmented already has pivot in each row, therefore augmented does
not have a pivot in last column.

Ex. 26. With 3 pivots, there are no free variables. In the augmented matrix, whatever the last
column, that must be a solution.

Ex. 27. Every column in the coefficient matrix is a pivot column.

Ex. 28. Every column in the augmented matrix except the last one is a pivot column and the
last one is not.

Ex. 29. There must be free variables since there are not enough rows to make each variable
basic (each through a pivot on a different row).

Ex. 30. x1+x2+x3=0 and x1+x2+x3=1.

Ex. 31. x1+x2=1, x1=1, x2=0 has 3 equations and the solution (1,0) solves the whole system.

Ex. 32. Information needed can be found in Section 1.2 numerical note. n=30 gives 18000 flops
for forward and 900 for backward so proportion is around 1/21. For n=300, we get 1/210.

Ex. 33. P(t)=7+6t-t^2.

Ex. 34. 6480 lb.

Subsection 1.3
Ex. 1. u+v=(-4,1); u-2v=(5,4).

Ex. 2. u+v=(5,1); u-2v=(-1,4).

Ex. 3. Drawing exercises not solved here.

Ex. 4. Drawing exercises not solved here.

Ex. 5. 6x1-3x2=1; -x1 +4x2=-7; 5x1=-5.

Ex. 6. -2x1+8x2+x3=0; 3x1 +5x2-6x3=0.

Ex. 7. a=u-2v; b=2u-2v; c=2u-(7/2)v; d=3u-4v.

Ex. 8. w=2v-u; x=2v-2u; y=(7/2)v-2u; z=4v-3u.

Ex. 9. x1(0,4,-1) + x2(1,6,3) + x3(5,-1,-8)=(0,0,0).

Ex. 10. x1(4,1,8) + x2(1,-7,6) + x3(3,-2,-5)=(9,2,15).

Ex. 11. Yes.

Ex. 12. No.

Ex. 13. No.

Ex. 14. Yes.

Ex. 15. 5 such vectors are for instance 1v1+0v2=(7,1,-6), (-1)v1+0v2=(-7,-1,6), 0v1+0v2=(0,0,0),
0v1+1v2=(-5,3,0) and 0v1+(–1)v2=(5,-3,0).

Ex. 16. 5 such vectors are for instance 1v1+0v2=(3,0,2), (-1)v1+0v2=(-3,0,-2), 0v1+0v2=(0,0,0),
0v1+1v2=(-2,0,3) and 0v1+(–1)v2=(2,0,-3).

Ex. 17. Only when h=-17.

Ex. 18. Only when h=-7/2.

Ex. 19. It is the straight line through 0 and v1 (v2 is a multiple of v1).

Ex. 20. The plane y=0 (the xz-plane).

Ex. 21. The system is consistent for every value of h and k since the reduced echelon form of
the augmented matrix has pivots in the first two columns, and so there is no row with zeros in
every position except the last.

Ex. 22. One such example is the matrix (1 1 1; 1 1 1; 1 1 1) and b=(1,2,3).

Ex. 23. FFTTF

Ex. 24. TTFTT

Ex. 25. A) No, that set only has 3 elements and b is not one of them. B) Every vector of R3 is in
W, in particular b. C) a1 is 1a1+0v2+0v3 and so a1 is in that set.

Ex. 26. A) Yes. B) a3 is a linear combination of the columns of A.

Ex. 27. A) 5 days of operation’s output of mine 1. B) x1v1+x2v2=(150,2825). C) Mine 1 -> 3/2
days, mine 2-> 4 days.

Ex. 28. A) 27.6x1+30.2x2. B) x1 (27.6, 3100, 250) + x2 (30.2, 6400, 360). C) (3.9, 1.8)

Ex. 29. v=(1.3, 0.9, 0).

Ex. 30. Yes. The center of gravity is an average of the other vectors with some weights that can
be used to build a linear combination of the same vectors that represents the center of gravity.

Ex. 31. A) (10/3, 2). B) (w1,w2,w3)= (7/2, 1/2, 2).

Ex. 32. Yes there is a solution. No, it is not unique because there are too many vectors and the
reduced echelon form of the augmented matrix must have a free variable.

Ex. 33. And Ex. 34. Each property reduces to checking the same property for real numbers
instead of vectors. We know those properties for sums and multiplications of real numbers.

Subsection 1.4
Ex. 1. Undefined (sizes of rows on left do not match columns on the right).

Ex. 2. Undefined (sizes of rows on left do not match columns on the right).

Ex. 3. (-3, 1, -4).

Ex. 4. (7,8).

Ex. 5. 5(5,-2)+(-1)(1,-7) + 3(-8,3)+(-2)(4,-5)=(-8,16).

Ex. 6. (-2)(7,2,9,-3)+(-5)(-3,1,-6,2)=(1,-9,12,-4).

Ex. 7. (4 -5 7; -1 3 -8; 7 -5 0; -4 1 2)(x1,x2,x3)=(6,-8,0,-7).

Ex. 8. (4 -4 -5 3; -2 5 4 0) (z1,z2,z3,z4)=(4,13).

Ex. 9. x1(3,0) + x2(1,1) + x3(-5,4) = (9,0).

(3 1 -5; 0 1 4)(x1,x2,x3)=(9,0).

Ex. 10. x1(8,5,1)+x2(-1,4,-3)=(4,1,2).

(8 -1; 5 4; 1 -3)(x1,x2)=(4,1,2).

Ex. 11. (0, -3, 1)

Ex. 12. (0.6, -0.8, 1)

Ex. 13. u is in that plane because the equation Ax=u is consistent.

Ex. 14. No, because the equation Ax=u is inconsistent.

Ex. 15. It is consistent only when b2=-3b1.

Ex. 16. Consistent only when b1+2b2+b3=0.

Ex. 17 to 20. Always Theorem 4 is applicable. The first question is 3. All the other questions are
“no”.

Ex. 21. No, it can be seen since the last row in the reduced echelon form does not have a pivot.

Ex. 22. Yes, the reduced echelon form has 3 many pivots, and then it spans R3.

Ex. 23. FTFTTT

Ex. 24. TTTTFT

Ex. 25. (-3,-1,2)

Ex. 26. (3,-5)

Ex. 27. Qx=v where Q=[ q1 q2 q3 ], x=(x1,x2,x3)

Ex. 28. c1v1+c2v2+c3v3+c4v4+c5v5=v6 where c=(c1,…,c5)=(-3,2,4,-1,2), v1=(-3,5), v2= (5,8),

v3=(-4,1), v4=(9,-2), v5=(7,-4), v6=(8,-1).

Ex. 29. For example (1 -1 -1; -1 1 -1; -1 -1 1). Its reduced echelon form is the identity and then it
has the desired property.

Ex. 30. (1 1 1; 1 1 1; 1 1 1) is not in echelon form and when reduced it is (1 1 1; 0 0 0; 0 0 0) so it

does not span all of R3.

Ex. 31. It has more rows than columns and so its reduced echelon form must have a zero row.

Ex. 32. At most it will have 3 pivots, and so the 4th row of the augmented matrix will produce
inconsistency.

Ex. 33. It must not lead to free variables and so it must be (1 0 0; 0 1 0; 0 0 1; 0 0 0).

Ex. 34. It must have a pivot in each row.

Ex. 35. x1+x2 will be a solution of the system.

Ex. 36. 4y will be a solution of the system.

Ex. 37 - 40. No, no, yes, yes.

Ex. 41. Yes, if we delete for example column 4, the same pivots take the same spots and the
property is still true.

Ex. 42. Yes, we can delete one column (for example column 4) and still span everything, but we
can’t delete more than one column because then we would have insufficiently many vectors.

Subsection 1.5
Ex. 1-4. Yes, no, yes, yes.

Ex. 5. x=x3(5,-2,1).

Ex. 6. x=x3(-4,3,1).

Ex. 7. x=x3(-9,4,1,0) + x4(8,-5,0,1).

Ex. 8. x=x3(5,-2,1,0)+x4(7,6,0,1).

Ex. 9. x=x2(3,1,0)+x3(-2,0,1).

Ex. 10. x=x2(3,1,0,0)+x3(0,0,1,0)+x4(4,0,0,1).

Ex. 11. x=x2(4,1,0,0,0,0)+x4(0,0,0,1,0,0)+x6(-5,0,1,0,4,1).

Ex. 12. x=x2(-5,1,0,0,0,0)+x4(-8,0,7,1,0,0)+x5(1,0,-4,0,1,0).

Ex. 13. It is the line through (5,-2,0) with direction (4,-7,1).

Ex. 14. It is the line through (0,8,2,0) with direction (3,1,-5,1).

Ex. 15. It is the line through (-2,1,0) with direction (5,-2,1). It is also the line through (-2,1,0)
parallel to the line solving Exercise 5.

Ex. 16. It is the line through (-5,3,0) with direction (-4,3,1). It is also the line through (-5,3,0)
parallel to the line solving Exercise 6.

Ex. 17. It is a plane passing through p=(-2,0,0) and parallel to the plane containing 0, u and v
where u =(-9,1,0) and v=(4,0,1), with equation x=p+tu+sv, t,s real.

Ex. 18. It is a plane passing through p=(4,0,0) and parallel to the plane containing 0, u and v
where u =(3,1,0) and v=(-5,0,1), with equation x=p+tu+sv, t,s real.

Ex. 19. There are several ways to write these, but one is: x1= -2-5t; x2=3t, t real.

Ex. 20. x1=3-7t, x2=-4+8t.

Ex. 21. (2,-5)+t(-5,6)

Ex. 22. (-6,3)+t(6,-7)

Ex. 23. TFFFFF

Ex. 24. FTTTF

Ex. 25. Substract one system (Aw=b) from the other (Ap=b) to get Av=0.

Ex. 26. If the nonhomog. System has more than one solution, their difference must solve the
homogeneous one. Also, if the homogeneous has more than one solution, the difference
between those and a particular solution of the nonhomogenous system must solve the
nonhomogeneous system.

Ex. 27. All of R3.

Ex. 28. No, otherwise A0=b but A0 must be 0.

Ex. 29 (a ,b) -32 (a ,b). (No, Yes), (Yes, No), (No, No), (Yes, Yes).

Ex. 33. (3,-1).

Ex. 34. (3,2).

Ex. 35. (1 -1 0; 0 1 -1; -1 0 1)

Ex. 36. (1 2 1; 1 2 1; 1 2 1)

Ex. 37. (1 -4; 1 -4), b=(0,1). No contradiction because in this case b makes the system
inconsistent.

Ex. 38. No, in that case at least one variable must be free.

Ex. 39. A(cu)=cAu=c0=0.

Ex. 40. A(cu+dv)= cAu + dAv=c0+d0=0+0=0.

Subsection 1.7
Ex. 1. No, the reduced echelon form has a zero row and so there must be a free variable.
Ex. 2. Yes, the reduced echelon form is the identity.

Ex. 3. No, the second vector is a multiple of the first one.

Ex. 4. Yes, the reduced echelon form is the identity.

Ex. 5. Yes, the reduced echelon form has 3 pivots.

Ex. 6. Yes, the reduced echelon form has 3 pivots.

Ex. 7. No, there are too many vectors.

Ex. 8. No, there are too many vectors.

Ex. 9. A) Inconsistent, so no value of h gives that. B) For every value of h, since v1 is a multiple
of v2, the set {v1,v2} is linearly dependent and so, also {v1,v2,v3}.

Ex. 10. A) No value. B) Every value.

Ex. 11. h=6.

Ex. 12. All values.

Ex. 13. All values.

Ex. 14. h=26.

Ex. 15. No, too many vectors.

Ex. 16. No, they are multiples of each other.

Ex. 17. No, there is a 0 column.

Ex. 18. No, too many vectors.

Ex. 19. Yes, not multiples of each other.

Ex. 20. No, there is a 0 column.

Ex. 21. FFTT

Ex. 22. TFTF

Ex. 23. (pivot anything anything; 0 pivot anything; 0 0 pivot)

Ex. 24. (pivot anything; 0 0); (0 pivot; 0 0); (0 0 ; 0 0);

Ex. 25. (pivot anything; 0 pivot; 0 0; 0 0); (0 pivot; 0 0; 0 0 ; 0 0);

Ex. 26. (pivot anything anything; 0 pivot anything; 0 0 pivot; 0 0 0)

Ex. 27. 5, otherwise there are free variables.

Ex. 28. 5, otherwise there are inconsistent systems depending on the element of R5.

Ex. 29. A=(1 0; 0 1; 0 0), B=(0 0; 0 0; 0 0).

Ex. 30. A) n B) We need to avoid free variables in the reduced echelon form.

Ex. 31. (1 1 -1).

Ex. 32. (1 2 -1).

Ex. 33. True because 2v1+v2-v3=0.

Ex. 34. True, if a set contains 0, it is linearly dependent.

Ex. 35. False, if v1=0 and v2 not 0, then they are linearly dependent.

Ex. 36. False, if v1=v2=v4=0 and v3=(0,0,0,1), they are linearly dependent.

Ex. 37. True, the same expression that gives 0 as a linear combination of v1,v2 and v3 serves as
a combination to express 0 in terms of v1, v2, v3 and v4.

Ex. 38. True, otherwise the smaller set would be linearly dependent, and when adding v4 we
would stay linearly dependent.

Ex. 39. One particular case is b=0. This implies linearly Independent.

Ex. 40. If every column has a pivot, there are no free variables.

Ex. 41. If we find the reduced echelon form we will find 3 pivot columns, which are linearly
independent. That submatrix is therefore as desired, and no bigger one can have that
property.

Ex. 42. Same as before but there are 4 pivots and so it can be done with 4 columns.

Ex. 43. It must be in the span since otherwise we would have a bigger set of linearly
independent vectors than before.

Ex. 44. Same explanation as before works in every case.

Solutions to Exercises from D. & S. Lay
book “Linear algebra and its applications”
Chapter 1: Sections 1.8 and 1.9
Subsection 1.8
Ex. 1. T(u)= (2; -6); T(v) = (2a; 2b)

Ex. 2. T(u)=(1/2; 0; -2) T(v)= (a/2; b/2, c/2)

Ex. 3. We need to find x from the RREF of the augmented matrix. It is (3; 1; 2) and it is unique.

Ex. 4. Same as before with x=(-5;-3;1).

Ex. 5. x3 is a free variable so x=(1;1;0) is a solution but not unique.

Ex. 6. x=(7;3;0) is a solution but not unique because there are free variables.

Ex. 7. a=5 b=6

Ex. 8. rows=5, columns=4

Ex. 9. We want to find all x: Ax=0, which is the homogeneous system, always consistent. The
solutions are x3 ·(9; 4;1) + x4 · ( -7;-3;1) where x3 and x4 are any real number.

Ex. 10. Since there are 4 pivots, only the trivial solution.

Ex. 12. Yes, the equation Ax=b has solution for every b because there is one pivot on each row.

Ex. 11. Same steps with b on the augmented matrix would give b0=(3;1;0) and taking
x=(3;1;0;0) would give (-1;1;0)

Ex. 13. Reflection through origin.

Ex. 14. Contraction.

Ex. 15. Projection onto y-axis.

Ex. 16. Reflection through diagonal.

Ex. 17. T(3u)=(6;3); T(2v)= (-2;6); T(3u+2v) = (4;9).

Ex. 18. Requires drawing.

Ex. 19. T(5;-3) = (13;7); T(x1;x2) = (2x1-x2; 5x1+6x2).

Ex. 20. A=(-2 7; 5 -3)

Ex. 21. TFTTT

Ex. 22. TFFTT

Ex. 23. apply the matrix (-1 0 ; 0 1) to the drawing.

Ex. 24. Since v1,...,vp span all of R^n, any other vector w in R^n has T(w) = T(c1v1+..cpvp) =
c1T(v1) + ...+ cpT(vp)=0.

Ex. 25.T(p+tv) = T(p) + tT(v). T(p) is a point and if T(v)=0 then this is that single point T(p) and if
not, it is a line through T(p).

Ex. 26.u,v are l.i. Vectors in R^3, any x in their span is x=su+tv and then T(x) = sT(u) + tT(v),
which is a point, line or plane depending on which of those T(u) or T(v) is zero or not.

Ex. 27. a) Clear from drawing that x= p + t(q-p) = tq + (1-t) p. b) The same with T(tq + (1-t)p)
= segment if T(p) is not equal to T(q) and the same T(p) if T(p)=T(q).

Ex. 28. T(au+bv)=aT(u)+bT(v).

Ex. 29. a) f(x) = mx then f(au+bv)= m (au+bv) = amu+bmv = af(u) + bf(v). b) f(0) = b not
0. c) Because it preserves straight lines.

Ex. 30. T(0) = b not 0.

Ex. 31. Suppose v1 is c2v2+c3v3. Then T(v1) = c2T(v2) + c3T(v3). The same if it is v2 or v3 who is
a linear combination of the others.

Ex. 32.T(0,1) + T(0,-1) = (0,6) while T(0,0)= (0,0).

Ex. 33. (0,0,0) goes to (0,4,0) which is not 0.

Ex. 34. c1T(u) + c2T(v) = 0 and then T(c1u+c2v)=0 but c1u+c2v is not 0 because u and v are l.i.

Ex. 35. T(c1u+c2v) = (c1u1+c2v1; c1u2 + c2v2; -c1u3-c2v3) = c1(u1;u2;-u3) + c2 (v1;v2;-v3) = c1

T(u) + c2 T(v).

Ex. 36.T(c1u+c2v) = (c1u1+c2v1; 0; c1u3+c2v3) = c1(u1;0;u3) + c2 (v1;0;v3) = c1 T(u) + c2 T(v).

Ex. 37. x4 is free and all solutions are x4 · (7/2; 9/2; 0; 1), for x4 real.

Ex. 38. x4 is free and all solutions are x4 · (-3/4; -5/4; 7/4; 1), for x4 real.

Ex. 39. Outside of our goals.

Subsection 1.9
Ex. 1. (3 -5; 1 2 ; 3 0; 1 0)

Ex. 2. (1 4 -5; 3 -7 4)

Ex. 3. (0 1; -1 0)

Ex. 4. square root of 2= s => A = 1/s (1 1 ; -1 1)

Ex. 5. (1 0 ; -2 1)

Ex. 6. (1 3; 0 1)

Ex. 7. square root of 2= s => A = 1/s (-1 1 ; 1 1)

Ex. 8. (0 -1; 1 0)
Ex. 9. (0 -1 ; -1 2)

Ex. 10. (0 -1; -1 0)

Ex. 11. -I

Ex. 12. pi/2

Ex. 13. requires drawing

Ex. 14. requires drawing

Ex. 15. (3 -2 0; 4 0 0 ; 1 -1 1)

Ex. 16. (1 -1; -2 1; 1 0)

Ex. 17. (0 0 0 0; 1 1 0 0; 0 1 1 0; 0 0 1 1)

Ex. 18. (-3 2; 1 -4; 0 0; 0 1)

Ex. 19. (1 -5 4; 0 1 -6)

Ex. 20. (2 0 3 -4)

Ex. 21. (7 ; -4)

Ex. 22. (5;3)

Ex. 23. TTFFF

Ex. 24.FTTFT

Ex. 25. Neither

Ex. 26. Onto but not one-to-one

Ex. 27. Onto but not one-to-one

Ex. 28. Onto and one-to-one

Ex. 29. (pivot anything anything; 0 pivot anything; 0 0 pivot)

Ex. 30. (pivot anything anything anything; 0 pivot anything anything; 0 0 pivot anything) or
(pivot anything anything anything ; 0 pivot anything anything; 0 0 0 pivot) or (pivot anything
anything anything; 0 0 pivot anything; 0 0 0 pivot) or (0 pivot anything anything; 0 0 pivot
anything; 0 0 0 pivot).

Ex. 31. n

Ex. 32. m

Ex. 33. The action over ei must be the same => same columns.

Ex. 34.T is onto exactly when there exists, for each b, an x : Ax = b.

Ex. 35. onto only when m <=n. one-to-one only when n <= m.

Ex. 36. T(S(cu+dv)) = T(cS(u)+dS(v))= c(TS)(u) + d (TS) (v)

Ex. 37.no because there is a free variable

Ex. 38. no because there is a free variable.

Ex. 39. no because there is a row of zeros in the RREF

Ex. 40. no because there is a row of zeros in the RREF

Solutions to Exercises from D. & S. Lay
book “Linear algebra and its applications”
Chapter 2 and Section 1.8
Subsection 2.1
Ex. 1. -2A= (-4 0 2 ; -8 10 -4); B-2A= (3 -5 3; -7 6 -7); AC undefined because dimensions don't
match. CD= (1 13; -7 -6).

Ex. 2. A+2B=(16 -10 1; 6 -13 -4); 3C-E undefined because dimensions don't match; CB = (9 -13
-5; -13 6 -5); EB undefined because dimensions don't match.

Ex. 3. 3I-A= (-1 1; -5 5); 3IA= (12 -3; 15 -6).

Ex. 4. A-5I= (4 -1 3; -8 2 -6; -4 1 3); 5IA= (45 -5 15; -40 35 -30; -20 5 40).

Ex. 5. (-7 4; 7 -6; 12 -7)

Ex. 6. (0 14; -3 -9; 13 4)

Ex. 7. 3x7

Ex. 8. 3

Ex. 9. k=5

Ex. 10. AB=AC=(1 -7; -2 14).

Ex. 11. AD=(2 3 5; 2 6 15; 2 12 25); DA= (2 2 2; 3 6 9; 5 20 25). In AD each column of A gets
multiplied by the corresponding diagonal entry of D. In DA each row of A gets multiplied by the
corresponding diagonal entry of D. Even though a good example of B would be A^(-1), the
exercise is thought so to lead to the example of taking a diagonal matrix with diagonal
constant different from 1 and 0, for instance, 2. In fact any linear combination of the 0 matrix,
the identity and A^(-1) will work as a B.

Ex. 12. (2 4; 1 2) is an example (any two vectors that are multiples of (2; 1) will work).

Ex. 13. QR where R = [r1 r2 … rp]

Ex. 14. Total costs of materials, labor, overhead for producing products B and C.

Ex. 15. FFTTF

Ex. 16. FTFFT

Ex. 17. b1= (7;4) b2=(-8;-5).

Ex. 18. The first two columns are equal.

Ex. 19. Same proportion between the columns of AB will hold.

Ex. 20. It is zero.

Ex. 21. They are linearly dependent.

Ex. 22. Whatever combination exists between the columns of B also applies to AB.

Ex. 23. Apply CA to any x solution to Ax=0. Then CAx= C0=0, but CA=I, and so, Ix=x, and so x=0.
It can't have so many columns because there are no free variables if the only solution to the
homogeneous system is x=0.

Ex. 24. Take x=Db and that is a solution. Since there is solution for every b, there must be a
pivot in each row, so there can't be more columns than rows.

Ex. 25. C must be in Rnm and D in Rmn. Therefore, D=ID=CAD= CI=C is at the same time in Rnm
and in Rmn.

Ex. 26. Solve the equations Ax= (1;0;0), Ax= (0;1;0), Ax= (0;0;1). Those x are 3 columns of D.

Ex. 27. u^Tv=-2a+3b-4c=v^Tu; uv^T=(-2a -2b -2c; 3a 3b 3c; -4a -4b -4c); vu^T= (-2a 3a -4a; -2b
3b -4b; -2c 3c -4c).

Ex. 28. u^Tv=v^Tu. (uv^T)^T=v^Tu.

Ex. 29. Study how the formula reduces to what happens with each entry. Each entry satisfies
the same because real numbers sum and multiplication have those properties.

Ex. 30. Study how the formula reduces to what happens with each entry. Each entry satisfies
the same because real numbers sum and multiplication have those properties.

Ex. 31. Apply Ix=x to each column of A.

Ex. 32. One can reduce it to showing that the transpose of A is the I times the transpose of A
and then apply previous exercise. If two matrices are equal so are their transposes.

Ex. 33. Write down the elements that we are summing.

Ex. 34. x^T B^T A^T

Ex. 35. Not part of our course.

Ex. 36. Not part of our course.

Ex. 37. (A+I)(A-I)=A^2-I always but (A+B)(A-B) = A^2 +BA-AB-B^2 and this is A^2-B^2 only when
AB=BA.

Ex. 38. First one always true. Second one only if A and B commute (AB=BA).

Ex. 39. Denote ek a vector with a 1 in the kth position and zeros elsewhere. S^2=[0 0 e1 e2 e3].
S^3= [0 0 0 e1 e2]. S^4 = [0 0 0 0 e1]. S^5=S^6=[0 0 0 0 0].

Ex. 40. I don't recommend to attempt this exercise by hand but as k grows A^k becomes more
and more similar to the matrix (1/3 1/3 1/3; 1/3 1/3 1/3; 1/3 1/3 1/3).

Subsection 2.2
Ex. 1. (2 -3; -5/2 4)

Ex. 2. (-2 1; 7/2 -3/2)

Ex. 3. (1 1; -7/5 -8/5)

Ex. 4. (-2 1; -7/4 3/4)

Ex. 5. x1=7, x2=-9.

Ex. 6. x1=2, x2=-5.

Ex. 7. a) A^(-1)= (6 -1; -5/2 ½) and so A^(-1)B =( -9 11 6 13; 4 -5 -2 -5). b) Same solution.

Ex. 8. A^(-1)=A^(-1)I=A^(-1)AD=ID=D

Ex. 9. TFFTT

Ex. 10. FTTTF

Ex. 11. Apply the same for systems Ax=b to each column of B.

Ex. 12. The elementary matrices are multiplied on both cases from the left, producing the
effect on any other matrix B of multiplying it from the left by A^(-1).

Ex. 13. B=IB=(A^-1)AB= A^(-1) AC= IC= C. Not true in general: if A is the 0 matrix, AB=AC for
every B and C.

Ex. 14. B-C=(B-C)DD^(-1)=0D^(-1)=0, and hence B=C.

Ex. 15. D=C^(-1)B^(-1)A^(-1).

Ex. 16. CB^(-1)=A where C=AB. Then BC^(-1)A=I and so, A is left invertible. The same works
from the right.

Ex. 17. A=BCB^(-1)

Ex. 18. B=P^(-1)AP

Ex. 19. X=CB-A

Ex. 20. B=X(A-AX)^(-1) and apply ex.15. X=(A+B^(-1))^(-1)A and A+B^(-1) is invertible because
of ex. 16 applied to A= (A+B^(-1))X and X.

Ex. 21. The reduced echelon form of A must be the identity and so there are no free variables
in the homogeneous system Ax=0.

Ex. 22. They are n linearly independent vectors in Rn.

Ex. 23. Otherwise there are free variables in the system Ax=0.

Ex. 24. If we multiply A by the matrix formed by V=[v1 v2 … vn] where vi is a solution to the
system Ax=ei and ei is a vector with a 1 in the i-th entry and 0 elsewhere, then AV=I=VA.

Ex. 25. The reduced echelon form has a row of zeros and therefore a free variable.

Ex. 26. Multiply both matrices, the proposed inverse and A, and you get the identity matrix.

Ex. 27 and 28. Escape the scope of the course.

Ex. 29. A^(-1)= (-7 2; 4 -1).

Ex. 30. (-7/5 2; 4/5 -1).

Ex. 31. (8 3 1; 10 4 1; 7/2 3/2 1/2)

Ex. 32. Does not have an inverse

Ex. 33. (1 0 0; -1 1 0; 0 -1 1); (1 0 0 0; -1 1 0 0 ; 0 -1 1 0 ; 0 0 -1 1) In general every row of B is

0...0 -1 1 0..0 where the 1 is on the diagonal.

Ex. 34. Same as before but the k-th row from B is divided by k. To prove it, eliminate everything
below the diagonal by making Row_k → Row_k – Row_{k-1}.

Ex. 35. Solve the system Ax=(0;0;1). That gives (3; -6; 4).

Ex. 36. (3/2 -9/2; -433/6 439/2; 68/3 -69).

Ex. 37. I don't think this is an easy exercise but a valid choice is C= (1 1 -1 ; -1 1 0).

Ex. 38. A choice of D= (1 0 ; 0 0 ; 0 0 ; 0 1). No C exists because of the too many vectors
problem.

Ex. 39-42. Requires extra knowledge.

Solutions to Exercises from D. & S. Lay
book “Linear algebra and its applications”
Chapter 2: Sections 2.3 and 2.4
Subsection 2.3
Ex. 1. Invertible because 2 vectors not multiples

Ex. 2. Not invertible because 2 vectors multiples

Ex. 3. Invertible because triangular

Ex. 4. Not invertible because 0 column

Ex. 5. Not invertible because R3 = -4R2-3R1

Ex. 6. Not invertible: reduce to echelon form and check only 2 pivots

Ex. 7. Invertible: 4 pivots

Ex. 8. Invertible: triangular

Ex. 9. Invertible: 4 pivots

Ex. 10. Invertible: 5 pivots

Ex. 11. TTFTT

Ex. 12. TTTFT

Ex. 13. When m=n and diagonal elements not zero

Ex. 14. When m=n and diagonal elements not zero

Ex. 15. no, the column vectors won't be lin. Ind.

Ex. 16. No, see (4) in IMT

Ex. 17. A^-1 is invertible (its inverse is A)

Ex. 18. No, it's onto and then it must be invertible and therefore there are no free variables

Ex. 19. There is always a solution and it is unique because the matrix is invertible

Ex. 20. E=F^-1

Ex. 21. It does not say G is square but it can be understood from the conditions on the
dimensions of vectors. If it is square, no it can't because then it would be invertible and then
there are no free variables and then the solution is unique.

Ex. 22. Hx=0 must have nontrivial solutions.

Ex. 23. They don't span all of R^n and they are lin.dep.

Ex. 24. There always is the trivial solution so the answer is no.
Ex. 25. Apply Theorem 6 from previous Section.

Ex. 26. If A^2 is defined then A is square and then if its columns are lin. Ind. The matrix is
invertible and therefore onto and hence the range of A is all of R^n. Then the image under A^2
of all of R^n is the image under A of all of R^n which, again is all of R^n.

Ex. 27. BW is a matrix inverting A. We are assuming A is square.

Ex. 28. Same but with WAB

Ex. 29. It isn't onto either, and A not invertible.

Ex. 30. Onto and A invertible

Ex. 31. The number of pivots imply no free variables, and therefore one-to-one.

Ex. 32. Same

Ex. 33. A^-1=(7 9; 4 5); det A = -1

Ex. 34. A^-1= (7/2 4; 5/2 3); det A = 2

Ex. 35. T is invertible if and only if A is.

Ex. 36. Same

Ex. 37. Yes, because A and its inverse do commute

Ex. 38. No, it is square but it is not one-to-one and therefore not invertible and not onto.

Ex. 39. The inverse matrix is unique.

Ex. 40. The hint is a solution.

Ex. 41-45 outside of our goals.

Subsection 2.4
Ex. 1. (A B; EA+C EB+D)

Ex. 2. (EA EB; FC FD)

Ex. 3. (Y Z; W X)

Ex. 4. (A B; -XA+C -XB+D)

Ex. 5. X= -(B^-1)A; Y= B^-1; Z=C

Ex. 6. X=A^-1; Y=-(C^-1)B(A^-1); Z=C^-1

Ex. 7. X=A^-1; Z=0, Y=-B(A^-1)

Ex. 8. X=A^-1; Y=0; Z=-B(A^-1)

Ex. 9. X=-A21(A11^-1); Y=-A31(A11^-1)

Ex. 10. X=BC-A; Y=-B; Z=-C.

Ex. 11. TF
Ex. 12. TF

Ex. 13. (B^-1 0; 0 C^-1) inverts the matrix (B 0; 0 C) together with the invertible matrix
theorem.

Ex. 14. The hint is the solution.

Ex. 15. Y=(A11^-1)A12; X= A21(A11^-1)

Ex. 16. S is invertible since M=(A11 0; 0 S) can be decomposed as a product of 3 invertible

matrices, and so M is invertible.

Ex. 17-20. Outside of our objectives.

Ex. 21. a) multiply A by itself. b) M= (A 0; I -A) and so M^2= (A 0; I -A) (A 0; I -A) = (A^2 0; 0 A^2)
= I.

Ex. 22. Outside of our objectives.

Ex. 23. It is true for 1x1 matrices (every matrix 1x1 is lower triangular). Suppose we know it for
kxk and let us see it for (k+1)x(k+1). A1= (a 0; v A) and B1= (b 0; w B) where A and B are lower
triangular then A1B1= (ab+vw 0; vb+Aw AB). AB is lower triangular so the only new element
above the diagonal is 0, and so A1B1 is lower triangular.

Ex. 24. True for n=1. A1= (A 0; 1 1 1 1 ....1) B1= (B 0; 0 0 0 … 0 0 -1 1) then A1B1 = (AB 0; C 1).
For each column of B the sum of its elements is 0 unless it is the last one (in which it is 1 but
for that we have the additional -1). and so A1B1=I.

Ex. 25. Block diagonal, so its inverse is the inverse of each block, and so invertible.

Ex. 26-27. Outside of our objectives.

Solutions to Exercises from D. & S. Lay
book “Linear algebra and its applications”
Chapter 3
Subsection 3.1
Ex. 1. 1

Ex. 2. 1

Ex. 3. 0

Ex. 4. 30

Ex. 5. -24

Ex. 6. 45

Ex. 7. 4

Ex. 8. -3

Ex. 9. 15

Ex. 10. 12

Ex. 11. -18

Ex. 12. 54

Ex. 13. 6

Ex. 14. 6

Ex. 15. 24

Ex. 16. 19

Ex. 17. -10

Ex. 18. -12

Ex. 19. switching changes the sign

Ex. 20. adding to a row a multiple of another one leaves the determinant unchanged

Ex. 21. scaling by a factor multiplies the determinant by the same factor

Ex. 22. adding to a row a multiple of another one leaves the determinant unchanged

Ex. 23. switching changes the sign

Ex. 24. scaling by a factor multiplies the determinant by the same factor

Ex. 25. 1
Ex. 26. -1

Ex. 27. 1

Ex. 28. k

Ex. 29. k

Ex. 30. -1

Ex. 31. 1

Ex. 32. k

For the following exercises e= ad-bc

Ex. 33. e

Ex. 34. e

Ex. 35. -e

Ex. 36. ke

Ex. 37. det (5A)= 25 det (A)

Ex. 38. det KA = k^2 det A

Ex. 39. TF

Ex. 40. TF

Ex. 41. 6, Area = baselength · height

Ex. 42. det (u,v) = -det(v,u) = - area = -cb

Ex. 43. 1 = det(I) = det (A^-1 · A) = det(A^-1) det(A)

Ex. 44. We saw the proof in class that it is true.

Ex. 45. No, det(1 2; 3 4) = -2 while det(1 2; 0 0) + det ( 0 0 ; 3 4) = 0.

Ex. 46. We checked in class transpose makes no effect on determinant but scaling the whole
matrix by a factor of k multiplies the determinant by k^n.

Subsection 3.2
Ex. 1. Switching multiplies det by (-1)

Ex. 2. Row replacement makes no effect on det

Ex. 3. Scaling by k multiplies det by k

Ex. 4. Row replacement makes no effect on det

Ex. 5. -3

Ex. 6. -24
Ex. 7. 0

Ex. 8. -10

Ex. 9. -28

Ex. 10. 6

Ex. 11. -48

Ex. 12. 6

Ex. 13. 6

Ex. 14. 20

Ex. 15. 21

Ex. 16. 35

Ex. 17. 7

Ex. 18. -7

Ex. 19. 14

Ex. 20. 7

Ex. 21. det= 0 => not invertible.

Ex. 22. det=-3 => invertible.

Ex. 23. det=-4 => invertible.

Ex. 24. det=0 => not lin. ind.

Ex. 25. det=-1 => lin. ind.

Ex. 26. det=0 => not lin. ind.

Ex. 27. TFTF

Ex. 28. FFFF

Ex. 29. detB^4 = 16 = (det B)^4

Ex. 30. If two rows, say R1 and R2 are equal, the det is unchanged by R1-> R1-R2 =0, and then
det =0. Same with columns.

Ex. 31. AA^-1=I, det I = 1 = det A · det A^-1

Ex. 32. 0 = det (A^3) = (det A)^3 => A not invertible.

Ex. 33. Thm 6 => det AB = det A · det B = det BA

Ex. 34. Thm 6 => det (PA(P^-1)) = det P · det A / det P = det A

Ex. 35. det U^T = det U => det (U^TU) = (det U)^2 = 1 = det I => det U = +/- 1.

Ex. 36. det (rA) = r^n det (A)

Ex. 37. det AB = 24, det A= 3, det B= 8.

Ex. 38. detAB=0 = det A, detB=-9

Ex. 39. a)-12, b) -375 c) 4 d) -1/3 e) -27.

Ex. 40. a) 3 b) -1 c) -48 d) -9 e) -3.

Ex. 41. det A = (a+e) d – c (b+f), det B = ad-bc, det C= de-cf.

Ex. 42. If det (I+A) = (a+1) (d+1) -bc= ad+a+d+1-bc is equal to det I + det A = 1+ ad -bc then a +
d =0.

Ex. 43. Expand cofactors along 3rd column, group by common factor, on u1+v1, u2+v2, u3+v3.

Ex. 44-46. Outside of our objectives.

Subsection 3.3
Ex. 1. (5/6; -1/6)

Ex. 2. (1;2)

Ex. 3. (4/5; -3/10)

Ex. 4. (1;7)

Ex. 5. (¼; 11/4; 3/8)

Ex. 6. (2/5; 4/5; 6/5)

Ex. 7. 12 s^2 not 36 if s is not +/- the square root of 3; then (1/(12·(s^2+3))) · (10s+8; -12s-45)

Ex. 8. 15s^2 not 60 if s is not +/- 2. Then (15s-10; 6s-36)/(15·(s^2-4)).

Ex. 9. 6s^2-6s not 0 if s is not 0 or 1. Then (-14s; 4s+3)/(6s(s-1)).

Ex. 10. 4 s^2+ 8s not 0 if s not -2 or 0. Then (4s+4; 2s)/(4s^2+8s)

Ex. 11. adj A = (0 1 0; -5 -1 -5; 5 2 10), det A = 5, A^-1= (0 1/5 0; -1 -1/5 -1; 1 2/5 2).

Ex. 12. adj A= (1 2 -5; 2 1 -7; -2 -1 4), det A = -3 => A^-1=(1 2 -5; 2 1 -7; -2 -1 4)/(-3)

Ex. 13. adj A= (-1 -1 5; 1 -5 1; 1 7 -5), det A = 6 => A^-1=(-1 -1 5; 1 -5 1; 1 7 -5)/6

Ex. 14. adj A= (8 4 -5; 2 0 -1; -4 -2 -2), det A = -2 => A^-1=(-4 -2 5/2; -1 0 1/2; 2 1 1)

Ex. 15. adj A= (-1 0 0; -1 -5 0; -1 -15 5), det A = -5 => A^-1=(1/5 0 0; 1/5 1 0; 1/5 3 1)

Ex. 16. adj A= (6 4 14; 0 -2 -1; 0 0 -3), det A = 6 => A^-1=(6 4 14; 0 -2 -1; 0 0 -3)/6

Ex. 17. adj (a b; c d) = (d -b; - c a)

Ex. 18. adj is formed by integers, and det A is 1 so A^-1 is the quotient an integer by 1.

Ex. 19. 8

Ex. 20. 6
Ex. 21. 3

Ex. 22. 15

Ex. 23. 23

Ex. 24. 18

Ex. 25. If it is, the 3 columns span a plane, so the parallelepiped is flat, it has 0 volume.

Ex. 26. Every element v of S satisfies T(p+v)= T(p)+T(v).

Ex. 27. area(S)=4, det A =3 => area (AS)=12.

Ex. 28. area(S)=4, det A =3 => area (AS)=12.

Ex. 29. (det[v1 v2] )/2

Ex. 30. Follow the hint.

Ex. 31-35. Outside of our objectives

Solutions to Exercises from D. & S. Lay
book “Linear algebra and its applications”
Chapter 4
Subsection 4.1
Ex. 1. a) If u = (x1,y1), v=(x2, y2) then x1+x2 >= 0 and y1+y2>=0 since all x1, x2, y1 and y2 are
positive. Therefore u+v is in V. b) u=(1,0), c=-1.

Ex. 2. a) Yes if xy >=0 then (cx)(cy) = c^2 xy >= 0. b) u=(-1,-1), v=(2,0), u+v=(1,-1).

Ex. 3.u=v=(1,0) then u+v = (2,0) not in H.

Ex. 4. u+v is not in the line: draw the parallelepiped generated by the points u and v where the
line crosses the axis.

Ex. 5. Yes, for n>=2, p(t) is a polynomial and sums of polynomials of degree less than or equal
to 2 and products of polynomials of such degree by scalars are again polynomials of degree at
most 2.

Ex. 6. No, (1 + t^2) + (1 + t^2) = 2 + 2t^2 which is not in the set.

Ex. 7. No: t^3 is one of the elements of the set but ½ · t^3 is not.

Ex. 8. Yes, if p(0)=0 and q(0)=0 then cp(0)=c0=0 and (p+q)(0)=p(0)+q(0) = 0. It is a vector space.

Ex. 9. v= (1,3,2) spans are always vector spaces, and all elements of span(v) are in R^3.

Ex. 10. H = span {(2,0,-1)}

Ex. 11. u=(5,1,0), v=(2,0,1), same reason as exercise 9.

Ex. 12. W = span {(1,1,2,0), (3,-1,-1,4)}

Ex. 13. a) W is not v1 or v2 or v3 so NO. There are only 3 vectors in that set. b) Infinitely many.
c) Yes since w=v2+v1.

Ex. 14. The system is inconsistent, so NO.

Ex. 15. Not a vector space since 0 is not an element.

Ex. 16. Not a vector space since 0 is not an element.

Ex. 17. Yes, the vector space is span {(1,0,-1,0),(-1,1,0,1),(0,-1,1,0)}

Ex. 18. span {(4,0,1,-2),(3,0,1,0),(0,0,1,1)}

Ex. 19. 0=y when c1=c2=0. Also cy = (cc1) cos wt + (cc2) sin wt and cc1 is a real number as is
cc2. And y1 + y2 will have coefficients sum of those for y1 and those for y2.

Ex. 20. Part A) The constant 0 function is continuous. Sum of continuous is continuous, and
multiples of continuous are continuous. Part B) The constant 0 function has that f(a)=f(b)=0.
When f(a)=f(b) then cf(a)= cf(b) and the same for g(a)=g(b) then f(a)+g(a) = (f+g)(a) = f(b)+g(b) =
(f+g)(b).

Ex. 21. (0 0, 0 0) is of that form, sum of triangular is triangular and c A triangular if A triangular.

Ex. 22. 0 has that property, if A and B have it, then cA has it and F(A+B) = FA + FB = 0. Yes it is.

Ex. 23. FFFTF

Ex. 24. TTTFF

Ex. 25. 2,5

Ex. 26. a) 3 b) 5 c) 4

Ex. 27. a) 8 b) 3 c) 5 d) 4

Ex. 28. a) 4 b) 7 c) 3 d) 5 e) 4

Ex. 29.The hint is the solution.

Ex. 30. c^-1 is a scalar and (c^-1 · c) · u = u = c^-1 · 0 = 0.

Ex. 31. Every element of span {u,v} must be in H because if u,v in H then they are combinations
of H elements.

Ex. 32. 0 is in the intersection, if u,v are, then c1u+c2v is both in H and in K because H and K are
spaces and therefore c1u+c2v is in the intersection. The example: H = the x-axis, K=the y-axis.
e1 and e2 are in the union but (1,1)=e1+e2 is not.

Ex. 33. a) c1w1 + c2w2 = c1u1+c2u2 + c1v1 +c2v2 which is an element of H + an element of K.
Also 0 is 0+0. b) Enough to see it for H (and then change the names of H and K). H is a space so
we only need to see H is a subset of H+K but every u in H satisfies w=u+0 is an element of H+k.

Ex. 34. Clearly u1,...,up, v1,...,vq are in H+K (ui=ui+0, vi=0+vi). So both H and K are in the span.
If something is w= c1u1+...+cpvp +d1v1+...+dqvq then it is in H+K.

Ex. 35. Yes, since the system Ax=w is consistent.

Ex. 36. Yes, since the system Ax=w is consistent.

Ex. 37-38. Outside our objectives.

Subsection 4.2
Ex. 1. Aw =(0,0,0) so yes.

Ex. 2. Aw =(0,0,0) so yes.

Ex. 3. Nul A = span{(7,-4,1,0),(-6,2,0,1)}

Ex. 4. Nul A = span{(6,1,0,0),(0,0,0,1)}

Ex. 5. Nul A = span{(2,1,0,0,0),(-4,0,9,1,0)}

Ex. 6. Nul A = span{(-6,2,1,0,0),(8,-1,0,1,0),(-1,0,0,0,1)}

Ex. 7. Not a vector space: 0 not an element.

Ex. 8. Not a vector space: 0 not an element.

Ex. 9. It is a Nul space for something, so Yes.

Ex. 10. It is a Nul space for something, so Yes.

Ex. 11. Not a vector space: 0 not an element.

Ex. 12. Not a vector space: 0 not an element.

Ex. 13. Yes, span{(1,0,1),(-6,1,0)}

Ex. 14. Yes, span{(-1,1,3)}

Ex. 15. (0 2 3; 1 1 -2; 4 1 0; 3 -1 -1)

Ex. 16.(1 -1 0; 2 1 1; 0 5 -4; 0 0 1)

Ex. 17. a=2 b=4

Ex. 18. a=3 b=4

Ex. 19. a=5 b=2

Ex. 20. a=5 b=1

Ex. 21. (2, -1, -4, 3) is in Col A, x=(3,1) is in Nul A.

Ex. 22. (1,0) is in Col A and (7,-4,1,0) in Nul A.

Ex. 23. Yes in both, w=(a1)/3 and Aw=0.

Ex. 24. Yes to both, since the system Ax=w is consistent and Aw=0.

Ex. 25. TFTFTT

Ex. 26. TTFTT and (Not applicable to our course but T)

Ex. 27. The Nul space is a vetor space so 10x is a solution if x is.

Ex. 28. Yes, if x solves the first, then 5x is a solution to the second and 5x must be a vector if x
is.

Ex. 29. a) 0 a1 + 0 a2 + … + 0 an=0. b) Ax + Aw=A(x+w) and x+w is in R^m if x and w are. c)

cAx=A(cx) and cx must be in R^m if x is.

Ex. 30. cT(x) + dT(v) = T(cx+dv) and cx+dv must be in V since it is a vector space, so it is
contained in the range.

Ex. 31. Denote p(t) = a0 + a1 · t + a2 · t^2 Then p(0)=a0 and p(1) = a0+a1+a2 and so T sends the
vector (a0, a1, a2) to (a0, a0+a1+a2) which is the linear transf with matrix A=(1 0 0; 1 1 1). Its
Nul space is span{(0,-1,1)} and so one example of a polynomial as required is q(t)= t^2-t. The
range of T is the whole plane R^2.

Ex. 32. p1(t)= t and p2(t)=t^2 span that. The range is the diagonal of the plane.

Ex. 33. a) T(cA+dB) = cA+dB + cA^T + dB^T = c(A+A^T) + d (B+B^T). b) B/2. c) from b)
range is at least that. To see it is exactly that, take A that T(A)=B then T(A)= A+ A^T = A^T +
(A^T)^T = T(A)^T = B^T. d) If A^T = -A then (a c; b d) = (-a -b; -c -d) and then we get
a=d=0 and b=-c, so the range is the span{(0 1; -1 0)}.

Ex. 34. Not applicable to us.

Ex. 35. Same linear property of every time.

Ex. 36. Check that 0 is in U and linear combinations of elements of U stay in U, as usual.

Ex. 37. Aw= (14,0,0,0) so w is not in the Nul A. The system Ax=w is consistent so , yes w is in Col
A.

Ex. 38. Yes to both.

Ex. 39. a) The systems Bx=a3 and Bx= a5 are consistent. b) {(-1,-1,3,0,0),(-10,26,0,12,3)}
c) From RREF neither since there are free variables and 3 vectors can't span R^4.

Ex. 40. H int K = span {(10/3, -26/3, 4, 1)}

Solutions to Exercises from D. & S. Lay
book “Linear algebra and its applications”
Chapter 4 Subsections 4.3 to 4.6
Subsection 4.3
Ex. 1. 3 vectors in R3 so the matrix is square and then invertible is equivalent to one-to-one
(and therefore to no free variables or to linear independence) and to onto (and therefore Ran
T = R3 or span{v1,v2,v3}=R3). In order to decide invertibility, enough to check det A not 0 but
det A =1. So, yes it is a basis.

Ex. 2. The 0 vector is linearly dependent. Not a basis.

Ex. 3. Det =0, not a basis.

Ex. 4. Det not 0, yes, basis.

Ex. 5. Too many vectors (or one of them is zero) so not a basis. They do span.

Ex. 6. They do not span since they live on a plane, so not a basis. They are lin. Ind. Though.

Ex. 7. Same as Ex.6.

Ex. 8. Too many vectors=> lin. Dep. => not basis, they do span because 3 pivots.

Ex. 9. A basis is {(3,5,1,0),(-2,-4,0,1)}

Ex. 10. {(5,4,1,0,0),(-7,-6,0,3,1)}

Ex. 11. {(-2,1,0),(-1,0,1)}

Ex. 12. {(1/5,1)}

Ex. 13. Basis for Nul A = {(-6, -5/2, 1,0),(-5, -3/2,0,1)}. Basis for Col A= {(-2,2,-3), (4,-6,8)}.

Ex. 14. Basis for Nul A = {(-4,0,7/5,1,0),(-2,1,0,0,0)}. Basis for Col A = {(1,2,1,3), (-5,-5,0,-5), (-3,
2, 5, -2)}

Ex. 15. {v1,v2,v4} is a basis

Ex. 16. {v1,v2,v3} is a basis

Ex. 17. the first 3 columns form a basis

Ex. 18. {v1,v2,v4} is a basis

Ex. 19. {v1,v2} is a basis: lin. Ind. And spans the set.

Ex. 20. {v1,v2} is a basis: lin. Ind. And spans the set.

Ex. 21. FFTFF

Ex. 22. FTTFF

Ex. 23. It is a spanning set that is as small as possible. 3 vectors in R4 must have one row
without pivot.

Ex. 24. It is as large as possible.

Ex. 25. No: v1 and v3 are NOT in H.

Ex. 26. Since sin(2t)=2sint cost, and sin t and sint cost ae not multiples of each other, {sin t,
sin(2t)} is a basis.

Ex. 27-28. Outside our objectives.

Ex. 29. They must have one pivot on each row and there are n rows.

Ex. 30. They must have one pivot on each row and there are n rows.

Ex. 31. If c1v1+...+cpvp = 0 => 0=T(0)= T(c1v1+...+cpvp) )= c1T(v1) + … + cpT(vp).

Ex. 32. Exact opposite.

Ex. 33. The det of (1 1; 1 -1) is -2 so yes, lin. Ind.

Ex. 34. p1+p2-p3 = 0 => a basis is {p1,p2}

Ex. 35. Take {u1, u1+u2, u2, u1-u2} or even {u1, 2u1, 3u1, u2}

Ex. 36-38. Outside of our objectives.

Subsection 4.4
Ex. 1. (3,-7)

Ex. 2. (2,5)

Ex. 3. (-1,-5,9)

Ex. 4. (0,1,-5)

Ex. 5. (8,-5)

Ex. 6. (-6,2)

Ex. 7. (-1,-1,3)

Ex. 8. (-2,0,5)

Ex. 9. (2 1; -9 8)

Ex. 10. (3 2 8; -1 0 -2; 4 -5 7)

Ex. 11. (6,4)

Ex. 12. (-7,5)

Ex. 13. (2,6,-1)

Ex. 14. (7,-3,-2)

Ex. 15. TFF

Ex. 16. TFT

Ex. 17. (5,-2,0) and (0,-1,-1) (which correspond to the values of the free variable x3=0 and -1).

Ex. 18. bi= 1 · bi + 0b1 + 0b2 + … + 0b(i-1) + 0 b(i+1) + … + 0 bn

Ex. 19. Since every element has at least one representation, they span.Since the
representation of 0 is unique, there are no free variables, and so they are lin. Ind. So yes, a
basis.

Ex. 20. Take some coordinates d1,...,dn of w and some nontrivial solution c1v1+...+cnvn =0,
then (c1+d1), (c2+d2)..., (cn+dn) are also coordinates of w.

Ex. 21. (9 2; 4 1)

Ex. 22. P_B^(-1)

Ex. 23. If x → [0]_B then x=0b1 + … + 0bn = 0.

Ex. 24. [x]B = PB^(-1) x. For any [x]B we can find x = PB [x]B

Ex. 25. The hint is the solution

Ex. 26. Both [x]B → x and x → [x]B are linear transformations.

Ex. 27. one pivot on each column hence lin. Ind.

Ex. 28. one pivot on each column hence lin. Ind.

Ex. 29. only 2 pivots => lin. Dep.

Ex. 30. v2= v1+ v3 => lin. Dep.

Ex. 31. a) row without pivots => not spanning. b) one pivot on each row => it spans.

Ex. 32. a) det = -1 not 0 so yes, basis. b) (1,3,-10) or q(t) = 1 +3t -10 t^2.

Ex. 33. Not a basis: one row without pivot.

Ex. 34. Det=0 => not a basis.

Ex. 35. (-5/3,8/3)

Ex. 36. x=3v1+5v2+2v3

Ex. 37-38. Outside our objectives.

Subsection 4.5
Ex. 1. 2

Ex. 2. 2

Ex. 3. 3

Ex. 4. 2

Ex. 5. 2
Ex. 6. 2

Ex. 7. 0

Ex. 8. 3

Ex. 9. 2

Ex. 10. 2

Ex. 11. 2

Ex. 12. 3

Ex. 13. dim Nul A = 2, dim Col A = 3

Ex. 14. dim Nul A = 3, dim Col A = 3

Ex. 15. dim Nul A = 2, dim Col A = 2

Ex. 16. dim Nul A = 0, dim Col A = 2

Ex. 17. dim Nul A = 0, dim Col A = 3

Ex. 18. dim Nul A = 1, dim Col A = 2

Ex. 19. TFFFT

Ex. 20. FFFFT

Ex. 21. basis

Ex. 22. basis

Ex. 23. (3,3,-2,3/2)

Ex. 24. (5,-4,3)

Ex. 25. Otherwise a subset of S is lin.ind. And spans, so it would be a basis with fewer
elements.

Ex. 26. Any basis of H spans V.

Ex. 27. Done in the theory class.

Ex. 28. Polynomials are continuous functions. Since C(R) contains the polynomials the dim P <=
dim C(R) but dim P = infty.

Ex. 29. TTT

Ex. 30. FTF

Ex. 31-34. Outside our objectives.

Subsection 4.6
Ex. 1.

rank A = 2,

dim Nul A = 2,
a basis Col A is formed by {(1,-1,5),(-4,2,-6)},

a basis for Row A is formed by {(1,0,-1,5),(0,-2,5,-6)},

a basis for Nul A is formed by {(1,5/2,1,0),(-5,-3,0,1)}.

Ex. 2.

rank A = 3,

dim Nul A = 2,

a basis Col A is formed by {(1,-2,-3,3),(4,-6,-6,4),(9,-6,-3,0)},

a basis for Row A is formed by {(1,-3, 0, 5,-7),(0,0,-2,3,8),(0,0,0,0,5)},

a basis for Nul A is formed by {(3,1,0,0,0),(-5,0,3/2,1,0)}.

Ex. 3.

rank A = 3,

dim Nul A = 2,

a basis Col A is formed by {(2,-2,4,2),(6,-3,9,3),(2,-3,5,-4)},

a basis for Row A is formed by {(2,-3,6,3,5),(0,0,3,-1,1),(0,0,0,1,3)},

a basis for Nul A is formed by {(3/2,1,0,0,0),(9/2,0,-4/3,-3,1)}.

Ex. 4.

rank A = 3,

dim Nul A = 3,

a basis Col A is formed by {(1,1,1,1,1),(1,2,-1,-3,-2),(7,10,1,-5,0)},

a basis for Row A is formed by {(1,1,-3,7,9,-9),(0,1,-1,3,4,-3),(0,0,0,1,-1,-2)},

a basis for Nul A is formed by {(2,1,1,0,0,0),(-9,-7,0,1,1,0),(-2,-3,0,2,0,1)}.

Ex. 5. dim Nul A = 5, dim Row A = dim Col AT = rank AT = 3.

Ex. 6. dim Nul A = 0, dim Row A = dim Col AT = rank AT = 3.

Ex. 7. Yes, col A is a subset of R4 and it is 4 – dimensional so Col A = R4. And no, Nul A is a 3-
dimensional subspace of R7.

Ex. 8. Dim Nul A = 2. No, Col A is a subspace of R5.

Ex. 9. 2

Ex. 10. 2

Ex. 11. 3

Ex. 12. 2

Ex. 13. 5 since it is the number of pivots

Ex. 14. 3 since it is the number of pivots

Ex. 15. 2

Ex. 16. 0

Ex. 17. TFTFT

Ex. 18. FFTTT

Ex. 19. dim Nul A = 1 so Yes, Col A has dimension 5 and it is a subspace of R5, so it must be the
whole R5.

Ex. 20. dim Nul A = 2 so No, Col A is R6, and so the system is always consistent.

Ex. 21. No, dim Nul A = 1.

Ex. 22. dim Nul A >= 2 so No.

Ex. 23. 6

Ex. 24. Yes, since the identity followed by a row of zeros has no free variables. The same
example shows no to the second question.

Ex. 25. No, Col A has dim =9 but it is a subspace of R10.

Ex. 26. it can't have any more pivots.

Ex. 27. Row A = Col AT subset of Rn. Row AT = Col A subset of Rm. Nul A subset of Rn and Nul
AT subset of Rm. These are the 4 different cases.

Ex. 28. a) dim Row A = rank A b) dim formula for AT since dim Col A = rank A = dim Col AT

Ex. 29. Since there is a solution for every b, dim Col A = m = dim Col AT = dim Row A and so dim
Nul AT = 0 from b) in past exercise.

Ex. 30. We need that rank [A b] = rank [A] since then b is a linear combination of the columns
of A.

Ex. 31-38. Outside our objectives.

Solutions to Exercises from D. & S. Lay
book “Linear algebra and its applications”
Chapter 5 Subsections 5.1 and 5.2
Subsection 5.1
Ex. 1. Yes

Ex. 2. Yes

Ex. 3. No

Ex. 4. Yes, eigenvalue is 3 + sqrt(2)

Ex. 5. Yes, lambda = 0

Ex. 6. Yes, lambda = -2

Ex. 7. lambda = 4, yes, one eigenvector is (-1,-1,1)

Ex. 8. lambda = 3, yes, one eigenvector is (3,2,1)

Ex. 9. eigenspace_5 = span {(2,1)}

Ex. 10. span{(3/2,1)}

Ex. 11. (-1/3,1)

Ex. 12. lambda = 1 gives (-2/3,1), lambda = 5 gives (-2,1)

Ex. 13. lambda = 1 gives (0,1,0), lambda = 2 gives (-1/2, 1, 1), lambda = 3 gives (-1,1,1)

Ex. 14. (1/3, 1/3, 1)

Ex. 15. {(-2,1,0),(-3,0,1)}

Ex. 16. {(2,3,1,0),(0,0,0,1)}

Ex. 17. eigenvalues are 0, -1 and 2 (it's triangular).

Ex. 18. eigenvalues are 0, -3 and 4 (it's triangular).

Ex. 19. lambda = 0 => NOT invertible

Ex. 20. lambda = 0 => (1,-1,0) and (1,0,-1) multiplied by (5 5 5) give 5-5=0 in both cases

Ex. 21. FTTTF

Ex. 22. FF (Not applicable but T) FT

Ex. 23. If there were more there would be more than 2 linearly independent vector in R2.

Ex. 24. (2 0 ; 0 2) / (1 0; 0 1)
Ex. 25. Ax = lambda x, then x = lambda (A^(-1)x). Since lambda is not 0, lambda^(-1) x = A^(-
1)x.

Ex. 26. Ax = lambda x, lambda different from 0, then A^2 x = A (Ax) = lambda Ax = lambda ^2 x
but A^2 = 0 so lambda ^2 = 0.

Ex. 27. (A – lambda I) ^T invertible if and only if A – lambda I invertible

Ex. 29. Sum of a row is the product against (1,1,...,1) and so A (1,1,...,1) = (5,5,5,...,5) = 5
(1,1,1...,1).

Ex. 30. The same as 29 for the transpose.

Ex. 31. e_1 goes to -e_1 and e_2 goes to -e_2 so lambda = -1 is eigenvalue eigenspace is R2.

Ex. 32. lambda=1, eigenspace = the line.

Ex. 28 and 33-40. Outside of our objectives.

Subsection 5.2
Ex. 1. -5 and 9

Ex. 2. 2 and 8

Ex. 3. 1+/- sqrt(2)

Ex. 4. 4 +/- sqrt(13)

Ex. 5. 3 with multiplicity 2

Ex. 6. no real eigenvalues

Ex. 7. no real eigenvalues

Ex. 8. 5 with multiplicity 2

Ex. 9. -lambda^3 + 4 lambda^2 -9lambda -6

Ex. 10. - lambda^3 +14lambda +12

Ex. 11. (4-lambda) (3 -lambda) (2-lambda)

Ex. 12. (2 – lambda) (-1-lambda) (4 - lambda)

Ex. 13. (3-lambda) (5 – lambda) (10- lambda)

Ex. 14. -lambda^3 + 4 lambda^2 + 25 lambda -28

Ex. 15. (4 – lambda) (3-lambda)^2 (1-lambda)

Ex. 16. (5 – lambda)(-4-lambda) ( 1-lambda)^2

Ex. 17. -lambda (1-lambda)^2 (3-lambda)^2

Ex. 18. It must be for eigenvalue 5 and h=6, and we get 2 free variables.

Ex. 19. evaluate at lambda=0.

Ex. 20. det(A-lambda I) = det ((A-lambda I)^T) = det (A^T – lambda I)

Ex. 21. FFTF

Ex. 22. TFTF

Ex. 24. Since det P = 1 / det P^(-1) we have

det A = det P · det P^(-1) · det A = det (PAP^(-1)) = det B

Ex. 23 and 25-30. Outside of our objectives.

Solutions to Exercises from D. & S. Lay
book “Linear algebra and its applications”
Chapter 5 Subsections 5.3 and 5.5
Subsection 5.3
Ex. 1. A^4= (226 -525; 90 -209)

Ex. 2. A^4= (151/16 45/8; -225/16 -67/8)

Ex. 3. A^k= (a^k 0; 3a^k – 3b^k b^k)

Ex. 4. A^k= (-3· 2^k +4 12· (2^k-1); 1-2^k 4·2^k -3)

Ex. 5. eigenvalues are 5 and 1,

eigenspace(5) = span {(1,1,1)}, eigenspace(1)= span {(1,0,-1), (2,-1,0)}

Ex. 6. eigenvalues are 5 and 4,

eigenspace(5) = span {(-2,0,1), (0,1,6)}, eigenspace(4)= span {(-1, 2,6)}

Ex. 7. P= (1/3 0 ; 1 1). D= (1 0; 0 -1)

Warning 1: if you change the order of the columns or scale any column that is also correct, for
instance (1 0 ; 3 1) or (0 1/3; 1 1), but the columns need to correspond to the same elements
of the diagonal, those for the corresponding eigenvalues so if you change the order of the
columns in P you also need to change the order of elements in the diagonal.

Warning 2: To “diagonalize” a matrix is to find the matrices P and D and to check that P is
invertible. With the method we see in the class, the resulting P will be invertible exactly when
it is square, the only problem might be that we don't get enough columns in P. Then P would
not be diagonalizable, the answer would be “it is not possible”.

Ex. 8. Not possible: only one eigenvalue (5) and the eigenspace of 5 has dimension 1 (not 2).

Ex. 9. Not diagonalizable: only one eigenvalue (4) with multiplicity 2 and its eigenspace has
dimension 1.

Ex. 10. Eigenvalues 5 and -2. Basis for the eigenspace of 5, {(1,1)}. For -2, {(-3/4,1)}. Therefore
P=(1 -3/4; 1 1), D=(5 0; 0 -2).

Ex. 11. P=(1 2/3 ¼ ; 1 1 ¾ ; 1 1 1); D=(1 0 0; 0 2 0; 0 0 3).

Ex. 12. P= (-1 -1 1 ; 1 0 1; 0 1 1 ); D= (2 0 0 ; 0 2 0 ; 0 0 8).

Ex. 13. P= (-1 -2 1; -1 1 0 ; 1 0 1); D = (5 0 0 ; 0 1 0 ; 0 0 1).

Ex. 14. P= (0 -2 -1/2 ; 1 0 1 ; 0 1 0); D= (5 0 0; 0 5 0; 0 0 4).

Ex. 15. P= (-1 -4 -2; 1 0 -1; 0 1 1); D= (3 0 0; 0 3 0; 0 0 1).

Ex. 16. P= (-2 -3 -2; 1 0 -1; 0 1 1); D= (2 0 0; 0 2 0; 0 0 1).

Ex. 17. Not diagonalizable (dim(eigensp_4)=1=dim(eigensp_5), 1+1 <3).

Ex. 18. lambda=-3 or 5, P= (-1 -4/3 1/3; ½ 1 0; 1 0 1), D= (-3 0 0; 0 5 0 ; 0 0 5).

Ex. 19. P = (1 3/2 -1 -1; 0 1 -1 2; 0 0 1 0; 0 0 0 1), D= (5 0 0 0 ; 0 3 0 0 ; 0 0 2 0; 0 0 0 2).

Ex. 20. P= (0 2 0 0 ; 1 0 0 0 ; 0 0 1 0; 0 1 0 1), D= (4 0 0 0 ; 0 4 0 0 ; 0 0 2 0 ; 0 0 0 2).

Ex. 21. FTFF

Ex. 22. FFTF

Ex. 23. Yes 3+2=5.

Ex. 24. No, 1+1 = 2 < 3.

Ex. 25. No, not possible, A has to be diagonalizable but the other space is at least one-
dimensional.

Ex. 26. Yes, the third eigenspace could have dim=1.

Ex. 27. A=PDP^(-1). Then if we multiply by A^(-1) = P D^(-1) P^(-1), we get I=PP^(-1) = PDD^(-
1)P^(-1) = PDP^(-1) PD^(-1)P^(-1) = A · A^(-1).

Ex. 28. If A = PDP^(-1) then A^T = (PDP^(-1))^T = P^(-1)^T D^T P^T = (P^T)^(-1) D P^T. Call
(P^T)^(-1) and we have A^T= QDQ^(-1).

Ex. 29. If v1 is an eigenvector and a column of P, we can substitute it by 2v1, and it still is an
eigenvector, giving different matrix P.

Ex. 30. Same idea as previous exercise.

Ex. 31. (1 0 ; 1 1) is not diagonalizable: eigenvalue 1 with multiplicity 2, eigenspace_1 spanned

by (0,1).

Ex. 32. M=(1 ½ ; 2 1) is diagonalizable: it has 2 different eigenvalues 0 and 2. Since 0 is one of
the eigenvalues, M is not invertible.

Ex. 33-36. Outside our objectives.

Subsection 5.5
Ex. 1. Eigenvalues = 2 +/- i. Eigenspace (2+i) basis = {(i-1; 1)}. Taking the conjugates of that
vector we get a basis for the eigenspace (2-i) => basis = {(-1-i;1)}.

Ex. 2. Eigenvalues = 3 +/- i. Eigenspace (3+i) basis = {(2+i; 1)}. Taking the conjugates of that
vector we get a basis for the eigenspace (3-i) => basis = {(2-i;1)}.

Ex. 3. Eigenvalues = 2 +/- 3i. Eigenspace (2+3i) basis = {(½ – 3/2 i; 1)}. Taking the conjugates of
that vector we get a basis for the eigenspace (2-3i) => basis = {(½ + 3/2i;1)}.

Ex. 4. Eigenvalues = 4 +/- i. Eigenspace (4+i) basis = {(1+i; 1)}. Taking the conjugates of that
vector we get a basis for the eigenspace (4-i) => basis = {(1-i;1)}.

Ex. 5. Eigenvalues = 2 +/- 2i. Eigenspace (2+2i) basis = {((1-i)/4; 1)}. Taking the conjugates of
that vector we get a basis for the eigenspace (2-2i) => basis = {((1+i)/4;1)}.
Ex. 6. Eigenvalues = 4 +/- 3i. Eigenspace (4+3i) basis = {(-i; 1)}. Taking the conjugates of that
vector we get a basis for the eigenspace (4-3i) => basis = {(i;1)}.

Ex. 7-28. Outside our objectives.

Solutions to Exercises from D. & S. Lay
book “Linear algebra and its applications”
Chapter 6 Subsections 6.1, 6.2 and 6.3
Subsection 6.1
Ex. 1. u·u= 5, v· u= 8, v·u/ u· u = 8/5

Ex. 2. w·w= 35, x·w=5; x·w / w·w = 1/7

Ex. 3. (3/35, -1/35, -1/7)

Ex. 4. (-1/5, 2/5)

Ex. 5. (8/13, 12/13)

Ex. 6. (30/49; -10/49; 15/49)

Ex. 7. sqrt(35)

Ex. 8. 7

Ex. 9. (-3/5, 4/5)

Ex. 10. (-6 / sqrt(61), 4 / sqrt(61), 3 / sqrt(61))

Ex. 11. (7 / sqrt(69), 2 / sqrt(69), 4/ sqrt(69))

Ex. 12. (4/5, 3/5)

Ex. 13. 5 sqrt(5)

Ex. 14. 2 sqrt(17)

Ex. 15. not orthogonal

Ex. 16. orthogonal

Ex. 17. orthogonal

Ex. 18. not orthogonal

Ex. 19. TTTFT

Ex. 20. TFTTT

Ex. 22. u·u = u1^2 + u2^2 + u3^2. Each ui^2 >= 0, and “=” is only when ui=0, so u·u = 0 only
when all u1=u2=u3=0, that is, when u=0.

Ex. 23. u·v =0 , ||u||^2 = 30 , ||v||^2 = 101, ||u+v||^2 = 131, so yes, they are orthogonal
because u·v = 0 and they satisfy ||u||^2 + ||v||^2 = ||u+v||^2, since 30 + 101= 131.

Ex. 24. ||u+v||^2 + ||u-v||^2 = (u+v) · (u+v) + (u-v)·(u-v) = u·u + v· u + u · v + v · v + u · u -v· u +

- u · v + v · v = 2 u · u + 2 v · v = 2( ||u||^2 + ||v||^2).
Ex. 25. The set {(x,y): ax + by= 0} is the Null space for the matrix (a b). If a is not 0, to obtain the
RREF of (a b) we divide by a to get (1 b/a), and so the basis is {(-b/a, 1)}. If a = 0 and b not 0,
then (a b) has RREF (0 1) and the basis of the Null space is {(1,0)}. Finally, if a=b=0 then the Null
space is all R2.

Ex. 26. u · x = 0 defines the Null space of some matrix and so it is a vector space because of
Theorem 2 from Chapter 4. W is then the plane orthogonal to the span u.

Ex. 27. (u+v)· y = u · y + v · y = 0 + 0 = 0.

Ex. 28. w = cu+dv then w · y = (cu+dv) · y = cu·y + dv· y = c0 + d0 = 0.

Ex. 29. Same as above with c2... cp instead of c and d and c1v1+ … +cpvp instead of cd+uv.

Ex. 31. x is in the perp of W and so x is orthogonal to x (since x is in W). This means that x · x = 0
and so x=0.

Ex. 21 and 30. Outside objectives.

Subsection 6.2
Ex. 1. u1 · u2 = u2 · u3 = 0 but u3 · u1 is not 0 so the answer is NO.

Ex. 2. u1 · u2 = u2 · u3 = u3 · u1 = 0 so the answer is YES.

Ex. 3. u2 · u3 is not 0 so NO.

Ex. 4. Since u2=0, we have u1·u2= u2·u3= 0 and we check that u1·u3=0 so YES.

Ex. 5. u1 · u2 = u2 · u3 = u3 · u1 = 0 so the answer is YES.

Ex. 6. u2·u3 is not 0 so NO.

Ex. 7. x= 3u1 + ½ u2.

Ex. 8. x= -3/2 u1 + ¾ u2.

Ex. 9. x= 5/2 u1 – 3/2 u2 + 2 u3.

Ex. 10. x= 4/3 u1 + 1/3 u2 + 1/3 u3.

Ex. 11. (-2, 1)

Ex. 12. (2/5, -6/5)

Ex. 13. proj_ u (y) = (-4/5, 7/5), z= y – proj_u(y) = (14/5, 8/5)

Ex. 14. proj_ u (y) = (14/5, 2/5), z= y – proj_u(y) = (-4/5, 28/5)

Ex. 15. proj_ u (y) = (12/5, 9/5) => dist(y, L)= 1

Ex. 16. proj_ u (y) = (3, 6) => dist(y, L)= 3sqrt(5)

Ex. 17. Not orthonormal. It is orthogonal. Normalization : (1/sqrt(3), 1/sqrt(3), 1/sqrt(3)), (-

1/sqrt(2), 0, 1/sqrt(2))

Ex. 18. Not orthogonal

Ex. 19. Orthonormal

Ex. 20. Orthogonal but not orthonormal. To normalize change only v2 by (1/sqrt(5), 2/sqrt(5),
0).

Ex. 21. Orthonormal.

Ex. 22. Orthonormal.

Ex. 23. TTFFF

Ex. 24. TFTTT

Ex. 26. W contains a basis of Rn.

Ex. 27. U is orthogonal so U^(-1)=U^T.

Ex. 28. They are n linearly independent vectors in Rn so they form a basis of Rn. Also, they are
orthogonal to each other (check).

Ex. 29. V^T U^T U V = V^T V = I and V^T U^T= (UV)^T.

Ex. 30. Columns are still mutually orthogonal, and still of norm 1, so it is still an orthonormal
basis that the columns form , so the matrix is still orthogonal.

Ex. 31. Since ||y^- y || < ||v-y|| for any v in L that is not y^, there can't be any other v with
that property, so no other can be the projection.

Ex. 32. c1v1 · c2v2 = c1c2 v1·v2 = c1c2 0 = 0.

Ex. 33. cx +dy is projected onto ((cx+dy) · u / u·u)u = c (x·u/u·u)u + d (y·u / u· u) u = c proj(x) + d
proj(y) => linear.

Ex. 25 and 34-36. Outside our objectives.

Subsection 6.3
Ex. 1. (0, -2, 4, -2) + (10, -6 , -2, 2) (you only need to compute 1 of them and substract it from x)

Ex. 2. (2, 4, 2, 2) + (2, 1, -5, 1)

Ex. 3. u1 · u2 = 0 => (-1, 4, 0)

Ex. 4. u1 · u2 = 0 => (6, 3, 0)

Ex. 5. u1 · u2 = 0 => (-1, 2, 6)

Ex. 6. u1 · u2 = 0 => (6, 4, 1)

Ex. 7. u1 · u2 = 0 => y^= (10/3, 2/3, 8/3), z = (-7/3, 7/3, 7/3)

Ex. 8. u1 · u2 = 0 => y^= (3/2, 7/2, 1), z = (-5/2, 1/2, 2)

Ex. 9. ui · uj = 0 when i not j => y^= (2, 4, 0, 0), z = (2, -1, 3, -1)

Ex. 10. y^= (5, 2, 3, 6), z= (-2, 2, 2, 0).

Ex. 11. u1 · u2 = 0 => y^= (3, -1, 1, -1)

Ex. 12. u1 · u2 = 0 => y^= (-1, -5, -3, 9)

Ex. 13. u1 · u2 = 0 => z = (-1, -3, -2, 3)

Ex. 14. u1 · u2 = 0 => z = (1, 0, -1/2 , -3/2)

Ex. 15. u1 · u2 = 0 => y^= (3, -9, -1) = > ||y-y^|| = || (2, 0, 6) || = sqrt(40) = 2 sqrt(10)

Ex. 16. 8

Ex. 17. a) U^T U = I = (1 0 ; 0 1) since u1· u2 = 0 and ||u1||= ||u2||= 1.

UU^T = 1/9(8 -2 2; -2 5 4; 2 4 5) = (8/9 -2/9 2/9; -2/9 5/9 4/9; 2/9 4/9 5/9)

b) proj_W (y) = UU^T y = 1/9 (8 -2 2; -2 5 4; 2 4 5) (4, 8, 1) = (2 , 4, 5).

Ex. 18. a) U^T U = 1, UU^T = (1/10 -3/10; -3/10 9/10)

b) proj_W(y) = UU^T y = (-2, 6)

Ex. 21. TTFTT

Ex. 22. TTTFF

Ex. 23. a) Take p = proj_(Row A) (x) and u = proj_(Nul A) (x). Notice that Nul A and Row A are
each others orthogonal complement.

b) Take a solution x of Ax= b (the system is consistent). Call p to its projection. Then let's see
that Ap= b: since p = x-u with u in the Nul A we have Ap = Ax – Au = b – 0 = b. Now let's see
that there can't be more than 1 solution in Row A: if p and q are solutions in Row A to
Ap=Aq=b then p-q must be in Nul A since A(p-q) = b-b =0. That means that p-q must be in both
Nul A and its orthogonal complement, so it must be 0. That means that p=q so there is only
one solution.

Ex. 19, 20 and 24-26. Outside our objectives.

Solutions to Exercises from D. & S. Lay
book “Linear algebra and its applications”
Chapter 6 Subsections 6.4 and 6.5
Subsection 6.4
Ex. 1. {(3,0,-1), (-1,5, -3)}

Ex. 2. {(0, 4, 2), (5, 4, -8)}

Ex. 3. {(2, -5, 1), (3, 3/2, 3/2)}

Ex. 4. {(3, -4, 5), (3, 6, 3)}

Ex. 5. {(1, -4, 0, 1), (5, 1, -4, -1)}

Ex. 6. {(3, -1, 2, -1), (4, 6, -3, 0)}

Ex. 7. {(2/sqrt(30), -5/sqrt(30), 1/sqrt(30)), (2/sqrt(6), 1/sqrt(6), 1/sqrt(6))}

Ex. 8. {(3 sqrt(2)/10, -4sqrt(2)/10, sqrt(2)/2), (1/sqrt(6), sqrt(2/3), 1/sqrt(6))}

Ex. 9. {(3, 1, -1, 3), (1, 3, 3, -1),(-3, 1, 1, 3)}

Ex. 10. {(-1, 3, 1, 1), (3, 1, 1, -1), (-1, -1, 3, -1)}

Ex. 11. {(1, -1, -1, 1, 1), (3, 0, 3, -3, 3), (2, 0, 2, 2, -2)}

Ex. 12. {(1, -1, 0, 1, 1), (-1, 1, 2, 1, 1), (3, 3, 0, -3, 3)}

Ex. 13. R=6 (1 2; 0 1). Check: multiply QR and see that is equal to A.

Ex. 14. R = 7 ( 1 1 ; 0 1). Check: multiply QR and see that's equal to A.

Ex. 15. Q= (1/sqrt(5) ½ ½ ; -1/sqrt(5) 0 0 ; -1/sqrt(5) ½ ½ ; 1/sqrt(5) – ½ ½ ; 1/sqrt(5) ½ – ½)

R= Q^T A = (sqrt(5) -sqrt(5) 4sqrt(5); 0 6 -2; 0 0 4)

Ex. 16. Q = (½ -1/2sqrt(2) ½ ; - ½ 1/2sqrt(2) ½ ; 0 1/sqrt(2) 0 ; ½ 1/2sqrt(2) – ½ ; ½ 1/2sqrt(2) ½ )

R = Q^T A = ( 2 8 7; 0 2sqrt(2) 3sqrt(2) ; 0 0 6)

Ex. 17. FTT

Ex. 18. FTT

Ex. 19. Columns are l.i. And so, there are as many pivots as columns, so no free variables so
Ax=0 only has the trivial solution but Ax=QRx. If Rx=0 and x not 0, then QRx=0 with x not 0.

Ex. 20-26. Outside of our objectives.

Subsection 6.5
Ex. 1. a) Normal equations: ( 6 -11 ; -11 22) (x1; x2) = (-4; 11). b) x= (3, 2)

Ex. 2. a) (12 8; 8 10) (x1; x2) = (-24, -2) b) (-4, 3)

Ex. 3. a) (6 6; 6 42) (x1; x2) = (6, -6) b) (4/3, -1/3)

Ex. 4. a) (3 3; 3 11) (x1; x2) = (6, 14) b) (1,1)

Ex. 5. General solution = p + x3·v = {(5, -3, 0)+x3 (-1, 1, 1): x3 is real}

Ex. 6. General solution = p + x3·v = {(5, -1, 0)+x3 (-1, 1, 1): x3 is real}

Ex. 7. 2sqrt(5)

Ex. 8. sqrt(6)

Ex. 9. a) (1, 1, 0) b) (1/7, 2/7)

Ex. 10. a) (4, -1, 4) b) (3, ½)

Ex. 11. a) (3, 1, 4, -1) b) (2/3, 0, 1/3)

Ex. 12. a) (5, 2, -3, 6) b) (1/3, 14/3, -5/3)

Ex. 13. No, v does better than u in the sense that ||Av-b|| < ||Au-b||

Ex. 14. No, because they perform equally well, so they can't be the unique minimizer

Ex. 15. x= R^(-1) Q^T b = (4, -1)

Ex. 16. x= R^(-1) Q^T b = (2.9, 0.9)

Ex. 17. TTFTT

Ex. 18. TFTFF

Ex. 25. {(x, y) in R2: x+y =3}

Ex. 19-24 and 26. Outside of our objectives.

Solutions to Exercises from D. & S. Lay
book “Linear algebra and its applications”
Chapter 7
Subsection 7.1
Ex. 1. Yes

Ex. 2. Yes

Ex. 3. No

Ex. 4. No

Ex. 5. Yes

Ex. 6. No

Ex. 7. The matrix M is orthogonal and symmetric so M^(-1) = M^T = M.

Ex. 8. ||u1||^2= 2 (not 1) so NOT orthogonal.

Ex. 9. The matrix M is orthogonal and symmetric so M^(-1) = M^T = M.

Ex. 10. The matrix M is orthogonal and symmetric so M^(-1) = M^T = M.

Ex. 11. ||u1|| not 1 so NOT orthogonal.

Ex. 12. It is orthogonal so M^(-1) = M^T = ½ (1 1 1 1 ; 1 1 -1 -1 ; -1 1 -1 1 ; -1 1 1 -1 )

Ex. 13. P= ( -1/sqrt(2) 1/sqrt(2) ; 1/sqrt(2) 1/sqrt(2) ) D= ( 2 0 ; 0 4 ), P is invertible: P^(-1)=P

Ex. 14. P= ( -1/sqrt(2) 1/sqrt(2) ; 1/sqrt(2) 1/sqrt(2) ) D= ( 6 0 ; 0 -4 ), P is invertible: P^(-1)=P

Ex. 15. P= ( 1/sqrt(5) -2/sqrt(5) ; 2/sqrt(5) 1/sqrt(5) ) D= ( 11 0 ; 0 1 )

Ex. 16. P= ( -1/sqrt(5) 2/sqrt(5) ; 2/sqrt(5) 1/sqrt(5) ) D= ( 10 0 ; 0 5 )

Ex. 17. P= ( 1/sqrt(6) 1/sqrt(3) -1/sqrt(2) ; -2/sqrt(6) 1/sqrt(3) 0 ; 1/sqrt(6) 1/sqrt(3) 1/sqrt(2) )
D= ( 4 0 0 ; 0 7 0 ; 0 0 -4 )

Ex. 18. P= ( 1/3 -2/3 2/3 ; 2/3 -1/3 -2/3 ; 2/3 2/3 1/3 ) D= ( -3 0 0 ; 0 -6 0 ; 0 0 9 )

Ex. 19. P= ( -2/3 -1/sqrt(5) 4/sqrt(45) ; -1/3 2/sqrt(5) 2/sqrt(45) ; 2/3 0 5/sqrt(45) ) D= ( -2
00;070;007)

Ex. 20. P= ( -1/sqrt(2) 1/sqrt(18) -2/3 ; 1/sqrt(2) 1/sqrt(18) -2/3 ; 0 4/sqrt(18) 1/3 ) D= ( -3
0 0 ; 0 -3 0 ; 0 0 15 )

Ex. 21. P= ( -1/sqrt(2) 0 -1/2 ½ ; 1/sqrt(2) 0 -1/2 ½ ; 0 -1/sqrt(2) ½ ½ ; 0 1/sqrt(2) ½ ½ ) D= ( 1 0

00;0100;0050;0009)

Ex. 22. P= ( -1/sqrt(2) 0 1/sqrt(2) 0 ; 0 -1/sqrt(2) 0 1/sqrt(2) ; 1/sqrt(2) 0 1/sqrt(2) 0 ; 0 1/sqrt(2)

0 1/sqrt(2) ) D= ( 3 0 0 0 ; 0 3 0 0 ; 0 0 5 0 ; 0 0 0 5 )
Ex. 23. P= ( -1/sqrt(2) -1/sqrt(6) 1/sqrt(3) ; 1/sqrt(2) -1/sqrt(6) 1/sqrt(3) ; 0 2/sqrt(6) 1/sqrt(3) )
D= ( 5 0 0 ; 0 5 0 ; 0 0 2 )

Ex. 24. P= ( 1/sqrt(3) 1/sqrt(2) -1/sqrt(6) ; -1/sqrt(3) 1/sqrt(2) 1/sqrt(6) ; 1/sqrt(3) 0 2/sqrt(6) )
D= ( 4 0 0 ; 0 1 0 ; 0 0 1 )

Ex. 25. TTFF

Ex. 26. FTFF

Ex. 27-40. Outside of our objectives.