Skip to content

Spanning List

Definition

A spanning list for a vector space VV is a finite list V=(v1,…,vk)\mathcal{V}=(\boldsymbol{v}_1,\ldots,\boldsymbol{v}_k) of vectors such that

V=span⁡(V).V=\operatorname{span}(\mathcal{V}).

Interpretation

A spanning list contains enough vectors to generate the entire space: every vector of VV is a linear combination of v1,…,vk\boldsymbol{v}_1,\ldots,\boldsymbol{v}_k. It may contain redundant vectors, and then a vector can have several such representations.

Three vectors v1, v2 and v3 = v1 + v2 in the plane, with a vector w that can be written as a combination of them in many ways; the list spans the plane but is redundant.

In the figure, v1\boldsymbol{v}_1 lies on the x1x_1-axis, v2\boldsymbol{v}_2 on the x2x_2-axis and v3\boldsymbol{v}_3 on the diagonal between them. The list spans R2\mathbb{R}^2, and the same vector has several representations: w=2v1+1.5v2=0.5v1+1.5v3=v1+0.5v2+v3\boldsymbol{w}=2\boldsymbol{v}_1+1.5\boldsymbol{v}_2=0.5\boldsymbol{v}_1+1.5\boldsymbol{v}_3=\boldsymbol{v}_1+0.5\boldsymbol{v}_2+\boldsymbol{v}_3. Since v3=v1+v2\boldsymbol{v}_3=\boldsymbol{v}_1+\boldsymbol{v}_2, the list is redundant, and v3\boldsymbol{v}_3 can be omitted without changing the span.

Removing redundant vectors one at a time, as long as some vector is a combination of the others, ends with a linearly independent spanning list, which is a basis. So a spanning list is at least as long as a basis: a spanning list of Rn\mathbb{R}^n has at least nn vectors. Adding vectors to a spanning list keeps it spanning, while removing one may not.

To show that a list spans VV, take an arbitrary v∈V\boldsymbol{v}\in V and show that suitable coefficients exist; checking a few vectors is not enough. A spanning list is finite by definition, so a space that has one is finite-dimensional.


Key Results


Examples

  • ((1,0),(0,1),(1,1))((1,0),(0,1),(1,1)) spans R2\mathbb{R}^2 but is not a basis.

Prerequisites

Sources

Aliases: spanning set, generating set Symbols: element of, real numbers

Last updated: 20 October 2026 03:02