Span (mathematics): Difference between revisions
Jump to navigation
Jump to search
imported>Richard Pinch (link to basis) |
imported>Bruce M. Tindall mNo edit summary |
||
Line 1: | Line 1: | ||
{{subpages}} | |||
In [[algebra]], the '''span''' of a set of elements of a [[module (algebra)|module]] or [[vector space]] is the set of all finite [[linear combination]]s of that set: it may equivalently be defined as the [[intersection]] of all [[submodule]]s or [[subspace]]s containing the given set. | In [[algebra]], the '''span''' of a set of elements of a [[module (algebra)|module]] or [[vector space]] is the set of all finite [[linear combination]]s of that set: it may equivalently be defined as the [[intersection]] of all [[submodule]]s or [[subspace]]s containing the given set. | ||
Revision as of 12:20, 7 February 2009
In algebra, the span of a set of elements of a module or vector space is the set of all finite linear combinations of that set: it may equivalently be defined as the intersection of all submodules or subspaces containing the given set.
For S a subset of an R-module M we have
We say that S spans, or is a spanning set for .
A basis is a linearly independent spanning set.
If S is itself a submodule then .
The equivalence of the two definitions follows from the property of the submodules forming a closure system for which is the corresponding closure operator.