Professional Documents
Culture Documents
In linear algebra and related elds of mathematics, a linear subspace (or vector subspace) is a vector space that
is a subset of some other (higher-dimension) vector space.
A linear subspace is usually called simply a subspace when
the context serves to distinguish it from other kinds of
subspaces.
whenever w is, and it follows that W is closed under subtraction as well. Since W is nonempty, there is an element
x in W, and x x = 0 is in W, so property 1 is satised.
One can also argue that since W is nonempty, there is an
element x in W, and 0 is in the eld K so 0x = 0 and
therefore property 1 is satised.
Proof: Firstly, property 1 ensures W is nonempty. Looking at the denition of a vector space, we see that properties 2 and 3 above assure closure of W under addition
2. Let p = (p1 , p2 ) be an element of W, that is, a point
and scalar multiplication, so the vector space operations
in the plane such that p1 = p2 , and let c be a scalar
are well dened. Since elements of W are necessarily elin R. Then cp = (cp1 , cp2 ); since p1 = p2 , then cp1
ements of V, axioms 1, 2 and 58 of a vector space are
= cp2 , so cp is an element of W.
satised. By the closure of W under scalar multiplication
(specically by 0 and 1), the vector spaces denitional In general, any subset of the real coordinate space Rn that
axiom identity element of addition and axiom inverse el- is dened by a system of homogeneous linear equations
ement of addition are satised.
will yield a subspace. (The equation in example I was z =
Conversely, if W is a subspace of V, then W is itself a 0, and the equation in example II was x = y.) Geometrivector space under the operations induced by V, so prop- cally, these subspaces are points, lines, planes, and so on,
erties 2 and 3 are satised. By property 3, w is in W that pass through the point 0.
1
4 DESCRIPTIONS
2.1
c K : F = cF (or F =
1
F)
c
Properties of subspaces
x2
.
..
..
..
..
xn
Descriptions
4.5
[
A=
3
Example The xz-plane in R3 can be parameterized by
the equations
1 3
2 4
2
.
5
x = t1 , y = 0, z = t2 .
4.3
1
Geometrically, this
corresponds to the fact that
x 2
.
..
.
.
.
in the direction of
(1, 0, 0) and then moving
xn
x = 2t1 +3t2 ,
y = 5t1 4t2 ,
and
z = t1 +2t2
4.4
Span of vectors
x
y
z
2
3
= t1 5 + t24
1
2
where
A = 5 4 .
1 2
The expression on the right is called a linear combination The row space of a matrix is the subspace spanned by its
of the vectors (2, 5, 1) and (3, 4, 2). These two vectors row vectors. The row space is interesting because it is the
are said to span the resulting subspace.
orthogonal complement of the null space (see below).
In general, a linear combination of vectors v1 , v2 , ... ,
vk is any vector of the form
Main articles: Linear independence, Basis (linear algebra) and Dimension (vector space)
The set of all possible linear combinations is called the In general, a subspace of K n determined by k paramespan:
ters (or spanned by k vectors) has dimension k. However,
there are exceptions to this rule. For example, the subspace of K 3 spanned by the three vectors (1, 0, 0), (0, 0,
Span{v1 , . . . , vk } = {t1 v1 + + tk vk : t1 , . . . , tk K}1),
. and (2, 0, 3) is just the xz-plane, with each point on
the
plane described by innitely many dierent values of
If the vectors v1 , ... , vk have n components, then their
t
n
1, t2, t3.
span is a subspace of K . Geometrically, the span is the
t1 v1 + + tk vk .
at through the origin in n-dimensional space determined In general, vectors v1 , ... , vk are called linearly indeby the points v1 , ... , vk.
pendent if
5.2 Intersection
v
0
t1 v1 + + tk vk = u1 v1 + + uk vk
for (t 1 , t 2 , ... , tk) (u1 , u2 , ... , uk).[3] If v1 , ..., vk are
linearly independent, then the coordinates t 1 , ..., tk for a
vector in the span are uniquely determined.
A basis for a subspace S is a set of linearly independent vectors whose span is S. The number of elements
in a basis is always equal to the geometric dimension of
the subspace. Any spanning set for a subspace can be
changed into a basis by removing redundant vectors (see
algorithms, below).
Example Let S be the subspace of R4 dened by the
equations
x1 = 2x2
and
x3 = 5x4 .
Then the vectors (2, 1, 0, 0) and (0, 0, 5, 1) are a basis for S. In particular, every vector that satises the
above equations can be written uniquely as a linear
combination of the two basis vectors:
5
5.1
5.3 Sum
If U and W are subspaces, their sum is the subspace
U + W = {u + w : u U, w W } .
The set-theoretical inclusion binary relation specied a For example, the sum of two lines is the plane that conpartial order on the set of all subspaces (of any dimen- tains them both. The dimension of the sum satises the
sion).
inequality
A subspace cannot lie in any subspace of lesser dimension. If dim U = k, a nite number, and U W, then dim
max(dim U, dim W ) dim(U +W ) dim(U )+dim(W ).
W = k if and only if U = W.
6.2
Subspace membership
Here the minimum only occurs if one subspace is contained in the other, while the maximum is the most general case. The dimension of the intersection and the sum
are related:
5.4
Lattice of subspaces
5
See the article on row space for an example.
If we instead put the matrix A into reduced row echelon form, then the resulting basis for the row space is
uniquely determined. This provides an algorithm for
checking whether two row spaces are equal and, by extension, whether two subspaces of K n are equal.
Aforementioned two operations make the set of all subspaces a bounded distributive lattice, where the {0} subspace, the least element, is an identity element of the sum
operation, and the identical subspace V, the greatest element, is an identity element of the intersection operation.
5.5
Other
If V is an inner product space, then the orthogonal complement of any subspace of V is again a subspace. This
operation, understood as negation (), makes the lattice
of subspaces a (possibly innite) Boolean algebra.
In a pseudo-Euclidean space there are orthogonal complements too, but such operation does not form a Boolean 6.3 Basis for a column space
algebra (nor a Heyting algebra) because of null subspaces,
Input An m n matrix A
for which N N = N {0}. The same case presents the
Algorithms
2. Determine which columns of the echeMost algorithms for dealing with subspaces involve row
lon form have pivots. The corresponding
reduction. This is the process of applying elementary row
columns of the original matrix are a basis
operations to a matrix until it reaches either row echelon
for the column space.
form or reduced row echelon form. Row reduction has
the following important properties:
See the article on column space for an example.
1. The reduced matrix has the same null space as the This produces a basis for the column space that is a subset of the original column vectors. It works because the
original.
columns with pivots are a basis for the column space of
2. Row reduction does not change the span of the row the echelon form, and row reduction does not change the
vectors, i.e. the reduced matrix has the same row linear dependence relationships between the columns.
space as the original.
3. Row reduction does not aect the linear dependence 6.4
of the column vectors.
6.1
8 TEXTBOOKS
3. Express the nal column of the reduced
echelon form as a linear combination of
the rst k columns. The coecients used
are the desired numbers t 1 , t 2 , ..., tk.
(These should be precisely the rst k entries in the nal column of the reduced
echelon form.)
If the nal column of the reduced row echelon form contains a pivot, then the input vector v does not lie in S.
6.5
1
0
0
0
0 3
1 5
0 0
0 2 0
0 1 4
1 7 9
c3 = 3c1 + 5c2
c5 = 2c1 c2 + 7c4
c6 = 4c2 9c4
It follows that the row vectors of A satisfy the
equations
x3 = 3x1 + 5x2
x5 = 2x1 x2 + 7x4
x6 = 4x2 9x4 .
6.6
6.7
7 See also
Signal subspace
Multilinear subspace learning
Cyclic subspace
8 Textbooks
Axler, Sheldon Jay (1997), Linear Algebra Done
Right (2nd ed.), Springer-Verlag, ISBN 0-38798259-0
Lay, David C. (August 22, 2005), Linear Algebra and Its Applications (3rd ed.), Addison Wesley,
ISBN 978-0-321-28713-7
7
Meyer, Carl D. (February 15, 2001), Matrix Analysis and Applied Linear Algebra, Society for Industrial and Applied Mathematics (SIAM), ISBN 9780-89871-454-8
Poole, David (2006), Linear Algebra: A Modern
Introduction (2nd ed.), Brooks/Cole, ISBN 0-53499845-3
Anton, Howard (2005), Elementary Linear Algebra
(Applications Version) (9th ed.), Wiley International
Leon, Steven J. (2006), Linear Algebra With Applications (7th ed.), Pearson Prentice Hall
External links
Vector subspace at PlanetMath.org. .
Gilbert Strang, MIT Linear Algebra Lecture on the
Four Fundamental Subspaces at Google Video, from
MIT OpenCourseWare
10
References
11
11
11.1
11.2
Images
11.3
Content license