Span (mathematics): Difference between revisions
Jump to navigation
Jump to search
imported>Richard Pinch (New entry, just a stub) |
imported>Richard Pinch (define and anchor Spanning set) |
||
Line 3: | Line 3: | ||
For ''S'' a [[subset]] of an ''R''-module ''M'' we have | For ''S'' a [[subset]] of an ''R''-module ''M'' we have | ||
:<math>\langle S \rangle = \left\lbrace \sum_{i=1}^n r_i s_i : r_i \in R,~ s_i \in S \right\rbrace = \bigcap_{S \subseteq N; N \le M | :<math>\langle S \rangle = \left\lbrace \sum_{i=1}^n r_i s_i : r_i \in R,~ s_i \in S \right\rbrace = \bigcap_{S \subseteq N; N \le M} N .\,</math> | ||
We say that ''S'' spans, or is a '''spanning set''' for <math>S = \langle S \rangle</math>. | |||
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 12:23, 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 .
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.