Linear Independence - Facts

Let V be a vector space over F. Let A V . 1. span(A) is the set of all vectors which can be expressed as linear combinations of (nite number of) vectors from A. 2. A is linearly independent, if for each x A, x span(A \ {x }). 3. If 0 A, then A is linearly dependent. 4. Each superset of a linearly dependent set is linearly dependent. 5. Each subset of a linearly independent set is linearly independent. 6. A set A V is called a spanning set of V if span(A) = V .

Basis

Denition: Let V be a vector space over F. A subset B of V is called a basis for V if B is linearly independent and span(B ) = V . Basis is NOT unique. Consider the vector space R2 as the vector space over R with usual vector addition and scalar multiplication operations. the following set of vectors form a basis for R2 . B1 = {(1, 0), (0, 1 )}. 35)}. B 2 = {( 1 , 0 ) , ( 0 , 2 B3 = {(1, 47), (0, 100056)}.

A Result
Theorem: Let V be a vector space and B V . Then the following are equivalent: 1. B is a basis of V 2. B is a maximal linearly independent set in V , i.e., B is linearly independent and B {u } is linearly dependent for any u V . 3. B is a minimal spanning set of V , i.e., span(B ) = V and no proper subset of B can span V . Proof: (1) (2) : Since B is a basis, span(B ) = V . If v V , then v is a linear combination of elements of B . Then B {v } is linearly dependent. Then B is a maximal linearly independent subset of V.

Prof Contd.
(2) (3) : Since B is linearly independent, for any v B , v span(B \{v }). So, no subset of B can span V . If v V \ span(B ), then B {v } is linearly independent, which contradicts the assumption. So, span(B ) = V . (3) (1) : Assume that B is a minimal spanning set of V span(B ) = V . Suppose B is linearly dependent, i.e., u B such that u span(B \{u }). span(B \{u }) = V which contradicts the assumption that B is minimal spanning set. Denition: A vector space V is said to be nite dimensional if there exists a nite basis for V . A vector space which is not nite dimensional is called innite dimensional vector space.

A Result
Example: Fn , Pn , Mmn (F) are nite dimensional vector spaces over F. Theorem: If a vector space has a nite spanning set, then it has a nite basis. Proof: Let V = span(S ) for some S V with |S | < . If S is linearly independent, then S is a basis. Otherwise, u1 S such that u1 span(S \{u1 }). Therefore, span(S \{u1 }) = V . If S1 = S \{u1 } is linearly independent, then S1 is a basis. Otherwise, one can repeat the process. The process has to stop since S is a nite set and we end up with a subset Sk of S such that Sk is linearly independent and span(Sk ) = V .

Examples
1. Compute a basis of V = {(x , y ) R2 : 2x y = 0}. Solution: (x , y ) V y = 2x (x , y ) = (x , 2x ) = x (1, 2) V = span({(1, 2)}). Since {(1, 2)} is linearly independent, it is a basis for V . 2. Compute a basis of V = {(x , y , z ) R3 : x 2y + z = 0}. Solution: (x , y , z ) V x = 2y z (x , y , z ) = (2y z , y , z ) = y (2, 1, 0) + z (1, 0, 1) V = span({(2, 1, 0), (1, 0, 1)}). [Check whether these vectors are linearly independent.] {(2, 1, 0), (1, 0, 1)} is a basis of V . 3. Compute a basis of V = {(x1 , . . . , x5 ) R5 : x1 + x3 x5 = 0 and x2 x4 = 0}.

Why a basis?
Theorem Let V be a vector space over F. Suppose B = {u1 , u2 , . . . , un } be a basis of V and v V be any vector. Then, there are unique scalars c1 , c2 , . . . , cn F such that v = c1 u1 + c2 u2 + + cn un . Proof. Suppose v = c1 u1 + c2 u2 + + cn un = d1 u1 + d2 u2 + + dn un . (c1 d1 )u1 + (c2 d2 )u2 + + (cn dn )un = 0 c1 d1 = c2 d2 = = cn dn = 0, as B is lin. ind. We thus have a map from V to Fn that connects v to (c1 , . . . , cn ). Conversely given (c1 , . . . , cn ) we have a v = c1 u1 + + cn un . Once a basis B is xed, the map is one-one and onto. Now, if there is another basis having m elements, then we will also have a one-one onto map from V to Fm . Is there any relation between such m and n?

A Result for Span

Theorem (Exchange Lemma) : Let V be a vector space over F. Let A be a spanning set of V . Suppose x V \ A and x = 0. Then there exists a vector y A such that (A \ {y }) {x } is a spanning set of V . proof. Since A is a spanning set, x = n i =1 ci yi for some ci F and some yi A. Since x = 0, at least one of these c s, say, cj is non-zero. Then yj = 1 [x + c1 y1 + cj 1 yj 1 + cj +1 yj +1 + cn yn cj

Let v V . Since A spans V , we have v= m i =1 ai zi + byj for some ai F, for some zi A \ {yj }, where b F may or may not be 0. Then
m

v=
i =1

ai zi + b

1 [x + c1 y1 + cj 1 yj 1 + cj +1 yj +1 + cn yn cj

Hence (A \ {y }) {x } spans V .

Span and Linear Independence

Theorem Let V be a vector space. Let A = {x1 , x2 , . . . , xn } be a spanning set for V . Let B = {y1 , y2 , . . . , ym } be a linearly independent subset of V . Then m n. proof. Suppose m > n. Construct a set of vectors C as in the following: Initially, take C := A for i = 1 to n, do if yi A, then nd an xj A by the Exchange Lemma and take C := (C \ {xj }) {yi } od At every step of the execution of the for loop, C is a spanning set. Further, each x gets removed from C and the y s are introduced to it. Finally we get C = {y1 , . . . , yn } and it spans V . Since m > n, yn+1 B . But yn+1 V = span(C ). This contradicts the linear independence of B . Therefore, m n.

Some Corollaries of Exchange Lemma

Observe: In R, any two real numbers are linearly dependent. In R2 , any three vectors are linearly dependent. Any four polynomials in P2 are linearly dependent. Theorem: Let V be a vector space with a basis consisting of n elements. Then any subset of V having n + 1 vectors is linearly dependent. Proof: Let A, B V , |A| > |B |, and B a basis for V . Since B spans V , if A is linearly independent then |A| |B |. This is a contradiction. Hence A is linearly dependent. Theorem If a vector space contains an innite linearly independent subset, then it is an innite dimensional space. Proof. It cannot have a nite spanning set. Theorem Any two bases of a nite dimensional vector space have same cardinality. Proof. Treat one as a spanning set and the other as a linearly independent set. Change roles.