Linear subspace

In mathematics, and more specifically in linear algebra, a linear subspace, also known as a vector subspace[1][2] is a vector space that is a subset of some larger vector space. A linear subspace is usually simply called a subspace when the context serves to distinguish it from other types of subspaces.

One-dimensional subspaces in the two-dimensional vector space over the finite field F5. The origin (0, 0), marked with green circles, belongs to any of six 1-subspaces, while each of 24 remaining points belongs to exactly one; a property which holds for 1-subspaces over any field and in all dimensions. All F5^2 (i.e. a 5 × 5 square) is pictured four times for a better visualization

Definition

If V is a vector space over a field K and if W is a subset of V, then W is a subspace of V if under the operations of V, W is a vector space over K. Equivalently, a nonempty subset W is a subspace of V if, whenever w₁, w₂ are elements of W and α, β are elements of K, it follows that αw₁ + βw₂ is in W.[3][4][5][6][7]

As a corollary, all vector spaces are equipped with at least two subspaces: the singleton set with the zero vector and the vector space itself. These are called the trivial subspaces of the vector space.[8]

Examples

Example I

Let the field K be the set R of real numbers, and let the vector space V be the real coordinate space R³. Take W to be the set of all vectors in V whose last component is 0. Then W is a subspace of V.

Proof:

1. Given u and v in W, then they can be expressed as u = (u₁, u₂, 0) and v = (v₁, v₂, 0). Then u + v = (u₁+v₁, u₂+v₂, 0+0) = (u₁+v₁, u₂+v₂, 0). Thus, u + v is an element of W, too.
2. Given u in W and a scalar c in R, if u = (u₁, u₂, 0) again, then cu = (cu₁, cu₂, c0) = (cu₁, cu₂,0). Thus, cu is an element of W too.

Example II

Let the field be R again, but now let the vector space V be the Cartesian plane R². Take W to be the set of points (x, y) of R² such that x = y. Then W is a subspace of R².

Example II Illustrated

Proof:

1. Let p = (p₁, p₂) and q = (q₁, q₂) be elements of W, that is, points in the plane such that p₁ = p₂ and q₁ = q₂. Then p + q = (p₁+q₁, p₂+q₂); since p₁ = p₂ and q₁ = q₂, then p₁ + q₁ = p₂ + q₂, so p + q is an element of W.
2. Let p = (p₁, p₂) be an element of W, that is, a point in the plane such that p₁ = p₂, and let c be a scalar in R. Then cp = (cp₁, cp₂); since p₁ = p₂, then cp₁ = cp₂, so cp is an element of W.

In general, any subset of the real coordinate space Rⁿ that is defined by a system of homogeneous linear equations will yield a subspace. (The equation in example I was z = 0, and the equation in example II was x = y.) Geometrically, these subspaces are points, lines, planes and spaces that pass through the point 0.

Example III

Again take the field to be R, but now let the vector space V be the set R^R of all functions from R to R. Let C(R) be the subset consisting of continuous functions. Then C(R) is a subspace of R^R.

Proof:

1. We know from calculus that 0 ∈ C(R) ⊂ R^R.
2. We know from calculus that the sum of continuous functions is continuous.
3. Again, we know from calculus that the product of a continuous function and a number is continuous.

Example IV

Keep the same field and vector space as before, but now consider the set Diff(R) of all differentiable functions. The same sort of argument as before shows that this is a subspace too.

Examples that extend these themes are common in functional analysis.

Properties of subspaces

From the definition of vector spaces, it follows that subspaces are nonempty, and are closed under sums and under scalar multiples.[9] Equivalently, subspaces can be characterized by the property of being closed under linear combinations. That is, a nonempty set W is a subspace if and only if every linear combination of finitely many elements of W also belongs to W. The equivalent definition states that it is also equivalent to consider linear combinations of two elements at a time.

In a topological vector space X, a subspace W need not be topologically closed, but a finite-dimensional subspace is always closed.[10] The same is true for subspaces of finite codimension (i.e., subspaces determined by a finite number of continuous linear functionals).

Descriptions

Descriptions of subspaces include the solution set to a homogeneous system of linear equations, the subset of Euclidean space described by a system of homogeneous linear parametric equations, the span of a collection of vectors, and the null space, column space, and row space of a matrix. Geometrically (especially over the field of real numbers and its subfields), a subspace is a flat in an n-space that passes through the origin.

A natural description of a 1-subspace is the scalar multiplication of one non-zero vector v to all possible scalar values. 1-subspaces specified by two vectors are equal if and only if one vector can be obtained from another with scalar multiplication:

${\displaystyle \exists c\in K:\mathbf {v} '=c\mathbf {v} {\text{ (or }}\mathbf {v} ={\frac {1}{c}}\mathbf {v} '{\text{)}}}$

This idea is generalized for higher dimensions with linear span, but criteria for equality of k-spaces specified by sets of k vectors are not so simple.

A dual description is provided with linear functionals (usually implemented as linear equations). One non-zero linear functional F specifies its kernel subspace F = 0 of codimension 1. Subspaces of codimension 1 specified by two linear functionals are equal, if and only if one functional can be obtained from another with scalar multiplication (in the dual space):

${\displaystyle \exists c\in K:\mathbf {F} '=c\mathbf {F} {\text{ (or }}\mathbf {F} ={\frac {1}{c}}\mathbf {F} '{\text{)}}}$

It is generalized for higher codimensions with a system of equations. The following two subsections will present this latter description in details, and the remaining four subsections further describe the idea of linear span.

Systems of linear equations

The solution set to any homogeneous system of linear equations with n variables is a subspace in the coordinate space Kⁿ:

${\displaystyle \left\{\left[\!\!{\begin{array}{c}x_{1}\\x_{2}\\\vdots \\x_{n}\end{array}}\!\!\right]\in K^{n}:{\begin{alignedat}{6}a_{11}x_{1}&&\;+\;&&a_{12}x_{2}&&\;+\cdots +\;&&a_{1n}x_{n}&&\;=0&\\a_{21}x_{1}&&\;+\;&&a_{22}x_{2}&&\;+\cdots +\;&&a_{2n}x_{n}&&\;=0&\\&&&&&&&&&&\vdots \quad &\\a_{m1}x_{1}&&\;+\;&&a_{m2}x_{2}&&\;+\cdots +\;&&a_{mn}x_{n}&&\;=0&\end{alignedat}}\right\}.}$

For example, the set of all vectors (x, y, z) (over real or rational numbers) satisfying the equations

${\displaystyle x+3y+2z=0\;\;\;\;{\text{and}}\;\;\;\;2x-4y+5z=0}$

is a one-dimensional subspace. More generally, that is to say that given a set of n independent functions, the dimension of the subspace in K^k will be the dimension of the null set of A, the composite matrix of the n functions.

Null space of a matrix

In a finite-dimensional space, a homogeneous system of linear equations can be written as a single matrix equation:

${\displaystyle A\mathbf {x} =\mathbf {0} .}$

The set of solutions to this equation is known as the null space of the matrix. For example, the subspace described above is the null space of the matrix

${\displaystyle A=\left[{\begin{alignedat}{3}1&&3&&2&\\2&&\;\;-4&&\;\;\;\;5&\end{alignedat}}\,\right]{\text{.}}}$

Every subspace of Kⁿ can be described as the null space of some matrix (see § Algorithmsbelow for more).

Linear parametric equations

The subset of Kⁿ described by a system of homogeneous linear parametric equations is a subspace:

${\displaystyle \left\{\left[\!\!{\begin{array}{c}x_{1}\\x_{2}\\\vdots \\x_{n}\end{array}}\!\!\right]\in K^{n}:{\begin{alignedat}{7}x_{1}&&\;=\;&&a_{11}t_{1}&&\;+\;&&a_{12}t_{2}&&\;+\cdots +\;&&a_{1m}t_{m}&\\x_{2}&&\;=\;&&a_{21}t_{1}&&\;+\;&&a_{22}t_{2}&&\;+\cdots +\;&&a_{2m}t_{m}&\\&&\vdots \;\;&&&&&&&&&&&\\x_{n}&&\;=\;&&a_{n1}t_{1}&&\;+\;&&a_{n2}t_{2}&&\;+\cdots +\;&&a_{nm}t_{m}&\\\end{alignedat}}{\text{ for some }}t_{1},\ldots ,t_{m}\in K\right\}.}$

For example, the set of all vectors (x, y, z) parameterized by the equations

${\displaystyle x=2t_{1}+3t_{2},\;\;\;\;y=5t_{1}-4t_{2},\;\;\;\;{\text{and}}\;\;\;\;z=-t_{1}+2t_{2}}$

is a two-dimensional subspace of K³, if K is a number field (such as real or rational numbers).[11]

Span of vectors

In linear algebra, the system of parametric equations can be written as a single vector equation:

${\displaystyle {\begin{bmatrix}x\\y\\z\end{bmatrix}}\;=\;t_{1}\!{\begin{bmatrix}2\\5\\-1\end{bmatrix}}+t_{2}\!{\begin{bmatrix}3\\-4\\2\end{bmatrix}}.}$

The expression on the right is called a linear combination of the vectors (2, 5, −1) and (3, −4, 2). These two vectors are said to span the resulting subspace.

In general, a linear combination of vectors v₁, v₂, ... , v_k is any vector of the form

${\displaystyle t_{1}\mathbf {v} _{1}+\cdots +t_{k}\mathbf {v} _{k}.}$

The set of all possible linear combinations is called the span:

${\displaystyle {\text{Span}}\{\mathbf {v} _{1},\ldots ,\mathbf {v} _{k}\}=\left\{t_{1}\mathbf {v} _{1}+\cdots +t_{k}\mathbf {v} _{k}:t_{1},\ldots ,t_{k}\in K\right\}.}$

If the vectors v₁, ... , v_k have n components, then their span is a subspace of Kⁿ. Geometrically, the span is the flat through the origin in n-dimensional space determined by the points v₁, ... , v_k.

Example

The xz-plane in R³ can be parameterized by the equations

${\displaystyle x=t_{1},\;\;\;y=0,\;\;\;z=t_{2}.}$

As a subspace, the xz-plane is spanned by the vectors (1, 0, 0) and (0, 0, 1). Every vector in the xz-plane can be written as a linear combination of these two:

${\displaystyle (t_{1},0,t_{2})=t_{1}(1,0,0)+t_{2}(0,0,1){\text{.}}}$

Geometrically, this corresponds to the fact that every point on the xz-plane can be reached from the origin by first moving some distance in the direction of (1, 0, 0) and then moving some distance in the direction of (0, 0, 1).

Column space and row space

A system of linear parametric equations in a finite-dimensional space can also be written as a single matrix equation:

${\displaystyle \mathbf {x} =A\mathbf {t} \;\;\;\;{\text{where}}\;\;\;\;A=\left[{\begin{alignedat}{2}2&&3&\\5&&\;\;-4&\\-1&&2&\end{alignedat}}\,\right]{\text{.}}}$

In this case, the subspace consists of all possible values of the vector x. In linear algebra, this subspace is known as the column space (or image) of the matrix A. It is precisely the subspace of Kⁿ spanned by the column vectors of A.

The row space of a matrix is the subspace spanned by its row vectors. The row space is interesting because it is the orthogonal complement of the null space (see below).

Independence, basis, and dimension

The vectors u and v are a basis for this two-dimensional subspace of R³.

In general, a subspace of Kⁿ determined by k parameters (or spanned by k vectors) has dimension k. However, there are exceptions to this rule. For example, the subspace of K³ spanned by the three vectors (1, 0, 0), (0, 0, 1), and (2, 0, 3) is just the xz-plane, with each point on the plane described by infinitely many different values of t₁, t₂, t₃.

In general, vectors v₁, ... , v_k are called linearly independent if

${\displaystyle t_{1}\mathbf {v} _{1}+\cdots +t_{k}\mathbf {v} _{k}\;\neq \;u_{1}\mathbf {v} _{1}+\cdots +u_{k}\mathbf {v} _{k}}$

for (t₁, t₂, ... , t_k) ≠ (u₁, u₂, ... , u_k).[12] If v₁, ..., v_k are linearly independent, then the coordinates t₁, ..., t_k 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 for more).

Example

Let S be the subspace of R⁴ defined by the equations

${\displaystyle x_{1}=2x_{2}\;\;\;\;{\text{and}}\;\;\;\;x_{3}=5x_{4}.}$

Then the vectors (2, 1, 0, 0) and (0, 0, 5, 1) are a basis for S. In particular, every vector that satisfies the above equations can be written uniquely as a linear combination of the two basis vectors:

${\displaystyle (2t_{1},t_{1},5t_{2},t_{2})=t_{1}(2,1,0,0)+t_{2}(0,0,5,1).}$

The subspace S is two-dimensional. Geometrically, it is the plane in R⁴ passing through the points (0, 0, 0, 0), (2, 1, 0, 0), and (0, 0, 5, 1).

Operations and relations on subspaces

Inclusion

The set-theoretical inclusion binary relation specifies a partial order on the set of all subspaces (of any dimension).

A subspace cannot lie in any subspace of lesser dimension. If dim U = k, a finite number, and U ⊂ W, then dim W = k if and only if U = W.

Intersection

In R³, the intersection of two distinct two-dimensional subspaces is one-dimensional

Given subspaces U and W of a vector space V, then their intersection U ∩ W := {v ∈ V : v is an element of both U and W} is also a subspace of V.[13]

Proof:

1. Let v and w be elements of U ∩ W. Then v and w belong to both U and W. Because U is a subspace, then v + w belongs to U. Similarly, since W is a subspace, then v + w belongs to W. Thus, v + w belongs to U ∩ W.
2. Let v belong to U ∩ W, and let c be a scalar. Then v belongs to both U and W. Since U and W are subspaces, cv belongs to both U and W.
3. Since U and W are vector spaces, then 0 belongs to both sets. Thus, 0 belongs to U ∩ W.

For every vector space V, the set {0} and V itself are subspaces of V.[14][8]

Sum

If U and W are subspaces, their sum is the subspace

${\displaystyle U+W=\left\{\mathbf {u} +\mathbf {w} \colon \mathbf {u} \in U,\mathbf {w} \in W\right\}.}$[15][16]

For example, the sum of two lines is the plane that contains them both. The dimension of the sum satisfies the inequality

${\displaystyle \max(\dim U,\dim W)\leq \dim(U+W)\leq \dim(U)+\dim(W).}$

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 by the following equation:

${\displaystyle \dim(U+W)=\dim(U)+\dim(W)-\dim(U\cap W).}$[17]

Lattice of subspaces

The operations intersection and sum make the set of all subspaces a bounded modular 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.

Orthogonal complements

If V is an inner product space and N is a subset of V, then the orthogonal complement of N, denoted ${\displaystyle N^{\bot }}$,[16] is again a subspace.[18] If V is finite-dimensional and N is a subspace, then the dimensions of N and ${\displaystyle N^{\bot }}$ satisfy the complementation relationship dim(N) + dim(N^⊥) = dim(V).[19] Moreover, no vector is orthogonal to itself, so ${\displaystyle N\cap N^{\perp }=\{0\}}$ and V is the direct sum of N and ${\displaystyle N^{\bot }}$.[20] Applying orthogonal complements twice returns the original subspace: ${\displaystyle (N^{\bot })^{\bot }=N}$ for every subspace N.[21]

This operation, understood as negation (¬), makes the lattice of subspaces a (possibly infinite) orthocomplemented lattice (although not a distributive lattice).

In spaces with other bilinear forms, some but not all of these results still hold. In pseudo-Euclidean spaces and symplectic vector spaces, for example, orthogonal complements exist. However, these spaces may have null vectors that are orthogonal to themselves, and consequently there exist subspaces N such that ${\displaystyle N\cap N^{\bot }\neq \{0\}}$. As a result, this operation does not turn the lattice of subspaces into a Boolean algebra (nor a Heyting algebra).

Algorithms

Most algorithms for dealing with subspaces involve row reduction. This is the process of applying elementary row operations to a matrix, until it reaches either row echelon form or reduced row echelon form. Row reduction has the following important properties:

1. The reduced matrix has the same null space as the original.
2. Row reduction does not change the span of the row vectors, i.e. the reduced matrix has the same row space as the original.
3. Row reduction does not affect the linear dependence of the column vectors.

Basis for a row space

Input An m × n matrix A.

Output A basis for the row space of A.

1. Use elementary row operations to put A into row echelon form.
2. The nonzero rows of the echelon form are a basis for the row space of A.

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ⁿ are equal.

Subspace membership

Input A basis {b₁, b₂, ..., b_k} for a subspace S of Kⁿ, and a vector v with n components.

Output Determines whether v is an element of S

1. Create a (k + 1) × n matrix A whose rows are the vectors b₁, ... , b_k and v.
2. Use elementary row operations to put A into row echelon form.
3. If the echelon form has a row of zeroes, then the vectors {b₁, ..., b_k, v} are linearly dependent, and therefore v ∈ S.

Basis for a column space

Input An m × n matrix A

Output A basis for the column space of A

1. Use elementary row operations to put A into row echelon form.
2. Determine which columns of the echelon form have pivots. The corresponding columns of the original matrix are a basis for the column space.

See the article on column space for an example.

This produces a basis for the column space that is a subset of the original column vectors. It works because the columns with pivots are a basis for the column space of the echelon form, and row reduction does not change the linear dependence relationships between the columns.

Coordinates for a vector

Input A basis {b₁, b₂, ..., b_k} for a subspace S of Kⁿ, and a vector v ∈ S

Output Numbers t₁, t₂, ..., t_k such that v = t₁b₁ + ··· + t_kb_k

1. Create an augmented matrix A whose columns are b₁,...,b_k , with the last column being v.
2. Use elementary row operations to put A into reduced row echelon form.
3. Express the final column of the reduced echelon form as a linear combination of the first k columns. The coefficients used are the desired numbers t₁, t₂, ..., t_k. (These should be precisely the first k entries in the final column of the reduced echelon form.)

If the final column of the reduced row echelon form contains a pivot, then the input vector v does not lie in S.

Basis for a null space

Input An m × n matrix A.

Output A basis for the null space of A

1. Use elementary row operations to put A in reduced row echelon form.
2. Using the reduced row echelon form, determine which of the variables x₁, x₂, ..., x_n are free. Write equations for the dependent variables in terms of the free variables.
3. For each free variable x_i, choose a vector in the null space for which x_i = 1 and the remaining free variables are zero. The resulting collection of vectors is a basis for the null space of A.

See the article on null space for an example.

Basis for the sum and intersection of two subspaces

Given two subspaces U and W of V, a basis of the sum ${\displaystyle U+W}$ and the intersection ${\displaystyle U\cap W}$ can be calculated using the Zassenhaus algorithm

Equations for a subspace

Input A basis {b₁, b₂, ..., b_k} for a subspace S of Kⁿ

Output An (n − k) × n matrix whose null space is S.

1. Create a matrix A whose rows are b₁, b₂, ..., b_k.
2. Use elementary row operations to put A into reduced row echelon form.
3. Let c₁, c₂, ..., c_n be the columns of the reduced row echelon form. For each column without a pivot, write an equation expressing the column as a linear combination of the columns with pivots.
4. This results in a homogeneous system of n − k linear equations involving the variables c₁,...,c_n. The (n − k) × n matrix corresponding to this system is the desired matrix with nullspace S.

Example

If the reduced row echelon form of A is

${\displaystyle \left[{\begin{alignedat}{6}1&&0&&-3&&0&&2&&0\\0&&1&&5&&0&&-1&&4\\0&&0&&0&&1&&7&&-9\\0&&\;\;\;\;\;0&&\;\;\;\;\;0&&\;\;\;\;\;0&&\;\;\;\;\;0&&\;\;\;\;\;0\end{alignedat}}\,\right]}$

then the column vectors c₁, ..., c₆ satisfy the equations

${\displaystyle {\begin{alignedat}{1}\mathbf {c} _{3}&=-3\mathbf {c} _{1}+5\mathbf {c} _{2}\\\mathbf {c} _{5}&=2\mathbf {c} _{1}-\mathbf {c} _{2}+7\mathbf {c} _{4}\\\mathbf {c} _{6}&=4\mathbf {c} _{2}-9\mathbf {c} _{4}\end{alignedat}}}$

It follows that the row vectors of A satisfy the equations

${\displaystyle {\begin{alignedat}{1}x_{3}&=-3x_{1}+5x_{2}\\x_{5}&=2x_{1}-x_{2}+7x_{4}\\x_{6}&=4x_{2}-9x_{4}.\end{alignedat}}}$

In particular, the row vectors of A are a basis for the null space of the corresponding matrix.

See also

• Cyclic subspace
• Invariant subspace
• Multilinear subspace learning
• Quotient space (linear algebra)
• Signal subspace
• Subspace topology

Notes

1. Halmos, P. R. (1942). Finite-Dimensional Vector Spaces. Princeton, NJ: Princeton University Press. p. 14. ISBN 978-1-61427-281-6.
2. The term linear subspace is sometimes used for referring to flats and affine subspaces. In the case of vector spaces over the reals, linear subspaces, flats, and affine subspaces are also called linear manifolds for emphasizing that there are also manifolds.
3. Anton (2005, p. 155)
4. Beauregard & Fraleigh (1973, p. 176)
5. Herstein (1964, p. 132)
6. Kreyszig (1972, p. 200)
7. Nering (1970, p. 20)
8. "Subspace | Brilliant Math & Science Wiki". brilliant.org. Retrieved 2020-08-23.
9. Weisstein, Eric W. "Subspace". mathworld.wolfram.com. Retrieved 2020-08-23.
10. See Paul DuChateau. "Basic Facts About Hilbert Space" (PDF). Retrieved September 17, 2012. for Hilbert spaces
11. Generally, K can be any field of such characteristic that the given integer matrix has the appropriate rank in it. All fields include integers, but some integers may equal to zero in some fields.
12. This definition is often stated differently: vectors v₁, ..., v_k are linearly independent if t₁v₁ + ··· + t_kv_k ≠ 0 for (t₁, t₂, ..., t_k) ≠ (0, 0, ..., 0). The two definitions are equivalent.
13. Nering (1970, p. 21)
14. Nering (1970, p. 20)
15. Nering (1970, p. 21)
16. "Comprehensive List of Algebra Symbols". Math Vault. 2020-03-25. Retrieved 2020-08-23.
17. Nering (1970, p. 22)
18. Axler (2015), 6.46.
19. Axler (2015), 6.50.
20. Axler (2015), 6.47.
21. Axler (2015), 6.51.

Textbooks

• Anton, Howard (2005), Elementary Linear Algebra (Applications Version) (9th ed.), Wiley International
• Axler, Sheldon Jay (2015), Linear Algebra Done Right (3rd ed.), Springer-Verlag, ISBN 978-3-319-11079-0
• Beauregard, Raymond A.; Fraleigh, John B. (1973), A First Course In Linear Algebra: with Optional Introduction to Groups, Rings, and Fields, Boston: Houghton Mifflin Company, ISBN 0-395-14017-X
• Herstein, I. N. (1964), Topics In Algebra, Waltham: Blaisdell Publishing Company, ISBN 978-1114541016
• Kreyszig, Erwin (1972), Advanced Engineering Mathematics (3rd ed.), New York: Wiley, ISBN 0-471-50728-8
• Lay, David C. (August 22, 2005), Linear Algebra and Its Applications (3rd ed.), Addison Wesley, ISBN 978-0-321-28713-7
• Leon, Steven J. (2006), Linear Algebra With Applications (7th ed.), Pearson Prentice Hall
• Meyer, Carl D. (February 15, 2001), Matrix Analysis and Applied Linear Algebra, Society for Industrial and Applied Mathematics (SIAM), ISBN 978-0-89871-454-8, archived from the original on March 1, 2001
• Nering, Evar D. (1970), Linear Algebra and Matrix Theory (2nd ed.), New York: Wiley, LCCN 76091646
• Poole, David (2006), Linear Algebra: A Modern Introduction (2nd ed.), Brooks/Cole, ISBN 0-534-99845-3

External links

• Gilbert Strang, MIT Linear Algebra Lecture on the Four Fundamental Subspaces at Google Video, from MIT OpenCourseWare