Linear independence

From Wikipedia, the free encyclopedia
  (Redirected from Linearly dependent)
Jump to: navigation, search
Linearly independent vectors in R3
Linearly dependent vectors in a plane in R3.

In the theory of vector spaces the concept of linear dependence and linear independence of the vectors in a subset of the vector space is central to the definition of dimension. A set of vectors is said to be linearly dependent if one of the vectors in the set can be defined as a linear combination of the other vectors. If no vector in the set can be written in this way, then the vectors are said to be linearly independent.[1]

A vector space can be of finite dimension or infinite dimension depending on the number of linearly independent basis vectors. The definition of linear dependence and the ability to determine whether a subset of vectors in a vector space are linearly dependent are central to determining a set of basis vectors for a vector space.

Definition[edit]

The vectors in a subset S=(v1,v2,...,vk) of a vector space V are said to be linearly dependent, if there exist a finite number of distinct vectors v1, v2, ..., vn in S and scalars a1, a2, ..., an, not all zero, such that

 a_1 v_1 + a_2 v_2 + \cdots + a_k v_k = 0,

where zero denotes the zero vector.

Notice that if not all of the scalars are zero, then at least one is non-zero, say a1, in which case this equation can be written in the form

  v_1 = \frac{-a_2}{a_1} v_2 + \cdots + \frac{-a_k}{a_1}v_k .

Thus, v1 is shown to be a linear combination of the remaining vectors. It is worth noting that non-zero a1 and the equation defining linear dependence together imply that at least one other scalar ai is non-zero.

The vectors in a set T=(v1,v2,...,vn) are said to be linearly independent if the equation

 a_1 v_1 + a_2 v_2 + \cdots + a_n v_n = 0,

can only be satisfied by ai=0 for i=1,..., n. This implies that no vector in the set can be represented as a linear combination of the remaining vectors in the set. In other words, a set of vectors is linearly independent if the only representations of 0 as a linear combination of its vectors is the trivial representation in which all the scalars ai are zero.[2]

Infinite dimensions[edit]

In order to allow the number of linearly independent vectors in a vector space to be countably infinite, it is useful to define linearly dependence as follows. More generally, let V be a vector space over a field K, and let {vi | iI} be a family of elements of V. The family is linearly dependent over K if there exists a family {aj | jJ} of elements of K, not all zero, such that

 \sum_{j \in J} a_j v_j = 0 \,

where the index set J is a nonempty, finite subset of I.

A set X of elements of V is linearly independent if the corresponding family {x}xX is linearly independent. Equivalently, a family is dependent if a member is in the linear span of the rest of the family, i.e., a member is a linear combination of the rest of the family. The trivial case of the empty family must be regarded as linearly independent for theorems to apply.

A set of vectors which is linearly independent and spans some vector space, forms a basis for that vector space. For example, the vector space of all polynomials in x over the reals has the (infinite) subset {1, x, x2, ...} as a basis.

Geometric meaning[edit]

A geographic example may help to clarify the concept of linear independence. A person describing the location of a certain place might say, "It is 3 miles north and 4 miles east of here." This is sufficient information to describe the location, because the geographic coordinate system may be considered as a 2-dimensional vector space (ignoring altitude and the curvature of the Earth's surface). The person might add, "The place is 5 miles northeast of here." Although this last statement is true, it is not necessary.

In this example the "3 miles north" vector and the "4 miles east" vector are linearly independent. That is to say, the north vector cannot be described in terms of the east vector, and vice versa. The third "5 miles northeast" vector is a linear combination of the other two vectors, and it makes the set of vectors linearly dependent, that is, one of the three vectors is unnecessary.

Also note that if altitude is not ignored, it becomes necessary to add a third vector to the linearly independent set. In general, n linearly independent vectors are required to describe any location in n-dimensional space.

Evaluating linear independence[edit]

Vectors in R2[edit]

Three vectors: Consider the set of vectors v1= (1, 1), v2= (-3, 2) and v3= (2, 4), then the condition for linear dependence seeks a set of non-zero scalars, such that

 a_1 \begin{Bmatrix} 1\\1\end{Bmatrix} + a_2 \begin{Bmatrix} -3\\2\end{Bmatrix} + a_3 \begin{Bmatrix} 2\\4\end{Bmatrix} =\begin{Bmatrix} 0\\0\end{Bmatrix},

or

 \begin{bmatrix} 1 & -3 & 2 \\ 1 & 2 & 4 \end{bmatrix}\begin{Bmatrix} a_1\\ a_2 \\ a_3 \end{Bmatrix}= \begin{Bmatrix} 0\\0\end{Bmatrix}.

Row reduce this matrix equation by subtracting the first equation from the second to obtain,

 \begin{bmatrix} 1 & -3 & 2 \\ 0 & 5 & 2 \end{bmatrix}\begin{Bmatrix} a_1\\ a_2 \\ a_3 \end{Bmatrix}= \begin{Bmatrix} 0\\0\end{Bmatrix}.

Continue the row reduction by (i) dividing the second equation by 5, and then (ii) multiplying by 3 and adding to the first equation, that is

 \begin{bmatrix} 1 & 0 & 16/5 \\ 0 & 1 & 2/5 \end{bmatrix}\begin{Bmatrix} a_1\\ a_2 \\ a_3 \end{Bmatrix}= \begin{Bmatrix} 0\\0\end{Bmatrix}.

We can now rearrange this equation to obtain

 \begin{bmatrix} 1 & 0  \\ 0 & 1 \end{bmatrix}\begin{Bmatrix} a_1\\ a_2 \end{Bmatrix}= \begin{Bmatrix} a_1\\ a_2 \end{Bmatrix}=-a_3\begin{Bmatrix} 16/5\\2/5\end{Bmatrix}.

which shows that non-zero ai exist so v3= (2, 4) can be defined in terms of v1= (1, 1), v2= (-3, 2). Thus, the three vectors are linearly dependent.

Two vectors: Now consider the linear dependence of the two vectors v1= (1, 1), v2= (-3, 2), and check,

 a_1 \begin{Bmatrix} 1\\1\end{Bmatrix} + a_2 \begin{Bmatrix} -3\\2\end{Bmatrix}  =\begin{Bmatrix} 0\\0\end{Bmatrix},

or

 \begin{bmatrix} 1 & -3  \\ 1 & 2  \end{bmatrix}\begin{Bmatrix} a_1\\ a_2 \end{Bmatrix}= \begin{Bmatrix} 0\\0\end{Bmatrix}.

The same row reduction presented above yields,

 \begin{bmatrix} 1 & 0  \\ 0 & 1 \end{bmatrix}\begin{Bmatrix} a_1\\ a_2 \end{Bmatrix}= \begin{Bmatrix} 0\\0\end{Bmatrix}.

This shows that ai=0, which means the vectors v1= (1, 1) and v2= (-3, 2) are linearly independent.

Vectors in R4[edit]

In order to determine if the three vectors in R4,

 \mathbf{v}_1= \begin{Bmatrix}1\\4\\2\\-3\end{Bmatrix},  \mathbf{v}_2=\begin{Bmatrix}7\\10\\-4\\-1\end{Bmatrix}, \mathbf{v}_3=\begin{Bmatrix}-2\\1\\5\\-4\end{Bmatrix}.

are linearly dependent, form the matrix equation,

\begin{bmatrix}1&7&-2\\4& 10& 1\\2&-4&5\\-3&-1&-4\end{bmatrix}\begin{Bmatrix} a_1\\ a_2 \\ a_3 \end{Bmatrix} =  \begin{Bmatrix}0\\0\\0\\0\end{Bmatrix}.

Row reduce this equation to obtain,

 \begin{bmatrix} 1& 7 & -2 \\ 0& -18& 9\\ 0 & 0 & 0\\ 0& 0& 0\end{bmatrix} \begin{Bmatrix} a_1\\ a_2 \\ a_3 \end{Bmatrix} =  \begin{Bmatrix}0\\0\\0\\0\end{Bmatrix}.

Rearrange to solve for v3 and obtain,

 \begin{bmatrix} 1& 7 \\ 0& -18& \end{bmatrix} \begin{Bmatrix} a_1\\ a_2  \end{Bmatrix} =  -a_3\begin{Bmatrix}-2\\9\end{Bmatrix}.

This equation is easily solved to define non-zero ai,

 a_1 = -3 a_3 /2,  a_2 = a_3/2,

where a3 can be chosen arbitrarily. Thus, the vectors v1, v2 and v3 are linearly dependent.

Alternative method using determinants[edit]

An alternative method uses the fact that n vectors in \mathbb{R}^n are linearly independent if and only if the determinant of the matrix formed by taking the vectors as its columns is non-zero.

In this case, the matrix formed by the vectors is

A = \begin{bmatrix}1&-3\\1&2\end{bmatrix} . \,\!

We may write a linear combination of the columns as

 A \Lambda = \begin{bmatrix}1&-3\\1&2\end{bmatrix} \begin{bmatrix}\lambda_1 \\ \lambda_2 \end{bmatrix} . \,\!

We are interested in whether AΛ = 0 for some nonzero vector Λ. This depends on the determinant of A, which is

 \det A = 1\cdot2 - 1\cdot(-3) = 5 \ne 0 . \,\!

Since the determinant is non-zero, the vectors (1, 1) and (−3, 2) are linearly independent.

Otherwise, suppose we have m vectors of n coordinates, with m < n. Then A is an n×m matrix and Λ is a column vector with m entries, and we are again interested in AΛ = 0. As we saw previously, this is equivalent to a list of n equations. Consider the first m rows of A, the first m equations; any solution of the full list of equations must also be true of the reduced list. In fact, if 〈i1,...,im〉 is any list of m rows, then the equation must be true for those rows.

 A_{{\lang i_1,\dots,i_m} \rang} \Lambda = \bold{0} . \,\!

Furthermore, the reverse is true. That is, we can test whether the m vectors are linearly dependent by testing whether

 \det A_{{\lang i_1,\dots,i_m} \rang} = 0 \,\!

for all possible lists of m rows. (In case m = n, this requires only one determinant, as above. If m > n, then it is a theorem that the vectors must be linearly dependent.) This fact is valuable for theory; in practical calculations more efficient methods are available.

Natural basis vectors[edit]

Let V = Rn and consider the following elements in V, known as the natural basis vectors:

\begin{matrix}
\mathbf{e}_1 & = & (1,0,0,\ldots,0) \\
\mathbf{e}_2 & = & (0,1,0,\ldots,0) \\
& \vdots \\
\mathbf{e}_n & = & (0,0,0,\ldots,1).\end{matrix}

Then e1, e2, ..., en are linearly independent.

Proof[edit]

Suppose that a1, a2, ..., an are elements of R such that

 a_1 \mathbf{e}_1 + a_2 \mathbf{e}_2 + \cdots + a_n \mathbf{e}_n = 0 . \,\!

Since

 a_1 \mathbf{e}_1 + a_2 \mathbf{e}_2 + \cdots + a_n \mathbf{e}_n = (a_1 ,a_2 ,\ldots, a_n) , \,\!

then ai = 0 for all i in {1, ..., n}.

Linear independence of basis functions[edit]

Let V be the vector space of all functions of a real variable t. Then the functions et and e2t in V are linearly independent.

Proof[edit]

Suppose a and b are two real numbers such that

aet + be2t = 0

for all values of t. We need to show that a = 0 and b = 0. In order to do this, we divide through by et (which is never zero) and subtract to obtain

bet = −a.

In other words, the function bet must be independent of t, which only occurs when b = 0. It follows that a is also zero.

Projective space of linear dependences[edit]

A linear dependence among vectors v1, ..., vn is a tuple (a1, ..., an) with n scalar components, not all zero, such that

a_1 \mathbf{v}_1 + \cdots + a_n \mathbf{v}_n=0. \,

If such a linear dependence exists, then the n vectors are linearly dependent. It makes sense to identify two linear dependences if one arises as a non-zero multiple of the other, because in this case the two describe the same linear relationship among the vectors. Under this identification, the set of all linear dependences among v1, ...., vn is a projective space.

Linear dependence between random variables[edit]

The covariance is sometimes called a measure of "linear dependence" between two random variables. That does not mean the same thing as in the context of linear algebra. When the covariance is normalized, one obtains the correlation matrix. From it, one can obtain the Pearson coefficient, which gives the goodness of the fit for the best possible linear function describing the relation between the variables. In this sense covariance is a linear gauge of dependence.

See also[edit]

References[edit]

  1. ^ G. E. Shilov, Linear Algebra (Trans. R. A. Silverman), Dover Publications, New York, 1977.
  2. ^ Friedberg, Insel, Spence, Stephen, Arnold, Lawrence. Linear Algebra. Pearson, 4th Edition. pp. 48–49. ISBN 0130084514. 

External links[edit]