Span (mathematics): Difference between revisions
Jump to navigation
Jump to search
imported>Richard Pinch m (typo) |
imported>Richard Pinch (link to basis) |
||
Line 6: | Line 6: | ||
We say that ''S'' spans, or is a '''spanning set''' for <math>\langle S \rangle</math>. | We say that ''S'' spans, or is a '''spanning set''' for <math>\langle S \rangle</math>. | ||
A [[Basis (linear algebra)|basis]] is a [[Linear independence|linearly independent]] spanning set. | |||
If ''S'' is itself a submodule then <math>S = \langle S \rangle</math>. | If ''S'' is itself a submodule then <math>S = \langle S \rangle</math>. | ||
The equivalence of the two definitions follows from the property of the submodules forming a [[closure system]] for which <math>\langle \cdot \rangle</math> is the corresponding [[closure operator]]. | The equivalence of the two definitions follows from the property of the submodules forming a [[closure system]] for which <math>\langle \cdot \rangle</math> is the corresponding [[closure operator]]. |
Revision as of 15:45, 6 January 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.