Span (mathematics): Difference between revisions

From Citizendium
Jump to navigation Jump to search
imported>Richard Pinch
m (typo)
imported>Bruce M. Tindall
mNo edit summary
 
(One intermediate revision by one other user not shown)
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.  


Line 6: Line 7:


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]].

Latest revision as of 13:20, 7 February 2009

This article is developing and not approved.
Main Article
Discussion
Related Articles  [?]
Bibliography  [?]
External Links  [?]
Citable Version  [?]
 
This editable Main Article is under development and subject to a disclaimer.

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.