MTH 309E LINEAR ALGEBRA

2010.01.29 Lecture 8:

vector subspaces spanning sets

 Recall: three equivalent forms + = of equations 111 + 1 1 . . . . . . . . . three + = + Recall: three equivalent1 form of equations of equations Recall:11 + equivalent forms + 1 = 1 11 . . . . . . . . . 11 + = + + 1 = 111 + 111 + 1+ 1 = 1 . . . . . . . . . . . . system of linear equations vector equation . . . . . . = 1 + + 11+ + = 1 11 11 1 . . . . + + . = . 1 . . . 1 1 11 1 1 . . . + system of .linear equations . = . vector equation matrix equation 1 + . . . 1 11 1 11 11 11 1 . + + . . = . . . . . . 1 . . . . 1 + + . = . . . . 1 1 1 1 11 1 1 1 . . vector equation . . . . system of linear equations . = . matrix equation . . . . 1 11 1 1 1 . . . = . . . . . . . . . 1 11 1 11 1 1 1 1 1 . . =. . . . . . . . . . . . . . . . . . . = . . . 1 1

matrix eq

Recall:

Recall: is an matrix 1) If A

A= 1) If A is an matrix v1 v then A = v1 v then Col(A) = Span(v1 v) Nul(A) = Span(v | Aw = 0} Col(A) = {w R v )

1

Note: Nul(A) = the set ofAw = 0} Nul(A) = {w R | all solutions of the equations Ax = 0. Note: Nul(A) = the set of all solutions of the equations Ax = 0. 2) The matrix equation Ax = b has a solution i b Col(A). 2) The matrix equation Ax = b has a solution i b Col(A). 3) The matrix equation Ax = b has only one solution for each b Col(A) i Ax = 0 has only the trivial solution x = 0. 3) The matrix equation Ax = b has only one solution for each Equivalently: The 0 has equation Ax = solution x = 0. b Col(A) i Ax = matrix only the trivial b has only one solution for each b Col(A) i Nul(A) = {0}. Equivalently: The matrix equation Ax = b has only one solution for each b Col(A) i Nul(A) = {0}.

8-3

Proposition. Let vv R be a chosen solution of the equation Proposition. Let 00 R be a chosen solution of the equation Ax = b Ax = b
Proposition. Let v0 vv R this equation is of the form Then every solution ofthis aequation solution of formequation Then every solution of be chosen is of the the Then every solution where Nul(A). where n n Nul(A). v of this equation is of the form solutions of v = v0 + n Ax = 0 where n Nul(A).
solutions of Ax = b v0

b nv = = 0 + n Nul(A) v Axv= + n
0

vv0 nn 0 v0 n

solutions of solutionsof solutions 0 of Ax = solutions solutions of of Proof. Let v be a solution of Ax = b, and let n = vAx=vbbthen Ax =0 Ax Proof. Let v be a solution of Ax = b, and let n = v v0. Then= b Ax = b

= Nul(A) = Nul(A) v0 n v0= Nul(A)= Nul(A) n solutions of solutions of Ax = of Ax = 00 solutions solutions of = Nul(A) Ax = 0 Ax = 0

v = v0 + n v Ax = b, Proof. Let v be a solution of = v0 + nand let n =solutions of v v0. Then Also Ax An = A(v v0)v= Av0 Av0 = b b = 0 = b Also =v +n

An so n Nul(A).= A(v v0 ) = Av Av0 = b b = 0 Also An so n Nul(A). = A(v v0) = Av Av0 = b b = 0

so n Nul(A).

Example. Example. Take Take

A= A=

Solutions of Ax = 0: Solutions of Ax = 0: 1 1 4 0 1 1 4 0 1 2 3 0 1 2 3 0 3 3 2 0 3 3 2 0 We get: x = We get: x =

5 5 3 3 3 3 7 7 3 3 3 3

1 1 1 1 3 3

1 4 1 4 2 3 , 2 3 , 3 2 3 2 1 1 0 0

b= b=

0 0 3 3 6 6 0 0 0 0 0 0

Solutions of Ax = b: Solutions of Ax = b: 1 1 4 0 1 1 4 0 1 2 3 3 1 2 3 3 3 3 3 3 2 2 6 6

3 3

, 3 is a free variable. , 3 is a free variable.

0 0 0 0

0 0 1 1

5 3 5 3 7 3 7
3

0 0

1 1 0 0

0 0 0 0

0 0 1 1

5 3 5 3 7 7 3
3

0 0

1 1 1 1 0 0

Denition. A vector subspace of R is a subset V R such that 1) 0 V 2) if u v V then u + v V

Proposition. If A is an matrix then Nul(A) is a subspace of R. Proof. Note. If A is an matrix and b = 0 then the set of solutions 1) A 0 = 0, so 0 Nul(A). of the equation 2) If u v Nul(A) then Ax = b is not a subspace of+ v). = Au + Av = 0 + 0 = 0 A(u R Indeed: v) zero vector 0 is not a solution of Ax = b so the set so (u + the Nul(A). of solutions does not contain 0. 3) If v Nul(A) then

3) if v V and R then v V .

A(v) = (Av) = 0 = 0 Proposition. If w1 w R then Span(w1 w) is a sub space Nul(A). so v of R . Proof. 1) 0 = 0w1 + 0w2 + + 0w so 0 Span(w1 w). 2) If u v Span(w1 w) then so v = 1w1 + 2w2 + + w u = 1w1 + 2w2 + + w

and so u + v Span(w1 w).

u + v = (1 + 1)w1 + (2 + 2)w2 + + ( + )w

3) If v Span(w1 w) then 1 Indeed: the zero vector 0 is not a solution of Ax = b so the set = contain 0. 2 1 1 2 of solutions doesvnot 1w1 + 2w2 + + w so

v = 1w1 + 2w2 + + w 2 Proposition. If w1 1 1 R2then Span(w1 w) is a subw space of R. Span(w1 w). and so v 1 Proof. Recall: If A is an matrix 1) 0 = 0w1 + 0w2 + + 0w so 0 Span(w1 w). A = v1 v 1 2) If u v Span(w1 w) then then Col(A) = Span(v1 v). Thus Col(A) is a subspace of R. 1 u = 1w1 + 2w2 + + w v = 1w1 + 2w2 + + w Denition. If V is a subspace of R such that so V = Span(v1 v) 1 u + v = (1 + 1)w1 + (2 + 2)w2 + + ( + )w then the set {v1 v} is called a spanning set of V . and so u + v 1Span(w1 w).

Example. If A = v1 v is a matrix then {v1 v} is a 1 1 spanning set of Col(A).

Example.

Find a spanning set of Nul(A) if 3 6 1 1 2 2 A= 2 4 5 Solution:

1 7 3 1 8 4

Nul(A) = the set of solutions of Ax = 0: 3 6 1 1 2 2 2 4 5 1 7 3 1 8 4

We obtain: 1 22 + 4 35 2 2 3 = 24 + 25 4 4 5 5

where 2 4 5 are any numbers.

= 2

2 1 0 0 0

1 2 0 0 0 0

1 0 +4 2 1 0

0 1 3 1 2 2 0 0 0

3 0 +5 2 0 1