In the plane and the plane each have dimension two, and adding vectors from the two planes reaches every vector of the space. Yet the result has dimension three, not four. The missing dimension is the line the planes share, which is counted once in each plane. This lesson defines sums and intersections of subspaces, proves the formula that corrects the double count, and gives a second proof through the product of two spaces.
Key terms
Sum of subspaces
Definition Let and be subspaces of a vector space over , where is or . Their sum is
It is a subspace of . It contains , and a linear combination of two of its vectors regroups as
a vector of plus a vector of . The sum is the smallest subspace of that contains both and . If and are spanned by two lists, then is spanned by the two lists together. When and share a nonzero vector , every vector of has more than one decomposition, since .
In plain words The sum collects every vector you can build by taking one piece from each subspace and adding the pieces. It combines directions, so it is usually larger than either subspace alone.
Example In let and . Every vector splits as
so . For instance lies in the sum but in neither plane. The split is not unique, since gives the same vector for every real .
Intersection of subspaces
Definition For subspaces and of a vector space over , the intersection is the set of vectors that lie in both and . It is a subspace of . It contains , and if and lie in both subspaces, then so does every combination , because each subspace is closed under linear combinations. It is the largest subspace contained in both and . When the subspaces are described by equations, the intersection is found by imposing all the equations at once.
In plain words The intersection is the overlap, the directions the two subspaces have in common.
Example For the planes and in , a common vector has and , so is the -axis, spanned by , with dimension . This shared line is what lets the split above slide, since the parameter moves the vector from one summand to the other.
Dimension formula for a sum
Definition Let and be finite-dimensional subspaces of a vector space over . Then is finite-dimensional and
For the proof, choose a basis of . Extend it to a basis of , and separately to a basis of . The combined list of the , the and the spans , since any expands in it. To show independence, suppose
The vector lies in and equals , which lies in . So it lies in and equals for some scalars . Then , and independence of the basis of gives every . The original relation now involves only the basis of , so every and is too. Counting gives . The argument uses no angles or perpendicularity, so it holds over and and for spaces of functions or matrices alike.
In plain words Adding the two dimensions counts every shared direction twice, once in each subspace. Subtracting the dimension of the overlap corrects the count. Starting from a basis of the overlap is what makes the proof work, because two unrelated bases joined together hide the overlap inside a dependence.
Example Let and in . Imposing both equations gives and , so . Extend this to the basis of and to the basis of . The combination
is zero only when , then , then . So the three vectors form a basis of , and .
Union of subspaces
Definition The union of two subspaces of a vector space over is the set of vectors that lie in at least one of them. It is a subspace exactly when one of the subspaces contains the other. If , the union is . If neither contains the other, pick outside and outside . Were in , then would be in , and were it in , then would be in . Both are false, so lies outside and the union is not closed under addition. The sum is the span of , the smallest subspace containing it.
In plain words The union only collects vectors that are already in one subspace or the other. It never adds them, so unless one subspace contains the other, some sums of its members escape it.
Example With and as above, the vector lies in but not in , and lies in but not in . Their sum has coordinate sum and third coordinate , so it lies in neither plane. The union is not a subspace, although the sum is.
Product of vector spaces
Definition Let and be vector spaces over the same field . Their product , also called their external product, is the set of ordered pairs with and , with the componentwise operations
It is a vector space over with zero vector . If and are finite-dimensional with bases and , the pairs form a basis. They span because each component expands in its own basis, and a zero combination forces both lists of coefficients to vanish. So
even when and are overlapping subspaces of one space. For finite-dimensional subspaces and of , the addition map from onto is linear and surjective. If , then lies in both subspaces, so the kernel of is , and is an isomorphism from onto it. Rank-nullity for then gives the dimension formula a second time.
In plain words A pair remembers which subspace supplied each piece, while a sum forgets it. Along the overlap a piece can move from one slot to the other without changing the sum, and that freedom is the dimension the formula subtracts.
Example Take the planes and in . The product has dimension , even though both planes sit inside . The addition map onto has as kernel the pairs with , a space of dimension , and rank-nullity gives .
Check yourself
- Two subspaces and of both have dimension . Can their intersection be ?
Show the answer
No. The sum is a subspace of , so its dimension is at most , and the dimension formula gives
The bound is attained. For the standard basis of , the subspaces and meet in the line spanned by .
- Over , let and , where is the space of polynomials of degree at most two, including the zero polynomial. Find and . Is a subspace?
Show the answer
Evaluation at is a surjective linear map from to with kernel , so rank-nullity gives , and likewise . A polynomial of degree at most two that vanishes at both and is a multiple of , so has dimension . The formula gives , so .
The union is not a subspace. The polynomial lies in but not in , and lies in but not in . Their sum takes the value at and at , so it lies in neither.
- Let be the line in spanned by . Find , and the kernel of the addition map from onto .
Show the answer
The product has dimension , with basis and . The sum is itself, of dimension , because is closed under addition. The addition map sends to , so its kernel is , the line spanned by , of dimension . Rank-nullity checks out as , matching . The product is not the sum. The pairs and are different elements of with the same sum .