For a finite set of vectors in a real vector space, its span is the set of all linear combinations:
The span of the empty set is . The set is linearly independent if implies for every . It is a spanning set for if . A basis is both a linearly independent set and a spanning set.
For basis extension, start with the given linearly independent set. If it does not span , choose and adjoin it. The enlarged set remains linearly independent: a relation with would express as a linear combination of , a contradiction; if , independence of forces all other coefficients to be zero.
Repeat whenever the current span is proper. Each step increases the set's size by one, while the allowed bound says its size cannot exceed . Thus the process terminates with a linearly independent set spanning , hence a basis containing the original set. This also covers an initially empty set and the zero-dimensional vector space.
Choose a basis of , extend it to a basis of , and extend again to a basis of by adding . Define
Every member of the full basis lies in or , so the sum of vector subspaces is . If , express it in both displayed bases. Uniqueness of the coordinates in the full basis forces its and coefficients to vanish. Thus . The reverse inclusion is built into the construction, proving . This is a subspace supplement with a prescribed intersection.
For the matrix example, let
The skew-symmetric matrices are exactly , and the traceless matrices form . A suitable answer is
The matrix trace of is , so . Every real matrix has the decomposition
whose first term lies in and second in . Therefore , as required.

Articles by others on the same topic (0)

There are currently no matching articles.