Linear span

omipus

已于 2022-12-17 21:13:47 修改

阅读量248

点赞数

分类专栏： Reference 文章标签：算法

于 2022-09-22 13:35:34 首次发布

本文链接：https://blog.csdn.net/qq_66485519/article/details/126990056

版权

Reference 专栏收录该内容

581 篇文章 5 订阅

订阅专栏

In mathematics, the linear span (also called the linear hull or just span) of a set $S$ of vectors (form a vector space), denoted $s p an (S)$ , is the smallest linear subspace that contains the set. It can be characterized either as the intersection of all linear subspaces that contain $S$ , or as the set of linear combinations of elements of $S$ . The linear span of a set of vectors is therefore a vector space. Spans can be generalized to matroid and modules.
For expressing that a vector space $V$ is a span of a set $S$ , one commonly uses the following phrases: $S$ spans $V$ ; $S$ generates $V$ ; $V$ is spanned by $S$ ; $V$ is generated by $S$ ; $S$ is a spanning set of $V$ ; $S$ is a generating set of $V$ .

1 Definition
2 Examples
3 Theorems
4 Generalizations
5 Closed linear span functional analysis)
- 5.1 Notes
- 5.2 A useful lemma
6 See also
7 Citations
8 Sources
- 8.1 Textbook
- 8.2 Web
9 External links

1 Definition

Given a vector space $V$ over a field $K$ , the span of a set $S$ of vectors (not necessarily infinite) is defined to be the intersection $W$ of all subspaces of $V$ that contain $S$ . $W$ is referred to as the subspace spanned by $S$ , or by the vectors in $S$ . Conversely, $S$ is called a spanning set of $W$ , and we say that $S$ spans $W$ .

Alternatively, the span of $S$ may be defined as the set of all finite linear combinations of elements (vectors) of $S$ , which follows from the above definition.
$\operatorname {span} (S)=\left\{{\left.\sum _{i=1}^{k}\lambda _{i}v_{i}\;\right|\;k\in \mathbb {N} ,v_{i}\in S,\lambda _{i}\in K}\right\}.$

In the case of infinite $S$ , infinite linear combinations (i.e. where a combination may involve an infinite sum, assuming that such sums are defined somehow as in, say, a Banach space are excluded by the definition; a generalization that allows these is not equivalent.

2 Examples

The real vector space $R^3$ has ${ (-1,0,0), (0,1,), (0,0,1) \}$ as a spanning set. This particular spanning set is also a basis. If $(- 1, 0, 0)$ were replaced by $(1, 0, 0)$ , it would also form the canonical basis of $R^3$ .

Another spanning set for the same space if 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 spanning set of $R$ , since its span is the space of all vectors in $R^3$ whose last component is zero. That space is also spanned by the set ${ (1,0,0), (0,1,0) \}$ , as $(1, 1, 0)$ is a linear combination of $(1, 0, 0), (0, 1, 0)$ . It does, however, span $R^2$ . (when interpreted as a subset of $R^3$ ).

The empty set is a spanning set of ${ (0,0,0) \}$ , since the empty set is a subset of all possible vector spaces in $R^3$ , and ${ (0,0,0) \}$ is the intersection of all of these vector spaces.

The set of functions $x^n$ where $n$ is a non-negative integer spans the space of polynomials.

3 Theorems

Theorem 1

The subspace spanned be a non-empty subset $S$ of a vector space $V$ is the set of all linear combinations of vectors in $S$ .

This theorem is so well known that at times, it is referred to as the definition of span of a set.

Theorem 2

Every spanning set $S$ of a vector space $V$ must contain at least as many elements as any linearly independent set of vectors from $V$ .

Theorem 3

Let $V$ be a finite-dimensional vector space. Any set of vectors that spans $V$ can be reduced to a basis for $V$ , by discarding vectors if necessary (i.e., if there are linearly dependent vectors in the set). If the axiom of choice holds, this is true without the assumption that $V$ has finite dimension.