Professional Documents
Culture Documents
Mit18 06scf11 Ses1.9sol
Mit18 06scf11 Ses1.9sol
Problem 9.1: (3.5 #2. Introduction to Linear Algebra: Strang) Find the largest
possible number of independent vectors among:
⎡ ⎤ ⎡ ⎤ ⎡ ⎤
1 1 1
⎢ −1 ⎥ ⎢ 0
⎥ ⎢ 0
⎥
v1 =
⎢
⎣
0 ⎦
, v2 =
⎣
−1
⎦
, v3 =
⎣
0
⎦
,
⎥ ⎢ ⎥ ⎢ ⎥
0
0
−1
⎡ ⎤ ⎡ ⎤ ⎡ ⎤
0 0 0
⎢ 1
⎥
⎥ , v5 =
⎢ 1
⎥ and v6 =
⎢ 0
⎥ .
⎢ ⎥ ⎢ ⎥
v4 =
⎢
⎣
−1 ⎦
⎣
0
⎦
⎣
1
⎦
0 −1 −1
⎢ −1 0 0 ⎥
⎥ ⎢ 0 1 1
⎥
⎥ ⎢ 0 1 1
⎥
⎥ ⎢ 0 1 1
⎥
⎢
⎣
0 −1 −→
⎢
⎣
0 −1 −→
⎢ −→
⎢ ⎥ .
0 ⎦
0
⎦
⎣
0 0 1
⎦
⎣
0 0 1
⎦
0
0 −1 0
0
−1 0 0 −1 0 0 0
⎡ ⎤
1 −2 3
A =
⎣
0 0 0 ⎦.
0 0 0
1
The special solutions to Ax = 0 are
⎡ ⎤ ⎡ ⎤
2 −3
v1 = ⎣ 1 ⎦ and v2 = ⎣ 0 ⎦ .
0 1
These form a basis for the nullspace of A and thus for the plane.
The intersection of this plane with the xy plane contains v1 and does
not contain v2 ; the intersection must be a line. Since v1 lies on this line it
also provides a basis for it.
Finally, we can use “inspection” or the cross product to find the vector
⎡ ⎤
1
v3 = ⎣ −2 ⎦ ,
3
MIT OpenCourseWare
http://ocw.mit.edu
For information about citing these materials or our Terms of Use, visit: http://ocw.mit.edu/terms.