Spanning List¶
Definition¶
A spanning list for a vector space is a finite list of vectors such that
Interpretation¶
A spanning list contains enough vectors to generate the entire space: every vector of is a linear combination of . It may contain redundant vectors, and then a vector can have several such representations.
In the figure, lies on the -axis, on the -axis and on the diagonal between them. The list spans , and the same vector has several representations: . Since , the list is redundant, and 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 has at least vectors. Adding vectors to a spanning list keeps it spanning, while removing one may not.
To show that a list spans , take an arbitrary 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¶
- A basis is a spanning list with no linear redundancy.
- A finite-dimensional vector space has a finite spanning list.
Examples¶
- spans but is not a basis.
Prerequisites¶
Related Concepts¶
Sources¶
- Math II: Linear Algebra · Week 2
Aliases: spanning set, generating set Symbols: element of, real numbers
Last updated: 20 October 2026 03:02
Spanning ListLinear SpanVector SpaceBasisLinear CombinationLinear Dependence and IndependenceDimension