MATH 323 Lecture 11

From Notes
Jump to navigation Jump to search

« previous | Tuesday, October 2, 2012 | next »


Linear Independence

  1. If v1,…,vn span V and one of these vectors can be written as a linear combination of the n−1 others, then those n−1 vectors span V.
  2. Given n vectors v1,…,vn∈V, it is possible to write one of the vectors as a linear combination of the other n−1 vectors iff there exist scalars c1,…,cn (not all zero!) such that c1v1+…+cnvn=0.

Recall that c1v1+…+cnvn is a linear combination of v1,…,vn.

The vectors v1,…,vn∈V are said to be linearly independent if c1v1+…+cnvn=0 implies that all the scalars c1,…,cn must all be zero.

Example

For two vectors v1,v2∈V such that c1v1+c2v2=0

  1. If c1≠0, then v1=−c2c1v2
  2. If c2≠0, then v2=−c1c2v1

Thus the two vectors are linearly dependent

Example

Which of the following collectios are linearly independent?

  1. (111),(110),(100) Yes.
  2. (101),(010) Yes.
  3. (124),(213),(4−11) No. The matrix of system c1v1+c2v2+c3v3=0 is singular, therefore there are nontrivial solutions ⟨c1,c2,c3⟩ that will satisfy the equation. (See #Theorem)

Theorem

Let x1,…,xn be n vectors in ℝn and let X=(x1,…,xn) be the n×n matrix formed by using the x vectors as columns.

The vectors x1,…,xn will be linearly dependent iff X is singular and linearly independent iff X is nonsingular

Proof

Let c→=⟨c1,…,cn⟩, then Xc→=0→ has a nontrivial solution iff X is singular.


For Non-Square Matrix

For x1,…,xk∈ℝ, the system c1x1…ckxk=0 can be written as Xc→=0→, where X=(x1,…,xk) is an n×k matrix. Therefore if n≠k, the determinant of X is not defined and #Theorem does not apply.

However, the system has nontrivial solutions (i.e. x1,…,xn is linearly dependent) iff the row echelon form of X has at least one free variable.

Example

x1=⟨1,−1,2,3⟩, x2=⟨−2,3,1,−2⟩, and x3=⟨1,0,7,7⟩

[1−210−130021703−270]⟶[1−210011000000000]

Therefore, since c3 is a free variable, {x1,x2,x3} is linearly dependent.

Theorem

Let v1,…,vn∈V. A vector w∈Span(v1,…,vn) can be written uniquely as a linear combination of v1,…,vn iff v1,…,vnare linearly independent.

Proof

w∈Span(v1,…,vn)⟺v=c1v1+…cnvn

Assume the solution is not unique, that is, v=α1v1+…+αnvn=β1v1+…+βnvn where αi≠βi for some i. This would mean that 0=(α1−β1)v1+…+(αn−βn)vn, where αi−βi≠0, would be linearly dependent.


Therefore, if v1,…,vn are linearly dependent, then there exist c1,…,cn (not all zero) such that

0=c1v1+…+cnvn+w=α1v1+…αnvn=w=(α1+c1)v1+…+(αn+cn)vn

The second and third lines are two different representations for w

Example

Let p1(x)=x2−2x+3, p2(x)=2x2+x+8, and p3(x)=x2+8x+7 be in P3.

c1p1(x)+c2p2(x)+c3p3(x)=0c1(x2−2x+3)+c2(2x2+x+8)+c3(x2+8x+7)=0(c1+2c2+c3)x2+(−2c1+c2+8c3)x+(3c1+8c2+7c3)=0x2+0x+0

Therefore, since coefficients of terms must be equal,

c1+2c2+c3=0−2c1+c2+8c3=03c1+8c2+7c3=0

|121−218387|=0, so the matrix is singular, and therefore the polynomials p1(x),p2(x),p3(x) are linearly dependent.

Wronskian Theorem

The following determinant of a matrix of functions and derivatives

W[f1,…,fn](x)=|f1(x)f2(x)…fn(x)f1′(x)f2′(x)…fn′(x)⋮⋮⋱⋮f1(n−1)(x)f2(n−1)(x)…fn(n−1)(x)|

Is called the Wronskian

Let f1,…,fn be n−1-th differentiable functions along the interval [a,b]. If there exists a point x0 in [a,b] such that W[f1,…,fn](x)≠0, then f1,…,fn are linearly independent.