Dictionary of Meaning

<<Back
Please select a letter:
A | B | C | D | E | F | G | H | I | J | K | L | M | N | O | P | Q | R | S | T | U | V | W | X | Y | Z | 0-9

Linear span

*** Shopping-Tip: Linear span
In the mathematics mathematical subfield of linear algebra, the '''linear span''' of a set of vectors is the set of all linear combinations of the vectors. The ''linear span'' of a set of vectors is therefore a vector space but unlike a basis_(linear algebra) basis the vectors need not be linearly independent. The linear span is an example of a set-builder notation.

Definition
Given a vector space ''V'' over a field_(mathematics) field ''K'' and vectors '''v'''₁,...,'''v'''_''n'' in ''V'' then :

\mathrm{span}( \mathbf{v}_1 ,\ldots, \mathbf{v}_n) := \{ a_1 \mathbf{v}_1 + \cdots + a_n \mathbf{v}_n : a_1 ,\ldots, a_n \in K \} \,

is a linear subspace subspace ''S'' of ''V'' called the '''linear span''' of '''v'''₁,...,'''v'''_''n''. The vectors are called '''spanning vectors''' and :

\lbrace \mathbf{v}_1,\ldots,\mathbf{v}_n \rbrace

is called a '''spanning set''' or '''generating set''' of ''S''.

Notes
A ''spanning set'' is usually not a basis for ''S'' as the ''spanning vectors'' need not be linearly independent. On the other hand a '''minimal''' spanning set for a given vector space ''S'' is a basis. In other words a ''spanning set'' is a basis for ''S'' if and only if every vector in ''S'' can be written as a unique linear combination of elements in the ''spanning set''.

Examples
The real number real vector space R³ has {(1,0,0), (0,1,0), (0,0,1)} as a spanning set. This spanning set is actually a Basis (linear algebra) basis. Another spanning set for the same space is given by {(1,2,3), (0,1,2), (−1,1/2,3), (1,1,1)}, but this set is not a basis, because it is linearly dependent. The set {(1,0,0), (0,1,0), (1,1,0)} is not a spanning set of R³; instead its span is the space of all vectors in R³ whose last component is zero.

Theorems
'''Theorem 1:''' span(''v''₁,...,''v''_''n'') is a linear subspace subspace of ''V''. Furthermore, this span is the smallest subspace of ''V'' that the vectors ''v''₁,...,''v''_''n'' all belong to. This fact (which is proved later in this section) is one reason why the span is important. Now let ''S'' be a subset of the vector space ''V''. The ''linear span'' of ''S'' consists of all linear combinations of elements of ''S''. In symbols,
:

\mathrm{span}( S ) = \{ a_1 v_1 + \cdots + a_k v_k :  k \in \mathbf{N},  a_1 ,\ldots, a_k \in K , v_1 ,\ldots, v_k \in S \} \,

where N is the set of natural numbers (including zero). Notice that this time the number of vectors involved in the linear combination can vary, from zero on up, but it must still be finite each time. '''Theorem 2:''' span(''S'') is also a subspace of ''V''. Furthermore, this span is the smallest subspace of ''V'' that is a superset of ''S''. The rest of this section is a proof of Theorem 1. Theorem 2 is very similar, but a bit messier to write down, since the vectors involved in any given linear combination can vary. ''Proof of Theorem 1:'' Property 1:
The most general possible two elements of the span are ''x'' := ''a''₁''v''₁ + ... + ''a''_''n''''v''_''n'' and ''y'' := ''b''₁''v''₁ + ... + ''b''_''n''''v''_''n''. We have to show that ''x'' + ''y'' is also a linear combination. By using associativity and commutativity of addition and the distributive law, we can write :

x + y = ( a_1 + b_1 ) v_1 + \cdots + ( a_n + b_n ) v_n \,

and since ''a''_''i'' + ''b''_''i'' is a scalar for every ''i'', we see that ''x'' + ''y'' is indeed a linear combination of the given vectors. Property 2:
Let ''c'' be a scalar and again take ''x'' := ''a''₁''v''₁ + ... + ''a''_''n''''v''_''n''. We have to show that ''cx'' is also a linear combination. Now, :

c x = ( c a_1 ) v_1 + \cdots + ( c a_n ) v_n \,

and since ''ca''_''i'' is a scalar for every ''i'', we are done. Property 3:
The zero element 0_''V'' of ''V'' is a linear combination because we can write :

0_V = 0_K v_1 + 0_K v_2 + \cdots + 0_K v_n \,

(Here, 0_''K'' is the zero element of the field ''K''.) This equation is true because in every vector space we have 0_''K''''v'' = 0_''V''. Minimality:
Suppose ''W'' is another subspace of ''V'' which contains the vectors ''v''₁,...,''v''_''n''. Then ''W'' is closed under scalar multiplication and addition of vectors, so we can prove by mathematical induction that ''a''₁''v''₁ + ... + ''a''_''n''''v''_''n'' is an element of ''W'' for any scalars ''a''₁,...,''a''_''n''. Thus, span(''v''₁,...,''v''_''n''), the set of all such linear combinations, is a subset of ''W''. Category:Abstract algebra Category:Linear algebra de:Lineare HÃ¼lle it:Span lineare he:×§×‘×•×¦×” ×¤×•×¨×©×ª nl:Lineair omhulsel pl:Lin (matematyka) ru:Ð›Ð¸Ð½ÐµÐ¹Ð½Ð°Ñ? Ð¾Ð±Ð¾Ð»Ð¾Ñ‡ÐºÐ° sl:Linearna ogrinjaÄ?a

*** Shopping-Tip: Linear span