Prerequisite: Vector Space

Span

If v1,,vpRn\mathbf{v}_1,\dots, \mathbf{v}_p\in \mathbb{R}^n, then the set of all linear combinations of v1,,vp\mathbf{v}_1, \dots, \mathbf{v}_p is denoted by Span(v1,,vp)\text{Span}(\mathbf{v}_1, \dots, \mathbf{v}_p) and is called the subset of Rn\mathbb{R}^n spanned by v1,,vp\mathbf{v}_1, \dots, \mathbf{v}_p.

Span is the smallest containing subspace

The span of a list of vectors in VV is the smallest subspace of VV containing all the vectors in the list.

Linear Independence

An indexed set of vectors {v1,,vp}\{\mathbf{v}_1, \dots, \mathbf{v}_p\} in Rn\mathbb{R}^n is said to be linearly dependent if

x1v1++xpvp=0x_1\mathbf{v}_1 + \dots + x_p \mathbf{v}_p = \mathbf{0}

has only the trivial solution. In other words, they are call linearly dependent if there exists non-zero solution.

Proposition: If p>np>n, then the set is linearly dependent.

Characterization of Linearly Dependent Sets

An indexed set S={v1,,vp}S=\{\mathbf{v}_1, \dots, \mathbf{v}_p\} of two or more vectors is linearly dependent if and only if at least one of the vectors is a linear combination of the others.