Linear independence
In the theory of vector spaces, a set of vectors is said to be linearly independent if there exists no nontrivial linear combination of the vectors that equals the zero vector. If such a linear combination exists, then the vectors are said to be linearly dependent. These concepts are central to the definition of dimension.[1]
For linear dependence of random variables, see Covariance.A vector space can be of finite dimension or infinite dimension depending on the maximum number of linearly independent vectors. The definition of linear dependence and the ability to determine whether a subset of vectors in a vector space is linearly dependent are central to determining the dimension of a vector space.
Evaluating linear independence[edit]
The zero vector[edit]
If one or more vectors from a given sequence of vectors is the zero vector then the vector are necessarily linearly dependent (and consequently, they are not linearly independent). To see why, suppose that is an index (i.e. an element of ) such that Then let (alternatively, letting be equal any other non-zero scalar will also work) and then let all other scalars be (explicitly, this means that for any index other than (i.e. for ), let so that consequently ). Simplifying gives: