23.07.2012 Views

Linear Algebra

Linear Algebra

Linear Algebra

SHOW MORE
SHOW LESS

Create successful ePaper yourself

Turn your PDF publications into a flip-book with our unique Google optimized e-Paper software.

Section I. Definition of Vector Space 95<br />

can take x − 2y + z = 0 to be a one-equation linear system and expressing the<br />

leading variable in terms of the free variables x =2y− z.<br />

⎛ ⎞<br />

2y − z<br />

S = { ⎝ y ⎠<br />

z<br />

� ⎛<br />

� y, z ∈ R} = {y ⎝ 2<br />

⎞ ⎛<br />

1⎠<br />

+ z ⎝<br />

0<br />

−1<br />

⎞<br />

0 ⎠<br />

1<br />

� � y, z ∈ R}<br />

Now the subspace is described as the collection of unrestricted linear combinations<br />

of those two vectors. Of course, in either description, this is a plane<br />

through the origin.<br />

2.12 Example This is a subspace of the 2×2 matrices<br />

� �<br />

a 0 ��<br />

L = { a + b + c =0}<br />

b c<br />

(checking that it is nonempty and closed under linear combinations is easy). To<br />

paramatrize, express the condition as a = −b − c.<br />

� � � � � �<br />

−b − c 0 �� −1 0 −1 0 ��<br />

L = {<br />

b, c ∈ R} = {b + c<br />

b, c ∈ R}<br />

b c<br />

1 0 0 1<br />

As above, we’ve described the subspace as a collection of unrestricted linear<br />

combinations (by coincidence, also of two elements).<br />

Paramatrization is an easy technique, but it is important. We shall use it<br />

often.<br />

2.13 Definition The span (or linear closure) of a nonempty subset S of a<br />

vector space is the set of all linear combinations of vectors from S.<br />

�<br />

[S] ={c1�s1 + ···+ cn�sn � c1,... ,cn ∈ R and �s1,... ,�sn ∈ S}<br />

The span of the empty subset of a vector space is the trivial subspace.<br />

No notation for the span is completely standard. The square brackets used here<br />

are common, but so are ‘span(S)’ and ‘sp(S)’.<br />

2.14 Remark In Chapter One, after we showed that the solution set of a<br />

homogeneous linear system can written as {c1 � β1 + ···+ ck � �<br />

βk<br />

� c1,... ,ck ∈ R},<br />

we described that as the set ‘generated’ by the � β’s. We now have the technical<br />

term; we call that the ‘span’ of the set { � β1,... , � βk}.<br />

Recall also the discussion of the “tricky point” in that proof. The span of<br />

the empty set is defined to be the set {�0} because we follow the convention that<br />

a linear combination of no vectors sums to �0. Besides, defining the empty set’s<br />

span to be the trivial subspace is a convienence in that it keeps results like the<br />

next one from having annoying exceptional cases.<br />

2.15 Lemma In a vector space, the span of any subset is a subspace.

Hooray! Your file is uploaded and ready to be published.

Saved successfully!

Ooh no, something went wrong!