Linear independence is sometimes difficult to understand initially, and you
might find it easier to think first about dependence. A set of vectors is a
dependent set if one of the vectors
can be written as a linear
combination of (
depends on) the other vectors in the set.
The simplest check for dependence is to see if any vector in the
set is a multiple of one of the other vectors; if so, the set is dependent.
If not, a more careful analysis is needed to decide whether the set is
a dependent set or an independent set.
If the vectors are put (as columns) into a matrix A, then the set
is dependent if and only iff
has some nontrivial solutions.
A general purpose check for dependence is to put the vectors into a matrix
and reduce the matrix. If every column has a pivot, then the vectors are
independent; otherwise they are dependent. Another simple check for
dependence is to count components: if the vectors are n-vectors and
there are more than n of them, they must be dependent. Unfortunately, the
converse is not true: a set of m n-vectors with
could be
dependent or independent. The columns of the
identity matrix
form a nice set of independent vectors.